ppxscal/embedding_network huggingface dataset:
The carpet programming environment for solving scientific problems on parallel computers
Authors: Giandomenico Spezzano, Domenico Talia
Venue: Virtual shared memory for distributed architectures (2001)

Cellular automata can be used to design high-performance applications in several science and engineering fields. This paper describes the development of scientific applications using CARPET, a high-level programming language based on the cellular automata theory. CARPET is a programming language designed for supporting the development of parallel high-performance software abstracting from the parallel architecture on which programs run. It exploits the computing power of a highly parallel computer while releasing a user from using explicit parallel constructs. A CARPET implementation has been used for programming cellular algorithms in the CAMEL parallel environment. A CARPET user may write programs to describe the actions of a very large number of simple active agents interacting locally. During execution the CARPET run-time environment allows a user to observe, also in a graphical format, the global results that arises from parallel execution. Aider describing the main constructs of CARPET, the paper discusses how the language can be effectively utilized to solve real-world complex problems, such as landslide simulations, and it shows performance figures.
Wrapping WWW Information Sources
Authors: Matthew Montebello
Venue: Proceedings of the 2000 International Symposium on Database Engineering & Applications (2000)

As information over the World-Wide Web (WWW) is proliferating rapidly and the demand to access it is also escalating, the need to efficiently and effectively make use of the various knowledge resources is highly imperative. Research to extract maximum benefit from the Internet is still in its infancy. Different research areas like data mining, information retrieval, machine learning and knowledge discovery, are giving the problem due attention and all seem to converge onto a common theme-wrappers. Wrappers provide access to heterogeneous information sources by converting or translating queries into source specific queries or commands. We discuss improvements on a distinctive approach, wrapper conduction, to automatically generate a wrapper once an information source has been identified. We will show how different information filtering systems we developed employ numerous Internet information sources in an attempt to exploit this knowledge base by automatically wrapping the source to safeguard the evolvability of the same system once new sources become available on the WWW. We examine and compare the performance these systems achieved when employing wrapper-conducted queries in contrast to tailored hand-coded ones; comparative results are presented.
The influence of parameters and structure of PI-type fuzzy-logic controller on DC drive system dynamics
Authors: Teresa Orlowska-Kowalska, Krzysztof Szabat, Krzysztof Jaszczak
Venue: Fuzzy Sets and Systems (2002)

The paper presents an analysis of the dynamical properties of the DC drive system with a fuzzy-logic speed controller in the presence of a wide-range changes of the drive system inertia. The influence of PI-type fuzzy controller parameters (scaling factors) and structure (membership functions location and shape) on the dynamics of speed control loop was tested in the presence of disturbances caused by the inertia load torque changes. The possibilities of this disturbance compensation using the on-line tuning of a chosen controller scaling factor or the modification of its membership function's shape were analysed. Drive system responses for both proposed strategies were illustrated by simulation results. These approaches have ensured the desired dynamics of the drive system operation for the wide range of disturbances caused by the drive system inertia changes.
Obstacle-free geocasting protocols for single/multi-destination short message services in ad hoc networks
Authors: Chih-Yung Chang, Chao-Tsun Chang, Shin-Chih Tu
Venue: Wireless Networks (2003)

Mobile ad hoc networks (MANET) comprise mobile hosts in a network bereft of base stations and characterized by a highly dynamic network topology. The MANET environment contains unpredictable obstacles, such as mountains, lakes, buildings, or regions without any hosts, impeding or blocking message relay. This study proposes geocasting protocols for sending short message from a source host to single or multiple geocasting regions in ad hoc networks. The proposed protocols keep messages away from unpredictable obstacles and create a small flooding region. Experimental results show that a source host can send a short message to all hosts located in single or multiple geographical areas with a high success rate and low flooding overhead.
A real-time process algebra with open intervals and maximal progress
Authors: Harald Fecher
Venue: Nordic Journal of Computing (2001)

Many real-time process algebras have the maximal progress assumption. In those process algebras, the time intervals in which actions are enabled are left-closed. This paper presents a process algebra that satisfies the maximal progress assumption and allows left-open intervals. A non-observable time step is introduced to model the time when an urgent action enabled in interval (0,1) is taken. Furthermore, we have to distinguish between observable actions and actions which only get enabled after a non-observable time step. This is necessary, since the latter actions may only produce internal actions. The distinction is done by extending the set of actions by marked actions.The real-time process algebra presented here is an extension of Milner's CCS. This algebra can be used to model dynamic priority of actions at the same point in time. We introduce various equivalence relations based on bisimulation.
Topologically constrained logic synthesis
Authors: Subarnarekha Sinha, Alan Mishchenko, Robert K. Brayton
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

SPFDs, a mechanism for expressing flexibility during logic synthesis, were first introduced for FPGA synthesis. They were then extended to general, combinational Boolean networks and later the concept of sequential SPFDs was introduced. In this paper, we explore the idea of using SPFDs for functional decomposition. A new type of functional decomposition called topologically constrained decomposition is introduced. An algorithm is provided for solving this problem using SPFDs. Preliminary experimental results are encouraging and indicate the feasibility of the approach. A scheme is also presented for generating instances of the topologically constrained decomposition problem.
A Decentralized, Smart Market Solution to a Class of Back-Haul Transportation Problems: Concept and Experimental Test Beds
Authors: Paul J. Brewer, Charles R. Plott
Venue: Interfaces (2002)

Back-haul problems occur in many areas of transportation. One-way rental often takes equipment, such as cases and containers, from an area of high demand to an area of low demand. The problem is to return the equipment to the location of need, a problem typically viewed as an administrative and scheduling problem. We developed a decentralized approach in which a specially designed market organizes competition and information to minimize the cost of back-hauls without the direct intervention of administrative negotiations or command-and-control types of scheduling. We employed laboratory experimental methods to test the concept, examine its performance against theoretical benchmarks, and explore its limitations.
On a variational inequality for a degenerate quasilinear hyperbolic equation
Authors: Mohammed Aassila
Venue: Applied Mathematics and Computation (2003)

We study a unilateral problem for the nonhomogeneous degenerated Kirchhoff equation with a blowing up term. Making use of the penalty method and Galerkin's approximations, we establish global existence and uniqueness theorems.
What are the Most Critical Challenges to Integrating High Assurance Systems?
Authors: Herbert Hecht
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

The integrator of any software intensive system is always faced with potential inconsistencies among components in variable naming or formats, coding conventions, array dimensions, and update frequency. The panel will address the additional challenges that arise in high assurance systems, including inconsistencies in the following: Dependability requirements such as: maximum allowable frequency for certain types of failures (a product requirement) vs. CMM level specifications for a component (a process requirement) Exception handling safety critical exception handling provided within a component can be defeated by actions of an operating system or scheduler Assumptions about "safe states" a system level requirement for "maintain prior value" does not necessarily propagate into a "maintain prior value" for a valve position command Verification practices widely varying practices for design and code inspections, for test termination criteria at unit and acceptance level, and for test case generation at all levels Generic verification problems-all high assurance systems face challenges in verifying that required levels of safety, reliability and security have been met.The panelists will be addressing one or more of these bullets in terms of the experience in their environment.
A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies
Authors: Sabyasachi Mitra, Ishwar Murthy
Venue: INFORMS Journal on Computing (1998)

Topological design of communication networks has been well examined in the literature. However, most of these studies focus on nonhierarchical networks where all nodes are considered equivalent from a routing perspective. It is well recognized, however, that hierarchical topologies offer several advantages for remote office internetworking. In this article, we provide a mixed integer programming formulation for designing hierarchical topologies. We also provide an interesting solution strategy that incorporates valid inequalities within a dual ascent framework to obtain tight lower bounds and feasible solutions to the problem. Computational experiments with a Fortran implementation of the procedure are also reported.
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
Authors: Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh
Venue: INFORMS Journal on Computing (1999)

We investigate several complexity issues related to branchand-cut algorithms for 0-1 integer programming based on lifted cover inequalities (LCIs). We show that given a fractional point, determining a violated LCI over all minimal covers is NP-hard. The main result is that there exists a class of 0-1 knapsack instances for which any branch-and-cut algorithm based on LCIs has to evaluate an exponential number of nodes to prove optimality.
How sweet it is! a course in cocoa
Authors: Michael P. Rogers
Venue: Journal of Computing Sciences in Colleges (2003)

Cocoa is an application framework, a collection of integrated classes designed to make it easy to assemble an application with minimal effort. As with all well-designed frameworks, it hides the details of the application, enabling the developer to concentrate on those aspects that are unique to his or her program.Our overarching goal is to describe Cocoa in sufficient detail to persuade teachers to adopt it in the classroom. To this end, we begin with an overview of the framework itself, and the underlying, "native" language of Cocoa - Objective-C. We thendescribe the sublimely powerful tools used to develop Cocoa applications. Finally, we illustrate the use of these tools in the context of "Aviation Weather Fetcher", a complicated application that requires a surprisingly small amount of code. Throughout, we offer compelling pedagogic and practical reasons for offering a course in Cocoa.
Stability of Multiclass Queueing Networks Under Priority Service Disciplines
Authors: Hong Chen, Hanqin Zhang
Venue: Operations Research (2000)

In this paper, we establish a sufficient condition for the stability of a multiclass fluid network and queueing network under priority service disciplines. The sufficient condition is based on the existence of a linear Lyapunov function, and it is stated in terms of the feasibility of a set of linear inequalities that are defined by network parameters. In all the networks we have tested, this sufficient condition actually gives a necessary and sufficient condition for their stability.
Affine invariant descriptors for color images using Fourier series
Authors: Ahmed El Oirrak, Mohamed Daoudi, Driss Aboutajdine
Venue: Pattern Recognition Letters (2003)

In this paper we use Fourier series to produce normalized coefficients for color images which are invariant under any affine transformation. In the reference [Pattern Recogn. Lett., 23 (2002) 1109], the proposed algorithm is developed to be applied to shape extracted from binary images, thus it is used to discriminate objects based only on their shape similarity. That means that it is unable to discriminate two objects with the same shape but different colors and textures. It is known also that the shape extraction is not an easy and well-solved problem. The present paper addresses the problem of constructing invariants and motion estimates using both shape and color informations. The quantitative evaluation of the proposed approach shows promising results.
Simple Probabilistic Evaluation of Portfolio Strategies
Authors: Yannis Pavlis, Markos Papageorgiou, William B. Poland
Venue: Interfaces (1999)

An important part of evaluating portfolio strategies is calculating probability distributions of key value measures, such as the net present value (NPV) of free cash flow. This task can be computationally daunting when the portfolio consists of many businesses or assets, so we have applied an approximate method that quickly captures the location, spread, and tilt (mean, variance, and skewness) of the portfolio distribution. We have also developed displays of the results that nontechnical senior managers can understand readily. These techniques allowed us to interactively explore portfolio strategies with the executive team of a packaging and plastics company comprising 20 businesses and to identify strategies with the potential to more than double NPV with reduced risk. We have since applied these techniques successfully in the pharmaceutical, oil and gas, telecommunications, chemical, and entertainment industries.
Special prime numbers and discrete logs in finite prime fields
Authors: Igor A. Semaev
Venue: Mathematics of Computation (2002)

A set A of primes p involving numbers such as abt + c, where |a|, |b|, |c| = O(1) and t → ∞, is defined. An algorithm for computing discrete logs in the finite field of order p with p ∈ A is suggested. Its heuristic expected running time is Lp[1/3; (32/9)1/3] for (32/9)1/3 = 1.526..., where Lp[α; β] = exp((β + o(1))lnα p(ln ln p)1-α) as p → ∞, 0 < α < l, and 0 < β. At present, the most efficient algorithm for computing discrete logs in the finite field of order p for general p is Schirokauer's adaptation of the Number Field Sieve. Its heuristic expected running time is LP[1/3 (64/9)1/3] for (64/9)1/3 = 1.9229... Using p ∈ A rather than general p does not enhance the performance of Schirokauer's algorithm. The definition of the set A and the algorithm suggested in this paper are based on a more general congruence than that of the Number Field Sieve. The congruence is related to the resultant of integer polynomials. We also give a number of useful identities for resultants that allow us to specify this congruence for some p.
Replacing IDDQ Testing: With Variance Reduction
Authors: C. Thibeault
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This work is part of our effort to find an alternative to IDDQ testing. Specifically, this paper presents our variance reduction post-processing approach in order to replace IDDQ. It describes our test procedure based on Delta IDDQ histograms. It shows how this test procedure can help to reduce variance, optimize test resources and reduce the impact of process drifting and resolution loss caused by the expected IDDQ growth. Another practical aspect is discussed, namely the use of the proposed test procedure in a production test. We propose a new distribution model and revisit some experimental data, which provides a better understanding of the relationship between defect and fault. The results obtained so far confirm the pertinence of our test approach and the necessity of keeping current testing alive.
Semantic computation in a Chinese question-answering system
Authors: Sujian Li, Jian Zhang, Xiong Huang, Shuo Bai, Qun Liu
Venue: Journal of Computer Science and Technology (2002)

This paper introduces a kind of semantic computation and present, how to combine it into our Chinese Question-Answering (QA) system. Based on two kinds of language resources, Hownet and Cilin, we present an approach to computing the similarity and relevancy between words. Using these results, we can calculate the relevancy between two sentences and then get the optimal answer for the query in the system. The calculation adopts quantitative methods and can be incorporated into QA systems easily, avoiding some difficulties in conventional NLP (Natural Language Processing) problems. The experiments show that the results are satisfactory.
An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
Authors: Takashi Akamatsu
Venue: Transportation Science (2001)

This paper presents an efficient algorithm for solving the dynamic user equilibrium (DUE) traffic assignment with a one-to-many origin-destination (OD) pattern. To achieve the efficiency of the algorithm, we employ the following three strategies. First, we exploit the decomposition property of the DUE assignment with respect to the departure time from an origin; we consider the algorithm that solves each of the decomposed DUE assignments sequentially. Second, we represent the decomposed DUE assignment by an arc-node formulation, not by using path variables. Third, we take advantage of the fact that the decomposed DUE assignment reduces to (finite dimensional) nonlinear complementarity problems (NCPs); we develop the algorithm based on the globally convergent Newton's method for general NCPs. These strategies, together with graph theoretic devices, enable us to design a new algorithm which does not require path enumeration and is capable of dealing with very large-scale networks. Numerical experiments disclose that the proposed algorithm solves the DUE assignment very rapidly, even in large-scale networks with some thousands of links and nodes where conventional heuristic algorithms do not converge to the accurate equilibrium solution.
Evaluating defect estimation models with major defects
Authors: S. Biffl
Venue: Journal of Systems and Software (2003)

Based on defect data from an inspection the number of defects present in a software product can be estimated to decide on further development or quality assurance activities. Project managers are primarily interested to determine the number of major defects in the product, which may have a strong impact on product quality as well as on project schedule and cost, if they go undetected.In this work we focus on the estimation of major defects in a software requirements document. We compare the performance of objective and subjective defect content estimation techniques. For validation of the techniques we conducted a controlled experiment with 31 inspection teams which consisted of 4-6 persons.Main findings of the experiment are: (a) Objective estimation models estimated major and all defects with similar accuracy. (b) The best subjective estimations models performed for major defects comparable to the best objective estimation models. (c) The defect detection technique used influenced the set of defects found in the team, but did not make a significant difference for the accuracy of defect estimation. (d) The second inspection cycle significantly improved the estimation accuracy for all but one estimation models.
The role of context in question answering systems
Authors: Jimmy Lin, Dennis Quan, Vineet Sinha, Karun Bakshi, David Huynh, Boris Katz, David R. Karger
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Despite recent advances in natural language question an-swering technology, the problem of designing effective user interfaces has been largely unexplored. We conducted a user study to investigate the problem and discovered that overall, users prefer a paragraph-sized chunk of text over just an exact phrase as the answer to their questions. Fur-thermore, users generally prefer answers embedded in con-text, regardless of the perceived reliability of the source documents. When users research a topic, increasing the amount of text returned to users significantly decreases the number of queries that they pose to the system, suggesting that users utilize supporting text to answer related ques-tions. We believe that these results can serve to guide future developments in question answering user interfaces.
30,000 hits may be better than 300: precision anomalies in internet searches
Authors: Caroline M. Eastman
Venue: Journal of the American Society for Information Science and Technology (2002)

Results of searches using a variety of query formulations with several Internet search engines show that strategies intended to give narrower and more precise results may not give improvements in precision even though they result in fewer hits. Searches were performed by students in graduate information retrieval courses using different formulations for the same topic.
Rendezvous Search on the Line
Authors: Arthur Hsu, Yehuda Bassok, Nicolas P. B. Bollen, Liqun Qi, Scott Webster, J. V. Howard, Shmuel Gal
Venue: Operations Research (1999)

We present two new results for the asymmetric rendezvous problem on the line. We first show that it is never optimal for one player to be stationary during the entire search period in the two-player rendezvous. Then we consider the meeting time of n-players in the worst case and show that it has an asymptotic behavior of n = 2 + O(log n).
Modelling of toxic mercury in coastal seas: case study: Yatsushiro Sea, Japan
Authors: R. Rajar, M. Cetina, D. Zagar, H. Akagi, S. Yano, T. Tomiyasu, M. Horvat
Venue: Development and application of computer techniques to environmental studies (2002)

After the well-known mercury contamination of the Minamata Bay around 1956, measurements of mercury content in the bottom sediment of the neighboring Yatsushiro Sea have shown, that some mercury has been transported from the Minamata Bay into the Yatsushiro Sea. To understand the phenomenon, and to help at the environmental protection, simulations of current velocities in the Yatsushiro Sea have been done. They are further on used for calculation of mass balance in the Minamata Bay, where the potential sources of Hg and their relative magnitudes are shown. By combining measurements with hydrodynamic and Hg cycling modelling, meaningful predictions for future behavior of Hg in both Minamata Bay and Yatsushiro Sea are possible.