標題: Titlebook: Distributed Computing and Internet Technology; 12th International C Nikolaj Bj?rner,Sanjiva Prasad,Laxmi Parida Conference proceedings 2016 [打印本頁] 作者: antibody 時間: 2025-3-21 18:47
書目名稱Distributed Computing and Internet Technology影響因子(影響力)
書目名稱Distributed Computing and Internet Technology影響因子(影響力)學(xué)科排名
書目名稱Distributed Computing and Internet Technology網(wǎng)絡(luò)公開度
書目名稱Distributed Computing and Internet Technology網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Distributed Computing and Internet Technology被引頻次
書目名稱Distributed Computing and Internet Technology被引頻次學(xué)科排名
書目名稱Distributed Computing and Internet Technology年度引用
書目名稱Distributed Computing and Internet Technology年度引用學(xué)科排名
書目名稱Distributed Computing and Internet Technology讀者反饋
書目名稱Distributed Computing and Internet Technology讀者反饋學(xué)科排名
作者: MARS 時間: 2025-3-21 22:41
Attacks in the Resource-as-a-Service (RaaS) Cloud Contextbe taken in real time by automatic agents. Does the economic angle introduce new vulnerabilities? Can old vulnerabilities be exploited on RaaS clouds from different angles? How should RaaS clouds be designed to protect them from attacks? In this survey we analyze relevant literature in view of RaaS 作者: 夸張 時間: 2025-3-22 02:32 作者: Adrenal-Glands 時間: 2025-3-22 07:57
HiRE - A Heuristic Approach for User Generated Record Extractionof their record structure, so that after the content is extracted, proper filtering mechanisms can be applied to eliminate the noises. Hence, record structure identification is an important prerequisite step for text analytics. Most of the existing record structure identification techniques search f作者: 努力趕上 時間: 2025-3-22 10:20
Optimization of Service Rate in a Discrete-Time Impatient Customer Queue Using Particle Swarm Optimibiologically inspired optimization technique mimicking the behavior of birds flocking or fish schooling is implemented to determine the optimum service rate that minimizes the total expected cost function per unit time. A potential application of the considered queueing problem in an inbound email c作者: arsenal 時間: 2025-3-22 14:02 作者: arsenal 時間: 2025-3-22 17:47
Influential Degree Heuristic for RankedReplace Algorithm in Social Networkshavani [.] proposed incorporating greedy selection in the initialization step of . algorithm of Charu Aggarwal et al. which would speed up the algorithm. We propose to improve this algorithm further by considering novel heuristic called . for selection of the initial set. The experiments are carried作者: intercede 時間: 2025-3-23 00:01 作者: 蟄伏 時間: 2025-3-23 03:22
Storage Load Control Through Meta-Scheduler Using Predictive Analyticsgabytes to Exabytes of data has led to saturation of I/O performance on the storage system. This paper provides an insight on the load controlling capability on the storage system through learning algorithms in a Grid Computing environment. Storage load control driven by meta schedulers and the effe作者: 智力高 時間: 2025-3-23 06:00 作者: 氣候 時間: 2025-3-23 10:38 作者: DRILL 時間: 2025-3-23 13:57
Long Wire Length of Midimew-Connected Mesh Networkc Modules (BM), where the BM is a 2D-mesh network and the higher level network is a midimew network. In this paper, we present the architecture of MMN and evaluate the number of long wires, length of a long wire, and the total length for the long wire of MMN, TESH, and torus networks. It is shown th作者: 帳單 時間: 2025-3-23 20:13
K-means and Wordnet Based Feature Selection Combined with Extreme Learning Machines for Text Classifn is to classify text documents into a set of pre-defined categories. But the poor quality of features selection, extremely high dimensional feature space and complexity of natural languages become the roadblock for this classification process. To address these issues, here we propose a .-means clus作者: creatine-kinase 時間: 2025-3-24 01:45 作者: 獨裁政府 時間: 2025-3-24 03:52 作者: 膽小鬼 時間: 2025-3-24 09:43 作者: 石墨 時間: 2025-3-24 10:49
HGASA: An Efficient Hybrid Technique for Optimizing Data Access in Dynamic Data Gridage. Scientific applications produce large quantity of sharable data which requires efficient handling and management. Replica selection is one of the data management techniques in grid computing and is used for selecting data from large volumes of distributed data. Replica selection is an interesti作者: Cuisine 時間: 2025-3-24 16:28 作者: gonioscopy 時間: 2025-3-24 20:20 作者: 粘土 時間: 2025-3-25 02:31 作者: 不利 時間: 2025-3-25 04:07
https://doi.org/10.1007/978-94-007-5702-8or repeating patterns to find the records. In this paper, a heuristic based approach is proposed. This method uses the implicit logical organization present in the records and outputs the record structure.作者: Aerate 時間: 2025-3-25 09:56 作者: SUGAR 時間: 2025-3-25 13:37 作者: Flu表流動 時間: 2025-3-25 18:27
https://doi.org/10.1007/978-3-030-22090-7at the proposed MMN possesses simple structure and moderate wire length. The long wire length of MMN is slightly higher than TESH network and far lower than that of 2D torus network. Overall performance suggests that, MMN is a good choice for future generation massively parallel computers.作者: Lethargic 時間: 2025-3-25 22:12
0302-9743 rnet Technology, ICDCIT 2016, held in Bhubaneswar, India, inJanuary 2016. ..The 6 fullpapers, 7 short papers and 11 poster papers presented in this volume werecarefully reviewed and selected from 129 submissions. The ICDCIT conferencefocusses on distributed computing, internet technologies, and soci作者: 洞察力 時間: 2025-3-26 00:51
Stephen Tapper,Jonathan Reynoldsconomic background. The project is implemented as a single semester undergraduate elective course, in which third year computer science students teach in schools and community centers. Here, we describe the spirit, content, and structure of the course and discuss insight we have gained over the last four years of teaching it.作者: gustation 時間: 2025-3-26 07:56
David W. Macdonald,Paul J. Johnsonfrom different angles? How should RaaS clouds be designed to protect them from attacks? In this survey we analyze relevant literature in view of RaaS cloud mechanisms and propose directions for the design of RaaS clouds.作者: 果仁 時間: 2025-3-26 10:53 作者: coddle 時間: 2025-3-26 13:28 作者: 雪崩 時間: 2025-3-26 17:33 作者: 改進 時間: 2025-3-26 23:59
A Wait-Free Stackly deleted by a . operation. This operation keeps the size of the stack in check by not allowing the size of the stack to increase beyond a factor of . as compared to the actual size. All our operations are wait-free and linearizable.作者: 無法解釋 時間: 2025-3-27 01:41 作者: ETHER 時間: 2025-3-27 06:46 作者: Compass 時間: 2025-3-27 13:08 作者: 策略 時間: 2025-3-27 16:15 作者: abracadabra 時間: 2025-3-27 19:53
Influential Degree Heuristic for RankedReplace Algorithm in Social Networks out on small as well as large data sets like DBLP and the results show that RRID and its variations perform quite well on all the data sets quite efficiently reducing the time taken and retaining, and in a few cases, obtaining much better influence spread than the original . algorithm.作者: champaign 時間: 2025-3-27 22:11 作者: output 時間: 2025-3-28 04:01 作者: 壯觀的游行 時間: 2025-3-28 06:49 作者: 殖民地 時間: 2025-3-28 14:11
The Extended Theory of Cognitive Creativitypurpose, 20-Newsgroups and DMOZ datasets have been used. The empirical results on these two benchmark datasets demonstrate the applicability, efficiency and effectiveness of our approach using ELM and ML-ELM as the classifiers over state-of-the-art classifiers.作者: 固執(zhí)點好 時間: 2025-3-28 15:24 作者: Antimicrobial 時間: 2025-3-28 20:29
K-means and Wordnet Based Feature Selection Combined with Extreme Learning Machines for Text Classifpurpose, 20-Newsgroups and DMOZ datasets have been used. The empirical results on these two benchmark datasets demonstrate the applicability, efficiency and effectiveness of our approach using ELM and ML-ELM as the classifiers over state-of-the-art classifiers.作者: 喧鬧 時間: 2025-3-29 01:24 作者: TIA742 時間: 2025-3-29 06:36
Storage Load Control Through Meta-Scheduler Using Predictive Analyticsynthetic and industry specific I/O intensive jobs have shown to have superior total completion time and total flow time compared to traditional approaches like FCFS and Backfilling. Proposed scheme prevented any down time when implemented with a live NetApp storage system.作者: RAGE 時間: 2025-3-29 09:00 作者: CANON 時間: 2025-3-29 14:41
HGASA: An Efficient Hybrid Technique for Optimizing Data Access in Dynamic Data Grid the performance of the grid. GridSim simulator is used for evaluating the performance of the proposed algorithm. The results show that the proposed algorithm, HGASA, outperforms Genetic Algorithms (GA) by 9?% and Simulated Annealing (SA) by 21?% and Ant Colony Optimization (ACO) by 50?%.作者: 許可 時間: 2025-3-29 16:57 作者: 隨意 時間: 2025-3-29 23:29
Antonino Pennisi,Alessandra Falzoneynthetic and industry specific I/O intensive jobs have shown to have superior total completion time and total flow time compared to traditional approaches like FCFS and Backfilling. Proposed scheme prevented any down time when implemented with a live NetApp storage system.作者: adequate-intake 時間: 2025-3-30 01:44 作者: 黑豹 時間: 2025-3-30 07:01
On the Biomechanics of External Fixation the performance of the grid. GridSim simulator is used for evaluating the performance of the proposed algorithm. The results show that the proposed algorithm, HGASA, outperforms Genetic Algorithms (GA) by 9?% and Simulated Annealing (SA) by 21?% and Ant Colony Optimization (ACO) by 50?%.作者: 動機 時間: 2025-3-30 10:56 作者: 尊重 時間: 2025-3-30 12:24
Richard M. Ryan,Veronika Huta,Edward L. Decibiologically inspired optimization technique mimicking the behavior of birds flocking or fish schooling is implemented to determine the optimum service rate that minimizes the total expected cost function per unit time. A potential application of the considered queueing problem in an inbound email contact center is also presented.作者: angiography 時間: 2025-3-30 19:28
Palgrave Studies in European Union Politicss, we propose a ., which provides priority in the order of I (intra coded), P (predictive coded) and B (bidirectional predictive coded) frame packets. In addition, our approach handles the expiry time of the packets as well as damaged acknowledgement of the packets/frames. We validate our approach through simulations.作者: Pessary 時間: 2025-3-30 21:12 作者: seduce 時間: 2025-3-31 01:39 作者: RAFF 時間: 2025-3-31 06:25 作者: 得罪人 時間: 2025-3-31 09:24
https://doi.org/10.1007/978-94-007-5702-8of their record structure, so that after the content is extracted, proper filtering mechanisms can be applied to eliminate the noises. Hence, record structure identification is an important prerequisite step for text analytics. Most of the existing record structure identification techniques search f
