ppxscal/embedding_network huggingface dataset:
Differential Coordinates for Interactive Mesh Editing
Venue: Proceedings of the Shape Modeling International 2004 (2004)

One of the main challenges in editing a mesh is to retainthe visual appearance of the surface after applying variousmodifications. In this paper we advocate the use of lineardifferential coordinates as means to preserve the high-frequencydetail of the surface. The differential coordinatesrepresent the details and are defined by a linear transformationof the mesh vertices. This allows the reconstructionof the edited surface by solving a linear system that satisfiesthe reconstruction of the local details in least squares sense.Since the differential coordinates are defined in a global coordinatesystem they are not rotation-invariant. To compensatefor that, we rotate them to agree with the rotation ofan approximated local frame. We show that the linear leastsquares system can be solved fast enough to guarantee interactiveresponse time thanks to a precomputed factorizationof the coefficient matrix. We demonstrate that our approachenables to edit complex detailed meshes while keepingthe shape of the details in their natural orientation.
A GUI for ps(1) built with mozilla
Authors: Nigel McFarlane
Venue: Linux Journal (2004)

Make your apps run anywhere your browser does with the development framework that's already on your desktop.
Identifying MicroRNAs in Plant Genomes
Authors: Christopher Maher, Marja Timmermans, Lincoln Stein, Doreen Ware
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The ability to control gene expression during development in plants could be used for improving crop yields, resistance to disease, and environmental adaptability. It has been suggested that microRNAs, or miRNAs, control developmental processes such as meristem cell identity, organ polarity, and developmental timing by interfering with the expression of mRNAs. Our preliminary analysis focuses on the miR166 family since it has been shown to mediate repression of rolled-leaf1 (rdl1) in maize. Based on maize sequences derived from degenerate primers, we computationally identified miR166b, miR166c, miR166d, and four more closely related putative maize precursors. Patscan, a pattern-matching program that allows RNA basepairing and mismatches, was used to identify functional elements in the putative hairpins. Each hairpin was further supported by their stable secondary structures determined with Mfold. Using this pattern matching approach we expanded the analysis for 19 Arabidopsis miRNA families in rice and maize.
Complexity issues in bivariate polynomial factorization
Authors: A. Bostan, G. Lecerf, B. Salvy, É. Schost, B. Wiebelt
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in the total degree of the polynomial to be factored is sufficient to deduce the recombination by linear algebra, using trace recombination. Then, the total cost of the lifting and the recombination stage is subquadratic in the size of the dense representation of the input polynomial. Lifting is often the practical bottleneck of this method: we propose an algorithm based on a faster multi-moduli computation for univariate polynomials and show that it saves a constant factor compared to the classical multifactor lifting algorithm.
Data Visualization within Urban Models
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Models of urban environments have many uses fortown planning, pre-visualization of new building workand utility service planning. Many of these models arethree-dimensional, and increasingly there is a movetowards real-time presentation of such large models.In this paper we present an algorithm for generatingconsistent 3D models from a combination of data sources,including Ordnance Survey ground plans, aerialphotography and laser height data. Although there havebeen several demonstrations of automatic generation ofbuilding models from 2D vector map data, in this paperwe present a very robust solution that generates modelsthat are suitable for real-time presentation. We thendemonstrate a novel pollution visualization that usesthese models.
Optimal Parallel Block Access for Range Queries
Authors: Fouad B. Chedid
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Allocation schemes for range queries have been widelyused in parallel storage systems to allow fast access tomultidimensional data.An allocation shceme distributesdata blocks among several devices (e.g. disks) so that thenumber of parallel block accesses needed per query isminimized.Given a system of k disks, a query that accessesm blocks needs a number of parallel block accesses that isat least OPT = [m/k].In 2000, Atallah and Prabhakardescribed an allocation scheme with a guaranteed worst-caseperformance of OPT + O(log k) parallel block accessesfor two dimensions.In this paper, we prove that the schemeof Atallah and Prabhakar has, in fact, guaranteed worst-caseperformance within an additive constant deviationfrom OPT: Within OPT + 3 parallel block accesses for twodimensions.Also, we identify the type of queries for whichthe worst-case performance of the scheme is OPT + 1parallel block accesses.
Generating node coordinates for shortest-path computations in transportation networks
Authors: Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm
Venue: Journal of Experimental Algorithmics (JEA) (2004)

Speed-up techniques that exploit given node coordinates have proven useful for shortest-path computations in transportation networks and geographic information systems. To facilitate the use of such techniques when coordinates are missing from some, or even all, of the nodes in a network we generate artificial coordinates using methods from graph drawing. Experiments on a large set of German train timetables indicate that the speed-up achieved with coordinates from our drawings is close to that achieved with the true coordinates---and in some special cases even better.
Formal specifications and analysis of the computer-assisted resuscitation algorithm (CARA) Infusion Pump Control System
Authors: Rajeev Alur, David Arney, Elsa L. Gunter, Insup Lee, Jaime Lee, Wonhong Nam, Frederick Pearce, Steve Van Albert, Jiaxiang Zhou
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

Reliability of medical devices such as the CARA Infusion Pump Control System is of extreme importance given that these devices are being used on patients in critical condition. The Infusion Pump Control System includes embedded processors and accompanying embedded software for monitoring as well as controlling sensors and actuators that allow the embedded systems to interact with their environments. This nature of the Infusion Pump Control System adds to the complexity of assuring the reliability of the total system. The traditional methods of developing embedded systems are inadequate for such safety-critical devices. In this paper, we study the application of formal methods to the requirements capture and analysis of the Infusion Pump Control System. Our approach consists of two phases. The first phase is to convert the informal design requirements into a set of reference specifications using a formal system, in this case EFSMs (Extended Finite State Machines). The second phase is to translate the reference specifications to the tools supporting formal analysis, such as SCR and Hermes. This allows us to conclude properties of the reference specifications. Our research goal is to develop a framework and methodology for the integrated use of formal methods in the development of embedded medical systems that require high assurance and confidence .
An artificial intelligence approach to information retrieval (abstract only)
Authors: Andrew Trotman
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Current approaches to information retrieval rely on the creativity of individuals to develop new algorithms. In this investigation the use of genetic algorithms (GA) and genetic programming (GP) to learn IR algorithms is examined.Document structure weighting is a technique whereby different parts of a document (title, abstract, etc.) contribute unevenly to the overall document weight during ranking. Near optimal weights can be learned with a GA. Doing so shows a statistically significant 5% relative improvement in MAP for vector space inner product and Croft's probabilistic ranking, but no improvement for BM25. Two applications of this approach are suggested: offline learning, and relevance feedback.In a second set of experiments, a new ranking function was learned using GP. This new function yields a statistically significant 11% relative improvement on unseen queries tested on the training documents. Portability tests to different collections (not used in training) demonstrate the performance of the new function exceeds vector space and probability, and slightly exceeds BM25. Learning weights for this new function is proposed.The application of genetic learning to stemming and thesaurus construction is discussed. Stemming rules such as those of the Porter algorithm are candidates for GP learning whereas synonym sets are candidates for GA learning.
Nonlinear Polynomial Systems: Multiple Roots and Their Multiplicities
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In this paper we present methods for the computation ofroots of univariate and bivariate nonlinear polynomial systemsas well as the identification of their multiplicity. Wefirst present an algorithm, called the TDB algorithm, whichcomputes the values and the multiplicities of roots of a univariatepolynomial. The procedure is based on the conceptof the degree of a certain Gauss map, which is deduced fromthe polynomial itself. In the bivariate case, we use a combinationof resultants and our procedure for the univariatecase, as the basis for developing an algorithm for locatingthe roots and computing their multiplicities. Our methodsare robust and global in nature. Complexity analysis ofthe proposed methods is included together with comparisonwith standard subdivision methods. Examples illustrateour techniques.
Power Consumption Characterization and Modeling of Embedded Memories in XILINX VIRTEX 400E FPGA
Authors: David Elleouet, Nathalie Julien, Dominique Houzet, J.-G. Cousin, Eric Martin
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

To increase their flexibility, latest FPGA devices integrate processors, arithmetics elements and memories; but these programmable circuits have a significant power consuming, which grows up at each process generation. Then it is necessary to develop reliable high-level power consumption models in order to estimate and reduce the power budget as soon as possible in the design flow. Among the FPGA modeling methods, none has integrated the embedded memory yet. We propose here a power model of embedded memory for the Xilinx Virtex 400E based on physical measurements combined with algorithmic and architectural parameters. This simple model is validated in comparison to Xilinx's estimation tool XPOWER and an example of memory architecture design illustrates the interest of such an approach.
Analysis of a Bandwidth Allocation Strategy for Proportional Streaming Services
Authors: Xiaobo Zhou, Cheng-Zhong Xu
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Clients of streaming services have very diverse service expectations, demanding for differentiated services provisioning from the streaming servers. In this paper, we present a differentiated bandwidth allocation strategy enabled by real-time video adaptation technologies. It aims to provide differentiated streaming bit rates from the server to different client classes in proportion to their pre-specified differentiation weights, independent of the class loads. The allocation strategy is based on the predicted arrival rate of each class and the measured bandwidth release rate of the server. We propose a feedback queue technique, which utilizes the information of the backlogged requests in listen queues to accurately estimate the arrival rates, to improve the differentiation robustness. Simulation results show that the allocation strategy with a FCFS/FF request scheduler can meet the objective of proportional streaming bit rate differentiation in both short and long timescales and greatly enhance the service availability and maintain low queueing-delay when the streaming server load is high.
Efficient Hardware for Antialiasing Coverage Mask Generation
Authors: D. Crisu, S. D. Cotofana, S. Vassiliadis, P. Liuha
Venue: Proceedings of the Computer Graphics International (2004)

An efficient low-cost, low-power hardware implementationof a novel run-time pixel coverage mask generation algorithmfor embedded 3-D graphics antialiasing purposesis presented. The proposed algorithm can be incorporatedin any antialiasing scheme with pre-filtering that is basedon algebraic representation of primitiveýs edges. Whencompared with the state of the art, the described algorithmreduces several times the size of the required hardware implementationdue to the utilization of the quadrant symmetryproperty allowing the storage of only the coverage maskinformation for a few representative edges in one of thequadrants of the plane, the rest of the information being derivedon the fly via computationally inexpensive operations.
Prediction of spreading processes using a supervised self-organizing map
Authors: Dimitrios Moshou, Koen Deprez, Herman Ramon
Venue: Mathematics and Computers in Simulation (2004)

A novel technique is presented based on self-organizing neural networks for prediction of fertilizer distribution patterns of spreaders as a function of spreader settings and fertilizer properties. The main aim of the presented technique is to predict tendencies in the spreading distribution pattern as a function of machine configurations and physical fertilizer properties. The Self-Organizing Map is used in a novel way to represent input-output relationships between high-dimensional spaces. Other NN methods would be very difficult to use because of the high dimensions of the input and output spaces. In the case of a multilayer perceptron, the global connectivity would lead to a prohibitively large number of free parameters giving rise to learning time problems. The spreading distribution patterns are predicted with a high performance with the proposed technique.
On Providing Anonymity in Wireless Sensor Networks
Authors: A. Wadaa, S. Olariu, L. Wilson, M. Eltoweissy, K. Jones
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Securing wireless sensor networks against denial ofservice attacks that disrupt communications or targetnodes serving key roles in the network, e.g. sinks orrouters, is instrumental to network availability andperformance. Particularly vulnerable to these attacks arethe components of any communications or operationinfrastructure in the network. In this paper, we address aclass of wireless sensor networks where networkprotocols leverage a dynamic general-purpose virtualinfrastructure; the core components of that infrastructureare a coordinate system, a cluster structure, and a routingstructure. Since knowledge of this virtual infrastructureenables 'smart' cost-effective DOS attacks on thenetwork, maintaining the anonymity of the virtualinfrastructure is a primary security concern. The maincontribution of this work is to propose an energy-efficientprotocol for maintaining the anonymity of the networkvirtual infrastructure. Specifically, our solution definesschemes for randomizing communications such that thecoordinate system, cluster structure, and routingstructure remain invisible to an external observer ofnetwork traffic during the setup phase of the network.
The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints
Authors: Kazufumi Ito, Karl Kunisch
Venue: SIAM Journal on Control and Optimization (2004)

The primal-dual active set method has proved to be an efficient numerical tool in the context of diverse applications. So far it has been investigated mainly for linear problems. This paper is devoted to the study of global convergence of the primal-dual active set method for nonlinear problems with bilateral constraints. Utilizing the close relationship between the primal-dual active set method and semismooth Newton methods, local superlinear convergence of the method is investigated as well.
The Case for Lifetime Reliability-Aware Microprocessors
Authors: Jayanth Srinivasan, Sarita V. Adve, Pradip Bose, Jude A. Rivers
Venue: ACM SIGARCH Computer Architecture News (2004)

Ensuring long processor lifetimes by limiting failuresdue to wear-out related hard errors is a critical requirementfor all microprocessor manufacturers. We observethat continuous device scaling and increasing temperaturesare making lifetime reliability targets even harder to meet.However, current methodologies for qualifying lifetime reliabilityare overly conservative since they assume worst-caseoperating conditions. This paper makes the case thatthe continued use of such methodologies will significantlyand unnecessarily constrain performance. Instead, lifetimereliability awareness at the microarchitectural design stagecan mitigate this problem, by designing processors that dynamicallyadapt in response to the observed usage to meeta reliability target.We make two specific contributions. First, we describean architecture-level model and its implementation, calledRAMP, that can dynamically track lifetime reliability, respondingto changes in application behavior. RAMP isbased on state-of-the-art device models for different wear-outmechanisms. Second, we propose dynamic reliabilitymanagement (DRM) - a technique where the processorcan respond to changing application behavior to maintainits lifetime reliability target. In contrast to currentworst-case behavior based reliability qualification methodologies,DRM allows processors to be qualified for reliabilityat lower (but more likely) operating points than theworst case. Using RAMP, we show that this can save costand/or improve performance, that dynamic voltage scalingis an effective response technique for DRM, and that dynamicthermal management neither subsumes nor is sub-sumedby DRM.
Interactive debugging of concurrent programs
Authors: Jonice Cynthia Weber
Venue: ACM SIGSOFT Software Engineering Notes (1983)

This paper summarizes techniques for designing and implementing source-level interactive debuggers for concurrent programs. Facilities common to source-level interactive debuggers have been adapted to meet the needs of a concurrent programming environment. Of special interest are those debugging facilities which allow the programmer to monitor and influence the execution of concurrent processes.
Power Awareness through Selective Dynamically Optimized Traces
Authors: Roni Rosner, Yoav Almog, Micha Moffie, Naftali Schwartz, Avi Mendelson
Venue: ACM SIGARCH Computer Architecture News (2004)

We present the PARROT concept that seeks to achievehigher performance with reduced energy consumptionthrough gradual optimization of frequently executed codetraces. The PARROT microarchitectural framework integratestrace caching, dynamic optimizations and pipelinedecoupling. We employ a selective approach for applyingcomplex mechanisms only upon the most frequently usedtraces to maximize the performance gain at any givenpower constraint, thus attaining finer control of tradeoffsbetween performance and power awareness.We show that the PARROT based microarchitecture canimprove the performance of aggressively designed processorsby providing the means to improve the utilizationof their more elaborate resources. At the same time, rigorousselection of traces prior to storage and optimizationprovides the key to attenuating increases in thepower budget.For resource-constrained designs, PARROT based architecturesdeliver better performance (up to an average16% increase in IPC) at a comparable energy level,whereas the conventional path to a similar performanceimprovement consumes an average 70% more energy.Meanwhile, for those designs which can tolerate a higherpower budget, PARROT gracefully scales up to use additionalexecution resources in a uniformly efficient manner.In particular, a PARROT-style doubly-wide machinedelivers an average 45% IPC improvement while actuallyimproving the cubic-MIPS-per-WATT power awarenessmetric by over 50%.
A System Dynamics Framework for Sense-and-Respond Systems
Authors: Lianjun An, J. J. Jeng, Markus Ettl, Jen-Yao Chung
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Sense-and-Respond systems realize the concepts of autonomic computing at the level of business processes. One of the key requirements to build Sense-and-Respond systems is to accurately capture and model the dynamical behavior of business metrics, a.k.a. key performance indicators (KPI). System Dynamics (SD) models and the runtime engines provide means to understand both key performance indicators and the dynamic behaviors (e.g. causality) among them. In this paper, we present a system dynamics model based upon a scenario from supply chain management domain. Our purpose is to demonstrate an alternative approach of building Sense-and-Respond systems. Specifically, we use system dynamics to formally define the KPIs of both the retail inventory and the supplier backlog. Additionally, we introduce objective functions and control variables as the optimization elements being part of the system dynamics formalism. Therefore, the decision (e.g. the order size from manufacturer to suppliers) would correspond to the optimal solution of the system with respect to the defined objective. These concepts will be explained through scenarios. The enabling reference architecture and deployment method using system dynamics are also presented in this paper. After the system dynamics models and corresponding components are deployed to the field, the whole system will manifest the Sense-and-Respond behavior in a dynamical fashion.
The cost behavior of software defects
Authors: J. Christopher Westland
Venue: Decision Support Systems (2004)

The current research attempts to update our knowledge of the way in which defects and the expense of correcting them (or alternatively, leaving them uncorrected) influences the final cost of software. Current industry models are based on data gathered decades ago, which has raised the question of their applicability in a world of modular, graphically intensive, object-oriented software development. The results of the research show that the evolutionary growth model of software errors appears to be valid for contemporary software development programs, and is not just an artefact of the particular techniques used several decades ago. In addition, it concludes that serious defects have less influence on cost than other defects (assuming they are resolved); that defects only generate significant costs if their resolution requires system redesign; that uncorrected defects become exponentially more costly with each phase in which they are unresolved; that the number of days that a project is open is a log-linear predictor of the number of software defects that will be discovered; and that testing must occur over a substantial portion of the useful life of the system in order to detect a substantial portion of the total defects in the software. As the software industry becomes more complex, this research will help us manage defect costs as they contribute to the overall programming costs of the software.