ppxscal/embedding_network huggingface dataset:
Open Reuse of Component Designs in OPM/We
Authors: Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

As system complexity has increased, so has interest in reusing software components in early development phases. While most current modeling methods support design of generic parameterized frameworks or patterns and weaving them into specific models, they do notsupport open reuse, i.e., the ability to develop partially specified components and refine them in the target application. We introduce an open reuse formalism that is based on OPM/Web, an extension of Object-Process Methodology for distributed systems and Web applications. Our open reuse is accomplished by a three-step process, consisting of designing reusable models, creating basic woven models, and enhancing their specification. We model a reusable component through partially specified environmental elements that are bound to concrete counterparts when the component is integrated into the system under development. Rules for modeling and combining components are defined and applied to a Web example.
Can we hear the prosody of smile?
Authors: Véronique Aubergé, Marie Cathiard
Venue: Speech Communication (2003)

Visual expression alone (a smile or a laugh) is often enough to identify an emotion such as amusement: in a perception task, subjects correctly identified visual and audio-visual stimuli of amused speech to the same degree (Proceedings of ICSLP, Sydney, 1998, p. 559), but even from the acoustic signal alone it has been demonstrated that the consequences of a (mechanical) smile gesture can be perceived as amusement (JASA 96 (1994) 2101). A hypothesis developed in the present work is that the expression of amusement in speech involves specific control of prosody and cannot be reduced simply to a change in voice quality as a consequence of the facial smile gesture. Speech stimuli were produced by French speakers for various tasks (spontaneous amusement, simulated amusement, mechanical smiling, ...), and in a first experiment, listeners were able to identify speech from the spontaneous smile condition as more amused than the "mechanical smile". It was shown from a second experiment that, even under clear visual conditions, the auditory modality contributes to audio-visual perception. A McGurk paradigm applied to discordant amused/mechanical stimuli clearly showed that acoustic information interacts with the visual decoding. The stimuli were analysed using a set of parameters chosen following Tartter (Percept. Psychophys. 27 (1980) 24), Banse and Scherer (J. Pers. Soc. Psych. 170 (1996) 614) and Mozziconacci (PhD Thesis, Eindhoren University, 1998). The prosodic parameters affected in the expression of amusement are primarily intensity and F0 declination, but they are different for different speakers. Our results confirm the finding by Mozziconacci (PhD Thesis, Eindhoren University, 1998), that there may be numerous ways of using the same parameters to express emotions such as amusement..
SmartPointers: personalized scientific data portals in your hand
Authors: Matthew Wolf, Zhongtang Cai, Weiyun Huang, Karsten Schwan
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

The SmartPointer system provides a paradigm for utilizing multiple light-weight client endpoints in a real-time scientific visualization infrastructure. Together, the client and server infrastructure form a new type of data portal for scientific computing. The clients can be used to personalize data for the needs of the individual scientist. This personalization of a shared dataset is designed to allow multiple scientists, each with their laptops or iPaqs to explore the dataset from different angles and with different personalized filters. As an example, iPaq clients can display 2D derived data functions which can be used to dynamically update and annotate the shared data space, which might be visualized separately on a large immersive display such as a CAVE. Measurements are presented for such a system, built upon the ECho middleware system developed at Georgia Tech.
Multiple-Machine Lower Bounds for Shop-Scheduling Problems
Authors: Francis Sourd, Wim Nuijten
Venue: INFORMS Journal on Computing (2000)

In order to compute lower bounds for shop scheduling problems, a lot of attention has been paid to adjustment techniques based on one-machine relaxations. We present such a new technique but, following the observation that machines are connected to each other through precedence constraints, we also study techniques that are based on the combination of precedence constraints and disjunctive constraints between operations that are processed on different machines. A computational study of the effectiveness of these new techniques is performed on job-shop and flow-shop instances.
The Local and Variegated Nature of Learning in Organizations: A Group-Level Perspective
Authors: Amy C. Edmondson
Venue: Organization Science (2002)

This paper considers the role of team learning in organizational learning. I propose that a group-level perspective provides new insight into how organizational learning is impeded, hindering effective change in response to external pressures. In contrast to previous theoretical perspectives, I suggest that organizational learning is local, interpersonal, and variegated. I present data from an exploratory study of learning processes in 12 organizational teams engaged in activities ranging from strategic planning to hands-on manufacturing of products. These qualitative data are used to investigate two components of the collective learning process--reflection to gain insight and action to produce change--and to explore how teams allow an organization to engage in both radical and incremental learning, as needed in a changing and competitive environment. I find that team members' perceptions of power and interpersonal risk affect the quality of team reflection, which has implications for their team's and their organization's ability to change.
On an one-dimensional bi-layer shallow-water problem
Authors: María Luz Muñoz-Ruiz, Manuel Jesús Castro-Díaz, Carlos Parés
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

This paper is concerned with the mathematical analysis and the numerical approximation of the system of partial differential equations governing the one-dimensional flow of two superposed shallow layers of immiscible viscous fluid in a channel with variable rectangular cross-section. First, we prove the existence and uniqueness of solution for small data and some smoothness results. Next, a first-order upwind scheme for numerically solving the system is proposed. We apply this scheme to the simulation of some two-layer exchange flows through straits with a sill and a contraction.
Interactive augmented reality techniques for construction at a distance of 3D geometry
Authors: Wayne Piekarski, Bruce H. Thomas
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

This paper presents a series of new augmented reality user interaction techniques to support the capture and creation of 3D geometry of large outdoor structures, part of an overall concept we have named construction at a distance. We use information about the user's physical presence, along with hand and head gestures, to allow the user to capture and create the geometry of objects that are orders of magnitude larger than themselves, with no prior information or assistance. Using augmented reality and these new techniques, users can enter geometry and verify its accuracy in real time. This paper includes a number of examples showing objects that have been modelled in the physical world, demonstrating the usefulness of the techniques.
From simulation to practice: cache performance study of a Prolog system
Authors: Ricardo Lopes, Luís Fernando Castro, Vítor Santos Costa
Venue: ACM SIGPLAN Notices (2003)

Progress in Prolog applications requires ever better performance and scalability from Prolog implementation technology. Most modern Prolog systems are emulator-based. Best performance thus requires both good emulator design and good memory performance. Indeed, Prolog applications can often spend hundreds of megabytes of data, but there is little work on understanding and quantifying the interactions between Prolog programs and the memory architecture of modern computers.In a previous study of Prolog systems we have shown through simulation that Prolog applications usually, but not always, have good locality, both for deterministic and non-deterministic applications. We also showed that performance may strongly depend on garbage collection and on database operations. Our analysis left two questions unanswered: how well do our simulated results holds on actual hardware, and how much did our results depend on a specific configuration? In this work we use several simulation parameters and profiling counters to improve understanding of Prolog applications. We believe that our analysis is of interest to any system implementor who wants to understand his or her own system's memory performance.
Estimating internal memory fragmentation for Java programs
Authors: Therapon Skotiniotis, Ji-en Morris Chang
Venue: Journal of Systems and Software (2002)

Dynamic memory management has been an important part of a large class of computer programs and with the recent popularity of object oriented programming languages, more specifically Java, high performance dynamic memory management algorithms continue to be of great importance. In this paper, an analysis of Java programs, provided by the SPECjvm98 benchmark suite, and their behavior, as this relates to fragmentation, is performed. Based on this analysis, a new model is proposed which allows the estimation of the total internal fragmentation that Java systems will incur prior to the programs execution. The proposed model can also accommodate any variation of segregated lists implementation. A comparison with a previously introduced fragmentation model is performed as well as a comparison with actual fragmentation values that were extracted from SPECjvm98. Finally the idea of a test-bed application that will use the proposed model to provide to programmers/developers the ability to know, prior to a programs execution, the fragmentation and memory utilization of their programs, is also introduced. With this application at hand developers as well as designers of applications could better assess the stability, efficiency as well reliability of their applications at compile time.
The joint effect of relativistic and direct solar radiation pressure on an axially symmetric spacecraft: II. the solution and the elements of transformation
Authors: A. A. El-Enna, M. I. El-Saftawy
Venue: Applied Mathematics and Computation (2003)

In this work we are concerned with the solution of a dynamical system that represents the coupling effects between the perturbing forces arising from the direct solar radiation pressure (S.R.P.) and Earth's oblateness, limited to the principal term and the second zonal harmonic (J2), in the post Newtonian potential (P.N.). The Hamiltonian of the system, in terms of the Delaunay elements, is outlined. The phase space was augmented so as to remove the explicit time dependence, due to the mean longitude of the Sun. The second zonal harmonic of the geopotential, J2 (considered to be the 1st order) was considered to be the small parameter of the problem. The solution is affected through two canonical transformations retaining, in successive, secular and periodic terms up to orders 4 and 3, respectively. The elements of the transformation and its inverse as well as a procedure for the computation of position and velocity are outlined.
BACI debugger: a GUI debugger for the BACI system
Authors: David Strite, Linda Null
Venue: Journal of Computing Sciences in Colleges (2002)

Due to the increasing importance of concurrent programming and distributed computing systems, possessing a good understanding of concurrency and its impact on process synchronization is essential. Since concurrency introduces design and execution issues not found in sequential programming, to learn about concurrency issues, it is important that students gain hands on experience actually doing concurrent programming. The best way to get this experience is by using a system developed specifically for teaching concurrent programming. The Ben-Ari Concurrent Interpreter (BACI) is such a system. Unfortunately, when errors are encountered in BACI programs, they are cumbersome to debug. The purpose of this paper is to introduce and describe a Java-based graphical user interface debugger for the BACI language.
On the spectral property of a Dirichlet problem with explosive factor
Authors: Zaki F. A. El-Raheem, A. H. Nasser
Venue: Applied Mathematics and Computation (2003)

In this paper we evaluate the asymptotic formulas for the eigenvalues, the eigenfunctions and the normalization numbers of some version of a Dirichlet problem in a finite interval with explosive factor.
Evolvability and analysis of robot control networks
Authors: Tom Smith, Phil Husbands, Michael O'Shea
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Identification of control system classes capable of generating adaptive behaviour over time is a black art. Many practitioners rely on systems that have "always worked in the past", others may use trial-and-error until success, but carry out no subsequent analysis of why the particular system actually worked. Here we apply the techniques of dynamical systems theory to the analysis of successfully evolved robot control systems, allowing us to identify, potentially useful properties of network classes.
Space decomposition preconditioners and their application in geomechanics
Authors: R. Blaheta, P. Byczanski, O. Jakl, J. Starý
Venue: Mathematics and Computers in Simulation (2003)

This paper addresses the use of space decomposition preconditioners for the numerical solution of boundary value problems. As special cases, it deals with the displacement decomposition (DiD) and overlapping domain decomposition (DD) preconditioners. A special attention is also devoted to inexact solution of sub-problems and the use of non-symmetric preconditioners. In these cases, the generalized preconditioned congugate gradient method is shown to be efficient to use. The considered methods are applied to the solution of selected model problems as well as to a large scale problem arising from assessment of stress changes induced by mining activities.
Whirlpool PLAs: a regular logic structure and their synthesis
Authors: Fan Mo, Robert K. Brayton
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

A regular circuit structure called a Whirlpool PLA (WPLA) is proposed. It is suitable for the implementation of finite state machines as well as combinational logic. A WPLA is logically a four-level Boolean NOR network. By arranging the four logic arrays in a cycle, a compact layout is achieved. Doppio-ESPRESSO, a four-level logic minimization algorithm is developed for WPLA synthesis. No technology mapping, placement or routing is necessary for the WPLA. Area and delay trade-off is absent, because these two goals are usually compatible in WPLA synthesis.
A user-friendly software for sustainable management of urban areas
Authors: G. Beccali, M. Cellura, M. Mistretta
Venue: Development and application of computer techniques to environmental studies (2002)

The need to collect and process information on urban ecosystem requires the introduction of innovative scientific tools, in order to analyze the current urban factors and to optimize the energetic and environmental profile of urban systems, with regard to carrying capacity and territorial needs and vocations.Addressing these needs requires two main elements: (i) public availability of transparent data; and (ii) availability of interactive software designed to make easier exploration of data, models and results.The aim of the present paper is to show a user-friendly software, which is designed as a decision support system for policy makers in the multicriteria selection among different planning and management options.Such software is able to assess the whole environmental performance of urban systems and to control the developing trends towards sustainability, in consequence to different scenarios of human management. It can be usefully employed to analyze the developing trends of urban ecosystems and to plan sustainable development strategies, as tool of decision-making support in the selection of the eco-sustainable options.
Formulation of the Russell-Yasuda Kasai Financial Planning Model
Authors: David R. Carino, William T. Ziemba
Venue: Operations Research (1998)

This paper describes the formulation of the Russell-Yasuda Kasai financial planning model, including the motivation for the model. The presentation complements the discussion of the technical details of the financial modeling process and the managerial impact of its use to help allocate the firm's assets over time discussed in Carin~o et al. (1994, 1998, respectively). The multistage stochastic linear program incorporates Yasuda Kasai's asset and liability mix over a five-year horizon followed by an infinite horizon steady-state end-effects period. The objective is to maximize expected long-run profits less expected penalty costs from constraint violations over the infinite horizon. Scenarios are used to represent the uncertain parameter distributions. The constraints represent the institutional, cash flow, legal, tax, and other limitations on the asset and liability mix over time.
Benchmarks for grid computing: a review of ongoing efforts and future directions
Authors: Allan Snavely, Greg Chun, Henri Casanova, Rob F. Van der Wijngaart, Michael A. Frumkin
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

Grid architectures are collections of computational and data storage resources linked by communication channels for shared use. It is important to deploy measurement methods so that Grid applications and architectures can evolve guided by scientific principles. Engineering pursuits need agreed upon metrics---a common language for communicating results, so that alternative implementations can be compared quantitatively. Users of systems need performance parameters that describe system capabilities so that they can develop and tune their applications. Architects need examples of how users will exercise their system to improve the design. The Grid community is building systems such as the TeraGrid [1] and The Informational Power Grid [2] while applications that can fully benefit from such systems are also being developed. We conclude that the time to develop and deploy sets of Grid benchmarks is now. This article reviews fundamental principles, early efforts, and benefits of Grid benchmarks to the study and design of Grids.
Global Stochastic Optimization with Low-Dispersion Point Sets
Authors: Sidney Yakowitz, Pierre L'Ecuyer, Felisa Vázquez-Abad
Venue: Operations Research (2000)

This study concerns a generic model-free stochastic optimization problem requiring the minimization of a risk function defined on a given bounded domain in a Euclidean space. Smoothness assumptions regarding the risk function are hypothesized, and members of the underlying space of probabilities are presumed subject to a large deviation principle; however, the risk function may well be nonconvex and multimodal. A general approach to finding the risk minimizer on the basis of decision/observation pairs is proposed. It consists of repeatedly observing pairs over a collection of design points. Principles are derived for choosing the number of these design points on the basis of an observation budget, and for allocating the observations between these points in both prescheduled and adaptive settings. On the basis of these principles, large-deviation type bounds of the minimizer in terms of sample size are established.
Derivative superconvergent points in finite element solutions of harmonic functions: a theoretical justification
Authors: Zhimin Zhang
Venue: Mathematics of Computation (2002)

Finite element derivative superconvergent points for harmonic functions under local rectangular mesh are investigated. All superconvergent points for the finite element space of any order that is contained in the tensor-product space and contains the intermediate family can be predicted. In the case of the serendipity family, results are given for finite element spaces of order below 6. The results justify the computer findings of Babugka, et al.
Distributed unsupervised learning using the multisoft machine
Authors: Giuseppe Patané, Marco Russo
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

Unsupervised learning using K-means techniques is successfully employed in several application fields. When the training set and the number of reference vectors increases, the computational effort can become prohibitive for mono-processor computers. This paper illustrates the parallelization of two clustering techniques using the MULTISOFT machine, a commodity supercomputer, built at the University of Messina. The particular management policy of the MULTISOFT machine and the implementation techniques have shown very interesting results: the speedup increases together with the complexity of the problem to be solved.
A two phase optimization technique for XML queries with multiple regular path expressions
Authors: Tae-Sun Chung, Hyoung-Joo Kim
Venue: Journal of Systems and Software (2002)

As XML (eXtensible Markup Language) has emerged as a standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. XML queries are based on regular path queries, which find objects reachable by given regular expressions. To answer many kinds of user queries, it is necessary to evaluate queries that have multiple regular path expressions. However, previous work on subjects such as query rewriting and query optimization in the frame work of semistructured data has usually dealt with a single regular path expression. For queries that have multiple regular path expressions we suggest a two phase optimizing technique: query rewriting using views by finding the mappings from the view's body to the query's body and for rewritten queries, evaluating each query conjunct and combining them. We show that our rewriting algorithm is sound and our query evaluation technique is more efficient than that of previous work on optimizing semistructured queries.
Distributed processes: a concurrent programming concept
Authors: Per Brinch Hansen
Venue: The origin of concurrent programming: from semaphores to remote procedure calls (2002)

A language concept for concurrent processes without common variables is introduced. These processes communicate and synchronize by means of procedure calls and guarded regions. This concept is proposed for real-time applications controlled by microcomputer networks with distributed storage. The paper gives several examples of distributed processes and shows that they include procedures, coroutines, classes, monitors, processes, semaphores, buffers, path expressions, and input/output as special cases.