ppxscal/embedding_network huggingface dataset:
Vibrational properties of NiO(110) surface by molecular dynamics simulation
Authors: T. E. Karakasidis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Using molecular dynamics and a rigid ion potential we studied the vibrational properties of the NiO(110) surface. The simulations were carried out at T=300K and we calculated the phonon density of states (DOS) for the anion and cation sublattice as a function of the distance form the surface along the three directions parallel and normal to the surface. We discuss how the bulk DOS is altered as a function of the distance from the surface.
Instance-based attribute identification in database integration
Authors: Cecil Eng H. Chua, Roger H. L. Chiang, Ee-Peng Lim
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.Most research on attribute identification in database integration has focused on integrating attributes using schema and summary information derived from the attribute values. No research has attempted to fully explore the use of attribute values to perform attribute identification. We propose an attribute identification method that employs schema and summary instance information as well as properties of attributes derived from their instances. Unlike other attribute identification methods that match only single attributes, our method matches attribute groups for integration. Because our attribute identification method fully explores data instances, it can identify corresponding attributes to be integrated even when schema information is misleading. Three experiments were performed to validate our attribute identification method. In the first experiment, the heuristic rules derived for attribute classification were evaluated on 119 attributes from nine public domain data sets. The second was a controlled experiment validating the robustness of the proposed attribute identification method by introducing erroneous data. The third experiment evaluated the proposed attribute identification method on five data sets extracted from online music stores. The results demonstrated the viability of the proposed method.
Synchronization analysis for decentralizing composite Web services
Authors: Mangala Gowri Nanda, Neeran Karnik
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Web Services are emerging as the standard mechanism for making information and software available programmatically via the Internet, and as building blocks for applications. A composite web service may be built using multiple component web services. Once its specification has been developed, the composite service may be orchestrated either using a centralized engine or in a decentralized fashion. Decentralized orchestration improves scalability and concurrency. Dynamic binding coupled with decentralized orchestration adds high availability and fault tolerance to the system. In this paper, we categorize different forms of concurrency and provide an algorithm to identify these forms in a composite service specification. We also consider the impact of dynamic binding and faults on synchronization constructs.
Accessee controlled type selection for a multiple-type object
Authors: Hideki Sato, Masayoshi Aritsugi
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

INADA is an enhanced C++ persistent programming language, compliant with ODMG standard. INADA supports multiple-type objects facility which enables any persistent objects to obtain any type at any time the type is needed, and to lose any unnecessary types dynamically. Using the facility, we can model changes in roles/aspects which a real-world entity possesses. Access to a multiple-type object needs to select one from among its own types. The selection is conventionally left to an object accessing a multiple-type object. A real-world entity is, however, flexible enough to decide its roles/aspects depending on a meeting entity whom it exchanges messages with. From the consideration, this paper proposes <u>A</u>ccess<u>EE</u> Controlled Type Selection (AEE) method in which a multiple-type object selects one from among its own types depending on an object accessing it. The implementation of AEE method in INADA is also presented, which does not need any modification to the language specification and the processing system of INADA.
Can Source Code Auditing Software Identify Common Vulnerabilities and Be Used to Evaluate Software Security?
Authors: Jon Heffley, Pascal Meunier
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Software vulnerabilities are a growing problem (c.f. MITRE's CVE, http://cve.mitre.org). Moreover, many of the mistakes leading to vulnerabilities are repeated often. Source code auditing tools could be a great help in identifying common mistakes, or in evaluating the security of software. We investigated the effectiveness of the auditing tools we could access, using the following criteria: number of false positives, false negatives by comparison to known vulnerabilities, and time required to validate the warnings related to vulnerabilities. Some of the known vulnerabilities could not be found by any code auditor, because they were fairly unusual or involved knowledge not contained or codified in the source code. The coding problems that could be identified consisted of string format vulnerabilities, buffer overflows, race conditions, memory leaks, and symlink attacks. However, we found it extremely time-consuming to validate warnings related to the latter four types, because the number of false positives was very high, and because it was not easily apparent if they were real vulnerabilities. These required that the code be audited locally, by people familiar with the code, and carefully inspected to see if the values could be manipulated in such a way as to produce malicious effects. However, the string format vulnerabilities were much easier to recognize. In small and medium scale projects, the open source program Pscan was useful in finding a mix of coding style issues that could potentially enable string format vulnerabilities, as well as actual vulnerabilities. The limitations of Pscan were more obvious in large scale projects like OpenBSD, as more false positives occurred. Clearly, auditing source code for all vulnerabilities remains a time-consuming process, even with the help of the current tools, and more research is needed in identifying and avoiding other common mistakes.
Using semiotics to analyze the efficiency of a model in teaching
Authors: William Fone
Venue: ACM SIGCSE Bulletin (2003)

Semiotics is used here to explain why spreadsheets make effective teaching models.
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
Authors: Thomas Guionnet, Christine Guillemot
Venue: Proceedings of the Conference on Data Compression (2004)

This paper addresses the issue of robust and joint source-channel decodingof quasi-arithmetic codes.Quasi-arithmetic coding is a reduced precision andcomplexity implementation of arithmetic coding.This paper provides first astate model of a quasi-arithmetic decoder for binary and M-ary sources.Thedesign of an error-resilient soft decoding algorithm follows quite naturally.Thecompression efficiency of quasi-arithmetic codes allows to add extra redundancyin the form of markers designed specifically to prevent de-synchronization.Thealgorithm is directly amenable for iterative source-channel decoding in the spiritof serial turbo codes.The coding and decoding algorithms have been testedfor a wide range of channel signal-to-noise ratios.Experimental results revealimproved SER and SNR performances against Huffman and optimal arithmeticcodes.
Pointer analysis of multithreaded Java programs
Authors: Mangala Gowri Nanda, S. Ramesh
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper presents a context-sensitive and path-sensitive, intra-thread and inter-thread solution to combined pointer analysis, escape analysis and data dependence analysis of multithreaded Java programs which uses a sparse representation. We build and maintain a complete Static Single Assignment (SSA) form even for fields variables. We show how to compute inter-thread dependencies for multithreaded programs with structured fork-join constructs, open-ended threads, recursively generated threads, monitors, and wait-notify synchronization. We have implemented our algorithm in a slicer for Java programs. Our experimental results show that a sparse representation improves the analysis time and strong updates on field variables improves the precision.
An experiment to investigate interacting versus nominal groups in software inspection
Authors: Diane Kelly, Terry Shepard
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Votta's 1993 question, "Does Every Inspection Need a Meeting?" signaled an examination of an important activity in inspection. Fagan considered meetings to be the primary defect detection activity, but research has generated results that both support and conflict with this. It is generally agreed that a better understanding is needed. Research on group behaviour has motivated Sauer et al to formulate eleven propositions regarding group performance in inspections. These are partially supported by existing research. The research described in this paper addresses the performance of the group versus the performance of the individual in the context of the use of a structured inspection technique. The main conclusion is that most findings eliminated as a result of meetings are subtle findings, while a smaller number added as a result of meetings are findings that are relatively easy to identify.
A New Filled Function Method for Global Optimization
Authors: Lian-Sheng Zhang, Chi-Kong Ng, Duan Li, Wei-Wen Tian
Venue: Journal of Global Optimization (2004)

A novel filled function is suggested in this paper for identifying a global minimum point for a general class of nonlinear programming problems with a closed bounded domain. Theoretical and numerical properties of the proposed filled function are investigated and a solution algorithm is proposed. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.
A person-artefact-task (PAT) model of flow antecedents in computer-mediated environments
Authors: Christina M. Finneran, Ping Zhang
Venue: International Journal of Human-Computer Studies (2003)

Flow theory has been applied to computer-mediated environments to study positive user experiences such as increased exploratory behavior, communication, learning, positive affect, and computer use. However, a review of the existing flow studies in computer-mediated environments in Psychology, Consumer Behavior, Communications, Human-Computer Interaction, and Management Information Systems shows ambiguities in the conceptualization of flow constructs and inconsistency in the flow models. It thus raises the question of whether the direct adoption of traditional flow theory is appropriate without a careful reconceptualization to consider the uniqueness of the computer-mediated environments. This paper focuses on flow antecedents and identifies the importance of separating the task from the artefact within a computer-mediated environment. It proposes a component-based model that consists of person (P), artefact (A), and task (T), as well as the interactions of these components. The model, named the PAT model, is developed by understanding the original flow theory, reviewing existing empirical flow studies within computer-mediated environments, and analysing the characteristics of computer-mediated environments. A set of propositions is constructed to demonstrate the predictive power of the model.
Analyzing collaborative knowledge construction: multiple methods for integrated understanding
Authors: Cindy E. Hmelo-Silver
Venue: Computers Education (2003)

Documenting collaborative knowledge construction is critical for research in computer-supported collaborative learning. Because this is a multifaceted phenomenon, mixed methods are necessary to construct a good understanding of collaborative interactions, otherwise there is a risk of being overly reductionistic. In this paper I use quantitative methods of verbal data analysis, qualitative analysis, and techniques of data representation to characterize two successful knowledge building interactions from a sociocultural perspective. In the first study, a computer simulation helped mediate the interaction and in the second, a student-constructed representation was an important mediator. A fine-grained turn-by-turn analysis of the group discussions was supplemented with qualitative analysis of larger units of dialogue. In addition, chronological representations of discourse features and tool-related activity were used in study 2 to gain an integrated understanding of how a student-generated representation mediated collaborative knowledge construction. It is only by mixing methods that collaborative knowledge construction can be well characterized.
Support Vector Data Description
Authors: David M. J. Tax, Robert P. W. Duin
Venue: Machine Learning (2004)

Data domain description concerns the characterization of a data set. A good description covers all target data but includes no superfluous space. The boundary of a dataset can be used to detect novel data or outliers. We will present the Support Vector Data Description (SVDD) which is inspired by the Support Vector Classifier. It obtains a spherically shaped boundary around a dataset and analogous to the Support Vector Classifier it can be made flexible by using other kernel functions. The method is made robust against outliers in the training set and is capable of tightening the description by using negative examples. We show characteristics of the Support Vector Data Descriptions using artificial and real data.
Noise Assisted High-gain Stabilization: Almost Surely or in Second Mean
Authors: Hans Crauel, Iakovos Matsikis, Stuart Townley
Venue: SIAM Journal on Control and Optimization (2003)

For a linear control system with multiplicative white noise, we develop (asymptotic) formulas for the dependence of almost sure and second mean exponential growth rates on a high-gain parameter k. We show that if the diffusion matrix is skew-symmetric so that the noise enters in a purely skew-symmetric way, then the function g, where g(p)/p denotes the exponential growth rate of the pth mean, converges to a straight line, uniformly for $p\in[0,2]$, as $k\to\infty$. We use these formulas to show that the feedback control system in Stratonovich form is high-gain stabilizable even if the zero-dynamics are unstable, provided that the noise is strong enough. This contrasts with the noise free case, where we need the zero-dynamics to be exponentially stable.We then consider a class of systems where the diffusion matrix is not skew-symmetric and show that the almost sure and pth mean growth rates have different limiting behavior as $k\to\infty$.
CIRCE: a program for parasitic parameter extraction
Authors: Carlo Marazzini, Mauro Santomauro, Michele Taliercio
Venue: Proceedings of the conference on European design automation (1990)

Parameter extraction is one of the crucial points in the Integrated Circuit Design Process. This paper describes the features of CIRCE, a Parameter Extraction program, that produces an electrical description of the network having a geometrical description of the layout as input.Parasitic effects due to the intrinsic resistances of the circuit wires and to the capacitive interactions between the wires themselves (coupling and overlapping) are taken into account. Modelling of resistive and capacitive effects are presented and the implementation into the program CIRCE is described. Examples are shown in the last part.
The uncommon denominator: a proposal for consistent reporting of pronoun resolution results
Authors: Donna K. Byron
Venue: Computational Linguistics (2001)

Pronoun resolution studies compute performance inconsistently and describe results incompletely. We propose a new reporting standard that improves the exposition of individual results and the possibility for readers to compare techniques across studies. We also propose an informative new performance metric, the resolution rate, for use in addition to precision and recall.
Modalys-ER for OpenMusic (MfOM): virtual instruments and virtual musicians
Authors: Richard Polfreman
Venue: Organised Sound (2002)

Modalys-ER is a graphical environment for creating physical model instruments and generating musical sounds with them. While Modalys-ER provides users with a relatively simple-to-use interface, it has only limited methods for mapping control data onto model parameters for performance. While these are sufficient for many interesting applications, they do not bridge the gap from high-level specifications such as MIDI files or Standard Western Notation (SWN) down to low-level parameters within the physical model. With this issue in mind, a part of Modalys-ER has now been ported to OpenMusic, providing a platform for developing more sophisticated automation and control systems that can be specified through OpenMusic's visual programming interface. An overview of the MfOM library is presented and illustrated with several musical examples using some early mapping designs. Also, some of the issues relating to building and controlling virtual instruments are discussed and future directions for research in this area are suggested. The first release is now available via the IRCAM Software Forum.
Uniform-distribution attribute noise learnability
Authors: Nader H. Bshouty, Jeffrey C. Jackson, Christino Tamon
Venue: Information and Computation (2003)

We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and show that if this measure is small for a class C and an attribute noise distribution D then C is not learnable with respect to the uniform distribution in the presence of noise generated according to D. The noisy distance measure is then characterized in terms of Fourier properties of the function class. We use this characterization to show that the class of all parity functions is not learnable for any but very concentrated noise distributions D. On the other hand, we show that if C is learnable with respect to uniform using a standard Fourier-based learning technique, then C is learnable with time and sample complexity also determined by the noisy distance. In fact, we show that this style algorithm is nearly the best possible for learning in the presence of attribute noise. As an application of our results, we show how to extend such an algorithm for learning AC0 so that it handles certain types of attribute noise with relatively little impact on the running time.
"Breaking the code", moving between private and public work in collaborative software development
Authors: Cleidson R. B. de Souza, David Redmiles, Paul Dourish
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Software development is typically cooperative endeavor where a group of engineers need to work together to achieve a common, coordinated result. As a cooperative effort, it is especially difficult because of the many interdependencies amongst the artifacts created during the process. This has lead software engineers to create tools, such as configuration management tools, that isolate developers from the effects of each other's work. In so doing, these tools create a distinction between private and public aspects of work of the developer. Technical support is provided to these aspects as well as for transitions between them. However, we present empirical material collected from a software development team that suggests that the transition from private to public work needs to be more carefully handled. Indeed, the analysis of our material suggests that different formal and informal work practices are adopted by the developers to allow a delicate transition, where software developers are not largely affected by the emergent public work. Finally, we discuss how groupware tools might support this transition.
Clustering the Chilean Web
Authors: Satu Virtanen
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two models of the Web Graph. Information on web clusters can be employed both to validate generation modelsand to study the properties of the graph. Clusters can also be used in semantics-based grouping of websites or pages e.g. for indexing and browsing.
A Superfast Toeplitz Solver with Improved Numerical Stability
Authors: Michael Stewart
Venue: SIAM Journal on Matrix Analysis and Applications (2003)

This paper describes a new O(n log3(n)) solver for the positive definite Toeplitz system Tx=b. Instead of computing generators for the inverse of T, the new algorithm adjoins b to T and applies a superfast Schur algorithm to the resulting augmented matrix. The generators of this augmented matrix and its Schur complements are used by a divide-and-conquer block back-substitution routine to complete the solution of the system. The goal is to avoid the well-known numerical instability inherent in explicit inversion. Experiments suggest that the algorithm is backward stable in most cases.
Efficient methods for solving biomechanical equations
Authors: Joseph E. Flaherty
Venue:  (2003)

Several steps are taken to produce a partial differential equation solving environment (PDESE) for solving time-dependent nonlinear biomechanical problems using adaptive finite element methods (FEMs) in one-, two-, and three-dimensions. We develop several methods to increase the efficiency of FEMs used to solve systems of partial differential equations arising in biomechanical models. The table look-up method is used to increase the speed of quadrature procedures specific to FEMs by interpolating the non-polynomial part of the integrand then using a pre-computed table of values. An enhanced prototype of a PDESE using h-adaptivity was used to solve a reaction-diffusion system of equations simulating the spread of Lyme disease taking into account vector dynamics. Procedures to correct sliver elements generated by mesh motion required for domain reshaping were developed and used in a h-adaptive two-dimensional micro-scale fluid pump simulation. The anisotropic biphasic theory (ABT) equations of Barocas and Tranquillo describing the formation of artificial arteries were solved using h-adaptivity and mesh motion in two dimensions. The efficacy of the adaptive procedures that were developed is shown. A modern object-oriented code closer to the ideal of a PDESE, Trellis, was enhanced and used to solve the ABT equations in three dimensions using h-adaptivity and mesh motion for the hexahedral interstitial cell traction assay (ICTA) and wound healing problems, hitherto unsolved. Warm restarts in DASPK were implemented within Trellis and shown to speed up adaptive computations by a factor of four for the ICTA problem.