ppxscal/embedding_network huggingface dataset:
Permutation Free Encoding Technique for Evolving Neural Networks
Authors: Anupam Das, Md. Shohrab Hossain, Saeed Muhammad Abdullah, Rashed Ul Islam
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

This paper presents a new evolutionary system using genetic algorithm for evolving artificial neural networks (ANNs). The proposed algorithm is "Permutation free Encoding Technique for Evolving Neural Networks"(PETENN) that uses a novel encoding scheme for representing ANNs. Existing genetic algorithms (GAs) for evolving ANNs suffer from the permutation problem, resulting from the recombination operator. Evolutionary Programming (EP) does not use recombination operator entirely. But the proposed encoding scheme avoids permutation problem by applying a sorting technique. PETENN uses two types of recombination operators that ensure automatic addition or deletion of nodes or links during the crossover process. The evolutionary system has been implemented and applied to a number of benchmark problems in machine learning and neural networks. The experimental results show that the system can dynamically evolve ANN architectures, showing competitiveness and, in some cases, superiority in performance.
Mainframe Implementation With Off-The-Shelf LSI Modules
Authors: B. R. Borgerson
Venue: Computer (1978)

Bit-sliced microprocessor parallel design for Sperry Univac 1108 improves performance, reduces build cost, and detects most faults.
Function Approximation by Neural Networks
Authors: Fengjun Li
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

Neural networks are widely used to approximating continuous functions. In order to study its approximation ability, we discuss the constructive approximation on the whole real lines by an radial basis function (RBF) neural network with a fixed weight. Using the convolution method, we present a family of RBF neural networks with fixed weights that are able to uniformly approximate continuous functions on a compact interval. Our method of proof is constructive. And this work provides a method for function approximation.
Regression Verification - A Practical Way to Verify Programs
Authors: Ofer Strichman, Benny Godlin
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

When considering the program verification challenge [8] one should not forget a lesson learned in the testing community: when it comes to industrial size programs, it is not realistic to expect programmers to formally specify their program beyond simple assertions. It is well known that large parts of real code cannot be described naturally with high level invariants or temporal properties, and further that it is often the case that the process of describing what a code segment should do is as difficult and at least as complicated as the coding itself. Indeed, high-level temporal property-based testing, although by now supported by commercial tools such as Temporal-Rover[4], is in very limited use. The industry typically attempts to circumvent this problem with Regression Testing, which is probably the most popular testing method for general computer programs. It is based on the idea of reasoning by induction: check an initial version of the software when it is still very simple, and then check that a newer version of the software produces the same output as the earlier one, given the same inputs. If this process results with a counterexample, the user is asked to check whether it is an error or a legitimate change. In the latter case the testing database is updated with the new 'correct' output value.Regression Testing does not require a formal specification of the investigated system nor a deep understanding of the code, which makes it highly suitable for accompanying the development process, especially if it involves more than one programmer.We propose to learn from this experience and develop techniques for Regression Verification. The underlying proof engine is still a certifying compiler as envisioned by the grand challenge, so this proposal should be thought of as another application of this technology that makes the verification picture more complete.
User-Customized Interactive System Using Both Speech and Face Recognition
Authors: Sung-Ill Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

In this paper, we discuss the user-customized interaction for intelligent home environments. The interactive system is based upon the integrated techniques using both speech and face recognition. For essential modules, the speech recognition and synthesis were basically used for a virtual interaction between user and the proposed system. In experiments, particularly, the real-time speech recognizer based on the HM-Net(Hidden Markov Network) was incorporated into the proposed system. Besides, the face identification was adopted to customize home environments for a specific user. In evaluation, the results showed that the proposed system was useful and easy to use for intelligent home environments, even though the performance of the speech recognizer was not better than the simulation results owing to the ambient noisy environments. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Specified Blocks
Authors: Eric C. Hehner
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.
Cuts for Conic Mixed-Integer Programming
Authors: Alper Atamtürk, Vishnu Narayanan
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learning, and probabilistic integer programming.Here we study mixed-integer sets defined by second-order conic constraints. We describe general-purpose conic mixed-integer rounding cuts based on polyhedral conic substructures of second-order conic sets. These cuts can be readily incorporated in branch-and-bound algorithms that solve continuous conic programming relaxations at the nodes of the search tree. Our preliminary computational experiments with the new cuts show that they are quite effective in reducing the integrality gap of continuous relaxations of conic mixed-integer programs.
EED: Energy Efficient Disk drive architecture
Authors: Yuhui Deng, Frank Wang, Na Helian
Venue: Information Sciences: an International Journal (2008)

Energy efficiency has become one of the most important challenges in designing future computing systems, and the storage system is one of the largest energy consumers within them. This paper proposes an Energy Efficient Disk (EED) drive architecture which integrates a relatively small-sized NAND flash memory into a traditional disk drive to explore the impact of the flash memory on the performance and energy consumption of the disk. The EED monitors data access patterns and moves the frequently accessed data from the magnetic disk to the flash memory. Due to the data migration, most of the data accesses can be satisfied with the flash memory, which extends the idle period of the disk drive and enables the disk drive to stay in a low power state for an extended period of time. Because flash memory consumes considerably less energy and the read access is much faster than a magnetic disk, the EED can save significant amounts of energy while reducing the average response time. Real trace driven simulations are employed to validate the proposed disk drive architecture. An energy coefficient, which is the product of the average response time and the average energy consumption, is proposed as a performance metric to measure the EED. The simulation results, along with the energy coefficient, show that the EED can achieve an 89.11% energy consumption reduction and a 2.04% average response time reduction with cello99 trace, a 7.5% energy consumption reduction and a 45.15% average response time reduction with cello96 trace, and a 20.06% energy consumption reduction and a 6.02% average response time reduction with TPC-D trace, respectively. Traditionally, energy conservation and performance improvement are contradictory. The EED strikes a good balance between conserving energy and improving performance.
Performance Analysis of the REAchability Protocol for IPv6 Multihoming
Authors: Antonio La Oliva, Marcelo Bagnulo, Alberto García-Martínez, Ignacio Soto
Venue: Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2007)

There is ongoing work on the IETF aimed to provide support for different flavors of multihoming configurations, such as SHIM6 for multihomed sites, multiple CoAs support in MIP for multihomed mobile nodes and HIP for multihomed nodes and sites. A critical aspect for all the resulting multihoming protocols is to detect failures and gain information related with the paths available between two hosts. The Failure Detection and Locator Path Exploration Protocol (in short REAchability Protocol, REAP) being defined in the SHIM6 WG of the IETF is a good candidate to be included as a reachability detection component on protocols requiring this functionality. Performance study is performed by combining analytical estimations and simulations to evaluate its behavior and tune its main parameters.
On Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
Authors: Paulo Oliva, Thomas Streicher
Venue: Fundamenta Informaticae (2008)

This article investigates Krivine's realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a twostep interpretation which first eliminates classical logic via a negative translation and then applies standard realizability interpretation. We then argue that a slight variant of Krivine's interpretation corresponds to this two-step interpretation. This variant can be viewed as the continuation passing style variant of Krivine's original interpretation, and as such uses standard &lambda;-terms and avoids the use of new continuation constants in the interpretation of classical logic.
Target Recognition of FLIR Images on Radial Basis Function Neural Network
Authors: Jun Liu, Xiyue Huang, Yong Chen, Naishuai He
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The study of small target recognition in low SNR (Signal Noise Ratio) is the key problem about processing of forward-looking infrared (FLIR) images information. Eight features of objects based on IR radiation characteristics and wavelet-based are presented. These features are used to a radial basis function (RBF) network as input for learning and classification. The propose recognition algorithm is invariant to the translation, rotation, and scale channel of a shape. Experiments by real infrared images and noisy images are performed, and recognition results show that the method is very effective.
Task Memories and Task Forums: A Foundation for Sharing Service-Based Personal Processes
Authors: Rosanna Bova, Hye-Young Paik, Boualem Benatallah, Liangzhao Zeng, Salima Benbernou
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

The growing number of online accessible services call for effective techniques to support users in discovering, selecting, and aggregating services. We present WS-Advisor, a framework for enabling users to capture and share task memories. A task memory represents knowledge (e.g., context and user rating) about services selection history for a given task. WS-Advisor provides a declarative language that allows users to share task definitions and task memories with other users and communities. The service selection component of this framework enables a user agent to improve its service selection recommendations by leveraging task memories of other user agents with which the user share tasks in addition to the local task memories.
LiveNet: Using Passive Monitoring to Reconstruct Sensor Network Dynamics
Authors: Bor-Rong Chen, Geoffrey Peterson, Geoff Mainland, Matt Welsh
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

We describe LiveNet, a set of tools and analysis methods for reconstructing the complex behavior of a deployed sensor network. LiveNet is based on the use of multiple passive packet sniffers co-located with the network, which collect packet traces that are merged to form a global picture of the network's operation. The merged trace can be used to reconstruct critical aspects of the network's operation that cannot be observed from a single vantage point or with simple application-level instrumentation. We address several challenges: merging multiple sniffer traces, determining sniffer coverage, and inference of missing information for routing path reconstruction. We perform a detailed validation of LiveNet's accuracy and coverage using a 184-node sensor network testbed, and present results from a real-world deployment involving physiological monitoring of patients during a disaster drill. Our results show that LiveNet is able to accurately reconstruct network topology, determine bandwidth usage and routing paths, identify hot-spot nodes, and disambiguate sources of packet loss observed at the application level.
Dynamic Positioning Method Based on Dominant Region Diagram to Realize Successful Cooperative Play
Authors: Ryota Nakanishi, Kazuhito Murakami, Tadashi Naruse
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

In this paper, we propose a new technique to compute, in real time, the positions of robots in a cooperative play such as the pass-and-shoot play. To evaluate the positioning of the robot, we use the Dominant Region (DR) diagram, which is a kind of a Voronoi diagram. In the DR diagram, the soccer field is divided into regions, each of which shows an area that a robot can reach faster than the other robots. This division is based on the time of arrival while the division by the Voronoi diagram is based on the distance of arrival. Though the DR diagram plays a primary role in the positioning of the robots, it has a serious problem of taking much computation time. To overcome this problem, we show an approximate calculation procedure to obtain the DR diagram, which realizes the real time computation, i.e. a computation within a frame time. Applying the approximate dominant diagram to the positioning of the robots for the pass play, we show, by the simulation study, the DR diagram can be calculated in real time, an appropriate position for the pass play can be obtained.
Assessment of Real-Time Software Specifications Quality Using COSMIC-FFP
Authors: Manar Abu Talib, Adel Khelifi, Alain Abran, Olga Ormandjieva
Venue: Software Process and Product Measurement: International Conference, IWSM-Mensura 2007, Palma de Mallorca, Spain, November 5-8, 2007. Revised Papers (2007)

The success of a system development project largely depends on the non ambiguity of its system-level requirements specification document where the requirements are described at the 'system level' and not at the software and hardware level, and which document serves as an input to the design, implementation and testing phases. The way the system requirements specification document is written is sometimes ambiguous from a software viewpoint. This paper approaches the problem faced by the codesign, namely, the ill-defined functionality allocation between the hardware and the software for real time systems and presents an initial solution to it. It discusses what are the system requirements to be assigned to the hardware and what is really to be done by the software? Different decisions can lead then to various alternatives of allocation of functions between hardware and software: this will affect what software will be built and, correspondingly, the final functional size of software while measuring it using COS-MIC-FFP measurement method. This paper presents an initial solution towards understanding the applicability of the COSMIC-FFP functional size measurement method in assessing the hardware-software requirements allocation, and illustrates the approach on a Steam Boiler Controller case study.
On the Computational Power of Biochemistry
Authors: Luca Cardelli, Gianluigi Zavattaro
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. We use two process algebras, the Chemical Ground Form (CGF) which is equivalent to basic chemistry, and the Biochemical Ground Form (BGF) which is a minimalistic extension of CGF with primitives for complexation. We characterize an expressiveness gap: CGF is not Turing complete while BGF supports a finite precise encoding of Random Access Machines, a well-known Turing powerful formalism.
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
Authors: Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
Venue: Informatica (2008)

This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and translation invariant local structures defined by minutiae point and its neighboring minutiae points. Then the collection of most probable correspondences of matched minutiae is found. Finally, the local structures of higher order are validated. All three steps are completely rotation and translation invariant, robust to nonlinear deformations and do not use any fingerprint alignment. Experimental results on publicly available as well as internal databases show an improved performance of the proposed method in comparison with the traditional minutiae based algorithms that perform fingerprint registration.
Optimizing Real-Time Ordered-Data Broadcasts in Pervasive Environments Using Evolution Strategy
Authors: Rinku Dewri, Darrell Whitley, Indrajit Ray, Indrakshi Ray
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

We consider the problem of real-time data broadcast scheduling in pervasive systems with soft deadlines and constraints on the order in which data items should be broadcast to be useful. The broadcast schedule needs to be generated to provide a certain level of quality of service. Thus, the real-time scheduler has to effectively trade-off between its running time and the quality of schedules generated. We use an evolution strategy to solve the problem. The variants tested includes (1 + ¿)-ES, (1,¿)-ES, and a (2 + 1)-ES with a modified Syswerda recombination operator, as well as a genetic algorithm.
Brief paper: A mathematical framework for the control of piecewise-affine models of gene networks
Authors: Etienne Farcot, Jean-Luc Gouzé
Venue: Automatica (Journal of IFAC) (2008)

This article introduces results on the control of gene networks, in the context of piecewise-affine models. We propose an extension of this well-documented class of models, where some input variables can affect the main terms of the equations, with a special focus on the case of affine dependence on inputs. Some generic control problems are proposed, which are qualitative, respecting the coarse-grained nature of piecewise-affine models. Piecewise constant feedback laws that solve these control problems are characterized in terms of affine inequalities, and can even be computed explicitly for a subclass of inputs. The latter is characterized by the condition that each state variable of the system is affected by at most one input variable. These general feedback laws are then applied to a two-dimensional example, consisting in two genes inhibiting each other. This example has been observed in real biological systems, and is known to present a bistable switch for some parameter values. Here, the parameters can be controlled, allowing to express feedback laws leading to various behaviours of this system, including bi-stability as well as situations involving a unique global equilibrium.
Automatic data processing in larger manufacturing plants
Authors: M. E. Salveson, R. G. Canning
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

If you have ever tried to drag a small child through a toy department, while trying to catch a train, you will have some feeling for the troubles of the Production Control Manager. He is faced with a never ending stream of unexpected troubles, all of which tend to keep him from making good his schedule. Development of ingenious methods to solve this problem has helped some, but in many cases, both the problem and ulcers remain.
A Context-Aware Mandatory Access Control Model for Multilevel Security Environments
Authors: Jafar Haadi Jafarian, Morteza Amini, Rasool Jalili
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments like military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes may be required in some environments. Moreover, as computing technology becomes more pervasive, flexible access control mechanisms are needed. Unlike traditional approaches for access control, such access decisions depend on the combination of the required credentials of users and the context of the system. Incorporating context-awareness into mandatory access control models results in a model appropriate for handling such context-aware policies and context- sensitive class association mostly needed in multilevel security environments. In this paper, we introduce a context-aware mandatory access control model (CAMAC) capable of dynamic adaptation of access control policies to the context, and handling context-sensitive class association, in addition to preservation of confidentiality and integrity. One of the most significant characteristics of the model is its high expressiveness which allows us to express various mandatory access control models such as Bell-LaPadula, Biba, Dion, and Chinese Wall with it.