ppxscal/embedding_network huggingface dataset:
Fixed Priority Timing Analysis of Real-Time Systems with Limited Parallelism
Authors: N. C. Audsley, K. Bletsas
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Conventional real-time system implementationsassume a von Neumann processor-memory architecturewith at most one software processexecuting at any time. Scheduling approachesfor such systems multiplex the processor amongrunnable processes. Fixed priority scheduling,notably, utilises timing analysis to determine offline the run-time timing behaviour of the system.Recent alternative real-time system implementationscombine processor-memory architectureswith reconfigurable hardware for speedup.Such reconfigurable hardware can execute manyfunctions in parallel. This leads to a limited parallelsystem where a single software process canexecute on the processor at any time, in parallelwith a number of functions implemented in hardware.Conventional fixed priority timing analysisis unsuitable for this model, as fundamentalassumptions are compromised, eg. the notion ofa critical instant. This paper proposes new timinganalysis aimed at such limited parallel systems,illustrated by an example system utilisingField Programmable Gate Arrays as the reconfigurable hardware resource.
On the approximability and the selection of particle shape functions
Authors: Ivo Babu&#x0161;ka, Uday Banerjee, John E. Osborn
Venue: Numerische Mathematik (2004)

Particle methods, also known as meshless or meshfree methods, have become popular in approximating solutions of partial differential equations, especially in the engineering community. These methods do not employ a mesh, or use it minimally, in the construction of shape functions. There is a wide variety of classes of shape functions that can be used in particle methods. In this paper, we primarily address the issue of selecting a class of shape functions, among this wide variety, that would yield efficient approximation of the unknown solution. We have also made several comments and observations on the order of convergence of the interpolation error, when these shape functions are used; specifically, we have shown that the interpolation error estimate, for certain classes of shape functions, may not indicate the actual order of convergence of the approximation error.
Dynamical Robustness in Gene Regulatory Networks
Authors: Jean-Loup Faulon, Shawn Martin, Robert D. Carr
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We investigate the robustness of biological networks, emphasizing gene regulatory networks. We define the robustness of a dynamical network as the magnitude of perturbation in terms of rates and concentrations that will not change the steady state dynamics of the network. We find the number of dynamical networks versus their dynamical robustness follows a power law. We observe module robustness to increase with node degree in published gene regulatory networks. Finally, based on dynamical robustness, we propose a growth model for producing networks with power law degree distibutions.
Multi-dimensional storage virtualization
Authors: Lan Huang, Gang Peng, Tzi-cker Chiueh
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Most state-of-the-art commercial storage virtualization systems focus only on one particular storage attribute, capacity. This paper describes the design, implementation and evaluation of a multi-dimensional storage virtualization system called Stonehenge, which is able to virtualize a cluster-based physical storage system along multiple dimensions, including bandwidth, capacity, and latency. As a result, Stonehenge is able to multiplex multiple virtual disks, each with a distinct bandwidth, capacity, and latency attribute, on a single physical storage system as if they are separate physical disks. A key enabling technology for Stonehenge is an efficiency-aware real-time disk scheduling algorithm called dual-queue disk scheduling, which maximizes disk utilization efficiency while providing Quality of Service (QoS) guarantees. To optimize disk utilization efficiency, Stonehenge exploits run-time measurements extensively, for admission control, computing latency-derived bandwidth requirement, and predicting disk service time.
On the k-power complement and k-power free number sequence
Authors: Zhu Weiyi
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the distribution properties of k-power free numbers and k-power complement numbers, and give an interesting asymptotic formula.
Algorithms for Automated Negotiations and Their Applications in Information Privacy
Authors: Haifei Li, David Ahn, Patrick C. K. Hung
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Automated negotiations have been an active research topic for many years. Most of the research work on this area focuses either on the abstract and theoretical models or on the system architectures for stand-alone negotiation applications. There is little work on identifying and studying practical algorithms for automated negotiations. In this paper, two algorithms have been proposed and their innovative applications have been discussed. The first algorithm guarantees that negotiation results are Pareto optimal solutions. The second algorithm guarantees that an agreement can be agreed upon after a certain number of proposal/counterproposal exchanges. These two algorithms can be used in the two-phase model for the automated negotiation process. In addition to these algorithms, their applications in information privacy negotiation have been described. In the information privacy management domain for service industries, it is critical for service requestors to only reveal the absolute necessary private information to the service providers. Traditionally, service requestors usually give whatever private information service providers have asked for. The grave consequence is that service providers may misuse the private information provided by service requestors, even though the service providers may have promised not to reveal it. Algorithms described in this paper can facilitate the privacy negotiation process. In order to show the concept of negotiation in information privacy, credit card information has been used to illustrate the application of algorithms.
Attitudes and Perceptions Related to Information Security - Case: Rotuaari
Authors: Tiina Havana, Juha Roning
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

The purpose of this research was to evaluate security awareness related to information technology in order to be able to develop information security communication procedures further. The research was conducted as a case study in the context of a mobile multimedia service research project. The research data was gathered with qualitative, semistructured theme interviews and focus group interviews. The interviewees were divided in four groups, vendors, content providers, technical researchers and non-technical researchers. The results indicate that at the moment there are knowledge and information channel deficits especially among people who do not have technical education or experience. These deficits cause uncertainty related to own possibilities to use new technology. The concept of information security, factors affecting in it and risks related to it are not clearly understood, which may cause difficulties to the development of the information society.
Empire of the ant: Andrea Pozzo
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

As part of the National Gallery of Art film series "Empire of the Eye," this excerpt illustrates two of the most remarkable illusionistic ceiling paintings in Italian Renaissance Art. Commissioned in 1684 to paint both an illusionistic dome and ceiling vault in the church of S. Ignazio in Rome, Andrea Pozzo documented invaluable sketches and perspective treatises as he worked. These rare documents were scanned and imported as templates to recreate digital models of his work. CGI was completed using AliaslWavefront Maya 3.0 and Adobe After Effects 5.5 running on Mac OS X. Copyright held by creator.
Towards an efficient single system image cluster operating system
Authors: Christine Morin, Pascal Gallard, Renaud Lottiaux, Geoffroy Vallée
Venue: Future Generation Computer Systems (2004)

The lack of a single system image Operating System (OS) for clusters restricts their use for parallel processing. We propose an approach for building an efficient single system image cluster operating system. The proposed system implements distributed services performing global and dynamic resource management to offer high performance, high availability and ease of use and programming. The programming API of the OS running on each cluster node is kept unmodified but the high level OS services can take benefit of all cluster resources. Our approach has been validated by a prototype based on Linux. Our prototype comprises of a limited kernel patch and a set of modules extending the kernel to implement the cluster distributed services. Existing applications running on symmetric multiprocessors (SMP) on top of Linux can be executed on top of our cluster OS without modification.
Study on the etching damage characteristics of PZT thin films after etching in Cl-based plasma
Authors: Kyoung-Tae Kim, Myoung-Gu Kang, Chang-Il Kim
Venue: Microelectronic Engineering (2004)

In present work, we carried out the investigations of plasma-induced etching damage for the PZT thin films etched using the various Cl-based gas chemistries. The basic gas mixture was Cl2/CF4 (8/2) while Ar or O2 were used as the additive gases (up to 20%). It was found that the etching in Cl2/CF4/Ar plasma provides higher a rate but degrades the remnant polarization more compared with Cl2/CF4/O2 plasma. X-ray photoelectron spectroscopy showed the contamination of the etched surfaces by ZrClx for both gas mixtures. The Auger electron spectroscopy and X-ray diffraction analyses show that Cl2/CF4/Ar plasma provides more significant etching damage, which cannot be recovered by the O2 annealing. For the Cl2/CF4/O2 plasma, annealing under the O2 atmosphere helps to restore the ferroelectric properties resulting in good recovering of the remnant polarization.
A Performance-Optimizing Scheduling Technique for Mesh-Connected Multicomputers Based on Real-Time Job Size Distribution
Authors: Hsiu-Jy Ho, Wei-Ming Lin
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Among all non-blocking non-preemptive schedulingtechniques for mesh-connected multicomputer systemto ensure contiguous processor allocation, Largest-Job-First (LJF)technique proves to be one of the bestin achieving small latency compared to others suchas First-Come-First-Serve (FCFS) and Smallest-Job-First (SJF).We notice that LJF prevails when thereis a significant variance in the number of processorsrequested among jobs.Instead, if the variance is relativelysmall, the merit of LJF is overshadowed by its inherentdisadvantage in approaching bypass limit fasterthan the simpler FCFS one.Thus, the size-order usedby the LJF for scheduling should be weighed less versusthe arriving-order used by the FCFS whenever the varianceis smaller.This paper proposes a novel schedulingtechnique to self-adjust in real-time between the two ordersaccording to the size variance among the jobs inthe queue.This technique ensures that the advantage ofthe LJF is preserved while significantly diminishing thechance for the blocking situation to occur.Our simulationresults consistently show an significant improvementfrom our technique over the LJF and the FCFS ones.
Load Balancing of DNS-Based Distributed Web Server Systems with Page Caching
Authors: Zhong Xu, Rong Huang, Laxmi N. Bhuyan
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

The explosion of WWW traffic has triggered great interestin distributed web server systems. Among variousdistributed web server architectures, the DNS-based distributedsystem is a promising solution in terms of performance,scalability and availability. DNS(Domain NameServer) name caching has significant effects on the loadbalance of distributed web server systems, due to the trafficskewness it causes. Also, there is page caching alongwhole paths between clients and web servers, and pagecaching schemes could affect the system load balancing alot. In this paper, we examine various caching issues, includingthe load balancing algorithms of the DNS, the locationsof caches, and the page caching policies, for theDNS-based web server system. We use stochastic processesto model the web traffic, and compare the load balance performanceof these algorithms and policies based on simulationresults. We found that, the DNS load balancing algorithm,which takes into account both client domain informationand server load information, could yield best load balanceperformance among various algorithms, and a server-sidecache with the policy which only caches popular webpages could significantly improve both the cache hit ratioand the load balance.
Measuring Globalization of ICT Industries: Empirical Evidence across Six Economies of East Asia and Over Time
Authors: Yi-Min Chen, Feng-Jyh Lin
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

This paper presents an objective measurement of industry globalization for ICT industries across six economies, China, Hong Kong, Japan, Singapore, South Korea, and Taiwan. Previous studies on the measurement of industry globalization had focused on the chemical and manufacturing industries rather than ICT sectors, and aimed at the advanced countries, especially the United States, rather than the developing countries. Since information technology is still one of the emergent ideas that are changing the way business is done, and East Asia is becoming the world's manufacturing center of ICT sectors, this study explores where there is the same ground for industry globalization of ICT sectors across economies of East Asia. Based on the levels of international linkages and the integration of value-added activities within the industry, the result shows that most of East Asia's ICT industries are highly global-oriented, either simple or integrated global, except Japan's communications equipment sector, which is multidomestic transitional.
Integrating UML Views with Visual Cues
Authors: Jouni Huotari
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

Information system models often consist of multiple views and semi-structured diagrams, which form both a hierarchical and a network structure. These models should be reviewed in order to find possible faults as early as possible in the development process. A conventional CASE tool shows diagrams in separate windows without any visual cues about how diagrams relate to each other. This might result in design errors, omissions, and inconsistencies. We introduce problem areas and potential solutions on how to visualize interrelationships between UML diagrams. Our research prototype enables exploration within the model, utilizes intelligent zooming (hides and shows details automatically), and shows how diagrams and objects within them could be related to each other by using visual cues.
Three Dimensional Multiple Valued Circuits Design Based on Single-Electron Logic
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The three-dimensional (3D) model of a multiple valuednetwork based on hypercube-like topology is proposed.A graph embedding technique is used to designhypercube based structures. It is shown that hypercube-liketopology is a Single-Electron Transistor (SET)technology-oriented solution to the implementation ofmultiple-valued networks.
Ontology Specific Data Mining Based on Dynamic Grammars
Authors: Daniel Quest, Hesham Ali
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this paper we introduce a new formal approach for mining biological data sets. The proposed grammar based approach provides a flexible and powerful tool for advanced sequence comparison and data mining. The approach benefits from the power of regular expressions in allowing the use of advanced queries in comparing sequences and searching fro motifs or sequence attributes in biological databases. The formal grammar and the corresponding data mining engine is capable of extracting records from biological databases, filtering a subset of those records for mining, and then sorting those records based on similarity scheme designed by the user. This model is based on the objective (ontology) of the user and scoring is dynamic that is provided at runtime.
Address translation in telecommunication features
Authors: Pamela Zave
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2004)

Address translation causes a wide variety of interactions among telecommunication features. This article begins with a formal model of address translation and its effects, and with principles for understanding how features should interact in the presence of address translation. There is a simple and intuitive set of constraints on feature behavior so that features will interact according to the principles. This scheme (called "ideal address translation") has provable properties, is modular (explicit cooperation among features is not required), and supports extensibility (adding new features does not require changing old features). The article also covers reasoning in the presence of exceptions to the constraints, limitations of the theory, relation to real networks and protocols, and relation to other research.
Horizontal aggregations for building tabular data sets
Authors: Carlos Ordonez
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

In a data mining project, a significant portion of time is devoted to building a data set suitable for analysis. In a relational database environment, building such data set usually requires joining tables and aggregating columns with SQL queries. Existing SQL aggregations are limited since they return a single number per aggregated group, producing one row for each computed number. These aggregations help, but a significant effort is still required to build data sets suitable for data mining purposes, where a tabular format is generally required. This work proposes very simple, yet powerful, extensions to SQL aggregate functions to produce aggregations in tabular form, returning a set of numbers instead of one number per row. We call this new class of functions horizontal aggregations. Horizontal aggregations help building answer sets in tabular form (e.g. point-dimension, observation-variable, instance-feature), which is the standard form needed by most data mining algorithms. Two common data preparation tasks are explained, including transposition/aggregation and transforming categorical attributes into binary dimensions. We propose two strategies to evaluate horizontal aggregations using standard SQL. The first strategy is based only on relational operators and the second one uses the "case" construct. Experiments with large data sets study the proposed query optimization strategies.
Image based gisting in CLIR
Authors: Mark Sanderson, Robert Pasley
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we describe research which could lead to a novel approach to gathering an overview of a document in a foreign language. The research explores how much of the meaning of a document could be represented using images by researching the ability of subjects to derive the search term that might have been used to return a set of images from an image library. The Google image search engine was used to retrieve the images for this experiment, which uses English throughout. The results were analysed with respect to a previous paper [1] exploring ability to recognise concrete objects in hierarchies. It was found that there is a tendency to use one particular level of categorization.
Privacy preserving database application testing
Authors: Xintao Wu, Yongge Wang, Yuliang Zheng
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

Traditionally, application software developers carry out their tests on their own local development databases. However, such local databases usually have only a small number of sample data and hence cannot simulate satisfactorily a live environment, especially in terms of performance and scalability testing. On the other hand, the idea of testing applications over live production databases is increasingly problematic in most situations primarily due to the fact that such use of live production databases has the potential to expose sensitive data to an unauthorized tester and to incorrectly update information in the underlying database. In this paper, we investigate techniques to generate mock databases for application software testing without revealing any confidential information from the live production databases. Specifically, we will design mechanisms to create the deterministic rule set R, non-deterministic rule set N R, and statistic data set S for a live production database. We will then build a security Analyzer which will process the triplet <R',N R',S'> together with security requirements (security policy) and output a new triplet <R',N R',S'> The security Analyzer will guarantee that no confidential information could be inferred from the new triplet <R',N R',S'> The mock database generated from this new triplet can simulate the live environment for testing purpose, while maintaining the privacy of data in the original database.
Network Interface Generation for MPSOC: From Communication Service Requirements to RTL Implementation
Authors: Arnaud Grasset, Frederic Rousseau, Ahmed A. Jerraya
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

To deal with the increasing complexity of electronicproducts, multiprocessor SoCs are more and moreused. These systems are designed by composition ofcomponents communicating through a communicationnetwork, which means that some network interfacesshould be inserted to adapt computation componentswith the communication network. This paper deals withthe automatic generation of network interfaces bycomposition of hardware components. The goal of ourmethodology is to ease the HW/SW integration. Thismethodology starts from a description of thecommunication services the network interface has toprovide. This model is then refined to an abstractmodel of the interface used to generate thearchitecture. An RTL model is then implemented.