標(biāo)題: Titlebook: Advances in Web-Age Information Management; 7th International Co Jeffrey Xu Yu,Masaru Kitsuregawa,Hong Va Leong Conference proceedings 2006 [打印本頁] 作者: panache 時間: 2025-3-21 17:47
書目名稱Advances in Web-Age Information Management影響因子(影響力)
書目名稱Advances in Web-Age Information Management影響因子(影響力)學(xué)科排名
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度
書目名稱Advances in Web-Age Information Management網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Advances in Web-Age Information Management被引頻次
書目名稱Advances in Web-Age Information Management被引頻次學(xué)科排名
書目名稱Advances in Web-Age Information Management年度引用
書目名稱Advances in Web-Age Information Management年度引用學(xué)科排名
書目名稱Advances in Web-Age Information Management讀者反饋
書目名稱Advances in Web-Age Information Management讀者反饋學(xué)科排名
作者: Thymus 時間: 2025-3-21 22:22
An Efficient Indexing Scheme for Moving Objects’ Trajectories on Road Networksroad networks. In this paper, we propose an efficient indexing scheme for moving objects’ trajectories on road networks. For this, we design a signature-based indexing scheme for efficiently dealing with the trajectories of current moving objects as well as for maintaining those of past moving objec作者: discord 時間: 2025-3-22 03:29 作者: agglomerate 時間: 2025-3-22 06:45 作者: nerve-sparing 時間: 2025-3-22 10:21 作者: 歸功于 時間: 2025-3-22 15:12 作者: CRACY 時間: 2025-3-22 18:41 作者: 毀壞 時間: 2025-3-22 23:51
Keyword Extraction Using Support Vector Machine the ‘meaning’ of the document. Keywords are of benefit to many text mining applications. However, a large number of documents do not have keywords and thus it is necessary to assign keywords before enjoying the benefit from it. Several research efforts have been done on keyword extraction. These me作者: 特征 時間: 2025-3-23 02:55 作者: Adjourn 時間: 2025-3-23 08:12
Succinct and Informative Cluster Descriptions for Document Repositoriesizing, and paid little attention to producing cluster labels. Without informative labels, users need to browse many documents to get a sense of what the clusters contain. Human labeling of clusters is not viable when clustering is performed on demand or for very few users. It is desirable to automat作者: 混合,攙雜 時間: 2025-3-23 13:33
LRD: Latent Relation Discovery for Vector Space Expansion and Information Retrievalpresentation in order to improve information retrieval (IR) on documents and document clustering. Our LRD method extracts terms and entities, such as person, organization, or project names, and discovers relationships between them by taking into account their co-occurrence in textual corpora. Given 作者: cogitate 時間: 2025-3-23 16:23
Web Image Retrieval Refinement by Visual Contentsges; and the other utilizes visual features of images, such as color, texture, shape, as the descriptions of Web images. However, those two methods are often applied independently in practice. In fact, both have their limitations to support Web image retrieval. This paper proposes a novel model call作者: 可商量 時間: 2025-3-23 20:15
An Effective Approach for Hiding Sensitive Knowledge in Data Publishing. In this paper, we address another aspect of privacy preservation in data publishing, where some of the knowledge implied by a dataset are regarded as private or sensitive information. In particular, we consider that the data are stored in a transaction database, and the knowledge is represented in作者: 下垂 時間: 2025-3-24 00:04
Tracking Network-Constrained Moving Objects with Group Updatesositions of moving objects. The key issue in tracking techniques is how to minimize the number of updates, while providing accurate locations for query results. In this paper, for tracking network-constrained moving objects, we first propose a simulation-based prediction model with more accurate loc作者: Flu表流動 時間: 2025-3-24 04:46 作者: 半身雕像 時間: 2025-3-24 09:48 作者: 未完成 時間: 2025-3-24 14:05
Role-Based Peer-to-Peer Model: Capture Global Pseudonymity for Privacy Protectionesource dissemination over the network. To solve these challenges, we propose the Role-Based P2P model, in which the . notion is functioned as the bridge component between users and resources to enforce secure resource dissemination together with relative constraints. The property rights attached to作者: Hdl348 時間: 2025-3-24 15:42
A Reputation Management Scheme Based on Global Trust Model for Peer-to-Peer Virtual Communitiesisk involved with the transactions without prior knowledge about each other’s reputation. ., a reputation management scheme, is proposed for P2P virtual communities. A unique global trust value, computed by aggregating similarity-weighted recommendations of the peers who have interacted with him and作者: nominal 時間: 2025-3-24 19:03
QoS-Aware Web Services Composition Using Transactional Composition Operatorred. Most of the work has so far focused on relaxing some ACID properties of the traditional transaction model, with little being done on investigating how the transaction can influence the quality of service (QoS) of a composite web service. In this paper, a composition model is proposed to evaluat作者: 追蹤 時間: 2025-3-25 01:27
KCAM: Concentrating on Structural Similarity for XML FragmentsAMs, denoted as .(.,.), can be used as the approximate structural similarity. KCAM is independent of label information in fragments. It is powerful to distinguish the structural difference between XML fragments.作者: 前兆 時間: 2025-3-25 04:05 作者: confide 時間: 2025-3-25 11:31 作者: BLA 時間: 2025-3-25 14:18
Object Placement and Caching Strategies on AN.P2Pieve reasonable performance, this paper proposes several object placement schemes and caching strategies. Our simulation results show that these methods could effectively improve the system performance in terms of query hops, computation cost and retrieval latency.作者: ENNUI 時間: 2025-3-25 19:47
Jian Chen,Fanlu Min,Shouhui Wangng queries. However, previous work on stabbing queries, although efficient in search time, is not directly applicable to structural joins because of high storage costs. We develop two storage reduction techniques to alleviate the problem of high storage costs. Simulations show that our new method outperforms prior approaches.作者: Pessary 時間: 2025-3-25 21:18
Jian Chen,Fanlu Min,Shouhui Wangt information. We also provide a retrieval algorithm to find a set of moving objects whose trajectories match the segments of a query trajectory. Finally, we show that our indexing scheme achieves much better performance on trajectory retrieval than the leading trajectory indexing schemes, such as TB-tree and FNR-tree.作者: 拘留 時間: 2025-3-26 01:59
David Aspinall,Kenneth MacKenzieen proposes a notion of FQ-Index as the core in M-XFPro to index both multiple queries and XML fragments for processing multiple XPath queries involving simple path and twig path patterns. We illustrate the effectiveness of the techniques developed with a detailed set of experiments.作者: OREX 時間: 2025-3-26 05:45 作者: 土坯 時間: 2025-3-26 10:13
Verification & Validation of Code Generatorsg to minimize the impact of data sanitization on the non-sensitive patterns. The experimental results show that . can achieve significant improvement over the best approach presented in the literature.作者: DAFT 時間: 2025-3-26 16:10
Extreme Model-Driven Development and jABCowledge in the form of a service template and create composition plan that is used by a synthesizer to perform dynamic configuring composition automatically. Our main contribution is to formally describe dynamic processing of composition, to take QoS-driven composition goal into account to find best quality composition on Semantic Grid.作者: Outshine 時間: 2025-3-26 19:59 作者: 嘴唇可修剪 時間: 2025-3-27 01:02 作者: 影響 時間: 2025-3-27 02:14 作者: 招惹 時間: 2025-3-27 05:33 作者: Charade 時間: 2025-3-27 10:20 作者: CRUE 時間: 2025-3-27 14:40 作者: FORGO 時間: 2025-3-27 21:24
Dynamic Configuring Service on Semantic Gridowledge in the form of a service template and create composition plan that is used by a synthesizer to perform dynamic configuring composition automatically. Our main contribution is to formally describe dynamic processing of composition, to take QoS-driven composition goal into account to find best quality composition on Semantic Grid.作者: Nostalgia 時間: 2025-3-27 22:57
QoS-Aware Web Services Composition Using Transactional Composition Operatorion operator, which extends the traditional workflow patterns and integrates transactional properties. Using a recursive approach, the QoS of a composite service can easily be calculated, in spite of transactional requirements given by service providers or end users.作者: conifer 時間: 2025-3-28 02:08 作者: 恩惠 時間: 2025-3-28 07:07
E. Jiménez-Mu?oz,F. Fernández-Martínezoth the vector space model (BM25) and the traditional language model significantly for both medium and long queries (7.53%-16.90%). Based on the experiments, we can also empirically draw the conclusion that the fine-grained senses will improve the retrieval performance when they are properly used.作者: 暗指 時間: 2025-3-28 11:19 作者: engagement 時間: 2025-3-28 15:03 作者: Bombast 時間: 2025-3-28 20:13
https://doi.org/10.1007/978-3-319-12991-4hemes do, and increases the utilization of each disk allocation unit. This study mathematically analyzes the number of node accesses and evaluates the performance of SAR-tree using real location data. The results show that the proposed index performs better than existing MBR compression schemes.作者: NIP 時間: 2025-3-28 23:02
M. A. Guerrero,M. M. Carbonell,A. Montoyol for query based IR on documents and clustering documents in order to discover complex relationships among terms and entities. Our experiments on a standard dataset for query based IR shows that our LRD method performed significantly better than traditional vector space model and other five standard statistical methods for vector expansion.作者: Intact 時間: 2025-3-29 03:47 作者: Confound 時間: 2025-3-29 11:14 作者: RALES 時間: 2025-3-29 14:31
LRD: Latent Relation Discovery for Vector Space Expansion and Information Retrievall for query based IR on documents and clustering documents in order to discover complex relationships among terms and entities. Our experiments on a standard dataset for query based IR shows that our LRD method performed significantly better than traditional vector space model and other five standard statistical methods for vector expansion.作者: 音樂等 時間: 2025-3-29 18:12
Tracking Network-Constrained Moving Objects with Group Updatesate strategy further reduces the total number of objects reporting their locations. A simulation study has been conducted and proved that the group update policy based on the simulation prediction is superior to traditional update policies with fewer updates and higher location precision.作者: FECK 時間: 2025-3-29 20:30
Advances in Web-Age Information Management978-3-540-35226-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ineluctable 時間: 2025-3-30 00:13
0302-9743 Overview: 978-3-540-35225-9978-3-540-35226-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: extract 時間: 2025-3-30 08:01 作者: Radiculopathy 時間: 2025-3-30 10:14
978-3-540-35225-9Springer-Verlag Berlin Heidelberg 2006作者: Pamphlet 時間: 2025-3-30 14:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/150180.jpg作者: Genetics 時間: 2025-3-30 18:44 作者: Amplify 時間: 2025-3-31 00:35 作者: Harrowing 時間: 2025-3-31 04:48 作者: 有惡意 時間: 2025-3-31 07:26 作者: GRE 時間: 2025-3-31 09:24
The Spec# Programming System: An Overview,d to support all XPath axes. In that method, each node of an XML document is labeled with a five-dimensional descriptor. All the nodes of the XML document are mapped to a point set in a five-dimensional space. T. Grust made it clear that each of the XPath axes can be implemented by a range query in 作者: Kernel 時間: 2025-3-31 15:29 作者: visual-cortex 時間: 2025-3-31 19:24
Lecture Notes in Computer Sciencee number of matching results) for the query. Hit number is a very useful piece of information in many important applications such as obtaining document frequencies of terms, estimating the sizes of search engines and generating search engine summaries. In this paper, we propose a novel technique for作者: 金哥占卜者 時間: 2025-4-1 00:33 作者: malapropism 時間: 2025-4-1 05:27
E. Jiménez-Mu?oz,F. Fernández-Martínezsults. In this paper, we first implement a WSD system for nouns and verbs, then the language sense model (LSM) for information retrieval is proposed. The LSM combines the terms and senses of a document seamlessly through an EM algorithm. Retrieval on TREC collections shows that the LSM outperforms b作者: GRACE 時間: 2025-4-1 06:39
M. A. Guerrero,M. M. Carbonell,A. Montoyoizing, and paid little attention to producing cluster labels. Without informative labels, users need to browse many documents to get a sense of what the clusters contain. Human labeling of clusters is not viable when clustering is performed on demand or for very few users. It is desirable to automat作者: receptors 時間: 2025-4-1 14:06
M. A. Guerrero,M. M. Carbonell,A. Montoyopresentation in order to improve information retrieval (IR) on documents and document clustering. Our LRD method extracts terms and entities, such as person, organization, or project names, and discovers relationships between them by taking into account their co-occurrence in textual corpora. Given 作者: GRATE 時間: 2025-4-1 15:26
Timothy G. Townsend,Malak Anshassiges; and the other utilizes visual features of images, such as color, texture, shape, as the descriptions of Web images. However, those two methods are often applied independently in practice. In fact, both have their limitations to support Web image retrieval. This paper proposes a novel model call作者: acclimate 時間: 2025-4-1 20:39
Verification & Validation of Code Generators. In this paper, we address another aspect of privacy preservation in data publishing, where some of the knowledge implied by a dataset are regarded as private or sensitive information. In particular, we consider that the data are stored in a transaction database, and the knowledge is represented in作者: Homocystinuria 時間: 2025-4-1 22:46 作者: 無王時期, 時間: 2025-4-2 04:56
Extreme Model-Driven Development and jABCcording to the requirements on Semantic Grid. One major challenge is how to comprehend service-specific semantics and how to generate workflow to reuse common service composition functionalities. Current ontological specifications for semantically describing properties of Grid services are limited t作者: HEW 時間: 2025-4-2 10:57
https://doi.org/10.1007/978-3-642-36127-2ve content delivery on the peer-to-peer networks. In general, the AN.P2P allows the peer to send the content’s original object with the associated content adaptation workflow to other peers. The recipient peer can reuse the original object to generate different content presentations. In order to ach作者: 踉蹌 時間: 2025-4-2 11:37
