Search results for "Database"
showing 10 items of 2136 documents
An Observation Framework for Multi-agent Systems
2009
Existing middleware platforms for multi-agent systems (MAS) do not provide general support for observation. On the other hand, observation is considered to be an important mechanism needed for realizing effective and efficient coordination of agents. This paper describes a framework called Agent Observable Environment (AOE) for observation-based interaction in MAS. The framework provides 1) possibility to model MAS components with RDF-based observable soft-bodies, 2) support for both query and publish/subscribe style ontology-driven observation, and 3) ability to restrict the visibility of observable information using observation rules. Additionally, we report on an implementation of the fr…
Improving Usability of Location-Based Services with User-Centric Data Querying
2004
In this paper, we describe a computational model that produces a dataset which we consider to be an appropriate response for “give me a description of my neighborhood” type of queries in location-based services Our attempt is to reflect the abstraction ability of a specific user, and in this way to maximize the usability of the service under restrictions on data volume posed by technical, economical and cognitive factors of mobile environments We also present the results of instantiating the model for a simple LBS.
ViziQuer: A Web-Based Tool for Visual Diagrammatic Queries Over RDF Data
2018
We demonstrate the open source ViziQuer tool for web-based creation and execution of visual diagrammatic queries over RDF/SPARQL data. The tool supports the data instance level and statistics queries, providing visual counterparts for most of SPARQL 1.1 select query constructs, including aggregation and subqueries. A query environment can be created over a user-supplied SPARQL endpoint with known data schema (a data schema exploration service is available, as well). There are pre-defined demonstration query environments for a mini-university data set, a fragment of synthetic similar to reality hospital data set, and a variant of Linked Movie Database RDF data set.
GPCALMA: A Grid-based tool for mammographic screening
2005
The next generation of High Energy Physics (HEP) experiments requires a GRID approach to a distributed computing system and the associated data management: the key concept is the Virtual Organisation (VO), a group of distributed users with a common goal and the will to share their resources. A similar approach is being applied to a group of Hospitals which joined the GPCALMA project (Grid Platform for Computer Assisted Library for MAmmography), which will allow common screening programs for early diagnosis of breast and, in the future, lung cancer. HEP techniques come into play in writing the application code, which makes use of neural networks for the image analysis and proved to be useful…
A Multi-channel Communication Framework
2013
We present a modular framework for a business-to-customer communication service integrating several communication channels. Using such a service it is possible to find hidden relationships between messages and thus collect more customer-related data. The framework core is a message-conversion engine capable of converting channel-independent abstract messages into concrete messages and vice-versa. The conversion process is context-dependent. The context consists of formally described communication channel characteristics and user preferences. The framework is based on semantic technologies due to a balance between their expressive power, reasoning properties, and existence of production-qual…
Datamining: Pemanfaatan Algoritma Apriori dalam Menganalisa Pola-Pola Transaksi yang Terjadi
2012
This paper will be described about implementation and analysis of the well-known apriori algorithm, which is called Market Basket Analysis (MBA) in data mining. This algorithm is widely used to predict the relation among market basket in the huge amount of database. This algorithm is based on the concept of a prefix tree. There are several ways to organize the nodes of such a tree, to encode the items, and to organize the transactions, which may be used in order to minimize the time needed to find the frequent itemsets as well as to reduce the amount of memory needed to store the counters. The rules produced will be used by management of supermarket to organize the items set to increase the…
Algorithms for transforming an integral photography into a plenoptic picture
2013
We report a simple algorithm for transforming the set of elemental images captured with an integral-photography set up, into the set of micro-images ready to be projected into an integral-imaging monitor. The method is based in the transposing relation between an integral photography and a plenoptic picture. The reported technique permits to adapt the integral images to the resolution and size of the monitor.
Maximal subgroups and formations
1989
Abstract We define, in each finite group G , some subgroups of Frattini-type in relation with a saturated formation and with a set of primes and study their properties, especially their influence in the structure of G .
Algebraic Structures of Rough Sets
1994
This paper deals with some algebraic and set-theoretical properties of rough sets. Our considerations are based on the original conception of rough sets formulated by Pawlak [4, 5]. Let U be any fixed non-empty set traditionally called the universe and let R be an equivalence relation on U. The pair A = (U, R) is called the approximation space. We will call the equivalence classes of the relation R the elementary sets. We denote the family of elementary sets by U/R. We assume that the empty set is also an elementary set. Every union of elementary sets will be called a composed set. We denote the family of composed sets by ComR. We can characterize each set X ⊆ U using the composed sets [5].
Words and Patterns
2002
In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…