ppxscal/embedding_network huggingface dataset:
Evolutionary computation: exploring the genotype representation
Authors: Craig Baker
Venue: Journal of Computing Sciences in Colleges (2005)

In evolutionary computation, principles of selection and evolution are applied to competing populations of algorithms. The individual's "genotype" is thus a representation of an algorithm, which is expressed as a behavior in its environment. A number of different representations for the genotype have been used in other experiments. In order for adaptation to be flexible, this representation must effectively accommodate heritable mutations in a space that produces viable genotypes; also, in the case of crossover, it would appear ideal for cohesive parts of the genotype to be traded. We propose a "modular boolean logic network" representation, allowing for mutation and crossover of nested and recurring "modules" of interconnected boolean functions, and explore the effects of varied levels of "modularity" in these networks. The networks are employed as controllers in a 2-dimensional game of pursuit and evasion between simulated agents.
Diagnostics of Arterial Pressure Pulse Using Haptic Kymograph: Remote Diagnosis of Vital Signs through a Telehaptic Device
Authors: Youngseok Kim, Regeesh Britto, T. Kesavadas
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Although most diagnostic systems today largely depend on the automation of signal processing, we also observe experts still utilize their impressions for delicate or hard-to-recognizable symptoms. A good example is the diagnostics of arterial pressure pulses through the tactile perception, especially in oriental medicine. We have developed a real-time telehaptic rendering system where vital signs are captured, transmitted and replicated in a remote site. In this paper we report our developments that deal with network issues on telehaptics. We have also conducted human subject experiments on two haptic replication methods: kinesthetic stimulation with a PHANToM¿, and vibrotactile stimulation with a new portable system developed here.
Algorithmic aspects of capacity in wireless networks
Authors: V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, Aravind Srinivasan
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

This paper considers two inter-related questions: (i) Given a wireless ad-hoc network and a collection of source-destination pairs {(si,ti)}, what is the maximum throughput capacity of the network, i.e. the rate at which data from the sources to their corresponding destinations can be transferred in the network? (ii) Can network protocols be designed that jointly route the packets and schedule transmissions at rates close to the maximum throughput capacity? Much of the earlier work focused on random instances and proved analytical lower and upper bounds on the maximum throughput capacity. Here, in contrast, we consider arbitrary wireless networks. Further, we study the algorithmic aspects of the above questions: the goal is to design provably good algorithms for arbitrary instances. We develop analytical performance evaluation models and distributed algorithms for routing and scheduling which incorporate fairness, energy and dilation (path-length) requirements and provide a unified framework for utilizing the network close to its maximum throughput capacity.Motivated by certain popular wireless protocols used in practice, we also explore "shortest-path like" path selection strategies which maximize the network throughput. The theoretical results naturally suggest an interesting class of congestion aware link metrics which can be directly plugged into several existing routing protocols such as AODV, DSR, etc. We complement the theoretical analysis with extensive simulations. The results indicate that routes obtained using our congestion aware link metrics consistently yield higher throughput than hop-count based shortest path metrics.
The challenges of software engineering education
Authors: Carlo Ghezzi, Dino Mandrioli
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We discuss the technical skills that a software engineer should possess. We take the viewpoint of a school of engineering and put the software engineer's education in the wider context of engineering education. We stress both the common aspects that crosscut all engineering fields and the specific issues that pertain to software engineering. We believe that even in a continuously evolving field like software, education should emphasize principles and recognize what are the stable and long-lasting design concepts. Even though the more mundane technological solutions cannot be ignored, the students should be equipped with skills that allow them to dominate the evolution of technology.
Dynamic Pricing for Time-Limited Goods in a Supplier-Driven Electronic Marketplace
Authors: Prithviraj Dasgupta, Louise E. Moser, P. Michael Melliar-Smith
Venue: Electronic Commerce Research (2005)

Existing e-commerce systems employ a pull model of marketing where buyers, possibly through agents, search the e-market for suppliers offering the product of their choice. In contrast, the push model where suppliers' agents approach buyers with their products, has been relatively less investigated. Push strategies are particularly appropriate for commodities that have a short shelf-life and, therefore, an elastic demand curve, allowing suppliers to exploit unexpected supply. The speed and low cost of e-commerce makes it particularly suited to the push paradigm. In this paper, we consider time-limited goods in a supplier driven marketplace that employs the push model of marketing. When constrained by a strict deadline to sell the good, the supplier uses a mobile sales agent that visits every buyer and estimates the short run demand curve of the good. At every buyer, the sales agent also employs a heuristic technique called the Maximum Returns Algorithm to recalculate the price of the good, so that the supplier can obtain the best possible gross returns from trading with the buyers. On the other hand, when the deadline to sell is not stringent, the sales agent negotiates the exchange at a point that improves both the buyer's utility and the supplier's profit, as compared to the exchange point without negotiation.
Optimization of Reconfiguration Overhead by Algorithmic Transformations and Hardware Matching
Authors: Markus Rullmann, Sebastian Siegel, Renate Merker
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper we present a method to optimize the overhead in dynamically reconfigurable computing systems. Applications are considered to be partitioned into algorithmic blocks. Our method allows a reduction of overhead when reconfiguration between those blocks is required. For each block a variety of specifications is constructed using high level algorithmic transformations based on a partitioning method for nested loop programs. The partitioning method allows an efficient verification with the given design constraints. The specifications differ in resource usage and execution time. The reconfiguration costs are reduced by finding the best matching specifications of the algorithmic blocks. The specifications with the lowest reconfiguration cost are selected for implementation using the matching information as input for the implementation tools. Finally we present an optimal solution for a reconfigurable 2D mean filter. Two configurations with different filter sizes and word widths were implemented according to the matching specifications. We reduced the required logic area compared to the non-reconfigurable implementation and reduced significantly the reconfiguration costs.
An adjunct test for discourse processing in MUC-4
Authors: Lynette Hirschman
Venue: Proceedings of the 4th conference on Message understanding (1992)

The motivation for this adjunct test came from an exploratory study done by Beth Sundheim during MUC-3. This study showed a degradation in correctness of message processing as the information distribution in the message became more complex, that is, as slot fills were drawn from larger portions of the message and required more discourse processing to extract the information and reassemble it correctly in the required template(s). The study also suggested that systems did worse on messages requiring multiple templates than on single-template messages. These observations led us define the MUC-4 adjunct test to examine two hypotheses related to discourse complexity and expected system performance:&bull; The Source Complexity HypothesisThe more complex the distribution of the source information for filling a given slot or template (the more sentences, and the more widely separated the sentences), the more difficult it will be to process the message correctly.&bull;The Output Complexity HypothesisThe more complex the output (in terms of number of templates), the harder it will be to process the message correctly.
Learning the Semantics of Images by Using Unlabeled Samples
Authors: Jianping Fan, Hangzai Luo, Yuli Gao
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we have proposed a novel framework to achieve more effective classifier training by using unlabeled samples. By integrating concept hierarchy for semantic image concept organization, a hierarchical mixture model is proposed to enable multi-level image concept modeling and hierarchical classifier training. To effectively learn the base-level classifiers for the atomic image concepts at the first level of the concept hierarchy, we have proposed a novel adaptive EM algorithm to achieve more effectiveclassifier training with higher prediction accuracy. To effectively learn the classifiers for the higher-level semantic image concepts, we have also proposed a novel technique for classifier combining by using hierarchical mixture model. The experimental results on two large-scale image databases are also provided.
Mapping Hacks
Authors: Schuyler Erle, Rich Gibson, Jo Walsh
Venue:  (2005)

Mapping Hacks is a collection of one hundred simple techniques available to developers and power users who want to draw digital maps. You'll learn where to find the best sources of geographic data and then how to integrate that data into your own creations. With so many industrial-strength tips and tools, Mapping Hacks effectively takes the sting out of digital mapmaking.
A Nonlinear Approach for Face Sketch Synthesis and Recognition
Authors: Qingshan Liu, Xiaoou Tang, Hongliang Jin, Hanqing Lu, Songde Ma
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Most face recognition systems focus on photo-based face recognition. In this paper, we present a face recognition system based on face sketches. The proposed system contains two elements: pseudo-sketch synthesis and sketch recognition. The pseudo-sketch generation method is based on local linear preserving of geometry between photo and sketch images, which is inspired by the idea of locally linear embedding. The nonlinear discriminate analysis is used to recognize the probe sketch from the synthesized pseudo-sketches. Experimental results on over 600 photo-sketch pairs show that the performance of the proposed method is encouraging.
Answering order-based queries over XML data
Authors: Zografoula Vagena, Nick Koudas, Divesh Srivastava, Vassilis J. Tsotras
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-based queries. An experimental comparison with previous approaches shows the performance benefits of our algorithms.
Protection of Privacy in Pervasive Computing Environments
Authors: Heng Seng Cheng, Daqing Zhang, Joo Geok Tan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper, we present two techniques. The first technique called Privacy Sensitive Information dilUting Mechanism (PSIUM) is able to prevent the misuse of data by a service provider by using a mixture of true and false sensor data. The second technique protects privacy sensitive information from being revealed to an attacker through traffic analysis by using a combination of frequently changing pseudonyms and dummy traffic.
Extensible Battle Management Language as a Transformation Enabler
Authors: William P. Sudnikovich, J. Mark Pullen, Martin S. Kleiner, Scott A. Carey
Venue: Simulation (2004)

This article addresses a new approach to the longstanding problem of interoperating military command and control with combat simulations. There is great potential benefit in such a capability, both for more effective training and as a "what if" capability during military operations. The authors describe the Battle Management Language (BML), an unambiguous means of describing military operations to people, simulations, and robotic forces. The process that developed the BML and its extension into the realm of Web services are described. The new capability is projected to be an enabler for the ongoing transformation activities in the U.S. Department of Defense. Integrated with the Command and Control Information Exchange Data Model (C2IEDM), BML, as extended through Web services, provides a path to improved interoperability within and among U.S. military services and their allied/coalition partners.
Gauging intelligence of unmanned vehicle systems&ndash;an IGVC perspective
Authors: Ka C. Cheok, G. Edzko Smid, Gerald R. Lane, William G. Agnew, Asif Khan
Venue: Journal of Robotic Systems (2004)

This paper offers an approach for defining and gauging the intelligence of an unmanned vehicle system. The meaning of &ldquo;intelligence,&rdquo; as in natural intelligence and machine intelligence, varies greatly depending on the context in which the word is used. The paper describes certain basic expectations associated with being intelligent in general, and proceeds to present three possible means of gauging the intelligent behavior of an unmanned vehicle system (UVS). The first is a qualitative perception that is based on an extension of the Turin's test for perceiving an unsuspecting UVS behavior as that of a person. The second is a quantitative measure where task-specific intelligence performance of a smart system is evaluated. Examples of task-specific intelligence and how they are gauged are presented in the context of the Intelligent Ground Vehicle Competition. The third is the comparative scale that gauges the difficulty of challenges against the intelligent skills of humans. For example, an experiment revealed that it requires the mind of at least a four-year-old child to successfully navigate an autonomous navigation course. Alternative architectures for intelligent unmanned vehicle systems were also presented, including complementing machine intelligence with human supervision via telematics and information technology. &copy; 2004 Wiley Periodicals, Inc.
Function-based representation of complex geometry and appearance
Authors: Qi Liu, Alexei Sourin
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

In this paper, we introduce a function-based extension of Virtual Reality Modeling Language. In this extension, analytical functions are used for defining geometry and appearance of 3D shapes, as well as transformations of them. By analytical functions we understand definitions with parametric, implicit and explicit formulas. In our hybrid function-based web visualization model, these very different analytical representations can be used concurrently for defining geometry and appearance of the shapes. We also illustrate how the proposed extension can be further enriched with any proprietary function-based models. The presented VRML plug-in is very useful for building both static and interactive virtual environments on the Web. This is illustrated with the implementation of the Virtual Collaborative Shape Modeling Laboratory.
A Network Access Control Approach Based on the AAA Architecture and Authorization Attributes
Authors: Gabriel Lopez, Antonio F. Gomez, Rafael Marin, Oscar Canovas
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

Network access control mechanisms constitute an increasingly needed service, when communications are becoming more and more ubiquitous thanks to some technologies such as wireless networks or Mobile IP. This paper presents a particular scenario where access rules are based not only on the identity of the different users, but also on authorization data related to those users. In order to accomplish this general goal, it will be necessary to add to the traditional systems specific services for authentication and authorization, and also some entities able to manage the information related to identity, roles and permissions. Network access will be based on the 802.1X framework and the AAA architecture, as they constitute the basis for most of the existing proposals for limiting the access to a restricted network. Those proposals will be extended using an authorization infrastructure based on SAML statements, the RBAC model, and XACML as the language for expressing authorization policies.
Using Symbolic DEVS Simulation to Generate Optimal Traffic Signal Timings
Authors: Jongkeun Lee, Sungdo Chi
Venue: Simulation (2005)

This article applies the advanced symbolic Discrete Event System Specification (DEVS) simulation method to the optimal signal control problem with respect to intelligent transportation systems. The authors introduce a new approach that would generate optimal signal times based on the temporal sequence of traffic signal control variables and traffic information collected for each intersection using the symbolic DEVS simulation method, which can express nondeterministic time symbolically. The symbolic DEVS simulation method allows the authors to infer the relationship between time and every event that reaches the simulation goal by generating a time trajectory for every possible event automatically. This study suggests a new approach for optimal signal time calculation using symbolic DEVS simulation for traffic response signal control based on real-time traffic volumes; this study also verified its application in a case study.
Numerical linear algebra
Authors: Robert C. Ward, Gene H. Golub
Venue: ACM SIGNUM Newsletter (1980)

This paper presents an overview of the major computational problems in numerical linear algebra and indicates their connection to the "mission-oriented" projects of the Department of Energy. A nontechnical introduction section outlines the topic and presents the major considerations in developing tools for solving these problems. The remaining sections present detailed discussions of the four major areas comprising numerical linear algebra: systems of linear equations, eigenvalue problems, least squares and generalized inverses, and matrix functions. The current state-of-the-art is briefly assessed and the major research challenges with priorities are presented for each area.
Several directions for minority languages computerization
Authors: Vincent Berment
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Less than 1% of the languages spoken in the world are correctly "computerized": spell checkers, hyphenation, machine translation are still lacking for the others. In this paper, we present several directions that may help the computerization of minority languages as well as two projects where we apply some of these directions to the Lao language.
The complexity of constructing pseudorandom generators from hard functions
Authors: Emanuele Viola
Venue: Computational Complexity (2005)

We study the complexity of constructing pseudorandom generators (PRGs) from hard functions, focussing on constant-depth circuits. We show that, starting from a function f : {0,1}l --> {0,1} computable in alternating time O(l) with O(1) alternations that is hard on average (i.e. there is a constant ε > 0 such that every circuit of size 2εl failes to compute f on at elast a 1/poly(l) fraction of inputs) we can construct a PRG : {0,1}O(log n) --> {0,1}n computable be DLOGTIME-uniform constant deptg circuits of size polunomial in n. Such a PRG implies BP . ACO = ACO under DLOGTIME-uniformity. On the negative side, we prove that starting from a worst-case hard function f : {0,1}l --> {0,1} (i.e. there is a constant ε > 0 such that every circuit size of 2εl fails to compute f on some input) for evey positive constant &$948; δn --> {0,1}n computable by constant-depth circuits of size polynomial in n. We also study worst-case hardness amplification, which is the related problem of producing an average-case hard function starting from a worst-case hard one. In particular, we deduce that there is no blackbox worst-case hardness amplification within the polynomial time hierarchy. These negative results are obtained by showing that polynomialsize constant-depth circuits cannot compute good extractors and listdecodable codes.
Diversification and the Optimal Construction of Basis Portfolios
Authors: Bruce N. Lehmann, David M. Modest
Venue: Management Science (2005)

Nontrivial diversification possibilities arise when a factor model describes security returns. This paper catalogs the merits of alternative strategies for constructing basis portfolios to mimic the common factors. We show how to use the ? 2 statistic for the joint significance of mean basis portfolio returns to rank alternative procedures and the bootstrap to perform inferences on the disparity between ? 2 statistics across portfolio formation procedure, estimation method, cross-section size, and number of factors. Our main conclusion is that maximum likelihood factor analysis coupled with minimum idiosyncratic risk portfolio formation yields economically and statistically superior basis portfolios compared with those derived from asymptotic principal components.
Authentication and Integrity in Telecommunication Signaling Network
Authors: Hemant Sengar, Duminda Wijesekera, Sushil Jajodia
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The signaling system 7 (SS7)is a signaling system for the public switched telephone network (PSTN). SS7 network transports call setup, teardown messages, database queries, trunk status, instructions for remote phone switches and so on, in fact it acts as a glue for the circuit switched network. Telecommunication deregulation, liberalization of economies and convergence of telephone, IP and wireless networks has broken the trust enjoyed so long by PSTN as being considered a closed community network. The convergence results in increasing number of interfaces between SS7 and other networks, and each brings with it many vulnerabilities. This paper first analyzes existing security threats due to virtually non-existent authentication and integrity check process and then presents a MTPSec solution at the MTP3 layer in the SS7protocol stack which provides security services through cryptographic operations. It can be implemented at each signaling point (SP) throughout the network to provide link-by-link security or at least at the SPs residing at the interface between two networks or trust sets.