ppxscal/embedding_network huggingface dataset:
Power ENO methods: a fifth-order accurate weighted power ENO method
Authors: Susana Serna, Antonio Marquina
Venue: Journal of Computational Physics (2004)

In this paper we introduce a new class of ENO reconstruction procedures, the Power ENO methods, to design high-order accurate shock capturing methods for hyperbolic conservation laws, based on an extended class of limiters, improving the behavior near discontinuities with respect to the classical ENO methods. Power ENO methods are defined as a correction of classical ENO methods [J. Comput. Phys. 71 (1987) 231], by applying the new limiters on second-order differences or higher. The new class of limiters includes as a particular case the minmod limiter and the harmonic limiter used for the design of the PHM methods [see SIAM J. Sci. Comput. 15 (1994) 892]. The main features of these new ENO methods are the substantially reduced smearing near discontinuities and the good resolution of corners and local extrema. We design a new fifth-order accurate Weighted Power ENO method that improves the behavior of Jiang-Shu WENO5 [J. Comput. Phys. 126 (1996) 202]. We present several one- and two-dimensional numerical experiments for scalar and systems of conservation laws, including linear advections and one- and two-dimensional Riemann problems for the Euler equations of gas dynamics, comparing our methods with the classical and weighted ENO methods, showing the advantages and disadvantages.
On the Remaining Service Time upon Reaching a Given Level in M/G/1 Queues
Authors: Andrzej Chydzinski
Venue: Queueing Systems: Theory and Applications (2004)

The ability of effectively finding the distribution of the remaining service time upon reaching a target level in M/G/1 queueing systems is of great practical importance. Among other things, it is necessary for the estimation of the Quality-of-Service (QoS) provided by Asynchronous Transfer Mode (ATM) networks. The previous papers on this subject did not give a comprehensive solution to the problem. In this paper an explicit formula for this distribution is given. This formula is general as it includes any initial level of the length of the queue, any type of service distribution (heavy tails) and any traffic intensity &rho;. Moreover, it is easy to use and fast in computation. To show this several numerical examples are presented. In addition, a solution of the similar problem in G/M/1 queues (which is the distribution of the remaining interarrival time) is given.
Geometric generalizations of the power of two choices
Authors: John W. Byers, Jeffrey Considine, Michael Mitzenmacher
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

A well-known paradigm for load balancing in parallel and distributed systems is the "power of two choices," whereby an item is stored at the less loaded of two (or more) random alternative servers. We investigate the power of two choices in natural settings where items and servers reside in a geometric space and each item is associated with the server that is its nearest neighbor. This is the setting for example in the Chord distributed hash table, where the geometric space is determined by clockwise distance on a one-dimensional ring. For example, our analysis shows that when $n$ items are placed at n servers with d choices per item, the maximum load at any server is log log n/ log d + O(1) with high probability, only an additive constant more than when servers are chosen uniformly at random. Our proofs are quite general, showing that the power of two choices works under a variety of distributions, with most geometric constructions having at most an additive O(1) penalty. We also show that these techniques still work under highly unbalanced distributions, and give sharp bounds on the necessary number of choices. Finally, we provide simulation results demonstrating the load balance that results as the system size scales into the millions.
Multiresolution model based extraction of product feature lines in reverse engineering
Authors: Zhiyang Chen, Wei Peng, Lili He, Xiuzi Ye
Venue: Engineering with Computers (2004)

In this paper, multiresolution models are employed in the context of reverse engineering for feature line extraction. Starting with a proper triangulation of the cloud point data as a priori, our feature line extraction algorithm has three steps: (1) establishing a Gauss normal sphere and creating multiresolution models for the Gauss sphere based on different levels of subdivisions for the sphere regions; (2) mapping the unit normal vectors of triangular faces in the multiresolution Gauss sphere and merging those connected triangular faces whose unit normal vectors fallen on the same Gauss sphere region with a given resolution to form super-faces (the collection of triangular facets with similar normal); and (3) extracting the boundaries from the super-faces and generating the feature lines from the extracted boundaries. We then use these feature lines as a base for tracing boundary curves for B-spline surface construction. Since feature lines maintain the characteristics of the original product models, in this way, we have a good chance to reconstruct B-spline surfaces with high quality. Examples are given in the paper to show the feature line extraction, the influence of the feature lines extracted under different resolutions, and the final reconstructed B-spline surfaces based on these feature lines.
Tuning the WCET of Embedded Applications
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

It is advantageous to not only calculate the WCET of anapplication, but to also perform transformations to reducethe WCET since an application with a lower WCET willbe less likely to violate its timing constraints. In thispaper we describe an environment consisting of an interactivecompilation system and a timing analyzer, where auser can interactively tune the WCET of an application.After each optimization phase is applied, the timing analyzeris automatically invoked to calculate the WCET ofthe function being tuned. Thus, a user can easily gaugethe progress of reducing the WCET. In addition, the usercan apply a genetic algorithm to search for an effectiveoptimization sequence that best reduces the WCET. Usingthe genetic algorithm, we show that the WCET for a numberof applications can be reduced by 7% on average ascompared to the default batch optimization sequence.
Investor perceptions of traditional and online channels
Authors: Troy J. Strader, Sridhar N. Ramaswami
Venue: Communications of the ACM (2004)

How should financial service firms, online and off, adjust their customer-acquisition and -service strategies to reflect investors' changing expectations?
What We Learn from Multimodal Co-registration Methods for Stereotactic Imaging: From Here to Where?
Authors: Rakesh Sharma
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

CT, MRI, PET and SPECT 3D coregistered imaging is state-of-art in determination of thetreatment planning in stereotactic radiotherapy. Stereotactic correlation of these images needsaccurate localization. For it, a device measures the accuracy of CT, MRI, PET and SPECT based images on measured x, y coordinates of target positions in space. Various methods of multimodal image-fusion quantify the dimensionality, spatial resolution and tissue target geometry. New emerging imaging methods are very specific to gene and biomolecules and pose challenge of registration.
On the Hardness of 4-Coloring a 3-Colorable Graph
Authors: Venkatesan Guruswami, Sanjeev Khanna
Venue: SIAM Journal on Discrete Mathematics (2005)

We give a new proof showing that it is NP-hard to color a 3-colorable graph using just 4 colors. This result is already known , [S. Khanna, N. Linial, and S. Safra, Combinatorica, 20 (2000), pp. 393--415], but our proof is novel because it does not rely on the PCP theorem, while the known one does. This highlights a qualitative difference between the known hardness result for coloring 3-colorable graphs and the factor $n^{\epsilon}$ hardness for approximating the chromatic number of general graphs, as the latter result is known to imply (some form of) PCP theorem [M. Bellare, O. Goldreich, and M. Sudan, SIAM J. Comput., 27 (1998), pp. 805--915].Another aspect in which our proof is novel is in its use of the PCP theorem to show that 4-coloring of 3-colorable graphs remains NP-hard even on bounded-degree graphs (this hardness result does not seem to follow from the earlier reduction of Khanna, Linial, and Safra). We point out that such graphs can always be colored using O(1) colors by a simple greedy algorithm, while the best known algorithm for coloring (general) 3-colorable graphs requires $n^{\Omega(1)}$ colors. Our proof technique also shows that there is an $\varepsilon_0 > 0$ such that it is NP-hard to legally 4-color even a $(1-\varepsilon_0)$ fraction of the edges of a 3-colorable graph.
Evaluation of the Raw Microprocessor: An Exposed-Wire-Delay Architecture for ILP and Streams
Authors: Michael Bedford Taylor, Walter Lee, Jason Miller, David Wentzlaff, Ian Bratt, Ben Greenwald, Henry Hoffmann, Paul Johnson, Jason Kim, James Psota, Arvind Saraf, Nathan Shnidman, Volker Strumpen, Matt Frank, Saman Amarasinghe, Anant Agarwal
Venue: ACM SIGARCH Computer Architecture News (2004)

This paper evaluates the Raw microprocessor. Raw addresses thechallenge of building a general-purpose architecture that performswell on a larger class of stream and embedded computing applicationsthan existing microprocessors, while still running existingILP-based sequential programs with reasonable performance in theface of increasing wire delays. Raw approaches this challenge byimplementing plenty of on-chip resources - including logic, wires,and pins - in a tiled arrangement, and exposing them through a newISA, so that the software can take advantage of these resources forparallel applications. Raw supports both ILP and streams by routingoperands between architecturally-exposed functional units overa point-to-point scalar operand network. This network offers lowlatency for scalar data transport. Raw manages the effect of wiredelays by exposing the interconnect and using software to orchestrateboth scalar and stream data transport.We have implemented a prototype Raw microprocessor in IBM's180 nm, 6-layer copper, CMOS 7SF standard-cell ASIC process. Wehave also implemented ILP and stream compilers. Our evaluationattempts to determine the extent to which Raw succeeds in meetingits goal of serving as a more versatile, general-purpose processor.Central to achieving this goal is Raw's ability to exploit all formsof parallelism, including ILP, DLP, TLP, and Stream parallelism.Specifically, we evaluate the performance of Raw on a diverse setof codes including traditional sequential programs, streaming applications,server workloads and bit-level embedded computation.Our experimental methodology makes use of a cycle-accurate simulatorvalidated against our real hardware. Compared to a 180 nmPentium-III, using commodity PC memory system components, Rawperforms within a factor of 2x for sequential applications with a verylow degree of ILP, about 2x to 9x better for higher levels of ILP, and10x-100x better when highly parallel applications are coded in astream language or optimized by hand. The paper also proposes anew versatility metric and uses it to discuss the generality of Raw.
Parallel Fast Algorithm for Large-scale Electromagnetic Scattering
Authors: Fang Wu, Yaojiang Zhang, Zaw Zaw Oo, Erping Li
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Electromagnetic scattering analysis for radar cross section (RCS) prediction and electromagnetic compatibility analysis have extensive military and civil applications. Meanwhile, it presents very large computational demands. Parallel Multi-level Fast Multipole Method (MLFMM), a powerful and efficient computational algorithm on solving large-scale RCS problems, is developed and implemented on massively parallel, distributed memory computer systems. Multi-level grouping structure is partitioned carefully to separate computational tasks and reduce data communication. Message Passing Interface (MPI) is employed to perform the data transfer among processors and support the matrix-vector product in parallel iterative procedure. The accuracy of code is verified by comparison with results of benchmark target. The computational complexity and efficiency of parallel MLFMM is discussed. The parallel code is validated on Unix and Linux platforms with different number of processors, and proven to be scalable, portable, and efficient.
Interactive program execution in Lispedit
Authors: Martin Mikelsons
Venue: ACM SIGSOFT Software Engineering Notes (1983)

We describe a powerful interactive debugger (Heval) embedded in a larger programming environment (Lispedit). In Lispedit, the programmer creates, edits and files Lisp functions from a uniform editor interface that makes use of the structure of Lisp expressions. With Heval, the programmer can execute Lisp expressions and functions in a very natural way through the editor interface. We describe the debugging interface and how it has evolved over several years of use.
On-line Monitoring Capabilities of Oscillation Test Techniques: Results Demonstration in an OTA
Authors: R. Picos, M. Roca, E. Isern, S. A. Bota, E. Garcia
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper analyses the capabilities of oscillation testtechniques applied to an operational amplifier with faultinjection capabilities. The related effect of catastrophicand parametric defects (bridges open and shorts) havebeen analyzed. Results show that these techniquesprovides high fault coverage levels regarding thatdifferent test observables have been used.
A music recommender based on audio features
Authors: Qing Li, Byeong Man Kim, Dong Hai Guan, Duk whan Oh
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Many collaborative music recommender systems (CMRS) have succeeded in capturing the similarity among users or items based on ratings, however they have rarely considered about the available information from the multimedia such as genres, let alone audio features from the media stream. Such information is valuable and can be used to solve several problems in RS. In this paper, we design a CMRS based on audio features of the multimedia stream. In the CMRS, we provide recommendation service by our proposed method where a clustering technique is used to integrate the audio features of music into the collaborative filtering (CF) framework in hopes of achieving better performance. Experiments are carried out to demonstrate that our approach is feasible.
Modeling and simulation of spiral inductors in wafer level packaged RF/wireless chips
Authors: Xinzhong Duo, Li-Rong Zheng, Hannu Tenhunen
Venue: Analog Integrated Circuits and Signal Processing (2003)

In this paper, embedded rectangular spiral inductors on Wafer-Level Packaged (WLP) RF/wireless chips were studied with 3D (three-dimensional) EM (electromagnetic) simulations. The performance of spiral inductors fabricated with various geometrical and technological parameters was analyzed. It is shown that Q (the quality factor) and fres (the self-resonance frequency) could be improved by using the thick insulator layer and thick/wide metal line, which are fabricated by WLP technology. The value of Q could be over 60 at 20 GHz for such embedded components, attesting a significant improvement compared to the conventional on-chip counterparts in CMOS. Through this study, optimal structures for such components are identified and guidelines for design and fabrications are derived. Finally, a method to estimate the inductance of rectangle spiral inductors is developed. It is useful to determine the approximate structure of an inductor quickly before detailed 3D EM simulation, which may cost a long time.
Corrections for space-clamp errors in measured parameters of voltage-dependent conductances in a cylindrical neurite
Authors: Ann M. Castelfranco, Daniel K. Hartline
Venue: Biological Cybernetics (2004)

The ability to correct parameters of voltage-gated conductances measured under poor spatial control by point voltage clamp could rescue much flawed experimental data. We explore a strategy for correcting errors in experiments that employs a full-trace approach to parameter determination. Simulated soma voltage-clamp runs are made on a model neuron with a single voltage-gated, Hodgkin-Huxley channel type distributed uniformly along an elongate process. Estimates for both kinetic and I(V) parameters are obtained by fitting a form of the Hodgkin-Huxley equations to the complete time course of leak-subtracted current curves. The fitted parameters are used to determine how much correction in each parameter is needed to regenerate the set actually belonging to the channel. Corrections are generated for a range of neurite lengths, conductance densities, and channel characteristics.
Heart Rate Variability and its Clinical Application for Biofeedback
Authors: Nutan D. Ahuja
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The Heart Rate Variability test gives an incredibly accurate view of the autonomic nervoussystems and the variableness of the heart. It shows the state of relative health. Heart RateVariability shows the correspondence between specific physiological components and thefrequency spectrum. The two components are the sympathetic and parasympathetic neuralsystems, which originate in the brain and effect organs throughout the body. The activity ofthe sympathetic system is heightened during fight/flight reaction to danger and for suchresponses as fear, anger and anxiety. HRV biofeedback training offer a more precise methodfor helping patients to moderate this heightened sympathetic activity that is associated withstress, anxiety, and dysphoric mood. In biofeedback, we simply support these internalpathways with external functions that make it biofeedback sources of information. It is theseexternal feedback paths on your internal biological There have been small-scale studies thathave provided supporting evidence to bolster this hope for HRV biofeedback. Therefore weare performing clinical trials to firmly establish HRV biofeedback as an evidence-basedtreatment for reducing negative effects or for improving heart health. A number of patientswere clinically diagnosed and their ECG data is then fed to the software, which displays theinformation of the patient on computer screen. It provides evaluating Heart RateVariability.This will help the individual to self regulate his/her own health and growth;thereby providing a very robust biofeedback that can be easily used for diagnosis andcommunicating process.
Erratum: Nonlinear Observer Design in the Siegel Domain
Authors: Arthur J. Krener, MingQing Xiao
Venue: SIAM Journal on Control and Optimization (2004)

There is an error in the proof of the main result of our paper SIAM J. Control Optim., 41 (2002), pp. 932--953]. An additional assumption is needed for the main result to hold. In this erratum, we supply a corrected version of the main result.
Handover in Mobile Communication Networks: Who is in Control Anyway?
Authors: Frank A. Zdarsky, Jens B. Schmitt
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The migration from 3rd generation mobile communication networks to 4th generation, purely IP-based networks leads to new chances, but also great risks for the traditional mobile network operators, as competition increases dramatically. While this competition potentially improves the cost-value ratio for mobile users, they might well find their freedom of seamless session mobility abruptly end at the administrative borders of Wireless Internet Service Providers. In this paper, we will describe a possible and in our opinion likely scenario for future mobile wireless access, point out the inherent problem of current IP mobility management schemes when it comes to inter-provider handovers, have a look at why control over this process is currently shared between the network and the mobile end-devices, and describe approaches to shift the major part of control back to the user.
Challenges and Requirements for an Effective Trace Exploration Tool
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Building efficient tools for the analysis andexploration of large execution traces can be a verychallenging task.Our experience with building a toolcalled SEAT (Software Exploration and Analysis Tool)shows that there is a need to address several key researchquestions in order to overcome these challenges.SEAT isintended to integrate several filtering techniques to tacklethe size explosion problem that make traces hard tounderstand.However, the incorporation of thesetechniques into one efficient tool raises many issues.Thispaper focuses on these issues and underlies futureresearch directions to advance the area of dynamicanalysis of large software systems.
Scaling to the End of Silicon with EDGE Architectures
Authors: Doug Burger, Stephen W. Keckler, Kathryn S. McKinley, Mike Dahlin, Lizy K. John, Calvin Lin, Charles R. Moore, James Burrill, Robert G. McDonald, William Yoder, the TRIPS Team
Venue: Computer (2004)

Post-RISC microprocessor designs must introduce new ISAs to address the challenges that modern CMOS technologies pose while also exploiting the massive levels of integration now possible. To meet these challenges, the TRIPS Team at the University of Texas at Austin has developed a new class of ISAs, called Explicit Data Graph Execution, that will match the characteristics of semiconductor technology over the next decade.EDGE architectures appear to offer a progressively better solution as technology scales down to the end of silicon, with each generation providing a richer spatial substrate at the expense of increased global communication delays.
Memory Efficient Adjacent Triangle Connectivity of a Vertex Using Triangle Strips
Authors: Hidekuni Annaka, Tsukasa Matsuoka
Venue: Proceedings of the Computer Graphics International (2004)

We often need to refer to adjacent elements (e.g., vertices,edges and triangles) in triangle meshes for rendering,mesh simplification and other processes. It is, however,sometimes impossible to prepare the enormous memoryneeded to represent element connectivity in gigantic trianglemeshes. This paper proposes a new scheme for referringto adjacent triangles around a vertex in non-manifoldtriangle meshes. First, we introduce the constraints to allowrandom access to a triangle in a sequence of triangle strips.Then, for each vertex, we construct a list of references to itsadjacent strips as a representation of triangle connectivity.Experimental results show that, compared to conventionalmethods, our scheme can reduce the total size of a trianglemesh and adjacent triangle connectivity to about 50%.
Performance Evaluation and Failure Rate Prediction for the Soft Implemented Error Detection Technique
Authors: B. Nicolescu, Y. Savaria, R. Velazco
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper presents two error models to evaluate safetyof a software error detection method. The proposed modelsanalyze the impact on program overhead in terms ofmemory code area and increased execution time when thestudied error detection technique is applied. For faultsaffecting the processor's registers, analytic formulas arederived to estimate the failure rate before programexecution. These formulas are based on probabilisticmethods and use statistics of the program, which arecollected during compilation. The studied error detectiontechnique was applied to several benchmark programs andthen program overhead and failure rate was estimated.Experimental results validate the estimated performancesand show the effectiveness of the proposed evaluation formulas.