ppxscal/embedding_network huggingface dataset:
Exploiting selective instruction reuse and value prediction in a superscalar architecture
Authors: Arpad Gellert, Adrian Florea, Lucian Vintan
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2009)

In our previously published research we discovered some very difficult to predict branches, called unbiased branches. Since the overall performance of modern processors is seriously affected by misprediction recovery, especially these difficult branches represent a source of important performance penalties. Our statistics show that about 28% of branches are dependent on critical Load instructions. Moreover, 5.61% of branches are unbiased and depend on critical Loads, too. In the same way, about 21% of branches depend on MUL/DIV instructions whereas 3.76% are unbiased and depend on MUL/DIV instructions. These dependences involve high-penalty mispredictions becoming serious performance obstacles and causing significant performance degradation in executing instructions from wrong paths. Therefore, the negative impact of (unbiased) branches over global performance should be seriously attenuated by anticipating the results of long-latency instructions, including critical Loads. On the other hand, hiding instructions' long latencies in a pipelined superscalar processor represents an important challenge itself. We developed a superscalar architecture that selectively anticipates the values produced by high-latency instructions. In this work we are focusing on multiply, division and loads with miss in L1 data cache, implementing a dynamic instruction reuse scheme for the MUL/DIV instructions and a simple last value predictor for the critical Load instructions. Our improved superscalar architecture achieves an average IPC speedup of 3.5% on the integer SPEC 2000 benchmarks, of 23.6% on the floating-point benchmarks, and an improvement in energy-delay product (EDP) of 6.2% and 34.5%, respectively. We also quantified the impact of our developed selective instruction reuse and value prediction techniques in a simultaneous multithreaded architecture (SMT) that implies per thread reuse buffers and load value prediction tables. Our simulation results showed that the best improvements on the SPEC integer applications have been obtained with 2 threads: an IPC speedup of 5.95% and an EDP gain of 10.44%. Although, on the SPEC floating-point programs, we obtained the highest improvements with the enhanced superscalar architecture, the SMT with 3 threads also provides an important IPC speedup of 16.51% and an EDP gain of 25.94%.
Performance simulations of moving target search algorithms
Authors: Peter K. K. Loh, Edmond C. Prakash
Venue: International Journal of Computer Games Technology (2009)

The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance and behaviour of existing moving target search algorithms when applied to search-and-capture gaming scenarios. As part of the investigation, we also introduce a novel algorithm known as abstraction MTS. We conduct performance simulations with a game bot and moving target within randomly generated mazes of increasing sizes and reveal that abstraction MTS exhibits competitive performance even with large problem spaces.
Better than a petaflop: the power of efficient experimental design
Authors: Susan M. Sanchez
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Recent advances in high-performance computing have pushed computational capabilities to a petaflop (a thousand trillion operations per second) in a single computing cluster. This breakthrough has been hailed as a way to fundamentally change science and engineering by letting people perform experiments that were previously beyond reach. But for those interested in exploring the I/O behavior of their simulation model, efficient experimental design has a much higher payoff at a much lower cost. A well-designed experiment allows the analyst to examine many more factors than would otherwise be possible, while providing insights that cannot be gleaned from trial-and-error approaches or by sampling factors one at a time. We present the basic concepts of experimental design, the types of goals it can address, and why it is such an important and useful tool for simulation. Ideally, this tutorial will entice you to use experimental designs in your upcoming simulation studies.
On modeling software defect repair time
Authors: Rattikorn Hewett, Phongphun Kijsanayothin
Venue: Empirical Software Engineering (2009)

The ability to predict the time required to repair software defects is important for both software quality management and maintenance. Estimated repair times can be used to improve the reliability and time-to-market of software under development. This paper presents an empirical approach to predicting defect repair times by constructing models that use well-established machine learning algorithms and defect data from past software defect reports. We describe, as a case study, the analysis of defect reports collected during the development of a large medical software system. Our predictive models give accuracies as high as 93.44%, despite the limitations of the available data. We present the proposed methodology along with detailed experimental results, which include comparisons with other analytical modeling approaches.
Making intelligent sounds
Authors: Jaeho Chang
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

An intelligent sound is a sound that can think. It can create, modify, evolve, and even kill itself according to environment.
The Neutrality of Money Revisited with a Bottom-Up Approach: Decentralisation, Limited Information and Bounded Rationality
Authors: Gabriel Galand
Venue: Computational Economics (2009)

In the mainstream top-down approach, money is neutral except with special assumptions. Intending to make money "essential", random-matching models introduced decentralisation by considering pair-wise transactions. Nevertheless, in both cases top-level equilibrium constrains agents' behaviour. Instead, here we use a bottom-up approach. In a competitive market, decentralised autonomous agents meet and exchange a commodity for money. Their decisions use minimal information. They are triggered by simple rules founded on a "satisficing" procedure and on a random decision process that simulates bounded rationality. The conclusions are, first, that non-monetary costs are essential to avoid collapse of the economy. Second, mainly "price setters" who are adequately satisfied achieve equilibrium protecting themselves by evolving advantages to avoid competition that is too tough. Third, and the most important conclusion is that money ceases to be neutral as soon as competition arises between individual firms.
Configurable VLSI architecture for deblocking filter in H.264/AVC
Authors: Chung-Ming Chen, Chung-Ho Chen
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

In this paper, we study and analyze the computational complexity of the deblocking filter in H.264/AVC baseline decoder based on SimpleScalar/ARM simulator. The simulation result shows that the memory reference, content activity check operations, and filter operations are known to be very time consuming in the decoder of this new video coding standard. In order to improve overall system performance, we propose a configurable, extensible, and synthesizable window-based processing architecture which simultaneously processes the horizontal filtering of vertical edge and vertical filtering of horizontal edge. As a result, the memory performance of the proposed architecture is improved by four times when compared to previous designs. Moreover, the system performance of our window-based architecture significantly out-performs the previous designs from 7 times to 20 times.
2009 Special Issue: Robotic sound-source localisation architecture using cross-correlation and recurrent neural networks
Authors: John C. Murray, Harry R. Erwin, Stefan Wermter
Venue: Neural Networks (2009)

In this paper we present a sound-source model for localising and tracking an acoustic source of interest along the azimuth plane in acoustically cluttered environments, for a mobile service robot. The model we present is a hybrid architecture using cross-correlation and recurrent neural networks to develop a robotic model accurate and robust enough to perform within an acoustically cluttered environment. This model has been developed with considerations of both processing power and physical robot size, allowing for this model to be deployed on to a wide variety of robotic systems where power consumption and size is a limitation. The development of the system we present has its inspiration taken from the central auditory system (CAS) of the mammalian brain. In this paper we describe experimental results of the proposed model including the experimental methodology for testing sound-source localisation systems. The results of the system are shown in both restricted test environments and in real-world conditions. This paper shows how a hybrid architecture using band pass filtering, cross-correlation and recurrent neural networks can be used to develop a robust, accurate and fast sound-source localisation model for a mobile robot.
Gompertz software reliability model: Estimation algorithm and empirical validation
Authors: Koji Ohishi, Hiroyuki Okamura, Tadashi Dohi
Venue: Journal of Systems and Software (2009)

Gompertz curve has been used to estimate the number of residual faults in testing phases of software development, especially by Japanese software development companies. Since the Gompertz curve is a deterministic function, the curve cannot be applied to estimating software reliability which is the probability that software system does not fail in a prefixed time period. In this article, we propose a stochastic model called the Gompertz software reliability model based on non-homogeneous Poisson processes. The proposed model can be derived from the statistical theory of extreme-value, and has a similar asymptotic property to the deterministic Gompertz curve. Also, we develop an EM algorithm to determine the model parameters effectively. In numerical examples with software failure data observed in real software development projects, we evaluate performance of the Gompertz software reliability model in terms of reliability assessment and failure prediction.
Minds and Computers: An Introduction to the Philosophy of Artificial Intelligence
Authors: Matt Carter
Venue:  (2007)

Could a computer have a mind? What kind of machine would this be? Exactly what do we mean by "mind" anyway?The notion of the "intelligent'"machine, while continuing to feature in numerous entertaining and frightening fictions, has also been the focus of a serious and dedicated research tradition. Reflecting on these fictions, and on the research tradition that pursues "Artificial Intelligence", raises a number of vexing philosophical issues. Minds and Computers offers an engaging, coherent, and highly approachable interdisciplinary introduction to the Philosophy of Artificial Intelligence. Readers are presented with introductory material from each of the disciplines which constitute Cognitive Science: Philosophy, Neuroscience, Psychology, Computer Science, and Linguistics. Throughout, readers are encouraged to consider the implications of this disparate and wide-ranging material for the possibility of developing machines with minds. And they can expect to develop a foundation for philosophically responsible engagement with A.I., a sound understanding of Philosophy of Mind and of computational theory, and a good feel for cross-disciplinary analysis. Features: *A solid foundation in the Philosophy of Mind*A broadly interdisciplinary purview*A directed philosophical focus*A clear and accessible explanation of technical material with abundant exercises*A glossary of terms
Quality-augmented fusion of level-2 and level-3 fingerprint information using DSm theory
Authors: Mayank Vatsa, Richa Singh, Afzel Noore, Max M. Houck
Venue: International Journal of Approximate Reasoning (2009)

Existing algorithms that fuse level-2 and level-3 fingerprint match scores perform well when the number of features are adequate and the quality of images are acceptable. In practice, fingerprints collected under unconstrained environment neither guarantee the requisite image quality nor the minimum number of features required. This paper presents a novel fusion algorithm that combines fingerprint match scores to provide high accuracy under non-ideal conditions. The match scores obtained from level-2 and level-3 classifiers are first augmented with a quality score that is quantitatively determined by applying redundant discrete wavelet transform to a fingerprint image. We next apply the generalized belief functions of Dezert-Smarandache theory to effectively fuse the quality-augmented match scores obtained from level-2 and level-3 classifiers. Unlike statistical and learning based fusion techniques, the proposed plausible and paradoxical reasoning approach effectively mitigates conflicting decisions obtained from classifiers especially when the evidences are imprecise due to poor image quality or limited fingerprint features. The proposed quality-augmented fusion algorithm is validated using a comprehensive database which comprises of rolled and partial fingerprint images of varying quality with arbitrary number of features. The performance is compared with existing fusion approaches for different challenging realistic scenarios.
Smooth Particle Applied Mechanics: The State of the Art
Authors: William G. Hoover
Venue:  (2006)

This book takes readers through all the steps necessary for solving hard problems in continuum mechanics with smooth particle methods. Pedagogical problems clarify the generation of initial conditions, the treatment of boundary conditions, the integration of the equations of motion, and the analysis of the results. Particular attention is paid to the parallel computing necessary for large problems and to the graphic displays, including debugging software, required for the efficient completion of computational projects. The book is self-contained, with summaries of classical particle mechanics and continuum mechanics for both fluids and solids, computer languages, the stability of numerical methods, Lyapunov spectra, and message-passing parallel computing. The main difficulties faced by meshless particle methods are discussed and the means of overcoming them are illustrated with worked examples.
Beginning ASP.NET E-Commerce in C#: From Novice to Professional, 1 edition
Authors: Cristian Darie, Karli Watson
Venue:  (2009)

With the latest incarnations of ASP.NET 3.5 and SQL Server 2008, programming dynamic datadriven web sites with Microsoft technologies has become easier and much more efficient than ever before. Fewer mouse clicks and fewer lines of code can now enable more powerful features and the tools you needVisual Web Developer and SQL Server 2008 Express Editionare free. In Beginning ASP.NET E-Commerce in C#: From Novice to Professional, youll learn how to best use the free development tools offered by Microsoft to build an online product catalog. You will gain an intimate understanding of every piece of code you write. This understanding will enable you to build your own powerful and flexible web sites efficiently and rapidly with ASP.NET 3.5. Build a complete site, including a shopping cart, checkout, product searching, product recommendations, control panel, customer accounts, order processing, and much, much more. Explore new challenges and theoretical concepts, which are carefully analyzed and explained throughout the book, with each feature you add to the web site. Learn to handle payments by integrating PayPal and DataCash into your site. What youll learn Use Microsofts Express products to build an online product catalog. Add payment processing with PayPal and DataCash. Expand your sites product listing through web services. Implement an order pipeline. Take advantage of SEO techniques to publicize your site. Who is this book for Developers wanting to build professional ecommerce sites using the latest .NET technologies. About the Apress Beginning Series The Beginning series from Apress is the right choice to get the information you need to land that crucial entrylevel job. These books will teach you a standard and important technology from the ground up because they are explicitly designed to take you from novice to professional. Youll start your journey by seeing what you need to knowbut without needless theory and filler. Youll build your skill set by learning how to put together realworld projects step by step. So whether your goal is your next career challenge or a new learning opportunity, the Beginning series from Apress will take you thereit is your trusted guide through unfamiliar territory!
Improved Upper Bounds for Partial Vertex Cover
Authors: Joachim Kneis, Alexander Langer, Peter Rossmanith
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

The Partial Vertex Cover problem is to decide whether a graph contains at most k nodes covering at least t edges. We present deterministic and randomized algorithms with run times of O *(1.396 t ) and O *(1.2993 t ), respectively. For graphs of maximum degree three, we show how to solve this problem in O *(1.26 t ) steps. Finally, we give an O *(3 t ) algorithm for Exact Partial Vertex Cover, which asks for at most k nodes covering exactly t edges.
Micromechanical oscillator circuits: theory and analysis
Authors: T. S. Wong, M. Palaniapan
Venue: Analog Integrated Circuits and Signal Processing (2009)

In this paper, detailed theoretical analysis of micromechanical Transresistance oscillator is presented. Analytical expressions are derived for the frequency pulling, critical transimpedance, maximum negative resistance, and start-up time constant of the Transresistance oscillator circuit which are useful for the design of micromechanical oscillators. These results are then used to study the frequency stability of Transresistance oscillator circuit and compare its operating conditions with that of the Pierce oscillator circuit which is widely used in micromechanical oscillators. The results conclusively show that the Transresistance oscillator has less start-up problems and better frequency stability than the Pierce oscillator. These results are then verified with a well-established circuit theory that compares the phase-frequency plots of the Pierce and Transresistance oscillator.
Fault-tolerant execution of large parameter sweep applications across multiple VOs with storage constraints
Authors: Shahaan Ayyub, David Abramson, Colin Enticott, Slavisa Garic, Jefferson Tan
Venue: Concurrency and Computation: Practice Experience (2009)

Applications that span multiple virtual organizations (VOs) are of great interest to the e-science community. However, our recent attempts to execute large-scale parameter sweep applications (PSAs) for real-world climate studies with the Nimrod-G tool have exposed problems in the areas of fault tolerance, data storage and trust management. In response, we have implemented a task-splitting approach that facilitates breaking up large PSAs into a sequence of dependent subtasks, improving fault tolerance; provides a garbage collection technique that deletes unnecessary data; and employs a trust delegation technique that facilitates flexible third party data transfers across different VOs. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A heuristic particle swarm optimization method for truss structures with discrete variables
Authors: L. J. Li, Z. B. Huang, F. Liu
Venue: Computers and Structures (2009)

A heuristic particle swarm optimizer (HPSO) algorithm for truss structures with discrete variables is presented based on the standard particle swarm optimizer (PSO) and the harmony search (HS) scheme. The HPSO is tested on several truss structures with discrete variables and is compared with the PSO and the particle swarm optimizer with passive congregation (PSOPC), respectively. The results show that the HPSO is able to accelerate the convergence rate effectively and has the fastest convergence rate among these three algorithms. The research shows the proposed HPSO can be effectively used to solve optimization problems for steel structures with discrete variables.
Properties of amorphous carbon layers for bio-tribological applications
Authors: M. Vojs, E. Zdravecká, M. Marton, P. Boháč, L. Franta, M. Veselý
Venue: Microelectronics Journal (2009)

This paper analyses the influence of composition, structure and adhesion of amorphous coatings with high wear resistance, low friction coefficient and good adhesion to coated CrCoMo material for parts of implants. By different deposition techniques, different mechanical and tribological properties were obtained. This work reviews amorphous carbon (a-C) films deposited by magnetron sputtering and diamond-like carbon (DLC) films grown by glow arc discharge technology on CrCoMo substrates. Films were investigated under static load under dry conditions (nanohardness, elastic module), and also with dynamic load (coefficient of friction, wear resistance). The following topics were investigated: surfaces and subsurface properties of a-C films, namely adhesion in connection with different techniques, different film properties in dependence on various technology conditions.
Using probabilistic reasoning over time to self-recognize
Authors: Kevin Gold, Brian Scassellati
Venue: Robotics and Autonomous Systems (2009)

Using the probabilistic methods outlined in this paper, a robot can learn to recognize its own motor-controlled body parts, or their mirror reflections, without prior knowledge of their appearance. For each item in its visual field, the robot calculates the likelihoods of each of three dynamic Bayesian models, corresponding to the categories of ''self'', ''animate other'', or ''inanimate''. Each model fully incorporates the object's entire motion history and the robot's whole motor history in constant update time, via the forward algorithm. The parameters for each model are learned in an unsupervised fashion as the robot experiments with its arm over a period of four minutes. The robot demonstrated robust recognition of its mirror image, while classifying the nearby experimenter as ''animate other'', across 20 experiments. Adversarial experiments, in which a subject mirrored the robot's motion showed that as long as the robot had seen the subject move for as little as 5 s before mirroring, the evidence was ''remembered'' across a full minute of mimicry.
A Contour Analysis Based Technique to Extract Objects for MPEG-4
Authors: E. A. Edirisinghe, J. Jiang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

MPEG-4 is an emerging global standard for digital multimedia services. The core development of this video standard is a content-based video data structure, which constitutes of arbitrarily shaped video objects. The data compression is designed in terms of these video objects rather than frames. Thus, it is a key requirement in the development stages of MPEG-4 to explore possible means of object extraction from video frames. In this paper we propose a contour-based technique to extract video objects for MPEG-4. The object contours are extracted by convolving a given frame with a Laplacian-of-Gaussian operator, followed by an edge detection process. The contours are later blocked and classified into three categories with the aid of a pixel-based parity check, filling algorithm. We show that this block classification strategy if used in a specific order, reduces the complexity of the contour filling process. Experimental results for several object extractions on 'Lena' and 'Peppers' images are included.