ppxscal/embedding_network huggingface dataset:
QoS Control Strategies for High-Quality Video Processing
Authors: Clemens C. Wüst, Liesbeth Steffens, Wim F. Verhaegh, Reinder J. Bril, Christian Hentschel
Venue: Real-Time Systems (2005)

Video processing in software is often characterized by highly fluctuating, content-dependent processing times, and a limited tolerance for deadline misses. We present an approach that allows close-to-average-case resource allocation to a single video processing task, based on asynchronous, scalable processing, and QoS adaptation. The QoS adaptation balances different QoS parameters that can be tuned, based on user-perception experiments: picture quality, deadline misses, and quality changes. We model the balancing problem as a discrete stochastic decision problem, and propose two solution strategies, based on a Markov decision process and reinforcement learning, respectively. We enhance both strategies with a compensation for structural (non-stochastic) load fluctuations. Finally, we validate our approach by means of simulation experiments, and conclude that both enhanced strategies perform close to the theoretical optimum.
Science of design
Authors: Kevin Sullivan, Jeff Magee
Venue: Proceedings of the 27th international conference on Software engineering (2005)

In this plenary panel session, three distinguished scholars of design will provide a range of perspectives on a science of design for software and software-intensive systems. The session will include brief presentations by the panelists as well as dialog among the panelists and with members of the audience.
Concise and Consistent Naming
Authors: Florian Deissenboeck, Markus Pizka
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Approximately 70% of the source code of a software system consists of identifiers. Hence, the names chosen as identifiers are of paramount importance for the readability of computer programs and therewith their comprehensibility. However, virtually every programming language allows programmers to use almost arbitrary sequences of characters as identifiers which far too often results in more or less meaningless or even misleading naming. Coding style guides address this problem but are usually limited to general and hard to enforce rules like "identifiers should be self-describing". This paper renders adequate identifier naming far more precisely. A formal model, based on bi-jective mappings between concepts and names, provides a solid foundation for the definition of precise rules for concise and consistent naming. The enforcement of these rules is supported by a tool that incrementally builds and maintains a complete identifier dictionary while the system is being developed. The identifier dictionary explains the language used in the software system, aids in consistent naming, and improves productivity of programmers by proposing suitable names depending on the current context.
Helping in collaborative activity regulation: modeling regulation scenarii
Authors: Stéphane Talbot, Philippe Pernelle
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

The regulation was introduced into groupware in order to improve the actors collaboration. In our context, the regulation means the ability given to a group or a person that manages a group. This paper describes an approach of setting up about this regulation thanks to the concept of scenario. This last makes possible to describe the practical application common rules, which can be laid down within a group. These scenarios make possible to modify some actions of the actors, it becomes thus actions scenarized. For that, we will present a model of scenario and representation language
XQBE (XQuery By Example): A visual interface to the standard XML query language
Authors: Daniele Braga, Alessandro Campi, Stefano Ceri
Venue: ACM Transactions on Database Systems (TODS) (2005)

The spreading of XML data in many contexts of modern computing infrastructures and systems causes a pressing need for adequate XML querying capabilities; to address this need, the W3C is proposing XQuery as the standard query language for XML, with a language paradigm and a syntactic flavor comparable to the SQL relational language. XQuery is designed for meeting the requirements of skilled database programmers; its inherent complexity makes the new language unsuited to unskilled users.In this article we present XQBE (XQuery By Example), a visual query language for expressing a large subset of XQuery in a visual form. In designing XQBE, we targeted both unskilled users and expert users wishing to speed up the construction of their queries; we have been inspired by QBE, a relational language initially proposed as an alternative to SQL, which is supported by Microsoft Access. QBE is extremely successful among users who are not computer professionals and do not understand the subtleties of query languages, as well as among professionals who can draft their queries very quickly.According to the hierarchical nature of XML, XQBE's main graphical elements are trees. One or more trees denote the documents assumed as query input, and one tree denotes the document produced by the query. Similar to QBE, trees are annotated so as to express selection predicates, joins, and the passing of information from the input trees to the output tree.This article formally defines the syntax and semantics of XQBE, provides a large set of examples, and presents a prototype implementation.
Supporting time-sensitive applications on a commodity OS
Authors: Ashvin Goel, Luca Abeni, Charles Krasic, Jim Snow, Jonathan Walpole
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Commodity operating systems are increasingly being used for serving time-sensitive applications. These applications require low-latency response from the kernel and from other system-level services. In this paper, we explore various operating systems techniques needed to support time-sensitive applications and describe the design of our Time-Sensitive Linux (TSL) system. We show that the combination of a high-precision timing facility, a well-designed preemptible kernel and the use of appropriate scheduling techniques is the basis for a low-latency response system and such a system can have low overhead. We evaluate the behavior of realistic time-sensitive user- and kernel-level applications on our system and show that, in practice, it is possible to satisfy the constraints of time-sensitive applications in a commodity operating system without significantly compromising the performance of throughput-oriented applications.
Simulation of Electrical Conduction in Cardiac Tissue on High Performance Computers
Authors: Tabish Almas, Zelalem Tesfaye, Ian D. Donn
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

We present computational methods for simulating electrical conduction in cardiac ventricles on parallel machines. We used the network model approach to describe the tissue geometry and biophysically detailed models of ion currents and membrane transporters in cardiac ventricular myocytes. Simulations of biophysically detailed ionic models with anatomically detailed tissue geometries are computationally very expensive. We investigated the use of high performance computers to reduce execution time. Experiments have shown that we can adapt and optimize our existing models of electrical activity in heart tissue for the High Performance Computers. The solution was implemented on the IBM® p690, a shared memory machine and on a cluster of workstations, a distributed memory machine. An efficient algorithm was designed to partition the data and to pass messages between processors using Message Passing Interface (MPI). The algorithm was highly scalable to the problem size as well as the number of processors used, and could easily be ported to other parallel architectures. We were able to achieve speedup of up to 13.5 on the p690 and 27 on the cluster of workstations. Using the method developed, the simulated pattern of electrical activation agreed with the experimental data.
A tool for incorporating unit testing into a Java programming curriculum
Authors: Colin Depradine, Julian Arthur
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

In the development of object-oriented programming courses, an often overlooking but important area is testing. Generally, testing is formally introduced in software engineering courses and may not form part of the practical aspects of a programming course. As a result, this concept can play a de-emphasized role during the presentation of the course material. To counteract this problem, the HF2 (Highly Extendable and Flexible) unit testing framework was created. Its primary focus is the incorporation of unit testing into an object-oriented programming curriculum. HF2 provides students with the opportunity to develop and practice testing skills in a structured manner. This paper discusses the structure of the framework and the experiences gained when used in a university environment.
Polynomial-time computing over quadratic maps i: sampling in real algebraic sets
Authors: Dima Grigoriev, Dmitrii V. Pasechnik
Venue: Computational Complexity (2005)

Given a quadratic map $$Q:\mathbb{K}^n \to \mathbb{K}^k $$ defined over a computable subring D of a real closed field $$\mathbb{K},$$ and p ¿D[Y1,...,Yk] of degree d, we consider the zero set $$Z = Z(p(Q(X)), \mathbb{K}^n) \subseteq \mathbb{K}^n$$ of p(Q(X1,...,Xn)) ¿D[X1,...,Xn]. We present a procedure that computes, in (dn)O(k) arithmetic operations in D, a set $$\mathcal{S}$$ of (real univariate representations of) sampling points in $$\mathbb{K}^n$$ that intersects nontrivially each connected component of Z. As soon as k=o(n), this is faster than the known methods that all have exponential dependence on n in the complexity. In particular, our procedure is polynomial-time for constant k. In contrast, the best previously known procedure is only capable of deciding in $$n^{O(k^2 )} $$ operations the nonemptiness (rather than constructing sampling points) of the set Z in the case of p(Y)=¿iYi2 and homogeneous Q.A by-product of our procedure is a bound (dn)O(k) on the number of connected components of Z.The procedure consists of exact symbolic computations in D and outputs vectors of algebraic numbers. It involves extending $$\mathbb{K}$$ by infinitesimals and subsequent limit computation by a novel procedure that utilizes knowledge of an explicit isomorphism between real algebraic sets.
Current-voltage characterization and temporal stability of the emission current of silicon tip arrays
Authors: Marco A. R. Alves, Pedro H. L. de Faria, Edmundo S. Braga
Venue: Microelectronic Engineering (2004)

We report an investigation of current-voltage (I-V) characteristics of silicon tip arrays, presenting a discussion of the electrical phenomena with respect to the field emission current. The samples were fabricated on silicon substrates using reactive ion etching SF"6 plasma and sharpened by thermal oxidation. Current-voltage measurements were performed using anode-cathode distances of 30 and 50 @mm, and followed a Fowler-Nordheim behavior. No significant changes in the field enhancement factor were found for the different anode-cathode spacings. However, a rise in threshold voltage was detected as anode-cathode separation increased. We also studied the histeresis behavior of the silicon tips for a fixed distance and found differences in the threshold voltage for ascending and descending ramps, possibly caused by a variation in the ''effective'' work function. Finally, we investigated the short-term current emission stability and found the behavior to be consistent with evidence from the literature, which correlates the instability in electron emission to localized interface traps and gas desorption events.
Stationary distributions of random walk mobility models for wireless ad hoc networks
Authors: Michael McGuire
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

To properly use a mobility model to evaluate a wireless network policy via computer simulations it is necessary to know the statistics of mobile terminal locations for the model. Unfortunately, these statistics are only known for a limited number of mobility models which limits the analysis of wireless networks that can be done using computer simulations. This paper presents a method for calculating an approximation of the steady-state distribution of mobile terminal locations for a general class of mobility models. The motion models in this class are specified by the conditional distribution of destination points given source points, the distribution of speed, and the distribution of pause times for each motion link. The continuous time distributions of mobile terminal locations and velocities are then derived from the motion link steady-state distributions. This knowledge will enable researchers to use low cost computer simulations to effectively evaluate new wireless network policies for a wide variety of mobility patterns.
Orange: from experimental machine learning to interactive data mining
Authors: Janez Demšar, Blaž Zupan, Gregor Leban, Tomaz Curk
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Orange (www.ailab.si/orange) is a suite for machine learning and data mining. For researchers in machine learning, Orange offers scripting to easily prototype new algorithms and experimental procedures. For explorative data analysis, it provides a visual programming framework with emphasis on interactions and creative combinations of visual components.
Investigation into the use of C- and N-terminal GFP fusion proteins for subcellular localization studies using reverse transfection microarrays: Research Papers
Authors: Ella Palmer, Tom Freeman
Venue: Comparative and Functional Genomics (2004)

Reverse transfection microarrays were described recently as a high throughput method for studying gene function. We have investigated the use of this technology for determining the subcellular localization of proteins. Genes encoding 16 proteins with a variety of functions were placed in Gateway expression constructs with 3&prime; or 5&prime; green fluorescent protein (GFP) tags. These were then packaged in transfection reagent and spotted robotically onto a glass slide to form a reverse transfection array. HEK293T cells were grown over the surface of the array until confluent and GFP fluorescence visualized by confocal microscopy. All C-terminal fusion proteins localized to cellular compartments in accordance with previous studies and&#x002F;or bioinformatic predictions. However, less than half of the N-terminal fusion proteins localized correctly. Of those that were not in concordance with the C-terminal tagged proteins, half did not exhibit expression and the remainder had differing subcellular localizations to the C-terminal fusion protein. This data indicates that N-terminal tagging with GFP adversely affects the protein localization in reverse transfection assays, whereas tagging with GFP at the C-terminal is generally better in preserving the localization of the native protein. We discuss these results in the context of developing high-throughput subcellular localization assays based on the reverse transfection array technology. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Learning Semantic Combinatoriality from the Interaction between Linguistic and Behavioral Processes
Authors: Yuuya Sugita, Jun Tani
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2005)

We present a novel connectionist model for acquiring the semantics of a simple language through the behavioral experiences of a real robot. We focus on the "compositionality" of semantics and examine how it can be generated through experiments. Our experimental results showed that the essential structures for situated semantics can self-organize themselves through dense interactions between linguistic and behavioral processes whereby a certain generalization in learning is achieved. Our analysis of the acquired dynamical structures indicates that an equivalence of compositionality appears in the combinatorial mechanics self-organized in the neuronal nonlinear dynamics. The manner in which this mechanism of compositionality, based on dynamical systems, differs from that considered in conventional linguistics and other synthetic computational models, is discussed in this paper.
The implementation and evaluation of dynamic code decompression using DISE
Authors: Marc L. Corliss, E. Christopher Lewis, Amir Roth
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2005)

Code compression coupled with dynamic decompression is an important technique for both embedded and general-purpose microprocessors. Postfetch decompression, in which decompression is performed after the compressed instructions have been fetched, allows the instruction cache to store compressed code but requires a highly efficient decompression implementation. We propose implementing postfetch decompression using a new hardware facility called dynamic instruction stream editing (DISE). DISE provides a programmable decoder---similar in structure to those in many IA-32 processors---that is used to add functionality to an application by injecting custom code snippets into its fetched instruction stream. We present a DISE-based implementation of postfetch decompression and show that it naturally supports customized program-specific decompression dictionaries, enables parameterized decompression allowing similar-but-not-identical instruction sequences to share dictionary entries, and uses no decompression-specific hardware. We present extensive experimental results showing the virtue of this approach and evaluating the factors that impact its efficacy. We also present implementation-neutral results that give insight into the characteristics of any postfetch decompression technique. Our experiments not only demonstrate significant reduction in code size (up to 35&percent;) but also significant improvements in performance (up to 20&percent;) and energy (up to 10&percent;).
Seismic Waves from Light Trucks Moving Over Terrain
Authors: Stephen A. Ketcham, Mark L. Moran, James Lacombe
Venue: Proceedings of the 2004 Users Group Conference (2004)

Seismic sensing is one sensor mode employed in US unattended ground sensor systems (UGS). Seismic sensors possess the advantage of beyond-line-of-sight sensing. They can detect ground vibrations generated by moving vehicles or personnel, and they can be used to cue other sensors or possibly to classify or even identify targets. As a complement to field trials, our work has produced a simulation capability to support seismic UGS developments. We model ground vibrations from moving vehicles and generate synthetic seismic wavefield data over terrain of interest to US forces. Using supercomputers to simulate seismic wave propagation in large finite-difference time-domain simulations, our objective is to generate high fidelity data sets that provide new opportunities for understanding and exploiting signalfeatures that may be unrecognizable in limited field trials. The method utilizes a vehicle-dynamics model to calculate the vehicle response to vehicle acceleration and movement over bumpy roads or terrain. It calculates forces transmitted to the ground; distributes these forces to grid points of a finite difference model; and simulates seismic waves propagating away from the vehicle. The current work focuses on light trucks moving toward and through a mountain pass and signature features associated with suspension and wheelbase characteristics. The results from two analyses show seismic waves propagating away from one and two trucks, respectively. We conclude that the wavefield data is realistic and suitable for virtual trials of seismic UGS.
CubeSVD: a novel approach to personalized Web search
Authors: Jian-Tao Sun, Hua-Jun Zeng, Huan Liu, Yuchang Lu, Zheng Chen
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users' information needs. This paper focuses on utilizing clickthrough data to improve Web search. Since millions of searches are conducted everyday, a search engine accumulates a large volume of clickthrough data, which records who submits queries and which pages he/she clicks on. The clickthrough data is highly sparse and contains different types of objects (user, query and Web page), and the relationships among these objects are also very complicated. By performing analysis on these data, we attempt to discover Web users' interests and the patterns that users locate information. In this paper, a novel approach CubeSVD is proposed to improve Web search. The clickthrough data is represented by a 3-order tensor, on which we perform 3-mode analysis using the higher-order singular value decomposition technique to automatically capture the latent factors that govern the relations among these multi-type objects: users, queries and Web pages. A tensor reconstructed based on the CubeSVD analysis reflects both the observed interactions among these objects and the implicit associations among them. Therefore, Web search activities can be carried out based on CubeSVD analysis. Experimental evaluations using a real-world data set collected from an MSN search engine show that CubeSVD achieves encouraging search results in comparison with some standard methods.
Constructing and Querying Peer-to-Peer Warehouses of XML Resources
Authors: Serge Abiteboul, Ioana Manolescu, Nicoleta Preda
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

We present KADOP, a distributed infrastructure for warehousing XML resources in a peer-to-peer framework. KADOP allows users to build a shared, distributed repository of resources such as XML documents, semantic information about such documents, Web services, and collections of such items. KADOP leverages several existing technologies and models: it uses distributed hash tables as a peer communication layer, and ActiveXML as a model for constructing and querying the resources in the peer network.
Broad-Coverage Parsing with Neural Networks
Authors: Marshall R. Mayberry,  Iii, Risto Miikkulainen
Venue: Neural Processing Letters (2005)

Subsymbolic systems have been successfully used to model several aspects of human language processing. Such parsers are appealing because they allow revising the interpretation as words are incrementally processed. Yet, it has been very hard to scale them up to realistic language due to training time, limited memory, and the difficulty of representing linguistic structure. In this study, we show that it is possible to keep track of long-distance dependencies and to parse into deeper structures than before based on two techniques: a localist encoding of the input sequence and a dynamic unrolling of the network according to the parse tree. With these techniques, the system can nonmonotonically parse a corpus of realistic sentences into parse trees labelled with grammatical tags from a broad-coverage Head-driven Phrase Structure Grammar of English.