找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computational Social Networks; 5th International Co Hien T. Nguyen,Vaclav Snasel Conference proceedings 2016 Springer International Publish

[復(fù)制鏈接]
樓主: CILIA
31#
發(fā)表于 2025-3-26 21:40:04 | 只看該作者
https://doi.org/10.1007/978-3-319-24397-9oc NETwork (VANET) and Online Social Networks (OSN). The application domain of VSN inherits the features of its parental VANET and OSN, providing value-added services and applications to its consumers, i.e. passengers and drivers. However, the immature infrastructure of VSN is vulnerable to security
32#
發(fā)表于 2025-3-27 01:19:00 | 只看該作者
33#
發(fā)表于 2025-3-27 08:13:02 | 只看該作者
978-3-319-42344-9Springer International Publishing Switzerland 2016
34#
發(fā)表于 2025-3-27 11:43:17 | 只看該作者
Computational Social Networks978-3-319-42345-6Series ISSN 0302-9743 Series E-ISSN 1611-3349
35#
發(fā)表于 2025-3-27 13:54:18 | 只看該作者
36#
發(fā)表于 2025-3-27 21:09:14 | 只看該作者
Complex Network Approach for Power Grids Vulnerability and Large Area Blackout,tributed and cause a large area blackout. The development of complex network theory provides a new approach for power system study especially on vulnerability and large blackout prevention. By mapping the power grid to a graph, analyze the degree and link properties, and utilizing the small-world power grid to study the behavior of blackout.
37#
發(fā)表于 2025-3-28 01:56:41 | 只看該作者
38#
發(fā)表于 2025-3-28 04:29:00 | 只看該作者
Shortest Paths on Evolving Graphs,es. The goal is to maintain a shortest path between a given pair of nodes. We propose a heuristic algorithm that takes into account time-dependent edge reliability and reduces the problem to find an edge-weighted shortest path. Our algorithm leads to higher precision and recall than those of the exi
39#
發(fā)表于 2025-3-28 09:54:27 | 只看該作者
Analysis of a Reciprocal Network Using Google+: Structural Properties and Evolution, reciprocity. Reciprocity is defined as the ratio of the number of reciprocal edges to the total number of edges in the network, and has been well studied in the literature. However, little attention is given to understand the connectivity or network form by the reciprocal edges themselves (reciproc
40#
發(fā)表于 2025-3-28 13:59:27 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-27 11:22
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
宁远县| 五河县| 大丰市| 信阳市| 英吉沙县| 建水县| 寿阳县| 两当县| 万山特区| 镇赉县| 红原县| 广昌县| 若羌县| 滨海县| 白玉县| 安康市| 沁水县| 木兰县| 安阳市| 黄石市| 咸丰县| 宁强县| 靖州| 游戏| 长白| 梁河县| 西青区| 杭锦旗| 遂昌县| 金溪县| 武夷山市| 天峨县| 安化县| 开封县| 武宁县| 清水河县| 博湖县| 荆州市| 桐庐县| 镇坪县| 蕉岭县|