ppxscal/embedding_network huggingface dataset:
Functional Validation in Grid Computing
Authors: Guofei Jiang, George Cybenko
Venue: Autonomous Agents and Multi-Agent Systems (2004)

The development of the World Wide Web has changed the way we think about information. Information on the web is distributed, updates are made asynchronously and resources come online and go offline without centralized control. Global networking will similarly change the way we think about and perform computation. Grid computing refers to computing in a distributed networked environment where computing and data resources are located throughout a network. In order to locate these resources dynamically in a grid computation, a broker or matchmaker uses keywords and ontologies to describe and specify grid services. However, we believe that keywords and ontologies can not always be defined or interpreted precisely enough to achieve deep semantic agreement in a truly distributed, heterogeneous computing environment. To this end, we introduce the concept of functional validation. Functional validation goes beyond the symbolic level of brokering and matchmaking, to the level of validating actual functional performance of grid services. In this paper, we present the functional validation concept in grid computing, analyze the possible validation situations and apply basic machine learning theory such as PAC learning and Chernoff bounds to explore the relationship between sample size and confidence in service semantics.
A Tuned Wideband LNA in 0.25µm IBM Process For RF Communication Applications
Authors: M. Benmansour, P. R. Mukund
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper discusses the design of a low noise amplifiertunable over a wide range of frequencies. The LNA isdesigned for a frequency band 1.4 Ghz - 2 Ghz andprovides an output return loss, S22, less than -24 dB, aninput return loss, S11, less than -10 dB, a gain of 11.5 dBand noise figure between 1.8 - 3.4 dB. The LNA has beenimplemented in 0.25µm CMOS IBM process, with a 2.5Vpower supply.
In their own words: CIO visions about the future of in-house IT organizations
Authors: Blaize Horner Reich, Kay M. Nelson
Venue: ACM SIGMIS Database (2003)

This research investigated CIOs'view of the changes driving and occurring in their in-house IT organizations. Results of interviews with 50 CIOs and IT leaders from 22 organizations in Canada and the U.S. suggest three main drivers of change for in-house IT organizations: rapid strategic business change, pervasive IT with an experienced user community, and e-business and technology complexity. These drivers are creating changes in all parts of the IT organization: structure and roles, application development, technology architectures, and skills and knowledge of IT practitioners. According to CIOs, their virtual, global IT organizations need to move even closer towards the strategic centre of the company, requiring increased business knowledge, improved ability to influence and negotiate, and a renewed focus on standardized architectures, metrics, and value creation.
Testing applications with Xnee
Authors: Henrik Sandklef
Venue: Linux Journal (2004)

Give your GUI apps a scriptable test suite with simulated X clicks and input.
CloseGraph: mining closed frequent graph patterns
Authors: Xifeng Yan, Jiawei Han
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Recent research on pattern discovery has progressed form mining frequent itemsets and sequences to mining structured patterns including trees, lattices, and graphs. As a general data structure, graph can model complicated relations among data with wide applications in bioinformatics, Web exploration, and etc. However, mining large graph patterns in challenging due to the presence of an exponential number of frequent subgraphs. Instead of mining all the subgraphs, we propose to mine closed frequent graph patterns. A graph g is closed in a database if there exists no proper supergraph of g that has the same support as g. A closed graph pattern mining algorithm, CloseGraph, is developed by exploring several interesting pruning methods. Our performance study shows that CloseGraph not only dramatically reduces unnecessary subgraphs to be generated but also substantially increases the efficiency of mining, especially in the presence of large graph patterns.
Building a business simulation for kids: the making of Disney's hot shot business
Authors: Jason Everett
Venue: Computers in Entertainment (CIE) (2003)

This paper presents an overview of Hot Shot Business, a simulation game designed to teach basic business concepts and encourage entrepreneurship. It begins with a high-level discussion of the experience, and goes on to describe how the educational content is presented to the player as the game progresses. Special emphasis is placed on the important of play testing in the development process.
In vitro selection of non-cross hybridizing oligonucleotides for computation
Authors: Hong Bi, Junghuei Chen, Russell Deaton, Max Garzon, Harvey Rubin, David Harlan Wood
Venue: Natural Computing: an international journal (2003)

Since they minimize errors from cross-hybridizations, DNA oligonucleotides that anneal as designed are beneficial to DNA computing. By in vitro selection, huge libraries of non-crosshybridizing oligonucleotides might be evolved in the test tube. As a first step, a fitness function corresponding to non-crosshybridization was based upon the duplex stability of randomly matched oligonucleotides. By melting pairs that have a low thermal stability, a protocol based on DNA polymerization selectively amplifies maximally mismatched oligonucleotides over those that were more closely matched. Experiments confirmed this property of the protocol, and in addition, a reaction temperature window was identified in which discrimination between matched and mismatched might be obtained. The protocol was iterated on a set of random starting material, and there was evidence that non-crosshybridizing libraries were in fact being created. These results are a step toward practical manufacture of very large libraries of non-crosshybridizing oligonucleotides in the test tube.
Academia and industry meet: Some experiences of formal methods in practice
Authors: Guy H. Broadfoot, Philippa J. Broadfoot
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In this paper, we present an overview of our observationsand experiences of applying formal methods in industry.Our approach combines two existing and complimentaryformal methods, namely the Cleanroom Method [9, 13] andthe CSP framework [6, 14] together with its model checkerFDR. The problem we are interested in is the use of formalmethods to develop software systems of a business-criticaland untestable nature, where the software forms an essentialpart of some core product or service offered by a business.We argue that the successful implementation of suchsystems needs a more formal approach and reflect on whyformal methods are rarely used in practice. We discuss thecombination of Cleanroom and CSP, and show how they canbe applied to develop the control software that is embeddedin a complex manufacturing machine.
A parallel adaptive finite volume method for nanoscale double gates mosfets simulation
Authors: Yiming Li, Shao-Ming Yu, Pu Chen
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We propose a quantum correction transport model and apply a parallel adaptive refinement methodology to nanoscale semiconductor device simulation on a Linux cluster with MPI libraries. In the nano device simulation the quantum mechanical effect plays an important role. To model this effect a quantum correction Poisson equation is derived and replaced the classical one in the transport models. Our numerical method is mainly based on the adaptive finite volume method with a posteriori error estimation, constructive monotone iterative method, and domain decomposition algorithm. A 20 nm double-gate MOSFET is simulated with the developed simulator.
Modeling, Simulation, and Optimization of Traffic Flow Networks
Authors: M. Herty, A. Klar
Venue: SIAM Journal on Scientific Computing (2003)

A new model for highway traffic networks based on a detailed description of the junctions is presented. To obtain suitable conditions at the junctions, multilane equations are introduced and investigated. The new model is compared with currently known models for traffic flow networks for several situations. Finally, the model is used for network simulation and optimization.
MaPle: A Fast Algorithm for Maximal Pattern-based Clustering
Authors: Jian Pei, Xiaoling Zhang, Moonjung Cho, Haixun Wang, Philip S. Yu
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Pattern-based clustering is important in many applications,such as DNA micro-array data analysis, automaticrecommendation systems and target marketing systems.However, pattern-based clustering in large databasesis challenging. On the one hand, there can be a huge numberof clusters and many of them can be redundant and thusmake the pattern-based clustering ineffective. On the otherhand, the previous proposed methods may not be efficient orscalable in mining large databases.In this paper, we study the problem of maximal pattern-basedclustering. Redundant clusters are avoided completelyby mining only the maximal pattern-based clusters.MaPle, an efficient and scalable mining algorithm is developed.It conducts a depth-first, divide-and-conquer searchand prunes unnecessary branches smartly. Our extensiveperformance study on both synthetic data sets and real datasets shows that maximal pattern-based clustering is effective.It reduces the number of clusters substantially. Moreover,MaPle is more efficient and scalable than the previouslyproposed pattern-based clustering methods in mininglarge databases.
Lexical semantic techniques for corpus analysis
Authors: James Pustejovsky, Peter Anick, Sabine Bergler
Venue: Computational Linguistics (1993)

In this paper we outline a research program for computational linguistics, making extensive use of text corpora. We demonstrate how a semantic framework for lexical knowledge can suggest richer relationships among words in text beyond that of simple co-occurrence. The work suggests how linguistic phenomena such as metonymy and polysemy might be exploitable for semantic tagging of lexical items. Unlike with purely statistical collocational analyses, the framework of a semantic theory allows the automatic construction of predictions about deeper semantic relationships among words appearing in collocational systems. We illustrate the approach for the acquisition of lexical information for several classes of nominals, and how such techniques can fine-tune the lexical structures acquired from an initial seeding of a machine-readable dictionary. In addition to conventional lexical semantic relations, we show how information concerning lexical presuppositions and preference relations can also be acquired from corpora, when analyzed with the appropriate semantic tools. Finally, we discuss the potential that corpus studies have for enriching the data set for theoretical linguistic research, as well as helping to confirm or disconfirm linguistic hypotheses.
Community memory: a public information network
Authors: Ken Colstad, Efrem Lipkin
Venue: ACM SIGCAS Computers and Society (1975)

This brief summary of an article by Colstad and Lipkin is exerpted from the full length article which appeared in an IEEE proceedings. It is included here as an introduction to the next paper, Implications of Community Memory. Both papers illustrate a paradox which may be seen in many "people's computing" groups. While attempting to bring the computer into useful daily interaction with a variety of citizens for a variety of applications, such groups often unwittingly reinforce myths about computers which, as Berk notes, are a primary obstacle to social acceptance of the technology as a tool for society. Although the experiment and its acceptance are interesting, the myths of the computer as brain and the computer as question answering machine have not been dispelled by operation of the public information network. Perhaps the myths have been strengthened by the enthusiasm of the proponent groups.
A Monotonic On-Line Linear Algorithm for Hierarchical Agglomerative Classification
Authors: Andreea B. Dragut, Codrin M. Nichitiu
Venue: Information Technology and Management (2004)

We start from an algorithm for on-line linear hierarchical classification for multidimensional data, using a centroid aggregation criterion. After evoking some real-life on-line settings where it can be used, we analyze it mathematically, in the framework of the Lance&ndash;Williams algorithms, proving that it does not have some useful properties: it is not monotonic, nor space-conserving. In order to use its on-line capabilities, we modify it and show that it becomes monotonic. While still not having the internal similarity-external dissimilarity property, the worst case classifications of the new algorithm are correctable with an additional small computational effort, on the overall taking O(n&sdot;k) time for n points and k classes. Experimental study confirm the theoretical improvements upon the initial algorithm. A theoretical and experimental comparison to other algorithms from the literature, shows that it is among the fastest and performs well.
A Simulation Study of the Model Evaluation Criterion MMRE
Authors: Tron Foss, Erik Stensrud, Barbara Kitchenham, Ingunn Myrtveit
Venue: IEEE Transactions on Software Engineering (2003)

The Mean Magnitude of Relative Error, MMRE, is probably the most widely used evaluation criterion for assessing the performance of competing software prediction models. One purpose of MMRE is to assist us to select the best model. In this paper, we have performed a simulation study demonstrating that MMRE does not always select the best model. Our findings cast some doubt on the conclusions of any study of competing software prediction models that used MMRE as a basis of model comparison. We therefore recommend not using MMRE to evaluate and compare prediction models. At present, we do not have any universal replacement for MMRE. Meanwhile, we therefore recommend using a combination of theoretical justification of the models that are proposed together with other metrics proposed in this paper.
Poster abstract secure locations: routing on trust and isolating compromised sensors in location-aware sensor networks
Authors: Sapon Tanachaiwiwat, Pinalkumar Dave, Rohan Bhindwale, Ahmed Helmy
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

In data-centric sensor networks, where data processing and transfer are oblivious to node IDs, conventional node-based security models are not suitable. We introduce the novel concept of secure locations to address non-cooperative and malicious behavior in location-aware sensor networks. Our architecture also introduces a scalable trust-based routing protocol (TRANS) to track, update and route around untrusted locations using variants of geographic and trajectory routing. As part of our protocol we provide an efficient algorithm for identifying and isolating misbehaving or compromised sensors based on their approximate locations. Our simulations show the efficacy of our approach in malicious node isolation and route infection reduction.
Effective page refresh policies for Web crawlers
Authors: Junghoo Cho, Hector Garcia-Molina
Venue: ACM Transactions on Database Systems (TODS) (2003)

In this article, we study how we can maintain local copies of remote data sources "fresh," when the source data is updated autonomously and independently. In particular, we study the problem of Web crawlers that maintain local copies of remote Web pages for Web search engines. In this context, remote data sources (Websites) do not notify the copies (Web crawlers) of new changes, so we need to periodically poll the sources to maintain the copies up-to-date. Since polling the sources takes significant time and resources, it is very difficult to keep the copies completely up-to-date.This article proposes various refresh policies and studies their effectiveness. We first formalize the notion of "freshness" of copied data by defining two freshness metrics, and we propose a Poisson process as the change model of data sources. Based on this framework, we examine the effectiveness of the proposed refresh policies analytically and experimentally. We show that a Poisson process is a good model to describe the changes of Web pages and we also show that our proposed refresh policies improve the "freshness" of data very significantly. In certain cases, we got orders of magnitude improvement from existing policies.
Scoped and Approximate Queries in a Relational Grid Information Service
Authors: Dong Lu, Peter A. Dinda, Jason A. Skicewicz
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

We are developing a grid information service, RGIS, that isbased on the relational data model. RGIS supports complexqueries written in SQL that search for compositions (using joins)of resources. For example, we might ask it to find a Linux clusterwith a certain bisection bandwidth and total memory. Such queriescan be expensive to execute, however, and so we have developedseveral approaches that leverage our GIS schema to let us tradeoff between the number of results returned and the execution time.In this paper, we describe two of them: scoped queries and approximatequeries. Scoped queries constrain search to a networkneighborhood, returning all matching results in the neighborhood.Approximate queries reduce the number of joins done by replacingcollective constraints with constraints on individual resources,returning a subset of all the possible results in the grid. Scoping,approximation, and nondeterminism (described elsewhere),can be combined. In this paper, we describe scoped and approximatequeries, how they are implemented, and present performanceevaluations for two examples. The evaluation suggests that scopingand approximation can greatly reduce query times while stillreturning a useful number of results.
A Probabilistic Method for the Computation of Testability of RTL Constructs
Authors: José M. Fernandes, Marcelino B. Santos, Arlindo L. Oliveira, João C. Teixeira
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Validation of RTL descriptions remains one of the principal bottlenecks in the circuit design process. Random simulation based methods for functional validation suffer from fundamental limitations and may be inappropriate or too expensive. In fact, for some circuits, a large number of vectors is required in order to make the circuit reach hard to test constructs and obtain accurate values for their testability. In this work, we present a static, non-simulation based, method for the determination of the controllability of RTL constructs that is efficient and gives accurate feedback to the designers in what regards the presence of hard to control constructs in their RTL code. The method takes as input a Verilog RTL description, solves the Chapman-Kolmogorov equations that describe the steady-state of the circuit and outputs the computed values for the controllability of the RTL constructs. To avoid the exponential blow-up that results from writing one equation for each circuit state and solving the resulting system of equations, an approximation method is used. We present results showing that the approximation is effective and describe how the method can be used to bias a random testgenerator in order to achieve higher coverage using a smaller number of vectors.
Refinement of Mixed-Signal Systems with Affine Arithmetic
Authors: Ch. Grimm, W. Heupke, K. Waldschmidt
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper describes a framework for the refinement of control and signal processing functions. The design starts with an executable speci.cation, and allowed deviations thereof. Refinement steps introduce models of analog or digital implementations, and augment the 'ideal' behavior with different sources of uncertainty. The framework verifies and analyzes the influence of these uncertainties on system properties using affine arithmetic.
Deriving prediction intervals for neurofuzzy networks
Authors: G. Castellano, A. M. Fanelli, C. Mencar
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this paper, we describe a method to calculate prediction intervals for neurofuzzy networks used as predictive systems. The method also allows defining prediction intervals for the fuzzy rules that constitute the rule base of the neuro-fuzzy network, resulting in a more readable knowledge base. Moreover, the method does not depend on a specific architecture and can be applied to a variety of neuro-fuzzy models. An illustrative example is reported to show the validity of the proposed approach.
Eliminating unorthodox derivation rules in an axiom system for iteration-free P D L with intersection
Authors: Philippe Balbiani
Venue: Fundamenta Informaticae (2002)

We devote this paper to the completeness of an axiom system for PDL0∩ -- a variant of PDL which includes the program operations of composition and intersection. Most of the difficulty in the proof of the completeness theorem for PDL0∩ lies in the fact that intersection of accessibility relations is not modally definable. We overcome this difficulty by considering the concepts of theory and large program. Theories are sets of formulas that contain PDL0∩ and are closed under the inference rule of modus ponens. Large programs are built up from program variables and theories by means of the operations of composition and intersection, just as programs are built up from program variables and tests. Adapting these concepts to the subordination method, we can prove the completeness of our deductive system for PDL0∩.
Vortex tubes in turbulent flows: identification, representation, reconstruction
Authors: David C. Banks, Bart A. Singer
Venue: Proceedings of the conference on Visualization '94 (1994)

A new algorithm for identifying vortices in complex flows is presented. The scheme uses both the vorticity and pressure fields. A skelton line along the center of a vortex is produced by a two-step predictor-corrector scheme. The technique uses the vector field to move in the direction of the skeleton line and the scalar field to correct the location in the plane perpendicular to the skelton line. With an economical description of the vortex tube's cross-section, the skeleton compresses the representation of the flow by a factor of 4000 or more. We show how the reconstructed geometry of vortex tubes can be enhanced to help visualize helical motion.
On Linear-Quadratic Optimal Control Problems for Time-Varying Descriptor Systems
Authors: Galina A. Kurina, Roswitha März
Venue: SIAM Journal on Control and Optimization (2003)

We deal with linear-quadratic optimal control problems for time-varying descriptor systems in a Hilbert space setting. A sufficient solvability condition is given by means of an appropriately stated linear boundary value problem (BVP) and by discussing the special structure of the regular differential system inherent in this BVP.