ppxscal/embedding_network huggingface dataset:
Artificial Immune Networks Based Radial Basic Function Neural Networks Construction Algorithm and Application
Authors: Jiang Zhong, Yong Feng, Chunxiao Ye, Ling Ou, Zhiguo Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

An RBFNN can be regarded as a feedforward artificial neural network with a single layer of hidden units, whose responses are the output of radial basis functions (RBFs). The central problem in training a radial basis function neural network is the selection of hidden layer neurons, which includes the selection of the center and width of those neurons. In this paper, we propose a method to select hidden layer neurons based on multiple granularities immune network, and then, training a cosine RBF neural network base on gradient descent learning process. Also, the new method is applied for intrusion detection and it is observed that the proposed approach gives better performance over some traditional approaches.
Two-mode multi-partitioning
Authors: Roberto Rocci, Maurizio Vichi
Venue: Computational Statistics Data Analysis (2008)

New methodologies for two-mode (objects and variables) multi-partitioning of two way data are presented. In particular, by reanalyzing the double k-means, that identifies a unique partition for each mode of the data, a relevant extension is discussed which allows to specify more partitions of one mode, conditionally to the partition of the other one. The performance of such generalized double k-means has been tested by both a simulation study and an application to gene microarray data.
Construction of adapted subdivision schemes for bounded intervals based on radial basis function interpolation
Authors: Jungho Yoon
Venue: Journal of Applied Mathematics and Computing (2007)

We study stationary subdivision schemes based on radial basis function interpolation. Each scheme has a tension parameter, say λ, which actually belongs to the radial basis function. In particular, adapted subdivision rules on bounded intervals are developed.
A Two-Way Automaton with Fewer States than Any Equivalent One-Way Automaton
Authors: B. H. Barnes
Venue: IEEE Transactions on Computers (1971)

This correspondence presents an example of a two-way automaton which has significantly fewer states than any one-way automaton accepting the same set of tapes. Thus, in this particular case, memory space can be saved by using a two-way automaton. This savings in space, however, is accompanied by an increase in recognition time.
Transform-Invariance in Local Averaging Classifier for Handwritten Digit Pattern Recognition
Authors: S. Hotta
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, a classification method designed by com- bining a local averaging classifier and a tangent distance is proposed for handwritten digit pattern recognition. In practice, first the k-nearest neighbors of an input sample are selected in each class by using a two-sided tangent dis- tance. Next, the mean vectors of the selected transformed- neighbor samples are computed in individual classes. Fi- nally, the input sample is classified to the class that mini- mizes the one sided tangent distance between the input sam- ple and the mean one. The superior performance of the pro- posed method is verified with the experiments on benchmark datasets MNIST and USPS.
Bayesian prediction of the transient behaviour and busy period in short- and long-tailed GI/G/1 queueing systems
Authors: M. Concepción Ausín, Michael P. Wiper, Rosa E. Lillo
Venue: Computational Statistics Data Analysis (2008)

Bayesian inference for the transient behaviour and duration of a busy period in a single server queueing system with general, unknown distributions for the interarrival and service times is investigated. Both the interarrival and service time distributions are approximated using the dense family of Coxian distributions. A suitable reparameterization allows the definition of a non-informative prior, and Bayesian inference is then undertaken using reversible jump Markov chain Monte Carlo methods. An advantage of the proposed procedure is that heavy-tailed interarrival and service time distributions such as the Pareto can be well approximated. The proposed procedure for estimating the system measures is based on recent theoretical results for the Coxian/Coxian/1 system. A numerical technique is developed for every MCMC iteration so that the transient queue length and waiting time distributions and the duration of a busy period can be estimated. The approach is illustrated with both simulated and real data.
Coevolving programs and unit tests from their specification
Authors: Andrea Arcuri, Xin Yao
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Writing a formal specification before implementing a program helps to find problems with the system requirements. The requirements might be for example incomplete and ambiguous. Fixing these types of errors is very difficult and expensive during the implementation phase of the software development cycle. Although writing a formal specification is usually easier than implementing the actual code, writing a specification requires time, and often it is preferred, instead, to use this time on the implementation. In this paper we introduce for the first time a framework that might evolve any possible generic program from its specification. We use the Genetic Programming to evolve the programs, and at the same time we exploit the specifications to coevolve sets of unit tests. Programs are rewarded on how many tests they do not fail, whereas the unit tests are rewarded on how many programs they make fail. We present and analyse four different problems on which this novel technique is successfully applied.
Hybrid Heuristics Scheduling Algorithm for Hot Strip Mill
Authors: Wang Xiaoping, Gao Huimin, Zeng Jianchao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper introduces the scheduling algorithm of a computer simulation and scheduling system for hot strip mill. The mathematical model of Hot Strip Mill Scheduling Problem (HSMSP) is formulated. A hybrid heuristics method is proposed, based on parallel strategy, which integrates domain expertise, Genetic Algorithm(GA) and Tabu Search(TS). Domain expertise is used to classify and sort production orders to generate initial solutions in parallel. GA is used to improve the initial solutions. And TS attempt to accelerate the convergence of the solutions by adopting swaps of `single slab' and `slab section'. `Single slab' and `slab section', which we firstly introduced, are new adjacent solutions (neighborhood). Simulation results have shown that the proposed method is feasible and efficient.
Real-Time Behavior of Programs
Authors: V. H. Haase
Venue: IEEE Transactions on Software Engineering (1981)

Verification and compile-time checking of the behavior of programs in real time is an important issue in many applications, e.g., process control, lab automation, and monitoring of missiles and vehicles. Present day programming languages and compilers lack the facilities of calculating execution times of programs.
Physician's Workstation with Real-Time Performance
Authors: Samuel Goldwasser, R. Rleynolds, Ted Bapty, David Baraff, John Summers, David Talton, Ed Walsh
Venue: IEEE Computer Graphics and Applications (1985)

A general framework for real-time manipulation-of 3D objects from-medical data sets promises physicians a powerful new tool.
A Homogeneous Set-Theoretical Frame for Clustering Fuzzy Relational Data
Authors: Narcis Clara
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Our purpose is to provide a set-theoretical frame to clus- tering fuzzy relational data basically based on cardinality of the fuzzy subsets that represent objects and their comple- mentaries, without applying any crisp property. From this perspective we define a family of fuzzy similarity indexes which includes a set of fuzzy indexes introduced by Tolias et al, and we analyze under which conditions it is defined a fuzzy proximity relation. Following an original idea due to S. Miyamoto we evaluate the similarity between objects and features by means the same mathematical procedure. Join- ing these concepts and methods we establish an algorithm to clustering fuzzy relational data. Finally, we present an example to make clear all the process.
Function Finding and Constants Creation Method in Evolutionary Algorithm Based on Overlapped Gene Expression
Authors: Jing Peng, Chang-jie Tang, Dong-qing Yang, Shao-jie Qiao, Jing Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Evolutionary algorithm based on overlapped gene expression (EAOGE) is a new technology of evolutionary algorithm which is inspired by the overlap gene expression in biological research. Different from existing works, EAOGE suggests a new expression structure of genes, and these genes have a probability to overlapped express in some segments. It uses chromosomes of fixed length to represent expression trees of different shapes and sizes. It does unconstrained search in the genome space and still ensures validity of the expression. This paper implements EAOGE algorithm and proposes a new constants creation method. Extensive experiments show that the method significantly improves the precision in the problems of function finding, and the precision of the new method is about 12.8 times to traditional algorithm at least.
Speed Identification of Ultrasonic Motors Based on Evolutionary Elman Network
Authors: Hongwei Ge, Wenli Du, Feng Qian, Zhencheng Ye
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A learning algorithm for dynamic recurrent Elman neural networks is proposed based on an improved adaptive genetic algorithm. The proposed algorithm performs the evolution of network structure, weights, initial inputs of the context units and self-feedback coefficient of the modified Elman network together. Two dynamic identification algorithms for nonlinear systems are constructed successively based on the proposed algorithm to perform the speed identification for ultrasonic motors. Numerical results show that the proposed algorithms not only realize the fully automatic optimization design for the dynamic recursive neural network, but also improve the precision of convergence for model identification.
Survey of graph database models
Authors: Renzo Angles, Claudio Gutierrez
Venue: ACM Computing Surveys (CSUR) (2008)

Graph database models can be defined as those in which data structures for the schema and instances are modeled as graphs or generalizations of them, and data manipulation is expressed by graph-oriented operations and type constructors. These models took off in the eighties and early nineties alongside object-oriented models. Their influence gradually died out with the emergence of other database models, in particular geographical, spatial, semistructured, and XML. Recently, the need to manage information with graph-like nature has reestablished the relevance of this area. The main objective of this survey is to present the work that has been conducted in the area of graph database modeling, concentrating on data structures, query languages, and integrity constraints.
The Implementation of Fast Radix 2 Transforms on Array Processors
Authors: C. R. Jesshope
Venue: IEEE Transactions on Computers (1980)

Methods of implementing fast radix 2 transforms on array processors are considered. The complexity of arithmetic and data routing operations is analyzed for the methods given. It is shown that all methods give an O(P) speed-up in the arithmetic operations for a P processor array. However the methods incur an overhead in data organization. Theorems are presented that prove one method to be superior in minimizing this overhead for transforms of length N > P.
Effect of size and plasma treatment and the application of Weibull distribution on the breakdown of PECVD SiNx MIM capacitors
Authors: Chia-Cheng Ho, Bi-Shiou Chiou
Venue: Microelectronic Engineering (2008)

The dielectric breakdown field is one of the important concerns for device reliability. The breakdown of dielectric is originated at a fatal flaw that grows to cause failure and can be explained by the weakest-link theory. In this study, metal-insulator-metal (MIM) capacitors with plasma enhanced chemical vapor deposited (PECVD) SiN"x are prepared. Ammonia (NH"3) plasmas are applied after the deposition of the dielectric SiN"x. The Weibull distribution function, which is based on the weakest-link theory, is employed to analyze the effect of the electrode area as well as the plasma treatment on the breakdown of the MIM capacitors. The time dependent dielectric breakdown testing indicates a decrease in both the leakage current and the lifetime of the MIM capacitors treated with plasma. Possible dielectric degradation mechanisms are explored.
Program Behavior and the Performance of Interleaved Memories
Authors: B. R. Rau
Venue: IEEE Transactions on Computers (1979)

One of the major factors influencing the performance of an interleaved memory system is the behavior of the request sequence, but this is normally ignored. This paper examines this issue. Using trace driven simulations it is shown that the commonly used assumption, that each request is independently and equally likely to be to any module, is not valid. The duality of memory interference with paging behavior is noted and this suggests the use of the least-recently used stack model to model program behavior. Simulations indicate that this model is reasonably accurate. An accurate, though approximate, expression for the bandwidth is derived based upon this model.
A Fuzzy AHP approach to evaluating e-commerce websites
Authors: Yi-wen Liu, Young-jik Kwon, Byeong-do Kang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

As e-commerce is playing a more and more important role in our daily life, there is no wonder that significant attention is being focused on the evaluation of e-commerce websites in recent years. In this paper, a fuzzy analytic hierarchy process (FAHP) approach is used to evaluating e-commerce websites, which can tolerate vagueness and uncertainty of judgment. Therefore, the insufficiency and imprecision problems associated with the conventional AHP can be solved. Hence, websites can be evaluated more reasonably. In the end, a case study is presented to make this approach more understandable for a decision-maker(s).
Program obfuscation: a quantitative approach
Authors: Bertrand Anckaert, Matias Madou, Bjorn De Sutter, Bruno De Bus, Koen De Bosschere, Bart Preneel
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. This paper presents the first steps toward a comprehensive evaluation suite consisting of a number of deobfuscating transformations and complexity metrics that can be readily applied on existing and future transformations in the domain of binary obfuscation. In particular, a framework based on software complexity metrics measuring four program properties: code, control flow, data and data flow is suggested. A number of well-known obfuscating and deobfuscating transformations are evaluated based upon their impact on a set of complexity metrics. This enables us to quantitatively evaluate the potency of the (de)obfuscating transformations.
A scalability comparison of GST and SST MANET multicast routing algorithms
Authors: Sang-Chul Kim
Venue: Computer Communications (2007)

Since network resource of mobile ad hoc network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MANET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted.
Storage routing for DTN congestion control: Research Articles
Authors: Matthew Seligman, Kevin Fall, Padma Mundur
Venue: Wireless Communications Mobile Computing (2007)

The Delay Tolerant Networking (DTN) architecture approaches the problem of reliable message delivery in intermittent networks using a store-and-forward approach where messages may remain stored for relatively long periods of time in persistent storage at DTN routers. Forwarded messages are removed from persistent storage only when transfer acknowledgment to another router or final recipient is received. Congestion in such networks takes the form of persistent storage exhaustion. Several solutions exist including slowing sources, using alternative routes, discarding traffic, or migrating messages to alternative storage locations. We propose storage routing (SR), a congestion management solution of the last form. SR employs nearby nodes with available storage to store data that would otherwise be lost given uncontrollable data sources (such as sensors). SR determines a collection of messages and neighbors to migrate them to using a set of locally scoped distributed algorithms, possibly incorporating loops that are known to be optimal for some DTN routing scenarios and decouples storage management from global DTN route selection. Simulations show up to a 500 per cent performance improvement using SR as compared with a comparable scenario lacking SR. Furthermore, we show a desirable parameter insensitivity to node storage capacity, neighborhood search radius, and message lifetime. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Medical Applications of Wireless Networks
Authors: Shobha G., Ranjana R. Chittal, Kamod Kumar
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Sensor based technology has invaded the medical devices with a wide range of devices available today with wireless network capability, which have the potential to replace thousands of wires connected to devices found in the hospitals. This technology has the capability of providing the reliability with enhanced mobility. It is being looked upon as alternative solution to provide low cost medical solution along with enhanced accessibility to the patients in view of permanent usage of wireless devices. In this survey paper background of applications of wireless networks in the medical field and the issues and challenges involved in this technology transforming lives of several people who are deprived of quality health care facilities are discussed. Finally architecture for this communication system is discussed.
Dynamic spatial approximation trees
Authors: Gonzalo Navarro, Nora Reyes
Venue: Journal of Experimental Algorithmics (JEA) (2008)

Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other repositories handling complex objects. Although promising, the metric space approach is still immature in several aspects that are well established in traditional databases. In particular, most indexing schemes are static, that is, few of them tolerate insertion or deletion of elements at reasonable cost over an existing index. The spatial approximation tree (sa--tree) has been experimentally shown to provide a good tradeoff between construction cost, search cost, and space requirement. However, the sa--tree is static, which renders it unsuitable for many database applications. In this paper, we study different methods to handle insertions and deletions on the sa--tree at low cost. In many cases, the dynamic construction (by successive insertions) is even faster than the previous static construction, and both are similar elsewhere. In addition, the dynamic version significantly improves the search performance of sa--trees in virtually all cases. The result is a much more practical data structure that can be useful in a wide range of database applications.
Extensible Security Patterns
Authors: Philip Robinson
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Security engineering is more complex in modern enterprise systems, having to consider diverse operational properties including those of participants and resources. This paper describes extensible security patterns, a framework for engineering a system's security according to its operational properties. The framework is referred to as extensible, as its language and methodology allow for refinement of the patterns at different phases of the system's specification.
Characterization of polymer matrix and low melting point solder for anisotropic conductive film
Authors: Yong-Sung Eom, Ji-Won Baek, Jong-Tae Moon, Jae-Do Nam, Jong-Min Kim
Venue: Microelectronic Engineering (2008)

The chemo-rheological mechanisms of a polymer matrix and a low melting point solder for an anisotropic conductive film (ACF) have been characterized. For the material characterization of the polymer matrix and solder, a differential scanning calorimetry (DSC) and a dynamic mechanical analyzer (DMA) experiments were conducted. The conversion and viscosity of the polymer matrix was observed by DSC and DMA, respectively. In order to control the curing conditions such as the reaction temperature and time of polymer matrix, the adequate amount of catalyst was used. The compatibility between the viscosity of a polymer matrix and a melting temperature of solder was characterized to optimize the processing cycle. The reductant was also added to remove the oxide layer performed on the surface of solder in the air environment. Based on these chemo-rheological phenomena of the polymer matrix and solder, the optimum polymer system and its processing cycle were designed for the high performance and reliability in the electrical interconnection system.
WRAPLE: The Weighted Repair Assistance Program Learning Extension
Authors: W. R. Simpson, C. S. Dowling
Venue: IEEE Design Test (1986)

The weighted repair assistance program learning extension, or WRAPLE, is a maintenance aid to help technicians isolate faults?anecessary step in system repair. We derived the fault isolation strategies used in WRAPLE from a knowledge-based information-theoreticapproach that incorporates fixed experience. This approach contrasts with fault isolation strategies, which are developedfrom estimates and remain fixed. A fault isolation strategy that ?learned? would adapt to field conditions and change on thebasis of actual failures and use of maintenance resources, permitting more efficient maintenance and reducing mean time torepair. In this article, we describe WRAPLE and the learning algorithms by which it modifies its output. We also present anexample of a typical system to illustrate the technique.
A Microcomputer-based Model Robot System with Pulse-Width Modulation Control
Authors: Richard Wainwright, Randy Moss
Venue: IEEE Micro (1985)

Constructed of relatively inexpensive but realistic and durable elements, this model is a practical tool for training in robot operation and for research in robotic control systems.