ppxscal/embedding_network huggingface dataset:
Model-Driven Development within a Legacy System: An Industry Experience Report
Authors: Anthony MacDonald, Danny Russell, Brenton Atchison
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Model-driven development claims to offer the same improvement to developers that the step from assembly to procedural programming languages offered developers in the last century. In this paper we report on a project that assessed the feasibility of applying a model-driven development approach to the evolution of a non-trivial legacy system in an industrial setting. The project focused on whether the promises of model-driven development hold in the real world and whether it possible to adopt model-driven development without losing the investment in existing third generation language code. An existing component from a system was redeveloped and integrated back into the system using a current model-driven development tool at Invensys Rail Systems Australia. From experiences throughout the project, and with the tool, a set of requirements for future model-driven development and model-driven development tools was produced. These requirements are designed to both aid tool developers, and to give companies a way of assessing the maturity of both future model-driven development tools and model-driven development itself.
Efficient techniques for the second-order parabolic equation subject to nonlocal specifications
Authors: Mehdi Dehghan
Venue: Applied Numerical Mathematics (2005)

Many physical phenomena are modeled by nonclassical parabolic boundary value problems with nonlocal boundary conditions. In place of the classical specification of boundary data, we impose a nonlocal boundary condition. Partial differential equations with nonlocal boundary conditions have received much attention in the last twenty years. Most of the papers were directed to the second-order parabolic equation, particularly to the heat conduction equation. One could generically classify these problems into two types; boundary value problems with nonlocal initial conditions, and boundary value problems with nonlocal boundary conditions. We will deal here with the second type of nonlocal boundary value problems that is the solution of nonlocal boundary value problems with standard initial condition. The main difficulty in the implicit treatment of the nonlocal boundary value problems is the nonclassical form of the resulting matrix of the system of linear algebraic equations. In this paper, various approaches for the numerical solution of the one-dimensional heat equation subject to the specification of mass which have been considered in the literature, are reported. Several methods have been proposed for the numerical solution of this boundary value problem. Some remarks comparing our work with earlier work will be given throughout the paper. Numerical examples are given at the end of this paper to compare the efficiency of the new techniques. Some specific applications in engineering models are introduced.
Book review: Change of Representation and Inductive Bias Edited by D. Paul Benjamin (Kluwer Academic Publishers Boston, 1990)
Venue: ACM SIGART Bulletin (1990)

This is a collection of 18 papers from 20 contributors to the First International Workshop on Change Representation and Inductive Bias held June 8--10, 1988, in Tarrytown, NY, hosted by Philips Laboratories. The workshop was attended by 32 invited participants with 24 presenting. Although identified as proceedings by the editor, two of the papers reference a collection of "proceedings" available from Philips. Most of the papers in this book were written after the conference.
A measurement study of path capacity in 802.11b based wireless networks
Authors: Tony Sun, Guang Yang, Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
Venue: Papers presented at the 2005 workshop on Wireless traffic measurements and modeling (2005)

The rapid deployment of wireless networks in various environments necessitates the development of new end-to-end tools that monitor and measure the properties of wireless paths well. In this paper, we implement AdHoc Probe, a recently proposed path capacity estimation tool specially designed for the multi-hop ad hoc wireless environment. We present an implementation of AdHoc Probe in Linux; discuss challenges in its deployment, and solutions to the various system issues encountered. We also evaluate the behavior/effectiveness of AdHoc Probe in various testbed setups; including an interfered setting that cannot be simulated. Experiment results validate the workings of AdHoc Probe and offer insights into how the capacity of a wireless path changes in real wireless environments. Our efforts provide a basis for realistic results that can be of assistance in activities such as capacity planning, protocol design, performance analysis, and etc.
Semantic grid: scientific issues, infrastructure, and methodology
Authors: Hai Zhuge
Venue: Communications of the ACM (2005)

Creating a new interconnection environment incorporating the Internet, sensor networks, mobile devices, and the interconnection semantics.
On Combinatorics of Quiver Component Formulas
Authors: Alexander Yong
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

Buch and Fulton [9] conjectured the nonnegativity of the quiver coefficients appearing in their formula for a quiver cycle. Knutson, Miller and Shimozono [24] proved this conjecture as an immediate consequence of their "component formula". We present an alternative proof of the component formula by substituting combinatorics for Gröbner degeneration [23, 24]. We relate the component formula to the work of Buch, Kresch, Tamvakis and the author [10] where a "splitting" formula for Schubert polynomials in terms of quiver coefficients was obtained. We prove analogues of this latter result for the type BCD-Schubert polynomials of Billey and Haiman [4]. The form of these analogues indicate that it should be interesting to pursue a geometric context that explains them.
Jalapeno: secentralized grid computing using peer-to-peer technology
Authors: Niklas Therning, Lars Bengtsson
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

This paper presents the Jalapeno grid computing system. Jalapeno is implemented in Java and uses peer-to-peer technology provided by Project JXTA. The Jalapeno system consists of manager, worker and task submitter hosts. The task submitter submits a collection of tasks, a task bundle, to be processed by the system to a randomly chosen manager. The manager splits the bundle into a set of new, smaller bundles which are forwarded to equally many, randomly chosen, managers which repeat the process. Each manager has a small number of connected workers. During task bundle splitting the manager may, depending on its current load, reserve a number of tasks for its workers. Workers return the results to their managers which forward them to the task submitterThe system is self configuring: hosts volunteering their computing power will at first become workers only but will eventually become managers if they can not connect to another manager within a certain time.The major contributions of this project are: an implicit hierarchy of hosts which changes randomly over time and requires no effort to maintain, a framework for applications solving embarrassingly parallel type of problems which automatically partitions the problem into smaller sub-problems and ease of use through the use of Sun's Java Web Start technology.Two applications have been developed for the system to evaluate its performance: an RC5 key cracking application and a 3d ray-tracing application. The entire system is available for download at http://jalapeno.therning.org.
Detection probabilities of interconnect breaks: an analysis
Authors: Shalini Ghosh, F. Joel Ferguson
Venue: Integration, the VLSI Journal (2005)

An interconnect break is a break that occurs in the interconnect wiring, resulting in logic gate inputs being disconnected from the drivers and causing the wire to float. Interconnect breaks are the most common types of breaks in modern CMOS integrated circuits, so testing and detecting these breaks has become very important. This paper proposes a model by which standard tests for stuck-at-faults can be used to detect interconnect breaks in a circuit. This paper presents a worst-case analysis of the detection of these breaks and calculate the minimum number of test vectors required to detect breaks with a specified confidence level, using n-detection principles. To enhance the understanding of the breaks in the circuit, we present a statistical model based on the length distribution of the wires surrounding the floating wire where the break occurs. From the model we compute the detection probabilities of such breaks and show that the worst case of detection is when the bias voltage is the same as the logic threshold voltage.
Delayed Visual and Haptic Feedback in a Reciprocal Tapping Task
Authors: Caroline Jay, Roger Hubbold
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

To make optimal use of distributed virtual environments (DVEs), we must understand and quantify the effects of latency on user performance. The current study investigates whether delaying haptic, and/or visual feedback in a reciprocal tapping task impairs performance or makes the task appear more difficult to the user. Results show haptic latency has a small effect on performance, but is considerably less disruptive than visual lag.
Some remarks on teaching of programming
Authors: Janusz Jablonowski
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this paper we give some remarks on the problem of teaching programming for the first year students at the undergraduate level. The remarks are based on the experience gained by the author through several years of teaching programming at the Warsaw University. The main issue discussed in this paper concerns the choice of the programming language for the first course in programming. Earlier the language of choice in many places around the world was Pascal or C. Then some universities decided to switch to C++. Nowadays many introductory courses are taught in Java or C#. We try in this paper to advocate the choice of Pascal.
Transforming web contents into a storybook with dialogues and animations
Authors: Kaoru Sumi, Katsumi Tanaka
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper describes a medium, called Interactive e-Hon, for helping children to understand contents from the Web. It works by transforming electronic contents into an easily understandable "storybook world." In this world, easy-to-understand contents are generated by creating 3D animations that include contents and metaphors, and by using a child-parent model with dialogue expression and a question-answering style comprehensible to children.
Identifying Semantically Equivalent Object Fragments
Authors: Boris Epshtein, Shimon Ullman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We describe a novel technique for identifying semantically equivalent parts in images belonging to the same object class, (e.g. eyes, license plates, aircraft wings etc.). The visual appearance of such object parts can differ substantially, and therefore traditional image similarity-based methods are inappropriate for this task. The technique we propose is based on the use of common context. We first retrieve context fragments, which consistently appear together with a given input fragment in a stable geometric relation. We then use the context fragments in new images to infer the most likely position of equivalent parts. Given a set of image examples of objects in a class, the method can automatically learn the part structure of the domain ¿ identify the main parts, and how their appearance changes across objects in the class. Two applications of the proposed algorithm are shown: the detection and identification of object parts and object recognition.
Isotopic approximation of implicit curves and surfaces
Authors: Simon Plantinga, Gert Vegter
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Implicit surfaces are defined as the zero set of a function F: R3 &larr; R. Although several algorithms exist for generating piecewise linear approximations, most of them are based on a user-defined stepsize or bounds to indicate the precision, and therefore cannot guarantee topological correctness. Interval arithmetic provides a mechanism to determine global properties of the implicit function. In this paper we present an algorithm that uses these properties to generate a piecewise linear approximation of implicit curves and surfaces, that is isotopic to the curve or surface itself. The algorithm is simple and fast, and is among the first to guarantee isotopy for implicit surface meshing.
MobiNet: a scalable emulation infrastructure for ad hoc and wireless networks
Authors: Priya Mahadevan, Adolfo Rodriguez, David Becker, Amin Vahdat
Venue: Papers presented at the 2005 workshop on Wireless traffic measurements and modeling (2005)

The current state of the art in evaluating applications and communication protocols for ad hoc wireless networks involves either simulation or small-scale live deployment. While larger-scale deployment has been performed, it is typically costly and difficult to run under controlled circumstances. Simulation allows researchers to vary system configurations such as MAC layers and routing protocols. However, it requires the duplication of application, operating system, and network behavior within the simulator. While simulation and live deployment will clearly continue to play important roles in the design and evaluation of mobile systems, we present MobiNet, a third point in this space. In MobiNet, the communication of unmodified applications running on stock operating systems is subject to the real-time emulation of a user-specified wireless network environment. MobiNet utilizes a cluster of emulator nodes to appropriately delay, drop or deliver packets in a hop by hop fashion based on MAC-layer protocols, ad hoc routing protocols, congestion, queuing, and available bandwidth in the network. MobiNet infrastructure is extensible, facilitating the development and evaluation of new MAC layers, routing protocols, mobility and traffic models. Our evaluations show that MobiNet emulation is scalable and accurate while executing real code, including video playback.
Interface pressure calculation based on conservation of momentum for front capturing methods
Authors: E. Shirani, N. Ashgriz, J. Mostaghimi
Venue: Journal of Computational Physics (2005)

A new method for the calculation of interface pressure for front capturing methods is developed. This method is based on the calculation of the pressure force at each interfacial cell face using the exact pressure due to the portion of the cell face that is occupied by each fluid. Special formulations for the pressure in the interfacial cells are derived for different orientations of an interface. This method (referred to as pressure calculation based on the interface location (PCIL)) is applied to the time evolution of a two-dimensional initially stagnant liquid drop in a gas, as well as, a gas bubble in liquid (gravity effects are not considered). A two-fluid, PLIC-VOF method is used to simulate the flow numerically. Both the continuum surface force (CSF) and the continuum surface stress (CSS) methods are used. A wide range of Ohnesorge numbers and density and viscosity ratios of two fluids are tested. It is shown that the new method reduces the spurious currents by up to three orders of magnitude for the cases tested.
Architectural styles for active documents
Authors: Uwe Aßmann
Venue: Science of Computer Programming (2005)

This paper proposes several novel architectural styles for active documents. Active documents are documents that contain not only data, but also servlets, applets, expressions in spreadsheet languages, and other forms of software. To grasp the different forms of architectures, several novel concepts are defined.Invasive document composition is a type-safe form of template expansion and extension; transconsistency is a form of transclusion for architectures; and staged architectures provide a form of staged programming on the architectural level. With these concepts, it is possible to explain the architectures of many document processing applications for Web and office, and we define the architectural styles of wizard-parametrized, script-parametrized, transconsistent, stream-based, and staged active documents. Finally, we give a hypothesis of active document composition: it consists of four elements, namely, explicit architecture, invasiveness, transconsistency, and staging. On the basis of this hypothesis, many applications in Web engineering and document processing get a common background, and can be compared and simplified.
A transformational approach to multi-device interfaces
Authors: Kai Richter
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Using the same application on different devices requires the user to perform a mental transformation in order to adapt his knowledge to a new platform. In this work we describe how this process can be employed in multi-device development.
Finding stale-value errors in concurrent programs: Research Articles
Authors: Michael Burrows, K. Rustan M. Leino
Venue: Concurrency and Computation: Practice Experience (2004)

Concurrent programs can suffer from many types of errors, not just the well-studied problems of deadlocks and simple race conditions on variables. This paper addresses a kind of race condition that arises from reading a variable whose value is possibly out of date. The paper introduces a simple technique for detecting such stale values, and reports on the encouraging experience with a compile-time checker that uses the technique. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Power and Energy Profiling of Scientific Applications on Distributed Systems
Authors: Xizhou Feng, Rong Ge, Kirk W. Cameron
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Power consumption is a troublesome design constraint for emergent systems such as IBM's BlueGene /L. If current trends continue, future petaflop systems will require 100 megawatts of power to maintain high-performance. To address this problem the power and energy characteristics of highperformance systems must be characterized. To date, power-performance profiles for distributed systems have been limited to interactive commercial workloads. However, scientific workloads are typically non-interactive (batched) processes riddled with interprocess dependences and communication. We present a framework for direct, automatic profiling of power consumption for non-interactive, parallel scientific applications on high-performance distributed systems. Though our approach is general, we use our framework to study the power-performance efficiency of the NAS parallel benchmarks on a 32-node Beowulf cluster. We provide profiles by component (CPU, memory, disk, and NIC), by node (for each of 32 nodes), and by system scale (2, 4, 8, 16, and 32 nodes). Our results indicate power profiles are often regular corresponding to application characteristics and for fixed problem size increasing the number of nodes always increases energy consumption but does not always improve performance. This finding suggests smart schedulers could be used to optimize for energy while maintaining performance.
Autonomic Web-Based Simulation
Authors: Yingping Huang, Gregory Madey
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Many scientific simulations are large programs which despite careful debugging and testing will probably contain errors when deployed to the Web for use. Based on the assumption that such scientific simulations do contain errors and the underlying computing systems do fail due to hardware or software errors, the authors investigate and explore robust methods for developing and deploying autonomic web-based simulations(AWS) based on the Vision of Autonomic Computing.
A software development project: a student-written assessment system
Authors: Sofya Poger, Robert Schiaffino, Catherine Ricardo
Venue: Journal of Computing Sciences in Colleges (2005)

This paper describes a web-based electronic course assessment system that was developed by computer science students in capstone courses in software development at Iona College.
Density-based spatial clustering in the presence of obstacles and facilitators
Authors: Xin Wang, Camilo Rostoker, Howard J. Hamilton
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

In this paper, we propose a new spatial clustering method, called DBRS+, which aims to cluster spatial data in the presence of both obstacles and facilitators. It can handle datasets with intersected obstacles and facilitators. Without preprocessing, DBRS+ processes constraints during clustering. It can find clusters with arbitrary shapes and varying densities. DBRS+ has been empirically evaluated using synthetic and real data sets and its performance has been compared to DBRS, AUTOCLUST+, and DBCLuC*.
AI-related dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 86 (October 1983) (1983)

The following are citations selected by title as being related to AI resulting from a computer search of the Dissertation Abstracts International (DAI) database, produced by University Microfilms International. The online file does not include abstracts, but citations include the DAI reference for finding the abstract in the published DAI. Information for ordering may also be found in the publication. Other elements of the citation are author, title; university, year, and, if available, number of pages; and DAI subject category chosen by the author. References are sorted first by DAI subject category and second by author.
The Early Examples of Kedama, A Massively Parallel System in Squeak
Authors: Yoshiki Ohshima
Venue: Proceedings of the Third International Conference on Creating, Connecting and Collaborating through Computing (2005)

This paper presents an overview of a massively parallel programming system that the author has been developing and also a few examples of the system. This system, named "Kedama", provides specialized programming construct to express particle simulation. This helps in the math and science education in school setting where the students don't have particular programming training. Kedama is deeply inspired by StarLogo, the previous work in the domain. However, Kedama has a few notable differences from the previous works. Firstly, scripts can be constructed in a graphical user interface. This GUI is very similar to the well-known Squeak eToys and users can write scripts with little effort. Secondly, the system allows dynamic changes while it is running. It lets users modify their program and explore their problem domain quickly. Thirdly, the notion of the Observer script and Turtle script are unified. A user can freely mix the global actions and turtle actions in one script with little constraint. This paper introduces the concepts and semantics of the system, and discuss the examples that illustrate how to access these features. The simulations this paper discuss are bouncing atoms, the epidemic and pixel manipulations.