ppxscal/embedding_network huggingface dataset:
A Multicast Routing Optimization Algorithm Based on Elite Mechanism
Authors: Jun Qin, Jiangqing Wang, Bojin Zheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Due to the advent of many new multimedia applications in high-speed networks, the issue of multicast routing has become more and more important. The multicast routing problem in computer networks is also known as the Steiner tree problem which has been proved to be NP-complete. In this paper, we propose a new multicast routing model based on multiple objectives optimization, as well as a multiple objective evolutionary algorithm called E-MOEA. To apply this algorithm to real-world networks, we propose a method for reducing the computational complexity: using "elite library" mechanism and elimination of traditional "crossover" operator. Instead, a new mutation operator inspired by clone process is used. Computer simulations have been conducted on NSF-net to evaluate the performance of the proposed algorithm. Our experimental results show that the proposed algorithm is capable of finding good solutions which balance tradeoff among multiple constraint objectives with the help of elite library and the mutation operator.
An Iterative-Improvement Approach to the Numerical Solution of Vector Toeplitz Systems
Authors: M. P. Ekstorm
Venue: IEEE Transactions on Computers (1974)

This paper describes an algorithm for the approximate solution of vector Toeplitz systems via an iterative-improvement method. The algorithm exploits the special structure of Toeplitz matrices, namely, their similarity to vector circulants, and is particularly well suited for solving large systems. Sufficient convergence conditions and concrete error bounds for the iteration are presented along with an application of the routine to a problem in the design of planar digital filters for image processing.
Comments on "Redundancy Testing in Combinational Networks"
Authors: J. E. Smith
Venue: IEEE Transactions on Computers (1979)

In the above-mentioned paper1, Lee and Davidson present an algorithm for detecting all single redundant lines in a tree-type NAND network. In order to test for a single redundancy in a nontree network, they suggest replicating portions of the network (those which fan out) to get an equivalent tree-type NAND network. The algorithm for detecting single redundancies can then be applied to
Simultaneous confidence intervals based on the percentile bootstrap approach
Authors: Micha Mandel, Rebecca A. Betensky
Venue: Computational Statistics Data Analysis (2008)

This note concerns the construction of bootstrap simultaneous confidence intervals (SCI) for m parameters. Given B bootstrap samples, we suggest an algorithm with complexity of O(mBlog(B)). We apply our algorithm to construct a confidence region for time dependent probabilities of progression in multiple sclerosis and for coefficients in a logistic regression analysis. Alternative normal based simultaneous confidence intervals are presented and compared to the bootstrap intervals.
Handling Missing Values when Applying Classification Models
Authors: Maytal Saar-Tsechansky, Foster Provost
Venue: The Journal of Machine Learning Research (2007)

Much work has studied the effect of different treatments of missing values on model induction, but little work has analyzed treatments for the common case of missing values at prediction time. This paper first compares several different methods---predictive value imputation, the distribution-based imputation used by C4.5, and using reduced models---for applying classification trees to instances with missing values (and also shows evidence that the results generalize to bagged trees and to logistic regression). The results show that for the two most popular treatments, each is preferable under different conditions. Strikingly the reduced-models approach, seldom mentioned or used, consistently outperforms the other two methods, sometimes by a large margin. The lack of attention to reduced modeling may be due in part to its (perceived) expense in terms of computation or storage. Therefore, we then introduce and evaluate alternative, hybrid approaches that allow users to balance between more accurate but computationally expensive reduced modeling and the other, less accurate but less computationally expensive treatments. The results show that the hybrid methods can scale gracefully to the amount of investment in computation/storage, and that they outperform imputation even for small investments.
An efficient method for statistical circuit simulation
Authors: Frank Liu
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The dynamic behavior of a VLSI circuit can be described by a system of differential-algebraic equations. When some circuit elements are affected by process variations, the dynamic behavior of the circuit will deviate from its nominal trajectory. Monte-Carlo-type random sampling methods are widely used to estimate the trajectory deviation. However they can be quite time-consuming when the dimension of the parameter space is large. This paper offers an alternative solution by casting the problem into the theoretic frame work of non-linear non-Gaussian filtering. To estimate the mean and variance of the time-dependent circuit trajectory, we develop a method based on unscented transformation, which is an efficient Bayesian analysis sampling technique. Theoretically the method has linear runtime complexity. Experimental results show that compared to traditional Monte-Carlo methods, the new method can achieve over 10x speedup with less than 2% error.
Workload-based generation of administrator hints for optimizing database storage utilization
Authors: Kaushik Dutta, Raju Rangaswami, Sajib Kundu
Venue: ACM Transactions on Storage (TOS) (2008)

Database storage management at data centers is a manual, time-consuming, and error-prone task. Such management involves regular movement of database objects across storage nodes in an attempt to balance the I/O bandwidth utilization across disk drives. Achieving such balance is critical for avoiding I/O bottlenecks and thereby maximizing the utilization of the storage system. However, manual management of the aforesaid task, apart from increasing administrative costs, encumbers the greater risks of untimely and erroneous operations. We address the preceding concerns with STORM, an automated approach that combines low-overhead information gathering of database access and storage usage patterns with efficient analysis to generate accurate and timely hints for the administrator regarding data movement operations. STORM's primary objective is minimizing the volume of data movement required (to minimize potential down-time or reduction in performance) during the reconfiguration operation, with the secondary constraints of space and balanced I/O-bandwidth-utilization across the storage devices. We analyze and evaluate STORM theoretically, using a simulation framework, as well as experimentally. We show that the dynamic data layout reconfiguration problem is NP-hard and we present a heuristic that provides an approximate solution in O(Nlog(N/M) &plus; (N/M)2) time, where M is the number of storage devices and N is the total number of database objects residing in the storage devices. A simulation study shows that the heuristic converges to an acceptable solution that is successful in balancing storage utilization with an accuracy that lies within 7&percnt; of the ideal solution. Finally, an experimental study demonstrates that the STORM approach can improve the overall performance of the TPC-C benchmark by as much as 22&percnt;, by reconfiguring an initial random, but evenly distributed, placement of database objects.
Scenes: Abstracting interaction in immersive sensor networks
Authors: Sanem Kabadayı, Christine Julien
Venue: Pervasive and Mobile Computing (2007)

Pervasive computing deployments are increasingly using sensor networks to build instrumented environments that provide local data to immersed mobile applications. These applications demand opportunistic and unpredictable interactions with local devices. While this direct communication has the potential to reduce both overhead and latency, it deviates significantly from existing uses of sensor networks that funnel information to a static central collection point. This pervasive computing driven perspective demands new communication abstractions that enable the required direct communication among mobile applications and sensors. This paper presents the scene abstraction, which allows immersed applications to create dynamic distributed data structures over the immersive sensor network. A scene is created based on application requirements, properties of the underlying network, and properties of the physical environment. This paper details our work on defining scenes, providing an abstract model, an implementation, and an evaluation.
IVVI: Intelligent vehicle based on visual information
Authors: José María Armingol, Arturo de la Escalera, Cristina Hilario, Juan M. Collado, Juan Pablo Carrasco, Marco Javier Flores, José Manuel Pastor, Fo José Rodríguez
Venue: Robotics and Autonomous Systems (2007)

Human errors are the cause of most traffic accidents, with drivers' inattention and wrong driving decisions being the two main sources. These errors can be reduced, but not completely eliminated. That is why Advanced Driver Assistance Systems (ADAS) can reduce the number, danger and severity of traffic accidents. Several ADAS, which nowadays are being researched for Intelligent vehicles, are based on Artificial Intelligence and Robotics technologies. In this article a research platform for the implementation of systems based on computer vision is presented, and different visual perception modules useful for some ADAS such as Line Keeping System, Adaptive Cruise Control, Pedestrian Protector, or Speed Supervisor, are described.
Exploring biologically-inspired evolvable network applications with the BEYOND architecture
Authors: Chonho Lee, Hiroshi Wada, Junichi Suzuki
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

The BEYOND architecture applies biological principles and mechanisms to design evolvable network applications that autonomously adapt to dynamic environmental changes in the network. This paper describes two key components in BEYOND: (1) an evolutionary adaptation engine, called iNet, for network applications and (2) an application development environment, called BEYONDwork, for the adaptation engine. iNet is designed after the mechanisms behind how the immune system works. It models a set of environment conditions (e.g., network traffic) as an antigen and a behavior of network applications (e.g., migration and reproduction) as an antibody. iNet allows each network application to autonomously sense its surrounding environment conditions (i.e., antigens) and adaptively invoke a behavior (i.e., antibody) suitable for the conditions. The configuration of antibodies evolves via genetic operations such as mutation and crossover. BEYONDwork provides visual and textual languages to configure antigens and antibodies in iNet. The languages increase the ease of specifying and modifying iNet configurations. Simulation results show that iNet allows network applications designed with BEYONDwork to evolve themselves to adapt to changing network environments.
Formalization of Architecture-Centric Model Mapping Using Category Theory
Authors: Jinkui Hou, Jiancheng Wan, Shuaiqiang Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Model transformation is touted to play a key role in model-driven development. The mapping relations between models are the foundation and basis for the transformation. On the basis of software architecture, this paper tries to provide a precise semantics for both components structuring and models mapping by using category theory. Morphism composition is used to trace the interconnections and mapping relations between component-based models, while consistency between the sorts / operations of component models at different abstract levels is maintained by functors. Category theory supports the diagrammatic representation of component model that visualizes the relationships between components and the structural features, which can be used to strengthen the understandability and traceability of model transformation. The formalization enables users to check whether the mapping relations satisfy some desired properties and also is suitable to automatic software development, and thus can make an effective support to model-driven software development.
The Upper Bound of the Number of Nodes on Fixed Energy Budget in Wireless Sensor Networks
Authors: Fang Wang, Guifa Teng, Lisheng Ren
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Wireless sensor networks are consist of large number of embedded devices that are each capable of sensing, communicating, and computing. Sensor networks have a wide variety of applications in both military and civil environment[1]. most sensors are equipped with non-rechargeable batteries that have limited lifetime[18]. Sensor nodes monitor some surrounding environmental phenomenon, process the data obtained and forward this data towards a base station located on the periphery of the sensor network. Base station(s) collect the data from the sensor nodes and transmit this data to some remote control station. Sensor network models considered by most researchers have a single static base station located on the periphery of the sensor network [2], [3], [4], [5]. Following development of technology, the number of the nodes would increase highly. The upper bound of the number of the nodes becoming more and more important. In this work, we develop closed-form expressions of the upper bound of the number of nodes in energy-efficient wireless sensor networks.
Scalable exploration of functional dependency by interpolation and incremental SAT solving
Authors: Chih-Chun Lee, Jie-Hong R. Jiang, Chung-Yang (Ric) Huang, Alan Mishchenko
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, ..., gn}, i.e. f = h(g1, ..., gn). It plays an important role in many aspects of electronic design automation (EDA), ranging from logic synthesis to formal verification. Prior approaches to the exploration of functional dependency are based on binary decision diagrams (BDDs), which may not be easily scalable to large designs. This paper proposes a novel reformulation that extensively exploits the capability of modern satisfiability (SAT) solvers. Thereby, functional dependency is detected effectively through incremental SAT solving, and the dependency function h, if it exists, is obtained through Craig interpolation. The main strengths of the proposed approach include: (1) fast detection of functional dependency with modest memory consumption and thus scalable to large designs, (2) a full capacity to handle a large set of base functions and thus discovering dependency whenever exists, and (3) potential application to large-scale logic optimization and verification reduction. Experimental results show the proposed method is far superior to prior work and scales well in dealing with the largest ISCAS89 and ITC99 benchmark circuits with up to 200K gates.
Analyzing Weighted Round Robin policies with a stochastic comparison approach
Authors: Mouad Ben Mamoun, Jean-Michel Fourneau, Nihal Pekergin
Venue: Computers and Operations Research (2008)

We study queuing delays for Weighted Round Robin (WRR) scheduling policies. The delay characteristics of these policies can be estimated through worst-case bounds as other fair queuing scheduling policies. However, these deterministic bounds are in general not accurate and they require that the input process has been shaped. Under Markovian arrival hypothesis, the delay of WRR policies can be evaluated through Markovian numerical analysis. Nevertheless, this analysis is limited to small parameter sizes because of the state space explosion problem. We propose to apply the stochastic comparison approach. We build a bounding model based on the aggregation of sessions, and we show that under the same arrivals, the packet delays in the bounding model are larger in the =
Word Processing with On-Line Script Recognition
Authors: Wolfgang Doster, Richard Oed
Venue: IEEE Micro (1984)

Adding a graphics tablet, a stylus, and special software to a personal computer system enables its users to edit text with simple, handwritten commands.
Special Feature: Building EDP Success by Standing on Shoulders
Authors: W. L. Harper
Venue: Computer (1975)

Obtaining quality documentation is one of the most difficult jobs in the analysis, design and development of a data processing system. Most DP systems require three types of documentation before a system becomes operational. These three types are the results of three evolutionary phases in the installation of a given system. Figure 1 depicts the evolutionary phases and defines the three types of documentation required. Actually, there are four phases and four types of documentation in the life of a system. The fourth phase is the System Maintenance Period of an ongoing system, and the fourth type of documentation is the User Reference Documentation.
A static simulation of dynamic delimited control
Authors: Chung-Chieh Shan
Venue: Higher-Order and Symbolic Computation (2007)

We present a continuation-passing-style (CPS) transformation for some dynamic delimited-control operators, including Felleisen's $\verb|control|$ and $\verb|prompt|$ , that extends a standard call-by-value CPS transformation. Based on this new transformation, we show how Danvy and Filinski's static delimited-control operators $\verb|shift|$ and $\verb|reset|$ simulate dynamic operators, allaying in passing some skepticism in the literature about the existence of such a simulation. The new CPS transformation and simulation use recursive delimited continuations to avoid undelimited control and the overhead it incurs in implementation and reasoning.
Induction as the Basis for Program Verification
Authors: C. Reynolds
Venue: IEEE Transactions on Software Engineering (1976)

We will consider the inductive mechanisms in five techniques for verifying iterative/recursive program structures: inductive assertion, predicate transformers, subgoal induction, computation induction, and structural induction. We will discover that all five techniques can be justified by a single theorem about inductive proof techniques. We will also show that all five techniques face the problem of finding properties that will carry an induction. Such properties are called inductive sets. We will see that the inductive sets of the five techniques are easily related to one another and that a program proof by any of the techniques can be easily converted to a proof by any of the other techniques. Our conclusion is that computer programs simply are inductive definitions of the functions they compute. Induction is the only method by which they can be proved. The problems of induction are therefore unavoidable.
Online Detecting and Tracking of the Evolution of User Communities
Authors: Ya Huang, Shixia Liu, Yi Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Clustering, known as divide a set of static data points into densely distributed groups, has long been a well-known research area. However, many real-life problems require a novel and generalized form of clustering, the evolutionary clustering. Given a dynamic set of data points that may move, disappear and emerge, the evolutionary clustering is to track the move, disappear and emerge of the corresponding clusters. In this paper, we propose converting this novel problem into an iterative form of learning a mixture model, and present a structural-EM algorithm as the solution.
Preventing network performance interference with ACK-separation queuing mechanism in a home network gateway using an asymmetric link
Authors: Jiyong Park, Seongsoo Hong
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In network-enabled consumer electronics development, much of the time and effort is spent analyzing and solving network performance problems. In this paper, we define an instance of such problems discovered while developing a commercial home network gateway. We then analyze its cause and propose a solution mechanism. Our home network gateway uses an asymmetric link (ADSL) and suffers from an undesirable phenomenon where downlink traffic interferes with upload speed. We call this phenomenon the network performance interference problem. While this problem can easily be confused with receive livelock caused by packet contention at the input queue, we find that this is not the case. By performing extensive experiments and analysis, we reveal that our problem is caused by packet contention at the output queue and certain intrinsic characteristics of TCP. We devise an ACK-separation queuing mechanism for this problem and implement it in the home network gateway. Our experiments show that it effectively solves the problem.
TomuDB: multi-resolution queries in heterogeneous sensor networks through overlay network
Authors: Yoh Shiraishi, Niwat Thepvilojanapong, Yosuke Tamura, Tatsuro Endo, Koichi Yamada, Nayuta Ishii, Hiroki Ishizuka, Keisuke Kanai, Yoshito Tobe
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Querying in heterogeneous sensor networks is a challenging research issue due to a variety of real-world queries depending on users' preferences. Examples of queries are weather, nearby restaurants, navigation, etc. Users may ask for a breezy path starting from distinct points to distinct train stations. Sensing data collected from wide areas (city or country level) are needed to provide the real-world search as a service for users. Therefore, another challenge is a collaboration of heterogenous sensor networks because deploying sensors in wide areas is impractical. SensorMap [1] collects sensing data from independent sensor networks by allowing data owners to publish their data on the web. Sensing data from all owners are sent to a centric storage in SensorMap. However, distributed data storage is likely to be an efficient solution comparing to a centric storage in which bottleneck always occurs.
Operating Systems for Computer Networks
Authors: H. C. Forsdick
Venue: Computer (1978)

The last decade has seen the rapid evolution of computer communication networks from research curiosities to operational utilities. The Arpanet,1for example, currently supports communication among more than 100 computer systems and is used daily by hundreds of users. Commercial networks, such as Telenet2in the United States and Datapac3in Canada, have very bright futures. One attraction of these networks is their ability to provide access to a wide variety of resources distributed among the connected computers.
Self-Checking Combinational Logic Binary Counters
Authors: R. C. Dorr
Venue: IEEE Transactions on Computers (1972)

A high-speed, self-checking count circuit realization is attainable by using combinational logic and parity prediction. The utilization of combinational logic as opposed to sequential logic design generally minimizes the amount of software necessary for routine and diagnostic testing. Count circuits with parity prediction find application in stand-alone, self-checking processors.