ppxscal/embedding_network huggingface dataset:
GridView: A Dynamic and Visual Grid Monitoring System
Authors: Ni Guangbao, Ma Jie, Li Bo
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Computational and Data Grids consist of the coordinated utilization of large sets of diverse, geographically distributed resources for high performance computation. In order to make better use of these computing entities, a substantial amount of monitoring data is collected for a variety of tasks. The large number of heterogeneous resources available in Grids makes the task challenging. The processing of mass data is another problem with large amounts of monitoring data increasing. In this paper, a monitoring system in Grid environment called GridView is presented. It gathers much important information from a large computing facility. For giving more efficient performance evaluation, comprehensive computation capacity (C3) model is set up. GridView also gives mass data management mechanism and mass data visualization technique. Due to the Grid environment, GridView must consider dynamic changes and heterogeneous characteristic of different platforms.
Extended Split-Issue: Enabling Flexibility in the Hardware Implementation of NUAL VLIW DSPs
Authors: Bharath Iyer, Sadagopan Srinivasan, Bruce Jacob
Venue: Proceedings of the 31st annual international symposium on Computer architecture (2004)

VLIW architecture based DSPs have become widespread due to thecombined benefits of simple hardware and compiler-extractedinstruction-level parallelism. However, the VLIW instruction setarchitecture and its hardware implementation are tightly coupled,especially so for Non-Unit Assumed Latency (NUAL) VLIWs. Theproblem of object code compatibility across processors having differentnumbers of functional units or hardware latencies has beenthe Achilles' heel of this otherwise powerful architecture. In thispaper, we propose eXtended Split-Issue (XSI), a novel mechanismthat breaks the instruction packet syntax of an NUAL VLIW compilerwithout violating the dataflow dependences. XSI provides a designerthe freedom of disassociating the hardware implementation of theNUAL VLIW processor from the instruction set architecture. Further,we investigate fairly radical (in the context of VLIW) changes to thehardware-like removing an adder, adding a multiplier, and incorporatingsimultaneous multithreading (SMT)-to show that ourtechnique works for a variety of hardware configurations withoutcompromising on performance. The technique can be used in bothsingle-threaded and multi-threaded architectures to achieve a levelof flexibility heretofore unavailable in the VLIW arena.
Scaling Evaluation of the Lattice Solid Model on the SGI Altix 3700
Authors: Shane Latham, Steffen Abe, Matt Davies
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

The Lattice Solid Model is a particle based method which has been successfully employed for simulating the fracturing of rocks, the dynamics of faults, earthquakes and gouge processes.However, results from initial simulations demonstrate that models consisting of only thousands of particles are inadequate to accurately reproduce the micro-physics of seismic phenomenon.Instead, models with millions or tens of millions of particles are required to produce realistic simulations.Parallel computing architectures, such as the SGI Altix 3700, provide the opportunity to solve much larger computational problems than traditional single processor systems.In order to take advantage of high performance systems, a Message Passing Interface version of the Lattice Solid Model has been implemented.Benchmarks, presented in this paper, demonstrate an 80% parallel efficiency for the parallel Lattice Solid Model on 128 processors of the SGI Altix 3700.These results, for a two-dimensional wave propagation problem, indicate the potential for the Lattice Solid Model to simulate more computationally challenging three-dimensional geophysical processes.
An Automated Methodology for Low Electro-Magnetic Emissions Digital Circuits Design
Authors: Ivan Blunno, Guy Alain Narboni, Claudio Passerone
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents an automated methodology for the design of low electromagnetic emissions digital circuits based on an optimized clock skew scheduling. The assumption that a unique clock signal must reach all memory elements of a circuit is common to all standard design flows for synchronous circuits. Unfortunately, the almost simultaneous switching of all gates in the circuit is responsible for very sharp and narrow peaks of current absorption from the power supply line. The consequent steepness of rising and falling edges of these current pulses will result in significant contributions on a very wide range of frequencies and therefore can be considered the main cause for both conducted and radiated emissions in integrated circuits. A fully automated design flow has been developed integrating new tools with standard tools and allowing the designer to desynchronize a synchronous circuit. Our tools are able to read the Standard Delay File of a circuit, to derive a set of relative timing constraints for the clock inputs of each memory element in the circuit and then to generate a partition of the circuit into a given number of clock domains. The methodology and the tools have been tested on a 16 bit microprocessor with 5 stages of pipeline showing a dramatic reduction of the current spectrum in the range of frequencies between 100MHz and 1GHz.
Eclipse goes native
Authors: John Healy, Andrew Haley, Tom Tromey
Venue: Linux Journal (2004)

Now you don't have to wait for a JVM to run your Java app on a new platform.
Pancyclicity on Möbius cubes with maximal edge faults
Authors: Sun-Yuan Hsieh, Chun-Hua Chen
Venue: Parallel Computing (2004)

A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |V| in G. Let Fe be the set of faulty edges. In this paper, we show that an n-dimensional Möbius cube, n ≥ 1, contains a fault-free Hamiltonian path when |Fe| ≤ n - 1. We also show that an n- dimensional Möbius cube, n ≥ 2, is pancyclic when |Fe| ≤ n - 2. Since an n-dimensional Möbius cube is regular of degree n, both results are optimal in the worst case.
A penalty method for American options with jump diffusion processes
Authors: Y. d&#x2019;Halluin, P. A. Forsyth, G. Labahn
Venue: Numerische Mathematik (2004)

The fair price for an American option where the underlying asset follows a jump diffusion process can be formulated as a partial integral differential linear complementarity problem. We develop an implicit discretization method for pricing such American options. The jump diffusion correlation integral term is computed using an iterative method coupled with an FFT while the American constraint is imposed by using a penalty method. We derive sufficient conditions for global convergence of the discrete penalized equations at each timestep. Finally, we present numerical tests which illustrate such convergence.
An Architecture for Inter-Domain Troubleshooting
Authors: David G. Thaler, Chinya V. Ravishankar
Venue: Journal of Network and Systems Management (2004)

In this paper, we explore the constraints of a new problem: that of coordinating network troubleshooting among peer administrative domains and untrusted observers. Our approach permits any entity to report problems, whether it is a Network Operations Center (NOC), end-user, or application. Our goals are to define the inter-domain coordination problem clearly, and to develop an architecture which allows observers to report problems and receive timely feedback, regardless of their own locations and identities. By automating this process, we also relieve human bottlenecks at help desks and NOCs whenever possible. We present a troubleshooting approach for coordinating problem diagnosis, and describe Global Distributed Troubleshooting (GDT), a distributed protocol which realizes this approach. We show through simulation that GDT scales well as the number of observers and problems grows.
A comparison of fisheye lenses for interactive layout tasks
Authors: Carl Gutwin, Chris Fedak
Venue: Proceedings of Graphics Interface 2004 (2004)

Interactive fisheye views allow users to edit data and manipulate objects through the distortion lens. Although several varieties of fisheye lens exist, little is known about how the different types fare for different interactive tasks. In this paper, we investigate one kind of interaction -- layout of graphical objects -- that can be problematic in fisheyes. Layout involves judgments of distance, alignment, and angle, all of which can be adversely affected by the distortion of a fisheye. We compared performance on layout tasks with three kinds of fisheye: a full-screen pyramid lens, a constrained hemispherical lens, and a constrained flat-topped hemisphere. We found that accuracy was significantly better with the constrained lenses compared to the full-screen lens, and also that the simple hemisphere was better at higher levels of distortion than the flat-topped version. The study shows that although there is a cost to doing layout through distortion, it is feasible, particularly with constrained lenses. In addition, our findings provide initial empirical evidence of the differences between competing fisheye varieties.
Dynamic CPU Management for Real-Time, Middleware-Based Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Many real-world distributed, real-time, embedded(DRE) systems, such as multi-agent military applications, are builtusing commercially available operating systems, middleware, andcollections of pre-existing software. The complexity of these systemsmakes it difficult to ensure that they maintain high qualityof service (QOS). At design time, the challenge is to introducecoordinated QOS controls into multiple software elements ina non-invasive manner. At run time, the system must adaptdynamically to maintain high QOS in the face of both expectedevents, such as application mode changes, and unexpected events,such as resource demands from other applications.In this paper we describe the design and implementation ofa CPU Broker for these types of DRE systems. The CPU Brokermediates between multiple real-time tasks and the facilities of areal-time operating system: using feedback and other inputs, itadjusts allocations over time to ensure that high application-levelQOS is maintained. The broker connects to its monitored tasks ina non-invasive manner, is based on and integrated with industry-standardmiddleware, and implements an open architecture fornew CPU management policies. Moreover, these features allowthe broker to be easily combined with other QOS mechanismsand policies, as part of an overall end-to-end QOS managementsystem. We describe our experience in applying the CPU Brokerto a simulated DRE military system. Our results show that thebroker connects to the system transparently and allows it tofunction in the face of run-time CPU resource contention.
Three-dimensional Visualization of Radiological Images using Octrees
Authors: Thiago R. dos Santos, Daniel D. Abdala, Aldo von Wangenheim
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents a method for robust three-dimensional representation and visualization of radiological image volumes, such as computer tomographies and magnetic resonances, taking advantage of the use of a well-known data-structure: the octree.
Modeling and Prediction of the Dynamic Behaviour of Microbeams Under Electrostatic Load
Authors: Eugenio Brusa, Francesco De Bona, Antonio Gugliotta, Aurelio Somà
Venue: Analog Integrated Circuits and Signal Processing (2004)

This paper investigates the features of different techniques to model the dynamic behaviour of microbeams electrostatically actuated, mainly to identify the frequency shifting due to the electromechanical coupling. The aim is to define an engineering approach to be followed for a preliminary characterization of the microsystem. In a first part of the paper the main aspect addressed is the application of a systematic approach to write the equations of motion, applicable not only to this particular device, but in general to MEMs. The Lagrangian generalized method is outlined and applied to the current case of electromechanical coupling.A second issue concerns the application either of lumped or distributed parameters models, eventually discretized by FEM or equivalent techniques. A first model with a single degree of freedom of a double clamped microbeam is investigated: the analytic solution of the linearized equation of motion is compared to the numerical one of the nonlinear problem, solved by the Newmark's method. FEM models are then introduced and compared to the Newmark numerical integration applied to the single d.o.f. Although an accurate prediction of the nonlinear dynamic behaviour of the system can be drawn by the FEM-Newmark approach, a new procedure for a fast and preliminary estimation of the frequency response has been developed: the relationship between frequency and voltage is approximated by means of a parabolic curve based on two interpolation points, corresponding to the steady-state frequency (pure mechanical actuation) and to an arbitrary value of voltage, for which the Newmark's method is applied only once.
Comparison of using passages and documents for blind relevance feedback in information retrieval
Authors: Zhenmei Gu, Ming Luo
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

This paper compares document blind feedback and passage blind feedback in Information Retrieval (IR), based on the work during the NRRC 2003 Reliable Information Access Summer workshop. The analysis of our experimental results shows overall consistency on the performance impact of using passages and documents for blind feedback. However, it is observed that the behavior of passage blind feedback, compared to document blind feedback, is both system dependent and topic dependent. The relationships between the performance impact of passage blind feedback and the number of feedback terms and the topic's average relevant document length, respectively, are examined to illustrate these dependencies.
On the performance of randomized embedding of reproduction trees in static networks
Authors: Keqin Li
Venue: International Journal of Parallel Programming (2003)

High performance computing requires high quality load distribution of processes of a parallel application over processors in a parallel computer at runtime such that both the maximum load and dilation are minimized. The performance of a simple randomized tree embedding algorithm that dynamically supports tree-structured parallel computations on arbitrary static networks is analyzed in this paper. The algorithm spreads newly created tree nodes to neighboring processors, which actually provides randomized dilation-1 tree embedding in static networks. We develop a linear system of equations that characterizes expected loads on all processors under the reproduction tree model, which can generate trees of arbitrary size and shape. It is shown that as the tree size becomes large, the asymptotic performance ratio of the randomized tree embedding algorithm is the ratio of the maximum processor degree to the average processor degree. This implies that the simple randomized tree embedding algorithm is able to generate high quality load distributions on virtually all static networks commonly employed in parallel and distributed computing.
Policy-based Congestion Management for an SMS Gateway
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

We present a policy-based approach to managingcongestions in Short Message Service (SMS) systems.Congestion situations typically occur on SMSGateways (SMSGs), which route SMS messagesbetween different networks and domains. In ourarchitecture, an SMS operator can dynamically definethe maximum acceptable loss of messages of a non-guaranteedSMS service class, thereby controlling thetrade-off between minimal message loss and maximumthroughput in an SMS system. We present thefunctional architecture of a manageable SMSG anddiscuss the realization of the Policy Decision Point(PDP), which applies the congestion policy on theSMSG. An implementation of our architecture on acommercial SMSG, the EMG, is underway.
Learning from imbalanced data sets with boosting and data generation: the DataBoost-IM approach
Authors: Hongyu Guo, Herna L. Viktor
Venue: ACM SIGKDD Explorations Newsletter (2004)

Learning from imbalanced data sets, where the number of examples of one (majority) class is much higher than the others, presents an important challenge to the machine learning community. Traditional machine learning algorithms may be biased towards the majority class, thus producing poor predictive accuracy over the minority class. In this paper, we describe a new approach that combines boosting, an ensemble-based learning algorithm, with data generation to improve the predictive power of classifiers against imbalanced data sets consisting of two classes. In the DataBoost-IM method, hard examples from both the majority and minority classes are identified during execution of the boosting algorithm. Subsequently, the hard examples are used to separately generate synthetic examples for the majority and minority classes. The synthetic data are then added to the original training set, and the class distribution and the total weights of the different classes in the new training set are rebalanced. The DataBoost-IM method was evaluated, in terms of the F-measures, G-mean and overall accuracy, against seventeen highly and moderately imbalanced data sets using decision trees as base classifiers. Our results are promising and show that the DataBoost-IM method compares well in comparison with a base classifier, a standard benchmarking boosting algorithm and three advanced boosting-based algorithms for imbalanced data set. Results indicate that our approach does not sacrifice one class in favor of the other, but produces high predictions against both minority and majority classes.
Tiled Shadow Maps
Authors: Jukka Arvo
Venue: Proceedings of the Computer Graphics International (2004)

Shadow mapping is a commonly used technique for generatinghard shadows in computer graphics, but the generatedshadow boundaries often suffer from aliasing due tothe discrete nature of the shadow map. In this paper weintroduce a new hardware accelerated algorithm which iscapable of adjusting shadow map sampling rates inside ashadow map of constant size. This is achieved by tiling thelight view and changing the sampling quality according to aheuristical analysis. The implementation is straightforwardon current consumer level graphics hardware and the algorithmcan therefore be included into existing applications.In our test scenarios the cost of the improved image qualitywas moderate, making this method a viable option forincreasing the quality of hard shadows.
Guarding the Castle Keep: Teaching with the Fortress Metaphor
Authors: Deborah A. Frincke, Matt Bishop
Venue: IEEE Security and Privacy (2004)

The computer security field is replete with metaphorsýthe original and most commonly used metaphor is the computer (or network) as a fortress, the walls of which must be guarded against potential breaches. This metaphor is useful, but like all metaphors, it is not precise. Understanding the differences between the metaphor of a fortress, and the realities of securing a system, is crucial to students understanding the subtleties of computer security. In this column, we discuss the fortress metaphor as a pedagogical tool, both how it succeeds and how it fails to aid studentunderstanding.
Program Comprehension for Web Services
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Web services provide programmatic interactionbetween organisations within large heterogeneousdistributed systems. Using recent experiences ofconstructing and enhancing a data integration system forthe health domain, based on web services, we drawconclusions about new problems for programcomprehension. These derive from the fundamentallydynamic and distributed nature of the environment. Wesuggest several key research topics for programcomprehension, arguing that these are crucial if softwareconstructed from web services is to be supportable over along period. Finally, we briefly summarise some widerconclusions about understanding web services at theapplication domain level.
Dimensions of Ignorance in a Semi-Structured Data Model
Authors: Matteo Magnani, Danilo Montesi
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Before defining a model for uncertain and imprecise semi-structured data, a clear understanding of the semantics of ignorance is necessary. In this paper, we show that many dimensions of ignorance may co-exist inside a semi-structured data instance. We classify them, on the basis of a general data model, and we identify their inter-dependencies. We also show that the restriction of our model to the relational context leads to only one dimension of ignorance, as revealed in many other scientific works.
Detailed cache coherence characterization for OpenMP benchmarks
Authors: Jaydeep Marathe, Anita Nagarajan, Frank Mueller
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Past work on studying cache coherence in shared-memory symmetric multiprocessors (SMPs) concentrates on studying aggregate events, often from an architecture point of view. However, this approach provides insufficient information about the exact sources of inefficiencies in parallel applications. For SMPs in contemporary clusters, application performance is impacted by the pattern of shared memory usage, and it becomes essential to understand coherence behavior in terms of the application program constructs -- such as data structures and source code lines.The technical contributions of this work are as follows. We introduce ccSIM, a cache-coherent memory simulator fed by data traces obtained through on-the-fly dynamic binary rewriting of OpenMP benchmarks executing on a Power3 SMP node. We explore the degrees of freedom in interleaving data traces from the different processors and assess the simulation accuracy by comparing with hardware performance counters. The novelty of ccSIM lies in its ability to relate coherence traffic -- specifically coherence misses as well as their progenitor invalidations -- to data structures and to their reference locations in the source program, thereby facilitating the detection of inefficiencies. Our experiments demonstrate that (a) cache coherence traffic is simulated accurately for SPMD programming styles as its invalidation traffic closely matches the corresponding hardware performance counters, (b) we derive detailed coherence information indicating the location of invalidations in the application code, i.e, source line and data structures and (c) we illustrate opportunities for optimizations from these details. By exploiting these unique features of ccSIM, we were able to identify and locate opportunities for program transformations, including interactions with OpenMP constructs, resulting in both significantly decreased coherence misses and savings of up to 73% in wall-clock execution time for several real-world benchmarks.