Home OALib Journal OALib PrePrints Submit Ranking News My Lib FAQ About Us Follow Us+
 Title Keywords Abstract Author All
Search Results: 1 - 10 of 100 matches for " "
 Page 1 /100 Display every page 5 10 20 Item
 Computer Science , 2006, Abstract: A new breed of web application, dubbed AJAX, is emerging in response to a limited degree of interactivity in large-grain stateless Web interactions. At the heart of this new approach lies a single page interaction model that facilitates rich interactivity. We have studied and experimented with several AJAX frameworks trying to understand their architectural properties. In this paper, we summarize three of these frameworks and examine their properties and introduce the SPIAR architectural style. We describe the guiding software engineering principles and the constraints chosen to induce the desired properties. The style emphasizes user interface component development, and intermediary delta-communication between client/server components, to improve user interactivity and ease of development. In addition, we use the concepts and principles to discuss various open issues in AJAX frameworks and application development.
 Nayyer Masood Information Technology Journal , 2004, Abstract: A semantic based schema comparison approach is presented that generates semantic similarity assertions among schema elements of the component database of a federated database system. The schema comparison approach is a part of a schema analysis methodology ECCAM. The approach uses the interpretation assigned to component schemas and generates ranked semantic similarity assertions. These assertions may be used by the integrator to develop an integrated schema.
 Marino Miculan Computer Science , 1998, Abstract: In this paper, we present a formalization of Kozen's propositional modal $\mu$-calculus, in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (proof'') rules and of context sensitive grammars. The encoding can be used in the \Coq system, providing an experimental computer-aided proof environment for the interactive development of error-free proofs in the $\mu$-calculus. The techniques we adopted can be readily ported to other languages and proof systems featuring similar problematic issues.
 Computer Science , 2009, Abstract: In the recent years, a lot of attention has been paid to the development of solid foundations for the composition and inversion of schema mappings. In this paper, we review the proposals for the semantics of these crucial operators. For each of these proposals, we concentrate on the three following problems: the definition of the semantics of the operator, the language needed to express the operator, and the algorithmic issues associated to the problem of computing the operator. It should be pointed out that we primarily consider the formalization of schema mappings introduced in the work on data exchange. In particular, when studying the problem of computing the composition and inverse of a schema mapping, we will be mostly interested in computing these operators for mappings specified by source-to-target tuple-generating dependencies.
 Carl Taswell Future Internet , 2010, DOI: 10.3390/fi2020156 Abstract: Both the IRIS-DNS System and the PORTAL-DOORS System share a common architectural style for pervasive metadata networks that operate as distributed metadata management systems with hierarchical authorities for entity registering and attribute publishing. Hierarchical control of metadata redistribution throughout the registry-directory networks constitutes an essential characteristic of this architectural style called Hierarchically Distributed Mobile Metadata (HDMM) with its focus on moving the metadata for who what where as fast as possible from servers in response to requests from clients. The novel concept of multilevel metadata about metadata has also been defined for the PORTAL-DOORS System with the use of entity, record, infoset, representation and message metadata. Other new features implemented include the use of aliases, priorities and metaresources.
 Information Technology Journal , 2005, Abstract: In this study, we extend XML Schema with nonmonotonic inheritance due to its powerful modeling ability to support multiple inheritance, overriding of elements or attributes inherited from super-elements, blocking of the inheritance of elements or attributes from super-elements and conflict handling. Another key feature of object-oriented data models is polymorphism. We introduce it into XML Schema to support polymorphic elements and polymorphic references. Moreover, we define a formalization to represent these features and present some validation rules to validate whether an XML instance document conforms to an Extended XML Schema based on the formalization. Finally, we extend XQuery to support the polymorphic feature.
 计算机应用研究 , 2008, Abstract: Existing software architectural style definitions have less objectivity and they are not defined roundly. Therefore, this paper tried to define software architectural style concept objectively and roundly. In addition, it found and pointed out four important research directions of software architectural style and their existing problems via analyzing their current research state.
 Computer Science , 2015, Abstract: Federated query engines allow data consumers to execute queries over the federation of Linked Data (LD). However, as federated queries are decomposed into potentially thousands of subqueries distributed among SPARQL endpoints, data providers do not know federated queries, they only know subqueries they process. Consequently, unlike warehousing approaches, LD data providers have no access to secondary data. In this paper, we propose FETA (FEderated query TrAcking), a query tracking algorithm that infers Basic Graph Patterns (BGPs) processed by a federation from a shared log maintained by data providers. Concurrent execution of thousand subqueries generated by multiple federated query engines makes the query tracking process challenging and uncertain. Experiments with Anapsid show that FETA is able to extract BGPs which, even in a worst case scenario, contain BGPs of original queries.
 Studies in Literature and Language , 2010, Abstract: This paper seeks to review the linkage between schema-building and listening learning. It commences with an overview of the two constructs “listening” and “schema” followed by an analysis of benefits of schema-building on language learning as the major theoretical framework. Keywords: schema; schema theory; listening; language acquisition; motivation
 Evgeny Chutchev Computer Science , 2010, Abstract: The paper offers a mathematical formalization of the Turing test. This formalization makes it possible to establish the conditions under which some Turing machine will pass the Turing test and the conditions under which every Turing machine (or every Turing machine of the special class) will fail the Turing test.
 Page 1 /100 Display every page 5 10 20 Item