ppxscal/embedding_network huggingface dataset:
Code Placement with Selective Cache Activity Minimization for Embedded Real-time Software Design
Authors: Junhyung Um, Taewhan Kim
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Many embedded system designs usually impose (hard)read-time constraints on tasks. Thus, computing a tight upper boundof the worst case execution time (WCET) of a software is a criticallyimportant, but difficult task. The difficulty arises particularlywhen the code is executed on processors with cache-based memorysystems. In this paper, we propose a new code placement techniqueunder cache activity consideration for real-time software design.Specifically, unlike the previous approaches which have triedto minimize total cache misses, which is not necessarily the bestway to meet all timing constraints of tasks, we minimizes the cachemisses in a selective way for tasks according to the degree of tightness(or urgency) of their timing constraints. Based on a concept ofselective cache activity minimization, we propose a new approachwhich solves the code placement problem in two steps: (Step 1) Wetransform the code placement problem into so called an interval selectionproblem, which then we formulate into a 0-1 integer linearprogramming (ILP); (Step 2) We apply an efficient approximationalgorithm, called Code-map, to solve the exact code placementformulation obtained in Step.
A global convergent algorithm for flows in a two-dimensional network
Authors: H. B. Ji
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper, we will provide an iteration algorithm of global convergence for two-dimensional nonlinear network problems. By avoiding the difficulties of stability of conventional difference methods, our approach is established based on the inner monotone properties of networks, and its global convergence meets the demands of real-time simulation and that of multi-modes of operation. A simulation example is also illustrated for the algorithm.
Leveraging Traditional Distributed Applications to Web Services for E-Learning Applications
Authors: Amala Vijaya Selvi Rajan, Jim Otieno
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Traditional distributed applications are relatively brittle coupling between various componentsin the system. These services are useful in themselves, but the Internet is still verystove-piped; connecting these services together to do more powerful things is very difficult. These difficulties can be modeled in terms of web services, which can be accessed by any language, using any component model, running on any operating system. Web services are building blocks for creating open distributed systems and allow companies and individuals to quickly and cheaply make their digital assets available worldwide. Web services are currently concerned with five basic challenges such as service description, service implementation, service publishing, discovery and binding, and service invocation and execution. The aim of this paper is to explore what web services are, how they are shaping, advantages and compromises for the migration from distributed application development to web services enabling technology for e-learning process. It's high time for academia to recognize that web services as an extremely important key to the future of campus computing on numerous fronts, with enormous implications to enhance teaching, learning and research.
An Auto-Indexing Technique for Databases Based on Clustering
Authors: Mujiba Zaman, Jyotsna Surabattula, Le Gruenwald
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Considering the wide deployment of databases and its size, particularly in data warehouses, it is important to automate the physical design so that the task of the database administrator (DBA) is minimized. An important part of physical database design is index selection. An auto-index selection tool capable of analyzing large amounts of data and suggesting a good set of indexes for a database is the goal of auto-administration. Clustering is a data mining technique with broad appeal and usefulness in exploratory data analysis. This idea provides a motivation to apply clustering techniques to obtain good indexes for a workload in the database. In this paper we describe a technique for auto-indexing using clustering. The experiments conducted show that the proposed technique performs better than Microsoft SQL Server Index Selection Tool (IST) and can suggest indexes faster than Microsoft's IST.
Multi-Protocol Label Switching as the Basis for a Converged Core Network
Authors: I. Gallagher, M. Robinson, A. Smith, S. Semnani, J. Mackenzie
Venue: BT Technology Journal (2004)

This paper addresses the requirements and issues surrounding the carriage of existing and future services over a multi-protocol label switching (MPLS) core network. It provides an overview of MPLS, describing how MPLS is already being used to support VPN services offering support for multiple qualities of service. It discusses the requirements of future core networks and assesses how MPLS can be used to meet them. Finally it identifies a number of areas where BT is actively working to enhance the capability of MPLS to support future multiservice core network architectures.
Miniaturisation of synthesis and screening in nanotiterplates: the concept of NanoSynTestTM
Authors: A. Schober, G. Schlingloff, A. Gro&#x00df;, T. Henkel, J. Albert, G. Mayer, H. Wurziger, M. D&#x00f6;ring, H. Tietz
Venue: Microsystem Technologies (2004)

The NanoSynTestTM-system combines screening and synthesis in a highly integrated fashion. The central feature of the experimental system are nanotiterplates with a density of 100 wells/cm2 and a volume of roughly 0.1 &#x03bc;l each. The wells are equipped with a microsieve membrane for removal of liquids. Substance transfer of liquids and beads for solid phase synthesis is performed in the nl range with special adapted dispensers and sorting wafers. Thus the successfully performed adaptation of such tools to automated synthesis and screening workstations leads to experiments in synthesis, single bead analysis of synthesis products (IR spectroscopy, HPL-chromatography of single beads) and the fluometry of biological substances in nanotiterplates. These proof of principle experiments open up the way to a completely new and modular design of an integrated synthesis and screening facility based on nano- and microtechnology.
Organizing and Program Committees
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

list-confcom
Multiple-Valued Source-Coupled Logic VLSI Based on Adaptive Threshold Control and Its Applications
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

A new multiple-valued current-mode (MVCM)integrated circuit based on Adaptive Threshold VoltageControl (ATVC) is proposed for high-speed VLSIapplications while maintaining low power. Adaptivethreshold voltages, which are changed in the oppositedirection of an input signal, are generated so that thevoltage difference between an input voltage and a thresholdvoltage is always larger than that of a Fixed ThresholdVoltage Control (FTVC). Moreover, shifting of an input to alower voltage results in better performance. As a typicalapplication of a high-performance arithmetic circuit, aradix-2 signed-digit full adder (SDFA) is designed in a0.18-µm CMOS technology. Simulation results show that thespeed of SDFA based on the proposed ATVC is almost 1.7times faster than that of conventional FTVC undernormalized power consumption.
RSVP Policy Control using XACML
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

This work proposes a XML-based framework fordistributing and enforcing RSVP access control policies,for RSVP-aware application servers. Policies arerepresented by extending XACML, the general purposeaccess control language proposed by OASIS. BecauseRSVP is a specific application domain, it is not directlysupported by the XACML standard. Hence, this workdefines the XACML extensions required for representingand transporting the RSVP access control policyinformation. The XACML-based framework is proposedas an alternative to the IETF PCIM-based approach.Both approaches are compared in this paper.
Knowledge Extraction using Visualization of Hemoglobin Parameters to Identify Thalassemia
Authors: Carlos R. Valencio, Mauricio N. Tronco, Ana C. Bonini-Domingos, Claudia R. Bonini-Domingos, Caetano Traina Jr., Agma J. M. Traina
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The analysis of large amounts of data is better performed by humans when represented ina graphical format. Therefore, a new research area called the Visual Data Mining is beingdeveloped endeavoring to use the number crunching power of computers to prepare data forvisualization, allied to the ability of humans to interpret data presented graphically.This work presents the results of applying a visual data mining tool, called FastMapDBto detect the behavioral pattern exhibited by a dataset of clinical information abouthemoglobinopathies known as thalassemia. FastMapDB is a visual data mining tool thatget tabular data stored in a relational database such as dates, numbers and texts, and byconsidering them as points in a multidimensional space, maps them to a three-dimensionalspace. The intuitive three-dimensional representation of objects enables a data analyst to"see" the behavior of the characteristics from abnormal forms of hemoglobin, highlightingthe differences when compared to data from a group without alteration.
OntoEditor: A Web Tool for Manipulating Ontologies Stored in Database Servers
Authors: Claudio de Souza Baptista, Karine F. Vasconcelos, Ladjane S. Arruda, Ulrich Schiel, Elvis Rodrigues da Silva
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The Web is moving to a new generation in which machine-understandable processing is mandatory. In order to achieve this goal it is essential to define ontologies, which enable the modeling of application domains and can be shared and understood by different applications in different platforms. These ontologies are complex and so it is necessary to provide software tools which aim to facilitate ontology manipulation. In this paper, we describe a new tool for ontology manipulation known as OntoEditor. OntoEditor is a Web tool, which has a graphical interface for representing an ontology graph. Moreover, OntoEditor uses a database management system for ontology persistency and query manipulation. The ontologies are represented internally as RDF and RDF Schema.
Oxygen-deficiency centers in SiO2 thermally nitrided in NO
Authors: P. G. Tello, V. V. Afanas'ev, A. Stesmans
Venue: Microelectronic Engineering (2004)

Post-oxidation annealing (POA) of thermal Si/SiO2 in N-containing gases (NO, N2O, NH3) is known to provide numerous benefits for metal-oxide-semiconductor (MOS) devices by incorporating nitrogen at the Si/SiO2 interface. It was recently reported, however, that the nitrided oxides exhibit an enhanced density of holes traps. In the present study we analyze the nature of defects encountered in SiO2 after thermal treatment in pure NO addressing possible consequences related to their use in non-volatile semiconductor memory devices.
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Venue: ACM Symposium on Parallel Algorithms and Architectures (2004)

The papers in this volume were presented at the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), held June 27-30, 2004 in Barcelona, Spain. The conference was sponsored by the ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science. The Departament de Matemàtica Aplicada 4 (Applied Mathematics Department 4) at the Universitat Politécnica de Catalunya (Technical University of Catalonia) provided local support. Financial support was provided by Intel Corporation, the Departament de Matemàtica Aplicada 4, the Universitat Politécnica de Catalunya, and the Ministry of Science and Technology (MCYT), Spain.The thirty-five technical presentations that appeared at the conference were selected by the Program Committee during the Program Committee meeting that took place in Amherst, Massachusetts, March 13-14, 2004. The committee made its decisions based on perceived quality and originality, as well as appropriateness to the theme of the Symposium. The mix of selected papers reflects the unique nature of SPAA in bringing together the theory and practice of parallel computing, and in defining "parallel" very broadly to encompass any computational "device" that can perform multiple operations or tasks simultaneously. The technical papers in this volume are to be considered preliminary versions, and authors are generally expected to publish polished and complete versions in archival scientific journals.In addition to the technical presentations, this volume includes five brief communications presented at the SPAA Revue. These communications were selected either from abstracts submitted to be considered as brief communications for the Revue or from extended abstracts submitted to be considered for either a technical presentation, or a brief communication. The Committee's decisions were based on the perceived interest of these contributions, with the goal that they serve as bases for further significant advances in parallelism in computing. Extended versions of the SPAA Revue papers may be published later in other conferences or journals.
Enhancing data cache reliability by the addition of a small fully-associative replication cache
Authors: Wei Zhang
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Soft error conscious cache design is a necessity for reliable computing. ECC or parity-based integrity checking technique in use today either compromises performance for reliability or vice versa, and the N modular redundancy (NMR) scheme is too costly for microprocessors and applications with stringent cost constraint. This paper proposes a novel and cost-effective solution to enhance data reliability with minimum impact on performance. The idea is to add a small fully-associative cache to store the replica(s) of every write to the L1 data cache. The replicas can be used to detect and correct soft errors. The replication cache can also be used to increase performance by reducing the L1 data cache miss rate. Our experiments show that more than 97% read hits of the L1 data cache can find replicas available in a replication cache of 8 blocks.
A study in prototyping
Authors: N. H. Gehani
Venue: Proceedings of the workshop on Rapid prototyping (1982)

A prototype electronic form system was implemented to test the feasibility of a high level form definition mechanism. This mechanism is based on the idea of abstract data types in programming languages. In this paper I will briefly discuss prototypes in general and then describe the prototype electronic form system --- specific objectives, design decisions and evaluation.Rapid construction of the prototype was facilitated by tools on the UNIX&trade; operating system that helped manage frequent and quick changes to software. The prototype has proved invaluable in providing a better understanding of the facilities that should be included in a form definition language and of the issues in implementing it.
Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Venue: International Symposium on Software Testing and Analysis (2004)

Welcome to ISSTA 2004: the Fourteenth International Symposium on Software Testing and Analysis. ISSTA 2004 brings together academics, industrial researchers, and practitioners to exchange new ideas, solve problems, and share experiences related to problems involving software testing and program analysis.The program for ISSTA 2004 begins with two workshops: the Workshop on Testing, Analysis, and Verification of Web Services, and the Workshop on Empirical Research in Software Testing. These workshops are followed by the ISSTA technical program, which consists of research papers, tools papers, and two invited speakers. Ninety-three research papers were submitted to ISSTA. Each paper was reviewed by at least three members of the Program Committee, and some were reviewed by four or five members and/or outside reviewers. The Program Committee selected twenty-six of these papers for inclusion in the conference. Eight tools papers were also submitted, and the Program Committee selected two of these papers. Our invited speakers, Robert Kurshan, and David Harel, speak on issues relevant to analysis and validation of software.ISSTA 2004 is collocated with the 16th International Conference on Computer Aided Verification (CAV), and the final day of ISSTA's technical program is also the first day of CAV's technical program. ISSTA and CAV sessions on this shared day are open to attendees of both conferences: the day includes a joint ISSTA/CAV keynote address by David Harel, as well as ISSTA and CAV technical papers sessions. To further facilitate interaction, a joint ISSTA/CAV reception will be held on Tuesday night. We also hope that you'll stay and participate in the CAV sessions in the days that follow.
Killing two birds with one stone
Authors: Zvi Galil
Venue: ACM SIGACT News (1978)

It is shown that the problem of finding the biconnected components of an undirected graph is, in a certain sense, a special case of the problem of finding the strongly connected components of a directed graph. Therefore, the linear-time algorithm for the former can be derived from the linear-time algorithm for the latter.
Reliability and verification of natural language text on the world wide web (abstract only)
Authors: Melanie J. Martin
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

The hypothesis that information on the Web can be verified automatically, with minimal user interaction, will be tested by building and evaluating an interactive system. In this paper, verification is defined as a reasonable determination of the truth or correctness of a statement by examination, research, or comparison with similar text. The system will contain modules for reliability ranking, query processing, document retrieval, and document clustering based on agreement. The query processing and document retrieval components will use standard IR techniques. The reliability module will estimate the likelihood that a statement on the Web can be trusted using standards developed by information scientists, as well as linguistic aspects of the page and the link structure of associated web pages. The clustering module will cluster relevant documents based on whether or not they agree or disagree with the statement to be verified. Relevant references are discussed.
Rank-aware query optimization
Authors: Ihab F. Ilyas, Rahul Shah, Walid G. Aref, Jeffrey Scott Vitter, Ahmed K. Elmagarmid
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Ranking is an important property that needs to be fully supported by current relational query engines. Recently, several rank-join query operators have been proposed based on rank aggregation algorithms. Rank-join operators progressively rank the join results while performing the join operation. The new operators have a direct impact on traditional query processing and optimization.We introduce a rank-aware query optimization framework that fully integrates rank-join operators into relational query engines. The framework is based on extending the System R dynamic programming algorithm in both enumeration and pruning. We define ranking as an interesting property that triggers the generation of rank-aware query plans. Unlike traditional join operators, optimizing for rank-join operators depends on estimating the input cardinality of these operators. We introduce a probabilistic model for estimating the input cardinality, and hence the cost of a rank-join operator. To our knowledge, this paper is the first effort in estimating the needed input size for optimal rank aggregation algorithms. Costing ranking plans, although challenging, is key to the full integration of rank-join operators in real-world query processing engines. We experimentally evaluate our framework by modifying the query optimizer of an open-source database management system. The experiments show the validity of our framework and the accuracy of the proposed estimation model.
A New Architecture for Dynamic E-Business Database Interoperability
Authors: Omar Khadeer Hussain, Ben Soh
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

There have been many approaches of data sharing in e-businesses, attempting at mapping each field at the source to its corresponding field at the target. These approaches eliminate the need for deriving the global schema and hence eliminate a substantial overhead. But, the approaches work out well only when both the source and the target databases have approximately the same content. Moreover, if some concepts of source do not have the counterpart fields in the target then the mapping will lose the concepts. This problem will be further aggregated by the mapping compositions and the large size of the databases. In this paper, we propose a framework to alleviate the interoperability problem.
Temporal Changes of Access to Primary Health Care in Illinois (1990&ndash;2000) and Policy Implications
Authors: Wei Luo, Fahui Wang, Carolinda Douglass
Venue: Journal of Medical Systems (2004)

This paper examines temporal changes of access to primary health care in Illinois between 1990 and 2000 in a Geographic Information System (GIS) environment. Census data at the census tract level in 1990 and 2000 were used to define the population (demand) distribution and related socioeconomic attributes, and the Physician Masterfile of American Medical Association in corresponding years was used to define the physician (supply) distribution at the zip code level. A two-step floating catchment method was employed to measure the spatial access, considering locations of physicians and population and travel times between them. Various socioeconomic and demographic variables were consolidated into three factors (i.e., socioeconomic disadvantages, sociocultural barriers, and high healthcare needs) for measuring the nonspatial access. Spatial and nonspatial factors were finally integrated together to assess the primary care physician shortage areas. The study shows that spatial accessibility to primary care physician for the majority of the state improved from 1990 to 2000. Areas with worsened spatial accessibility were primarily concentrated in rural areas and some limited pockets in urban areas. The worst among these worsened areas appeared to be associated with populations with high scores of socioeconomically disadvantages, sociocultural barriers, and healthcare needs. Improving the accessibility of those socioeconomically disadvantaged population groups is critical for the success of future policies.