ppxscal/embedding_network huggingface dataset:
Software engineering 2004: ACM/IEEE-CS guidelines for undergraduate programs in software engineering
Authors: Joanne M. Atlee, Richard J. LeBlanc,  Jr., Timothy C. Lethbridge, Ann Sobel, J. Barrie Thompson
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper is an overview of Software Engineering 2004, the Software Engineering volume of the Computing Curricula 2001 project. We briefly describe the contents of the volume, the process used in developing the volume's guidelines, and how we expect the volume to be used in practice.
A lighting model for general participating media
Authors: Kyle Hegeman, Michael Ashikhmin, Simon Premože
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Efficient and visually compelling reproduction of effects due to multiple scattering in participating media remains one of the most difficult tasks in computer graphics. Although several fast techniques were recently developed, most of them work only for special types of media (for example, uniform or sufficiently dense) or require extensive precomputation. In this paper we present a lighting model for the general case of inhomogeneous medium and demonstrate its implementation on programmable graphics hardware. It is capable of producing high quality imagery at interactive frame rates with only mild assumptions about medium scattering properties and a moderate amount of simple precomputation.
Multi-objective pump scheduling optimisation using evolutionary strategies
Authors: Benjamín Barán, Christian von Lücken, Aldo Sotelo
Venue: Advances in Engineering Software (2005)

Multi-objective Evolutionary Algorithms (MOEAs) are used to solve an optimal pump-scheduling problem with four objectives to be minimized: electric energy cost, maintenance cost, maximum power peak, and level variation in a reservoir. Six different MOEAs were implemented and compared. In order to consider hydraulic and technical constraints, a heuristic algorithm was developed and combined with each implemented MOEA. Evaluation of experimental results of a set of metrics shows that the Strength Pareto Evolutionary Algorithm achieves better overall performance than other MOEAs for the parameters considered in the test problem, providing a wide range of optimal pump schedules to chose from.
IPv4 address allocation and the BGP routing table evolution
Authors: Xiaoqiao Meng, Zhiguo Xu, Beichuan Zhang, Geoff Huston, Songwu Lu, Lixia Zhang
Venue: ACM SIGCOMM Computer Communication Review (2005)

The IP address consumption and the global routing table size are two of the vital parameters of the Internet growth. In this paper we quantitatively characterize the IPv4 address allocations made over the past six years and the global BGP routing table size changes during the same period of time. About 63,000 address blocks have been allocated since the beginning of the Internet, of which about 18,000 address blocks were allocated during our study period, from November 1997 to August 2004. Among these 18,000 allocations, 90% of them started being announced into the BGP routing table within 75 days after the allocation, while 8% of them has not been used up to now. Among all the address blocks that have ever been used, 45% of them were split into fragments smaller than the original allocated blocks; without these fragementations, the current BGP table would have been about half of its current size. Furthermore, we found that the evolution of BGP routing table consists of both the appearance of new prefixes and the disappearance of old prefixes. While the change of the BGP routing table size only reflects the combined results of the two processes, the dynamics of either process is much higher than that of the BGP table size. Finally, we classify routing prefixes into covering and covered ones, and examine their evolution separately. For the covered prefixes, which account for almost half of the BGP table size, we infer their practical motives such as multihoming, load balancing, and traffic engineering, etc., via a classification method.
A note on the application of differential files to computer aided design
Authors: M. P. Atkinson
Venue: ACM SIGDA Newsletter (1978)

Recently Severence and Lohman [1] have drawn attention to several attractive properties of differential files, which enable economic preservation of data integrity and allow improved utilisation of different storage devices. They observed that use of Bloom filters would permit the composite file to perform very nearly as well for access requests as a simple file. Stocker [2] has shown that a differential file may be expected to have a better cumulative performance for updates than a simple file.
Ontologies for the description of mouse phenotypes: Conference Papers
Authors: G. V. Gkoutos, E. C. J. Green, A.-M. Mallon, A. Blake, S. Greenaway, J. M. Hancock, D. Davidson
Venue: Comparative and Functional Genomics (2004)

Ontologies are becoming increasingly important for the efficient storage, retrieval and mining of biological data. The description of phenotypes using ontologies is a particularly complex problem. We outline a schema that can be used to describe phenotypes by combining orthologous axiomatic ontologies. We also describe tools for storing, browsing and searching such complex ontologies. Central to this approach is that assays (protocols for measuring phenotypic characters) describe what has been measured as well as how this was done, allowing assays to link individual organisms to ontologies describing phenotypes. We have evaluated this approach by automatically annotating data on 600 000 mutant mice phenotypes using the SHIRPA protocol. We believe this approach will enable the flexible, extensible and detailed description of phenotypes from any organism. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Effective collaborative partnership for Malaysian electronic government service delivery
Authors: Trevor Wood-Harper, Norafida Ithnin, Othman Ibrahim
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

There exists a range of collaborative approaches to the development and implementation of eGovernment initiatives by governments around the world. Although there is no one-size-fits-all collaborative approach to implementing eGovernment, working with the private sector is a common feature of eGovernment collaborative strategy. However, as well as working in partnership with the private sector, governments will have to explore new relationships among government agencies if they are to realise eGovernment objectives. Such strategies of collaborative partnership will be unique not only because of the type of relationship binding the private sector to the public sector, but also in how they ensure the successful implementation of the eGovernment initiative. This paper intends to focus on the collaborative partnership approach in the Malaysian eGovernment initiative and explore its attempts to produce an effective collaboration towards successful eGovernment implementation.
Natural language generation in dialog systems
Authors: Owen Rambow, Srinivas Bangalore, Marilyn Walker
Venue: Proceedings of the first international conference on Human language technology research (2001)

Recent advances in Automatic Speech Recognition technology have put the goal of naturally sounding dialog systems within reach. However, the improved speech recognition has brought to light a new problem: as dialog systems understand more of what the user tells them, they need to be more sophisticated at responding to the user. The issue of system response to users has been extensively studied by the natural language generation community, though rarely in the context of dialog systems. We show how research in generation can be adapted to dialog systems, and how the high cost of hand-crafting knowledge-based generation systems can be overcome by employing machine learning techniques.
Learning The Bash Shell (Nutshell Handbooks)
Authors: Cameron Newham
Venue:  (2005)

This refreshed edition serves as the most valuable guide yet to the bash shell. It's full of practical examples of shell commands and programs guaranteed to make everyday use of Linux that much easier. Includes information on key bindings, command line editing and processing, integrated programming features, signal handling, and much more!
A Tool for Constructing 3D Environments with Virtual Agents
Authors: Spyros Vosinakis, Themis Panayiotopoulos
Venue: Multimedia Tools and Applications (2005)

The use of Virtual Environments as a user interface is essential for certain types of applications, both in education and entertainment. These worlds are even more attractive for the user when they are neither static nor pre-scripted, but have dynamic characteristics and are populated by autonomous entities, also called virtual agents. There has been a lot of research concerning visualization, animation and behavior of virtual agents, but there are no generic architectures, methodologies and tools for the development of intelligent virtual environments, i.e. 3D environments with autonomous virtual agents. In this paper, we present SimHuman, a tool for the construction of virtual worlds with autonomous entities, targeted for a specific group of applications, such as simple simulation systems, virtual environments, educational applications, multimedia presentations, etc. It consists of a programming library and two utilities and it is highly dynamic and configurable, as it is not based on fixed scenes and models. It has embedded characteristics such as Inverse Kinematics, Physically Based Modeling, Collision Detection and Response, and Vision. SimHuman incorporates some important features for designing and building virtual environments and turns out to be an effective tool for interactive 3D applications with virtual agents.
A Sensor Web Language for Mesh Architectures
Authors: Bradford G. Nickerson, Zhongwei Sun, John-Paul Arp
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

A Sensor Web Language (SWL) for mesh architectures is presented. The mesh SWL architecture was extended from a hierarchical structure to provide a more robust environment to deploy, maintain and operate sensor networks. Alerts, direct sensor node communication, multiple gateway nodes and dynamic configuration are realized. With mesh architecture support in SWL, multiple sensor networks are provided with greater flexibility, more reliable operation and machinery to better support self-diagnosis and inferencing with sensor data.
User interface development environment based on components: assets for mobility
Authors: Anne-Marie Dery-Pinna, Jérémy Fierstone
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

In this paper we present our UI development environment based on components. The UI is considered as a technical service of a business component just like security or persistence. The dialog between UI and business components is managed by an interaction/coordination service that allows the reconfiguration of components without modifying them. A UI component merging service handles dynamic assembly of corresponding UI components.
LifeBoat: An Autonomic Backup and Restore Solution
Authors: Ted Bonkenburg, Dejan Diklic, Benjamin Reed, Mark Smith, Michael Vanover, Steve Welch, Roger Williams
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

We present an innovative backup and restore solution, called LifeBoat, for Windows machines. Our solution provides for local and remote backups and "bare metal" restores. Classic backup systems do a file system backup and require the machine to be installed before the system can be restored or they do a block for block backup of the system image which allows for a "bare metal" restore, but makes it hard to access individual files in the backup. Our solution does a file system backup while still allowing the system to be completely restored onto a new hard drive.Windows presents some particularly difficult problems during both backup and restore. We describe the information we store during backup to enable the "bare metal" restore. We also describe some of the problems we ran into and how we overcame them. Not only do we provide a way to restore a machine, but we also describe the rescue environment which allows machine diagnostics and recovery of files that were not backed up. This paper presents an autonomic workgroup backup solution called LifeBoat that increases the "Built-In Value" of the PC without adding hardware, administrative cost, or complexity. LifeBoat applies autonomic principles to the age old problem of data backup and recovery.
The Discrete Moser&#x2013;Veselov Algorithm for the Free Rigid Body, Revisited
Authors: Robert I. McLachlan, Antonella Zanna
Venue: Foundations of Computational Mathematics (2005)

In this paper we revisit the Moser&#x2013;Veselov description of the free rigid body in body coordinates, which, in the 3 &#x00d7; 3 case, can be implemented as an explicit, second-order, integrable approximation of the continuous solution. By backward error analysis, we study the modified vector field which is integrated exactly by the discrete algorithm. We deduce that the discrete Moser&#x2013;Veselov (DMV) is well approximated to higher order by time reparametrizations of the continuous equations (modified vector field). We use the modified vector field to scale the initial data of the DMV to improve the order of the approximation and show the equivalence of the DMV and the RATTLE algorithm. Numerical integration with these preprocessed initial data is several orders of magnitude more accurate than the original DMV and RATTLE approach.
A model of real time control system production
Authors: M. N. Matelan
Venue: ACM SIGDA Newsletter (1976)

Many facets of Computer Science and associated technologies may be profitably viewed as dedicated real time control activities. Production of systems to exercise such control has been difficult and costly. An abstract model of the process of producing these systems is presented. The model indicates three areas of the design problem amenable to automation: 1) the selection and configuration of hardware; 2) the production of software; and 3) the selection of a monitor to maintain real time integrity of the entire system. The concept of hardware binding is introduced and it is shown that delaying the point in the design cycle where hardware is functionally bound allows a new approach to machine independence.This paper comprises two chapters of a larger work which developes an implementation-independent application-specification language and techniques to automate control system design. Such an automation system is intended to produce a hardware configuration listing and software which together define a complete dedicated real time controller. Development of this system is based on the model presented here and is an on-going design automation project at Lawrence Livermore Laboratory.
Multiple-Aperture Imaging Spectrometer: Computer Simulation and Experimental Validation
Authors: Rick Kendrick, Eric H. Smith, David N. Christie, David A. Bennett, David Theil, Eamon Barrett
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

The Lockheed Martin Advanced Technology Center (LM/ATC) is actively investigating alternate applications of coherently phased sparse-aperture optical imaging arrays. Controlling the relative phasing of the apertures enables these arrays to function as imaging interferometers, providing high spectral resolution as well as high spatial resolution imagery. In this paper we will: a) summarize the basic theory of multiple-aperture imaging interferometers; b) illustrate the theory with Fourier transform Imaging Spectrometer (FTIS) simulations, using the Rochester Institute of Technology hyper-spectral scene simulator (DIRSIG) as our source of simulated input data; c) validate the theory with experimental results derived with an LM/ATC optical FTIS tested.
Book review: USING 1-2-3 RELEASE 3.1 by Rebecca Altman, et. al. (Que Corporation, 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

This book is typical of the USING series of books produced by Que Corporation. As such, it attempts to meet the needs of all users, "new spreadsheet users, and users who have upgraded to Release 3.1." Unfortunately, spreadsheet programs are becoming so complex that it is difficult for any book to satisfy such a diverse audience. Therefore, someone tends to suffer and, in this case, it's the new user.
Investigating TCP Performance Issues in Satellite Networks
Authors: Sriram Subramanian, Shyamala Sivakumar, William J. Phillips, William Robertson
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

TCP is the widely used transport protocol across the Internet but it was originally designed for wired networks. In satellite networks, TCP encounters serious problems due to the physical properties of the wireless medium. The high delays in GEO networks and high variability of delay in LEO systems are the most significant factors affecting TCP performance. This paper identifies and illustrates TCP performance issues in satellite links by making a detailed comparison between these two common satellite altitudes. In low altitude satellite constellations, the propagation and switching delays are highly variable because of routing changes and handovers. Previous work on variable delay has focused explicitly on the retransmit timer. This paper makes a flow based analysis of abrupt delay changes to better understand TCP performance in LEO systems. Simulations are performed with the NS 2 satellite extension using the Iridium constellation. It is observed that TCP performs better in LEO than in GEO systems because of its lower latency. It is also shown that large receiver buffers and intermediate buffers can alleviate the effect of abrupt delay changes in satellite networks.
INTERLISP
Authors: Warren Teitelman
Venue: Issue 43 (December 1973) (1973)

INTERLISP (INTERactive LISP) is a LISP system currently implemented on the DEC PDP-10 under the BBN TENEX time sharing system<*R1>. INTERLISP is designed to provide the user access to the large virtual memory allowed by TENEX, with a relatively small penalty in speed (using special paging techniques described in <*R2>). Additional data types have been added, including strings, arrays, and hash association tables (hash links). The system includes a compatible compiler and interpreter. Machine code can be intermixed with INTERLISP expressions via the assemble directive of the compiler. The compiler also contains a facility for "block compilation" which allows a group of functions to be compiled as a unit, suppressing internal names. Each successive level of computation, from interpreted through compiled, to block-compiled provides greater speed at a cost of debugging ease.
Optimal partition algorithm of the RBF neural network and its application to financial time series forecasting
Authors: F. Sun, C. Liang, L. Zhang, P. Lee, Z. Lin, J. Cao
Venue: Neural Computing and Applications (2005)

A novel neural-network-based method of time series forecasting is presented in this paper. The method combines the optimal partition algorithm (OPA) with the radial basis function (RBF) neural network. OPA for ordered samples is used to perform the clustering for the samples. The centers and widths of the RBF neural network are determined based on the clustering. The difference of the objective functions of the clustering is used to adjust the structure of the neural network dynamically. Thus, the number of the hidden nodes is selected adaptively. The method is applied to stock price prediction. The results of numerical simulations demonstrate the effectiveness of the method. Comparisons with the hard c-means (HCM) algorithm show that the proposed OPA method possesses obvious advantages in the precision of forecasting, generalization, and forecasting trends. Simulations also show that the OPA&#x2013;orthogonal least squares (OPA&#x2013;OLS) algorithm, which combines OPA with the OLS algorithm, results in better performance for forecasting trends.
Characterization of the impact of interconnect design on the capacitive load driven by a global clock distribution
Authors: G. G. Lopez, G. Fiorenza, T. Bucelot, P. Restle, M. Y. Lanzerotti
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Power reduction techniques are a critical issue in the design of today's ULSI chips. This paper is concerned with methods to characterize the capacitive load on the POWER4 on-chip global clock distribution [1], which is a large contributor to the overall chip power dissipation. A characterization of the capacitive load is needed because the contributions of the on-chip devices and interconnections are typically overestimated and are not well understood for high performance microprocessors. One problem that results from the lack of this information is excessively high power dissipation in the chip global clock distribution; the global clock distribution is over-designed and stronger than necessary to drive the actual (lower) chip load. Information about the capacitive load is difficult to obtain because the data volume is large, and extracting the interconnect data is a complex task. Sophisticated computer software is needed to extract the circuit and physical design data for hundreds of devices and wire segments within the chip design schedule.This paper presents the first comprehensive characterization of the clock load for ASIC-like control logic designs in the 1.3GHz POWER4 microprocessor core [1], [2]. This characterization was achieved with the use of sophisticated software written for this study to accomplish the task of extracting the data from these designs. Analysis of the data shows that the wire contribution to the chip capacitive load is significant and can increase the capacitive load of a design by 30% on average and by as much as 130% for some designs. The results also suggest that the wire load contribution on each metal layer can be reduced if an alternate interconnect design style is selected. Two alternate design styles are presented and show that a capacitive load reduction of 8.4% to 20% is expected for each design. Extended to the entire chip, the results show that the load reduction for the core is expected to be as high as 10%. These values are large enough that one alternate design style has been implemented in the design methodology of future chips.
On the consistency of XML DTDs
Authors: Shiyong Lu, Yezhou Sun, Mustafa Atay, Farshad Fotouhi
Venue: Data Knowledge Engineering (2005)

DTD has been widely used as the schema language for XML documents. A DTD describes the structure of a collection of similar XML documents. The consistency problem of XML DTDs concerns the question that given a DTD D, if there exists any finite XML document that conforms to D. This issue is important because one wants to know whether a DTD specification is meaningful. In this paper, we formalize the notion of the consistency of DTDs, identify a sufficient and necessary condition for a DTD to be consistent, and propose a linear algorithm, DTDCon, for the consistency checking problem.