ppxscal/embedding_network huggingface dataset:
An Adaptive Generalized Scheduler for Grid Applications
Authors: Akshai K. Aggarwal, Robert D. Kent
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The compute resources of a grid resource-service provider may be distributed over a wide geographical area. If the resource-service provider is to use his resources effectively, in addition to the characteristics of the compute-nodes and the applications, the characteristics of the communication network must also be known. A generalized scheduler should be able to handle a diverse set of jobs, with arbitrary inter-dependencies among processes and arbitrary communication channel delays. On a grid, the scheduling algorithm should respond quickly to the changing workload and environmental conditions without causing much overhead. Hence it should be able to customize its strategy in accordance with the prevailing conditions. In this paper, the algorithm for an adaptive scheduler, which can be used to map a set of jobs, of wide diversity, to a dynamic set of nodes, with prior reservations, is being presented. The scheduler has been tested extensively.
3-coloring in time O(1.3289n)
Authors: Richard Beigel, David Eppstein
Venue: Journal of Algorithms (2005)

We consider worst case time bounds for several NP-complete problems, based on a constraint satisfaction (CSP) formulation of these problems: (a, b)-CSP instances consist of a set of variables, each with up to a possible values, and constraints disallowing certain b-tuples of variable values; a problem is solved by assigning values to all variables satisfying all constraints, or by showing that no such assignment exist. 3-SAT is equivalent to (2, 3)-CSP while 3-coloring and various related problems are special cases of (3, 2)-CSP; there is also a natural duality transformation from (a, b)-CSP to (b, a)-CSP. We show that n-variable (3, 2)-CSP instances can be solved in time O(1.3645n), that satisfying assignments to (d, 2)-CSP instances can be found in randomized expected time O((0.4518d)n); that 3-coloring of n-vertex graphs can be solved in time O(1.3289n); that 3-list-coloring of n-vertex graphs can be solved in time O(1.3645n); that 3-edge-coloring of n-vertex graphs can be solved in time O(2n/2), and that 3-satisfiability of a formula with t 3-clauses can be solved in time O(nO(1) + 1.3645t).
Algorithm 841: BHESS: Gaussian reduction to a similar banded Hessenberg form
Authors: Gary W. Howell
Venue: ACM Transactions on Mathematical Software (TOMS) (2005)

BHESS uses Gaussian similarity transformations to reduce a general real square matrix to similar upper Hessenberg form. Multipliers are bounded in root mean square by a user-supplied parameter. If the input matrix is not highly nonnormal and the user-supplied tolerance on multipliers is of a size greater than ten, the returned matrix usually has small upper bandwidth. In such a case, eigenvalues of the returned matrix can be determined by the bulge-chasing BR iteration or by Rayleigh quotient iteration. BHESS followed by BR iteration determines a complete spectrum in about one-fifth the time required for orthogonal reduction to Hessenberg form followed by QR iterations. The FORTRAN 77 code provided for BHESS runs efficiently on a cache-based architecture.
An Efficient CAD Method to Design Dual-Band Probe-Fed Microstrip Antennas Using a Fuzzy Approach
Authors: V. Sathi, Ch. Ghobadi, J. Nourinia
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Dual-frequency patch antennas may provide an alternative to large bandwidth planar antennas, in applications in which large bandwidth is really needed for operating at to separate transmit-receive bands. When the two frequencies are far apart, a dual frequency patch structure can be conceived to avoid the use of separate antennas. In this paper the multiport analysis is coupled with an intelligent fuzzy method, to design dual-band microstrip antennas with shorting strips. An efficient CAD tool is proposed to design this type of antennas. Simulation results are compared to the results obtained by the FEM-based software, HFSS and the experimental results are also included.
Chianti: a change impact analysis tool for java programs
Authors: Xiaoxia Ren, Barbara G. Ryder, Maximilian Stoerzer, Frank Tip
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Chianti is a change impact analysis tool for Java that is implemented in the context of the Eclipse environment. Chianti analyzes two versions of a Java program, decomposes their difference into a set of atomic changes, and a partial order inter-dependences of these changes is calculated. Change impact is then reported in terms of affected (regression or unit) tests whose execution behavior may have been modified by the applied changes. For each affected test, Chianti also determines a set of affecting changes that were responsible for the test's modified behavior. This latter step of isolating failure inducing changes for one specific test from irrelevant changes can be used as a debugging technique in situations where a test fails unexpectedly after a long editing session.
Study of PECVD SiOxNy films dielectric properties with different nitrogen concentration utilizing MOS capacitors
Authors: K. F. Albertin, I. Pereyra
Venue: Microelectronic Engineering (2005)

In this work metal/oxide/semiconductor (MOS) capacitors with different nitrogen content SiO"xN"y gate dielectric are fabricated and characterized. The dielectric films are deposited by the plasma enhanced chemical vapor deposition technique from N"2, N"2O and SiH"4 gaseous mixtures at low temperatures. The MOS capacitors were characterized by low and high frequency capacitance (C-V) measurements, from where the interface state density (D"i"t), the effective charge density (N"e"f"f) and the dielectric constant (k) were extracted. The results show a dielectric constant varying linearly in function of the films nitrogen concentration, from a value of 3.9, corresponding to SiO"2 to 7.2, corresponding to Si"3N"4. We observed a variation of D"i"t in function of the films nitrogen concentration, the smallest obtained value corresponding to the Si"3N"4 film (~1x10^1^1 cm^-^2eV^-^1), however this film presents higher leakage current density than others. In order to optimize both parameters a double dielectric layer is proposed, a first layer of Si"3N"4 film, which presents the highest dielectric constant and best interface properties, and a second layer of SiO"xN"y with high nitrogen concentration, in order to maintain the equivalent dielectric constant high but minimizing the leakage current problems.
ACM SIGACT news distributed computing column 16
Authors: Sergio Rajsbaum
Venue: ACM SIGACT News (2004)

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web.
An Efficient Architecture for a Lifted 2D Biorthogonal DWT
Authors: Mehboob Alam, Wael Badawy, Vassil Dimitrov, Graham Jullien
Venue: Journal of VLSI Signal Processing Systems (2005)

This paper presents a new algorithm for a 2D non-separable lifted bi-orthogonal wavelet transform. The algorithm is derived by factoring complementary pairs of wavelet transform 2D filters. The results are efficient architectures for real time signal processing, which do not require transpose memory for the 2D processing of data. The proposed architecture exploits in place implementation, inherit from the algorithm, and can take advantage of both vertical and horizontal parallelism in the direct implementation. The processing in our architecture is scheduled by carefully pipelining the lifted steps, which allows for up to four times faster processing than the direct implementation. The proposed architecture operates at high speed, consumes low power and has reduced computational complexity as compared to previously published filter and lifted based bi-orthogonal wavelet architectures.
TOPS (Task Optimization in the Presence of Signal-Dependent Noise) model
Authors: Hiroyuki Miyamoto, Eri Nakano, Daniel M. Wolpert, Mitsuo Kawato
Venue: Systems and Computers in Japan (2004)

This paper proposes a movement trajectory planning model, which is a maximum task achievement model in which signal-dependent noise is added to the movement command. In the proposed model, two optimization criteria are combined, maximum task achievement and minimum energy consumption. The proposed model has the feature that the end-point boundary conditions for position, velocity, and acceleration need not be prespecified. Consequently, the method can be applied not only to the simple point-to-point movement, but to any task. In the method in this paper, the hand trajectory is derived by a psychophysical experiment and a numerical experiment for the case in which the target is not stationary, but is a moving region. It is shown that the trajectory predicted from the minimum jerk model or the minimum torque change model differs considerably from the results of the psychophysical experiment. But the trajectory predicted from the maximum task achievement model shows good qualitative agreement with the hand trajectory obtained from the psychophysical experiment. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 48&ndash;58, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10377
Multi-Platforms Medical Computer Systems Integration
Authors: Marina Krol, David L. Reich, Justin Dupont
Venue: Journal of Medical Systems (2005)

Presently, software architects face the challenge of integrating and linking different application software packages built on different computer platforms. Often they inherit various systems, ranging from mainframe to PDA-based applications. The first stage before programming different interfaces is to identify the means of communications most suitable for particular systems.The experience of the Mount Sinai Medical Center in New York, which combines a hospital, a healthcare network, a research center and a medical school, illustrates common problems faced by a number of medical institutions.This paper will discuss the various options, including the Internet, software architects have, and how they can use them during the development of an infrastructure for health care systems.
Dynamically-optimized context in recommender systems
Authors: Ghim-Eng Yap, Ah-Hwee Tan, Hwee-Hwa Pang
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Traditional approaches to recommender systems have not taken into account situational information when making recommendations, and this seriously limits the relevance of the results. This paper advocates context-awareness as a promising approach to enhance the performance of recommenders, and introduces a mechanism to realize this approach. We present a framework that separates the contextual concerns from the actual recommendation module, so that contexts can be readily shared across applications. More importantly, we devise a learning algorithm to dynamically identify the optimal set of contexts for a specific recommendation task and user. An extensive series of experiments has validated that our system is indeed able to learn both quickly and accurately.
Description of the UNL/USL system used for MUC-3
Authors: Jitender S. Deogun, Vijay V. Raghavan
Venue: Proceedings of the 3rd conference on Message understanding (1991)

The MUC-3 task consists of generating a database of filled templates with respect to messages that belong to a general topical domain. In particular, for the current phase, the message collection belongs to the domain of terrorist activities. On the one hand, a decision as to the relevance of a message to a specified class of terrorist events should be made. If relevant, a predefined set of facts are to be extracted and placed as fills for appropriate slots of the template(s) created for this message. If not relevant, a template having a '*' as the fill in all but one slot, is created (see Appendix A for details). Some aspects of the MUC-3 task are amenable to be solved by techniques typically employed in information retrieval (IR). These techniques are especially designed to be applicable to any domain. In contrast, there are other aspects of the problem that may require a great deal of language understanding, thus needing natural language processing (NLP) techniques. For the most part, NLP techniques may be considered domain dependent.
On the Scalability of Centralized Control
Authors: Dror G. Feitelson
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

Scalability of clusters and MPPs is typically discussed in terms of limits on growth: something which grows at a rate of O(log p) (where p is the number of processors) is said to be more scalable than something whose growth rate is O(p). But in practice p does not grow without limits. We therefore suggest that discussions of scalability should take time into account. System sizes grow with time, so larger systems need to be supported - but only after some time. And in particular, there is no real need to support arbitrarily large systems right now. Surprisingly, when time is thus put into the picture, we find that centralized control is actually quite scalable. The reason is that the capabilities of a centralized control node grow at a fast pace due to Moore's law. This seems to be more than enough in order to manage current growth patterns displayed by parallel systems.
Test Control for Secure Scan Designs
Authors: David Hely, Frederic Bancel, Marie-Lise Flottes, Bruno Rouzeyre
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Designing secure ICs requires fulfilling many design rules in order to protect access to secret data. However, these security design requirements may be in opposition to test needs and testability improvement techniques that increase both observability and controllability. Nevertheless, secure chip designers cannot neglect the testability of their chip; a high quality production testing is primordial to ensure a good level of security since any faulty devices could induce major security vulnerability. In this paper, we propose to merge security requirements with testability ones in a control-oriented design for security scan technique.
Security Enhancement in InfiniBand Architecture
Authors: Manhee Lee, Eun Jung Kim, Mazin Yousif
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The InfiniBand¿ Architecture (IBA) is a new promising I/O communication standard positioned for building clusters and System Area Networks (SANs). However, the IBA specification has left out security resulting in potential security vulnerabilities, which could be exploited with moderate effort. In this paper, we view these vulnerabilities from three classical security aspects: availability, confidentiality, and authentication. For better availability of IBA, we recommend that a switch be able to enforce partitioning for data packets for which we propose an efficient implementation method using trap messages. For confidentiality, we encrypt only secret keys to minimize performance degradation. The most serious vulnerabilityin IBA is authentication since IBA authenticates packets solely by checking the existence of plaintext keys in the packet. In this paper, we propose a new authentication mechanism that treats the Invariant CRC (ICRC) field as an Authentication Tag, which is compatible with current IBA specification. When analyzing the performance of our authentication approach along with other authentication algorithms, we observe that our approach dramatically enhances IBA's authentication capability without hampering IBA performance benefit. Furthermore, simulation results indicate that our methods enhance security in IBA with marginal performance overhead.
Quality-Oriented Software Architecture
Authors: Hassan Reza, Emanuel Grant
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper proposes a method to select the software architecture for a family of systems that meets user requirements. The method is based on a set of universally accepted design principles and tactics that aims to establish a systematic correlation between the quality requirements of a system and an architectural style that best implements it. The proposed method can also be a valuable assistant to a novice software engineer in selecting an optimal architectural style because the selection of an appropriate architectural style plays an important role in success or failure of a system.
A cache-efficient implementation of the lattice Boltzmann method for the two-dimensional diffusion equation: Research Articles
Authors: A. C. Velivelli, K. M. Bryden
Venue: Concurrency and Computation: Practice Experience (2004)

The lattice Boltzmann method is an important technique for the numerical solution of partial differential equations because it has nearly ideal scalability on parallel computers for many applications. However, to achieve the scalability and speed potential of the lattice Boltzmann technique, the issues of data reusability in cache-based computer architectures must be addressed. Utilizing the two-dimensional diffusion equation, $T_t=\mu(T_{xx}T_{yy})$, this paper examines cache optimization for the lattice Boltzmann method in both serial and parallel implementations. In this study, speedups due to cache optimization were found to be 1.9&ndash;2.5 for the serial implementation and 3.6&ndash;3.8 for the parallel case in which the domain decomposition was optimized for stride-one access. In the parallel non-cached implementation, the method of domain decomposition (horizontal or vertical) used for parallelization did not significantly affect the compute time. In contrast, the cache-based implementation of the lattice Boltzmann method was significantly faster when the domain decomposition was optimized for stride-one access. Additionally, the cache-optimized lattice Boltzmann method in which the domain decomposition was optimized for stride-one access displayed superlinear scalability on all problem sizes as the number of processors was increased. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Syntax error repair for a Java-based parser generator
Authors: P. van der Spek, N. Plat, C. Pronk
Venue: ACM SIGPLAN Notices (2005)

This article presents an implementation of an error repair algoritm for the JavaCC parser generator. Three different approaches, the Burke-Fisher error repair, follow-set error repair and panic mode, have been implemented. These algorithms have been altered and combined in order to get improved results. Using this adapted implementation of JavaCC an improved syntax error recovery mechanism is available.
Parallel simulation on the hypercube multiprocessor
Authors: Azzedine Boukerche, Carl Tropper
Venue: Distributed Computing (1995)

This paper focuses upon a particular conservative algorithm for parallel simulation, the Time of Next Event (TNE) suite of algorithms [13]. TNE relies upon a shortest path algorithm which is independently executed on each processor in order to unblock LPs in the processor and to increase the parallelism of the simulation. TNE differs fundamentally from other conservative approaches in that it takes advantage of having several LPs assigned to each processor, and does not rely upon message passing to provide lookahead. Instead, it relies upon a shortest path algorithm executed independently in each processor. A deadlock resolution algorithm is employed for inter-processor deadlocks. We describe an empirical investigation of the performance of TNE on the iPSC/i860 hypercube multiprocessor. Several factors which play an important role in TNE's behavior are identified, and the speedup relative to a fast uniprocessor-based event list algorithm is reported. Our results indicate that TNE yields good speedups and out-performs an optimized version of the Chandy&Misra-null message (CMB) algorithm. TNE was 2-5 times as fast as the CM approach for less than 10 processors (and 1.5-3 times as fast when more than 10 processors were used for the same population of processes.)
Preemptive semi-online scheduling with tightly-grouped processing times
Authors: Yong He, Yi-Wei Jiang
Venue: Journal of Computer Science and Technology (2004)

This paper investigates a preemptive semi-online scheduling problem on m identical parallel machines where m = 2, 3. It is assumed that all jobs have their processing times in between p and rp (p > 0, r ≥ 1). The goal is to minimize the makespan. Best possible algorithms are designed for any r ≥ 1 when m = 2, 3.
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
Authors: Chris Chu, Yiu-Chung Wong
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. The algorithm is an extension of the wirelength estimation approach by fast lookup table [1]. The main contribution of this paper is a new net breaking technique which is much better than the one in [1]. A scheme is also presented to allow users to control the tradeoff between accuracy and runtime.FLUTE is optimal for nets up to degree 9 and is still very accurate for nets up to degree 100. So it is particularly suitable for VLSI applications in which most nets have a degree 30 or less. We show experimentally that over 18 industrial circuits in the ISPD98 benchmark suite, FLUTE with default accuracy is more accurate than the Batched 1-Steiner heuristic and is almost as fast as a very efficient implementation of Prim's rectilinear minimum spanning tree (RMST) algorithm. By adjusting the accuracy parameter, the error can be further reduced with only a small increase in runtime (e.g., 2.7x error reduction with 2.2x runtime increase).
The language observatory project (LOP)
Authors: Yoshiki Mikami, Pavol Zavarsky, Mohd Zaidi Abd Rozan, Izumi Suzuki, Masayuki Takahashi, Tomohide Maki, Irwan Nizan Ayob, Paolo Boldi, Massimo Santini, Sebastiano Vigna
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The first part of the paper provides a brief description of the Language Observatory Project (LOP) and highlights the major technical difficulties to be challenged. The latter part gives how we responded to these difficulties by adopting UbiCrawler as a data collecting engine for the project. An interactive collaboration between the two groups is producing quite satisfactory results.
A Video Database of Moving Faces and People
Authors: Alice J. O'Toole, Joshua Harms, Sarah L. Snow, Dawn R. Hurst, Matthew R. Pappas, Janet H. Ayyad, Herve Abdi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

We describe a database of static images and video clips of human faces and people that is useful for testing algorithms for face and person recognition, head/eye tracking, and computer graphics modeling of natural human motions. For each person there are nine static "facial mug shots¿ and a series of video streams. The videos include a "moving facial mug shot,¿ a facial speech clip, one or more dynamic facial expression clips, two gait videos, and a conversation video taken at a moderate distance from the camera. Complete data sets are available for 284 subjects and duplicate data sets, taken subsequent to the original set, are available for 229 subjects.