ppxscal/embedding_network huggingface dataset:
The Design and Performance of a Real-Time Notification Service
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Many distributed real-time and embedded (DRE)applications require a scalable event-drivencommunication model that decouples suppliers fromconsumers and simultaneously supports advancedquality of service (QoS) properties and event filteringmechanisms. The CORBA Notification Serviceprovides publisher/subscriber capabilities designed tosupport scalable event-driven communication byrouting events efficiently between suppliers andconsumers, enforcing QoS properties (such asreliability, priority, ordering, and timeliness), andfiltering events at multiple points in a distributedsystem. The standard CORBA Notification Service isinsufficient, however, to enforce predictablecommunication needed by DRE applications and doesnot leverage Real-time CORBA capabilities, such asend-to-end priority assignment or scheduling services.This paper makes three contributions to the study ofscalable real-time notification services for DREapplications. First, we describe the requirements of theOMG Request for Proposals (RFP) on Real-timeNotification, which seeks solutions to the problem ofenforcing real-time properties by enhancing thestandard CORBA Notification Service. Second, weexplain how we have addressed key design challengesfaced when implementing a Real-time NotificationService for TAO, which is our CORBA-compliant real-time Object Request Broker (ORB). We discuss how we integrate Real-time CORBA features (such as threadpools, thread lanes, and priority models) to providereal-time event communication. Finally, we analyze theresults of empirical benchmarks of the performanceand predictability of TAO's Real-time NotificationService. These results show that the static real-timeassurances provided by Real-time CORBA aremaintained within the more flexible context of TAO'sReal-time Notification Service.
A Efficient Algorithm for Unique Signature Discovery on Whole-Genome EST Databases
Authors: Hsiao Ping Lee, Tzu Fang Sheu, Yin Te Tsai, Ching Hua Shih, Chuan Yi Tang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

ESTs can be used to accelerate the various research activities for the discovery of new genes. Unique oligonucleotides are signatures that distinguish an EST from all the others. An important application of those short signatures is to be used in PCR primer design and microarray experiments. In this research, we propose an efficient approach to enhance our previous work on unique signature discovery to handle the dataset of whole-genome scale. The performances of our method are evaluated by the experiments on human chromosome EST databases.
The use of quick prototypes in the secure military message systems project
Authors: C. Heitmeyer, C. Landwehr, M. Cornwell
Venue: ACM SIGSOFT Software Engineering Notes (1982)

This paper describes the role of quick prototyping in the Secure Military Message Systems project. The issues that are being explored with quick prototyping are identified. To date, a small prototype message system written in Franz Lisp has been implemented on a Vax 11/780. The guidelines observed and the lessons learned in constructing the prototype are discussed.
Induced Subdivisions In Ks,s-Free Graphs of Large Average Degree
Authors: Daniela K&#x00fc;hn, Deryk Osthus
Venue: Combinatorica (2004)

We prove that for every graph H and for every s there exists d=d(H,s) such that every graph of average degree at least d contains either a Ks,s as a subgraph or an induced subdivision of H.
Crossover of the Behavior of Surface Waves in a Vibrated Granular Material
Authors: Youngkyun Jung, Jysoo Lee
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

We study the formation of standing waves on the surface of a vibrated granular material by molecular dynamics simulations. Two distinct regimes are observed at low and high vibration frequencies. At low frequency, the standing waves are maintained by a sizable fraction of particles traveling long distances. Such movements are significantly reduced at high frequency due to frequent interparticle collisions, and more coherent motion of particles is observed. We also describe in detail the time evolution of the standing waves, especially on the collision process of the granular layer with the bottom plate, during which horizontal flux of particles is generated.
Error analysis of burst level modeling of active-idle sources
Authors: Yujing Wu, Weibo Gong
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2004)

It is often not feasible to simulate high-speed networks at the packet level. One common technique for simulation speedup is to model traffic at coarser timescales, which we refer to as the abstract simulation. In this article, we analyze the sources for the accuracy degradation in abstract simulation. Specifically, we consider burst level modeling of active-idle sources and study a queue fed by such sources. The arrival rates vary during active periods. The burst level model assumes constant rates during each active period. Therefore, it can not track queue-length variations within an active period, which leads to the queue-length evaluation error. We study two scenarios. In the first scenario, the queue is always busy whenever the source is on. During each active period, the evolution of the queue length can be viewed as an integration process of the arrival rate. In this case, the error in the mean queue length shows nice properties. It is only determined by the traffic characteristics and does not change with the utilization. In the multiple-flow case, the error is the sum of the errors caused by abstraction on individual flows. We also show that the error does not propagate for tree-like networks or networks with probabilistic routing. In the first scenario, under very general conditions, burst level modeling does not cause significant underevaluation of the queue length. In the second scenario, the queue may empty during on periods of the source. We call these empty periods E intervals. We quantify the error in the mean queue length, which depends on the numbers, lengths, and positions of the E intervals. The burst level model significantly underevaluates the queue length if such intervals occur often. High utilizations, strong traffic burstiness at the active-idle level, and small arrival granularity tend to reduce such occurrences and the error in the mean queue length. This explains why these conditions favor traffic modeling at coarser timescales. Our findings are not limited to the specific traffic sources and the time-abstraction techniques. Instead, they shed light on the conditions needed for abstract models to deliver evaluation fidelity in a general context.
Macroscopic Modeling of Aggregation Experiments using Embodied Agents in Teams of Constant and Time-Varying Sizes
Authors: William Agassounon, Alcherio Martinoli, Kjerstin Easton
Venue: Autonomous Robots (2004)

In this paper, we present discrete-time, nonspatial, macroscopic models able to capture the dynamics of collective aggregation experiments using groups of embodied agents endowed with reactive controllers. The strength of the proposed models is that they have been built up incrementally, with matching between models and embodied simulations verified at each step as new complexity was added. Precise heuristic criteria based on geometrical considerations and systematic tests with one or two embodied agents prevent the introduction of free parameters into the models. The collective aggregation experiments presented in this paper are concerned with the gathering and clustering of small objects initially scattered in an enclosed arena. Experiments were carried out with teams consisting of one to ten individuals, using groups of both constant and time-varying sizes. In the latter case, the number of active workers was controlled by a simple, fully distributed, threshold-based algorithm whose aim was to allocate an appropriate number of individuals to a time-evolving aggregation demand. To this purpose, agents exclusively used their local perception to estimate the availability of work. Results show that models can deliver both qualitatively and quantitatively correct predictions and they represent a useful tool for generalizing the dynamics of these highly stochastic, asynchronous, nonlinear systems, often outperforming intuitive reasoning. Finally, in addition to discussions of small prediction discrepancies and difficulties in generating quantitatively correct macroscopic models, we conclude the paper by reviewing the intrinsic limitations of the current modeling methodology and by proposing a few suggestions for future work.
Basic Multiple-Valued Functions Using Recharge CMOS Logic
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

In this paper we present novel recharge logicfor multiple-valued(MV) systems by utilizing semi-floating-gate (SFG)transistors. The recharge multiple-valued logic can beused to implement low-power digital transition logiccircuits. The improvement in power dissipation is mainlyin reduced dynamic power dissipation. In this paperthe basic functions suitable for synthesis of MV logicwill be presented. The main purpose is to level out thepower dissipated by a digital system to obtain moresuitable logic for mixed mode design.
The &#x201c;presence of others&#x201d; in a virtual environment: different collaborative modalities with hybrid resources
Authors: Luciano Gamberini, Anna Spagnolli, Paolo Cottone, Massimiliano Martinelli, Laura Bua
Venue: Cognition, Technology and Work (2004)

The purpose of this study is to see in which forms and under which conditions social presence turns into collaboration. Eight couples were asked to find some objects in a virtual environment in which collaboration was allowed but not mandatory. The qualitative analysis of the video recordings shows that all participants resorted to collaboration in forms that were justified by the requirements of the task, the environmental affordances and the different expertise.
Delivering Packets During The Routing Convergence Latency Interval Through Highly Connected Detours
Authors: Elias Procopio Duarte Jr., Rogerio Santini, Jaime Cohen
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Routing protocols present a convergence latency for allrouters to update their tables after a fault occurs and the networktopology changes. During this time interval, which inthe Internet has been shown to be of up to minutes, packetsmay be lost before reaching their destinations. In orderto allow nodes to continue communicating during the convergencelatency interval, we propose the use of alternativeroutes called detours. In this work we introduce new criteriafor selecting detours based on network connectivity.Detours are chosen without the knowledge of which nodeor link is faulty. Highly connected components present alarger number of distinct paths, thus increasing the probabilitythat the detour will work correctly. Experimental resultswere obtained with simulation on random Internet-likegraphs generated with the Waxman method. Results showthat the fault coverage obtained through the usage of thebest detour is up to 90%. When the three best detours areconsidered, the fault coverage is up to 98%.
Taut distance-regular graphs of even diameter
Authors: Mark S. MacLean
Venue: Journal of Combinatorial Theory Series B (2004)

Let Γ denote a bipartite distance-regular graph with diameter D≥4, valency k≥3, and Bose-Mesner algebra M. Let θ0 > θ1 > ... >θD denote the distinct eigenvalues for Γ, and for 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi. We refer to E0 and ED as the trivial idempotents of M. Let E and F denote primitive idempotents of M. We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E, F is a linear combination of two distinct primitive idempotents of M. If Γ is 2-homogeneous in the sense of Nomura and Curtin, then Γ has at least one taut pair of primitive idempotents. We define Γ to be taut whenever Γ has at least one taut pair of primitive idempotents but Γ is not 2-homogeneous. Let θ denote an eigenvalue of Γ other than θ0, θD, and let σ0, σ1,...,σD denote the cosine sequence associated with θ. By a result of Curtin, the following are equivalent: (i) Γ is 2-homogeneous and θ ∈ {θ1, θD - 1}: (ii) there exists a complex scalar λ such that σi - 1 - λσi + σi+1 = 0 for 1 ≤ i ≤ D - 1. Expanding on this, we show that for D even, the following are equivalent: (i) Γ is taut or 2-homogeneous and θ ∈ {θ1, θD - 1}; (ii) there exists a complex scalar λ such that σi - 1 - λσi + σi + 1 = 0 for i odd, 1 ≤ i ≤ D - 1. Using this result, we show that for D even, Γ is taut or 2-homogeneous if and only if the intersection numbers of Γ are given by certain rational expressions involving D/2 independent variables. We discuss the known examples of taut distance-regular graphs with even diameter.
Computable Shell Decomposition Bounds
Authors: John Langford, David McAllester
Venue: The Journal of Machine Learning Research (2004)

Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves such as phase transitions. Here we use a variant of their ideas to derive an upper bound on the generalization error of a hypothesis computable from its training error and the histogram of training errors for the hypotheses in the class. In most cases this new bound is significantly tighter than traditional bounds computed from the training error and the cardinality of the class. Our results can also be viewed as providing a rigorous foundation for a model selection algorithm proposed by Scheffer and Joachims.
Adaptive Finite Element Methods with convergence rates
Authors: Peter Binev, Wolfgang Dahmen, Ron DeVore
Venue: Numerische Mathematik (2004)

Adaptive Finite Element Methods for numerically solving elliptic equations are used often in practice. Only recently [12], [17] have these methods been shown to converge. However, this convergence analysis says nothing about the rates of convergence of these methods and therefore does, in principle, not guarantee yet any numerical advantages of adaptive strategies versus non-adaptive strategies. The present paper modifies the adaptive method of Morin, Nochetto, and Siebert [17] for solving the Laplace equation with piecewise linear elements on domains in &#x211d;2 by adding a coarsening step and proves that this new method has certain optimal convergence rates in the energy norm (which is equivalent to the H1 norm). Namely, it is shown that whenever s>0 and the solution u is such that for each n&#x2265;1, it can be approximated to accuracy O(n&#x2212;s) in the energy norm by a continuous, piecewise linear function on a triangulation with n cells (using complete knowledge of u), then the adaptive algorithm constructs an approximation of the same type with the same asymptotic accuracy while using only information gained during the computational process. Moreover, the number of arithmetic computations in the proposed method is also of order O(n) for each n&#x2265;1. The construction and analysis of this adaptive method relies on the theory of nonlinear approximation.
Geostatistics and GIS: Tools for Characterizing Environmental Contamination
Authors: Shannon L. Henshaw, Frank C. Curriero, Timothy M. Shields, Gregory E. Glass, Paul T. Strickland, Patrick N. Breysse
Venue: Journal of Medical Systems (2004)

Geostatistics is a set of statistical techniques used in the analysis of georeferenced data that can be applied to environmental contamination and remediation studies. In this study, the 1,1-dichloro-2,2-bis(p-chlorophenyl)ethylene (DDE) contamination at a Superfund site in western Maryland is evaluated. Concern about the site and its future clean up has triggered interest within the community because residential development surrounds the area. Spatial statistical methods, of which geostatistics is a subset, are becoming increasingly popular, in part due to the availability of geographic information system (GIS) software in a variety of application packages. In this article, the joint use of ArcGIS software and the R statistical computing environment are demonstrated as an approach for comprehensive geostatistical analyses. The spatial regression method, kriging, is used to provide predictions of DDE levels at unsampled locations both within the site and the surrounding areas where residential development is ongoing.
Measurements of the congestion responsiveness of windows streaming media
Authors: James Nichols, Mark Claypool, Robert Kinicki, Mingzhe Li
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

While previous research has shown that streaming media can respond to network congestion, it is not known to what extent commercial products are responsive. This research characterizes the bitrate response of Windows Streaming Media (WSM) to changes in network capacity and loss rate. A streaming media test bed was built to systematically vary network and content encoding characteristics and measure WSM congestion responsiveness. The results demonstrate that WSM improve response to congestion when content is encoded into several bitrates by the content provider.
Multi-level specifications based on traces
Authors: P. A. S. Veloso, A. L. Furtado
Venue: ACM SIGSOFT Software Engineering Notes (1983)

A methodology for the formal specification of data base applications is presented. Central to the methodology is the idea of proceeding through successive levels of "traces", which enables an initial algebra specification to be obtained from one based on preconditions and effects. Besides being executable these trace levels provide a way to go from a natural language specification to an algebraic one.
Layout-Aware Scan Chain Synthesis for Improved Path Delay Fault Coverage
Authors: Puneet Gupta, Andrew B. Kahng, Ion Mandoiu, Puneet Sharma
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Path delay fault testing becomes increasingly important due tohigher clock rates and higher process variability caused by shrinkinggeometries. Achieving high-coverage path delay fault testingrequires the application of scan justified test vector pairs, coupledwith careful ordering of the scan flip-flops and/or insertion ofdummy flip-flops in the scan chain. Previous works on scan synthesisfor path delay fault testing using scan shifting have focusedexclusively on maximizing fault coverage and/or minimizing thenumber of dummy flip-flops, but have disregarded the scan wirelengthoverhead. In this paper we consider both dummy flip-flopand wirelength costs, and focus on post-layout formulations thatcapture the achievable tradeoffs between these costs and delay faultcoverage in scan chain synthesis.
Comments on "A parallel mixture of SVMs for very large scale problems"
Authors: Xiaomei Liu, Lawrence O. Hall, Kevin W. Bowyer
Venue: Neural Computation (2004)

Collobert, Bengio, and Bengio (2002) recently introduced a novel approach to using a neural network to provide a class prediction from an ensemble of support vector machines (SVMs). This approach has the advantage that the required computation scales well to very large data sets. Experiments on the Forest Cover data set show that this parallel mixture is more accurate than a single SVM, with 90.72% accuracy reported on an independent test set. Although this accuracy is impressive, their article does not consider alternative types of classifiers. We show that a simple ensemble of decision trees results in a higher accuracy, 94.75%, and is computationally efficient. This result is somewhat surprising and illustrates the general value of experimental comparisons using different types of classifiers.
Parameter scan of an effective group difference pseudopotential using grid computing
Authors: Wibke Sudholt, Kim K. Baldridge, David Abramson, Colin Enticott, Slavisa Garic
Venue: New Generation Computing (2004)

Computational modeling in the health sciences is still very challenging and much of the success has been despite the difficulties involved in integrating all of the technologies, software, and other tools necessary to answer complex questions. Very large-scale problems are open to questions of spatio-temporal scale, and whether physico-chemical complexity is matched by biological complexity. For example, for many reasons, many large-scale biomedical computations today still tend to use rather simplified physics/chemistry compared with the state of knowledge of the actual biology/biochemistry. The ability to invoke modern grid technologies offers the ability to create new paradigms for computing, enabling access of resources which facilitate spanning the biological scale.
Rapid Software Prototyping Using Visual Language Techniques
Authors: Kang Zhang, Guang-Lei Song, Jun Kong
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Rapid prototyping of domain-specific software requires asystematic software development methodology and user-friendlytools. Being both executable and easy to use, visuallanguages and their automatic generation mechanisms arehighly suitable for software prototyping. This paper presentsa software prototyping methodology based on thevisual language generation technology, that allows visualprototyping languages to be specified and generated usingan expressive graph grammar formalism. Executable prototypesand their verification and code generation are madepossible by syntax-directed computations. The paper demonstratesthis methodology through a prototyping examplebuilt on our current implementation.
Software safety
Authors: Nancy G. Leveson
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Software safety is an important aspect of software quality which is in need of research attention and priority. In this paper, software safety is defined and distinguished from reliability, and the current research efforts of the Irvine Safety Project are outlined.
Software metrics: an introduction and annotated bibliography
Authors: Michael L. Cook
Venue: ACM SIGSOFT Software Engineering Notes (1982)

Software metrics, an area of software engineering, is concerned with various measurements of computer software and its development. Software metrics, its importance, some current areas of investigation, and problems are described. An annotated bibliography of work in software metrics is included.I often say that when you can measure what you are speaking about, and express it in numbers, you know something about it; but when you cannot measure it, when you cannot express it in numbers, your knowledge is of a meagre and unsatisfactory kind: it may be the beginning of knowledge, but you have scarcely, in you thoughts, advanced to the stage of science, whatever the matter may be.---Lord Kelvin, Popular Lectures and Addresses, volume 1, 1889
Visual Analysis of Geographic Metadata in a Spatial Data Infrastructure
Authors: R. Albertoni, A. Bertone, M. De Martino
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Nowadays the importance of collecting and sharing geographical data is rapidly increasing. Spatial Data Infrastructures are arising to integrate geographic information services which allow to identify and access geographic information from a wide range of sources. The study of data access addresses different issues such as data delivering, data retrieval, data integration and data selection. In this paper we focus on the data selection issue: we describe an approach to support data selection activity based on visual analysis of geographic metadata. This facilitates the metadata analysis providing a compact overview of data that are available and a correct interpretation of the result set, allowing to discover properties and relationship among data and to formulate better searching criteria.