ppxscal/embedding_network huggingface dataset:
Programming language challenges in systems codes: why systems programmers still use C, and what to do about it
Authors: Jonathan Shapiro
Venue: Proceedings of the 3rd workshop on Programming languages and operating systems: linguistic support for modern operating systems (2006)

There have been major advances in programming languages over the last 20 years. Given this, it seems appropriate to ask why systems programmers continue to largely ignore these languages. What are the deficiencies in the eyes of the systems programmers? How have the efforts of the programming language community been misdirected (from their perspective)? What can/should the PL community do address this?As someone whose research straddles these areas, I was asked to give a talk at this year's PLOS workshop. What follows are my thoughts on this subject, which may or not represent those of other systems programmers.
Path preserving scale down for validation of internet inter-domain routing protocols
Authors: Glenn Carl, Shashi Phoha, George Kesidis, Bharat Madan
Venue: Proceedings of the 38th conference on Winter simulation (2006)

New solutions have been proposed to address problems with the Internet's interdomain routing protocol, BGP. Before their deployment, validation of incremental performance gains and backwards compatibility is necessary. For this task, the Internet's large size and complexity make all techniques but simulation infeasible. When performing large-scale network simulations, memory requirements for routing table storage can become a limiting factor. This work uses model reduction to mitigate this problem, with reduction defined in terms of the number of routers. Our framework uses path properties specific to interdomain routing to define the conditions of a path-preserving scale-down transformation. For implementation, vertex contraction and deletion were used to remove routers from a preliminary nominal network model. Vertex contraction was seen to violate the conditions of the transformation. A small subgraph from a measured topology is used for experimental validation. Routing tables are compared to show equivalence under the model reduction.
Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Venue: ACM International Conference Proceeding Series; Vol. 205 (2006)

Welcome to ACL2 2006, the Sixth International Workshop on the ACL2 Theorem Prover and its Applications. The ACL2 workshops provide the major technical forum for researchers to present and discuss improvements and extensions to the theorem prover, comparisons of ACL2 with other systems, and applications of ACL2 in industry, government, and academia.
Engineering ab initio dynamic interoperability and composability via agent-mediated introspective simulation
Authors: Levent Yilmaz, Andreas Tolk
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Complex software intensive simulation systems must respond to changing technology, environments, and requirements. Hence, dynamic extensibility and adaptability is a significant concern in an application domain. However, existing interoperability and composability solutions are limited in dealing with (1) dynamically evolving content needs of existing simulations and (2) run-time inclusion of new components into a simulation system. Simulations that are dynamically extensible, while being interoperable require principled designs that facilitate engineering extensibility, interoperability, and composability in the first place. We propose and examine the utility of a strategy based on an agent-mediated meta-simulation architecture.
Best Practices for Sap Business Information Warehouse on DB2 for Z/os V8
Venue:  (2005)

Note: This is a republishing of SG24-6489-00, which was withdrawn in error when we updated it with SG24-6489-01. This -00 book covers DB2 V8 while the -01 version covers DB2 V9, so we are making both books available. This IBM Redbook describes the benefits of DB2® V8 for SAP Business Information Warehouse. It lists best practices and provides performance and tuning recommendations for SAP Business Information Warehouse. In today's fast-moving business environment, there is a need for more and better business information. Data warehousing and business intelligence (BI) systems deliver that information. This imposes new requirements to manage, control, and use this data for business purposes. SAP Business Information Warehouse is the central reporting tool for almost all SAP business solutions. It is based on building blocks called InfoObjects that contain data about customers, sales, and business information. InfoObjects include InfoSources, ODS objects, and InfoCubes. The business intelligence solution from IBM and SAP can help you aggregate and leverage this information, giving you a system-wide view of your business data and delivering it across your enterprise to support sound business decisions. However, this structure can lead to slow performance if the system is not set up and managed according to good database principles. This IBM Redbook describes best practices for this product on a zSeries® platform, and provides performance and tuning recommendations for loading and querying data. It also addresses general system administration and troubleshooting. The audience for this redbook includes SAP and DB2 administrators. Knowledge of these products and of the WhitepaperRedpaper z/OS® environment is assumed. This IBM Redbook is designed to aid the reader based on specific needs. After describing the product and summarizing its advantages on the zSeries platform, we list best practices for the PSA, Infocube, ODS, and DB2 components. We give tips on how to gain efficiency when using compression and indexing. We also include a troubleshooting chapter that describes what to do when best practices do not address a problem. 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
An algebra for commitment protocols
Authors: Ashok U. Mallya, Munindar P. Singh
Venue: Autonomous Agents and Multi-Agent Systems (2007)

Protocols enable unambiguous, smooth interactions among agents. Commitments among agents are a powerful means of developing protocols. Commitments enable flexible execution of protocols and help agents reason about protocols and plan their actions accordingly, while at the same time providing a basis for compliance checking. Multiagent systems based on commitments can conveniently and effectively model business interactions because the autonomy and heterogeneity of agents mirrors real-world businesses. Such modeling, however, requires multiagent systems to host a rich variety of protocols that can capture the needs of different applications. We show how a commitment-based semantics provides a basis for refining and aggregating protocols. We propose an approach for designing commitment protocols wherein traditional software engineering notions such as refinement and aggregation are extended to apply to protocols. We present an algebra of protocols that can be used to compose protocols by refining and merging existing ones, and does this at a level of abstraction high enough to be useful for real-world applications.
Simulation and verification for computational modelling of signalling pathways
Authors: Marta Kwiatkowska, Gethin Norman, David Parker, Oksana Tymchyshyn, John Heath, Eamonn Gaffney
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Modelling of the dynamics of biochemical reaction networks typically proceeds by solving ordinary differential equations or stochastic simulation via the Gillespie algorithm. More recently, computational methods such as process algebra techniques have been successfully applied to the analysis of signalling pathways. One advantage of these is that they enable automatic verification of the models, via model checking, against qualitative and quantitative temporal logic specifications, for example, "what is the probability that the protein eventually degrades?". Such verification is exhaustive, that is, the analysis is carried out over all paths, producing exact quantitative measures. In this paper, we give an overview of the simulation, verification and differential equation approaches to modelling biochemical reaction networks. We discuss the advantages and disadvantages of the respective methods, using as an illustration a fragment of the FGF signalling pathway.
Bash Quick Reference
Authors: Arnold Robbins
Venue:  (2006)

In this quick reference, you'll find everything you need to know about the bash shell. Whether you print it out or read it on the screen, this PDF gives you the answers to the annoying questions that always come up when you're writing shell scripts: What characters do you need to quote? How do you get variable substitution to do exactly what you want? How do you use arrays? It's also helpful for interactive use. If you're a Unix user or programmer, or if you're using bash on Windows, you'll find this quick reference indispensable.
Evolving Evolutionary Algorithms with Patterns
Authors: Mihai Oltean
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

A new model for evolving evolutionary algorithms (EAs) is proposed in this paper. The model is based on the multi expression programming (MEP) technique. Each MEP chromosome encodes an evolutionary pattern which is repeatedly used for generating the individuals of a new generation. The evolved pattern is embedded into a standard evolutionary scheme which is used for solving a particular problem. Several evolutionary algorithms for function optimization are evolved by using the considered model. The evolved evolutionary algorithms are compared with a human-designed genetic algorithm. Numerical experiments show that the evolved evolutionary algorithms can compete with standard approaches for several well-known benchmarking problems.
Real-time spectral scene lighting on a fragment pipeline
Authors: Bernardt Duvenhage
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

Real-time desktop computer graphics systems have historically been based on empirical lighting models, such as the Phong lighting model, designed to be perceptually appropriate, but computationally efficient. New hardware developments since early 2003 have resulted in an affordable fourth generation graphical processing unit technology. This technology is allowing desktop computer graphics systems, like NVIDIA's GeForce&reg; series, to implement more and more complex computer graphics algorithms, and lighting models for real-time applications. This paper describes an innovative "physically based" spectral lighting, material and camera model that is based on radiometry theory and is an expansion of the historical fixed pipeline graphics system. There are two render target modes of which Direct mode is aimed at high spectral resolution solids rendering and buffered mode at including transparencies.
An Approach to Protocol Modeling and Validation
Authors: F. Cicirelli, A. Furfaro, L. Nigro
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

This paper describes an approach to modeling and analysis of complex time-dependent systems specified by modular Time Petri Nets (TPNs). The approach is supported by a Java tool TPN Designer- which permits visual modeling, debugging and discrete-event simulation. The tool is characterized by its modularity and hierarchical constructs, a scripting language for controlling model configuration and scalability, and a monitoring and watching sub system for collecting simulation output. TPN Designer permits also to split a model into LP/subnets for distributed simulation. The tool is able to translate a flattened TPN model into Uppaal/Timed Automata for model checking. The paper demonstrates the practical use of the approach through modeling and validation of a system based on the alternating bit protocol.
On initial populations of a genetic algorithm for continuous optimization problems
Authors: Heikki Maaranen, Kaisa Miettinen, Antti Penttinen
Venue: Journal of Global Optimization (2007)

Genetic algorithms are commonly used metaheuristics for global optimization, but there has been very little research done on the generation of their initial population. In this paper, we look for an answer to the question whether the initial population plays a role in the performance of genetic algorithms and if so, how it should be generated. We show with a simple example that initial populations may have an effect on the best objective function value found for several generations. Traditionally, initial populations are generated using pseudo random numbers, but there are many alternative ways. We study the properties of different point generators using four main criteria: the uniform coverage and the genetic diversity of the points as well as the speed and the usability of the generator. We use the point generators to generate initial populations for a genetic algorithm and study what effects the uniform coverage and the genetic diversity have on the convergence and on the final objective function values. For our tests, we have selected one pseudo and one quasi random sequence generator and two spatial point processes: simple sequential inhibition process and nonaligned systematic sampling. In numerical experiments, we solve a set of 52 continuous test functions from 16 different function families, and analyze and discuss the results.
Microprogrammable computer architecture design considerations
Authors: William J. Tracz
Venue: ACM SIGMICRO Newsletter (1980)

The implementation of a computer system through a microprogrammable architecture has demonstrated significant advantages in flexibility and overall cost. This paper summarizes some key questions related to the design of a microprogrammable computer architecture. Three areas are covered; general system questions, hardware questions, and software questions.
Analog In, Digital Out: Brendan Dawes on Interaction Design (VOICES)
Authors: Brendan Dawes
Venue:  (2006)

Creativity is an innate human impulse, many people believe, something we're born with but too often “grow out of” as adult lives make more and more demands. Fortunately for us, the creative drive continues to run strong in legendary designer Brendan Dawes. Habitually alert to the happy accident, and possessed of highly eclectic interests and a quirky wit, he has happened into his perfect career. Around this habitï¾call it a philosophyï¾of asking, “Why does this have to be this way? What if . . .,” Dawes has built magneticNorth, an acclaimed Web and interaction design practice, based in Manchester, U.K. In this unique book, Dawes invites readers inside a series of his personal projects to get a view of his process--his creative seeing, making, and playing. He encourages designers to look beyond the normal tools of their trade to find inspiration in the most unlikely of places: tubs of children's clay, anonymous notes, household plumbing fixtures, jazz music, snow globes, fast-food take-out bags, airport departure gates, and more. Brilliant, original, and always grounded in the needs of users, Dawes shares both the techniques he has created and the key lessons he has learned in design: why comfort is the enemy of creativity; how mistakes can be celebrated instead of feared, and how to strip design to its purest and most powerful forms. Known worldwide for his entertaining and inspirational presentations, Dawes now brings profound insights to a book that is certain to become a classic inspiration for designers of every type. Brendan Dawes is Creative Director of the interactive design group magneticNorth, based in Manchester, UK. His clients include the Walt Disney Co., the BBC, Kellogg's, and Coca-Cola. Dawes' work has been featured in numerous journals, including idN, Creative Review, MacUser, Computer Arts, Create, The Guardian, and Communications Arts. He was also featured in New Masters of Flash and other books, and is the author of Flash ActionScript for Designers: Dra,g Slide, Fade. Dawes spends much of the year speaking at conferences around the world, including the HOW Design Conference and Flashforward . 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
An algorithm for projective point matching in the presence of spurious points
Authors: Jason A. Denton, J. Ross Beveridge
Venue: Pattern Recognition (2007)

Point matching is the task of finding correspondences between two sets of points such that the two sets of points are aligned with each other. Pure point matching uses only the location of the points to constrain the problem. This is a problem with broad practical applications, but it has only been well studied when the geometric transformation relating the two point sets is of a relatively low order. Here we present a heuristic local search algorithm that can find correspondences between point sets in two dimensions that are related by a projective transform. Point matching is a harder problem when spurious points appear in the sets to be matched. We present a heuristic algorithm which minimizes the effects of spurious points.
Capacity improvement of wireless ad hoc networks with directional antennae
Authors: JiaLiang Zhang, Soung Chang Liew
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2006)

Network Capacity, which is limited by interference between simultaneous transmissions of neighboring links, is a fundamental performance metric for wireless ad hoc networks. Ref. [1] showed that the capacity of wireless ad hoc networks with omnidirectional antennae does not scale well as the node density increases. Other related work ([2], [3], [4], etc.) demonstrated that the network capacity scales better with the use of directional antennae. Most previous investigations, however, were based on simplified but unrealizable models of antenna patterns. So far, there has not been a general framework for the analysis of network capacity when directional antennae of realizable generic patterns are used. Also, few papers have derived explicitly the impact of nulls and null-width in antenna pattern on network scalability. Specifically, the scale law of network capacity with general directional antennae has not yet been investigated. This paper addresses these issues. We study arbitrary and random networks (corresponding to the best case and random case respectively), where nodes with smart antennae are assumed to be located in a planar disk without mobility. We also point out how to generalize the result to that of generic directional antenna pattern. To conserve space here, we defer detailed analysis of the impact of null-width to the full paper.
Performance Enhancement by Eliminating Redundant Function Execution
Authors: Peng Chen, Krishna Kavi, Robert Akl
Venue: Proceedings of the 39th annual Symposium on Simulation (2006)

Programs often call the same function with the same arguments, yielding the same results. We call this phenomenon, "function reuse". Previously, we have shown such a behavior for some of the SPEC2000 integer benchmarks using HP ATOM instrumentation tools. However, this required extensive analysis by hand, and assumptions regarding side-effects caused by functions. In this paper, we modified a well-known architecture simulator, SimpleScalar, to analyze multiple benchmarks to investigate the function reuse behavior.
Linux Email: Setup and Run a Small Office Email Server using PostFix, Courier, ProcMail, SquirrelMail, ClamAV and SpamAssassin
Authors: Carl Taylor, Alistair McDonald
Venue:  (2005)

This book gives you just what you need to know to set up and maintain an email server. It covers setting up the server and the mailserver, as well as extras such as spam and virus protection, and web based email.ï¾ Written by professional Linux administrators the book is aimed at technically confident users and new and part-time system administrators. The emphasis is on simple, practical and reliable guidance.
What can be done to automate conceptual simulation modeling?
Authors: Ming Zhou, Qun Zhang, Zhimin Chen
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Conceptual modeling is a critical step that directly affects the quality and efficiency of simulation projects. However current technology can hardly support the process and most practice demonstrated an ad hoc and inefficient approach. Automation can help improve the efficiency and effectiveness of conceptual simulation modeling. However, there are a number of issues must be addressed, including the formalization of model concepts, representation of modeling knowledge, and interaction between user and computer system. This paper presents a discussion of these issues based on the research by the authors, and propose suggestions for the design and development of a robust computerized modeling environment that aims to improve conceptual simulation modeling process.
On the performance of inter-organizational design optimization systems
Authors: Paolo Vercesi, Alberto Bartoli
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation-based design optimization is a key technology in many industrial sectors. Recent developments in software technology have opened a novel range of possibilities in this area. It has now become possible to involve multiple organizations in the simulation of a candidate design, by composing their respective simulation modules on the Internet. Thus, it is possible to deploy an inter-organizational design optimization system, which may be particularly appealing because modern engineering products are assembled out of smaller blocks developed by different organizations. In this paper we explore some of the fundamental performancerelated issues involved in such a novel scenario, by analyzing a variety of options: centralized control vs. distributed control; generation of new candidate designs one at a time or in batches; communication and computation performed serially or with time overlap. Our analysis provides useful insights into the numerous trade-offs involved in the implementation of inter-organizational design optimization.
Physics based boiling simulation
Authors: V. Mihalef, B. Unlusu, D. Metaxas, M. Sussman, M. Y. Hussaini
Venue: Proceedings of the 2006 ACM SIGGRAPH/Eurographics symposium on Computer animation (2006)

In order to animate complex fluid motion, computer animators have to rely on simulation systems that automatically generate the dynamics in a physics based manner. We focus in this paper on the phenomenon of boiling, which, due to its complex formulation and physics, has seen very little work done in the graphics field. We propose a new Eulerian method that couples gas and liquid with variable temperature and with a mass transfer mechanism, and we present its application to simulating boiling phenomena. Our philosophy is using physics based models to obtain visually rich animations that mirror their real life counterparts, including phenomena of increased circulation in the mass of liquid, roiling boil, nucleation seeding on solid boundaries.