ppxscal/embedding_network huggingface dataset:
Architectures and algorithms for fault management in optical wdm networks
Authors: Jing Zhang
Venue:  (2005)

With the maturing of wavelength-division multiplexing (WDM) technology, one single strand of fiber can provide tremendous bandwidth (potentially a few tens of terabits per second) by multiplexing many non-overlapping wavelength channels. In a wavelength-routed WDM network, with the relatively high frequency of network failures, and the tremendous traffic loss a failure may cause, fault management becomes a critical concern in network design and its real-time operation. This dissertation investigates architectures and algorithms for survivable optical networks. The dissertation first presents a broad overview of the fault-management mechanisms involved in deploying a survivable optical mesh network. Different parameters are presented which can measure the quality of service (QoS) provided by a WDM mesh network to upper protocol layers, such as service availability, service reliability, restoration time, and service restorability. It reviews the concepts, the factors that affect them, and how to improve them. Next, the dissertation investigates the problem of using optimal path pair as the routes for the primary and backup paths in a WDM network with and without wavelength-conversion capability. It proves that the problem is NP-complete in wavelength-continuous networks. In order to satisfy a connection's service-availability requirement in a cost-effective manner, we need a systematic mechanism to select a proper protection scheme for each connection request. Connection availability is proposed to use as a metric to provide differentiated protection services. A mathematical model is developed to analyze the availabilities of connections with different protection modes. Integer linear program (ILP) and heuristic approaches are studied to provision the connections cost effectively while satisfying the connections' availability requirements. To combat the effect of multiple concurrent failures, new backups can be reprovisioned after one failure such that the next potential failure can be handled effectively and efficiently. Backup reprovisioning approaches are proposed and studied under a novel network model. Optical burst switching (OBS) is a promising technique for supporting high-capacity, bursty data traffic over optical WDM networks. The fault-management issues in an OBS network are studied. A pre-planned global rerouting scheme is proposed to balance network load and a novel fault-tolerant node architecture is proposed to quickly restore the bursts on a failed link.
Application of design for verification with concurrency controllers to air traffic control software
Authors: Aysu Betin-Can, Tevfik Bultan, Mikael Lindvall, Benjamin Lux, Stefan Topp
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We present an experimental study which demonstrates that model checking techniques can be effective in finding synchronization errors in safety critical software when they are combined with a design for verification approach. We apply the concurrency controller design pattern to the implementation of the synchronization operations in Java programs. This pattern enables a modular verification strategy by decoupling the behaviors of the concurrency controllers from the behaviors of the threads that use them using interfaces specified as finite state machines. The behavior of a concurrency controller can be verified with respect to arbitrary numbers of threads using infinite state model checking techniques, and the threads which use the controller classes can be checked for interface violations using finite state model checking techniques. We present techniques for thread isolation which enables us to analyze each thread in the program separately during interface verification. We conducted an experimental study investigating the effectiveness of the presented design for verification approach on safety critical air traffic control software. In this study, we first reengineered the Tactical Separation Assisted Flight Environment (TSAFE) software using the concurrency controller design pattern. Then, using fault seeding, we created 40 faulty versions of TSAFE and used both infinite and finite state verification techniques for finding the seeded faults. The experimental study demonstrated the effectiveness of the presented modular verification approach and resulted in a classification of faults that can be found using the presented approach.
Generalized Vector Quasi-Variational Inequality Problems Over Product Sets
Authors: Q. H. Ansari, S. Schaible, J. C. Yao
Venue: Journal of Global Optimization (2005)

In this paper we consider vector quasi-variational inequality problems over product sets (in short, VQVIP). Moreover we study generalizations of this model, namely problems of a system of vector quasi-variational inequalities (in short, SVQVIP), generalized vector quasi-variational inequality problems over product sets (in short, GVQVIP) and problems of a system of generalized vector quasi-variational inequalities (in short, SGVQVIP). We show that every solution of (VQVIP) (respectively, (GVQVIP)) is a solution of (SVQVIP) (respectively, (SGVQVIP)). By defining relatively pseudomonotone and relatively maximal pseudomonotone maps and by employing a known fixed point theorem, we establish the existence of a solution of (VQVIP) and (SVQVIP). These existence results are then used to derive the existence of a solution of (GVQVIP) and (SGVQVIP), respectively, The results of this paper extend recent results in the literature. They are obtained in a more general setting.
Radial Basis Neural Network Learning Based on Particle Swarm Optimization to Multistep Prediction of Chaotic Lorenz's System
Authors: Fabio A. Guerra, Leandro dos S. Coelho
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

This paper presents a hybrid training approach to radial basis function neural networks (RBF-NN). It uses clustering methods to tune the centers of the Gaussian functions used in the hidden layer of a RBF-NN. It also uses particle swarm optimization for centers and spread tuning and the Penrose-Moore pseudo-inverse to adjust the weight's output of the network. Simulations involving this RBF-NN design to identify the chaotic Lorenz' system indicate that the performance of proposed method is better that conventional RBF-NN trained for k-means for multi-step-ahead forecasting.
Minimal Slicing and the Relationships Between Forms of Slicing
Authors: Dave Binkley, Sebastian Danicic, Tibor Gyimothy, Mark Harman, Akos Kiss, Bogdan Korel
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

The widespread interest in program slicing within the source code analysis and manipulation community has led to the introduction of a large number of different slicing techniques. Each preserves some aspect of a program¿s behaviour and simpli?es the program to focus exclusively upon this behaviour. In order to understand the similarities and differences between slicing techniques, a formal mechanism is required. This paper establishes a formal mechanism for comparing slicing techniques using a theory of program projection. Sets of minimal slices, which form the ideal for any slicing algorithm, are used to reveal the ordering relationship between various static and dynamic slicing techniques.
Hybrid Genetic Algorithm and Simulated Annealing (HGASA) in Global Function Optimization
Authors: Dingjun Chen, Chung-Yeol Lee, Cheol Hoon Park
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We have implemented the sequential HGASA on a Sun Workstation machine; its performance seems to be very good in finding the global optimum of a sample function optimization problem as compared with some sequential optimization algorithms that offer low efficiency and limited reliability. However, the sequential HGASA generally needs a long run time cost. So we implemented a parallel HGASA using Message Passing Interface (MPI) on a high performance computer and performed many tests using a set of frequently used function optimization problems. The performance analysis of this parallel approach has been done on IBM Beowulf PCs Cluster in terms of program execution time, relative speed up and efficiency.
Next Generation Agent Development Supporting Tool: Case Study
Authors: Hyunsang Youn, Sungwook Hwang, Heeyong Youn, Eunseok Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Agent Based Development is a new technology that has been recently used in many domains. However, the development of an agent-based system can be difficult and time-consuming for inexperienced developers. To address this problem, in this paper, we propose a pattern based agent development and support tool. This approach facilitates rapid agent development and addresses common design problem. The agent patterns are classified according to function. We apply this approach for agent development, based on a travel assistant scenario.
An Administration Model of DRBAC on the Web
Authors: Qi Li, Jingpu Shi, Sihan Qing
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Role-based Access Control (RBAC) model has been widely deployed for web security in recent years. In some large-enterprise-wide situations, however, this model is difficult to manage due to huge amount of users, roles and interrelationships. As a result, the applications of this model are greatly limited. To address this problem, we present in this paper a Decentralized RBAC model (DRBAC) by proposing a new concept of groups and by introducing non-trivial modifications to the user-role assignment of the existing models.
Rich results from poor resources: NTCIR-4 monolingual and cross-lingual retrieval of korean texts using chinese and english
Authors: Kui Lam Kwok, Sora Choi, Norbert Dinstl
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2005)

We report on Korean monolingual, Chinese-Korean English-as-pivot bilingual, and Chinese-English bilingual CLIR experiments using MT software augmented with Web-based entity-oriented translation as resources in the NTCIR-4 environment. Simple stemming is helpful in improving bigram indexing for Korean retrieval. For word indexing, keeping nouns only is preferable. Web-based translation reduces untranslated terms left over after MT and substantially improves CLIR results. Translation concatenation is found to consistently improve CLIR effectiveness, while combining a retrieval list from bigram and word indexing is also helpful. A method to disambiguate multiple MT outputs using a log likelihood ratio threshold was tested. Depending on the nature of the title or description queries, bigram only or a retrieval combination, or relaxed or rigid evaluations, direct bilingual CLIR returned an average precision of 71--79&percnt; (English-Korean) and 76--84&percnt; (Chinese-English) of the corresponding Korean-Korean and English-English monolingual results. Using English as a pivot in Chinese-Korean CLIR provides about 55--65&percnt; the effectiveness that Korean alone does. Entity/terminology translation at the pivot language stage accounts for a large portion of this deficiency. A topic with comparatively worse Chinese-English bilingual result does not necessarily mean that it will continue to under-perform (after further transitive Korean translation) at the Korean retrieval level.
Low Latency and Power Efficient VD Using Register Exchanged State-Mapping Algorithm
Authors: Sang-Ho Seo, Sin-Chong Park
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, a new implementation of the Viterbi decoder is proposed. RE state-mapping algorithm combines TB algorithm with the RE algorithm. By updating the starting point of the state for each memory bank, the trace back operation can be eliminated. This result reduces the latency of the TB algorithm and the resource usage of RE algorithm. When the memory unit is 3, the resource usage is 6306 bits and the latency is 72 clock. The resource usage is 74% smaller than the RE algorithm. and the latency is 34% smaller than the k-pointer even TB algorithm.The power consumption of each algorithms are also analyzed and compared. Because the resource usage is directly related to the power, the power consumption of this scheme is also reduced [8]. Actually, the estimated power consumption is about 12% smaller than the RE algorithm.
Avatar-centric Risk Evaluation
Authors: Maria-Cruz Villa-Uriol, Falko Kuester, Oscar Garcia Panella, J. Andres Fernandez Munuera
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Hazard detection and prevention of natural and manmade disasters at critical civil infrastructure is becoming increasingly important. Recent events, such as earthquakes and terrorist attacks, clearly demonstrated the societal and economical impact stemming from the limitations and uncertainty within currently deployed emergency response systems. We present a new data visualization and simulation platform that will facilitate risk detection, emergency response and assessment in hazardous situations. The platform is based on the acquisition, modeling and analysis of sensor data, to capture objects and temporal changes in the observed spaces. Avatars are acquired, inserted and tracked in a virtual environment, enabling the simulation of multiple perilous situations and assisting in determining possible risk mitigation strategies. While the initial research focus is on algorithms and techniques in the field of hazard detection and prevention using path planning, the results can also be applied to diverse fields such as media contents development, cultural heritage, e-learning, teleconferencing, animation and video gaming.
A multi-agent system architecture for mobile robot navigation based on fuzzy and visual behaviour
Authors: Rafael Muñoz-Salinas, Eugenio Aguirre, Miguel García-Silvente, Moisés Gómez
Venue: Robotica (2005)

A multi-agent system based on behaviour for controlling the navigation task of a mobile robot in office-like environments is presented. The set of agents is structured into a three-layer hybrid architecture. A high level of abstraction plan is created using a topological map of the environment in the Deliberative layer. It is composed by the sequence of rooms and corridors to traverse and doors to cross in order to reach a desired room. The Execution and Monitoring layer translates the plan into a sequence of available skills in order to achieve the desired goal and monitors the execution of the plan. In the Control layer there is a set of agents that implements fuzzy and visual behaviours that run concurrently to guide the robot. Fuzzy behavior manages the vagueness and uncertainty of the range sensor information allowing to navigate safely in the environment. Visual behavior locates a required door to cross and fixate it, indicating the appropriate direction to reach it. Artificial landmarks are placed beside the doors to show its position. The system has been implemented in a Nomad 200 mobile robot and has been validated in numerous experiments in a real office-like environment.
Self-Organizing Maps of Position Weight Matrices for Motif Discovery in Biological Sequences
Authors: Shaun Mahony, David Hendrix, Terry J. Smith, Aaron Golden
Venue: Artificial Intelligence Review (2005)

The identification of overrepresented motifs in a collection of biological sequences continues to be a relevant and challenging problem in computational biology. Currently popular methods of motif discovery are based on statistical learning theory. In this paper, a machine-learning approach to the motif discovery problem is explored. The approach is based on a Self-Organizing Map (SOM) where the output layer neuron weight vectors are replaced by position weight matrices. This approach can be used to characterise features present in a set of sequences, and thus can be used as an aid in overrepresented motif discovery. The SOM approach to motif discovery is demonstrated using biological sequence datasets, both real and simulated
What Influences the Requirements Process in Industry? A Report on Industrial Practice
Authors: Ian Alexander, Suzanne Robertson, Neil Maiden
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

What influences the way people in industry (including commerce and government) do their requirements work? This survey, using a short questionnaire, found that the main influences were training, an organisation¿s own standards, tools, the regulator, first principles, and experienced colleagues. Sources of process knowledge outside organisations had little influence.
Software Comprehension/Maintenance: An Introductory Course
Authors: Milton A. Austin III, M. H. Samadzadeh
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Software maintenance is a costly problem for industry, typically taking up to 50-75% of the cost of software development [13]. Traditional Computer Science programs often do not prepare students to face this problem. Since a large part of software maintenance is software comprehension, better comprehension methods are the answer to the problem. Students often do not know how to comprehend already written code and do not know how to work in groups. This paper proposes a course that has been designed to better prepare students for work in the area of software maintenance by teaching them software comprehension methods. The course includes best practices, a large-scale project, and focuses primarily on code comprehension methods.
Table Recognition Evaluation and Combination Methods
Authors: Ferihane Kboubi, Anja Habacha Chabi, Mohamed Ben Ahmed
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a new approach of document analysis and recognition (DAR) based on the combination of OCR systems. The proposed approach aims to improve the document recognition by combining the result of several OCR systems according to their performances. We focus our attention, in this paper, on the table combination. We start by presenting the results of the evaluation of OCR system in the table block recognition. Then, we present our table combination method. We are interested in both table structure and table content.
Requirements Capture for Cougaar Model-Driven Architecture System
Authors: Boby George, H. Lally Singh, Shawn A. Bohner, Denis Gra!canin
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The Cognitive Agent Architecture (Cougaar) is a distributed agent architecture framework originally developed to build large scale logistics applications for the Department of Defense. In order to facilitate rapid development of complex military and commercial Cougaar applications, we are devising "recipes" on how to automate the Cougaar application development process. The envisioned Cougaar Model Driven Architecture (CMDA) system will capture requirements from the user and automatically generate related software artifacts such as requirement, design, code and test cases. The automated generation of software artifacts, even if partial in nature, should considerably increase the productivity of Cougaar developers. Recognizing the sophistication of the Cougaar framework and the limitations of current transformation technologies, we have systematically developed an approach that combines component assembly in the large with transformations in the small. The approach's ability to generate accurate software artifacts depends largely on how user requirements are captured and transformed. The CMDA system employs innovative approaches and techniques to enable users represent their requirements properly. This paper briefly describes the CMDA system, its user interface and the various inputs captured from the user.
Secrecy types for a simulatable cryptographic library
Authors: Peeter Laud
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

We present a type system for checking secrecy of messages handled by protocols that use the Backes-Pfitzmann-Waidner library for cryptographic operations. A secure realization of this library exists, therefore we obtain for the first time a cryptographically sound analysis for a full language for expressing protocols, particularly handling symmetric encryption and unbounded number of sessions. The language is similar to the spi-calculus, but has a completely deterministic semantics. The type system is similar to the Abadi-Blanchet type system for asymmetric communication.
PAT: a postmortem object access pattern analysis and visualization tool
Authors: Weijian Fang, Cho-Li Wang, Wenzhang Zhu, F. C. M. Lau
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Applying a cache coherence protocol capable of adapting to memory access patterns is a viable approach to improving the performance of software distributed shared memory. In this paper, we present an approach of postmortem memory access pattern analysis and visualization, which has been applied to our design of a global object space for a distributed Java Virtual Machine. The tool not only can enhance our understanding of the access patterns inherent in an application but can also help us to evaluate the effectiveness of an adaptive protocol used in the design of the global object space.
Bamboo: an architecture modeling and code generation framework for configuration management systems
Authors: Guozheng Ge, E. James Whitehead
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We describe an architecture modeling and code generation framework called Bamboo. Using Bamboo, engineers design SCM repository and feature models, and then generate a running SCM system from the models.
Intricacies of Collins' Parsing Model
Authors: Daniel M. Bikel
Venue: Computational Linguistics (2004)

This article documents a large set of heretofore unpublished details Collins used in his parser, such that, along with Collins' (1999) thesis, this article contains all information necessary to duplicate Collins' benchmark results. Indeed, these as-yet-unpublished details account for an 11% relative increase in error from an implementation including all details to a clean-room implementation of Collins' model. We also show a cleaner and equally well-performing method for the handling of punctuation and conjunction and reveal certain other probabilistic oddities about Collins' parser. We not only analyze the effect of the unpublished details, but also reanalyze the effect of certain well-known details, revealing that bilexical dependencies are barely used by the model and that head choice is not nearly as important to overall parsing performance as once thought. Finally, we perform experiments that show that the true discriminative power of lexicalization appears to lie in the fact that unlexicalized syntactic structures are generated conditioning on the headword and its part of speech.