ppxscal/embedding_network huggingface dataset:
FECT: A Framework for Automatic Composition ofWeb Services
Authors: Lishan Hou, Zhi Jin, Budan Wu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In this paper, we introduce FECT, a implemented prototype framework to support the publication, selection and composition of Web services on the basis of environment ontology and behavior trace. And a case of Web sale is presented to demonstrate FECT.
The quality of a scientific simulation
Authors: G. R. Sherman
Venue: ACM SIGSIM Simulation Digest (1984)

Demonstrable high quality of a simulation of the disposal of nuclear fuel waste is crucial for the assessment of the disposal concept. The elements of quality are described, as pertaining to models of the controlling processes, data interpreted from field and laboratory measurements, and computer software representing the models.Procedures for quality assurance and features that enhance quality are discussed. Two major factors are identified: comparison and critical review. Simulation data and results can be compared with field and laboratory observations, with alternate solutions, or with expert judgment. Critical review by scientists and other interested parties, facilitated by thorough documentation, can ensure that the appropriate processes are being accurately modeled.
Distributed Systems Software Architecture for Induced Virtual Emvironments
Authors: Valery Afanasiev, Dmitry Baigozin, Yuri Baturin, Segey Burlakov, Stanislav Klimenko
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper considers the representation of an induced virtual environment (IVE) system as a distributed system with remote supervision of real objects (first of all - space vehicles) according to telemntary data. The general approach of middle-ware and client layer software implementation and pecularities of such are described.
A Framework for Component-based Construction Extended Abstract
Authors: Joseph Sifakis
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We present an overview of results developed mainly at Verimag, by the author and his colleagues, on a framework for component-based construction, characterized by the following:The behavior of atomic components is represented by transition systems. Components are built from a set of atomic components by using "glue" operators For each component, it is possible to separate its behavior from its structure, due to specific properties of glue operators. We show an instance of this framework, which combines two independent classes of glue operators, Interaction Models and Priorities. The combination of interaction models and priorities is expressive enough to encompass heterogeneous interaction and execution. We show that separation between behavior and structure is instrumental for correctness-byconstruction. Finally, we discuss new research problems related to a structure-dependent notion of expressiveness.
An Implementation and Evaluation of IPv6 End-to-End Secure Communication System for Closed Members
Authors: Yuichiro Hei, Satoshi Katsuno, Shigehiro Ano
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

Establishing secure channels between a pair of hosts is an attractive way when the direct exchange of important data is required. IPsec provides various security services for traffic at the IP layer so we can use it to establish secure channels between a pair of hosts. However, IPsec is difficult to use because there are many parameters to set up for secure channels, and the configuration is complicated, hence our previous proposal of an automatic configuration method to set up the end-to-end secure channels between a pair of hosts; facilitating the use of IPsec. In this paper, we overview our proposed method and describe its implementation and evaluation. In addition, we show how the IPsec setup for 10 hosts on a host implementing our method is completed within a few seconds or so.
A Multi-Level Approach to SCOP Fold Recognition
Authors: Keith Marsolo, Srinivasan Parthasarathy, Chris Ding
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

The classification of proteins based on their structure can play an important role in the deduction or discovery of protein function. However, the relatively low number of solved protein structures and the unknown relationship between structure and sequence requires an alternative method of representation for classification to be effective. Furthermore, the large number of potential folds causes problems for many classification strategies, increasing the likelihood that the classifier will reach a local optima while trying to distinguish between all of the possible structural categories. Here we present a hierarchical strategy for structural classificationthat first partitions proteins based on their SCOP class before attempting to assign a protein fold. Using a well-known dataset derived from the 27 most-populated SCOP folds and several sequence-based descriptor properties as input features, we test a number of classification-methods, including Na¨ýve Bayes and Boosted C4.5. Our strategy achieves an average fold recognition of 74%, which is significantly higher than the 56-60% previously reported in the literature, indicating the effectiveness of a multi-level approach.
Variational interconnect analysis via PMTBR
Authors: J. R. Phillips
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We demonstrate an algorithm for interconnect modeling in the presence of process variation based on extension of the truncated balanced realization model reduction algorithm to multi-dimensional, parameter varying systems. Our scheme, based on a set of estimators of the variational TBR projection spaces, is simple to implement, contains embedded error estimators, and leads to nearly optimally sized models.
Design of a Virtual Shopping Mall: Some Observations
Authors: Han Bei Bei Cindy, Narendra S. Chaudhari, Jagdish C. Patra
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper, we share some of our observations for designing and implementing a shopping mall design (called Hikegaya) with 3D technology. We constructed Hikegaya using Hypertext Preprocessor (PHP), MySQL, Adobe Photoshop 7, Discreet 3D Studio Max 6, and ParallelGraphics VrmlPad. The methodology for design is discussed. With the existing technologies and with our use for prototype implementation experience of Hikegaya, we conclude that 3D applications for E-commerce are feasible.
rStream: resilient peer-to-peer streaming with rateless codes
Authors: Chuan Wu, Baochun Li
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The inherent instability and unreliability of peer-to-peer networks introduce several fundamental engineering challenges to multimedia streaming over peer-to-peer networks. First, multimedia streaming sessions need to be resilient to the volatile network dynamics in peer-to-peer networks. Second, they need to take full advantage of the existing bandwidth capacities, by minimizing the delivery of redundant content during streaming. In this paper, we propose to use a recent coding technique, referred to as rateless codes, to code the multimedia bitstreams before they are transmitted over peer-to-peer links. The use of rateless codes eliminates the requirements of content reconciliation, as well as the risks of delivering redundant content over the network. It also helps the streaming sessions to adapt to volatile network dynamics. Our preliminary simulation results demonstrate the validity and effectiveness of our new contribution, as compared to traditional solutions with or without erasure codes.
Multivariable predictive control of a pressurized tank using neural networks
Authors: A. Duarte-Mermoud, M. Su&#x00e1;rez, F. Bassi
Venue: Neural Computing and Applications (2006)

The behavior of a multivariable predictive control scheme based on neural networks applied to a model of a nonlinear multivariable real process, consisting of a pressurized tank is investigated in this paper. The neural scheme consists of three neural networks; the first is meant for the identification of plant parameters (identifier), the second one is for the prediction of future control errors (predictor) and the third one, based on the two previous, compute the control input to be applied to the plant (controller). The weights of the neural networks are updated on-line, using standard and dynamic backpropagation. The model of the nonlinear process is driven to an operation point and it is then controlled with the proposed neural control scheme, analyzing the maximum range over the neural control works properly.
Individuality Analysis of Online Kanji Handwriting
Authors: Yoshikazu Nakamura, Masatsugu Kidode
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents an analysis study of handwritten Kanji characters on a digitizing tablet. .. To solve a writer identification and verification problem, we have tried to extract significant individual characteristics of a certain set of Kanji characters, which might be defined as feature parameters derived from the knowledge of document examiners. A set of feature parameters in terms of character shape and writing behavior is evaluated by the statistical test. Evaluation results have shown that some feature parameters are good enough to identify and verify a writer himself.
An urban traffic simulation model
Authors: Uno Larsson
Venue: ACM SIGSIM Simulation Digest (1972)

This article includes a brief introduction to a simulation project carried through at the University of Gothenburg, Department of Business Administration. The outcome of the project has partly been published in a technical report now available (Larsson and Lundin 1971).
Intrusion Detection Based on Cross-Correlation of System Call Sequences
Authors: Xiaoqiang Zhang, Zhongliang Zhu, Pingzhi Fan
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

A new light-weight approach, based on the cross-correlation of system call sequences, is presented to identify normal or intrusive program behavior. The program behavior is represented by the cross-correlation value which can be used to indicate the similarity between two sequences. If two sequences are same, the cross-correlation between them will achieve the maximum value. This method of characterizing program behavior by using cross-correlation offers significant computational advantages over HMM (Hidden Markov Model) or NN (Neural network) methods due to the absence of unnecessary training process. Our experiments using UNM (University of New Mexico) audit data show that the cross-correlation based method can effectively detect intrusive attacks and achieve a low false positive rate.
Chord on Demand
Authors: Alberto Montresor, Mark Jelasity, Ozalp Babaoglu
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in the presence of churn and other failures is the subject of intensive research, the problem of building them from scratch has not been addressed (apart from individual nodes joining an already functioning overlay). In this paper we address the problem of jump-starting a popular structured overlay, Chord, from scratch. This problem is of crucial importance in scenarios where one is assigned a limited time interval in a distributed environment such as Planet-Lab, or a Grid, and the overlay infrastructure needs to be set up from the ground up as quickly and efficiently as possible, or when a temporary overlay has to be generated to solve a specific task on demand. We introduce T-CHORD, that can build a Chord network efficiently starting from a random unstructured overlay. After jump-starting, the structured overlay can be handed over to the Chord protocol for further maintenance. We demonstrate through extensive simulation experiments that the proposed protocol can create a perfect Chord topology in a logarithmic number of steps. Furthermore, using a simple extension of the protocol, we can optimize the network from the point of view of message latency.
Computer Recognizes Expert Reviewers
Authors: Doris Carver
Venue: Computer (2005)

Computer's editor in chief extends her thanks to the more than 200 professionals who contributed their time and expertise as reviewers of article submissions in 2005.
Some mathematical properties of simulation models
Authors: Giuseppe Iazeolla
Venue: ACM SIGSIM Simulation Digest (1977)

A mathematical style of description of simulation models is introduced by using the formalism of system theory. Discrete event simulation models which use pseudorandom number generators are regarded as abstract objects described by a family of input-output time-functions and are proved to hold the property of aggregates.
Evaluation of Mutual Trust during Matchmaking
Authors: M. Altunay, D. Brown, G. Byrd, R. A. Dean
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

We introduce a new service discovery and matchmaking architecture, layered on top of Globus MDS3, that integrates mutual trust evaluations into the matchmaking process. Our architecture adopts a symmetric approach, and checks trust policies of both grid users and resources without requiring policy disclosures. Our approach eliminates run-time security failures arising from incompatible user/resource pairs, seamlessly integrates user-side authorization tools with the matchmaking process, and protects naïve grid users by allowing a security principal to define policies that control the list of discoverable resources.
Predicting Risk as a Function of Risk Factors
Authors: Norman F. Schneidewind
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

In previous research, we showed that risk factors have a significant negative effect on reliability (e.g., failure occurrence). In this research, we show that it is feasible to predict risk (i.e., the probability that risk factors are related to discrepancy reports occurring on a software release). This is an important advance over the previous research because discrepancy reports are available in the requirements phase -- when the cost and labor required to correct faults is low, whereas failure data only becomes available in the test phase -- when the cost and labor required to correct faults is high. Although using historical failure data to drive traditional software reliability models would produce greater prediction accuracy, the opportunity to provide early prediction of reliability, using risk factors, outweighs this advantage.
Appearance-preserving manipulation of hand-drawn graphs
Authors: James Arvo, Kevin Novins
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We describe a sketching system that allows users to create and manipulate directed graphs, such as those depicting state diagrams, using pen-input alone. The system exactly preserves the user's strokes, which may be entered in any order, and depicts them with a chalk texture to evoke a blackboard metaphor. The system automatically interprets the geometry of the sketch, distinguishing vertices, edges, and arrow heads, then tacitly imparts the intended graph semantics based on the two-dimensional placement of these elements. Once drawn, the user can manipulate the directed graph gesturally using the pen. The system responds to vertices or edges being picked and dragged by adjusting all adjacent edges appropriately. The original appearance of the hand-drawn vertices and edges is maintained even while their shapes are continually morphed in response to rearrangement of these elements. All edges exhibit shape memory, which is the proclivity to return to their original hand-drawn shape despite repeated stretching and compression.
Fairer usage contracts for DRM
Authors: Alapan Arnab, Andrew Hutchison
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

DRM has been widely promoted as a means to enforce copyright. In many previous papers, it has been argued that DRM gives too much power to rights holders and actually goes beyond the restrictions provided by copyright laws. In this paper we argue that DRM does not actually implement the fundamentals of copyright law, and is rather a mechanism for enforcing licence and contract restrictions on digital data. However, we believe that DRM does have a place in the digital distribution of copyrighted works and present two mechanisms that would allow users to get a more balanced deal from the rights holders. The mechanisms we present also allow for newer business models that cannot be easily implemented with current DRM systems.
Nonmarkovian control in dynamical systems and planning
Authors: Alfredo Gabaldon Royval
Venue:  (2005)

Building on Reiter's situation calculus Basic Action Theories, we consider generalizations that allow more flexible reasoning about the evolution of a dynamical system. First, we introduce nonMarkovian basic action theories, which generalize Reiter's action theories by allowing the axiomatization of a nonMarkovian system. By a nonMarkovian system we mean a system whose dynamics are such that the effects of actions on fluents and the preconditions of the actions are not necessarily fully determined by the current state of the system, but may also depend on the full system history. Furthermore, we generalize Reiter's regression operator, the main reasoning mechanism associated with Basic Action Theories, so that it can be utilized with nonMarkovian theories and, in general, with a class of situation calculus formulas that allow quantification over situation variables under some restrictions. Second, we introduce an operator for transforming nonMarkovian theories into Markovian basic action theories, which allows taking advantage of previous theoretical and implementation results applicable to formalisms that make the Markov assumption or that are inherently Markovian, such as state-based approaches. Third, we present two simple solutions to the qualification problem in presence of dynamic constraints: one resulting in a nonMarkovian action theory, and another one in a Markovian theory obtained by applying our transformation. Finally, we consider the problem of planning with declarative search control in the style of the TLPlan system. We introduce a procedure for obtaining precondition control from linear temporal logic search control formulas and prove that the preconditions obtained through this procedure prune a plan prefix if and only if the TLPlan system's progression algorithm eliminates the plan prefix. This procedure together with our transformation from nonMarkovian to Markovian theories provide a mechanism for computing precondition control, i.e., for compiling declarative search control into action preconditions.
Using Fuzzy Probabilistic Neural Network for Fault Detection in MEMS
Authors: Reza Asgary, Karim Mohammadi
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

There are different methods for detecting digital faults in electronic and computer systems. But for analog faults, there are some problems. This kind of faults consist of many different and parametric faults, which can not be detected by digital fault detection methods. One of the proposed methods for analog fault detection, is neural networks. Fault detection is actually a pattern recognition task. Faulty and fault free data are different patterns which must be recognized. In this paper we use a probabilistic neural network for fault detection in MEMS. A fuzzy system is used to improve performance of the network. Finally different network results are compared.
In memoriam Alberto Oscar Mendelzon
Authors: Renèe J. Miller
Venue: ACM SIGMOD Record (2005)

Alberto Oscar Mendelzon passed away on June 16, 2005 after a two-year battle with cancer. This tribute to Alberto and his achievements is written in recognition of his great intellect and his generous friendship. Both have influenced and inspired many in the database research community.
Interval Analysis on Directed Acyclic Graphs for Global Optimization
Authors: Hermann Schichl, Arnold Neumaier
Venue: Journal of Global Optimization (2005)

A directed acyclic graph (DAG) representation of optimization problems represents each variable, each operation, and each constraint in the problem formulation by a node of the DAG, with edges representing the flow of the computation. Using bounds on ranges of intermediate results, represented as weights on the nodes and a suitable mix of forward and backward evaluation, it is possible to give efficient implementations of interval evaluation and automatic differentiation. It is shown how to combine this with constraint propagation techniques to produce narrower interval derivatives and slopes than those provided by using only interval automatic differentiation preceded by constraint propagation. The implementation is based on earlier work by L.V. Kolev, (1997), Reliable Comput., 3, 83---93 on optimal slopes and by C. Bliek, (1992), Computer Methods for Design Automation, PhD Thesis, Department of Ocean Engineering, Massachusetts Institute of Technology on backward slope evaluation. Care is taken to ensure that rounding errors are treated correctly. Interval techniques are presented for computing from the DAG useful redundant constraints, in particular linear underestimators for the objective function, a constraint, or a Lagrangian. The linear underestimators can be found either by slope computations, or by recursive backward underestimation. For sufficiently sparse problems the work is proportional to the number of operations in the calculation of the objective function (resp. the Lagrangian).