An architecture integrating Grid applications with a Catallactic middleware, which can be applied to computational and data grids to host the dynamic interrelated resource and service markets, is discussed. The layere...
详细信息
An architecture integrating Grid applications with a Catallactic middleware, which can be applied to computational and data grids to host the dynamic interrelated resource and service markets, is discussed. The layered middleware architecture provides a clear separation of concern among five layers, in which the catallactic middleware comprising economic algorithms, economic framework, and peer agent layers is sandwitched between the application layer and the base platform. Applications interact with Grid market middleware to obtain the necessary services to fulfill a particular function, while the base platform supports the applications that provide the Grid services' hosting environment. Economics algorithms layer implements domain-and platform-independent economics algorithms for resource allocation, economic framework layer furnish the primitives to support catallactic algorithm implementation, and peer agent layer is responsible for interfacing with the underlying platform.
A new frameless registration of 2D/3D images based on external markers was presented. In this method, a reference coordinate system (RCS) is constructed, the relation of the coordinate of pixel in two 2D images and RC...
详细信息
A new frameless registration of 2D/3D images based on external markers was presented. In this method, a reference coordinate system (RCS) is constructed, the relation of the coordinate of pixel in two 2D images and RCS is computed. Then the conversion matrix between 3D image coordinate system (3DICS) and RCS is computed according to the coordinate of external markers in 3DICS. The registration of 2D/3D images can be realized by the matrices operation. The experimental results on clinical images show that the registration accuracy of this method was (0.0267 ± 0.0447) mm.
This paper introduces the architecture of an open information and communication platform that integrates all relevant participants in health and social sector. The main concept of the proposed platform is based on con...
详细信息
This paper introduces the architecture of an open information and communication platform that integrates all relevant participants in health and social sector. The main concept of the proposed platform is based on concept introduced by new computing paradigms and the need of transformation of the existing internetworking and web technologies into a human resource pool that will be accessible by anyone, at anytime, and from everywhere in support of their needs. This platform intends to create the essential infrastructure for the provisioning of health and social services to individuals that receive residential care using Peer-to-Peer (P2P) networks over Internet, GSM and PSTN networks. The use of new computing models such as Service-Oriented computing, Grid, P2P and argumentation technologies are discussed. Furthermore, the functional requirements and the architecture of a complete solution are presented.
The long-term goal of this project is to build an annotated corpus of biomedical text, to be used as a foundation for the development of automated anaphora resolution systems. We plan to explore the feasibility of usi...
详细信息
In this paper we give an overview of the four TRECVID tasks submitted by COST292, European network of institutions in the area of semantic multimodal analysis and retrieval of digital video media. Initially, we presen...
详细信息
In this paper we give an overview of the four TRECVID tasks submitted by COST292, European network of institutions in the area of semantic multimodal analysis and retrieval of digital video media. Initially, we present shot boundary evaluation method based on results merged using a confidence measure. The two SB detectors user here are presented, one of the Technical University of Delft and one of the LaBRI, University of Bordeaux 1, followed by the description of the merging algorithm. The high-level feature extraction task comprises three separate systems. The first system, developed by the National Technical University of Athens (NTUA) utilises a set of MPEG-7 low-level descriptors and Latent Semantic Analysis to detect the features. The second system, developed by Bilkent University, uses a Bayesian classifier trained with a "bag of subregions" for each keyframe. The third system by the Middle East Technical University (METU) exploits textual information in the video using character recognition methodology. The system submitted to the search task is an interactive retrieval application developed by Queen Mary, University of London, University of Zilina and ITI from Thessaloniki, combining basic retrieval functionalities in various modalities (i.e. visual, audio, textual) with a user interface supporting the submission of queries using any combination of the available retrieval tools and the accumulation of relevant retrieval results over all queries submitted by a single user during a specified time interval. Finally, the rushes task submission comprises a video summarisation and browsing system specifically designed to intuitively and efficiently presents rushes material in video production environment. This system is a result of joint work of University of Bristol, Technical University of Delft and LaBRI, University of Bordeaux 1.
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In this paper, we present a set of transf...
详细信息
ISBN:
(纸本)1595931635
For decades, researchers in knowledge representation (KR) have argued for and against various choices in KR formalisms, such as Rules, Frames, Semantic nets, and Formal logic. In this paper, we present a set of transformations that can be used to move knowledge across two fundamentally different KR formalisms: Frame-based systems and Relational database systems (RDBs). We also describe partial implementations of these transformations for a specific pair of such systems: ProtTgT and the Postgres RDB system.
A collaborative peer network application called 6Search (6S) is proposed to address the scalability limitations of centralized search engines. 6S peers depend on a local adaptive routing algorithm to dynamically chang...
详细信息
ISBN:
(纸本)0889864853
A collaborative peer network application called 6Search (6S) is proposed to address the scalability limitations of centralized search engines. 6S peers depend on a local adaptive routing algorithm to dynamically change the topology of the peer network and search for the best neighbors to answer their queries. We validate prototypes of the 6S network via simulations with 70 - 500 model users based on actual Web crawls and find that the network topology rapidly converges from a random network to a small world network, with clusters emerging from user communities with shared interests. We finally compare the quality of the results with those obtained by centralized search engines such as Google, suggesting that 6S can draw advantages from the context and coverage of the peer collective.
In this paper a new approach that targets the reduction of both the test-data volume and the scan-power dissipation during testing of a digital system's cores is proposed. For achieving the two aforementioned goal...
详细信息
ISBN:
(纸本)9789972611001
In this paper a new approach that targets the reduction of both the test-data volume and the scan-power dissipation during testing of a digital system's cores is proposed. For achieving the two aforementioned goals, a novel algorithm that inserts some inverters in the scan chain(s) of the core under test (CUT) is presented. However, no performance or area penalty is imposed on the CUT since, instead of additional inverters, the negated outputs of the scan flip-flops can be utilized. The proposed algorithm targets the maximization of run-lengths of zeros (or ones) in the test set accompanying the CUT. This algorithm combined with the Minimum Transition Count mapping of don't cares in a test set as well as with the alternating run-length code that have been recently proposed, achieves better test-data compression and reduced scan-power results than the relative works in the literature.
In this paper, we have briefly explored the aspect-oriented approach as a tool for supporting the software evolution. The aim of this analysis is to highlight the potentiality and the limits of the aspect-oriented dev...
详细信息
ISBN:
(纸本)9781581139648
In this paper, we have briefly explored the aspect-oriented approach as a tool for supporting the software evolution. The aim of this analysis is to highlight the potentiality and the limits of the aspect-oriented development for software evolution. From our analysis follows that in general (and in particular for AspectJ) the approach to join points, pointcuts and advices definition are not enough intuitive, abstract and expressive to support all the requirements for carrying out the software evolution. We have also examined how a mechanism for specifying pointcuts and advices based on design information, in particular on the use of UML diagrams, can better support the software evolution through aspect oriented programming. Our analysis and proposal are presented through an example. Copyright 2005 ACM.
In this paper, we propose a novel algorithm to discover the top-k covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets show that the new top-k covering rul...
详细信息
ISBN:
(纸本)9781595930606
In this paper, we propose a novel algorithm to discover the top-k covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets show that the new top-k covering rule mining algorithm is orders of magnitude faster than previous association rule mining algorithms. Furthermore, we propose a new classification method RCBT. RCBT classifier is constructed from the top-k covering rule groups. The rule groups generated for building RCBT are bounded in number. This is in contrast to existing rule-based classification methods like CBA [19] which despite generating excessive number of redundant rules, is still unable to cover some training data with the discovered rules. Experiments show that the RCBT classifier can match or outperform other state-of-the-art classifiers on several benchmark gene expression datasets. In addition, the top-k covering rule groups themselves provide insights into the mechanisms responsible for diseases directly. Copyright 2005 ACM.
暂无评论