書目名稱Web-Age Information Management. WAIM 2010 Workshops影響因子(影響力)學(xué)科排名
書目名稱Web-Age Information Management. WAIM 2010 Workshops網(wǎng)絡(luò)公開度
書目名稱Web-Age Information Management. WAIM 2010 Workshops網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Web-Age Information Management. WAIM 2010 Workshops被引頻次
書目名稱Web-Age Information Management. WAIM 2010 Workshops被引頻次學(xué)科排名
書目名稱Web-Age Information Management. WAIM 2010 Workshops年度引用
書目名稱Web-Age Information Management. WAIM 2010 Workshops年度引用學(xué)科排名
書目名稱Web-Age Information Management. WAIM 2010 Workshops讀者反饋
書目名稱Web-Age Information Management. WAIM 2010 Workshops讀者反饋學(xué)科排名
作者: Alcove 時(shí)間: 2025-3-21 21:16
Web-Age Information Management. WAIM 2010 Workshops978-3-642-16720-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: absolve 時(shí)間: 2025-3-22 01:38 作者: Lineage 時(shí)間: 2025-3-22 07:43 作者: Carminative 時(shí)間: 2025-3-22 09:51 作者: RAG 時(shí)間: 2025-3-22 13:21 作者: PANT 時(shí)間: 2025-3-22 19:12
Formal Verification of Stochastic Timing Behavior in Web-Based Business Process Collaborationnts of behavioral compatibility from the aspect of stochastic timing. Based on analyzing the bisimulation relation of the parallelism of business processes, we present a several theorems for check the behavioral compatibility in the collaboration system.作者: 抱怨 時(shí)間: 2025-3-22 21:45
An Efficient Blind Ring Signature Scheme without Pairingsandom oracle model. By comparing our scheme with Herranz et al’s scheme which is state-of-the-art, in terms of computational cost and the signature length, we show that our scheme is more efficient, since no pairing computations are involved in the whole signing and verifying phase.作者: chassis 時(shí)間: 2025-3-23 02:57 作者: aviator 時(shí)間: 2025-3-23 07:38 作者: 開頭 時(shí)間: 2025-3-23 12:40
XRCJ: Supporting Keyword Search in XML and Relation Co-occurrencenverted index and design a mixed inverted index. Through conducting extensive experiments on synthetic data from real data set DBLP, we find that our method can achieve a good performance in XML and relation co-occurrence circumstance.作者: 有角 時(shí)間: 2025-3-23 14:38 作者: 豐滿有漂亮 時(shí)間: 2025-3-23 18:47 作者: acetylcholine 時(shí)間: 2025-3-24 01:12
HyperGraphDB: A Generalized Graph Databasetomatically reifies every entity expressed in the database thus removing many of the usual difficulties in dealing with higher-order relationships. An open two-layered architecture of the data organization yields a highly customizable system where specific domain representations can be optimized whi作者: 極小量 時(shí)間: 2025-3-24 04:54
Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmarkecent years, it has become necessary to implement efficient graph databases that can load and manage these huge datasets..In this paper, we evaluate the performance of four of the most scalable native graph database projects (Neo4j, Jena, HypergraphDB and DEX). We implement the full HPC Scalable Gra作者: 減至最低 時(shí)間: 2025-3-24 08:01
A Model for Automatic Generation of Multi-partite Graphs from Arbitrary Data a model is to be the formal basis behind a tool for automatic graph generation that we are developing. This tool will automatically generate the basic multi-partite graphs that represents the arbitrary data provided as input..We consider input data as collections of complex objects composed by a se作者: saturated-fat 時(shí)間: 2025-3-24 14:15
A Fast Two-Stage Algorithm for Computing SimRank and Its Extensions famous algorithm to measure objects’ similarities based on link structure. We observe that if one node has no ., similarity score between this node and any of the others is always zero. Based on this observation, we propose a new algorithm, fast two-stage .(.), which can avoid storing unnecessary z作者: kindred 時(shí)間: 2025-3-24 18:23
Hotspot District Trajectory Predictionnematical models to approximate real world routes and always ignore spatial and temporal distance. In order to overcome the drawbacks of existing TP approaches, this study proposes a new trajectory prediction algorithm, called . (.otspot .istinct .rajectory .rediction). It works as: (1) mining the h作者: PAGAN 時(shí)間: 2025-3-24 19:13
Effective XML Keyword Search through Valid Lowest Information Unitest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately investigated. To address this challenge, we first introduce the notio作者: Awning 時(shí)間: 2025-3-25 00:06
Reducing Redundancy of XPath Query over Networks by Transmitting XML Viewsre a large number of optimization techniques on XML applications at home and abroad, including axis join queries, query rewriting, the semantic cache using in the client, redundancy elimination based on marked suffix tree (MST) and so on. However, these techniques are lack of research to eliminate r作者: 雜役 時(shí)間: 2025-3-25 05:39 作者: 摻假 時(shí)間: 2025-3-25 08:33 作者: 征兵 時(shí)間: 2025-3-25 12:11 作者: LAITY 時(shí)間: 2025-3-25 16:50
-Hash: An Efficient Method for Approximate XML Joinsing methods suffer for low efficiency, thus do not scale to large tree sets...-gram is a widely-used method with high quality of matches. In this paper, we propose .-hash as an improvement to .-gram. As the base of .-hash, a randomized data structure, .-array, is developed. With .-array, large trees作者: Extemporize 時(shí)間: 2025-3-25 21:37 作者: 詞匯 時(shí)間: 2025-3-26 03:13
Compression Algorithms for Structural Query Results on XML Datatem, the transmission of query results become the bottleneck. For the efficiency of XML management system, the compression method for XML query results is studied in this paper. By exploiting the properties of query results on XML data, two compression methods are proposed. One is a G-bitmap algorit作者: 好開玩笑 時(shí)間: 2025-3-26 05:39 作者: 六個(gè)才偏離 時(shí)間: 2025-3-26 08:39 作者: promote 時(shí)間: 2025-3-26 14:01
Formal Verification of Stochastic Timing Behavior in Web-Based Business Process Collaborationitable Web services at run time. In this paper, for stochastic- timing software business process collaboration based on Web services, we take into account the problem of verifying the behavioral compatibility in the cross-organizational system. We use the extended markovian process algebra to model 作者: 間接 時(shí)間: 2025-3-26 20:51 作者: 感情 時(shí)間: 2025-3-26 21:39 作者: Evacuate 時(shí)間: 2025-3-27 02:57 作者: 地名詞典 時(shí)間: 2025-3-27 08:08
HyperGraphDB: A Generalized Graph Databasele remaining within a uniform conceptual framework. HyperGraphDB is an embedded, transactional database designed as a universal data model for highly complex, large scale knowledge representation applications such as found in artificial intelligence, bioinformatics and natural language processing.作者: Herd-Immunity 時(shí)間: 2025-3-27 11:46
Survey of Graph Database Performance on the HPC Scalable Graph Analysis Benchmarkph Analysis Benchmark, and we test the performance of each database for different typical graph operations and graph sizes, showing that in their current development status, DEX and Neo4j are the most efficient graph databases.作者: 閹割 時(shí)間: 2025-3-27 14:09
A Fast Two-Stage Algorithm for Computing SimRank and Its Extensionseros and can accelerate the computation without accuracy loss. Under the circumstance of no accuracy loss, this algorithm uses less computation time and occupies less main memory. Experiments conducted on real and synthetic datasets demonstrate the effectiveness and efficiency of our ..作者: 膽大 時(shí)間: 2025-3-27 21:32 作者: 喪失 時(shí)間: 2025-3-27 23:29 作者: Deceit 時(shí)間: 2025-3-28 02:47 作者: 神圣將軍 時(shí)間: 2025-3-28 07:37 作者: MOAT 時(shí)間: 2025-3-28 13:19 作者: 職業(yè) 時(shí)間: 2025-3-28 18:04 作者: 指派 時(shí)間: 2025-3-28 20:26 作者: 不理會 時(shí)間: 2025-3-29 01:56 作者: Mri485 時(shí)間: 2025-3-29 03:31 作者: Silent-Ischemia 時(shí)間: 2025-3-29 07:23 作者: colostrum 時(shí)間: 2025-3-29 14:24 作者: 無可非議 時(shí)間: 2025-3-29 17:30 作者: EPT 時(shí)間: 2025-3-29 19:57
D. Dominguez-Sal,P. Urbón-Bayes,A. Giménez-Va?ó,S. Gómez-Villamor,N. Martínez-Bazán,J. L. Larriba-Pe作者: Sputum 時(shí)間: 2025-3-30 02:14 作者: Gudgeon 時(shí)間: 2025-3-30 04:59
Hongjun Li,Changjie Tang,Shaojie Qiao,Yue Wang,Ning Yang,Chuan Li作者: 打火石 時(shí)間: 2025-3-30 10:30 作者: HERTZ 時(shí)間: 2025-3-30 15:17
Chuitian Rong,Wei Lu,Xiao Zhang,Zhen Liu,Xiaoyong DuApress 2008作者: 文件夾 時(shí)間: 2025-3-30 19:13
Web-Age Information Management. WAIM 2010 WorkshopsWAIM 2010 Internatio作者: 有雜色 時(shí)間: 2025-3-30 21:02 作者: 牽索 時(shí)間: 2025-3-31 04:22 作者: gratify 時(shí)間: 2025-3-31 07:28 作者: 煉油廠 時(shí)間: 2025-3-31 09:31
Lijun Zhang,Zhanhuai Li,Qun Chen,Ning Lic children can be as mild as occasional attacks of hay fever or as severe as disfiguring eczema and life-threatening bronchial asthma. In addition to the obvious health problems associated with having allergies, affected children may experience recurring colds, painful ear infections, and other alle作者: Obsessed 時(shí)間: 2025-3-31 15:44 作者: 宮殿般 時(shí)間: 2025-3-31 17:49
Depression –das Leben mit der schwarz gekleideten Dame in den Griff bekommen作者: 值得尊敬 時(shí)間: 2025-4-1 00:06 作者: defenses 時(shí)間: 2025-4-1 03:27
