ppxscal/embedding_network huggingface dataset:
Approximate prefix coding for system-on-a-chip programs
Authors: Shlomo Weiss, Roman Tsikel
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

The redundancy available in binary programs presents an opportunity for better utilization of limited memory resources in systems-on-a-chip by compressing the instruction memory. Class-based coding, a form of approximate prefix coding, simplifies the code and thus is a suitable compression method for low-cost systems. We present a detailed frequency analysis of the SPEC2000 Alpha binary programs. Based on the results of this analysis, we introduce a new method for constructing classes. Then we apply this method and use it to compress the SPEC2000 Alpha binaries, and show that, in comparison with optimal prefix coding, the loss in compression efficiency is minimal. With some hardware support, the proposed method reduces the on-chip code by 43%.
Actions as Prolog Programs
Authors: Marcus V. Tolentino, Paulo E. Santos, Flavio S. C. da Silva, Marcio Rillo
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

As an extention of the TRASYS approach to reasoning about actions, this work presents a new step in the direction to the transposition of the gap between action formalisms and their real execution inside planning environments. We try to clarify some points of the former paper by presenting a re-structured overview of the Transaction Logic formalism and proposing some modifications to the action model which will allow the use of non-atomic formulae in the world model. Aiming an efficient method for executing action specifications, we present how could these specifications be rendered into a PROLOG program.
Software reuse strategies and component markets
Authors: T. Ravichandran, Marcus A. Rothenberger
Venue: Communications of the ACM (2003)

Black-box reuse with component markets could be the silver bullet solution that makes software reuse a reality, and advances software development to a robust industrial process---but only if market makers address the growing pains plaguing this immature industry.
Maximal arcs in Steiner systems S(2, 4,v)
Authors: Malcolm Greig, Alexander Rosa
Venue: Discrete Mathematics (2003)

A maximal arc in a Steiner system S(2,4, υ) is a set of elements which intersects every block in either two or zero elements. It is well known that υ ≡ 4 (mod 12) is a necessary condition for an S(2,4,υ) to possess a maximal arc. We describe methods of constructing an S(2,4,υ) with a maximal arc, and settle the longstanding sufficiency question in a strong way. We show that for any υ ≡ 4(mod 12), we can construct a resolvable S(2,4,υ) containing a triple of maximal arcs, all mutually intersecting in a common point. An application to the motivating colouring problem is presented.
Implementing Empirical Modeling Techiniques with Recurrent Neural Networks
Authors: T. Catfolis, K. Meert
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

In this paper a new modeling technique, using recurrent networks, based on the NARMAX framework, is developed. Some properties of the technique are demonstrated by means of a mathematical example.
Intelligent Switching System Methodology and Its Application in Complex Process Control System
Authors: Junwei Gao, Yangdong Ye, Tianyun Shi, Qiuhua Jiang, Limin Jia
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The switching system can be viewed as a kind of hybrid systems because it with both continuous state variables and discrete state variables. Viewing the controller as hierarchical, then the switch strategy belongs to the higher hierarchy. It represents the intelligent factors and plays a key role in system performance. In this paper, the intelligent switching system methodology is researched, and the DESSC (Discrete event system supervisor and controller) is constructed in intelligent method. Coke oven is used as the control object, based on the analysis of the coke oven heating process and its states partition, the control strategy of intelligent switching systems is used which can effectively resolve process control problems of the complex system with large time-delay, realize coke oven automatic heating control, and the good performance of control can be obtained.
Effort Distribution in a Six Year Industrial Application Framework Project
Authors: Michael Mattsson
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

It has for a long time been claimed that object-oriented framework technology delivers reduced application development efforts but no quantitative evidence has been shown. In this study we present quantitative data from a six year object-oriented application framework project in the telecommunication domain. During six years four major versions of the application framework have been developed and over 30 installations at customer sites has been done. We present effort data both for the framework development and the installations as well as relative effort per phase for the framework versions. The effort data presented gives quantitative support for the claim that framework technology delivers reduced application development efforts. In fact, the effort data shows that the average application development effort is less than 2% of the framework development effort.
A Comparison and Integration of Capture-Recapture Models and the Detection Profile Method
Authors: Lionel C. Briand, Khaled El Emam, Bernd G. Freimut
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

In order to control inspections, the number of remaining defects in software artifacts after their inspection should be estimated. This would allow, for example, deciding whether a reinspection of supposedly faulty artifacts is necessary. Several studies in software engineering have considered capture-recapture models for performing such estimations. These models were initially developed for estimating animal abundance in wildlife research. In addition to these models, researchers in software engineering have recently proposed an alternative approach, namely the Detection Profile Method (DPM), that makes less restrictive assumptions than some capture-recapture models and that show promise in terms of estimation accuracy. In this study, we investigate how to select between these two approaches for defect content estimation. As a result of this investigation we present a selection procedure taking into account the strength and weaknesses of the two methods. A weakness known for capture-recapture models is that they tend to provide extreme under/over estimation. The existence of such extreme outliers can discourage their use because their consequences in terms of wasted effort or defect slippage can be substantial, and therefore it is not clear whether a particular estimate can be trusted. The evaluation of our selection procedure with actual inspection data indicates that this selection procedure provides the same accuracy as capture-recapture models alone and DPM alone, and most importantly does not exhibit extreme over/under estimation. Thus, this selection procedure can be used in practice with a high degree of confidence since its estimates are not likely to exhibit extreme estimation error.
Combinatorial auctions, an example of algorithm theory in real life
Authors: Arne Andersson
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

In this article, we discuss combinatorial auctions, an interesting interdisciplinary research field in Computer Science and Economics. In particular, we will (a) describe a set of real-world cases, (b) how to solve the associated computational problems, and (c) discuss the impact of the probability distributions chosen for benchmarking.
Fault Detection Capabilities of Coupling-based OO Testing
Authors: Rodger T. Alexander, Jeff Offutt, James M. Bieman
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Object-oriented programs cause a shift in focus fromsoftware units to the way software classes andcomponents are connected. Thus, we are finding that weneed less emphasis on unit testing and more onintegration testing. The compositional relationships ofinheritance and aggregation, especially when combinedwith polymorphism, introduce new kinds of integrationfaults, which can be covered using testing criteria thattake the effects of inheritance and polymorphism intoaccount. This paper demonstrates, via a set ofexperiments, the relative effectiveness of severalcoupling-based OO testing criteria and branchcoverage. OO criteria are all more effective at detectingfaults due to the use of inheritance and polymorphismthan branch coverage.
Language Report and Description for BVL-O
Authors: Tomboulian,  S, Mace,  M, A R Wagner
Venue:  (1986)

Much work has been done recently in the area of array processors and supercomputer hardware and algorithms, but little effort has been spent in designing languages suited to the philosophical concept of these machines. Some languages do exist, such as parallel Fortran developed for the ILLIAC IV [1], but these are essentially standard serial languages that have been modified to work on a few dozen or a few hundred processors. When dealing with a machine, such as the Boolean Vector Machine (BVM) [2], which has thousands of processors (PEs), it is necessary to develop a different language concept. This paper presents a description of a simple language (BVL0) which embodies some of these concepts. The implementation is discussed, and some suggestions are made as to possible higher level language improvements.
Visualizing Software Release Histories: The Use of Color and Third Dimension
Authors: Harald Gall, Mehdi Jazayeri, Claudio Riva
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

The data regarding the components of a software system consists of a large amount of information such as version history, number of lines, defect density, and complexity measures. The ability to quickly grasp a comprehensive view of the evolution and dependencies of such information is the key to making informed decisions about future developments of the system. Managers usually make such decision based only on expert judgement. For help in making such decisions, we can turn to the evolution history of large software systems, which contain a wealth of hidden information. Traditionally, this information is passed on through anecdotes without any supporting analytical data. This paper reports on our attempts to make such information more concrete through information visualization techniques. We present a three-dimensional visual representation for examining a system's software release history. The structure of the system is displayed by 2-D or 3-D graphs. The historical information is displayed by using time as the third dimension. Colors are used for displaying module properties and their historical changes in the system. A supporting software tool enables not only visualization but also navigation in the 3-D space to change the viewpoint, to browse system information, to find interesting patterns and to discover previously unknown relationships among system components.
Solution of GSPN Models Revisited
Authors: Gianfranco Ciardo, S K Trivedi
Venue:  (1988)

The classical method for the steady-state solution of generalized stochastic Petri net (GSPN) models, based on the correspondence between GSPNs and continuous-time Markov chains (CTMCs), is compared with a method based on discrete-time Markov chains (DTMCs) previously judged poor. We show instead that the performance of the DTMC-based method is close to the one of classical method, suggesting that it is worth considering. We also formalize the relationship between output measures for the GSPN and rewards associated to the underlying stochastic process and we show how the DTMC-based method allows the definition and easy computation of these measures, even when they involve vanishing markings and immediate transitions. In addition we discuss how the DTMC-based method can be extended to consider a larger class of firing time distributions, using the theory of semi-Markov processes (SMPs), and how it simplifies symbolic sensitivity analysis.
Lexicographically Optimal Rage Control for Video Coding with MPEG Buffer%250AConstraints
Authors: Dzung Hoang,  T, Elliot Linzer, Jeffrey Vitter,  S
Venue:  (1996)

In this paper, we address the problem of allocating bits among pictures in an MPEG video coder to equalize the visual quality of the coded pictures, while meeting buffer and channel constraints imposed by a Video Buffer Verifier. We address this problem within a framework consisting of 1) a bit production model for the input pictures, 2) a novel lexicographic criterion for optimality, and 3) a set of bit-rate constraints imposed by the transmission channel and Video Buffer Verifier. Using this framework, we analyze the bit allocation problem for both constant and variable bit rate operation. The analysis results in a set of simple necessary and sufficient conditions for optimality that leads to efficient algorithms.
Project Aurora: Dawn of a New Way
Authors: Ellen A. White, H. Theodore Stump, Linda A. Ness, Derek W. Schultz
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Project Aurora is an effort underway at Bellcore to reengineer its software development process to reduce lifecycle time and cost while increasing customer satisfaction. Our project began with a focus on the requirements engineering process, but this scope quickly expanded to include many aspects of software development. We are implementing recommendations in four general categories: Customer Interaction Prototyping Software Reuse Information Management This paper describes the problem assessment and analysis that led to these recommendations, along with the lessons we have learned to date about how to effect change in software development organizations.
Parallel Real-Time Numerical Computation: Beyond Speedup III
Authors: Selim G. Akl, Stefan D. Bruda
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Parallel computers can do more than simply speed up sequential computations. They are capable of finding solutions that are far better in quality than those obtained by sequential computers. This fact is demonstrated by analyzing sequential and parallel solutions to numerical problems in a real-time paradigm. In this setting, numerical data required to solve a problem are received as input by a computer system, at regular intervals. The computer must process its inputs as soon as they arrive. It must also produce its outputs at regular intervals, as soon as they are available. We show that for some real-time numerical problems a parallel computer can deliver a solution that is significantly more accurate than when computed by a sequential computer. Similar results were derived recently in the areas of real-time optimization and real-time cryptography.
Program plan recognition for year 2000 tools
Authors: Arie Deursen, Steve Woods, Alex Quilici
Venue:  (1997)

There are many commercial tools that address various aspects of the Year 2000 problem. None of these tools, however, make any documented use of plan-based techniques for automated concept recovery. This implies a general perception that plan-based techniques is not useful for this problem. This paper argues that this perception is incorrect and these techniques are in fact mature enough to make a significant contribution. In particular, we show representative code fragments illustrating ``Year 2000'''' problems, discuss the problems inherent in recognizing the higher level concepts these fragments implement using pattern-based and rule-based techniques, demonstrate that they can be represented in a programming plan framework, and present some initial experimental evidence that suggests that current algorithms can locate these plans in linear time. Finally, we discuss several ways to integrate plan-based techniques with existing Year 2000 tools.
Thermal Stress Tectonics on the Satellites of Saturn and Uranus
Authors: John Hillier, Steven W. Squyres
Venue:  (1990)

Most of the major saturnian and uranian satellites have undergone some form of extensional tectonism and/or resurfacing early in their histories. We examine the stresses created by the early thermal evolution of these satellites, and consider the geologic implications of these stresses. Starting from an initial accretional temperature profile, we calculate the satellites'' temperature profiles as they evolve by conduction. Solid state convection, when it occurs, is handled using a simple parameterized convection scheme. The effects of radiogenic heating and release of heat of phase change are included. The thermal stresses built up in the satellites are then calculated, assuming the satellites to have a Maxwell viscoelastic rheology. The stress calculation takes into account both the effects of thermal stresses and of shifts in the position of the ice I ice II phase boundary in some satellites. If accretion takes place in a cold, gas-free environment, the stresses that build up in the smaller satellites (Mimas, Miranda, and Enceladus) are minor. In the larger satellites, however, stresses are large enough to cause fracturing and extensional tectonism under these circumstances. The stresses result largely from rapid cooling contraction of a thin outer shell; the ice II -< ice I phase transition also contributes significantly for the largest satellites. If accretion occurs in a warm gaseous nebula that dissipates rapidly, stresses large enough to cause failure are attained in all of the satellites. In all cases, the material immediately underlying the zone of failure is the warmest in the satellite, and hence may be bouyant and mobile enough to be extruded to the surface through fractures created by the extension. We conclude that thermal stresses following accretion led to a substantial early episode of extensional tectonism and perhaps also associated resurfacing on many of the saturnian and uranian satellites.
Evolving Bargaining Strategies with Genetic Programming: An Overview of AIE-DA, Ver. 2, Part 2
Authors: Shu-Heng Chen, Bin-Tzong Chie, Chung-Ching Tai
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The purpose of this paper is to introduce the software system AIE-DA, which is designedfor the implementation of an agent-based modeling of double auction markets.We shallstart this introduction with the current version, Version 2,and then indicate what can beexpected from the future of it.
Dynamization of the Trapezoid Method for Planar Point Location in Monotone Subdivisions
Authors: Yi Chiang, Roberto Tamassia
Venue:  (1992)

We present a fully dynamic data structure for point location in a monotone subdivision, based on the trapezoid method. The operations supported are insertion and deletion of vertices and edges, and horizontal translation of vertices. Let $n$ be the current number of vertices of the subdivision. Point location queries take $O(\log n)$ time, while updates take $O(\log^2 n)$ time (amortized for vertex insertion/deletion and worst-case for the others). The space requirement is $O(n \log n)$. This is the first fully dynamic point location data structure for monotone subdivisions that achieves optimal query time.
IIS Security, 1 edition
Authors: Marty Jost, Michael Cobb
Venue:  (2002)

:Protect your IIS server with help from this authoritative book. Covering all basic security tools that come with IIS  and explaining their weaknesses  this complete guide shows you how to utilize encryption, authorization, filtering, and other restrictive techniques to protect against attacks and other security violations.
A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
Authors: Thomas F. Coleman, Yuying Li
Venue:  (1992)

We propose a new algorithm, a reflective Newton method, for the minimization of a quadratic function of many variables subject to upper and lower bounds on some of the variables. This method applies to a general (indefinite) quadratic function, for which a local minimizer subject to bounds is required, and is particularly suitable for the large-scale problem. Our new method exhibits strong convergence properties, global and quadratic convergence, and appears to have significant practical potential. Strictly feasible points are generated. Experimental results on moderately large and sparse problems support the claim of practicality for large-scale problems.
Quaternary Coded Genetic Algorithms
Authors: Kai Freitag, Lars Hildebrand, Claudio Moraga
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Genetic Algorithms comprise search and optimization strategies which are inspired by natural evolution: "survival of the fittest". In most best known basic genetic algorithms a binary coding of soultion candidates is used. However for the DNA coding, mother nature uses four purine bases: adenine (A), cytosine (C), guanine (G) and thymine (T). Following this idea, the present paper studies quaternary coded genetic algorithms and, based on high complex test functions, shows that these algorithms have a performance as good as their corresponding binary versions for problems with low dimensions and reach very fast and acceptable good fitness, if not the best, for high dimensional problems. For the first time it is shown, that the performance of genetic algorithms under a Gray code is sensitive to permutation of the columns of the code.
On Hoare Logic and Kleene Algebra with Tests
Authors: Dexter Kozen
Venue:  (1998)

We show that Kleene algebra with tests subsumes propositional Hoare logic. Thus the specialized syntax and deductive apparatus of Hoare logic are inessential and can be replaced by ordinary equational reasoning. It follows from the reduction that propositional Hoare logic is in PSPACE; we show that it is PSPACE-complete. 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
Fighting Robots: A Guide to Radio-Controlled Combatants
Authors: Michael Benson
Venue:  (2002)

:It's an ear-splitting, gut-crunching, armor-crashing, booby-trapped fight to the death and the fastest-growing sport on television -- the world of hard-driving robot combat. Millions watch as these metallic maulers, handmade with a vengeance by technical wizards, slash, buzz, and hammer each other into a crowd-pleasing pulp in awesome displays of motorized muscle. This is the only A to Z guide to the fascinating world of mechanical warriors -- from the best Bots in the business to the inventors who created them. Whether you want to build and fight your own robot, learn more about the sport, or get a close-up, behind-the-scenes look at every bit of the action, this comprehensive book delivers it all -- the guts, the gears, and the pulverizing glory! 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