ppxscal/embedding_network huggingface dataset:
A statistical study of a class of cellular evolutionary algorithms
Authors: Mathieu Capcarrère, Marco Tomassini, Andrea Tettamanzi, Moshe Sipper
Venue: Evolutionary Computation (1999)

Parallel evolutionary algorithms, over the past few years, have proven empirically worthwhile, but there seems to be a lack of understanding of their workings. In this paper we concentrate on cellular (fine-grained) models, our objectives being: (1) to introduce a suite of statistical measures, both at the genotypic and phenotypic levels, which are useful for analyzing the workings of cellular evolutionary algorithms; and (2) to demonstrate the application and utility of these measures on a specific example---the cellular programming evolutionary algorithm. The latter is used to evolve solutions to three distinct (hard) problems in the cellular-automata domain: density, synchronization, and random number generation. Applying our statistical measures, we are able to identify a number of trends common to all three problems (which may represent intrinsic properties of the algorithm itself, as well as a host of problem-specific features. We find that the evolutionary algorithm tends to undergo a number of phases which we are able to quantitatively delimit. The results obtained lead us to believe that the measures presented herein may prove useful in the general case of analyzing fine-grained evolutionary algorithms.
Ada 2005 code patterns for metamodel-based code generation
Authors: José A. Pulido, Juan A. de la Puente, Jérome Hugues, Matteo Bordin, Tullio Vardanega
Venue: ACM SIGAda Ada Letters (2007)

In this paper we discuss the issues we have explored, as part of the ASSERT project, in the definition and implementation of Ada coding patterns for the support of the automated code generation stage of a comprehensive approach to model-driven development for high-integrity systems.
Thermal annealing effect on electrical properties of metal nitride gate electrodes with hafnium oxide gate dielectrics in nano-metric MOS devices
Authors: S. Chatterjee, Y. Kuo, J. Lu
Venue: Microelectronic Engineering (2008)

Electrical properties of hafnium oxide (HfO"2) gate dielectric with various metal nitride gate electrodes, i.e., tantalum nitride (TaN), molybdenum nitride (MoN), and tungsten nitride (WN), were studied over a range of HfO"2 thicknesses, e.g., 2.5-10nm, and post-metal annealing (PMA) temperatures, e.g., 600^oC to 800^oC. The work function of the nitride gate electrode was dependent on the material and the post-metal annealing (PMA) temperature. The scanning transmission electron microscopy technique is used to observe the effect of PMA on the interfacial gate dielectric thickness. After high-temperature annealing, the metal nitride gates were suitable for NMOS. At the same PMA temperature, the oxide-trapped charges increased and the interface state densities decreased with the increase of the HfO"2 thickness for TaN and WN gate electrodes. However, for MoN gate electrode the interface state density is almost independent of film thickness. Therefore, dielectric properties of the HfO"2 high-k film depend not only on the metal nitride gate electrode material but also the post-metal annealing condition as well as the film thickness. During constant voltage stress of the MOS capacitors, an increase in the time-dependent gate leakage current is also observed.
Towards a demonstrably-correct ada compiler
Authors: Chris Nettleton, Wilson Ifill, Colin Marsh
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

We report on a significant new compiler technology for applications requiring the highest level of reliability. This work is partly funded by AWE plc and takes into account previous AWE work on a demonstrably correct compiler for a Pascal-like language. This work will be of interest to anyone developing safety-critical software. Today's Ada compilers are based on 1980s' technology, when 4M Bytes of memory was considered sufficient for a project of 10 users. Using today's computers, when even a laptop computer has 512 M Bytes of memory; we can offer a much better compiler for a fraction of the cost. Initial estimates suggest a new technology compiler will be 1/50th the number of source lines, yet meet all our requirements for features and run-time performance. We have already confirmed the feasibility of our approach in a prototype compiler. This handles a well-defined subset of Ada95 and employs algebraic simplifications in place of optimizations. By prohibiting recursion, we avoid costly run-time organization. Our prototype run-time system is just three instructions. Our compiler is written in a notation much like ordinary mathematics, and is therefore amenable to mathematical techniques such as theorem proving. Later we intend to offer a proof of correctness. In the meantime, we will demonstrate correctness, both in the sense that a given program has been correctly compiled, and that all programs will be correctly compiled. The prototype compiler performs well. It compiles at several thousand lines per second and generates code that compares well with that from our optimizing compiler.
Dynamic Complexity and the Owen Firmware Product Line Program
Authors: Holt Mebane, Joni T. Ohta
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

Since the paper "A Cooperative Model for Cross-Divisional Product Development for a Software Product Line" [1] was presented at SEI SPLC 2000, the Owen firmware program has undergone considerable evolution.The scope and variation of the product line has grown by 10x and lines of code from 500K to over 5M.To accomplish this, Owen has survived some major growing pains but still maintained its core model and principles that had made it successful.This year, Owen celebrates 10 years of firmware product line engineering.This paper seeks to describe how Owen has responding to increasing dynamic complexity at the business and engineering level in order to support the increasing demands of the HP inkjet product family.
Craniofacial Superimposition in Forensic Identification using Genetic Algorithms
Authors: Lucia Ballerini, Oscar Cordon, Sergio Damas, Jose Santamaria, Inmaculada Aleman, Miguel Botella
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Craniofacial superimposition is a process that aims to identify a person by overlaying a photograph and a model of the skull. This process is usually carried out manually by forensic anthropologists; thus being very time consuming and presenting several difficulties in finding a good fit between the 3D model of the skull and the 2D photo of the face. In this paper we present a fast and automatic procedure to tackle the superimposition problem. The proposed method is based on real-coded genetic algorithms. Synthetic data are used to validate the method. Results on a real case from our Physical Anthropology lab of the University of Granada are also presented.
A Parallel Picture Processing Machine
Authors: B. Kruse
Venue: IEEE Transactions on Computers (1973)

A parallel picture processing machine (PPM) is presented. The proposed machine can perform local operations of both logical and arithmetical character on three by three neighborhoods of digitized pictures. It is essentially a two-dimensional machine but in a restricted sense it can be regarded as three-dimensional. The instruction repertoire is thoroughly discussed and several program examples are presented. In thelast section the implementation of the machine is described and v various tradeoffs between speed and economy are discussed. A dynamically programmable microprogram store is shown to give great freedom in program design.
SensBution: A Rule-Based Peer-to-Peer Approach for Sensor-Based Infrastructures
Authors: Tom Gross, Thilo Paul-Stueve, Tsvetomira Palakarska
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Ubiquitous environments facilitate the fast and easy access to users' physical environments. Ubiquitous environments typically capture users' presence and activities in a room with a multitude of sensors, process and infer on the captured data, and adapt the environment accordingly. In order to create working ubiquitous environments developers need adequate platforms that allow them to focus on novel concepts and implementations for the interaction of the users with their ubiquitous environment. SensBution provides generic and flexible support for developers of ubiquitous environments through a combined approach that is event-based and rulebased, and offers client-server and peer-to-peer structures. In this paper we present SensBution. We present the concept, base technology used, and implementation of SensBution. And finally we compare SensBution to related work.
Multistep specific stochastic inclusions and their multiestimates
Authors: B. I. Anan'Ev
Venue: Automation and Remote Control (2007)

Consideration was given to the recurrent relations for the conditional and unconditional probabilistic distributions of the random information sets in the multistep stochastic inclusions. In view of the special form of inclusions, the desired relations are equivalent to the evolution of the finite-dimensional vectors uniquely defined by the system. These vectors in turn define uniquely the random information sets christened in the paper the multiestimates. Therefore, in the described cases one manages to avoid consideration of rather complicated probabilistic distributions in the space of compacts and reduce the situation to the description of a standard evolution of the Markov sequences.
Guest Editors' Introduction Implementing Quantitative SQA: A Practical Model
Authors: V. R. Basili
Venue: IEEE Software (1987)

Considering the product is not enough in SQAyou must also consider the development process. This model addresses both needs.
The Delicate Tradeoffs in BitTorrent-like File Sharing Protocol Design
Authors: Bin Fan, Dah-ming Chiu, John Lui
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

The BitTorrent (BT) file sharing protocol is popular due to its scalability property and the incentive mechanism to reducefree-riding. However, in designing such P2P file sharing protocols, there is a fundamental "tussle" between keeping peers,specially the more resourceful ones, in the system for as long as possible to help the system achieve better performance andallowing peers finish their download as quickly as possible. The current BT protocol represents only "one" possible implementationin this whole design spectrum. In this paper, we characterize the "complete" design space of BT-like protocols. We use fairnessindex to measure the fairness that incorporates the contribution peers make. We show that there is a wide range of designchoices, ranging from optimizing the performance of file download, to optimizing the fairness measure. More importantly, weshow that there is a simple and easily implementable design knob which can be used to choose a particular operating pointin the design space. We then discuss different algorithms (centralized versus distributed) in realizing the design knob. Wealso carry out performance evaluation to quantify the merits and properties of the BT-like file sharing protocols.
Ensemble Learning and Optimizing KNN Method for Speaker Recognition
Authors: Yan Zhang, Zhen-min Tang, Yan-ping Li, Bo Qian
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Ensemble with K Nearest Neighbor (KNN) learner is a novel approach to speaker recognition. It has many advantages over other conversational methods such as simplicity and good generalization ability. At the same time, the generalization ability of an ensemble could be significantly better than that of a single learner. In this paper, we intend to improve the performance of the speaker recognition system by introducing a novel method combining optimizing annular region-weighted distance k nearest neighbor with BagWithProb ensemble learning schemes. Experiments studied in this paper indicate that the proposed method can effectively improve the accuracy of speaker identification system.
A Learning-based Eye Detector Coupled with Eye Candidate Filtering and PCA Features
Authors: Bruno de Brito Leite, Eanes Torres Pereira, Herman Martins Gomes, Luciana Ribeiro Veloso, Cicero Einstein do Nascimento Santos, Joao Marques de Carvalho
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

In this work, we present a system based on a Neural Network classifier for eye detection in human face images. This classifer works on eye candidate regions extracted from a face image and represented by a reduced number of features, selected by Principal Component Analysis. The regions are determined considering that in an image window containing the eye, the grey level distribution will generally assume a pattern of adjacent light-dark-light horizontal and vertical stripes, corresponding to the eyelid, pupil and eyelid, respectively. For training, validation and testing, a database was built with a total of 4,400 images. Experimental results have shown that the proposed approach correctly detects more eyes than any of two existing systems (Rowley-Baluja-Kanade and Machine Perception Toolbox), for eye location error tolerances from 0 to 5 pixels. Considering an error tolerance of 9 pixels, the correct detection rate achieved was above 90%.
Comparison-based algorithms are robust and randomized algorithms are anytime
Authors: Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
Venue: Evolutionary Computation (2007)

Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good performance. The theoretical analysis of these algorithms usually focuses on convergence rates. This paper presents a mathematical study of randomized search heuristics which use comparison based selection mechanism. The two main results are that comparison-based algorithms are the best algorithms for some robustness criteria and that introducing randomness in the choice of offspring improves the anytime behavior of the algorithm. An original Estimation of Distribution Algorithm combining both results is proposed and successfully experimented.
Quorum and connected dominating sets based location service in wireless ad hoc, sensor and actuator networks
Authors: Dandan Liu, Xiaohua Jia, Ivan Stojmenović
Venue: Computer Communications (2007)

Location service provides position of mobile destination to source node to enable geo-routing. In existing quorum-based location service protocols, destination node registers its location along a 'column' while source node makes a query along a 'row'. Grid and quorum-based location service is based on division of network into square grids, and selecting 'leader' location server node in each grid. Location updates, leader reelection and information transfer are performed whenever destination and leader nodes are moving to a different grid. We propose here to apply connected dominating sets (DS) as an alternative to grids. We also improved basic quorum, and applied on DS-quorum (DS based quorum) better criterion for triggering local information exchanges and global location updates, by meeting two criteria: certain distance movement and certain number of observed link changes with (DS) nodes. Backbones created by DS nodes (using 1-hop neighborhood information) are small size, do not have a parameter like grid size, and preserve network connectivity without the help of other nodes. Location updates and destination searches are restricted to backbone nodes. Both methods use 'hello' messages to learn neighbors. While this suffices to construct DS, grid leader (re)election requires additional messages. Simulation results show that using DS as backbone for quorum construction is superior to using grid as backbone or no backbone at all. The proposed DS-quorum location service can achieve higher (or similar) success rate with much less communication overhead than grid-based approaches.
Cooperation between wired and wireless networks
Authors: Bartlomiej Zielinski
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Wireless transmission is an interesting alternative or supplement to the wired one. An interesting problem is the cooperation between wired and wireless networks. The simplest way is to do a conversion on a physical layer level, however, there are many conditions that are hard to fulfil in order to achieve proper co-operation between both links. It is also possible to do a conversion on a link layer level. It has many advantages obtained at the cost of additional transmission delays. The protocol converter may have several hardware and software variant that are discussed. A basic time analysis is shown to present the converter's influence upon network behaviour in different situations.
Power system damping control through fuzzy static VAR compensator design including crisp optimum theory
Authors: A. H. M. A. Rahim, H. M. Al-Maghraby, E. P. Nowicki
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

Static VAR compensators (SVC) are known to improve voltage and reactive power flow in a power system. Properly controlled SVCs can also provide damping to power system oscillations. This article presents a fuzzy logic SVC controller design for damping control considering different input signals. A fuzzy logic control strategy has been developed that uses crisp optimum control theory to obtain the best combination of speed deviation and acceleration signals so as to stabilize the system in minimum time. The proposed fuzzy controller requires much less fuzzy variables, and is computationally very efficient. Simulation results show that the crisp optimum control based fuzzy logic controller provides excellent damping to the power system compared to the general fuzzy strategies.
Techniques to Reduce the Inherent Limitations of Fully Digit On-Line Arithmetic
Authors: R. M. Owens
Venue: IEEE Transactions on Computers (1983)

A fully digit on-line arithmetic unit generates at least the i most (least) significant digits of the output after having been supplied no more than the (i + k) most (least) significant digits of each input, where k is some small constant. This digit serial property can be used to reduce the aggregate fill and flush times of a chained list of digit on-line arithmetic units (which in turn reduces the required amount of parallelism needed to obtain high hardware utilization), and the VLSI interconnection complexity (which in turn reduces pin count). However, because of this digit serial property, unique limitations may be imposed on any arithmetic unit which performs certain operations in a digit on-line manner. Furthermore, these limitations are inherent in the sense that any fully digit on-line arithmetic unit which performs these operations will have some type of similar limitations. For some calculations, these limitations may be so severe as to make evaluation of that calculation by a digit on-line arithmetic unit virtually impossible. For other calculations, these limitations may not be nearly as severe. We will investigate techniques to either avoid or reduce the impact of these limitations.
A Note on Easily Testable Realizations for Logic Functions
Authors: K. L. Kodandapani
Venue: IEEE Transactions on Computers (1974)

It is shown that at most, n + 3 tests are required to detect any single stuck-at fault in an AND gate or a single faulty EXCLUSIVE OR (EOR) gate in a Reed-Muller canonical form realization of a switching function.
I think it's better if those who know the area decide about it: a pilot study concerning power in CS student project groups
Authors: Mattias Wiggberg
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

In the light of an emerging interest in project work within the CS curricula, research about projects is gaining importance. In the current work I investigate a full semester CS project course, where focus is on how power is distributed within a group of students. CS skills are shown to be a contributing factor when it comes to power. Using a phenomenographic research approach, a way of researching some aspects on power within CS projects groups is demonstrated. Finally, three qualitatively different ways of experiencing CS skills of other students, and thus power, are revealed.
Study of Sensor Networks Gathers Data Based on Chaotic Neural Network
Authors: Shu da Wang, Qing Zhu, Jing Yang, Feng Si
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In Wireless Sensor Networks, energy is the very important network resources. How enhances the effectiveness of the pitch point and the network energy under the limited energy condition, enables the network work as long as possible, is one kind of this network design essential target. Chaotic neural network can achieve this kind of item, and had proven quicker restrain through the simulation, found the optimum solution or the approximate-to-optimum solution. This algorithm can reduce energy and lengthen the life-time in the entire sensor network.
Approximation by Bézier type of Meyer-König and Zeller operators
Authors: Shunsheng Guo, Hongbiao Jiang, Qiulan Qi
Venue: Computers Mathematics with Applications (2007)

In this paper, we give direct, inverse and equivalence approximation theorems for the Bezier type of Meyer-Konig and Zeller operator with unified Ditzian-Totik modulus @w"@f"^"@l(f,t) (0@?@l@?1).
Design and Implementation of a 50MHZ DXT CoProcessor
Authors: Mohammad Amin Amiri, Reza Ebrahimi Atani, Sattar Mirzakuchaki, Mojdeh Mahdavi
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

Frequency analysis using the DFT, the DHT, the DCT or the DST is an obvious choice for signal processing domain. This paper describes the implementation of a DXT coprocessor of transform length '8' for the synchronous design in a 0.22 LM Flash-based FPGA device (ACTEL). The total dynamic power of 359.24 mW, with an operating frequency of 50 MHz and an operating voltage of 2.5 V is achieved. The paper presents the trade-offs involved in designing the architecture, the design for performance issues and the possibilities for future development.
Making Cost Effective Security Decision with Real Option Thinking
Authors: Jingyue Li, Xiaomeng Su
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

One of the major challenges in IT security management is determining how much to spend and where to spend. This requires understanding of the economic issues regarding IT security. Real option analysis presents a viable alternative to traditional economic tools in planning and valuing security investment in uncertain environment. This paper illustrates how decision makers can use real option thinking to articulate and compare different security solutions in terms of their business value in an environment characterized by high levels of uncertainty.