ppxscal/embedding_network huggingface dataset:
Reducing Operand Communication Overhead using Instruction Clustering for Multimedia Application
Authors: Hongkyu Kim, D. Scott Wills, Linda M. Wills
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

As technology trends yield shorter cycle times and larger, wider datapaths in architectures for multimedia systems, global broadcast networks for operand communication are becoming a major bottleneck in processor performance. New low-latency operand transport techniques are needed. This paper proposes and evaluates lower cost mechanisms than traditional bypass networks, exploiting regular operand distribution patterns in multimedia applications. To reduce latency associated with operand movement within a datapath, our mechanism, called dynamic instruction clustering, groups chains of dependent instructions within a basic block at runtime, identifies intermediate value transportation, and schedules it on networked ALUs which are connected by a local dedicated network. By converting global communication into local, the transport latency can be minimized and the critical path of the application code can be executed in consecutive, shortened cycles, resulting in improved performance. We demonstrated that 28% and 30% of total dependence edges residing in the instruction window can be localized on 8- and 16-way machines, respectively. Our results show that the overall performance gains over a wide range of multimedia applications are 16% for 8-way and 35% for 16-way on average.
An XML-Based Approach to Publishing and Querying the History of Databases
Authors: Fusheng Wang, Carlo Zaniolo
Venue: World Wide Web (2005)

There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing information encoded in this universal standard. In this paper, we explore the additional and unique benefits achieved by this approach on temporal database applications. We show that XML with XQuery can provide surprisingly effective solutions to the problem of supporting historical queries on past content of database relations and their evolution. Indeed, using XML, the histories of database relations can be naturally represented by temporally grouped data models. Thus, we identify mappings from relations to XML that are most conducive to modeling and querying database histories, and show that temporal queries that would be difficult to express in SQL can be easily expressed in standard XQuery. This approach is very general, insofar as it can be used to store the version history of arbitrary documents and, for relational databases, it also supports queries on the evolution of their schema.Then, we turn to the problem of supporting efficiently the storage and the querying of relational table histories. We present an experimental study of the pros and cons of using native XML databases, versus using traditional databases, where the XML-represented histories are supported as views on the historical tables.
Preventing attribute information leakage in automated trust negotiation
Authors: Keith Irwin, Ting Yu
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

Automated trust negotiation is an approach which establishes trust between strangers through the bilateral, iterative disclosure of digital credentials. Sensitive credentials are protected by access control policies which may also be communicated to the other party. Ideally, sensitive information should not be known by others unless its access control policy has been satisfied. However, due to bilateral information exchange, information may flow to others in a variety of forms, many of which cannot be protected by access control policies alone. In particular, sensitive information may be inferred by observing negotiation participants' behavior even when access control policies are strictly enforced.In this paper, we propose a general framework for the safety of trust negotiation systems. Compared to the existing safety model, our framework focuses on the actual information gain during trust negotiation instead of the exchanged messages. Thus, it directly reflects the essence of safety in sensitive information protection. Based on the proposed framework, we develop policy databases as a mechanism to help prevent unauthorized information inferences during trust negotiation. We show that policy databases achieve the same protection of sensitive information as existing solutions without imposing additional complications to the interaction between negotiation participants or restricting users' autonomy in defining their own policies.
Evaluating adaptive resource management for distributed real-time embedded systems
Authors: Nishanth Shankaran, Xenofon Koutsoukos, Douglas C. Schmidt, Aniruddha Gokhale
Venue: Proceedings of the 4th workshop on Reflective and adaptive middleware systems (2005)

A challenging problem faced by researchers and developers of distributed real-time and embedded (DRE) systems is devising and implementing effective adaptive resource management strategies that can meet end-to-end quality of service (QoS) requirements in varying operational conditions. This paper presents two contributions to research in adaptive resource management for DRE systems. First, we describe the structure and functionality of the Hybrid Adaptive Resource management Middleware (HyARM), which provides adaptive resource management using hybrid control techniques for adapting to workload fluctuations and resource availability. Second, we evaluate the adaptive behavior of HyARM via experiments on a DRE multimedia system that distributes video in real-time. Our results indicate that HyARM yields predictable, stable, and high system performance, even in the face of fluctuating workload and resource availability.
The Evolving Grid Deployment and Operations Model within EGEE, LCG and GridPP
Authors: Jeremy Coles
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Over the last year the Enabling Grids for EsciencE (EGEE) project has seen its deployed resources grow to over 15,000 CPUs in more than 35 countries. The UK and Ireland Regional Operations Centre (UKI ROC) has played a significant role in the development and refinement of the presently used deployment and operations model. This paper reviews the background to the EGEE project and describes these models. As a large part of the EGEE resources are provided by sites of the Large Hadron Collider (LHC) Computing Grid (LCG), and within the UK by the Grid for Particle Physics project (GridPP), this paper describes the deployment activities surrounding these organisations and provides some insight into their future plans and challenges.
A value-based approach for understanding cost-benefit trade-offs during automated software traceability
Authors: Alexander Egyed, Stefan Biffl, Matthias Heindl, Paul Grünbacher
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Many software development standards mandate establishing trace links among software artifacts such as requirements, architectural elements, or source code. However, for typical real-world systems it is currently too expensive and error prone to generate highly detailed trace links. We previously developed an approach to semi-automatically generate trace links and analyzed cost-benefit trade-offs in this context. We consider it as imperative to include value considerations into planning the generation of trace dependencies. This paper discusses three key trade-off decisions for planning the trace generation process: (a) the level of detail of traces among artifacts; (b) the value of the artifacts that are traced; and (c) the points in time of trace generation (early vs. late). We present cost-benefit considerations, empirical data, and argue for a pragmatic value-based planning approach.
New indicators for gender studies in web networks
Authors: Hildrun Kretschmer, Isidro F. Aguillo
Venue: Information Processing and Management: an International Journal (2005)

New indicators for gender studies are introduced using the multi-authored publications of a set of 64 members of the COLLNET network. Considering the sample of 223 papers and their visibility on the Web, analyses were performed on the sets comprised of publications on the one hand and the authors (social network analysis) on the other.The indicators developed include: Gender co-operation; Web visibility rates and Gender centrality in networks.The co-operation among COLLNET members results in a publication set with a different pattern to other gender studies in science, which show low contribution rates of women in collaboration activities. In the sample the collaboration patterns of female COLLNET members are almost the same as their male counterparts. However, when considering only the arrangement of gender in the by-line of publications, this is in favour of men.Regarding average Web visibility rates, there are no differences dependent upon the arrangement of gender in publications with both male and female co-authors. However, the results also show strong gender differences in favour of publications with only male co-authors.The centrality of female actors in the networks is correlated with the central positions of women in the International Society for Scientometrics and Informetrics (ISSI), where they are leading either as presidents or organisers of its international conferences.It may well be that, with webometric methods and new indicators for gender studies, there is a real continuation of gender equality in COLLNET over time.
A Nonlinear Scalarization Function and Generalized Quasi-vector Equilibrium Problems
Authors: G. Y. Chen, X. Q. Yang, H. Yu
Venue: Journal of Global Optimization (2005)

Scalarization method is an important tool in the study of vector optimization as corresponding solutions of vector optimization problems can be found by solving scalar optimization problems. In this paper we introduce a nonlinear scalarization function for a variable domination structure. Several important properties, such as subadditiveness and continuity, of this nonlinear scalarization function are established. This nonlinear scalarization function is applied to study the existence of solutions for generalized quasi-vector equilibrium problems.
Tailoring the Dolev-Yao abstraction to web services realities
Authors: Michael Backes, Thomas Groβ
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

Web Services are an important series of standards for adding semantics to web-based and XML-based communication. For analyzing the security of Web Services protocols composed of these standards, it is tempting to exploit their similarity to traditional security protocols by first transforming them into the Dolev-Yao abstraction, where cryptographic operators are treated symbolically as constructors of a free algebra, and as a second step by applying existing symbolic techniques for machine-assisted or even fully automated protocol verification within this abstraction.We show in this paper that this approach tends to ignore intrinsic aspects of Web Services standards and protocols and to hence be too coarse-grained for capturing Web Services security in all its facets. We identify a series of such aspects both on the conceptual level and on the level of concrete Web Services protocols: service requestors and providers have additional properties independent of the protocol under consideration and hence offer additional attack possibilities, protocol behaviors can be defined by explicit Web Services policies and complex message parsings which do not necessarily follow the common Dolev-Yao-style parsing conventions, etc. We sketch in a series of examples how to exploit these aspects for mounting successful attacks against Web Services protocols, and we discuss possibilities to circumvent these attacks. In particular, this exemplifies the need for tailoring Dolev-Yao abstractions specifically to Web Services idiosyncrasies, which go beyond the standard Dolev-Yao assumptions.
A Reconfigurable Optical Interconnect System for DSAG
Authors: LI Lei, CAO Zheng, CHEN Ming-Yu, FAN Jian-Ping
Venue: Proceedings of the Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (2005)

High performance computing research is facing challenges and innovation on architecture is urgent. DSAG architecture is proposed and delivers "Architecture on Demand" feature. In DSAG, components in different catalogs are parted, while the ones in same catalog are congregated. This architecture can be enabled by optical interconnect and reconfigurable computing technology. Using advanced optical devices and enhanced reconfigurable computing devices (FPGA), we build a prototype system for DSAG. Optical interconnect can reach 16Gbps bandwidth; DDRAM interface is selected as host communication interface to match the bandwidth of optical channel; Reconfigurable logic and embedded processors are employed for flexible reconfiguration. The system is featured by high bandwidth, owerful, flexible.
Production and use of information. Characterization of informetric distributions using effort function and density function exponential informetric process
Authors: Thierry Lafouge, Camille Prime-Claverie
Venue: Information Processing and Management: an International Journal (2005)

Statistical regularities observed in the production or use of information have been studied for a long time. In this article we define an exponential informetric process to formalize these stochastic process. It is defined by combining an effort function with a density function. Without using the powerful results of Price on the cumulative advantages process this characterization clarifies the principle of least effort. Some links between statistical theory of information and some informetric distributions are enhanced.
An ANFIS Based Method of Agent Behavior in Simulated Soccer Agents
Authors: Reza Zafarani, Mohammad Reza Yazdchi, Seyed Ali Seyed Salehi
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Multi-Agent systems has generated lots of excitement in recent years because of its promise as a new paradigm for conceptualizing, designing, and implementing software systems. One of the most important aspects of agent design in AI is the way agent acts or responds to the environment that the agent is acting upon. An effective action selection and behavioral method gives a powerful advantage in overall agent performance. We define a new method of action selection based on probability/priority models in RoboCup Soccer Simulation League[6] and for simulated soccer agents, we thereby introduce an efficient way to determine probabilities and a new priority based system which maps the human knowledge to action selection method. Furthermore, a behavior model is introduced to make the model more flexible.
Learning Functional Dependency Networks Based on Genetic Programming
Authors: Wing-Ho Shum, Kwong-Sak Leung, Man-Leung Wong
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Bayesian Network (BN) is a powerful network model, which represents a set of variables in the domain and provides the probabilistic relationships among them. But BN can handle discrete values only; it cannot handle continuous, interval and ordinal ones, which must be converted to discrete values and the order information is lost. Thus, BN tends to have higher network complexity and lower understandability. In this paper, we present a novel dependency network which can handle discrete, continuous, interval and ordinal values through functions; it has lower network complexity and stronger expressive power; it can represent any kind of relationships; and it can incorporate a-priori knowledge though user-defined functions. We also propose a novel Genetic Programming (GP) to learn dependency networks. The novel GP does not use any knowledge-guided nor application-oriented operator, thus it is robust and easy to replicate. The experimental results demonstrate that the novel GP can successfully discover the target novel dependency networks, which have the highest accuracy and the lowest network complexity.
An Efficient MAC Protocol for Sensor Network Considering Energy Consumption and Information Retrieval Pattern
Authors: Y. Ghiassi, Mohammad M. M. Rad, Mohammad S. Nikjoo, Ali hesam Mohseni, Babak H. Khalaj
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

A SEnsor Network with Mobile Agents (SENMA) is an architecture proposed for large scale sensor networks in which the access point moves above the network and gathers information from a limited number of nodes. However, the performance of such system is limited by estimation errors and packet errors due to collision. In this paper, we first derive the equations of distortion in a general scenario and use this model to obtain four best node positions in order to achieve min-max estimation error in a square. In addition, an opportunistic MAC is proposed that considers both collision effects and estimation error based on Channel State Information (CSI). As the simulation results show the proposed scheme achieves an optimum estimation with minimum collision and energy consumption.
Multi-Server Queueing Systems with Multiple Priority Classes
Authors: Mor Harchol-Balter, Takayuki Osogami, Alan Scheller-Wolf, Adam Wierman
Venue: Queueing Systems: Theory and Applications (2005)

We present the first near-exact analysis of an M/PH/k queue with m > 2 preemptive-resume priority classes. Our analysis introduces a new technique, which we refer to as Recursive Dimensionality Reduction (RDR). The key idea in RDR is that the m-dimensionally infinite Markov chain, representing the m class state space, is recursively reduced to a 1-dimensionally infinite Markov chain, that is easily and quickly solved. RDR involves no truncation and results in only small inaccuracy when compared with simulation, for a wide range of loads and variability in the job size distribution.Our analytic methods are then used to derive insights on how multi-server systems with prioritization compare with their single server counterparts with respect to response time. Multi-server systems are also compared with single server systems with respect to the effect of different prioritization schemes--"smart" prioritization (giving priority to the smaller jobs) versus "stupid" prioritization (giving priority to the larger jobs). We also study the effect of approximating m class performance by collapsing the m classes into just two classes.
Note: The distributed virtual shared-memory system based on the InfiniBand architecture
Authors: Inho Park, Seon Wook Kim
Venue: Journal of Parallel and Distributed Computing (2005)

Even though there have been strong research activities about distributed virtual shared-memory (DVSM) systems, their architectures have been not widely used in current high-performance computing markets. The reason is that the previously introduced DVSM systems use conventional interconnection technologies like Ethernet, which incurs high execution overhead due to process interruption at data communication for memory consistency. In this paper, we present the DVSM architecture based on the next generation of an interconnection technique, the InfiniBand Architecture (IBA). Because the IBA supports shared-memory programming semantics by means of remote direct-memory access (RDMA) and atomic operations in hardware, we can minimize the communication overhead for memory consistency on the DVSM system. For characterizing multithreaded applications on our IBA-based DVSM system, we examined two different shared-memory programming models, i.e. SPMD and OpenMP benchmarks. We show that our DVSM to use full features of the IBA can improve the performance significantly over the IPoIB-based DVSM system in all benchmarks, and also comparable to the bus-based shared-memory multiprocessor system in some benchmarks.
Enhanced Image/Video Compression Using Diagonal Divide
Authors: Husnain Malik, F. Naeem, N. Arora
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper introduces the concept of Diagonal Divide for image compression which is based on Discrete Cosine Transform. Most of the image/signal compression schemes focus on energy compression and decorrelation. The proposed technique makes use of this energy compaction fact to further reduce the amount of data to be processed. Along with it, the image¿s result before and after the implementation of Diagonal Divide are compared. Criterion used here for measuring the quality of the resulting images is Mean Square Error (MSE). Keeping in mind that Mean Square Error is not a reliable criterion for measurement of quality; images are also included so that the reader can better judge the outcome of introducing this compression scheme.
Consistency Analysis of Interorganizational Processes Based on Activity Diagrams
Authors: Yan Zhijun
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Consistency property describes the relation between the communication pattern and process logic of interorganizational processes. And the Petri net and message sequence chart are applied as the modeling tool for the communication pattern and process logic of interorganizational processes respectively. But these two different modeling tools bring confusions and make it is hard to analyze the consistency property of interorganizational processes. The modeling method of interorganizational processes based on activity diagrams is proposed in this work. The formal semantics of activity diagrams and the standardized mapping technique from activity diagrams to message sequence charts are introduced. Based on activity diagrams, the N-consistency property of interorganizational processes is defined and verified.
Dynamics and model-based control for mobile modular manipulators
Authors: Yugang Liu, Yangmin Li
Venue: Robotica (2005)

The dynamic modeling and trajectory following issues are addressed for mobile modular manipulators. Simulations are performed to validate the proposed algorithms.
Compact ATPG for Concurrent SOC Testing
Authors: Arkan Abdulrahman, Spyros Tragoudas
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

An Automatic Test Pattern Generation (ATPG) tool is presented that generates compact test sets that test concurrently the digital embedded cores in a System on Chip. The approach is driven by novel graph theoretic problem formulation to generate patterns for two or more cores in parallel. Pairs of input lines from different cores as well as pairs of output lines are systematically allocated on the same Test Access Mechanism (TAM) lines to improve the efficiency of the ATPG. The approach enables core integrators to determine which pairs of cores can be tested concurrently with the same test bus. Low application time for 100% single stuck-at fault coverage is sought subject to a given TAM bandwidth. The experimental results show drastic reductions in the test application time over the conventional ATPG method that generates tests for each core separately.
Counting bordered and primitive words with a fixed weight
Authors: Tero Harju, Dirk Nowotka
Venue: Theoretical Computer Science (2005)

A word w is primitive if it is not a proper power of another word, and w is unbordered if it has no prefix that is also a suffix of w. We study the number of primitive and unbordered words w with a fixed weight, that is, words for which the Parikh vector of w is a fixed vector. Moreover, we estimate the number of words that have a unique border.