ppxscal/embedding_network huggingface dataset:
Towards Efficient Selection of Web Services with Reinforcement Learning Process
Authors: Dongjun Cai, Zongwei Luo, Kun Qian, Yang Gao
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

As an emerging technology for implementing web services over the Internet, mobile agent model has several advantages over the traditional RPC model. However, with the popularity of distributed networks (e.g. Internet), web service providers tend to rely on external resources to complete certain tasks. This definitely increases the difficulty in locating appropriate service providers according to clients' requirements in the new scenario. To address this issue, we propose a reinforcement learning process based on the mobile agent model, which makes agents more efficient and intelligent in selecting web service providers. Finally, an implementation of our prototype is presented.
GridSPN: a Grid-based non Markovian Petri Nets Tool
Authors: S. Distefano, A. Puliafito, M. Scarpa
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper describes the new features implemented in WebSPN, a modeling tool for the analysis of non-Markovian stochastic Petri nets. WebSPN adopts a discretization of time and an approximation of non-exponentially distributed firing time transitions by means of the Phase type distribution. To improve the MPICH parallel implementation of this algorithm, in this paper we describe the porting of WebSPN from the MPI to the Grid computational paradigm. Besides a better flexibility in accessing computational and storage resources, one of the main advantages is the introduction of a Fault Recovery System to detect and recover from eventual machine faults. The resulting new tool is named Grid- SPN.
A Scalable, Self-Routed, Terabit Capacity, Photonic Interconnection Network
Authors: Assaf Shacham, Benjamin G. Lee, Keren Bergman
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

We present SPINet (Scalable Photonic Integrated Network), an optical switching architecture particularly designed for photonic integration. The performance of SPINet-based networks is investigated through simulations, and it is shown that SPINet can provide the bandwidth demanded by high performance computing systems while meeting the ultra-low latency and scalability requirements. Experiments are conducted on a model SOA-based switching node to verify the feasibility of the SPINet concepts, and demonstrate error-free routing of 160 Gb/s peak bandwidth payload.
The Multicast MPLS Tree Construction Protocol: Evaluation, Simulation and Implementation
Authors: Ali Baudani
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

In this paper, we study multicast tree construction inMPLS network. We discuss the difficulty in combining multicast and MPLS in a network. We describe some MPLS proposals for the multicast traffic and we justify the need for defining a new protocol. Thereafter we propose MMT, the MPLS Multicast Tree protocol , which uses MPLS LSP (Label switched Path) between multicast tree branching nodes in order to reduce the multicast routing states in routers and to increase scalability. We present improvements to MMT protocol and we evaluate it in term of scalability. We present simulation results to validate our evaluation. Finally. we describe the MMT protocol implementation under Linux which is an experimentation in seen of standardization
Simulation of a queueing problem with balking
Authors: M. H. L. van Tits, H. J. M. van der Veeken
Venue: ACM SIGSIM Simulation Digest (1979)

Queueing theory becomes considerably more complicated if impatient customers fail to join the queue, so-called balking. Analytical results have been obtained for the standard queueing problem (M/M/1) with balking, i.e., formulae have been derived for the expected queue-length and the expected waiting-time. This report describes an investigation into the general validity of these formulae. Since an analytical approach to the problem has so far proved to be unfeasible, simulation was used. We tried to construct an efficient simulation model. The model was analysed using regenerative properties - a technique which provides a solution to the problem of correlated simulation observations. The results we found were partly an extension of the standard queueing theory and partly an indication for further theoretical investigation.
Hybrid Recognition for One Stroke Style Cursive Handwriting Characters
Authors: Teng Long, Lian-Wen Jin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

On-line handwriting recognition has continued to persist as a popular research field while pen computing applications are widely used in recent years. This paper proposes a novel hybrid system for one stroke style cursive handwriting character recognition. In the system, user can use fingertip to write various kinds of virtual characters (represented by trajectory of fingertip) such as alpha-numeric characters and Chinese characters through a digital camera based user interface. Without pen-up and pen-down information, the virtual characters are written in one stroke. An on-line and an off-line recognition method for such kind of cursive characters are proposed. A hybrid approach of these two methods is proposed to combine the advantages of both of them. Benefit from the integration, the recognition accuracy was increased from 80.6% (off-line classifier) and 83.4% (on-line classifier) to 90.9% (integrated) for stroke order free one stroke cursive handwriting Chinese characters.
Empirical Validation of Object-Oriented Metrics on Open Source Software for Fault Prediction
Authors: Tibor Gyimothy, Rudolf Ferenc, Istvan Siket
Venue: IEEE Transactions on Software Engineering (2005)

Open source software systems are becoming increasingly important these days. Many companies are investing in open source projects and lots of them are also using such software in their own work. But, because open source software is often developed with a different management style than the industrial ones, the quality and reliability of the code needs to be studied. Hence, the characteristics of the source code of these projects need to be measured to obtain more information about it. This paper describes how we calculated the object-oriented metrics given by Chidamber and Kemerer to illustrate how fault-proneness detection of the source code of the open source Web and e-mail suite called Mozilla can be carried out. We checked the values obtained against the number of bugs found in its bug database¿called Bugzilla¿using regression and machine learning methods to validate the usefulness of these metrics for fault-proneness prediction. We also compared the metrics of several versions of Mozilla to see how the predicted fault-proneness of the software system changed during its development cycle.
ReCord: A Distributed Hash Table with Recursive Structure
Authors: Jianyang Zeng, Wen-Jing Hsu
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized- Chord and offers improved tradeoffs in performance and topology maintenance over existing P2P systems. ReCord is scalable and can be easily implemented as an overlay network, and offers a good tradeoff between the node degree and query latency. For instance, an n-node ReCord with O(log n) node degree has an expected latency of \theta (\log n) hops. Alternatively, it can also offer \theta (\frac{{\log n}}{{\log \log n}}) hops latency at a higher cost of o(\frac{{\log ^2 n}}{{\log \log n}}) node degree.Meanwhile, simulations of the dynamic behaviors of ReCord are studied.
Part-based shape retrieval
Authors: Mirela Tanase, Remco C. Veltkamp
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper introduces a measure for computing the dissimilarity between multiple polylines and a polygon based on the turning function, and describes a part-based retrieval system using that dissimilarity measure. This dissimilarity can be efficiently computed in time O(kmn log mn), where m denotes the number of vertices in the polygon, and n is the total number of vertices in the k polylines that are matched against the polygon. This dissimilarity measure identifies similarities even when a significant portion of one shape is different from the other, for example because the shape is articulated, or because of occlusion or distortion. The effectiveness of the dissimilarity measure in demonstrated in a part-based shape retrieval system. Quantitative experimental verification is performed with a known ground-truth, the MPEG-7 Core Experiment test set, in a comparison with the Curvature Scale Space method, and a global turning angle function method.
Initial Lessons Learned from the Definition and Implementation of a Platform Requirements Engineering Process at Intel Corporation
Authors: Sarah Nesland
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

In many companies a communication divide exists between the disciplines of engineering, strategic planning, and marketing. The divide can be caused by various factors including conflicting goals, cultural differences and different world views. The resulting communication gaps can affect the planning and design of new products and can have a highly negative effect on requirements activities. As part of an attempt to solve this problem within Intel¿s Desktop Platform Group (DPG), a platform requirements engineering system has been defined and is being implemented. The system¿s implementation is recent, but there are lessons learned from its early development and use that provide a foundation for success on projects of this type: 1. Focus on fixing the problems deemed most important by business customers first and work outward from there 2. Develop champions at the working level to proliferate a common requirements language and requirements practices 3. Use examples to help individuals articulate process needs and necessary work products. Define standards early to support process definition. 4. Develop a system that encourages and rewards for practice and feedback to prevent defects and make the system stronger.
Approximation Algorithms for Scheduling Multiple Feasible Interval Jobs
Authors: Jian-Jia Chen, Jun Wu, Chi-Sheng Shih, Tei-Wei Kuo
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible intervals. A job fails if the job remains incomplete at the end of the last feasible interval. This paper is concerned with how to find a schedule in which the number of jobs completed in one of their feasible intervals is maximized. We show that the maximization problem is NP-hard for both non-preemptible and preemptible jobs. This paper develops two approximation algorithms for non-preemptible and preemptible jobs. When jobs are non-preemptible, Algorithm LECF is with a 2-approximation factor; when jobs are preemptible, Algorithm LEF is proved being a 3-approximation algorithm. We also show that our analysis on the two algorithms is tight by providing a set of input instances. Simulation results demonstrate that Algorithms LECF and LEF not only guarantee the approximation factors but also outperform other multiple feasible interval scheduling algorithms.
Toward a threat model for storage systems
Authors: Ragib Hasan, Suvda Myagmar, Adam J. Lee, William Yurcik
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

The growing number of storage security breaches as well as the need to adhere to government regulations is driving the need for greater storage protection. However, there is the lack of a comprehensive process to designing storage protection solutions. Designing protection for storage systems is best done by utilizing proactive system engineering rather than reacting with ad hoc countermeasures to the latest attack du jour. The purpose of threat modeling is to organize system threats and vulnerabilities into general classes to be addressed with known storage protection techniques. Although there has been prior work on threat modeling primarily for software applications, to our knowledge this is the first attempt at domain-specific threat modeling for storage systems. We discuss protection challenges unique to storage systems and propose two different processes to creating a threat model for storage systems: one based on classical security principles Confidentiality, Integrity, Availability, Authentication, or CIAA) and another based on the Data Lifecycle Model. It is our hope that this initial work will start a discussion on how to better design and implement storage protection solutions against storage threats.
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
Authors: Andreas W&#x00e4;chter, Lorenz T. Biegler
Venue: Mathematical Programming: Series A and B (2006)

We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix. Heuristics are also considered that allow faster performance. This method has been implemented in the IPOPT code, which we demonstrate in a detailed numerical study based on 954 problems from the CUTEr test set. An evaluation is made of several line-search options, and a comparison is provided with two state-of-the-art interior-point codes for nonlinear programming.
Large-Object Range Data Acquisition, Fusion and Segmentation
Authors: Reyhaneh Hesami, Alireza Bab-Hadiashar, Niloofar Gheissari
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper presents the design of a low cost large-scale 3D scanner. A pan-tilt unit, a camera and a laser distance meter are combined to capture the required range and intensity data. Innovative methods for calibrating the device and fusion of the intensity and range data are introduced. Once a reliable data achieved, a parametric segmentation technique has been adopted to segment the range images into planar surfaces. Experimental results show that even for data corrupted by a large number of outliers (due to people movement in front of the imaged buildings), range and intensity data are highly consistence and segmentation algorithm has been able to properly segment coplanar areas.
Designing a Hybrid AI System as a Forex Trading Decision Support Tool
Authors: Lean Yu, Kin Keung Lai, Shouyang Wang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this study, a hybrid artificial intelligent (AI) system integrating neural network and expert system is proposed to support foreign exchange (forex) trading decisions. In this system, a neural network is used to predict the forex price in terms of quantitative data, while an expert system is used to handle qualitative factor and to provide forex trading decision suggestions for traders incorporating experts' knowledge and the neural network's results. The effectiveness of the proposed hybrid AI system is illustrated by simulation experiments.
Personalized Cyber Face: A Novel Facial Modeling Approach using Multi-Level Radial Basis Function
Authors: Chen Chen, Edmond Cyril Prakash
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, we propose a facial modeling system using our novel multilevel adaption procedure. We model a template head model with physical structure to synthesize the various facial expression. To make the template model suitable for different facial geometry, landmarks compliant to MPEG-4 Facial Definition Parameters (FDP) are labeled on this model. Then another personalized 3D head with different geometrical information is labeled with a subset of these feature points. An iterative multilevel training process is performed to get a transformation function from the template model to the personalized model. We use Compactly Supported Radial Basis Function (CSRBF) to assure the locality detail of the adapted model. A curvature based searching scheme is also used to find the feature points in the iterative process.
An Algorithm for Partitioning a Set into Simple Parts
Authors: L. Ya. Savel'Ev
Venue: Programming and Computing Software (2005)

The paper describes a method for the structural analysis of abstract data and its applications. A finite set with two numberings, two order relations, and one symmetry relation is considered. An algorithm is proposed for partitioning this set into simple parts determined by compositions of given relations. Each simple part of the set is then partitioned into layers. This model can also be used for analyzing different data admitting similar formalization. It can be used for analyzing structure of some graphs (in particular, graphs describing molecular associations). The proposed algorithms are used for partitioning a complex family into simple ones determined by family relationships and for determining family generations. The algorithms can be applied to analyzing corporations with a family-like structure.
Degenerate Problems of Designing the Control System of a Linear Discrete Plant
Authors: A. L. Bunich
Venue: Automation and Remote Control (2005)

Consideration was given to the class of degenerate problems of designing controller for a multidimensional discrete-time linear plant under stationary perturbations. An algorithm to design an iteratively structured controller providing the desired control performance in the steady-state conditions was proposed.
Accurate Visible Speech Synthesis Based on Concatenating Variable Length Motion Capture Data
Authors: Jiyong Ma, Ron Cole, Bryan Pellom
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

We present a novel approach to synthesizing accurate visible speech based on searching and concatenating optimal variable-length units in a large corpus of motion capture data. Based on a set of visual prototypes selected on a source face and a corresponding set designated for a target face, we propose a machine learning technique to automatically map the facial motions observed on the source face to the target face. In order to model the long distance coarticulation effects in visible speech, a large-scale corpus that covers the most common syllables in English was collected, annotated and analyzed. For any input text, a search algorithm to locate the optimal sequences of concatenated units for synthesis is desrcribed. A new algorithm to adapt lip motions from a generic 3D face model to a specific 3D face model is also proposed. A complete, end-to-end visible speech animation system is implemented based on the approach. This system is currently used in more than 60 kindergarten through third grade classrooms to teach students to read using a lifelike conversational animated agent. To evaluate the quality of the visible speech produced by the animation system, both subjective evaluation and objective evaluation are conducted. The evaluation results show that the proposed approach is accurate and powerful for visible speech synthesis.
The Protection of QoS for Multimedia Transmission against Denial of Service Attacks
Authors: Hongli Luo, Mei-Ling Shyu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper, a secure and adaptive multimedia transmission framework is proposed to maintain the quality of service (QoS) of the multimedia streams during the Denial-of-Service (DoS) attacks. A DoS attack generates a large amount of traffic, which will occupy the bandwidth and degrade the quality of video. The proposed framework consists of two components: intrusion detection and adaptive transmission management. The intrusion detection component monitors the incoming traffic to the server, detects the attacks, and interacts with the adaptive transmission management component; while the adaptive transmission management component is designed to improve QoS of the video via the efficient utilization of the network resources. With the detection of the DoS attacks, the bandwidth occupied by the attacks can be reduced and protected for video transmission. The results of our preliminary simulations in NS2 show that the quality of the multimedia stream can still be maintained during an attack.
The ribosome builder: a software project to simulate the ribosome
Authors: William A. Knight
Venue:  (2005)

The Ribosome Builder is a software program that is designed to efficiently represent and simulate large atomic-resolution structural models of macromolecules such as the ribosome. The representation includes a simplified molecular dynamics forcefield that maintains fundamental properties such as bond lengths, bond angles and steric exclusions. A new method, called the &lsquo;shadow-point&rsquo; method, was developed to represent the covalent bond structure in a way that is robust in the presence of strong external forces. This was done to facilitate applications of Steered Molecular Dynamics (SMD). A high-level scripting engine is also provided for defining the SMD simulations. The scripting engine uses the Lua programming language and includes a comprehensive Application Programming Interface (API). The scripting API enables complex and flexible forces and torques to be defined by Lua scripts and then applied to dynamic models in the forcefield. This capability enabled the creation of SMD simulations of long-timescale activity such as the folding of an RNA tetraloop, docking of mRNA on the ribosome, and translocation of the mRNA during the elongation cycle. The project also introduces a technique called &lsquo;schematic simulation&rsquo;. This technique was proposed as an additional means for simulating long-timescale activity. A schematic simulation is a scripted sequence of events intended to represent a complex macromolecular process. This kind of simulation employs static and dynamic models, descriptive text, graphical annotations, changing viewpoint, scripted movements and playback of recorded molecular dynamics trajectories. A schematic simulation of a complete cycle of elongation on the ribosome was created, and includes all of the principal molecular components at an atomic level of detail. In addition to the core functionality, a comprehensive graphical user interface is provided, and facilitates the construction of multi-component models of macromolecular systems. The software was developed in a portable, modular and documented manner using the C++, Lua and Perl programming languages. The program has been released as an open source project under the GNU public license and is available from SourceForge at http://rbuilder.sourceforge.net.
Economy of description for basic constructions on rational transductions
Authors: Henning Bordihn, Markus Holzer, Martin Kutrib
Venue: Journal of Automata, Languages and Combinatorics (2004)

The state complexities of basic constructions on rational transductions are investigated. Given rational transductions, described by rational transducers, and an operation thereon we consider the number of states that is sufficient and necessary in the worst case to describe the resulting transduction. In particular, tight bounds are shown for inversion, union, weak intersection, concatenation, reversal, homomorphism, and composition, i.e., for some of those operations under which rational transductions are closed.