ppxscal/embedding_network huggingface dataset:
On The Stability Problem for a Class of Dynamical System
Authors: Jiemin Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper presents an analysis on a time delayed nonlinear dynamical system, gets a new convenient global stability result and finds a concise expression about the bound of time-delay. The system can be used to describe many dynamical system problems. The result has wide application, and the condition needed can be satisfied easily. Such an analysis is useful to time delayed Hopfield model based neural network design in practical applications.
The Integrated Control of Electronic Suspension and Steering System Based on Fuzzy Logic Method in Vehicle
Authors: L. Zheng, Y. N. Li, J. Shao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

As well known, electrical power assisted steering system (EPS) can improve driver's steering operation and vehicle maneuverability by creating reactive torque, otherwise, semi-active suspension system (SAS) can improve the ride quality and handling performance within a given suspension stroke limitation through varying the damping forces continuously according to the road disturbance. Usually, EPS and SAS perform independently to improve maneuverability in steering and the ride comfort respectively. However, as the electronic control subsystems of the chassis in vehicle, they often work together, the performances of vehicle depend not only every subsystem but also the relationship of these subsystems strongly. In this paper, the full vehicle model, the SAS model and EPS model are established, then the integrated control of EPS and SAS is investigated and the fuzzy logic control strategy is presented to control the integrated electronic control system. Numerical simulations are carried out to identify the effectiveness of the integrated control system of EPS and SAS. The simulation results show that the integrated control system can obviously improve vehicle maneuverability and ride quality much more than EPS and SAS control system only.
Implicit niching in a learning classifier system: Nature's way
Authors: Jeffrey Horn, David E. Goldberg, Kalyanmoy Deb
Venue: Evolutionary Computation (1994)

We approach the difficult task of analyzing the complex behavior of even the simplest learning classifier system (LCS) by isolating one crucial subfunction in the LCS learning algorithm: covering through niching. The LCS must maintain a population of diverse rules that together solve a problem (e.g., classify examples). To maintain a diverse population while applying the GAs selection operator, the LCS must incorporate some kind of niching mechanism. The natural way to accomplish niching in an LCS is to force competing rules to share resources (i.e., rewards). This implicit LCS fitness sharing is similar to the explicit fitness sharing used in many niched GAs. Indeed, the LCS implicit sharing algorithm can be mapped onto explicit fitness sharing with a one-to-one correspondence between algorithm components. This mapping is important because several studies of explicit fitness sharing, and of niching in GAs generally, have produced key insights and analytical tools for understanding the interaction of the niching and selection forces. We can now bring those results to bear in understanding the fundamental type of cooperation (a.k.a. weak cooperation) that an LCS must promote.
Improving the accuracy of the diffusion model in highly absorbing media
Authors: Alexander X. Cong, Haiou Shen, Wenxiang Cong, Ge Wang
Venue: Journal of Biomedical Imaging (2007)

The diffusion approximation of the Boltzmann transport equation is most commonly used for describing the photon propagation in turbid media. It produces satisfactory results in weakly absorbing and highly scattering media, but the accuracy lessens with the decreasing albedo. In this paper, we presented a method to improve the accuracy of the diffusion model in strongly absorbing media by adjusting the optical parameters. Genetic algorithm-based optimization tool is used to find the optimal optical parameters. The diffusion model behaves more closely to the physical model with the actual optical parameters substituted by the optimized optical parameters. The effectiveness of the proposed technique was demonstrated by the numerical experiments using the Monte Carlo simulation data as measurements.
A Novel Hybrid Training Method for Hopfield Neural Networks Applied to Routing in Communications Networks
Authors: W. H. Schuler, C. J. A. Bastos-Filho, A. L. I. Oliveira
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Efficient routing algorithms are very important for the operation of communication networks, including the Internet. This article proposes a novel hybrid intelligent method for routing which combines Hopfield Neural Networks (HNN) and simulated annealing (SA). The proposed method introduces a modified version of the discrete-time equation used by Bastos-Filho et al [1]. The novel version of the equation aims to improve the HNN convergence, thereby decreasing the computation cost. In our method, the SA algorithm is used to obtain the optimal parameters of the HNN. Simulations reported in this paper shows that the proposed method outperforms the method of Bastos-Filho et al [1], by computing routes using smaller number of iterations and smaller error.
A Consistency Result for the Normalized Eight-Point Algorithm
Authors: Wojciech Chojnacki, Michael J. Brooks
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9):1172-1177, 2003] relies upon adoption of a certain model for statistical data distribution. Under this model, the cost function that underlies the algorithm operating on the normalized data is statistically more advantageous than the cost function that underpins the algorithm using unnormalized data. Here we extend this explanation by introducing a more refined, structured model for data distribution. Under the extended model, the normalized eight-point algorithm turns out to be approximately consistent in a statistical sense. The proposed extension provides a link between the existing statistical rationalization of the normalized eight-point algorithm and the approach of Mühlich and Mester for enhancing total least squares estimation methods via equilibration. Our contribution forms part of a wider effort to rationalize and interrelate foundational methods in vision parameter estimation.
A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test
Authors: Hratch Mangassarian, Andreas Veneris, Sean Safarpour, Marco Benedetti, Duncan Smith
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Many CAD for VLSI techniques use time-frame expansion, also known as the Iterative Logic Array representation, to model the sequential behavior of a system. Replicating industrial-size designs for many time-frames may impose impractically excessive memory requirements. This work proposes a performance-driven, succinct and parametrizable Quantified Boolean Formula (QBF) satisfiability encoding and its hardware implementation for modeling sequential circuit behavior. This encoding is then applied to three notable CAD problems, namely Bounded Model Checking (BMC), sequential test generation and design debugging. Extensive experiments on industrial circuits confirm outstanding run-time and memory gains compared to state-of-the-art techniques, promoting the use of QBF in CAD for VLSI.
Construction of limiting process operations using ultrafilters of measurable spaces
Authors: A. G. Chentsov
Venue: Automation and Remote Control (2007)

Consideration is given to representations of limiting process operations in terms of ultrafilters of measurable spaces and in terms of (0,1)-measures generated by these ultrafilters. Properties that are specified by the existence of non-Dirac countably additive (0,1)-measures and have the sense of degeneracy of corresponding "limiting" operations are studied. Properties of spaces whose elements are uniform limits of step mappings called tier mappings are analysed. We consider applications of these mappings in constructions connected with the design of correct extensions for abstract problems of attainability that admit natural analogs with problems of construction and study of properties of attainability domains of controlled systems.
A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
Authors: Zhibin Zhu
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper, the feasible type SQP method is improved. A new SQP algorithm is presented to solve the nonlinear inequality constrained optimization. As compared with the existing SQP methods, per single iteration, in order to obtain the search direction, it is only necessary to solve equality constrained quadratic programming subproblems and systems of linear equations. Under some suitable conditions, the global and superlinear convergence can be induced.
Visualization of geographic query results for small screen devices
Authors: Maria Beatriz Carmo, Ana Paula Afonso, Paulo Pombinho Matos
Venue: Proceedings of the 4th ACM workshop on Geographical information retrieval (2007)

The visualization of geo-referenced information on a map has become an essential method to help the users to get the intended information. The adaptation of visualization techniques for mobile devices, such as, PDA and mobile phones make this type of applications ubiquitous. However, the context of mobility and the limitations of mobile devices, such as, the small screen, suggest that some visualization techniques may not be appropriate for those devices. In this work we intend to integrate filtering mechanisms, based on semantic criteria, and to use multiple representations with different levels of detail to generate intelligible representations as a result of geographic queries in mobile environments.
Prefix-free regular languages and pattern matching
Authors: Yo-Sub Han, Yajun Wang, Derick Wood
Venue: Theoretical Computer Science (2007)

We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free.
Finite Precision Rational Arithmetic: An Arithmetic Unit
Authors: P. Kornerup
Venue: IEEE Transactions on Computers (1983)

The foundations of an arithmetic unit performing the add, subtract, multiply, and divide operations on rational operands are developed. The unit uses the classical Euclidean algorithm as one unified algorithm for all the arithmetic operations, including rounding. Binary implementations are discussed, based on techniques known from SRT division, and utilizing ripple-free borrow-save and carry-save addition. Average time behavior is investigated.
Analysis and Optimal Design of Self-Diagnosable Systems with Repair
Authors: P. Ciompi
Venue: IEEE Transactions on Computers (1979)

A new approach to the problem of diagnosability with repair of digital systems composed of n units, of which at most t are faulty, is introduced.
A novel intensity based optical proximity correction algorithm with speedup in lithography simulation
Authors: Peng Yu, David Z. Pan
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

It is important to reduce the Optical Proximity Correction (OPC) runtime while maintaining a good result quality. In this paper, we obtain a better formula, which theoretically speeds up the widely used method, Optimal Coherent Approximations (OCA's), by a factor of 2x. We speed up the OPC algorithm further by making it intensity based (IB-OPC), because it requires much less intensity simulations than the conventional Edge Placement Error (EPE) based OPC algorithms. In addition, the IB-OPC algorithm, which uses the efficiently computed sensitivity information, converges faster than the EPE based OPC. Our IB-OPC experimental results show a runtime speedup of up to 15x with a comparable result quality as of the EPE based OPC.
Technology in Science Education: The Next 10 Years
Authors: J. I. Lipson
Venue: Computer (1980)

Federal activity in key areas can help ensure the successful application of the microcomputer and the videodisk to science education.
A survey of Application Generators
Authors: E. Horowitz
Venue: IEEE Software (1985)

By encouraging the unsophisticated computer user to develop his own dataintensive programs, application generators can significantly improve software productivity.
TMM: Software Maintenance by Transformation
Authors: G. Arango
Venue: IEEE Software (1986)

Porting an undocumented program without any source changes demonstrates the value of a transformational theory of maintenance. The theory is based on the reuse of knowledge.
Understanding GSM/EDGE Modulated Signal Test on Cellular BB SOC
Authors: Deng Yue
Venue: Proceedings of the 16th Asian Test Symposium (2007)

GSM (Global System for Mobile communications) is an open, digital cellular technology, widely used for transmitting mobile voice and data services. EDGE is the technology of enhanced data rates for GSM Evolution.
Maxprob and categorization of queries based on linguistic features
Authors: Desire Kompaore, Josiane Mothe
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

In this paper, we study the use of a probabilistic fusion approach inspired from the probFuse algorithm [14]. Our fusing technique is based on queries that are classified using some automatically extracted linguistic features [11]. In this approach, performances which are estimated during a training phase are used as an indicator of the systems to fuse. The rank list of relevant documents provided by the systems are divided into segments and used in a training/testing process to detect the systems to fuse. Our fusion technique shows better performances than other fusion techniques like CombMNZ [10], ProbFuse [14] and Best_sys [11].
Low Power Techniques for Mobile Application SoCs Based on Integrated Platform "UniPhier"
Authors: Masaitsu Nakajima, Takao Yamamoto, Masayuki Yamasaki, Tetsu Hosoki, Masaya Sumita
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this Paper, we describe the various low power techniques for mobile application SoCs based on the integrated platform "UniPhier". To minimize SoC power dissipation, hierarchical approaches from UniPhier Soc level, UniPhier Processor level, IPP (Instruction Parallel Processor) level, and Circuit level are adopted. As SoC level, 1) Well functionally isolated 5 major units of UniPhier SoC architecture, 2) Dedicated stream DMA controller which can minimize CPU load and memory access. As UniPhier Processor level, 1) UniPhier Processor consists of IPP with dedicated low power hardware engine, 2) VMP (Virtual Multi-Processor) mechanism with micro sleep which can reduce average power consumption in case of multiple tasks concurrent operation, 3) Intermittent operation with the combination of micro-sleep and clock/power down scheme in case of very light load operation. As IPP level, 1) Sophisticated instruction fetch buffer mechanism which can reduce more than 50% memory access for instruction fetch. 2) Hierarchical and selective clock gating scheme by detailed clock power analysis and clock activity rate analysis on real application,) Optimized physical implementation with low-power library and selective use of custom macros. As circuit level, mixed body bias technique with fixed Id and fixed Vt control which can realize 85 % delay variation suppressed and 25% ED product improvement compared with the No body bias.
Client-based access control management for XML documents
Authors: Luc Bouganim, François Dang Ngoc, Philippe Pucheral
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The erosion of trust put in traditional database servers and in Database Service Providers, the growing interest for different forms of data dissemination and the concern for protecting children from suspicious Internet content are different factors that lead to move the access control from servers to clients. Several encryption schemes can be used to serve this purpose but all suffer from a static way of sharing data. With the emergence of hardware and software security elements on client devices, more dynamic client-based access control schemes can be devised. This paper proposes an efficient client-based evaluator of access control rules for regulating access to XML documents. This evaluator takes benefit from a dedicated index to quickly converge towards the authorized parts of a - potentially streaming - document. Additional security mecanisms guarantee that prohibited data can never be disclosed during the processing and that the input document is protected from any form of tampering. Experiments on synthetic and real datasets demonstrate the effectiveness of the approach.
Non-Myopic Feature Selection Method for Continuous Attributes and Discrete Class
Authors: Manuel Mejia-Lavalle, Guillermo Rodriguez, Gustavo Arroyo
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Currently there exist diverse feature selection ranking methods and metrics for databases with pure discrete data (attributes and class), or pure continuous data. However, little work has been done for the case of continuous attributes with discrete class, and at the same time evaluating attribute subsets in a non-myopic fashion, considering its inter-dependencies or interactions. Normally what we can do is perform discretization, and then apply some traditional feature selection method; nevertheless the results vary depending on the discretization method that we utilized. Additionally, if we only evaluate isolated attributes, we probably obtain poor results, because we are not considering attribute inter-dependencies. We propose a metric and method for feature selection on continuous data with discrete class, inspired in the Shannon's entropy and the Information Gain, which overcomes the above problems. In the experiments that we realized, with synthetic and real databases, the proposed method has shown to be fast and produce near optimum solutions, selecting few attributes.
Accelerating and Adapting Precomputation Threads for Effcient Prefetching
Authors: Weifeng Zhang, Dean M. Tullsen, Brad Calder
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Speculative precomputation enables effective cache prefetching for even irregular memory access behavior, by using an alternate thread on a multithreaded or multi-core architecture. This paper describes a system that constructs and runs precomputation based prefetching threads via event-driven dynamic optimization. Precomputation threads are dynamically constructed by a runtime compiler from the program's frequently executed hot traces, and are adapted to the memory behavior automatically. Both construction and execution of the prefetching threads happen in another thread, imposing little overhead on the main thread. This paper also presents several techniques to accelerate the precomputation threads, including colocation of p-threads with hot traces, dynamic stride prediction, and automatic adptation of runahead and jumpstart distance. The adaptive prefetching achieves 42% speedup, a 17% improvement over existing p-thread prefetching schemes.
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
Venue: Conference on Information and Knowledge Management (2007)

Increasingly, with the abundance of data, science requires robust, new cyberinfrastructure. Cyberinfrastructure has focussed on the immediate demands of experimental and analytical work using large scale data and processing infrastructure, but the problems of recording, preserving, accessing and reusing the resultant data scientific outputs have largely been overlooked in the immediate gratification that comes from the ability to start undertaking Big Science. In the recent years, escience may have received a lot of attention, but the problem of long term information curation and management that it leaves in its wake has not. CIMS'07 is a workshop that aims to facilitate discussions and exchange off ideas among computer scientists working on cyberinfrastructure issues for scientific applications. We have accepted a set of exciting papers to be presented and discussed at the workshop. During the workshop, we hope to be able to redefine this new field, identify problems associated with creating computational infrastructure and more importantly on the curation, management, and preservation of the data for scientific applications, learn about exciting directions of research and propose some solutions to some problems that our participants have dealt with before. The workshop will discuss papers dealing with data modeling, data preservation, data and metadata visualization, tool support for scientific applications, and data mining tools for various cyberinfrastructure component.
The Unix Progamming Environment
Authors: B. W. Kernighan
Venue: Computer (1981)

Since complex Unix tools are built from simple, single-function components, programmers see their work as the creation and use of tools. This view encourages growth, not reinvention.
A Universal Arithmetic Building Element (ABE) and Design Methods for Arithmetic Processors
Authors: A. AviZienis, Chin Tung
Venue: IEEE Transactions on Computers (1970)

The advent of large-scale integration of logic circuits requires the definition of digital computer structure in terms of large functional arrays of logic of very few types. This paper describes a single-package arithmetic processor called the arithmetic building element (ABE). The ABE accepts operands in either conventional or signed-digit radix-r representation and produces signed-digit results, which the ABE can reconvert to conventional form. Radix 16 is chosen for illustrations. Arrays of ABE's may be arranged to implement unit- time parallel addition, all-combinational multiplication, and more complex functions which are presently computed by subroutines. To facilitate such arithmetic design, a graph model is developed which permits a translation of the given arithmetical algorithm into an interconnection diagram of ABE's. The design procedure is illustrated by an array for polynomial evaluation. Speed, cost, and roundoff error of the array are considered. A computer program has been written for the automatic translation of the algorithm graph to an interconnection graph, and for the evaluation of the cost and speed for a given polynomial degree and a given precision requirement.