ppxscal/embedding_network huggingface dataset:
The economics of simulation
Authors: Paul Gray
Venue: ACM SIGSIM Simulation Digest (1977)

This paper presents a framework for decision making about simulations before committing resources. The viewpoint is that of a manager who must decide whether to solve a problem by simulation or by some other means. A decision-analysis type model is introduced to allow the manager to determine the minimum cost method of simulation within the operating and policy constraints of his organization. Two case examples using the metholology are presented.
ImprovingWriter Identification by Means of Feature Selection and Extraction
Authors: Andreas Schlapbach, Vivian Kilchherr, Horst Bunke
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

To identify the author of a sample handwriting from a set of writers, 100 features are extracted from the handwriting sample. By applying feature selection and extraction methods on this set of features, subsets of lower dimensionality are obtained.We show that we can achieve significantly better writer identification rates if we use smaller feature subsets returned by different feature extraction and selection methods. The methods considered in this paper are feature set search algorithms, genetic algorithms, principal component analysis, and multiple discriminant analysis.
3D Strain Detection of a Support Implant for an Artificial Hip Joint Using Finite Element Method and Genetic Algorithm
Authors: Chika Maeda, Syoji Kobashi, Nao Shibanuma, Katsuya Kondo, Yutaka Hata
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

A form of a support implant used in revision total hip arthroplasty (THA) should be diagnosed periodically because it may be distorted or broken. This paper proposes a new method that estimates the strength of stress on the support implant using finite element method (FEM) and genetic algorithm (GA). 3D sectional images of the support implant in vivo are acquired from multidtector-row computed tomography (MDCT) devices. The proposed method searches for a model whose shape is same as the support implant in MDCT images using GA. The database consists of many parts of the support implant that are generated by FEM with various patterns of strain. Direction and strength of the stress are estimated from the searched model. As a result of the proposed method applying to simulated MDCT images of horseshoe-shaped phantoms, the proposed method found the correct model. Also, the method detected the strain within the error of 1.03±0.38mm and 33.0±12.3N. Additionally, we applied the method to MDCT images of 2 patients after THA. The results showed that the direction and the strength of the stress were successfully estimated.
Control of a robot manipulator and pendubot system using artificial neural networks
Authors: Joseph Constantin, Chaïban Nasr, Denis Hamad
Venue: Robotica (2005)

The paper introduces artificial neural networks for the conventional control of robotic systems for better tracking performance. Different advanced dynamic control techniques are explained and a new second order recursive algorithm has been developed to tune the weights of the neural network. The problem of real-time control of a Pendubot system in difficult situations has been addressed. Examples, such as positioning and balancing structures, are presented and performances are compared to a conventional PD controller.
Parallel Gray Code Optimization for High Dimensional Problems
Authors: Hualin Wang, Okan K. Ersoy
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

A parallel Gray code optimization (PGCO) algorithm is proposed in this paper. The Gray code optimization (GCO) shares some similarities with Genetic Algorithm (GA) and Evolutionary Programming (EP). It uses a binary representation, but the only operator is the mutation of a number of bits. The evolving strategy utilizes the adjacency property of the Gray code. By controlling how many bits to flip, it keeps a balance between global search and local search. Another property of the GCO is that the population size is not fixed. It grows linearly with the dimension of the problem, which help to alleviate the curse of the dimensionality. In order to avoid the slow convergence of high dimensional problems, a parallel Gray code algorithm using Message Passing Interface (MPI) was implemented. Its scalability in a Beowulf Windows Cluster was investigated.
Improved Data Compression for Serial Interconnected Network on Chip through Unused Significant Bit Removal
Authors: Simon Ogg, Bashir Al-Hashimi
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison to parallel schemes. Poor bandwidth increases the risk of congestion and potential loss of packetised data. This paper proposes a simple yet effective real-time compression technique that reduces the amount of bits sent over serial links. The proposed technique reduces the number of bits and the number of transitions when compared to the original uncompressed data. A case study showing the results of compression on two MPEG1 coded picture data shows average bit reductions of approximately 17% to 47% and average transition reductions of approximately 15% to 24% over a serial link.
Inter-AS Session & Connection Management for QoS-guaranteed DiffServ Provisioning
Authors: Young-Tak Kim
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

For QoS-guaranteed realtime multimedia differentiated services provisioning across multiple AS (autonomous system) domain network, session configuration with SIP/SDP and bidirectional connection establishment using UNI &NNI signaling (i.e., RSVP-TE) are essential. Also, a scalable transit networking scheme must be provided so as to configure scalable per-class-type QoS-guaranteed packet processing and to provide scalable connection admission control (CAC). In this paper, we analyze the functional architecture of session &connection management with SIP/SDP, RSVP-TE, COPS (common open policy service)- based CAC and QoS-guaranteed virtual overlay networking. We also evaluate the overall interaction procedure among functional modules for scalable QoS-guaranteed DiffServ provisioning across multiple autonomous system (AS) domain networks.
Traffic Isolation and Network Resource Sharing for Performance Control in Grids
Authors: P. Vicat-blanc Primet, J. Zeng
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

While grids reach further to geographically separated clusters and data warehouses, grid applications pose new demands on end-to-end performance control. Data-intensive grid applications rely on the underneath network to bring together distributed computational and storage resources. From computational grids to data grids, the focus of resource utilization is shifting from computing power to network resources. This article investigates network resource sharing in grids, especially data grids. It studies traffic characteristics and quality of service( QoS) mechanisms of grid applications. A hybrid approach, which combines advance resource reservation and classical QoS differentiation, is proposed to meet grid application performance requirements. Identifying three types of resource reservation scenarios, that is, long-lived, short-lived, and flexible shortlived, the article formulates optimization problem of network resource sharing. Proven NP-complete, the problem is pursued with heuristics and simulations.
Indexing and querying of sequence databases
Authors: Tamer Kahveci
Venue:  (2005)

Sequence databases arise in many real world applications. Time series data, such as stock market data, and biological data, such as DNA, and protein sequences and protein structures are only a few examples. Next generation sequence databases (a) encompass terabytes of data; (b) use complex measures of similarity/distance; (c) contain data of arbitrary size. Items (a) to (c) imply that indexing and querying of these databases are difficult tasks. This dissertation is concerned with scalable indexing methods that enable efficient querying of sequence databases. Three types of sequence databases are considered. The first one is the time series data. An index structure that allows optimal querying when the query length is not known in advance is proposed. Also, shift/scale invariance, when multiple attributes involved is discussed. The second one is the genome sequences, such as DNA and protein sequences. A novel vector space embedding is developed. This embedding is then utilized for (i) searching a query sequence, (ii) comparison of large sequences, and (iii) incremental searches. The third one is the protein structures. An efficient index is proposed that enables searches at the Secondary Structure Element (SSE) level. Finally, a single index structure that combines both sequence and structure of proteins is developed.
Striping Delay-sensitive Packets over Multiple Burst-loss Channels with Random Delays
Authors: Gene Cheung, Puneet Sharma, Sung-Ju Lee
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Multi-homed mobile devices have multiple wireless communication interfaces, each connecting to the Internet via a long range but low speed and bursty WAN link such as a cellular link. We propose a packet striping system for such multi-homed devices - a mapping of delay-sensitive packets by an intermediate gateway to multiple channels, such that the overall performance is enhanced. In particular, we model and analyze the striping of delay-sensitive packets over multiple burst-loss channels with random delays. We first derive the expected packet loss ratio when forward error correction (FEC) is applied for error protection over multiple channels. We next model and analyze the case when the channels are bandwidth-limited with shifted- Gamma-distributed transmission delays. We develop a dynamic programming-based algorithm that solves the optimal striping problem for the ARQ, the FEC, and the hybrid FEC/ARQ case.
Efficient Probabilistic Packet Marking
Authors: Qunfeng Dong, Suman Banerjee, Micah Adler, Kazu Hirata
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Probabilistic packet marking is a general technique which routers can use to reveal internal network information to end-hosts. Such information is probabilistically set by the routers in headers of regular IP packets on their way to destinations. A number of potential applications have been identified, such as IP traceback, congestion control, robust routing algorithms, dynamic network reconfiguration, and locating Internet bottlenecks, etc. In this paper, we define EPPM, an efficient general probabilistic packet marking scheme with a wide range of potential applications, of which locating Internet bottlenecks and IP traceback are investigated as two representative examples to demonstrate its effectiveness. Our proposed scheme imposes only a single-bit overhead in the IP packet headers. More importantly, it significantly reduces the number of IP packets required to convey the relevant information when compared to the prior best known scheme (almost by two orders of magnitude).
Aspect-Oriented Real-Time System Modeling Method Based on UML
Authors: Lichen Zhang, Ruicheng Liu
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Real-time systems could be modeled using AOP based on UML. Timing requirements could be separated from the system according the separation of concerns techniques, expressed as a time-aspect independence of the system, and designed occurrence. So a timing model could be created to describe the time of the system. Finally the timing model could be woven into the system to compose a real-time system based on the AOP technology only when needed for a particular application. Also UML had been extended to express AOP and the time model. The real-time systems could be modeled from the static structure, dynamic behaviors and weaving of the time-aspect, and an elevator case had been given as an example.
Tails of Condition Number Distributions
Authors: Alan Edelman, Brian D. Sutton
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Let $\kappa$ be the condition number of an $m$-by-$n$ matrix with independent standard Gaussian entries, either real ($\beta = 1$) or complex ($\beta = 2$). The major result is the existence of a constant $C$ (depending on $m$, $n$, and $\beta$) such that $P[\kappa > x]
Hierarchical clustering of large volumetric datasets
Authors: Carl J. Granberg, Ling Li
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

In this paper we propose a multiresolution hierarchical data structure called the Ordered Cluster Binary Tree (OCBT). The OCBT is a binary tree structure that extends a Cluster Binary Tree with spatial splitting similar to that of a k-D Tree. We also show how this tree can be improved to extract data efficiently at different sub volumes and levels of detail at run time. We also incorporate a bounding sphere hierarchy to enable early search termination. This clustering algorithm can be made out-of-core and thus enables datasets of several giga bytes in size.
An Introductory Tour of Interactive Rendering
Authors: Eric Haines
Venue: IEEE Computer Graphics and Applications (2006)

The past decade has seen major improvementsin both speed and qualityin the area of interactive rendering. The focus of this article is on the evolution of the consumer-level personal graphics processor, since this is now the standard platform for most researchers developing new algorithms in the field. Instead of a survey approach covering all topics, this article covers the basics and then provides a tour of some parts the field. The goals are a firm understanding of what newer graphics processors provide and a sense of how different algorithms are developed in response to these capabilities.
Dynamic modeling and simulation of snow removal operation in an intelligent transportation system environment
Authors: Bahram Ravani
Venue:  (2005)

This work develops a dynamic model of snow removal operation in lane-keeping or lateral control. Such a model is useful in simulation of Intelligent Transportation Systems (ITS) such as an automated or driver assisted snowplowing operation. The model developed is an interaction of three models: a Vehicle Model, a Snowplowing Resistance Model, and a Driver Model. In terms of the vehicle model, the effect of chains on tires in the form of time-varying equations is integrated. In terms of the snowplowing resistance model, a new model is developed for steady-state plowing operations. In terms of the driver model, this work develops a stochastic form of a human driver model which can be used for simulating vehicle guidance and control. It is shown, how simulation using existing (non-stochastic, no disturbance) human models can assist in the design of a Roadview&trade;1 display system for snow removal operations. In addition, a new method for simulating the lateral control system of snowplowing vehicle is developed in this work. The overall aim of this work is to develop a theoretical framework for simulation environment that can be used in design and evaluation of driver assistance systems for snow removal operations in an Intelligent Transportation System environment. 1Roadview is a trademark of the Advanced Highway Maintenance and Construction Technology (AHMCT) Research Center at UC Davis.
Fuzzy Control Design Tool to Apply in FC Teaching Models
Authors: Klaus-Dietrich Kramer, Christian Blankenberg
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Computational Intelligence (CI) based model approaches, realized by Fuzzy Control models (FC) or models with Artificial Neural Networks (NN), are used as alternativ concepts to classical approaches. In university education or further training are on the one hand models necessary which represent the technical system transparent and easy cognizable and on the other hand a programming tool is required that supports an easy development process. That includes tools to verify the results and tuning the system with graphic functions under real time conditions. A Fuzzy Control Design Tool (FHFCE-Tool) and four technical modells will be presented. The methodical and didactical objective in the utilization of this teaching models is to develop solution strategies in CI applications, for example Fuzzy Controller, special to analyse different algorithms of inference or defuzzyfication and to verify and tune those systems.
Global and Local Search Algorithms for Concave Cost Transshipment Problems
Authors: Shangyao Yan, Der-Shin Juang, Chien-Rong Chen, Wei-Shen Lai
Venue: Journal of Global Optimization (2005)

Traditionally, the minimum cost transshipment problems have been simplified as linear cost problems, which are not practical in real applications. Recently, some advanced local search algorithms have been developed that can directly solve concave cost bipartite network problems. However, they are not applicable to general transshipment problems. Moreover, the effectiveness of these modified local search algorithms for solving general concave cost transshipment problems is doubtful. In this research, we propose a global search algorithm for solving concave cost transshipment problems. Effecient methods for encoding, generating initial populations, selection, crossover and mutation are proposed, according to the problem characteristics. To evaluate the effectiveness of the proposed global search algorithm, four advanced local search algorithms based on the threshold accepting algorithm, the great deluge algorithm, and the tabu search algorithm, are also developed and are used for comparison purpose. To assist with the comparison of the proposed algorithms, a randomized network generator is designed to produce test problems. All the tests are performed on a personal computer. The results indicate that the proposed global search algorithm is more effective than the four advanced local algorithms, for solving concave cost transshipment problems.
Performance Improvements to the BBN Byblos OCR System
Authors: Michael Decerbo, Premkumar Natarajan, Rohit Prasad, Ehry MacRostie
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we describe four recent enhancements to the BBN Byblos OCR System, a multilingual HMMbased character recognition system which has been demonstrated on a variety of languages, including English, Arabic, Chinese, and Japanese. These enhancements are implemented as optional extensions to the system and provide improved performance for certain scripts or domains. Projection-based reestimation of line boundaries reduces instability in the presence of some types of noise. An alternate modeling strategy used in the first of two recognition search passes substantially increases speed on languages with a large number of characters. Another speed improvement comes from automatic discovery and modeling of sub-characters. The use of Heteroschedastic Linear Discriminant Analysis (HLDA) makes modeling more tractable by reducing feature-space dimensionality.
WETICE 2005 Tenth Securities Technologies (ST) Workshop Report (Formerly Enterprise Security (ES))
Authors: David P. Gilliam
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The Securities Technologies (ST) Workshop was formerly called the Enterprise Security (ES) Workshop. The name was changed to reflect better a more comprehensive name to the topics being discussed which ranged beyond just security in and for the enterprise. The Workshop deals with topics that span multiple enterprises, including Peer to Peer (P2P), Grid Computing, security of large-scale backbones, software security, et al. Consequently, it was suggested that the Workshop consider a name change to more accurately reflect the topics of the papers it was receiving and delivering. Several names were considered and Security Technologies was selected. However, the name Enterprise Security has not been dropped as it was the name under which it was organized originally.
The maximum state complexity for finite languages
Authors: Cezar Câmpeanu, Wing Hong Ho
Venue: Journal of Automata, Languages and Combinatorics (2004)

A measure of the complexity of a regular language L is the number of states in the smallest DFA accepting L. We study this quantity in the case of finite languages over a non-unary alphabet. We compute the maximum number of states of a minimal deterministic finite automaton (DFA) recognizing words of length less than or equal to some given integer. We also compute the maximum number of states of a minimal complete DFA that accepts only words of length equal to a given integer. For both cases, we prove that the upper bound can be reached by an explicit construction of a DFA, and we compute the asymptotic behavior of the upper bound.
High Performance Cluster Computing Using Component-Oriented Distributed Systems
Authors: V. K. Murthy
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Component oriented distributed computing uses a collection of different types of components to achieve high performance in solving a problem by identifying each component as an object. The usefulness of the transactional paradigm in Component Oriented Programming (COP) is explained. We also describe a simplified version of COP (a master-slave-like computation) that is suitable for high performance cluster computing and indicate how to implement this paradigm using MPI.
Learning Lazy Naive Bayesian Classifiers for Ranking
Authors: Liangxiao Jiang, Yuanyuan Guo
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Naive Bayes (simply NB) has been well-known as an effective and efficient classification algorithm. However, it is based on the conditional independence assumption that it is often violated in applications. In addition, in many real-world data mining applications, however, an accurate ranking of instances is often required rather than an accurate classification. For example, a ranking of customers in terms of the likelihood that they buy one's products is useful in direct marketing. In this paper, we firstly investigate the ranking performance of some lazy learning algorithms for extending naive Bayes. The ranking performance is measured by AUC [9, 5]. We observe that they can not significantly improve naive Bayes' ranking performance. Motivated by this fact and aiming at improving naive Bayes with accurate ranking, we present a new lazy learning algorithm, called lazy naive Bayes (simply LNB), to extend naive Bayes for ranking. We experimentally tested our algorithm, using the whole 36 UCI data sets [4] recommended by Weka [1], and compared it to NB and C4.4 [11] measured by AUC. The experimental results show that our algorithm significantly outperforms both NB and C4.4.