標(biāo)題: Titlebook: Database and Expert Systems Applications; 24th International C Hendrik Decker,Lenka Lhotská,A Min Tjoa Conference proceedings 2013 Springer [打印本頁(yè)] 作者: 投射技術(shù) 時(shí)間: 2025-3-21 16:45
書(shū)目名稱Database and Expert Systems Applications影響因子(影響力)
書(shū)目名稱Database and Expert Systems Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Database and Expert Systems Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications被引頻次
書(shū)目名稱Database and Expert Systems Applications被引頻次學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications年度引用
書(shū)目名稱Database and Expert Systems Applications年度引用學(xué)科排名
書(shū)目名稱Database and Expert Systems Applications讀者反饋
書(shū)目名稱Database and Expert Systems Applications讀者反饋學(xué)科排名
作者: chemical-peel 時(shí)間: 2025-3-21 23:27
Genetic Programming with Greedy Search for Web Service Compositionber of available web services, the search space for finding best service compositions is growing exponentially. In this paper, a combination of genetic programming and random greedy search is proposed for service composition. The greedy algorithm is utilized to generate valid and locally optimized i作者: 不再流行 時(shí)間: 2025-3-22 02:22 作者: aerobic 時(shí)間: 2025-3-22 07:19
On Preference Order of DRSA Conditional Attributes for Computational Stylisticsextual descriptors are specific to authors in such high degree that it enables their recognition. In processing there can be employed techniques from artificial intelligence domain such as Dominance-Based Rough Set Approach (DRSA). Its starting point comprises establishing a preference order in valu作者: Forehead-Lift 時(shí)間: 2025-3-22 09:23
Entity Matching Technique for Bibliographic Databaseute of an author relation in a bibliographic database which maintains publication details of various authors, may change its value. When a database contains records of this nature and number of records grows to a large extent then it becomes really very challenging to identify which records belong t作者: Immunoglobulin 時(shí)間: 2025-3-22 15:13
On Efficient Map-Matching According to Intersections You Pass Byechniques cannot satisfy the increasing requirement of applications with massive trajectory data, e.g., traffic flow analysis and route planning. To handle this problem, we propose an efficient map-matching algorithm called .. Instead of matching every single GPS point, we concentrate on those close作者: Immunoglobulin 時(shí)間: 2025-3-22 17:14
A Linguistic Graph-Based Approach for Web News Sentence Searchingerest to many Web ventures. As word-based approaches have their limits in that they ignore a lot of the information in texts, we present Destiny, a linguistic approach where news item sentences are represented as a graph featuring disambiguated words as nodes and grammatical relations between words 作者: 主動(dòng) 時(shí)間: 2025-3-22 22:21
Composite Patterns for Web API Search in Agile Web Application Developmento use Web APIs in different development tasks, like completion of an existing mashup, or substitution of one or more Web APIs within it. A system that supports the web designer during Web API selection should behave differently according to the development scenario the web designer is acting in. In 作者: 厚臉皮 時(shí)間: 2025-3-23 02:30
Evaluating the Interest of Revamping Past Search Results as an approach of information retrieval using past queries and based on result combination. Exponential and Zipf distribution as well as Bradford’s law are applied to construct simulated document collections suitable for information retrieval evaluation. Experiments comparing a traditional retrieva作者: MELD 時(shí)間: 2025-3-23 09:28 作者: 朦朧 時(shí)間: 2025-3-23 12:33
A Similarity-Based Approach for Financial Time Series Analysis and Forecastingcasting, however, it still is a hard endeavor to develop a general model that is able to handle the chaotic nature of the markets. Artificial intelligence methods such as artificial neural networks and support vector machines arose as promising alternatives, but they hide the processing semantics, l作者: Engaged 時(shí)間: 2025-3-23 17:35
Inferring Knowledge from Concise Representations of Both Frequent and Rare Jaccard Itemsetsdicated for frequent correlated and for rare correlated patterns according to the . measure were presented. In this paper, we offer a new method of inferring new knowledge from the introduced concise representations. A new generic approach, called ., allowing the extraction of the sets of frequent c作者: curriculum 時(shí)間: 2025-3-23 18:10
Comparison Queries for Uncertain Graphsdisease transmission probability associated with them, and social networks, where nodes may have an existence probability associated with them. Analysts need tools that support analysis and comparison of these uncertain graphs. To this end, we have developed a prototype SQL-like graph query language作者: Substance-Abuse 時(shí)間: 2025-3-24 00:16
Efficient Time Aggregation and Querying of Flashed Streams in Constrained MotesE). The target sensor devices have low memory and computation capabilities, and high wireless data transmission costs. The SME represents data as streams, we discuss the approach and study how to optimize group-by aggregation over time-ordered data in that context, and to provide simple all-purpose 作者: TATE 時(shí)間: 2025-3-24 04:24 作者: 連鎖,連串 時(shí)間: 2025-3-24 06:58
Implementing Efficient Updates in Compressed Big Text Databasesthout prior decompression of the compressed text. We present a technique called DICIRT that supports fast insertion into and deletion from compressed texts without full decompression of the compressed text. For inserted fragments up to a size of 8% of the original text size, and for deleted fragment作者: 猛擊 時(shí)間: 2025-3-24 12:49 作者: MAPLE 時(shí)間: 2025-3-24 17:50 作者: 體貼 時(shí)間: 2025-3-24 20:44 作者: verdict 時(shí)間: 2025-3-25 02:30
A Similarity-Based Approach for Financial Time Series Analysis and Forecastingng classifier to predict a share’s behavior, thus improving the human analyst understanding and validation of the results. The analysis is defined through extended SQL instructions and executed over a fast and scalable engine, which makes our solution adequate to provide data analysis support for ne作者: hysterectomy 時(shí)間: 2025-3-25 03:44 作者: sclera 時(shí)間: 2025-3-25 08:27
0302-9743 ng; information extraction; queries, streams, and uncertainty, storage and compression; query processing; security; distributed data processing; metadata modeling and maintenance; pricing and recommending; and security and semantics.978-3-642-40172-5978-3-642-40173-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: facilitate 時(shí)間: 2025-3-25 12:38 作者: vertebrate 時(shí)間: 2025-3-25 18:47 作者: MILK 時(shí)間: 2025-3-25 21:16
A Duty to Disclose Material Facts?ents. Study of the effects of differing types of bisimilarity upon the storage of data values identified the use of both forwards and backwards bisimilarity as the most promising basis for a dictionary-compressed structure. A query strategy is detailed that takes advantage of the compressed structur作者: 獨(dú)裁政府 時(shí)間: 2025-3-26 01:53 作者: 挫敗 時(shí)間: 2025-3-26 05:13
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263467.jpg作者: CYN 時(shí)間: 2025-3-26 10:46 作者: 確定無(wú)疑 時(shí)間: 2025-3-26 14:10
Disability Harm and Wrongful Life Torts and comparison, and by observation and recognition of patterns in individual stylistic traits enables confirmation or rejection of authorship claims. Stylometry requires reliable textual descriptors and knowledge about their relevance for the case under study. One of the possible ways to evaluate t作者: fulcrum 時(shí)間: 2025-3-26 19:00
Michael J. K. Harper,Marjorie A. Jonesber of available web services, the search space for finding best service compositions is growing exponentially. In this paper, a combination of genetic programming and random greedy search is proposed for service composition. The greedy algorithm is utilized to generate valid and locally optimized i作者: GRIEF 時(shí)間: 2025-3-26 21:19 作者: BIPED 時(shí)間: 2025-3-27 02:55 作者: DOLT 時(shí)間: 2025-3-27 06:12 作者: 謊言 時(shí)間: 2025-3-27 12:32
Lindsay Lally M.D.,Robert F. Spiera M.D.echniques cannot satisfy the increasing requirement of applications with massive trajectory data, e.g., traffic flow analysis and route planning. To handle this problem, we propose an efficient map-matching algorithm called .. Instead of matching every single GPS point, we concentrate on those close作者: 搜集 時(shí)間: 2025-3-27 16:03 作者: Medicaid 時(shí)間: 2025-3-27 19:12
Stephen J. Di Martino M.D., Ph.D.o use Web APIs in different development tasks, like completion of an existing mashup, or substitution of one or more Web APIs within it. A system that supports the web designer during Web API selection should behave differently according to the development scenario the web designer is acting in. In 作者: floodgate 時(shí)間: 2025-3-27 23:01 作者: Immunotherapy 時(shí)間: 2025-3-28 02:39
https://doi.org/10.1007/978-1-4613-2241-2kly. In such an environment, in order to provide appropriate Web services to users’ needs it is important to quickly and accurately extract relevant information from Web documents and remove irrelevant contents such as advertisements. In this paper, we propose a method that extracts main content acc作者: Expostulate 時(shí)間: 2025-3-28 07:58
https://doi.org/10.1007/978-1-4613-2241-2casting, however, it still is a hard endeavor to develop a general model that is able to handle the chaotic nature of the markets. Artificial intelligence methods such as artificial neural networks and support vector machines arose as promising alternatives, but they hide the processing semantics, l作者: sacrum 時(shí)間: 2025-3-28 13:03 作者: MAIZE 時(shí)間: 2025-3-28 16:35
https://doi.org/10.1007/978-1-349-14657-4disease transmission probability associated with them, and social networks, where nodes may have an existence probability associated with them. Analysts need tools that support analysis and comparison of these uncertain graphs. To this end, we have developed a prototype SQL-like graph query language作者: 向下 時(shí)間: 2025-3-28 20:16
A Duty to Disclose Material Facts?E). The target sensor devices have low memory and computation capabilities, and high wireless data transmission costs. The SME represents data as streams, we discuss the approach and study how to optimize group-by aggregation over time-ordered data in that context, and to provide simple all-purpose 作者: MAIM 時(shí)間: 2025-3-29 00:54 作者: Ige326 時(shí)間: 2025-3-29 04:18
Intention to Create Legal Relationsthout prior decompression of the compressed text. We present a technique called DICIRT that supports fast insertion into and deletion from compressed texts without full decompression of the compressed text. For inserted fragments up to a size of 8% of the original text size, and for deleted fragment作者: observatory 時(shí)間: 2025-3-29 10:33
Contract Theory in Continuous-Time Modelsextension of XML suitable for representing data that assume different facets, having different value or structure under different contexts, which are determined by assigning values to a number of dimensions. We currently work on the problem of converting MXML to SQL queries, in order to be executed 作者: 小丑 時(shí)間: 2025-3-29 14:21 作者: 錢財(cái) 時(shí)間: 2025-3-29 16:42 作者: 滲透 時(shí)間: 2025-3-29 21:00 作者: 太空 時(shí)間: 2025-3-30 02:30
The Sources of Contractual TermsA. is introduced and experimentally assessed in this paper. We complete our theoretical contributions by means of an innovative approach for . that exploits the well-recognized .. Finally, we provide an experimental assessment and analysis of the performance of our framework against several classes of synthetic data stream sets.作者: Gesture 時(shí)間: 2025-3-30 04:44
Approximate OLAP Query Processing over Uncertain and Imprecise Multidimensional Data StreamsA. is introduced and experimentally assessed in this paper. We complete our theoretical contributions by means of an innovative approach for . that exploits the well-recognized .. Finally, we provide an experimental assessment and analysis of the performance of our framework against several classes of synthetic data stream sets.作者: MINT 時(shí)間: 2025-3-30 12:02 作者: 后來(lái) 時(shí)間: 2025-3-30 14:43
Hepatotoxicity of Oral Contraceptivesociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.作者: conspicuous 時(shí)間: 2025-3-30 18:23
Contract Theory in Continuous-Time Modelslational databases, based on similar techniques previously proposed for conventional XML documents. Also, we present a new ordered-based approach on representing context in such a way so as to facilitate the formulation of context-aware queries, and we show how we can manipulate context.作者: Adherent 時(shí)間: 2025-3-30 22:08 作者: Antagonism 時(shí)間: 2025-3-31 03:38
Genetic Programming with Greedy Search for Web Service Compositiontal evaluation has been carried out using public benchmark test cases with repositories of up to 15,000 web services and 31,000 properties. The results show good performance in searching for best service compositions, where the number of atomic web services used and the tree depth are used as objectives for minimization.作者: 使人煩燥 時(shí)間: 2025-3-31 08:59
Inferring Knowledge from Concise Representations of Both Frequent and Rare Jaccard Itemsetsociations rules can be either exact or approximate. We also illustrate the efficiency of our approach over several data sets and we prove that .-based classification rules have very encouraging results.作者: 人工制品 時(shí)間: 2025-3-31 11:29 作者: 饑荒 時(shí)間: 2025-3-31 17:10 作者: stressors 時(shí)間: 2025-3-31 20:48
Evaluating the Interest of Revamping Past Search Resultsaw are applied to construct simulated document collections suitable for information retrieval evaluation. Experiments comparing a traditional retrieval approach with our approach based on past queries using past queries show encouraging improvements using our approach.作者: 閑逛 時(shí)間: 2025-3-31 23:45
Efficient Time Aggregation and Querying of Flashed Streams in Constrained Motesams, we discuss the approach and study how to optimize group-by aggregation over time-ordered data in that context, and to provide simple all-purpose group-by and join algorithms. We used an experimental testbed to evaluate the findings and prove the advantage of the alternatives and studies that we made.
