Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such as relational databases and XML data. ...
详细信息
ISBN:
(纸本)9781617386077
Enterprise-level applications are becoming complex with the need for event and stream processing, multiple query processing and data analysis over heterogeneous data sources such as relational databases and XML data. Such applications require access to the metadata information for these different data sources. This paper discusses the design and implementation of a service-based dynamic metadata repository over heterogeneous data sources in a distributed event stream processing environment. The metadata repository is dynamic such that data resources can be registered or unregistered at run time. The design of such a metadata database is the first step in researching multiple query optimization over various query expressions to detect and materialize common subexpressions over relational and XML structured data sources.
This short paper presents our research agenda for a more socially oriented software production, drawing upon the empirical evidences of failure of software organisation in providing enduring software. Constructing a s...
详细信息
ISBN:
(纸本)9781450301312
This short paper presents our research agenda for a more socially oriented software production, drawing upon the empirical evidences of failure of software organisation in providing enduring software. Constructing a socio-technical perspective on the basis of social sciences research on technology, we outline a research program aimed at building software that could be more reliable and be useful longer. Our guiding principles are the symmetry between the social and the technical, and their intercalation in the development process, and Participatory Design is one of our foundational disciplines. Copyright 2010 ACM 978.
We present a method that utilises dynamic molecular modelling technique to track the changes within complex social network. The users forming a social network are interpreted as large sets of interacting particles. Th...
详细信息
Power consumption can be significantly reduced in Systems-on-Chip (SoC) by scaling down the voltage levels of the Processing Elements (PEs). The power efficiency of this Voltage Islanding technique comes at the cost o...
详细信息
ISBN:
(纸本)9783981080162
Power consumption can be significantly reduced in Systems-on-Chip (SoC) by scaling down the voltage levels of the Processing Elements (PEs). The power efficiency of this Voltage Islanding technique comes at the cost of energy and area overhead due to the level shifters between voltage islands. Moreover, from the physical design perspective it is not desirable to have an excessive number of voltage islands on the chip. Considering voltage islanding at an early phase of design as during floorplanning of the PEs can address various of these issues. In this paper, we propose a new cost function for the floorplanning objective different from the traditional floorplanning objective. The new cost function not only includes the overall area requirement, but also incorporates the overall power consumption and the design constraint imposed on the maximum number of voltage islands. We propose a greedy heuristic based on the proposed cost function for the floorplanning of the PEs with several voltage islands. Experimental results using benchmark data study the effect of several parameters on the outcome of the heuristic. It is evident from the results that power consumption can be significantly reduced using our algorithm without significant area overhead. The area obtained from the heuristic is also compared with the optimal, and found to be within 4% of the optimal on average, when area minimization is given the priority.
In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficien...
详细信息
In this paper, we study the problem of constructing min-cost single-link/node failure immune recovery trees for two-edge/vertex connected networks. We prove its NP-hardness, and present a general framework of efficient approximation algorithms for solving this problem. Based on this framework, we present two realizations: 1) for link failure protection, our realization has an approximation ratio of 2 and O(nlog n(m +nlogn)) running time if different links have different costs, or an approximation ratio of 1.5 and a linear running time if all links have the same cost; 2) for node failure protection, our realization has an approximation ratio of 2 and O(n 3 m) running time if different links have different costs, or an approximation ratio of 5/3 and a linear running time if all links have the same cost.
Computational energy consumption of the processing elements (PEs) of a NoC can be significantly reduced by scaling down their voltage levels. This creates clusters of adjacent PEs operating at the same voltage level, ...
详细信息
The extraction of social groups from social networks existing among employees in the company, its customers or users of various computer systems became one of the research areas of growing importance. Once we have dis...
详细信息
In Mobile Social Networks (MSN) users can participate in communication based on their mutual interests. Typical implementations of Social Networks involve client/server architecture where a user needs to subscribe to ...
详细信息
In Mobile Social Networks (MSN) users can participate in communication based on their mutual interests. Typical implementations of Social Networks involve client/server architecture where a user needs to subscribe to a server for content sharing with other clients. Popular Online Social Network providers have recently extended the web based service into the mobile domain. However due to mobility and connectivity issues this architecture is in-adequate in providing peer to peer content sharing services to mobile users. Many solutions for Mobile Ad Hoc networks have been proposed however content based communication in partially or intermittently connected MANETs has been a recent research area. In this paper we present an adaptive protocol to facilitate implementation of a Mobile Social Network based on peer to peer content driven communication when end-to-end connectivity is not possible. The proposed protocol takes into account the information about user's interests, content based data storing and forwarding, and host mobility in a disconnected, delay tolerant MANET.
A method for extraction of the multi-layered social network based on the data about human collaborative achievements, in particular scientific papers, is presented in the paper. The objects linking people form a hiera...
详细信息
In the design of advanced micro- and nanosized materials and devices containing inclusions, the effects of surfaces/interfaces on the stress concentration become prominent. In this paper, based on the surface/interfac...
详细信息
暂无评论