標(biāo)題: Titlebook: Computational Data and Social Networks; 7th International Co Xuemin Chen,Arunabha Sen,My T. Thai Conference proceedings 2018 Springer Natur [打印本頁(yè)] 作者: 鳴叫大步走 時(shí)間: 2025-3-21 16:52
書目名稱Computational Data and Social Networks影響因子(影響力)
書目名稱Computational Data and Social Networks影響因子(影響力)學(xué)科排名
書目名稱Computational Data and Social Networks網(wǎng)絡(luò)公開度
書目名稱Computational Data and Social Networks網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Data and Social Networks被引頻次
書目名稱Computational Data and Social Networks被引頻次學(xué)科排名
書目名稱Computational Data and Social Networks年度引用
書目名稱Computational Data and Social Networks年度引用學(xué)科排名
書目名稱Computational Data and Social Networks讀者反饋
書目名稱Computational Data and Social Networks讀者反饋學(xué)科排名
作者: 冷峻 時(shí)間: 2025-3-21 23:36 作者: BALE 時(shí)間: 2025-3-22 01:35 作者: 細(xì)微的差異 時(shí)間: 2025-3-22 06:23 作者: 無目標(biāo) 時(shí)間: 2025-3-22 11:03
Cease with Bass: A Framework for Real-Time Topic Detection and Popularity Prediction Based on Long- been embedded into social network. Compared with tweet-style contents, long-text contents are better-organized and less prone to noise. However, existing methods for real-time topic detection leveraging long-textual data do not produce satisfactory performance on sensitivity and scalability, and lo作者: cruise 時(shí)間: 2025-3-22 16:36 作者: cruise 時(shí)間: 2025-3-22 19:51 作者: LAPSE 時(shí)間: 2025-3-22 21:12
A Path Planning Approach with Maximum Traffic Flow and Minimum Breakdown Probability in Complex Roa to improve road utilization for alleviating the traffic congestion. In this paper, we first propose an optimization model to improve the road utilization, which not only considers the traffic breakdown probability but also the spontaneous traffic flow. Traffic breakdown occurs during the transition作者: SUGAR 時(shí)間: 2025-3-23 05:04
Optimal Resource Allocation for Brokers in Media Cloud,sue. Media cloud has been shown to be an efficient solution to resolve the above issue, by allowing mobile social users to connect to it through a group of distributed brokers. However, as the resource (like bandwidth, servers, computing power, etc.) in media cloud is limited, how to allocate resour作者: MOAN 時(shí)間: 2025-3-23 06:27 作者: ANA 時(shí)間: 2025-3-23 11:11
Methods for Optimal Resource Allocation on Cooperative Task Scheduling in Cross-Organizational Busistance in cross-organizational business processes (COBPs). In team formation, members of a team refer to the performers with specific skills and knowledge, and accomplish various tasks by cooperation and collaboration of corresponding resource roles. The team as a whole should focus on the overall c作者: OTTER 時(shí)間: 2025-3-23 15:37 作者: 內(nèi)部 時(shí)間: 2025-3-23 19:02
Embedded Software-Define Radio for Wearable Microware Detection,ice. However, the current MWI systems require huge and expensive hardware, and complex signal calibration and present substantial challenges to the application of MWI system. For this reason, the embedded MW imaging (E-MWI) method is proposed for breast cancer detection. Firstly, the Software Define作者: Loathe 時(shí)間: 2025-3-23 23:56
Group Based Immunization Strategy on Networks with Nonlinear Infectivity,ode inoculation in the network which is exposed to nonlinear rumor propagation. In order to delimit the contagion on network the group based centrality is considered to order nodes according to their positional power and functional influence in the network. In the process of propagation dynamics, th作者: 下級(jí) 時(shí)間: 2025-3-24 03:05 作者: Cardiac 時(shí)間: 2025-3-24 10:36
User Linkage Across Anonymizd Social Networks,urance accounts, etc.). With the enhancement of laws and regulations, the difficulty of personal sensitive data acquisition is increasing. Moreover, the abnormal users called online water army often camouflage themselves to achieve specific goals. They often register false user information such as n作者: watertight, 時(shí)間: 2025-3-24 14:44 作者: Munificent 時(shí)間: 2025-3-24 15:50
,Leveraging Blockchain?to Enhance Data Privacy in IoT-Based Applications,we have developed a system model featuring a trustless access control management mechanism to ensure that users have full control over their data and can track how data are accessed by third-party services. Additionally, we propose a firmware update scheme using blockchain that helps prevent fraudul作者: 技術(shù) 時(shí)間: 2025-3-24 22:29
A Formal Model for Temporal - Spatial Event in Internet of Vehicles,owadays, formal description is becoming an effective method to describe and detect events. In this paper, we propose a temporal - spatial Petri net (TSPN) formal model which is deduced from Petri net. The rules of transition firing and marking updating are both defined in TSPN for further system ana作者: CRANK 時(shí)間: 2025-3-25 02:07 作者: 紅腫 時(shí)間: 2025-3-25 04:28
Blockchain Queue Theory,g theory of blockchain systems and provide system performance evaluation. To do this, we design a Markovian batch-service queueing system with two different service stages, which are suitable to well express the mining process in the miners pool and the building of a new blockchain. By using the mat作者: 殺死 時(shí)間: 2025-3-25 09:14
Optimal Energy Efficiency Data Dissemination Strategy Based on Optimal Stopping Theory in Mobile Neal myopic stopping rule is obtained. Finally, the optimal transmission rate thresholds at each period are solved by optimal stopping theory, and then the optimal energy efficiency data dissemination strategy based on optimal stopping theory is realized. Simulation results show that the strategy prop作者: 打谷工具 時(shí)間: 2025-3-25 12:54 作者: SPER 時(shí)間: 2025-3-25 18:51
Graph Convolutional Networks: Algorithms, Applications and Open Challenges,various problems. In this survey, we conduct a comprehensive review specifically on the emerging field of graph convolutional networks, which is one of the most prominent graph deep learning models. We first introduce two taxonomies to group the existing works based on the types of convolutions and 作者: 固執(zhí)點(diǎn)好 時(shí)間: 2025-3-25 23:26
Optimal Resource Allocation for Brokers in Media Cloud,herefore, in this paper, by assuming that accepting each task a broker can get a reward (by collecting revenues from mobile social users like online ads, etc.) and it needs pay some price (to the media cloud) for each task in the network, we concentrate on the optimization problems of when to admit 作者: Motilin 時(shí)間: 2025-3-26 01:51
Methods for Optimal Resource Allocation on Cooperative Task Scheduling in Cross-Organizational Busitabu search (TS) algorithm is utilized to address the objective function solution, which outputs the optimal solutions mapping on resource allocation strategies. Finally, experiments show that the proposed optimization model for resource allocation supporting cooperative task scheduling is more in l作者: aesthetician 時(shí)間: 2025-3-26 06:37 作者: 桉樹 時(shí)間: 2025-3-26 08:58
https://doi.org/10.1007/978-3-663-05493-1stages. Finally, we evaluate proposed method by simulations on synthetic and real-life social networks. Furthermore, we also compare with other heuristic methods such as Out-Degree, Betweenness Centrality and PageRank. Experimental results show that our method is superior to comparison approaches.作者: 身體萌芽 時(shí)間: 2025-3-26 13:34 作者: arterioles 時(shí)間: 2025-3-26 19:57
,Hei?luft-Sterilisationen mit ruhender Luft,al myopic stopping rule is obtained. Finally, the optimal transmission rate thresholds at each period are solved by optimal stopping theory, and then the optimal energy efficiency data dissemination strategy based on optimal stopping theory is realized. Simulation results show that the strategy prop作者: 債務(wù) 時(shí)間: 2025-3-27 00:10 作者: Brocas-Area 時(shí)間: 2025-3-27 03:15 作者: abreast 時(shí)間: 2025-3-27 08:57 作者: 有毛就脫毛 時(shí)間: 2025-3-27 09:39 作者: Incisor 時(shí)間: 2025-3-27 17:36
,Sternbilder und überliefertes Wissen, the studied networks are anonymized, where no user profile or sensitive data is available, and (3) the need of scalable algorithms for user linkage task in large-scale social nateworks, and (4) users in social network are interrelated. To resolve these challenges, a noval user linkage framework bas作者: spondylosis 時(shí)間: 2025-3-27 18:18
Computational Data and Social Networks978-3-030-04648-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Forsake 時(shí)間: 2025-3-27 21:56
https://doi.org/10.1007/978-3-663-05493-1ily life. These social networks not only help users stay in?touch with family and friends, but also keep abreast of breaking news and emerging contents. However, in some scenarios, we need to take measures to control or limit the spread of negative information such as rumors. In this paper, we first作者: Accolade 時(shí)間: 2025-3-28 03:00
,Hei?luft-Sterilisatoren mit Kreislauf,a set of . seed users on a social network to maximize the expected number of influenced nodes. However, most of related works consider only one player without competitors. In this paper, we investigate the Budgeted Competitive Influence Maximization (.) problem within limited budget and time constra作者: Lacunar-Stroke 時(shí)間: 2025-3-28 08:37 作者: 星星 時(shí)間: 2025-3-28 12:45 作者: constitutional 時(shí)間: 2025-3-28 15:16 作者: 巧思 時(shí)間: 2025-3-28 20:28
https://doi.org/10.1007/978-3-642-96013-0 to the imbalance of data, fraud detection has always been tricky. In our previous work, we proposed a method of dealing with the class imbalance problem based on stacking ensemble learning and inverse random undersampling method (SIRUS). First, the inverse random undersampling method is used to gen作者: COW 時(shí)間: 2025-3-28 23:57 作者: Indicative 時(shí)間: 2025-3-29 05:37 作者: 多嘴多舌 時(shí)間: 2025-3-29 08:59
A.G. Abdul-Ghani Al-Baali,Mohammed M. Faridsue. Media cloud has been shown to be an efficient solution to resolve the above issue, by allowing mobile social users to connect to it through a group of distributed brokers. However, as the resource (like bandwidth, servers, computing power, etc.) in media cloud is limited, how to allocate resour作者: CULP 時(shí)間: 2025-3-29 14:19 作者: filicide 時(shí)間: 2025-3-29 16:17 作者: 新奇 時(shí)間: 2025-3-29 20:12
Sir Alec Cairncross,Barry Eichengreention in case of traffic congestion etc. In this paper, we propose a vehicular collision avoidance routing algorithm based on V2V communication to deal with the issue of collision of vehicles in urban scenarios. We first investigate vehicular collision cases at intersection, which is influenced by st作者: 連詞 時(shí)間: 2025-3-30 01:14 作者: Default 時(shí)間: 2025-3-30 06:42
https://doi.org/10.1007/978-3-7091-9111-8ode inoculation in the network which is exposed to nonlinear rumor propagation. In order to delimit the contagion on network the group based centrality is considered to order nodes according to their positional power and functional influence in the network. In the process of propagation dynamics, th作者: 場(chǎng)所 時(shí)間: 2025-3-30 09:12 作者: scrape 時(shí)間: 2025-3-30 16:18 作者: 合群 時(shí)間: 2025-3-30 18:35 作者: semble 時(shí)間: 2025-3-30 21:53 作者: STANT 時(shí)間: 2025-3-31 02:04 作者: Ligneous 時(shí)間: 2025-3-31 08:24
https://doi.org/10.1007/978-3-030-04648-4complex networks; online social networks; network science; big data; blockchain; algorithms; cybersecurity作者: uveitis 時(shí)間: 2025-3-31 10:25 作者: 一夫一妻制 時(shí)間: 2025-3-31 15:34
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232226.jpg作者: Mast-Cell 時(shí)間: 2025-3-31 19:35
https://doi.org/10.1007/978-3-642-96013-0ner. We apply SIRUS to detect the credit card fraud in this paper. Our dataset comes from a financial company in China. A variety of measurements such as recall, precision, accuracy, ., and . to illustrate the effectiveness of our method in fraud detection.
