15110406
Grid Service Agents for Real Time Traffic Synchronization
Grid Service Agents for Real Time Traffic Synchronization is proposed in this research. The paper presents Air Traffic Flow Management (ATFM) problem and its synchronization property. For such a complex problem, using grid computing with multi-agent coordination and negotiation techniques to improve ATFM computational efficiency is the main objective of actual even further research. To demonstrate the developed model - Air Traffic Flow Management in Grid Computing (ATFMGC), the grid architecture, the basic components and relationships among them are described. At the same time, the function of agents, their knowledge representation and inference processes are also discussed. As an example, a tactical planning case study related with some Brazilian airports is illustrated.
31100803
Web Search Based on Ant Behavior: Approach and Implementation in Case of Interlegis
The World Wide Web today is considered the biggest information and knowledge source in every field. These Web pages are accessed daily by a great quantity of people with different interests. However, they are heterogeneously constructed both in available information and quality and majorities are presented in HTML language. This manner limits and makes it difficult to extract useful information and knowledge using simple search by Internet. The process of surfing the Web is similar to ant colonies foraging (Beckers, Deneubourg & AbstrAct
12034739
An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank
An algorithm was developed and implemented to find controllers from the stock shares for some financial institutions for the Brazilian Central Bank (BCB). The original problem is similar to a typical Sum of Subset problem that is suggested to be solved by a backtracking algorithm and the problem complexity is NP-complete. Usually BCB solves this problem manually which is time consuming and prone to errors. The heuristical approximation algorithm presented in this paper has polynomial complexity O(n3) and is based on subroutines for determining controllers at the first two levels. The paper describes the basic concepts and business rules currently employed in BCB, our algorithm and its major subroutines, it gives a brief complexity analysis and an example illustration at level 2. Our experimental results indicate the feasibility of an automation of the process of finding controllers. Though developed for BCB, our algorithm works equally well for other financial institutions.
37514455
An Algorithm for Determining the Controllers of Supervised Entities at the First Level: Brazilian Central Bank Case Study
To find controllers from the stock shares of a financial institution is an important task in the Brazilian Central Bank (BCB). The original problem is typically called Sum of Subset and suggested to be resolved by backtrack algorithm with NP-complete complexity. Currently BCB solves this problem manually which is time consuming and suffered from errors. In this study, an approximation algorithm with polynomial complexity O(n) for determining controllers was developed and implemented in BCB. This algorithm includes subroutines for determining controller at levels 1, 2, 3 and the main loops of combination. This paper describes the basic concepts and business rules currently employed in BCB, complexity analysis of the algorithm and its step by step applications at the first level. The implementation and experiment results indicate the feasibility of automation of controllers finding process. Though developed for BCB, it works equally well for all financial institutions which are controlled by stockholders in Brazil.
9628721
A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time
In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. The PCS network consists of homogeneous cells and each cell consists of a finite number of channels. Under the conditions that both cell's residence time and the requested call holding time possess the general phase type (PH) distribution, we obtain the distribution of the channel holding times, the new call blocking probability and the handoff call failure probability. Furthermore, we prove that the cell residence time is PH distribution if and only if• the new call channel holding time is PH distribution; or• the handoff call channel holding time is PH distribution; or• the call channel holding time is PH distribution;provided that the requested call holding time is a PH distribution and the total call arrival process is a MAP. Also, we prove that the actual call holding time of a non-blocked new call is a mixture of PH distributions. We then developed the Markov process for describing the system and found the complexity of this Markov process. Finally, two interesting measures for the network users, i.e., the duration of new call blocking period and the duration of handoff call blocking period, are introduced; their distributions and the expectations are then obtained explicitly.
8155707
A Question Answering System Supported by Information Extraction
This paper discusses an information extraction (IE) system, Textract, in natural language (NL) question answering (QA) and examines the role of IE in QA application. It shows: (i) Named Entity tagging is an important component for QA, (ii) an NL shallow parser provides a structural basis for questions, and (iii) high-level domain independent IE can result in a QA breakthrough.
17270817
Grid Computing in China
Abstract
Grid computing presents a new trend to distributed computation and Internet applications, which can construct a virtual single image of heterogeneous resources, provide uniform application interface and integrate widespread computational resources into super, ubiquitous and transparent aggregation. In the adoption of Grid computing, China, who is facing more resource heterogeneity and other specific demands, has put much effort on both research and practical utilization. In this paper, we introduce the major China Grid research projects and their perspective applications. First we give the overview of the four government-sponsored programs in Grid, namely the China National Grid, ChinaGrid, NSFC Grid, and ShanghaiGrid. Then we present six representative ongoing Grid systems in details, which are categorized into Grid middleware and Grid application. This paper provides the general picture of Grid computing in China, and shows the great efforts, devotion and confidence in China to use Grid technology to boost the society, economics and scientific research.

6293846
Cryptographic Key Generation from Biometric Data Using Lattice Mapping
Crypto-biometric systems are recently emerging as an effective process of key management to address the security weakness of conventional key release systems using pass-codes, tokens or pattern recognition based biometrics. This paper presents a lattice mapping based fuzzy commitment method for cryptographic key generation from biometric data. The proposed method not only outputs high entropy keys, but also conceals the original biometric data such that it is impossible to recover the biometric data even when the stored information in the system is open to an attacker. Simulated results have demonstrated that its authentication accuracy is comparable to the well-known k-nearest neighbour classification
18531635
A generalized model for network survivability
The high expectation of network to be available and perform at all time has created growing concerns between network operators and engineers all over the globe. Network should be available to users whenever they want to use them. In the wake of an attack, network should be also able to recover as soon as possible. A survivable network is one that can provide services in the presence of an attack or failure and be able to recover fully in a timely manner. Designing a model for network survivability basically involves the understanding of three key issues, i.e, how the system will function in the wake of failures, what will be the impact of failures on the user, and how to overcome these failures. To achieve these goals, this paper proposes a quantitative approach to evaluate the network survivability in terms of using a generalized model; we consider a more complex system with several faults to study the survivability of a network using Markov chain. In presenting a better survivability performance, some numerical comparisons for the network availability, failure frequency and survivability is also developed.