ppxscal/embedding_network huggingface dataset:
Asynchronous Transfer of Control in the RTSJ-compliant Java Processor
Authors: Zhilei Chai, Wenjie Chen, Zhiqiang Tang, Zhanglong Chen, Shiliang Tu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Asynchronous Transfer of Control (ATC) is a crucial mechanism for real-time applications, and is currently provided in the Real-Time Specification for Java (RTSJ). This paper proposes a framework to implement ATC in the RTSJ-compliant Java processor based on the instruction optimization method proposed in our previous work [1]. Because most of the processing is done before bytecode execution in this method, the implementation using our framework is straightforward. Moreover, its Worst Case Execution Time (WCET) is more predictable.
Humans as a Critical Infrastructure: Public-Private Partnerships Essential to Resiliency and Response
Authors: Joshua Barnes, Kenneth Newbold
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Considerable expense and resources have been dedicated to the analysis, maintenance, and security of the critical infrastructures. However, additional effort should be expended in the consideration of humans as a critical infrastructure. Human interpersonal networks, intelligence, capacity for innovation, and characteristics as a resilient complex system are only a few examples of how humans are not only an integral component of the traditional infrastructures, but also are infrastructures in and of themselves. One of the implications of viewing humans as a critical infrastructure is a need to ensure their security. Public-private partnerships and community level efforts to foster individual and community resiliency offer tangible measures of ensuring the security of this overlooked critical infrastructure.
A Heuristic Multicast Algorithm to Support QoS Group Communications in Heterogeneous Network
Authors: Hui Cheng, Jiannong Cao, Srinivasan Mullai, Xingwei Wang
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In this paper, we study the problem of QoS group communication in a heterogeneous network, which consists of multiple MANETs attached to the backbone Internet. We propose a heuristic multicast algorithm called DDVMA (Delay and Delay Variation Multicast Algorithm). DDVMA is designed for solving the DVBMT (Delay- and delay Variation-Bounded Multicast Tree) problem [8], which has been proved to be NP-complete. It can find a multicast tree satisfying the multicast end-to-end delay constraint and minimizing the multicast delay variation. Two concepts- the proprietary second shortest path and partially proprietary second shortest path are introduced, which can help DDVMA achieve better performance in terms of the multicast delay variation than DDVCA (Delay and Delay Variation Constraint Algorithm) [7] that is known to be the most efficient so far. Theoretical analysis is given to show the correctness of DDVMA and simulations are performed to demonstrate the performance of DDVMA in terms of the multicast delay variation.
Speculative execution for hiding memory latency
Authors: Alex Pajuelo, Antonio González, Mateo Valero
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

L2 misses are one of the main causes for stalling the activity in current and future microprocessors.In this paper we present a mechanism to speculatively execute independent instructions of L2-miss loads, even if no entry in the reorder buffer is available. The proposed mechanism generates future instances of instructions that are expected to be independent of the delinquent load. When these dynamic instructions are later fetched, they use the previously precomputed data and directly go to the commit stage without executing.The mechanism replicates strided loads found above the L2-miss load, that produce the data for the target independent instructions. Instructions following the L2-miss load will check if their source operands have been replicated. In this case, multiple speculative instances of them will also be generated.This mechanism is built on top of a superscalar processor with an aggressive prefetch scheme. Compared to this baseline, the mechanism obtains 21% of performance improvement.
Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia
Venue: Computer graphics and interactive techniques in Australasia and South East Asia (2005)

As Program-Chairs for GRAPHITE 2005 it has been our pleasure to put together what we are confident will be an outstanding technical program. Through a rigorous review process we have selected 38 full papers from a total of 93 submissions and 32 short papers. We were very happy with the high quality of papers and the large number of submissions. It is clear from this that GRAPHITE is has emerged as one of the premiere computer graphics conferences.It was a very difficult decision to accept so few papers from such a strong set of submissions. Luckily however we did not have to make the decision ourselves. We would like to thank the 39 members of the program committee who provided excellent feedback on the paper submissions, to very tight timescales. We know that a conference such this is impossible to organize without the support of the research community and we are very grateful for the time they have spent on paper reviews and the efforts of the papers' authors.As a result of these efforts we have been able to put together an excellent program that has technical content from a wide variety of computer graphics topics, ranging from non-photorealistic rendering techniques to virtual reality input devices and cloth simulation. It is good to see such a breadth of topics being presented in one conference and there should be something new for every attendee to learn more about the field of Computer Graphics and Interactive techniques.
Exploiting Self-Similar Traffic Analysis in network resource control: the IP over WDM networks case
Authors: H. Elbiaze, O. Cherkaoui
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This article focuses on the control plan of IP over WDM networks. Analytical and measurement studies have shown that self-similar traffic can have detrimental impact on network performance in terms of queuing delay and packet loss ratio. Nevertheless, the ubiquity of scale-invariant burstiness observed across diverse network contexts can be exploited to make more efficient resource-control decisions. This paper shows that an appropriately truncated selfsimilar process keeps the self-similarity behaviour. Hence, we propose to apply prediction methods on the truncated process instead of the original one. This proposition provides (i) dynamic communication abilities between IP and the optical layers (ii) cost reduction related to traffic measurements and (iii) optimization of the network resources utilization.
Modern dram memory systems: performance analysis and scheduling algorithm
Authors: David Tawei Wang
Venue:  (2005)

The performance characteristics of modern DRAM memory systems are impacted by two primary attributes: device datarate and row cycle time. Modern DRAM device datarates and row cycle times are scaling at different rates with each successive generation of DRAM devices. As a result, the performance characteristics of modern DRAM memory systems are becoming more difficult to evaluate at the same time that they are increasingly limiting the performance of modern computer systems. In this work, a performance evaluation framework that enables abstract performance analysis of DRAM memory systems is presented. The performance evaluation framework enables the performance characterization of memory systems while fully accounting for the effects of datarates, row cycle times, protocol overheads, device power constraints, and memory system organizations. This dissertation utilizes the described evaluation framework to examine the performance impact of the number of banks per DRAM device, the effects of relatively static DRAM row cycle times and increasing DRAM device datarates, power limitation constraints, and data burst lengths in future generations of DRAM devices. Simulation results obtained in the analysis provide insights into DRAM memory system performance characteristics including, but not limited to the following observations. (1) The performance benefit of having a 16 banks over 8 banks increases with increasing datarate. The average performance benefit reaches 18% at 1 Gbps for both open-page and close-page systems. (2) Close-page systems are greatly limited by DRAM device power constraints, while open-page systems are less sensitive to DRAM device power constraints. (3) Increasing burst lengths of future DRAM devices can adversely impact cache-limited processors despite the increasing bandwidth. Performance losses of greater than 50% are observed. Finally, this dissertation also present a unique rank hopping DRAM command-scheduling algorithm designed to alleviate the bandwidth constraints in DDR2 and future DDRx SDRAM memory systems. The proposed rank hopping scheduling algorithm schedules DRAM transactions and command sequences to avoid the power limiting constraints and amortizes the rank-to-rank switching overhead. Execution based simulations show that some workloads are able to fully utilize the additional bandwidth and significant performance improvements are observed across a range of workloads.
Fast Iterative Solvers for Discrete Stokes Equations
Authors: Jörg Peters, Volker Reichelt, Arnold Reusken
Venue: SIAM Journal on Scientific Computing (2005)

We consider saddle point problems that result from the finite element discretization of stationary and nonstationary Stokes equations. Three efficient iterative solvers for these problems are treated, namely, the preconditioned conjugate gradient method introduced by Bramble and Pasciak, the preconditioned MINRES method, and a method due to Bank et al. We give a detailed overview of algorithmic aspects and theoretical convergence results. For the method of Bank et al. a new convergence analysis is presented. A comparative study of the three methods for a three-dimensional Stokes problem discretized by the Hood--Taylor P2-P1 finite element pair is given.
Service-Oriented System Engineering: A New Paradigm
Authors: W. T. Tsai
Venue: Proceedings of the IEEE International Workshop (2005)

In the past a few years, we witnessed a rapid progress in Service-Oriented Computing (SOC), which represents a paradigm shift from the current mainstream Object-Oriented Computing (OOC) paradigm to the SOC paradigm. This paradigm shift is changing the way we develop and use software and hardware. Conferences, journals, books, research, experimentation, tools, and products in SOC, Service- Oriented Architecture (SOA), Service-Oriented Enterprise (SOE), Service-Oriented Infrastructure (SOI), Web Services (WS), and associated protocols and standards have emerged and a solid foundation for the new paradigm is being grounded. This paper focuses on the system engineering issues in the new paradigm.
Cardinality constrained facility location problems in trees
Authors: Robert Radu Benkoczi
Venue:  (2004)

Operations Research is the application of scientific methods, especially mathematical and statistical ones, to problems of making decisions. From the huge variety of real life applications, this thesis focuses on a particular class of problems for which the placement of certain resources is in question. These tasks are referred collectively as facility location problems. This dissertation is about algorithms to solve a fundamental problem in facility location, the k-median problem. The mathematical object used here in modeling the resources and their interactions with the environment is a tree. Many other formulations are used in practice with the k-median problem, but the case of trees is special because, (i) the formulation is very simple, (ii) problems can be solved efficiently, (iii) efficient algorithms for problems in trees can be used to derive approximate solutions for general networks (Tamir (102]), and (iv) efficient algorithms for k-median problems in trees could lead to specific k-median algorithms for classes of graphs less studied, such as the graphs with bounded tree-width. Using simple techniques from computational geometry, we give the first k-median algorithm sub-quadratic in the size of the tree when k is fixed, for arbitrary trees. In the introduction, we give an overview of the main results known about the k-median problem in general. The main ideas behind our approach are also illustrated. In Chapter 2 we present a decomposition of trees that is central to our methods. In Chapter 3 we describe our approach for solving the k-median problem in trees and we give simplified algorithms for three particular cases, the 3-median problem, the k-median problem in directed trees, and the k-median problem in balanced binary trees. The following two chapters discuss two generalizations of the k-median problem, the k-median problem with positive and negative weights and the collection depots problem.
Experiments in Text-Based Mining and Analysis of Biological Information from MEDLINE on Functionally-Related Genes
Authors: Naureen Moon, Rahul Singh
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Technological advancements such as microarrays have enabled biologists to generate unprecedented quantities of data about biological entities. This has lead to the development of a large number of algorithms for processing and analysis of biological data. Challenges however remain; for instance, genes that function cooperatively need not have similar expression patterns. This suggests the use of non-numerical sources of information to explore the underlying biology. We experimentally study various factors that are inherent in algorithmic methodologies for text analysis. The proposed method accesses MEDLINE dynamically to account for the latest research, with the available literature corresponding to the genes analyzed to develop lists of keywords. Natural language processing (NLP) techniques such as stop-word filtering and stemming are then applied to the lists, and keyword frequencies weighted using the term frequency-inverse document frequency (TFIDF) scheme. The results are input to a hierarchical clustering algorithm to derive groupings of genes by functionality. The process is repeated using z-score weighting and latent semantic analysis (LSA) to determine which yields the most accurate clustering. The study presented examines the importance of these steps and their influence on the overall efficacy of the system. We believe that the analysis conducted as part of this research will be invaluable to development and fine-tuning of text mining methodologies for biological literature.
Point defects at interfacial layers in stacks of (100) Ge with nm-thin HfO2 and GeOx(Ny) insulators probed by electron spin resonance
Authors: A. Stesmans, V. V. Afanas'ev
Venue: Microelectronic Engineering (2005)

Electron spin resonance studies of (100)Ge/GeOxNy/HfO2 and (100)Ge/GeO2 structures fail to reveal interfacial Ge dangling bond type defects. Only paramagnetic defects residing in near-interfacial Ge oxide or Ge(oxy)nitride layers could be observed, which in the former structures appear resistant to passivation treatment in H2 at 400°C and show no correlation with the major portion of electrically active traps. The results indicate a fundamental difference between the seemingly similar group-IV elemental semiconductor/insulator interfaces for (100)Si and (100)Ge.
Detection of sentinel predictor-class associations with XCS: a sensitivity analysis
Authors: John H. Holmes
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Knowledge discovery in databases has traditionally focused on classification, prediction, or in the case of unsupervised discovery, clusters and class definitions. Equally important, however, is the discovery of individual predictors along a continuum of some metric that indicates their association with a particular class. This paper reports on the use of an XCS learning classifier system for this purpose. Conducted over a range of odds ratios for a fixed variable in synthetic data, it was found that XCS discovers rules that contain metric information about specific predictors and their relationship to a given class. In addition, EpiXCS performs qualitatively similarly to See5, and both methods are comparable to logistic regression.
Visualizing Coordination In Situ
Authors: Chris Weaver
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Exploratory visualization environments allow users to build and browse coordinated multiview visualizations interactively. As the number of views and amount of coordination increases, conceptualizing coordination structure becomes more and more important for successful data exploration. Integrated metavisualization is exploratory visualization of coordination and other interactive structure directly inside a visualization's own user interface. This paper presents a model of integrated metavisualization, describes the problem of capturing dynamic interface structure as visualizable data, and outlines three general approaches to integration. Metavisualization has been implemented in Improvise, using views, lenses, and embedding to reveal the the dynamic structure of its own highly-coordinated visualizations.
Semi-Structured Data Management in the Enterprise: A Nimble, High-Throughput, and Scalable Approach
Authors: David Maluf, David Bell, Naveen Ashish, Chris Knight, Peter Tran
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

In this paper we describe an approach and system for managing enterprise semi-structured data that is high-throughput, nimble, and scalable. We present the NETMARK system, which provides for a "schema-less" way of managing semi-structured documents. We describe in particular detail the unique underlying data storage approach and efficient query processing mechanisms given this storage system. We present an extensive benchmark evaluation of the NETMARK system and also compare it with related XML management systems. At the heart of the approach is the philosophy of a focus on most common data management requirements in the enterprise, and not burdening users and application developers with unnecessary complexity and formal schemas.
Color Text Extraction from Camera-based Images the Impact of the Choice of the Clustering Distance
Authors: Celine Mancas-Thillou, Bernard Gosselin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Character recognition has a continuous importance for several years and recently, new challenges appeared with camera-based pictures. This paper deals with text extraction for color natural scenes images. Many papers try to combine several color spaces or to choose the best one for a particular database. We show that the main problem is not in the choice of color spaces for generic text extraction but in the choice of clustering distances to handle all degradations present in this kind of images. Comparative results are given using a public database.
On the control of a clinker cooler through state variable techniques and simulation
Authors: B. T. Cronhjort
Venue: ACM SIGSIM Simulation Digest (1974)

This paper relates to an exploratory computer control project for the digital control of a cement plant. The control of the clinker cooler was part of the project. State variable techniques were applied for the synthesis of the control system. Here, the emphasis will be on off-line simulation. A control law will be generated for the control of the over grate differential pressure. It is claimed that simulation techniques are essential tools for the successful design and implementation of digital control in industry.
On Multiplicities of Points on Schubert Varieties in Graβmannians II
Authors: C. Krattenthaler
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graβmannian in terms of certain sets of reflections in the corresponding Weyl group. The proof is accomplished by relating these sets of reflections to the author's previous combinatorial interpretation of these multiplicities in terms of non-intersecting lattice paths (Séminaire Lotharingien Combin. 45 (2001), Article B45c). Moreover, we provide a compact formula for the Hilbert series of the tangent cone to a Schubert variety in a Graβmannian assuming the truth of another conjecture of Kreiman and Lakshmibai.
Improving Machine Virtualization with 'Hotplug Memory'
Authors: Shlomit S. Pinter, Steven Shultz, Yariv Aridor, Sergey Guenender
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Machine virtualization has emerged as a key technology for server consolidation and on-demand server provisioning. To support this trend, it is essential to improve the performance of virtualization software and hence enable the efficient running of many virtual machines. We present a virtualization system that can dynamically extend the real memory of its guest virtual machines. We describe an implementation of dynamic memory extension for Linux guests running on the IBM zVM virtualization environment. Our implementation for the Linux extension is based on device drivers for accessing these dynamic memory extensions. Moreover, we show that this new capability can improve utilization and performance of the Linux guests in our virtualization environment. Specifically, memory management is improved and more virtual machines can run at a given moment. We study the utilization of dynamic memory extension of a Linux guest for a JVM heap. Running Specjbb2000 benchmark on a small virtual machine extended with dynamic memory to host the heap, we measured an improvement in transaction throughput and a 23.23% reduction in paging activity compared to an initially large machine. We further studied the implication of our experiments on the number of virtual machines that can run efficiently.
Redundant Protection Problem in the Hierarchical GMPLS Networks
Authors: Sung-eok Jeon
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The generalized multiprotocol label switching (GMPLS) networks possess a hierarchical structure, and each layer has its own independent protection mechanism. Thus, there is redundant protection due to the survivability mechanism at each layer. Amongmany proposed solutions on the redundant protection problem, the common pool method is considered as the most representative one. However, the common pool method cannot cope with two link failures. With a proposed method, the common pool method can be extended to cope with two link failures with a small cost.
Palindromic factors of billiard words
Authors: J.-P. Borel, C. Reutenauer
Venue: Theoretical Computer Science (2005)

We study palindromic factors of billiard words, in any dimension. There are differences between the two-dimensional case, and higher dimension. Arbitrary long palindrome factors exist in any dimension, but arbitrary long palindromic prefixes exist in general only in dimension 2.