If a very large volume of data generated from the scan of RFID tags on individual items continuously flow into a single RFID middleware component with limited hardware resources, its entire data processing time for ex...
详细信息
ISBN:
(纸本)9783642318696
If a very large volume of data generated from the scan of RFID tags on individual items continuously flow into a single RFID middleware component with limited hardware resources, its entire data processing time for extracting necessary information from this huge amount of scanned data may become considerably longer. This paper presents mobile agent-based distributed software modules applicable to traditional RFID systems to highly alleviate a huge amount of workload of the middleware by addressing this fundamental limitation. They provide a convenient environment enabling required data to be pre-processed repeatedly in transit by transferring a mobile agent including its specified data management rules to numerous mobile readers. Simulation results verify that our proposed system performs better and more reliable than the traditional one processing the data by fixed readers after having arrived at the destination in case a large amount of RFID tag data should be processed in middlewares with RFID readers.
While the use of cloud computing is on the rise, many obstacles to its adoption remain. One of the weaknesses of current cloud offerings is the difficulty of developing highly customizable applications while retaining...
详细信息
ISBN:
(纸本)9781467302685
While the use of cloud computing is on the rise, many obstacles to its adoption remain. One of the weaknesses of current cloud offerings is the difficulty of developing highly customizable applications while retaining the increased scalability and lower cost offered by the multi-tenant nature of cloud applications. In this paper we describe a Software Product Line Engineering (SPLE) approach to the modelling and deployment of customizable Software as a Service (SaaS) applications. Afterwards we define a formal feature placement problem to manage these applications, and compare several heuristic approaches to solve the problem. The scalability and performance of the algorithms is investigated in detail. Our experiments show that the heuristics scale and perform well for systems with a reasonable load.
Nowadays the globalization process is a reality. As a result, the creation of new transnational corporations has increased. Any corporation of this magnitude requires a very complex staff hierarchy to properly functio...
详细信息
ISBN:
(纸本)9783642308635
Nowadays the globalization process is a reality. As a result, the creation of new transnational corporations has increased. Any corporation of this magnitude requires a very complex staff hierarchy to properly function. As a result, typical problems in bureaucracy management have developed that usually occurred in highly developed economies. These problems have been researched at a theoretical level for a very long time. Certain results have been obtained by using enterprise resource planning systems that ensure transparency in any point of the process where the document processing flows. There are moments when a tight control must be exercised as in reducing personnel schema. This must be done without decreasing the organizational efficiency. Anyway, it is very hard to control a structure when one also uses a part of it to generate the executive reports necessary. In this paper a solution that may help to increase the control over bureaucracy is presented. The solution is used to generate software based on agents in order to find and extract the real organization structure by doing automatic analysis of all document workflows. Probably the most important advantage of the solution is that it is not under the control of the audited structure and consequently the results will not be modified because the lower staff will always try to protect themselves.
A key challenge for wireless networks in which nodes can move is for each node to keep track of its dynamically changing set of nearby nodes (neighbors). We present a solution for nodes to maintain neighbor knowledge ...
详细信息
ISBN:
(纸本)9781457702952
A key challenge for wireless networks in which nodes can move is for each node to keep track of its dynamically changing set of nearby nodes (neighbors). We present a solution for nodes to maintain neighbor knowledge where nodes communicate via wireless broadcast and are restricted to move on a two-dimensional road network. A road network is a collection of one-dimensional lines that may intersect each other. For nodes to exchange neighbor information, we construct a deterministic collision-free broadcast schedule which utilizes time division multiplexing and geographical segmentation. Under a certain node density requirement and assuming initial neighbor knowledge, our broadcast schedule tolerates node movement on the road network while providing deterministic guarantees in maintaining neighbor knowledge. We also provide a lower bound on the speed of a message propagation given our broadcast schedule. In addition, we consider grouping nodes into clusters and show that, under certain conditions, neighbor knowledge is maintained when two different clusters move close to each other. Finally, we address the issue of obtaining initial neighbor knowledge.
Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. This paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cl...
详细信息
ISBN:
(纸本)9780769548791
Assume that each vertex of an arbitrary n-vertex tree T is assigned a nonnegative integer weight. This paper considers partitioning the vertices of tree T into p disjoint clusters such that the total weight of each cluster is at least l and at most u, where l and u are given integers with l
In this paper, we present Automatic Network-based Testing Service (ANTS), a web service to verify functionality of a semiconductor intellectual property (IP) core or a system-on-a-chip (SoC), using computers attached ...
详细信息
ISBN:
(纸本)9781467329880;9781467329897
In this paper, we present Automatic Network-based Testing Service (ANTS), a web service to verify functionality of a semiconductor intellectual property (IP) core or a system-on-a-chip (SoC), using computers attached to network. ANTS system performs automated regression testing of IP/SoC cores whenever design change has been made. ANTS system manages a lot of computers and FPGA prototyping boards in computing farm or in an office. FPGA boards are initialized by ANTS automatically. Engineers use web browsers to control ANTS and to see the test results on the fly. We provide users with a skeleton code generator so that they can easily make their own verification projects/applications working on ANTS. One of automated tests with 25 ANTS computers becomes 100 times faster than manual execution of a single C-Model.
We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially maliciou...
详细信息
ISBN:
(纸本)9781457702952
We consider the problem of reliably broadcasting information in a multihop asynchronous network that is subject to Byzantine failures. That is, some nodes of the network can exhibit arbitrary (and potentially malicious) behavior. Existing solutions provide deterministic guarantees for broadcasting between all correct nodes, but require that the communication network is highly-connected (typically, 2k + 1 connectivity is required, where k is the total number of Byzantine nodes in the network). In this paper, we investigate the possibility of Byzantine tolerant reliable broadcast between most correct nodes in low-connectivity networks (typically, networks with constant connectivity). In more details, we propose a new broadcast protocol that is specifically designed for low-connectivity networks. We provide sufficient conditions for correct nodes using our protocol to reliably communicate despite Byzantine participants. We present experimental results that show that our approach is especially effective in low-connectivity networks when Byzantine nodes are randomly distributed.
There are considerations on the problem of time-consuming calculations in this article. This type of computational problems concerns to multiple aspects of earth sciences. distributed computing allows to perform calcu...
详细信息
ISBN:
(纸本)9783642312168
There are considerations on the problem of time-consuming calculations in this article. This type of computational problems concerns to multiple aspects of earth sciences. distributed computing allows to perform calculations in reasonable time. This way of processing requires a cluster architecture. The authors propose using Apache Hadoop technology to solve geophysics inversion problem. This solution is designed rather for analyzing data, but it also enables to perform computations. There is an architecture of solution proposed and real test carried out to determine the performance of method.
Computer simulations need a large amount of computational resources. We've believed that tightly-coupled computer is the first choice to perform the large scale simulations. This approach developing supercomputers...
详细信息
ISBN:
(纸本)9780769547374;9781467320016
Computer simulations need a large amount of computational resources. We've believed that tightly-coupled computer is the first choice to perform the large scale simulations. This approach developing supercomputers never allows users to execute the interactive simulations so far. Here, a real time simulation indicates an interactive or streaming supercomputing, not batch queue one. The advantage of the streaming can be found when users execute coupled simulations combining a number of different simulations. To overcome the conventional batch queue supercomputing, we consider the effect of the characteristics of the internet. We proposed a strategic streaming supercomputing model to estimate total cost of the coupled simulation in widely distributed computing environment.
With network developed quickly and used widely, how to store mass data has become a problem we have to face. Traditional methods usually add more servers into to increase computing speed and storage ability, while the...
详细信息
ISBN:
(纸本)9781467302395
With network developed quickly and used widely, how to store mass data has become a problem we have to face. Traditional methods usually add more servers into to increase computing speed and storage ability, while the hardware cost is very expensive and the storage efficiency is low. Through deep study of MapReduce programming model and Hadoop framework, this paper presented a mass data storage model based on Hadoop framework, then we designed and implemented a mass data storage system for campus network based on cloud computing. This system can effectively solved issues in mass data storage management in teaching and study. This system is cheap, easily operated, fast dealing and stable.
暂无评论