標(biāo)題: Titlebook: Web Information Systems and Technologies; 8th International Co José Cordeiro,Karl-Heinz Krempels Conference proceedings 2013 Springer-Verla [打印本頁(yè)] 作者: TRACT 時(shí)間: 2025-3-21 19:57
書(shū)目名稱(chēng)Web Information Systems and Technologies影響因子(影響力)
書(shū)目名稱(chēng)Web Information Systems and Technologies影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Web Information Systems and Technologies網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Web Information Systems and Technologies網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Web Information Systems and Technologies被引頻次
書(shū)目名稱(chēng)Web Information Systems and Technologies被引頻次學(xué)科排名
書(shū)目名稱(chēng)Web Information Systems and Technologies年度引用
書(shū)目名稱(chēng)Web Information Systems and Technologies年度引用學(xué)科排名
書(shū)目名稱(chēng)Web Information Systems and Technologies讀者反饋
書(shū)目名稱(chēng)Web Information Systems and Technologies讀者反饋學(xué)科排名
作者: AUGUR 時(shí)間: 2025-3-22 00:17 作者: gospel 時(shí)間: 2025-3-22 01:03 作者: MELON 時(shí)間: 2025-3-22 06:40
https://doi.org/10.1007/978-3-642-36608-6SOA service-oriented architecture; Web applications; Web intelligence; Web search; Web services; Web tech作者: 夸張 時(shí)間: 2025-3-22 09:44
José Cordeiro,Karl-Heinz KrempelsPost conference proceedings of the 8th International Conference on Web Information Systems and Technologies作者: rheumatology 時(shí)間: 2025-3-22 15:08
some subclass of .. In both cases, . is said to refer to ...This paper contains three contributions. First, we describe and formalize the problem from a logical point of view and give a first-order semantics for CGraphs. We show that the identification of inherited content in CGraphs depends on som作者: 喧鬧 時(shí)間: 2025-3-22 19:59
. Extensive experiments are conducted to assess the recommendation performance in term of . and .. Experimental results show that the REN is a good recommendation resource with high quality of related entities. For recommending related entity, the proposed REN-based method achieves good performance 作者: 土產(chǎn) 時(shí)間: 2025-3-22 21:15
Panagiotis Antonellis,Christos Makris,Georgios Pispirigosrrect answers appear..In this work we take a critical look at this way of evaluation. We argue that performing a ranking-based evaluation is not sufficient to assess methods for complex query answering. To solve this, we introduce Message Passing Query Boxes (MPQB), which takes binary classification作者: 柱廊 時(shí)間: 2025-3-23 03:45 作者: 定點(diǎn) 時(shí)間: 2025-3-23 06:47 作者: 辭職 時(shí)間: 2025-3-23 10:52 作者: Initial 時(shí)間: 2025-3-23 16:07
Alexandre Parra Carneiro da Silva,Celso Massaki Hiratacommonly used is the rate constant of the reaction in which the compound of interest is involved. Advances in contemporary experimental techniques made possible the precise direct measurements of the rate constants of chemical reactions, including elementary reactions of electron. and proton. transf作者: sterilization 時(shí)間: 2025-3-23 20:19
Paul G. Talaga,Steve J. Chapinx analogue of eulerian graphs are the . graphs. These are graphs that have a cycle that passes through each vertex exactly once and are named after Sir William Rowan Hamilton who devised the Icosian Game for two players. One of the problems in the game required the first player to select a path of f作者: falsehood 時(shí)間: 2025-3-24 00:32
Sami Bhiri,Wassim Derguech,Maciej Zarembas we need can be replaced by . the number of objects in various sets.) This phenomenon is not confined to graph theory and combinatorics; in the last decade or two probabilistic methods have been used with striking success in Fourier analysis, in the theory of function spaces, in number theory, in t作者: Incise 時(shí)間: 2025-3-24 05:02 作者: Affiliation 時(shí)間: 2025-3-24 09:33 作者: podiatrist 時(shí)間: 2025-3-24 12:16
Henning Heitk?tter,Sebastian Hanschke,Tim A. Majchrzaktion methods, interior point cutting plane methods, primal-dual IPMs and first-order algorithms for solving SDPs, branch and out approaches based on SDP relaxations of IPs, approximation algorithms based on SDP formulations, and finally methods employing successive convex approximations of the under作者: 含沙射影 時(shí)間: 2025-3-24 16:11
Henning Heitk?tter,Sebastian Hanschke,Tim A. Majchrzak, especially those arising from finite-element methods, have such a property due to the physical constraints of the problems being modeled..Our ordering heuristic guarantees not only low fill, but also approximately optimal operation count, and approximately optimal elimination height. Elimination o作者: 顛簸下上 時(shí)間: 2025-3-24 20:28 作者: 消極詞匯 時(shí)間: 2025-3-25 00:21
Dinh Quyen Nguyen,Heidrun Schumannascinating example of the interplay between pure mathematics and the applied problems generated by software and hardware engineers. The wide range of mathematical techniques used, and the often unexpected applications of combinatorial covering suites make for a rewarding study.作者: 搜集 時(shí)間: 2025-3-25 05:05 作者: 搖曳的微光 時(shí)間: 2025-3-25 10:28
L. Ardissono,G. Petrone,M. Segnan,G. Tortaaluate the presented approach via experiments inspired by a scenario from software development and an independent social network benchmark. The experimental results indicate that the proposed technique can significantly improve performance regarding memory consumption and execution time in favorable作者: Commentary 時(shí)間: 2025-3-25 12:14
tem for the language. This paper presents a prototype implementation of the language constructed in about 500 lines of OCaml code. We believe this serves as a reference interpreter for further investigation, including the design of full-fledged languages based on ..作者: 興奮過(guò)度 時(shí)間: 2025-3-25 16:26
prehensive artifact, in which partial maps identify commonalities. Although this inherent partiality produces amplified complexity, Heindel’s characterisation still yields cocompleteness of the category of comprehensive systems equipped with closed partial morphisms and thus enables computing by SPO作者: Employee 時(shí)間: 2025-3-25 23:47 作者: 減少 時(shí)間: 2025-3-26 01:02 作者: entice 時(shí)間: 2025-3-26 06:32 作者: 評(píng)論者 時(shí)間: 2025-3-26 09:14
Sanaa Saleh Askoolds. We show that the worst-case amortized complexity per simulation step is only logarithmic in the number of active collaborating systems (like vehicles) and constant concerning the size of the topology. The theoretical results are confirmed by experiments.作者: BUCK 時(shí)間: 2025-3-26 16:00 作者: 比目魚(yú) 時(shí)間: 2025-3-26 18:34
g case study concerning travel agencies. This study deals with the organisation of processes that are constantly suspended by others. The main focus of the case study is to investigate the possibilities of small and medium travel agencies to provide a continuous service for their customers while tra作者: debble 時(shí)間: 2025-3-26 21:31
anguage LMNtal without introducing new domains or languages. We show that the proposed abstraction method combined with symmetry reduction reduces state spaces while preserving the soundness of model checking. We implemented the method on SLIM, an implementation of LMNtal with an LTL model checker, 作者: Permanent 時(shí)間: 2025-3-27 03:22
Satoshi Ikeda,Nobuharu Kami,Takashi Yoshikawansformation system. Building on this basic result, we present an algorithm that is able to compute all non-redundant critical pairs for two given interaction schemes. The algorithm is implemented for Henshin, a model transformation environment based on graph transformation concepts.作者: 悲痛 時(shí)間: 2025-3-27 08:34
Alexandre Parra Carneiro da Silva,Celso Massaki Hirata387943.jpg作者: Biomarker 時(shí)間: 2025-3-27 12:57
Antonia Bertolino,Guglielmo De Angelis,Andrea Polini387950.jpg作者: PLUMP 時(shí)間: 2025-3-27 13:56 作者: Anecdote 時(shí)間: 2025-3-27 21:12
Alexander Smirnov,Tatiana Levashova,Nikolay Shilov,Alexey Kashevnik387968.jpg作者: 廢除 時(shí)間: 2025-3-28 00:27
1865-1348 nology; Web Interfaces and Applications; Society, e-Business, and e-Government; Web Intelligence; and Mobile Information Systems..978-3-642-36607-9978-3-642-36608-6Series ISSN 1865-1348 Series E-ISSN 1865-1356 作者: 樹(shù)木心 時(shí)間: 2025-3-28 04:12 作者: 委屈 時(shí)間: 2025-3-28 08:19
Efficient Parallel Algorithms for XML Filtering with Structural and Value Constraintss support for value-based predicates by embedding three different algorithms for handling value constraints during XML filtering, based on the popularity and the semantic interpretation of the predicate values. Experimental results depict that the proposed system outperforms the previous parallel ap作者: 白楊 時(shí)間: 2025-3-28 14:01
Modelling Capabilities as Attribute-Featured Entitiest several levels of abstraction from the most abstract one with just an action verb to the most concrete one that corresponds to the exact need of an end user which is not possible with current capability modelling approaches. We are also able to interlink capabilities for creating a hierarchical st作者: athlete’s-foot 時(shí)間: 2025-3-28 16:46 作者: CODA 時(shí)間: 2025-3-28 22:20
Real-Text Dictionary for Topic-Specific Web Searchingicating the best phrase among synonymous phrases and for indicating effective phrases in general from the viewpoint of search results. The assumptions are that the best phrases have higher ISs than the other phrases of a synonym set, and that the higher the IS is the better the search results are. T作者: Irritate 時(shí)間: 2025-3-29 01:01 作者: GLOSS 時(shí)間: 2025-3-29 06:47
Mixed-Initiative Management of Online Calendars an event, it searches for solutions which are very similar to the user’s current schedule, with the aim of limiting changes to her/his daily plans as much as possible. Our calendar management service is based on the exploitation of well-known Temporal Constraint Satisfaction Problems techniques, wh作者: 光明正大 時(shí)間: 2025-3-29 10:31 作者: painkillers 時(shí)間: 2025-3-29 15:07 作者: 有機(jī)體 時(shí)間: 2025-3-29 16:05 作者: 他去就結(jié)束 時(shí)間: 2025-3-29 21:17 作者: 織布機(jī) 時(shí)間: 2025-3-30 03:16 作者: N防腐劑 時(shí)間: 2025-3-30 04:06 作者: AVOW 時(shí)間: 2025-3-30 10:36
Panagiotis Antonellis,Christos Makris,Georgios Pispirigos associated with CSPs are .-hard. As some of these operations must be addressed online, compilation structures for CSPs have been proposed, . finite-state automata and Multivalued Decision Diagrams (MDDs)..The aim of this paper is to draw a compilation map of these structures. We cast all of them as作者: CRATE 時(shí)間: 2025-3-30 14:51
Alexander Zibula,Tim A. Majchrzakief comments, the book is exclusively concerned with finite graphs. Many of these finite graphs are geometrically defined, and involve a finite field and sometimes a finite dimension. By allowing one or both of these parameters to be infinite, we often obtain infinite distance-transitive graphs. How作者: 并入 時(shí)間: 2025-3-30 20:18 作者: Triglyceride 時(shí)間: 2025-3-30 23:59
Alexandre Parra Carneiro da Silva,Celso Massaki Hirataproblem in theoretical chemistry. Any progress in understanding reactivity not only enriches chemical knowledge but also has important practical implications. Numerous methods have been developed to assess reactivity quantitatively, and it is not the aim of this chapter to review all of them. Yet, s作者: semiskilled 時(shí)間: 2025-3-31 03:57 作者: Toxoid-Vaccines 時(shí)間: 2025-3-31 05:49
Sami Bhiri,Wassim Derguech,Maciej Zarembat contains a ..”. “Show that for every natural number . there is a .-chromatic graph which does not contain a triangle”. It does not take long to realize that the constructions that seem to be demanded by questions like these are not easily come by. Later we show that for every . there is a graph wi作者: DEAWL 時(shí)間: 2025-3-31 09:31
Antonia Bertolino,Guglielmo De Angelis,Andrea Polinid mainly by chemists. Such systems show an abrupt transition with the appearance of a giant component (1-connected subgraph) which models transitions in physical systems. It is known that further abrupt transitions in .. (and ..) occur with the appearance of giant .-connected subgraphs and these tra作者: 共同生活 時(shí)間: 2025-3-31 13:52
e another. The common neighbor distribution (nd) is (n.,n.,n.,...,n.), where n. is the number of pairs of vertices having i common neighbors. These and other sequences have been introduced recently as tools in distinguishing pairs of nonisomorphic graphs (dd(G) works best for graphs of large diamete作者: 乳汁 時(shí)間: 2025-3-31 20:26 作者: 不適 時(shí)間: 2025-3-31 22:17 作者: 整頓 時(shí)間: 2025-4-1 02:52 作者: SPASM 時(shí)間: 2025-4-1 06:13 作者: 沒(méi)血色 時(shí)間: 2025-4-1 11:51 作者: 騎師 時(shí)間: 2025-4-1 17:31
L. Ardissono,G. Petrone,M. Segnan,G. TortaIncremental approaches based on the RETE algorithm provide an adequate solution in many scenarios, but are generally designed to search for query results over the entire graph. However, in certain situations, a user may only be interested in query results for a subgraph, for instance when a develope作者: projectile 時(shí)間: 2025-4-1 21:08
leaf-linked trees. They can be abstracted into graphs (or more precisely, port hypergraphs). In existing imperative programming languages, these structures are handled with destructive assignments to heaps as opposed to a purely functional programming style. These low-level operations are prone to 作者: reaching 時(shí)間: 2025-4-2 02:03
s, SPO’s applicability depends on the durability of pushouts after this transition. There is a wide range of work on the question when pushouts exist in categories with partial morphisms starting with the pioneering work of L?we and Kennaway and ending with an essential characterisation in terms of 作者: Magisterial 時(shí)間: 2025-4-2 04:29
Everton Luiz de Almeida Gago Júnior,Gean Davis Breda,Eduardo Zanoni Marques,Leonardo de Souza Mendessuch systems with probabilistic timed behavior adhere to a given specification is essential. When the states of the system can be represented by graphs, the rule-based formalism of Probabilistic Timed Graph Transformation System (PTGTSs) can be used to suitably capture structure dynamics as well as 作者: engrossed 時(shí)間: 2025-4-2 07:02 作者: probate 時(shí)間: 2025-4-2 12:01 作者: 顯示 時(shí)間: 2025-4-2 18:34
Sanaa Saleh Askoolacting together on large-scale topologies is required. Probabilistic Timed Graph Transformation Systems (PTGTSs) have been introduced as a means of modeling a high-level view of these systems of systems. In our previous work, we proposed a simulation scheme based on local search incremental graph ma作者: 同義聯(lián)想法 時(shí)間: 2025-4-2 22:13 作者: Blood-Vessels 時(shí)間: 2025-4-3 03:16 作者: 書(shū)法 時(shí)間: 2025-4-3 06:08 作者: Jingoism 時(shí)間: 2025-4-3 08:53
Satoshi Ikeda,Nobuharu Kami,Takashi Yoshikawaimple transformation rules, this is usually not sufficient for more complex changes. In these situations, the concept of amalgamated transformation has been increasingly often used to model . loops of rule applications which coincide in common core actions. Such a loop can be specified by a kernel r作者: exceptional 時(shí)間: 2025-4-3 13:06
