標題: Titlebook: Collaborate Computing: Networking, Applications and Worksharing; 12th International C Shangguang Wang,Ao Zhou Conference proceedings 2017 I [打印本頁] 作者: mortality 時間: 2025-3-21 17:01
書目名稱Collaborate Computing: Networking, Applications and Worksharing影響因子(影響力)
書目名稱Collaborate Computing: Networking, Applications and Worksharing影響因子(影響力)學科排名
書目名稱Collaborate Computing: Networking, Applications and Worksharing網絡公開度
書目名稱Collaborate Computing: Networking, Applications and Worksharing網絡公開度學科排名
書目名稱Collaborate Computing: Networking, Applications and Worksharing被引頻次
書目名稱Collaborate Computing: Networking, Applications and Worksharing被引頻次學科排名
書目名稱Collaborate Computing: Networking, Applications and Worksharing年度引用
書目名稱Collaborate Computing: Networking, Applications and Worksharing年度引用學科排名
書目名稱Collaborate Computing: Networking, Applications and Worksharing讀者反饋
書目名稱Collaborate Computing: Networking, Applications and Worksharing讀者反饋學科排名
作者: 慌張 時間: 2025-3-21 21:48 作者: 承認 時間: 2025-3-22 03:28
Parallel Seed Selection for Influence Maximization Based on ,-, Decompositionolutions, the greedy and its improvements are time-consuming. In this paper, we propose candidate shells influence maximization (.) algorithm under heat diffusion model to select seeds in parallel. We employ . algorithm (a modified algorithm of greedy) to coarsely estimate the influence spread to av作者: 休閑 時間: 2025-3-22 07:59
The Service Recommendation Problem: An Overview of Traditional and Recent Approachesand more important for describing non-functional characteristics of services. The most popular technique is the Collaborative Filtering (CF) based on QoS values. Existing few approaches for service recommendation based on CF have been studied, so we are going to do a survey of these techniques in de作者: 包裹 時間: 2025-3-22 10:08
Gaussian LDA and Word Embedding for Semantic Sparse Web Service Discoverytuation, users rely heavily on the search engine model to retrieve their expected Web services. However, due to the fact that Web services registered in API marketplaces are described in short texts, the search engine based discovery method suffers from the semantic sparsity problem, which in turn l作者: enlist 時間: 2025-3-22 16:00
Quality-Assure and Budget-Aware Task Assignment for Spatial Crowdsourcing research among academic and industry community. As participants may possess different capabilities and reliabilities, as well as the changeable locations and available time slots of both tasks and potential workers, a major challenge is how to assign spatial tasks to appropriate workers from lots o作者: enlist 時間: 2025-3-22 19:31
Collaborative Prediction Model of Disease Risk by Mining Electronic Health Recordsgitudinal properties make EHRs analysis an inherently challenge. To address this issue, this paper proposes CAPM, a Collaborative Assessment Prediction Model based on patient temporal graph representation, which relies only on a patient EHRs using ICD-10 codes to predict future disease risks. Firstl作者: Dysarthria 時間: 2025-3-22 21:18
An Adaptive Multiple Order Context Huffman Compression Algorithm Based on Markov Modelis traversed, and the character space of the data and the times that one character transfers to its neighboring character are figured out. According to the statistical results, we can calculate the one-step transition probability matrix and the multi-step transition probability matrix. When the cond作者: Texture 時間: 2025-3-23 03:40
Course Relatedness Based on Concept Graph ModelingHowever, there are few researchers that concentrate on mining the relationship between courses. In this paper, we propose a method to compare relatedness between courses based on representing courses as concept graphs. The concept graph comprises not only the semantic relationship between concepts b作者: 打包 時間: 2025-3-23 07:39
Rating Personalization Improves Accuracy: A Proportion-Based Baseline Estimate Model for Collaboratind users. However, it doesn’t consider different users’ rating criterions and results in predictions may be out of recommendation’s rating range. In this paper, we propose a novel baseline estimate model to improve the current performance, named PBEModel (Proportion-based Baseline Estimate Model), w作者: 脆弱帶來 時間: 2025-3-23 12:21 作者: 過去分詞 時間: 2025-3-23 17:23 作者: 雪上輕舟飛過 時間: 2025-3-23 21:58 作者: ironic 時間: 2025-3-23 23:29 作者: Ascendancy 時間: 2025-3-24 05:11
A More Flexible SDN Architecture Supporting Distributed Applicationsations. Unfortunately, not all the applications fit the centralized control architecture, and the centralization may even degrade the performance of these applications. Moreover, even though SDN articulates a vision for programmable networks, the OpenFlow instructions with simple match-action fields作者: PET-scan 時間: 2025-3-24 09:16 作者: concert 時間: 2025-3-24 13:27 作者: Ganglion 時間: 2025-3-24 17:08 作者: Ceramic 時間: 2025-3-24 19:38
Conference proceedings 2017 collaboration in pervasive and cloud computing environments; collaboration in data-intensive scientific discovery; collaboration in social media; big data and spatio-temporal data in collaborative environments/systems; collaboration techniques in data-intensive computing and cloud computing..作者: Permanent 時間: 2025-3-25 01:48 作者: visual-cortex 時間: 2025-3-25 04:41
Service-Oriented Computing - ICSOC 2006ment in spatial crowdsourcing while considering budget limitation. The problem is first modeled as Quality-assure and Budget-aware Task Assignment (QBTA) problem. Then two two-phase greedy algorithms are proposed. Finally, experiments are conducted to show the effectiveness and efficiency of the algorithms.作者: Mindfulness 時間: 2025-3-25 09:12
https://doi.org/10.1007/978-3-540-74974-5es in order to take action at the earliest signs. Finally, we present experimental results on a real world EHR dataset, demonstrating that CAPM performs well at capturing future disease and its onset risks.作者: 逢迎白雪 時間: 2025-3-25 14:58
Alex Norta,Walid Gaaloul,Hoa Khanh Daml privacy to geospatial stream with a new structure .. We prove the privacy and utility of . theoretically and show the improvement of utility by experimental comparison with existing approaches on real datasets.作者: 是比賽 時間: 2025-3-25 16:07
George Feuerlicht,David Hartman instructions. The distributed applications run independently in switches, and the controller is responsible for the installation and configuration of these applications. The evaluation shows the proposed architecture is able to access more local details efficiently with the centralized SDN control.作者: BIDE 時間: 2025-3-25 22:12
Parallel Seed Selection for Influence Maximization Based on ,-, Decompositionher, we use the heat diffusion model to model the influence spread. Finally, we select seeds of candidate shells in parallel by using the . algorithm. Experimental results show the effectiveness and feasibility of the proposed algorithm.作者: glisten 時間: 2025-3-26 01:43
Quality-Assure and Budget-Aware Task Assignment for Spatial Crowdsourcingment in spatial crowdsourcing while considering budget limitation. The problem is first modeled as Quality-assure and Budget-aware Task Assignment (QBTA) problem. Then two two-phase greedy algorithms are proposed. Finally, experiments are conducted to show the effectiveness and efficiency of the algorithms.作者: evasive 時間: 2025-3-26 07:10
Collaborative Prediction Model of Disease Risk by Mining Electronic Health Recordses in order to take action at the earliest signs. Finally, we present experimental results on a real world EHR dataset, demonstrating that CAPM performs well at capturing future disease and its onset risks.作者: configuration 時間: 2025-3-26 12:08 作者: 滴注 時間: 2025-3-26 16:18
A More Flexible SDN Architecture Supporting Distributed Applications instructions. The distributed applications run independently in switches, and the controller is responsible for the installation and configuration of these applications. The evaluation shows the proposed architecture is able to access more local details efficiently with the centralized SDN control.作者: optic-nerve 時間: 2025-3-26 19:53 作者: 充滿裝飾 時間: 2025-3-26 23:43
https://doi.org/10.1007/978-3-319-22885-3ternet loan business due to the unique features of individual credit data. In this paper, we propose a unified data mining framework consisting of feature transformation, feature selection and hybrid model to solve the above challenges. Extensive experiment results on realistic datasets show that our proposed framework is an effective solution.作者: Flinch 時間: 2025-3-27 04:52
Ahmed Tealeb,Ahmed Awad,Galal Galal-Edeenand enables users to retain ownership of their data. Sweets provides user authentication and access control without centralized servers. Sweets improves the data availability using an indirect replication scheme. Experimental results show that Sweets has a feasible performance over a 4G cellular network.作者: glucagon 時間: 2025-3-27 05:46 作者: cauda-equina 時間: 2025-3-27 10:38
Sweets: A Decentralized Social Networking Service Application Using Data Synchronization on Mobile Dand enables users to retain ownership of their data. Sweets provides user authentication and access control without centralized servers. Sweets improves the data availability using an indirect replication scheme. Experimental results show that Sweets has a feasible performance over a 4G cellular network.作者: Enervate 時間: 2025-3-27 14:33
Service-Oriented Computing ICSOC 2006pth. In this paper, some of the main known results relative to the Service Recommendation Problem both traditional and recent approaches are surveyed. The paper is organized as follows: (1) definition; (2) traditional approaches; (3) recent approaches; (4) conclusion.作者: 打擊 時間: 2025-3-27 21:01
Conference proceedings 2017and Worksharing, CollaborateCom 2016, held in Beijing, China, in November 2016.. The 66 papers presented were carefully reviewed and selected from 116 submissions and focus on topics such as: participatory sensing, crowdsourcing, and citizen science; architectures, protocols, and enabling technologi作者: 滋養(yǎng) 時間: 2025-3-28 00:51
The Service Recommendation Problem: An Overview of Traditional and Recent Approachespth. In this paper, some of the main known results relative to the Service Recommendation Problem both traditional and recent approaches are surveyed. The paper is organized as follows: (1) definition; (2) traditional approaches; (3) recent approaches; (4) conclusion.作者: DEAWL 時間: 2025-3-28 03:09 作者: frozen-shoulder 時間: 2025-3-28 07:34 作者: Intuitive 時間: 2025-3-28 11:10
Volker Hoyer,Katarina Stanoevska-Slabevaonalization. In order to verify this new baseline estimate, we apply it into SVD++, and propose a novel SVD++?model named PBESVD++. Experiments based on six real datasets show that the proposed PBEModel is rational and more accurate than current baseline estimate model, and the PBESVD++?has relatively higher prediction accuracy than SVD++.作者: 記憶 時間: 2025-3-28 17:24 作者: 情節(jié)劇 時間: 2025-3-28 20:01 作者: 放肆的我 時間: 2025-3-29 00:33
Adrian Mos,Adrien Gaidon,Eleonora Vigessed subsequences and the raw data. It achieves the best overall performance on the segmentation results compared with other baseline methods. Extensive experiments on all kinds of typical time series datasets have been conducted to demonstrate the advantages of our method.作者: 爭議的蘋果 時間: 2025-3-29 06:46
An Adaptive Multiple Order Context Huffman Compression Algorithm Based on Markov Modelndependent encoding unit. Improve the compression efficiency by increasing the length of the compression characters. The experimental results show that the algorithm achieves good compression efficiency.作者: superfluous 時間: 2025-3-29 10:33 作者: 環(huán)形 時間: 2025-3-29 13:42 作者: 新字 時間: 2025-3-29 16:15 作者: 民間傳說 時間: 2025-3-29 23:23 作者: muscle-fibers 時間: 2025-3-30 00:08
A Continuous Segmentation Algorithm for Streaming Time Seriesessed subsequences and the raw data. It achieves the best overall performance on the segmentation results compared with other baseline methods. Extensive experiments on all kinds of typical time series datasets have been conducted to demonstrate the advantages of our method.作者: 幸福愉悅感 時間: 2025-3-30 05:06 作者: neutralize 時間: 2025-3-30 08:40
Gaussian LDA and Word Embedding for Semantic Sparse Web Service DiscoveryWe also leverage the Gaussian LDA in service discovery, which takes continuous word distribution as the input and interprets the Web service description as a hierarchical model by its two distributions. Based on the Gaussian LDA and word embedding, we propose a Web service query and ranking approach作者: 欺騙世家 時間: 2025-3-30 14:42 作者: inferno 時間: 2025-3-30 20:23 作者: discord 時間: 2025-3-30 23:20 作者: 錢財 時間: 2025-3-31 03:52 作者: 受傷 時間: 2025-3-31 06:39
Morad Benyoucef,Ronald PringadiWe also leverage the Gaussian LDA in service discovery, which takes continuous word distribution as the input and interprets the Web service description as a hierarchical model by its two distributions. Based on the Gaussian LDA and word embedding, we propose a Web service query and ranking approach作者: 形容詞詞尾 時間: 2025-3-31 10:05
Ahmed Tealeb,Ahmed Awad,Galal Galal-Edeenensive task and memory-unintensive task for execution in parallel. The experimental results demonstrate that our algorithm can find the optimal solution among all the possible combinations. The Maximum improvement of our algorithm is 15.6%).作者: EVICT 時間: 2025-3-31 13:34
Gerald Schermann,Jürgen Cito,Philipp Leitnerently. LBDAG-DNE can find a good projection matrix, which allows neighbors belonging to the same class to be compact while neighbors belonging to different classes become separable in the subspace. Experiments on two image databases illustrate the effectiveness of the proposed approach.作者: Gentry 時間: 2025-3-31 20:55
Collaborate Computing: Networking, Applications and Worksharing12th International C作者: 傳授知識 時間: 2025-4-1 01:03
https://doi.org/10.1007/978-3-319-59288-6algorithms; artificial intelligence; cloud computing; computer networks; data security; Internet; machine 作者: 甜得發(fā)膩 時間: 2025-4-1 02:50 作者: 遺忘 時間: 2025-4-1 07:02
