標(biāo)題: Titlebook: Computer Networks and Intelligent Computing; 5th International Co K. R. Venugopal,L. M. Patnaik Conference proceedings 2011 Springer-Verlag [打印本頁(yè)] 作者: Constrict 時(shí)間: 2025-3-21 17:02
書目名稱Computer Networks and Intelligent Computing影響因子(影響力)
書目名稱Computer Networks and Intelligent Computing影響因子(影響力)學(xué)科排名
書目名稱Computer Networks and Intelligent Computing網(wǎng)絡(luò)公開度
書目名稱Computer Networks and Intelligent Computing網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computer Networks and Intelligent Computing被引頻次
書目名稱Computer Networks and Intelligent Computing被引頻次學(xué)科排名
書目名稱Computer Networks and Intelligent Computing年度引用
書目名稱Computer Networks and Intelligent Computing年度引用學(xué)科排名
書目名稱Computer Networks and Intelligent Computing讀者反饋
書目名稱Computer Networks and Intelligent Computing讀者反饋學(xué)科排名
作者: Legion 時(shí)間: 2025-3-21 22:19 作者: MIME 時(shí)間: 2025-3-22 00:57 作者: Enliven 時(shí)間: 2025-3-22 05:10
Test- und Prüfungsaufgaben Regelungstechnik of Neighbor of Initial Contact (NNIC) also. This model supports the occurrence of a contact between two Initial contacts if the new vertex chooses more than one initial contacts. Compared to earlier model thus leading a faster application to propagate information over social networks, this ultimate作者: hyperuricemia 時(shí)間: 2025-3-22 11:10
https://doi.org/10.1007/978-3-211-37139-8on creation of several numbers of ontology for text documents and performing ontology matching by scripting special form of ., so that the conflicts among the documents can be found. The framework developed provides better matching performance and usefulness on applying to software engineering domai作者: 易發(fā)怒 時(shí)間: 2025-3-22 13:40 作者: 易發(fā)怒 時(shí)間: 2025-3-22 18:42 作者: 別名 時(shí)間: 2025-3-22 23:37 作者: 肌肉 時(shí)間: 2025-3-23 02:27 作者: Consequence 時(shí)間: 2025-3-23 09:04
Deontic Based Ontology Matching for Conflict Resolution between Text Documentson creation of several numbers of ontology for text documents and performing ontology matching by scripting special form of ., so that the conflicts among the documents can be found. The framework developed provides better matching performance and usefulness on applying to software engineering domai作者: 項(xiàng)目 時(shí)間: 2025-3-23 13:30 作者: 惰性氣體 時(shí)間: 2025-3-23 14:26 作者: stroke 時(shí)間: 2025-3-23 21:37 作者: 帳單 時(shí)間: 2025-3-24 00:19 作者: 事情 時(shí)間: 2025-3-24 02:43 作者: 我就不公正 時(shí)間: 2025-3-24 06:56
Apriori-based Research Community Discovery in Bibliographic Databaseh collaborators. However, Bibliographic Database contains a huge number of sequential data that exhibit emergent patterns of behavior. Finding inherent regularities in data is still a very challenging task. This paper proposes a novel method to discover research community through association mining.作者: Affection 時(shí)間: 2025-3-24 13:57
Improving the Precision and Recall of Web People Search Using Hash Table Clustering improve the precision, recall and F-measure metrics of the web search engine by removing the unwanted resulting web pages and the proposed method outperforms by 15.9 percent of F-measure improvement as compared to WWW2005 algorithm.作者: MOAT 時(shí)間: 2025-3-24 15:36 作者: 慢慢沖刷 時(shí)間: 2025-3-24 20:58
Test for Dynamic Stress and Straing the concept of fuzziness into the spatial relationships existing between the anatomical structures. The utility of the association rules extracted is analyzed through the interestingness measures computed, and it is thereby concluded that the rules mined are highly relevant.作者: incarcerate 時(shí)間: 2025-3-25 02:51 作者: 暫時(shí)中止 時(shí)間: 2025-3-25 05:15
https://doi.org/10.1007/978-3-211-37139-8vides a model which adds semantic information to the Web resources at runtime. Both these proposed models process new threads which use proposed algorithms and invoked by a Web server or a Web entity like servlet.作者: intrigue 時(shí)間: 2025-3-25 09:51 作者: Immortal 時(shí)間: 2025-3-25 14:22
https://doi.org/10.1007/978-3-211-37139-8 be 100% accurate. Our algorithm probes for the accuracy among the facts to rank the web pages. Simulation results show that our approach is efficient when compared with existing Voting [1] and Truthfinder [1] algorithms with respect to the trustworthiness of the websites.作者: 愉快么 時(shí)間: 2025-3-25 18:02
Detection and Prevention of SQL Injection Attacks Using Semantic Equivalence have implemented the complete solution in ASP.NET with C# web applications using a custom written tool, SIAP, which patches the SQL Injection vulnerabilities in an existing web application by instrumenting the binaries.作者: 構(gòu)想 時(shí)間: 2025-3-25 22:36 作者: Blatant 時(shí)間: 2025-3-26 01:21
Interestingness Analysis of Semantic Association Mining in Medical Imagesg the concept of fuzziness into the spatial relationships existing between the anatomical structures. The utility of the association rules extracted is analyzed through the interestingness measures computed, and it is thereby concluded that the rules mined are highly relevant.作者: notification 時(shí)間: 2025-3-26 04:51 作者: Narcissist 時(shí)間: 2025-3-26 11:29 作者: 防御 時(shí)間: 2025-3-26 15:23 作者: Perennial長(zhǎng)期的 時(shí)間: 2025-3-26 17:43 作者: Commonwealth 時(shí)間: 2025-3-26 23:51 作者: BILL 時(shí)間: 2025-3-27 04:44
Secondary Ion Mass Spectroscopy (SIMS)ries are diverse. The proposed ensembles are simple but quite accurate. We study the performance of the proposed ensembles against the other popular ensemble techniques. The proposed ensemble method matches or outperforms Bagging, and is competitive with Adaboost.M1 and Random Forests.作者: ICLE 時(shí)間: 2025-3-27 09:21
https://doi.org/10.1007/978-3-540-71355-5takes care of .-anonymity and .-diversity to a considerable extent and in combination with the improved second and third phases of the algorithm in [5] leads to an efficient .-diversity algorithm. We also show that all the three stages of the algorithm are necessary in order to cover different situations.作者: Vaginismus 時(shí)間: 2025-3-27 13:16 作者: conduct 時(shí)間: 2025-3-27 16:18 作者: 事先無(wú)準(zhǔn)備 時(shí)間: 2025-3-27 18:48 作者: Conjuction 時(shí)間: 2025-3-27 22:07
A Novel Ensemble Method for Time Series Classificationries are diverse. The proposed ensembles are simple but quite accurate. We study the performance of the proposed ensembles against the other popular ensemble techniques. The proposed ensemble method matches or outperforms Bagging, and is competitive with Adaboost.M1 and Random Forests.作者: 低能兒 時(shí)間: 2025-3-28 05:17
An Improved ,-Diversity Anonymisation Algorithmtakes care of .-anonymity and .-diversity to a considerable extent and in combination with the improved second and third phases of the algorithm in [5] leads to an efficient .-diversity algorithm. We also show that all the three stages of the algorithm are necessary in order to cover different situations.作者: Dignant 時(shí)間: 2025-3-28 09:36 作者: Fillet,Filet 時(shí)間: 2025-3-28 12:58 作者: Rodent 時(shí)間: 2025-3-28 14:39 作者: dyspareunia 時(shí)間: 2025-3-28 21:40 作者: 有抱負(fù)者 時(shí)間: 2025-3-29 01:51 作者: 譏諷 時(shí)間: 2025-3-29 04:27
Test for Dynamic Stress and Straindent enrolments, variety of courses throw in the growing challenge in the research with a wider range of constraints. Many optimization problems are concerned with the best feasible solution with minimum execution time of algorithms. The aim of this paper is to propose rough sets methods to investig作者: Carminative 時(shí)間: 2025-3-29 10:10 作者: G-spot 時(shí)間: 2025-3-29 11:23
Enzymatic In Vitro Degradation of Polymersar features. In this paper firstly we compute an additional number of 49 molecular features and represent the entire chemical space in the 58-length finger print space. Tanimoto metric, a popular similarity measure is used to mine the chemical space for extracting similar and diverse fingerprints. O作者: 朝圣者 時(shí)間: 2025-3-29 17:01
https://doi.org/10.1007/978-94-011-1640-4ompromised systems to gain access to the resources, and confidential/intellectual information of the users. The primary reason for systems becoming vulnerable for attack is because of the ignorance of the Na?ve users using the system over Internet without worrying about the extent of threats. Hence,作者: 殖民地 時(shí)間: 2025-3-29 22:18
Test for Dynamic Stress and Strainrganization from losing superfluous time and cost are the well managed Information Lifecycle Management (ILM) process and the E-discovery process. The paper proposes a relationship between the Information Lifecycle Management and the E-discovery. Today organizations keep on encountering legal issues作者: 偶然 時(shí)間: 2025-3-30 01:28 作者: 慢跑 時(shí)間: 2025-3-30 05:43 作者: ILEUM 時(shí)間: 2025-3-30 09:46
https://doi.org/10.1007/978-3-540-71355-5forts in this direction are susceptible to leakage of valuable information through quasi identifiers. Over the past few years, several algorithms based upon the concept of .-anonymity [1-2] have been developed, to handle such problems. A better privacy model, called .-diversity [3] was proposed to h作者: 匍匐 時(shí)間: 2025-3-30 14:46
,Testauswahl und prüfgerechter Entwurf,normal or anomaly. In the work classification performance using rules obtained by different methods are applied on network traffic and compared. Classifier is built based on rules of decision table, conjunctive rule, OneR, PART, JRip, NNge, ZeroR, BayesNet, Ridor from WEKA and using rough set theory作者: CRUC 時(shí)間: 2025-3-30 20:27 作者: ELUC 時(shí)間: 2025-3-31 00:34 作者: Virtues 時(shí)間: 2025-3-31 04:37 作者: 面包屑 時(shí)間: 2025-3-31 09:02 作者: hegemony 時(shí)間: 2025-3-31 09:35
https://doi.org/10.1007/978-3-211-37139-8m. To convert Web into the Semantic Web it is required to add semantic information to Web resources. Previous approaches generate the semantic document statically. This paper provides a model for developers to generate semantic document (RDF) for the request and session data dynamically. It also pro作者: 粗俗人 時(shí)間: 2025-3-31 13:23
Test- und Prüfungsaufgaben Regelungstechnikhs, broad degree distributions and the existence of community structure. Here, an application has been developed in the domain of information propagation which satisfies all the above characteristics, based on some existing social network models. In addition, this model facilitates interaction betwe作者: Cumbersome 時(shí)間: 2025-3-31 21:23
https://doi.org/10.1007/978-3-211-37139-8lved many methods including distance measures, similarity measures and semantic measures. Ontology matching is the process of discovering similarities between ontology and determines the relationships holding two sets of entities that belong to different discrete ontology. The traditional methodolog作者: SOW 時(shí)間: 2025-3-31 22:42 作者: 陰郁 時(shí)間: 2025-4-1 05:49
https://doi.org/10.1007/978-3-642-22786-8ant colony optimization; database management system; genetic algorithm; multimodal systems; ontology; alg
