ppxscal/embedding_network huggingface dataset:
Macrosystems Models of Dynamic Stochastic Networks
Authors: Yu. S. Popkov
Venue: Automation and Remote Control (2003)

The state-of-the-art of the worldwide web (Internet) and its short-range development (GRID), on the one hand, offer to the user wide possibilities of accessing not only the international information resources, but the computational resources as well, and, on the other hand, give rise to a number of problems of system nature. GRID was considered as a dynamic stochastic network whose state is characterized by the spatial distributions of the information-and-computation resources and information flows. The time profiles of these components of state feature essentially different times of relaxation. This distinction of the network enables one to adapt and develop the concepts of the macrosystem approach for studying the space-time evolution of the GRID state. Proposed were models of the states of the local-stationary network that rely on the generalized principle of entropy maximization. They make an integral part of the evolutionary model of information-and-computation resources which is classified with the positive dynamic systems with an entropy operator.
Poster abstract: mantis - system supports for multimodAl NeTworks on In-Situ sensors
Authors: Hector Abrach, Shah Bhatti, Jim Carlson, Hui Dai, Jeff Rose, Anmol Sheth, Brian Shucker, Jing Deng, Richard Han
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

The MANTIS MultimodAl system for NeTworks of In-situ wireless Sensors provides a new multithreaded embedded operating system integrated with a general-purpose single-board hardware platform to enable flexible and rapid prototyping of wireless sensor networks.
Facilitate knowledge communications
Authors: Weihong Huang, Ting Tao, Mohand-Saïd Hacid, Alain Mille
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

With current multimedia information management techniques, the knowledge communications among users in multimedia e-Learning environments are still limited at a relative low single type media servicing level. New developments in multimedia knowledge discovery, representation and integration are needed to improve the intelligence of the knowledge management and communications at the semantic level. This paper proposes a novel contextual knowledge management framework to improve the current isolated learning information retrieval and communication status, by enabling flexible knowledge representation beyond heterogeneous multimedia learning resources and facilitating multilevel knowledge communications between instructors and learners. Based on knowledge communication model analysis in university e-Learning environments, a contextual knowledge representation model is presented. Corresponding knowledge retrieval techniques are discussed afterwards. To demonstrate the proposed concepts and techniques, a case study in a virtual scenario-based learning environment shows how the presented framework works with existing e-Learning content description standards and multimedia information retrieval techniques, and consequently enables a semantic-based interactive learning environment.
Using Discriminant Analysis for Multi-class Classification
Authors: Tao Li, Shenghuo Zhu, Mitsunori Ogihara
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Discriminant analysis is known to learn discriminativefeature transformations. This paper studies its use in multi-classclassification problems. The performance is tested ona large collection of benchmark datasets.
Software Development Worldwide: The State of the Practice
Authors: Michael Cusumano, Alan MacCormack, Chris F. Kemerer, Bill Crandall
Venue: IEEE Software (2003)

The worldwide boom in IT use has spurred software development efforts around the globe. The authors' research program focuses on collecting quantitative data about several countries' current practices and performance, their adoption of competing models of software development, and analysis of the impact of these practices on performance. The authors surveyed 104 software development projects in India, Japan, Europe, and the US.
Next generation context aware adaptive services
Authors: Owen Conlan, Ruaidhrí Power, Steffen Higel, Declan O'Sullivan, Keara Barrett
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Situational information can enrich the interactions between a user and the services they wish to utilize. Such information encompasses details about the user, the physical environment and the computing resources. There are at least three key aspects in addressing this issue. Firstly, it is important to accurately capture or infer the requirements of the users in a timely fashion. Without precise information on what the users are hoping to achieve it is difficult to identify suitable services or sub-services that may fulfill (in part or fully) their information needs. Secondly, the nature of the available services determines the modes in which they may be adapted to the users' needs. Rigid, inflexible services may be difficult to tune to the information requirements of the users. Adaptive services, on the other hand, are well suited to dynamically modifying their behavior, within defined constraints. The third issue to be addressed is the on-the-fly combination of services to meet the users' requirements. This paper argues that current modeling (both of users and services) techniques, adaptive axes and personalization techniques used in current personalized information services, such as Adaptive Hypermedia Systems, may supply the basis for next generation adaptive collaborative services.
Using discrete-time techniques to test continuous-time models for nonlinearity in drift
Authors: R. Becker, A. S. Hurn
Venue: Mathematics and Computers in Simulation (2004)

This paper examines whether or not a discrete-time econometric test for nonlinearity in mean may be used in cases where the data are believed to be generated in continuous time. It is demonstrated that appropriate bootstrapping techniques are required to yield a test statistic with sensible statistical properties. The technique is demonstrated by using it to examine 7-day Eurodollar rates for nonlinearity in mean.
Reducing code size with echo instructions
Authors: Jeremy Lau, Stefan Schoenmackers, Timothy Sherwood, Brad Calder
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

In an embedded system, the cost of storing a program on-chip can be as high as the cost of a microprocessor. Compressing an application's code to reduce the amount of memory required is an attractive way to decrease costs. In this paper, we examine an executable form of program compression using echo instructions.With echo instructions, two or more similar, but not necessarily identical, sections of code can be reduced to a single copy of the repeating code. The single copy is left in the location of one of the original sections of the code. All the other sections are replaced with a single echo instruction that tells the processor to execute a subset of the instructions from the single copy.We present results of using echo instructions from a full compiler and simulator implementation that takes input programs, compresses them with echo instructions, and simulates their execution. We apply register renaming and instruction scheduling to expose more similarities in code, use profiles to guide compression, and propose minor architectural modifications to support echo instructions. In addition, we compare and combine echo instructions with two prior compression techniques: procedural abstraction and IBM's CodePac.
Managing process compliance
Authors: Larry Y. C. Cheung, Paul W. H. Chung, Ray J. Dawson
Venue: Information management: support systems & multimedia technology (2003)

The current best practice of providing reliable systems is to embody the development process in recent industry standards and guidelines, such as IEC61508 for safety and ISO9001 for quality assurance. These standards are generic, but every application is different because of the differences in project details. While current workflow systems have been used successfully in managing "administrative" process for some time, current products lack the ability to ensure that a process is planned and performed such that it complies with an industry standard that is necessary to support particular engineering processes. This chapter presents a Compliance Flow Workflow System for managing processes. Model-based reasoning is used to identify the compliance errors of a process by matching it against the model of standards used. Some examples drawing on a draft version IEC61508 are used to illustrate the mechanism of modeling and compliance checks.
Modified ST algorithms and numerical experiments
Authors: Cosmo D. Santiago, Jin-Yun Yuan
Venue: Applied Numerical Mathematics (2003)

Recently Golub and Yuan [BIT 42 (2002) 814] proposed the ST decomposition for matrices. However, its numerical stability has not been discussed so far. Here we present preliminary investigations on the numerical behavior of the ST decomposition. We also propose modifications (modified algorithm) to improve the algorithm's numerical stability. Numerical tests of the Golub-Yuan algorithm and our modified algorithm are given for some famous test matrices. All tests include comparisons with the LU (or Cholesky) decomposition without pivoting. These numerical tests indicate that the Golub-Yuan algorithm and its modified version possess reasonable numerical stability. In particular, the modified algorithm is stable for sparse matrices. Moreover, it is more stable than the Golub-Yuan algorithm in the case of dense matrices.
Programming Oracle Triggers and Stored Procedures
Authors: Kevin Owens
Venue:  (2003)

Complete tutorial for database developers! Thorough coverage of PL/SQL Practical "cookbook" techniquesEffectively create and manage complex databases with Oracle! Systems and database expert Kevin Owens explores PL/SQL, Oracle's answer to the Structured Query Language (SQL), and teaches you what you need to know to build robust and complex databases for your business.Using easy-to-follow instructions and examples, this book presents techniques to take advantage of Oracle features such as triggers and stored procedures-features that allow your databases to incorporate business rules which are easy to manage and modify as the business evolves. Topics covered include: Viewing constraints in the data dictionary Complex rule enforcement PL/SQL program units and language features Data types and composite structure Error handling and exceptions Inter-process communications Declarative constraints, including primary key, unique, foreign key, check, and much moreProgramming Oracle Triggers and Stored Procedures, Third Edition, is an invaluable resource for database developers, designers, and project leaders looking to build and maintain truly intelligent, complex databases
Tangible multimodal interfaces for safety-critical applications
Authors: Philip R. Cohen, David R. McGee
Venue: Communications of the ACM (2004)

Designing effective digital systems in safety-critical arenas takes interfaces inspired by, or included in, the physical world.
Are multiagent algorithms relevant for real hardware?: a case study of distributed constraint algorithms
Authors: Paul Scerri, Jay Modi, Wei-Min Shen, Milind Tambe
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Researchers building multi-agent algorithms typically work with problems abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigations of new algorithms. However, a key question is how to apply algorithm, developed on an abstract problem, in a real application. In this paper, we report on what was required to apply a particular distributed resource allocation algorithm developed for an abstract coordination problem in a real hardware application. A probabilistic representation of resources and tasks was used to deal with uncertainty and dynamics and local reasoning was used to deal with delays in the distributed resource allocation algorithm. The probabilistic representation and local reasoning enabled the use of the multi-agent algorithm which, in turn, improved the overall performance of the system.
Decomposing data machines
Authors: Wayne Wolf
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a new FSM decomposition algorithm which extracts a data register from a given FSM. The algorithm is a generalization of the standard minimization algorithm--it selects output values which, when stored in a separate data register, will make additional states in the control machine equivalent. Experimental results show that the algorithm is both effective and fast.
Analysis of the convergence behavior of the static localized nonlinear approximation for a problem in electromagnetism
Authors: Donald A. French
Venue: Journal of Computational and Applied Mathematics (2003)

A study of the convergence behavior of the static localized nonlinear approximation (SLN) introduced by Habashy et al. (J. Geophys. Res. 98 (1993) 1759) is furnished for a specific case of the time-harmonic Maxwell equations. Some asymptotics are used to explain the robustness of this scheme in the high-conductivity case.
The data mining approach to automated software testing
Authors: Mark Last, Menahem Friedman, Abraham Kandel
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests only. Evaluation of test outputs is also associated with a considerable effort by human testers who often have imperfect knowledge of the requirements specification. Not surprisingly, this manual approach to software testing results in heavy losses to the world's economy. The costs of the so-called "catastrophic" software failures (such as Mars Polar Lander shutdown in 1999) are even hard to measure. In this paper, we demonstrate the potential use of data mining algorithms for automated induction of functional requirements from execution data. The induced data mining models of tested software can be utilized for recovering missing and incomplete specifications, designing a minimal set of regression tests, and evaluating the correctness of software outputs when testing new, potentially flawed releases of the system. To study the feasibility of the proposed approach, we have applied a novel data mining algorithm called Info-Fuzzy Network (IFN) to execution data of a general-purpose code for solving partial differential equations. After being trained on a relatively small number of randomly generated input-output examples, the model constructed by the IFN algorithm has shown a clear capability to discriminate between correct and faulty versions of the program.
Cellular number portability: really such a big deal?
Authors: Kenneth G. Robinson
Venue: Ubiquity (2003)

The FCC ruling on number portability may have little effect on an already competitive market.
An Immersed Interface Method for Solving Anisotropic Elliptic Boundary Value Problems in Three Dimensions
Authors: Miguel A. Dumett, James P. Keener
Venue: SIAM Journal on Scientific Computing (2003)

We have developed a first-order stable Cartesian grid discretization that uses only interior grid points for inhomogeneous anisotropic elliptic operators subject to Neumann boundary conditions on a bounded nonrectangular geometry in three dimensions. For this discretization method, a necessary and sufficient condition depending on the mesh size h for the existence of this first-order stable scheme at a regular (i.e., interior) grid point is found in terms of the anisotropy matrix. For this discretization method, a way to analyze the existence of a first-order stable scheme at an irregular (i.e., boundary) grid point is also given. The arguments are identical to those for the two-dimensional case [M. A. Dumett and J. P. Keener, A Numerical Method for Solving Anisotropic Elliptic Boundary Value Problems on an Irregular Domain in 2D, manuscript]; only the details change. Unlike in [M. A. Dumett and J. P. Keener, A Numerical Method for Solving Anisotropic Elliptic Boundary Value Problems on an Irregular Domain in 2D, manuscript], a discussion of Dirichlet and Robin boundary conditions is also included. In particular, it is shown that the Gerschgorin condition does not impose sign restrictions on irregular grid points stencil coefficients as in the Neumann case.
How efficiently can room at the bottom be traded away for speed at the top?
Authors: Pilar De La Torre
Venue: Natural Computing: an international journal (2003)

Given exponential 2n space, we know that an Adleman-Lipton computation can decide many hard problems &ndash; such as boolean formula and boolean circuit evaluation &ndash; in a number of steps that is linear in the problem size n. We wish to better understand the process of designing and comparing bio-molecular algorithms that trade away weakly exponential space to achieve as low a running time as possible, and to analyze the efficiency of their space and time utilization relative to those of their best extant classical/bio-molecular counterparts. We propose a randomized framework which augments that of the sticker model of Roweis et al. to provide an abstract setting for analyzing the space-time efficiency of both deterministic and randomized bio-molecular algorithms. We explore its power by developing and analyzing such algorithms for the Covering Code Creation (CCC) and k-SAT problems. In the process, we uncover new classical algorithms for CCC and k-SAT that, while exploiting the same space-time trade-off as the best previously known classical algorithms, are exponentially more efficient than them in terms of space-time product utilization. This work indicates that the proposed abstract bio-molecular setting for randomized algorithm design provides a logical tool of independent interest.
An OO methodology based on the unified process for GIS application development
Authors: Jesús D. Garcia-Consuegra
Venue: Practicing software engineering in the 21st century (2003)

This chapter introduces an object-oriented methodology for Geographical Information Systems (GIS) development. It argues that a COTS-based development methodology combined with the UML, can be extended to support the spatiotemporal peculiarities that characterize GIS applications. The author hopes that by typifying both enterprises and developments, and, with a thorough knowledge of the software component granularity in the GIS domain, it will be possible to extend and adapt the proposed COTS-based methodologies to cover the full lifecycle. Moreover, some recommendations are outlined to translate the methodology to the commercial iCASE Rational Suite Enterprise and its relationships with tool kits proposed by some GIS COTS vendors.
A low-power charge-recycling ROM architecture
Authors: Byung-Do Yang, Lee-Sup Kim
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

This paper describes a newly proposed low-power charge-recycling read-only memory (CR-ROM) architecture. The CR-ROM reduces the power consumption in bit lines, word lines, and precharge lines by recycling the previously used charge. In the proposed CR-ROM, bit-line swing voltage is lowered by the charge recycling between bit lines. When N bit lines recycle their charges, the swing voltage and the power of the bit lines become 1/N and 1/N2 compared to the conventional ROMs, respectively. As the number of N increases, the power saving in bit lines becomes salient. Also, power consumption in word lines and precharge lines can be reduced theoretically to half by the proposed charge-recycling techniques. The simulation results show that the CR-ROM consumes 60%~85% of the conventional low-power ROMs with 1 K × 32 b. A CR-ROM with 32 kb was implemented in a 0.35-µm CMOS process. The power dissipation is 6.60 mW at 100 MHz with 3.3 V and the maximum operating clock frequency is 150 MHz.
Fault Tolerance of Programmable Switch Blocks
Authors: J. Huang, M. B. Tahoori, F. Lombardi
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

This paper presents a new approach for the evaluation of FPGA routing resources in the presence of faulty switches. This is considered under the worst case scenario of open faults. Signal routing in the presence of faulty switches is analyzed at switch block level; probabilistic routing (routability) is used as figure of merit for evaluating the interconnect resources of FPGAs. The presented approach utilizes a path-based technique to find the probability of establishing a path between pairs of input and output endpoints in a switch block. The results are reported for various commercial and academic FPGAs.
Information System Using Remote Aerospace Archive
Authors: A. V. Veselovskii, A. N. Plate
Venue: Automation and Remote Control (2003)

A system of interaction and exchange of information on natural sciences between the Center of Aerospace Information and the Institute of Geology of Ore Deposits, Petrography, Mineralogy, and Geochemistry of the Russian Academy of Sciences was prototyped between 1999 and 2002 by a team of researchers and experts. It is based on the latest advances in communications and geoinformatics and intended for significant strengthening of the scientific and technical support of the fundamental studies in the field of Earth sciences. In contrast to the current practice of this country, not only catalogs of aerospace photos are transmitted through the remote links, but also full digital images. Metadata offer a convenient graphic interface to the user. A mathematical model was developed for estimating the throughput of the Internet link connecting the aerospace archive with the local computer network of the Institute of Geology. The calculations performed enabled one to establish the necessary characteristics and construct a fiber-optic link for the prototyped information system.
The effect of latency on user performance in Warcraft III
Authors: Nathan Sheldon, Eric Girard, Seth Borg, Mark Claypool, Emmanuel Agu
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Latency on the Internet is a well-known problem for interactive applications. With the increase in interactive network games comes the increased importance of understanding the effects of latency on user performance. Classes of network games such as First Person Shooters (FPS) and Real Time Strategy (RTS) differ in their user interaction model and hence susceptibility to latency. While previous work has measured the effects of latency on FPS games, there has been no systematic investigation of the effects of latency on RTS games. In this work, we design and conduct user studies that measure the impact of latency on user performance in Warcraft III, a popular RTS game. As a foundation for the research, we separated typical Warcraft III user interactions into the basic components of explore, build and combat, and analyzed each individually. We find modest statistical correlations between user performance and latency for exploration, but very weak correlations for building and combat. Overall, the effect of even very high latency, while noticeable to users, has a negligible effect on the outcome of the game. We attribute this somewhat surprising result to the nature of RTS game-play that clearly favors strategy over the real-time aspects.