We present a model of a mobile computing application environment and its formal specification using the RAISE specification language. Special care is taken to specify the location based operations that are typical of ...
详细信息
ISBN:
(纸本)3540240756
We present a model of a mobile computing application environment and its formal specification using the RAISE specification language. Special care is taken to specify the location based operations that are typical of mobile computing. In the process of specifying the mobile environment, we give precise semantics to different services identified with Mobichart notations, an extension to Objectcharts and Statecharts to make them suitable for graphical specification of mobile computing environment and applications. Thus we show the usability of both graphical and formal specification methods in development of mobile computing applications. We also discuss different techniques applied to detect faults and gain confidence in the correctness of the specification using consistency and confidence conditions, prototyping and testing.
Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each...
详细信息
Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair. A greedy matching is one in which the maximum possible number of applicants are matched to their first choice post, and subject to that condition, the maximum possible number are matched to their second choice post, and so on. This is a relevant concept in any practical matching situation and it was first studied by Irving. We define the bipartite graph G = (A ∪ P, E), where E consists of all pairs (a, p) such that post p appears in the preference list of applicant a. Each edge (a, p) has a rank i, which means that post p is an ith choice for applicant a. The traditional solution of computing a greedy matching in G would be to use the Hungarian algorithm to compute a maximum weight matching by assigning a suitably steeply decreasing sequence of weights to the edges. This would result in an algorithm with worst case running time rn(m + n log n) and the space requirement Θ(rm), where n is the number of vertices, m is the number of edges and r is the largest rank of an edge. Here, we describe two algorithms to compute a greedy matching that improve upon this algorithm. We give a combinatorial algorithm with running time O(min(n + C, C√n)m), where C &le r is the maximal rank of an edge used in a greedy matching. This algorithm works in phases and uses the maximum cardinality matching algorithm. We also give an O(Cnm) algorithm that tackles the problem of large edge weights introduced by the Hungarian algorithm. This algorithm uses scaling and works in phases. The space requirement of both these algorithms is O(m).
作者:
Benzaoui, M.L.Benghanem, M.
Faculty of Electronic and Computing BP 32 El-Alia Bab-Ezzouar 16111 Algiers Algeria
We present in this paper, a simulation using Matlab tools version 6.5 to study the functioning of Photovoltaic (PV) Regulator which is an important component in the PV systems. First, we simulate the output energy del...
详细信息
We present in this paper, a simulation using Matlab tools version 6.5 to study the functioning of Photovoltaic (PV) Regulator which is an important component in the PV systems. First, we simulate the output energy delivered by the PV generator that will be as input of the regulator. The output of this is connected to the battery and the load. After this we proposed to use a switch function in the model and applied many perturbations in the system. The model has done some problems in its response, so that we have resolved these problems by introducing the hysterisis function which has given good results. Finally we have applied this model in different meteorological conditions and different load profile and the simulation results are agreed to the experimental tests.
A new hybrid finite-difference time-domain and mixed-potential integral equation method (hybrid FDTD-MPIE) is developed for the modeling of multilayer planar structures with locally inhomogeneous objects. By using equ...
详细信息
The increasing demand for linguistic resources consisting of substantial amounts of data, such as large corpora, presents the challenge of building computational infrastructures capable of handling unprecedented amoun...
详细信息
ISBN:
(纸本)2951740816
The increasing demand for linguistic resources consisting of substantial amounts of data, such as large corpora, presents the challenge of building computational infrastructures capable of handling unprecedented amounts of information. One possible solution is the sharing of high-level, linguistically motivated and carefully balanced corpora for building one large language resource accessible worldwide. The most feasible way of integrating such widely distributed resources seems to be the construction of an infrastructure to connect various sites by interfacing local presentation formats, access methods and policies in a global network to automatically manage access procedures to widely distributed and diversified materials. Grid computing systems are designed to meet these requirements. This paper presents work in progress on an experiment for building a distributed corpus structure prototype. A small web portal was designed to perform global queries in the distributed corpus and collect the results of the same query applied to each local corpus forming part of the grid. Moreover, other computational services such as an online POS tagger and a morphological analyser/generator were inserted into the Grid to show the feasibility of such scenario.
The advent and accelerated adoption of laparoscopic surgery requires an objective assessment of both operative performance and perceptual events that lead to clinical decisions. In this paper we present a framework to...
详细信息
This paper discusses the Trustworthy computing Security Development Lifecycle (or simply the SDL), a process that Microsoft has adopted for the development of software that needs to withstand malicious attack. The pro...
详细信息
The immune system is the one of the adaptive biological system whose functions are to identify and to eliminate foreign material. In this paper we propose general algorithm derived primarily to perform optimization ta...
详细信息
ISBN:
(纸本)088986375X
The immune system is the one of the adaptive biological system whose functions are to identify and to eliminate foreign material. In this paper we propose general algorithm derived primarily to perform optimization tasks emphasizing combinatorial optimization. It is based on immune model to optimally design spatially closed electrical distribution networks. Some practical examples were used to investigate the performance of the immune algorithm. The results of the simulations represent that the immune algorithm shows good performance for such hard combinatorial optimization problem.
The flow of events and data on the connections between components in an application may have to be controlled at run time based on the application state to optimize performance. For example, a set of components (or a ...
详细信息
ISBN:
(纸本)1581139497
The flow of events and data on the connections between components in an application may have to be controlled at run time based on the application state to optimize performance. For example, a set of components (or a subsystem) may be inactive in a given state and events flowing towards such inactive components can be eliminated. This paper presents a model-driven approach to dynamically control the flow of events on event connections. The proposed model-driven tool chain consists of analysis algorithms which analyze the application to derive metadata for event flow control, and an adaptive event communication framework which provides configurable event communication middleware. The metadata derived by the analysis algorithms is used to automatically configure the middleware for application state-aware propagation of events. The analysis algorithms are specially useful in large scale distributed real-time embedded systems where deriving such metadata manually can be tedious and error-prone. We have applied the proposed mechanisms to application scenarios from the Boeing BoldStroke system. Copyright 2004acm.
Hardware-accelerated image composition for sort-last parallel rendering has received increasing attention as an effective solution to increased performance demands brought about by the recent advances in commodity gra...
详细信息
ISBN:
(纸本)0780387813
Hardware-accelerated image composition for sort-last parallel rendering has received increasing attention as an effective solution to increased performance demands brought about by the recent advances in commodity graphics accelerators. So far, several different hardware solutions for alpha and depth compositing have been proposed and a few of them have become commercially available. They share impressive compositing speed and high scalability. However, the cost makes it prohibitively expensive to build a large visualization system. In this paper, we used a hardware image compositor marketed by Mitsubishi Precision Co., Ltd. (MPC) which is now available as an independent device enabling the building of our own visualization cluster. This device is based on binary compositing tree architecture, and the scalable cascade interconnection makes it possible to build a large visualization system. However, we focused on a minimal configuration PC Cluster using only one compositing device while taking cost into consideration. In order to emulate this cascade interconnection of MPC compositors, we propose and evaluate the hybrid hardware-assisted image composition method which uses the OpenGL alpha blending capability of the graphics boards for assisting the hardware image composition process. Preliminary experiments show that the use of graphics boards diminished the performance degradation when using an emulation based on image feedback through available interconnection network. We found that this proposed method becomes an important alternative for providing high performance image composition at a reasonable cost.
暂无评论