ppxscal/embedding_network huggingface dataset:
Systems Integration of Large Scale Autonomic Systems Using Multiple Domain Specific Modeling Languages
Authors: Shweta Shetty, Steven Nordstrom, Shikha Ahuja, Di Yao, Ted Bapty, Sandeep Neema
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Software design, development and maintenance for large scale systems has been one of the most difficult and expensive phases of the software development life cycle. Design and maintenance is especially difficult when the system includes autonomic features. As the system size and variety of autonomic behaviors scale up, it increases the chance of many unexpected and unwanted interactions. Separate design tools can hide these potential interactions. To face these challenges, we propose an autonomic system integration platform where holistic design models capture system structure, target system resources, and autonomic behavior. The fault mitigative, autonomic behavior can be explicitly coupled to the components and underlying resources of the system. System generation technology is used to create the software that implements these coupled specifications, including communication between components with custom data type marshalling and demarshalling, system startup and configuration, fault tolerant behavior, and autonomic procedures for self-correction. This modeling schema, along with the tools to generate the various system components are described in this paper.
The faithfulness of abstract protocol analysis: message authentication
Authors: Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuck
Venue: Journal of Computer Security (2004)

Dolev and Yao initiated an approach to studying cryptographic protocols which abstracts from possible problems with the cryptography so as to focus on the structural aspects of the protocol. Recent work in this framework has developed easily applicable methods to determine many security properties of protocols. A separate line of work, initiated by Bellare and Rogaway, analyzes the way specific cryptographic primitives are used in protocols. It gives asymptotic bounds on the risk of failures of secrecy or authentication. In this paper we show how the Dolev-Yao model may be used for protocol analysis, while a further analysis gives a quantitative bound on the extent to which real cryptographic primitives may diverge from the idealized model. We illustrate this method where the cryptographic primitives are based on Carter-Wegman universal classes of hash functions. This choice allows us to give specific quantitative bounds rather than simply asymptotic bounds.
The complexity of XPath query evaluation and XML typing
Authors: Georg Gottlob, Christoph Koch, Reinhard Pichler, Luc Segoufin
Venue: Journal of the ACM (JACM) (2005)

We study the complexity of two central XML processing problems. The first is XPath 1.0 query processing, which has been shown to be in PTIME in previous work. We prove that both the data complexity and the query complexity of XPath 1.0 fall into lower (highly parallelizable) complexity classes, while the combined complexity is PTIME-hard. Subsequently, we study the sources of this hardness and identify a large and practically important fragment of XPath 1.0 for which the combined complexity is LOGCFL-complete and, therefore, in the highly parallelizable complexity class NC2. The second problem is the complexity of validating XML documents against various typing schemes like Document Type Definitions (DTDs), XML Schema Definitions (XSDs), and tree automata, both with respect to data and to combined complexity. For data complexity, we prove that validation is in LOGSPACE and depends crucially on how XML data is represented. For the combined complexity, we show that the complexity ranges from LOGSPACE to LOGCFL, depending on the typing scheme.
High-order finite difference schemes for the solution of second-order BVPs
Authors: Pierluigi Amodio, Ivonne Sgura
Venue: Journal of Computational and Applied Mathematics (2005)

We introduce new methods in the class of boundary value methods (BVMs) to solve boundary value problems (BVPs) for a second-order ODE. These formulae correspond to the high-order generalizations of classical finite difference schemes for the first and second derivatives. In this research, we carry out the analysis of the conditioning and of the time-reversal symmetry of the discrete solution for a linear convection-diffusion ODE problem. We present numerical examples emphasizing the good convergence behavior of the new schemes. Finally, we show how these methods can be applied in several space dimensions on a uniform mesh.
Algebraically Accurate Volume Registration Using Euler's Theorem and the 3-D Pseudo-Polar FFT
Authors: Yosi Keller, Amir Averbuch, Yoel Shkolnisky
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present an algorithm for the registration of rotated and translated volumes, which operates in the frequency domain. The Fourier domain allows to compute the rotation and translation parameters separately, thus reducing a problem with six degrees of freedom to two problems of three degrees of freedom each. We propose a three-step procedure. The first step estimates the rotation axis. The second computes the planar rotation relative to the rotation axis, and the third recovers the translational displacement by using the phase correlation technique. The rotation estimation is based on Eulerýs theorem, which allows to represent a rotation using only three parameters. Two parameters represent the rotation axis and one parameter represents the planar rotation perpendicular to the axis. By using the3-D pseudo-polar FFT, the estimation of the rotation axis is shown to be algebraically accurate. A variant of the angular difference function registration algorithm is derived for the estimation of the planar rotation around the axis. The experimental results show that the algorithm is accurate and robust to noise.
Perl algorithm to calculate and categorize Phi and Psi angles in a protein
Authors: Keeley A. Wray
Venue: Journal of Computing Sciences in Colleges (2005)

In order for a Biochemist to come to sufficient understanding of the structure of a protein, it is important that she know the phi and psi angles for each amino acid within that protein. Phi and psi angles are the measurements, in degrees, of the arrangement of the two amino acids on either side of a given amino acid in a peptide chain. The phi and psi angles are calculated based on information gathered from X-ray crystallography, which allows for the location of each atom in a protein to be defined in terms of its position on a three dimensional plane. The x, y, z coordinates of four different atoms must be obtained in order to perform the phi and psi calculations. To calculate phi, the coordinates of the Nitrogen, Alpha Carbon, and Carbon of the amino acid in question, as well as the location of the Carbon in the preceding amino acid, must be available. To calculate psi, the coordinates of the Nitrogen, Alpha Carbon and Carbon, as well as Nitrogen of the following amino acid in the chain, are needed. When all appropriate coordinates are collected, the next step in the calculation is to identify the dihedral angle.
A nonlinear adaptive filter for narrowband interference mitigation in spread spectrum systems
Authors: K. Deergha Rao, M. N. S. Swamy, E. I. Plotkin
Venue: Signal Processing (2005)

This paper presents a novel approach based on the estimation of the jammer instantaneous frequency for the excision of narrowband interferences in spread spectrum systems. Using a three-coefficient finite impulse response (FIR) model for the interference, an augmented state-space representation of the received signal (spread spectrum signal+ noise + interference signal) is developed. Based on the state-space representation developed, a Kalman-type nonlinear adaptive filter, namely, augmented-state approximate-conditional-mean (ASACM) filter, is formulated to estimate the unknown jammer instantaneous frequency from the received signal. The receiver performance and the problem of stability of the proposed filter are addressed. The improvement in the performance achieved with the proposed nonlinear Kalman-type filter is quantified in comparison with the linear one based on three-coefficient FIR excision filter, and an adaptive nonlinear prediction filter. The efficacy of the proposed filter is corroborated with simulation examples for interference suppression in spread spectrum systems. Simulation results show that the proposed filter is effective in suppressing powerful narrowband interference in spread spectrum systems with good receiver output SNRs.
Algorithm visualization using concept keyboards
Authors: N. Baloian, H. Breuer, W. Luther
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Software visualization and algorithm animation are topics of growing interest in computer science education. We propose a new interface to support the interaction between learners and the dynamic data structure of standard algorithms. Based on their source code users generate and configure so-called concept keyboards to explore the data structures and to execute the methods of the algorithms. This access is in contrast with a simple step interface which allows visualization of the steps of the algorithm in the right order. The results of the various evaluation phases are given. At this moment a larger study is being undertaken with undergraduates which focuses on the usability of the keyboard.
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Authors: Luis Gouveia, Pedro Martins
Venue: Computers and Operations Research (2005)

The capacitated minimum spanning tree problem is to find a minimum spanning tree with an additional cardinality constraint on the number of nodes in any subtree off a given root node. In this paper we propose two improvements on a previous cutting-plane method proposed by Gouveia and Martins (Networks 35(1) (2000) 1) namely, a new set of inequalities that can be seen as hop-indexed generalization of the well known generalized subtour elimination (GSE) constraints and an improved separation heuristic for the original set of GSE constraints. Computational results show that the inclusion of the new separation routine and the inclusion of the new inequalities in Gouveia and Martins' iterative method (see (Networks 35(1) (2000) 1)) produce improvements on previously reported lower bounds. Furthermore, with the improved method, several of previous unsolved instances have been solved to optimality.
BackRank: an alternative for PageRank?
Authors: Mohamed Bouklit, Fabien Mathieu
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. We introduce an enhanced version of the PageRank algorithm using a realistic model for the Back button, thus improving the random surfer model. We show that in the special case where the history is bound to an unique page (you cannot use the Back button twice in a row), we can produce an algorithm that does not need much more resources than a standard PageRank. This algorithm, BackRank, can converge up to 30% faster than a standard PageRank and suppress most of the drawbacks induced by the existence of pages without links.
PEXIS: Probabilistic experience representation based adaptive interaction system for personal robots
Authors: Tetsunari Inamura, Masayuki Inaba, Hirochika Inoue
Venue: Systems and Computers in Japan (2004)

In this paper the authors focus on the interaction between users and personal robots that can move in a real environment. When the creation of robots that can perform in an ordinary home or office is considered, it is difficult to imagine beforehand what kind of environment will be used, and so the approach in which developers embed environmental knowledge and strategies for autonomous movement fails. Thus, the authors propose an approach in which knowledge of the environment and the knowledge needed to move are acquired after development by allowing the robot and the user who is using the robot to engage in dialogue, and representing experience statistically. The authors introduce PEXIS, an interaction system developed using this approach, and then describe the characteristics and utility of their system via examples such as learning to avoid objects in an office environment and adapting to the vocabulary expressions of a particular user. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 98&ndash;109, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10034
Generative versus Discriminative Methods for Object Recognition
Authors: Ilkay Ulusoy, Christopher M. Bishop
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Many approaches to object recognition are founded on probability theory, and can be broadly characterized as either generative or discriminative according to whether or not the distribution of the image features is modelled. Generative and discriminative methods have very different characteristics, as well as complementary strengths and weaknesses. In this paper we introduce new generative and discriminative models for object detection and classification based on weakly labelled training data. We use these models to illustrate the relative merits of the two approaches in the context of a data set of widely varying images of non-rigid objects (animals). Our results support the assertion that neither approach alone will be sufficient for large scale object recognition, and we discuss techniques for combining them.
RelaxImage: A Cross-Media Meta-Search Engine for Searching Images from Web Based on Query Relaxation
Authors: Akihiro Kuwabara, Katsumi Tanaka
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We introduce a cross-media meta-search engine RelaxImage for searching images from Web. Notable features of the RelaxImage are as follows: (1) Each userýs keyword query is "relaxed", that is, by gradually relaxing the search terms used for image search, we can solve the problem of conventional image search engine such as Google. (2) For searching images, our RelaxImage sends a different keyword-query to each search engine of different media-type. We show several examples of how the relaxation approach works as well as ways that it can be applied. That is, our RelaxImage shows a great improvement for increasing recall ratio without decreasing of precision ratio.
An Algorithm for Discovering Physical Topology in Single Subnet IP Networks
Authors: Yuzhao Li, Changxing Pei, Changhua Zhu, Jiandong Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we present a novel algorithm for discovering physical topology in heterogeneous (i.e. multi-vendor) single subnet IP networks. Our algorithm is based on standard SNMP MIB information that is widely supported by modern IP network elements. Algorithm resorts to the portýs traffic when AFT information is insufficient. Simulation and analysis results show that this algorithm can discover the physical network topology accurately even if SNMP is not supported by some network elements.
An empirical testing of user stereotypes of information retrieval systems
Authors: Xiangmin Zhang, Hui Han
Venue: Information Processing and Management: an International Journal (2005)

Stereotyping is a technique used in many information systems to represent user groups and/or to generate initial individual user models. However, there has been a lack of evidence on the accuracy of their use in representing users. We propose a formal evaluation method to test the accuracy or homogeneity of the stereotypes that are based on users' explicit characteristics. Using the method, the results of an empirical testing on 11 common user stereotypes of information retrieval (IR) systems are reported. The participants' memberships in the stereotypes were predicted using discriminant analysis, based on their IR knowledge. The actual membership and the predicted membership of each stereotype were compared. The data show that "librarians/IR professionals" is an accurate stereotype in representing its members, while some others, such as "undergraduate students" and "social sciences/humanities" users, are not accurate stereotypes. The data also demonstrate that based on the user's IR knowledge a stereotype can be made more accurate or homogeneous. The results show the promise that our method can help better detect the differences among stereotype members, and help with better stereotype design and user modeling. We assume that accurate stereotypes have better performance in user modeling and thus the system performance.Limitations and future directions of the study are discussed.
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
Authors: Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatial and color smoothness to infer natural connectivity among pixels. Unlike previous work, our method takes local color information into consideration, and segment image with soft region boundaries for seamless color transfer and compositing. Our modified EM method has two advantages in color manipulation: First, subject to different levels of color smoothness in image space, our algorithm produces an optimal number of regions upon convergence, where the color statistics in each region can be adequately characterized by a component of a Gaussian Mixture Model (GMM). Second, we allow a pixel to fall in several regions according to our estimated probability distribution in the EM step, resulting in a transparency-like ratio for compositing different regions seamlessly. Hence, natural color transition across regions can be achieved, where the necessary intra-region and inter-region smoothness are enforced without losing original details. We demonstrate results on a variety of applications including image deblurring, enhanced color transfer, and colorizing gray scale images. Comparisons with previous methods are also presented.
Fault detection and recovery coverage improvement by optimal clock diversity
Authors: Nobuyasu Kanekawa, Shinichiro Yamaguchi, Yosuke Shima
Venue: Systems and Computers in Japan (2004)

Enhancement of fault recovery coverage by early discovery and early recovery is indispensable in enhancing the availability of fail-safe systems and fault-tolerant systems. In clock-synchronized duplicate comparison systems, errors can be detected in the clock unit, facilitating the early discovery and recovery of faults. Addition of optimal-time diversity makes possible the prevention of error correlation in the duplicate comparison systems, which promotes coverage enhancement. This paper presents an experimental comparison of the fault detection coverage and recovery coverage of the clock-synchronized method with optimal-time diversity (the optimal clock diversity method), the clock-synchronized method without optimal-time diversity, and the loosely synchronized method. The experimental results show that the clock-synchronized method has the highest recovery coverage and that the optimal clock diversity method has the highest fault detection coverage. &copy; 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 35(1): 58&ndash;66, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10253
Preserving mobile customer privacy: an access control system for moving objects and customer profiles
Authors: Mahmoud Youssef, Vijayalakshmi Atluri, Nabil R. Adam
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

A key challenge for Mobile services is to offer personalized contents while preserving the privacy of customers. In mobile applications, location information is modeled as moving objects. Providing proper protection to customer information can be achieved by an access control system. However, providing such system is a challenging task due to: 1) the spatio-temporal nature of the constraints as well as the location information, and the interaction among them; 2) the complexity of resolving spatio-temporal and granularity conflicts; and 3) the required scalability and efficiency. In this paper, we present a solution that includes an access control model for moving objects and customer profiles. We also present a mechanism that enforces the spatio-temporal policies. The mechanism consists of three components: a text encoder, a spatio-temporal module that computes interactions between moving objects and spatio-temporal constraints, and a new data structure referred to as the Adaptive Search Multi-way trie (ASM-trie). We present the insertion and search algorithms of the ASM-trie and an evaluation study that shows the positive impact of the ASM-trie on the search efficiency.
Continuum limit of discrete neuronal structures: is cortical tissue an &#x201c;excitable&#x201d; medium?
Authors: J. L. van Hemmen
Venue: Biological Cybernetics (2004)

As a simple model of cortical tissue, we study a locally connected network of spiking neurons in the continuum limit of space and time. This is to be contrasted with the usual numerical simulations that discretize both of them. Refractoriness, noise, axonal delays, and the time course of excitatory and inhibitory postsynaptic potentials have been taken into account explicitly. We pose, and answer, the question of whether the continuum limit presents a full description of scenarios found numerically (the answer is no, not quite). In other words, can the numerics be reduced to a continuum description of a well-known type? As a corollary, we derive some classical results such as those of Wilson and Cowan (1973), thus indicating under what conditions they are valid. Furthermore, we show that spatially discrete objects may be fragile due to noise arising from the stochasticity of the individual neurons, whereas they are not once the continuum limit has been taken. This, then, resolves the above question. Finally, we indicate how one can directly incorporate orientation preference of the neurons.
A Case Study on Pattern-Based Systems for High Performance Computational Biology
Authors: Weiguo Liu, Bertil Schmidt
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance computing (HPC). Because the development of HPC applications for computational biology problems is much more complex than the corresponding sequential applications, existing traditional programming techniques have demonstrated their inadequacy. Many high level programming techniques, such as skeleton and pattern based programming, have therefore been designed to provide users new ways to get HPC applications without much effort. However, most of them remain absent from the mainstream practice for computational biology. In this paper, we present a new parallel pattern-based system prototype for computational biology. The underlying programming techniques are based on generic programming, a programming technique suited for the generic representation of abstract concepts. This allows the system to be built in a generic way at application level and thus provides good extensibility and flexibility. We show how this system can be used to develop HPC applications for popular computational biology algorithms and lead to significant runtime savings on distributed memory architectures.