ppxscal/embedding_network huggingface dataset:
A Tale of Two Processors: Revisiting the RISC-CISC Debate
Authors: Ciji Isen, Lizy K. John, Eugene John
Venue: Proceedings of the 2009 SPEC Benchmark Workshop on Computer Performance Evaluation and Benchmarking (2009)

The contentious debates between RISC and CISC have died down, and a CISC ISA, the x86 continues to be popular. Nowadays, processors with CISC-ISAs translate the CISC instructions into RISC style micro-operations (eg: uops of Intel and ROPS of AMD). The use of the uops (or ROPS) allows the use of RISC-style execution cores, and use of various micro-architectural techniques that can be easily implemented in RISC cores. This can easily allow CISC processors to approach RISC performance. However, CISC ISAs do have the additional burden of translating instructions to micro-operations. In a 1991 study between VAX and MIPS, Bhandarkar and Clark showed that after canceling out the code size advantage of CISC and the CPI advantage of RISC, the MIPS processor had an average 2.7x advantage over the studied CISC processor (VAX). A 1997 study on Alpha 21064 and the Intel Pentium Pro still showed 5% to 200% advantage for RISC for various SPEC CPU95 programs. A decade later and after introduction of interesting techniques such as fusion of micro-operations in the x86, we set off to compare a recent RISC and a recent CISC processor, the IBM POWER5+ and the Intel Woodcrest. We find that the SPEC CPU2006 programs are divided between those showing an advantage on POWER5+ or Woodcrest, narrowing down the 2.7x advantage to nearly 1.0. Our study points to the fact that if aggressive micro-architectural techniques for ILP and high performance can be carefully applied, a CISC ISA can be implemented to yield similar performance as RISC processors. Another interesting observation is that approximately 40% of all work done on the Woodcrest is wasteful execution in the mispredicted path.
Introduction to Communication Electronic Warfare Systems, 2 edition
Authors: Richard A. Poisel
Venue: Artech House Intelligence And Information Operations (2008)

Focusing mainly on the engineering aspects of communications electronic warfare (EW) systems, this thoroughly updated and revised edition of a popular Artech House book offers a current and complete introduction to the subject. The second edition adds a wealth of new material, including expanded treatments of two critical areas - RF noise and the effects of signal fading. Extensively supported with over 700 equations, this authoritative resource details the components, systems, and operations of electronic warfare systems dedicated to protecting and attacking military communications networks. The book offers a complete understanding of how modern direction finders for communication signals work, along with their limitations. It shows how to measure performance and define the basic operations necessary for communication EW systems. Professionals learn how to identify state-of-the-art EW technology and gain a solid understanding of basic EW processes.
Current trends in the software products industry
Authors: Martin A. Goetz, L. A. Welke, Patrick McGovern, Burton Grad
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This session will examine the Software Products Industry, concentrating on the economics of the industry, the problems facing the software manufacturer, and the changing needs of the user. The panel presentations and discussion will be based on the following: (1) the industry is rapidly growing both internationally and domestically, with U.S. revenues expected to exceed $1 billion by 1976; (2) the industry's expansion is forcing the software manufacturer to face new problems in developing, maintaining, distributing, supporting, and marketing his product; and (3) the types and sophistication of software packages available to users are constantly growing and changing.
The distance geometry of music
Authors: Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, David R. Wood
Venue: Computational Geometry: Theory and Applications (2009)

We demonstrate relationships between the classic Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a family of rhythms which encompass over forty timelines (ostinatos) from traditional world music. We prove that these Euclidean rhythms have the mathematical property that their onset patterns are distributed as evenly as possible: they maximize the sum of the Euclidean distances between all pairs of onsets, viewing onsets as points on a circle. Indeed, Euclidean rhythms are the unique rhythms that maximize this notion of evenness. We also show that essentially all Euclidean rhythms are deep: each distinct distance between onsets occurs with a unique multiplicity, and these multiplicities form an interval 1,2,...,k-1. Finally, we characterize all deep rhythms, showing that they form a subclass of generated rhythms, which in turn proves a useful property called shelling. All of our results for musical rhythms apply equally well to musical scales. In addition, many of the problems we explore are interesting in their own right as distance geometry problems on the circle; some of the same problems were explored by Erdos in the plane.
Identifier length and limited programmer memory
Authors: Dave Binkley, Dawn Lawrie, Steve Maex, Christopher Morrell
Venue: Science of Computer Programming (2009)

Because early variable mnemonics were limited to as few as six to eight characters, many early programmers abbreviated concepts in their variable names. The past thirty years have seen a steady increase in permitted name length and, slowly, an increase in the actual identifier length. However, in theory names can be too long for programmers to comprehend and manipulate effectively. Most obviously, in object-oriented programs, entity naming often involves chaining of method calls and field selectors (e.g., class.firstAssignment().name.trim()). While longer names bring the potential for better comprehension through more embedded sub-words, there are practical limits to their length given limited human memory resources. The driving hypothesis behind the presented study is that names used in modern programs have reached this limit. Thus, a goal of the study is to better understand the balance between longer, more expressive names and limited programmer memory resources. Statistical models derived from an experiment involving 158 programmers of varying degrees of experience show that longer names extracted from production code take more time to process and reduce correctness in a simple recall activity. This has clear negative implications for any attempt to read, and hence comprehend or manipulate, the source code found in modern software. The experiment also evaluates the advantage of identifiers having probable ties to a programmer's persistent memory. Combined, these results reinforce past proposals advocating the use of limited, consistent, and regular vocabulary in identifier names. In particular, good naming limits individual name length and reduces the need for specialized vocabulary.
A Way to Reduce ICI of Multi-user MIMO-OFDM System with Precoding
Authors: Jingjing Wang, Xianzhong Xie, Qian Zhang
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper we research that using the precoding based on signal-to-leakage-and-noise ratio (SLNR) to reduce the inter-carrier interference (ICI) of multi-user multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system. Firstly, a model of MIMO-OFDM with precoding system is introduced. Based on the model we get the algorithm of the precoding matrix. Through simulation and analysis, the ICI of MIMO-OFDM system with precoding is reduced, otherwise, the complexity of the receiver does not increase, so the method adapts to the downlink especially.
Towards a Context-Based Dialog Management Layer for Expert Systems
Authors: Victor Hung, Avelino Gonzalez, Ronald DeMara
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

Speech-based conversation agents describe those computer-based entities that interact with humans to help accomplish a certain task via spoken word input. This paper proposes a method of managing spoken dialog interactions in response to recognizing the human user's goals when accessing an expert system. In particular, a set of goals can co-exist during a single conversation, and that each goal may be presented in an asynchronous manner. Such a stipulation exists to enhance the naturalness of the interaction. Inspired by the Context-Based Reasoning paradigm, the Lifelike dialog system described herein features a goal management system that ultimately controls the behavior of the expert system.
Implicit velocity correction-based immersed boundary-lattice Boltzmann method and its applications
Authors: J. Wu, C. Shu
Venue: Journal of Computational Physics (2009)

A version of immersed boundary-lattice Boltzmann method (IB-LBM) is proposed in this work. It is based on the lattice Boltzmann equation with external forcing term proposed by Guo et al. [Z. Guo, C. Zheng, B. Shi, Discrete lattice effects on the forcing term in the lattice Boltzmann method, Phys. Rev. E 65 (2002) 046308], which can well consider the effect of external force to the momentum and momentum flux as well as the discrete lattice effect. In this model, the velocity is contributed by two parts. One is from the density distribution function and can be termed as intermediate velocity, and the other is from the external force and can be considered as velocity correction. In the conventional IB-LBM, the force density (external force) is explicitly computed in advance. As a result, we cannot manipulate the velocity correction to enforce the non-slip boundary condition at the boundary point. In the present work, the velocity corrections (force density) at all boundary points are considered as unknowns which are computed in such a way that the non-slip boundary condition at the boundary points is enforced. The solution procedure of present IB-LBM is exactly the same as the conventional IB-LBM except that the non-slip boundary condition can be satisfied in the present model while it is only approximately satisfied in the conventional model. Numerical experiments for the flows around a circular cylinder and an airfoil show that there is no any penetration of streamlines to the solid body in the present results. This is not the case for the results obtained by the conventional IB-LBM. Another advantage of the present method is its simple calculation of force on the boundary. The force can be directly calculated from the relationship between the velocity correction and the force density.
Simulation down under
Authors: Matthew Pepper, Trevor Spedding
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper provides a brief literature review of the current applications of simulation in Australia. The paper identifies areas that use simulation modeling and dynamic tools for growth and improvement, while also highlighting opportunities for future applications of simulation. The simulation applications highlighted in this paper are focused on some of the most significant issues facing Australia today.
Reducing temperature variability by routing heat pipes
Authors: Kunal P. Ganeshpure, Ilia Polian, Sandip Kundu, Bernd Becker
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

A significant increase in power density in modern nano-electronic VLSI circuits has lead to increased localized heating and generation of hot spots. These temperature effects can lead to reliability and performance problems. This paper presents a novel design time temperature aware methodology which consists of using additional routing known as Heat Pipes, to transfer heat from hot to cold regions. In order to evaluate the effect of Heat Pipes, a thermal model to simulate effect of metal interconnect on heat distribution is also developed. Results show a 5% to 7% decrease in temperature variation through-out and 2 to 3 degree reduction in hotspot temperature as a result of Heat Pipes.
A link between polygon and grid representations of land resource information systems
Authors: Devon Nickerson
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Land-use planners, foresters, agricultural scientists, and others involved in land-based resource decision-making have been presented in recent years with a computer tool for examining land attributes: the resource data base. Innumerable developments have been made in this field. A few examples are: WRIS---the Wildland Resource Inventory System, developed and in use within the U.S. Forest Service California Region. COMARC---a commercial geographic data base system, developed by Comarc Design Systems of San Francisco, California. PLOT---the Polygon Layer Overlay Technique, developed by the U.S. Forest Service Pacific Northwest Region, and currently used by the U.S. Fish and Wildlife Service. MAP---the Map Analysis Package, developed at the Yale School of Forestry and Environmental Studies. TRI---the Total Resource Inventory system, developed and in use by the U.S. Forest Service Pacific Northwest Region.
Computation of 2-groups of narrow logarithmic divisor classes of number fields
Authors: Jean-François Jaulent, Sebastian Pauli, Michael E. Pohst, Florence Soriano-Gafiuk
Venue: Journal of Symbolic Computation (2009)

We present an algorithm for computing the 2-group C@?@?"F^r^e^s of narrow logarithmic divisor classes of degree 0 for number fields F. As an application, we compute in some cases the 2-rank of the wild kernel WK"2(F) and the 2-rank of its subgroup K"2^~(F):=@?"n">="1K"2^n(F) of infinite height elements in K"2(F).
Speech through the Ear, the Eye, the Mouth and the Hand
Authors: Marion Dohen
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This chapter aims at describing how speech is multimodal not only in its perception but also in its production. It first focuses on multimodal perception of speech segments and speech prosody. It describes how multimodal perception is linked to speech production and explains why we consider speech perception as a sensory-motor process. It then analyses some aspects of hand-mouth coordination in spoken communication. Input from evolutionary perspectives, ontogenesis and behavioral studies on infants and adults are combined to detail how and why this coordination is crucial in speech.
Towards applications of particle filters in wildfire spread simulation
Authors: Feng Gu, Xiaolin Hu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Wildfire propagation is a complex process influenced by many factors. Simulation models of wildfire spread, such as DEVS-FIRE, are important tools for studying fire behavior. This paper presents how the sequential Monte Carlo methods, i.e., particle filters, can work together with DEVS-FIRE for better simulation and prediction of wildfire. We define an application framework of particle filters for the problem of wildfire spread using the DEVS-FIRE model, and discuss several applications. A case study example is provided and preliminary results are presented.
HorseIO - virtual riding lessons with a low-cost tangible horse interface
Authors: Gundula Dörries, Christian Geiger, Anke Lehmann, Andrea Wegstein
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

We describe the implementation of a playful multi-user virtual riding lesson for beginners. Our work focused on the integration of a wooden horse, equipped with real snaffle and saddle, which is used as input interface to navigate in a 3D environment. With the help of the wooden horse, the user is able to interact with a virtual 3D horse via reins and legs, similar to a real riding scenario.
Power supply noise aware workload assignment for multi-core systems
Authors: Aida Todri, Malgorzata Marek-Sadowska, Joseph Kozhaya
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As the industry moves from single- to multi-core processors, the challenges of how to reliably design and analyze power delivery for such systems also arise. We study various workload assignments to cores and their impact on the global power grid noise. We develop metrics to estimate the amount of noise propagated from core to core and propose a power supply noise aware workload assignment method. In our experiments, we show that performance loss can be significant if workload assignment is not properly made.
Reference Point-Based Particle Swarm Optimization Using a Steady-State Approach
Authors: Richard Allmendinger, Xiaodong Li, Jürgen Branke
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Conventional multi-objective Particle Swarm Optimization (PSO) algorithms aim to find a representative set of Pareto-optimal solutions from which the user may choose preferred solutions. For this purpose, most multi-objective PSO algorithms employ computationally expensive comparison procedures such as non-dominated sorting. We propose a PSO algorithm, Reference point-based PSO using a Steady-State approach (RPSO-SS), that finds a preferred set of solutions near user-provided reference points, instead of the entire set of Pareto-optimal solutions. RPSO-SS uses simple replacement strategies within a steady-state environment. The efficacy of RPSO-SS in finding desired regions of solutions is illustrated using some well-known two and three-objective test problems.
An approach to the development of commonsense knowledge modeling systems for disaster management
Authors: D. S. Mendis, Asoka S. Karunananda, Udaya Samaratunga, Uditha Ratnayake
Venue: Artificial Intelligence Review (2007)

Knowledge is the fundamental resource that allows us to function intelligently. Similarly, organizations typically use different types of knowledge to enhance their performance. Commonsense knowledge that is not well formalized modeling is the key to disaster management in the process of information gathering into a formalized way. Modeling commonsense knowledge is crucial for classifying and presenting of unstructured knowledge. This paper suggests an approach to achieving this objective, by proposing a three-phase knowledge modeling approach. At the initial stage commonsense knowledge is converted into a questionnaire. Removing dependencies among the questions are modeled using principal component analysis. Classification of the knowledge is processed through fuzzy logic module, which is constructed on the basis of principal components. Further explanations for classified knowledge are derived by expert system technology. We have implemented the system using FLEX expert system shell, SPSS, XML, and VB. This paper describes one such approach using classification of human constituents in Ayurvedic medicine. Evaluation of the system has shown 77% accuracy.
Automatic construction of simple artifact-based business processes
Authors: Christian Fritz, Richard Hull, Jianwen Su
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Almost all medium- and large-scale businesses rely on electronic workflow systems to manage their business processes. A key challenge is to enable the easy re-use and modification of these workflow schemas and their piece-parts, so that they can be adapted to new business situations. This paper describes an approach for automatic construction (and thus, evolution) of a workflow schema that satisfies a specified condition (or "goal"), starting from a set of basic building block services (or "tasks"). We use a workflow model based on "business artifacts", which represent key (real or conceptual) business entities, and include both the business-relevant data about them and a specification of their lifecycle, that is, how they can evolve over time as they move through the workflow as the result of services being applied to them. This paper uses a declarative form of artifact-centric workflow. The services are non-deterministic, which corresponds to the intuition that humans performing the services may rely on information that is not modeled within the framework. We study the problem of, given a goal to be achieved, automatically finding the "maximal" workflow schema that has the following property: every execution is either complete or can be completed, and every complete execution satisfies the goal. We also study a complimentary problem, in which exception-handling is used to deal with executions that would otherwise not complete successfully. These problems are non-trivial because the workflow services are non-deterministic. This paper provides a general framework for studying these problems, and shows a tight relationship between workflow systems specified using logics that permit quantifier elimination and the ability to construct maximal schemas with the desired properties. The paper then studies a restricted setting to provide insights into complexity issues. Even in the restricted setting, the problem of testing properties of maximal workflows is PSPACE-complete.
An Evolutionary Approach to the Non-unique Oligonucleotide Probe Selection Problem
Authors: Lili Wang, Alioune Ngom, Robin Gras, Luis Rueda
Venue: Transactions on Computational Systems Biology X (2008)

In order to accurately measure the gene expression levels in microarray experiments, it is crucial to design unique, highly specific and sensitive oligonucleotide probes for the identification of biological agents such as genes in a sample. Unique probes are difficult to obtain for closely related genes such as the known strains of HIV genes. The non-unique probe selection problem is to select a probe set that is able to uniquely identify targets in a biological sample, while containing a minimal number of probes. This is an NP-hard problem. We define a probe selection function that allows to decide which are the best probes to include in or exclude from a candidate probe set. We then propose a new deterministic greedy heuristic that uses the selection for solving the non-unique probe selection problem. Finally, we combine the selection function with an evolutionary method for finding near minimal non-unique probe sets. When used on benchmark data sets, our greedy method outperforms current greedy heuristics for non-unique probe selection in most instances. Our genetic algorithm also produced excellent results when compared to advanced methods introduced in the literature for the non-unique probe selection problem.
Reliability aware NoC router architecture using input channel buffer sharing
Authors: M. H. Neishaburi Zeljko Zilic
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

To address the increasing demand for reliability in on-chip networks, we proposed a novel Reliability Aware Virtual channel (RAVC) NoC router micro-architecture that enables both dynamic virtual channel allocations and the rational sharing among the buffers of different input channels. In particular, in the case of failure in routers, the virtual channels of routers surrounding the faulty routers can be totally recaptured and reassigned to other input ports. Moreover, our proposed RAVC router isolates the faulty router from occupying network bandwidth. Experimental result shows that proposed micro-architecture provides 7.1% and 3.1 % average latency decrease under uniform and transpose traffic pattern. Considering the existence of failures in routers of on-chip network, RAVC provides 28% and 16% decrease in the average packet latency under the uniform and transpose traffic pattern respectively.