ppxscal/embedding_network huggingface dataset:
Proceedings of the joint international conference on Measurement and modeling of computer systems
Venue: Joint International Conference on Measurement and Modeling of Computer Systems (2004)

To fully understand a system is to fully understand its performance in its intended environment. The system can be a logic gate, an algorithm, a computer, an operating system, or a computer network. The scale covered by these systems is huge, extending from switches at nano (molecular) scale to communication systems at astronomical scales. The problems posed in performance evaluation are often extremely difficult, a fact that has strong implications for those who create systems: If a system's performance is hard to evaluate, then the system will be hard to understand; this fact has had less influence on system designers than one might hope for. We risk only slight exaggeration by likening the behavior of 100,000 lines of code to that of an emotional primate, common emotions being obstinacy and crankiness. (Will performance analysis merge with psychoanalysis?So our field of performance measurement, modeling, and evaluation is at the heart of all engineering and applied science. It is strong and vibrant, as it must be, and its practitioners are driven, enthusiastic researchers, educators, and managers; the papers in the proceedings to follow are among their latest contributions to the field's collective wisdom, particularly in the computer and network engineering sciences.The authors of the papers herein are to be congratulated for having met the increasingly stiff standards of the program committees (PCs) of SIGMETRICS and the IFIP Working Group 7.3. On the other side of the coin, the PC members, especially the Program Co-Chairs Zhen Liu and Arif Merchant, deserve our gratitude for their tireless efforts in putting together an outstanding program of presentations; special thanks in the present context go to Yefim Shuf for seeing to the production of these proceedings. The chair takes this opportunity to thank the other members of the organizing committee for their selfless and skillful work on all aspects of conference organization: Vishal Misra (local arrangements - and much more), Li Zhang (tutorials, student support), Sambit Sahu (finance), Jason Nieh (publicity), Philippe Nain (student support), a late addition, and finally our web guys Hanhua Feng and Angelos Stavrou. The chair owes particular thanks to all, as dealing with him (another cranky primate), has not always been easy.
Dynamical coupling between locomotion and respiration
Authors: Andreas Daffertshofer, Raoul Huys, Peter J. Beek
Venue: Biological Cybernetics (2004)

In search of the formative principles underwriting locomotor-respiratory coupling, we reanalyzed and modeled the data collected by Siegmund and coworkers (1999) on the synchronization of respiration during rowing. Apart from the frequency doubling in respiration reported earlier, detailed time-resolved spectral analyses revealed decreasing stability of entrainment close to abrupt changes in frequency relations as well as switches in the relative phase between respiration and locomotion. A single physiological, albeit mechanically constrained, quantity sufficed to explain the observed frequency and phase locking phenomena: the effective value of oxygen volume in the lungs. The cyclic abdominal pressure modulates the self-sustaining rhythmic respiration, modifies the total lung pressure, and causes (local) maxima at frequency ratios between movement and respiration that are composed of small integers. Hence, optimizing the effective oxygen volume can be seen as the mechanism that drives respiration to synchronize with locomotion.
A New Surface Integral Formulation For Wideband Impedance Extraction of 3-D Structures
Authors: Ben Song, Zhenhai Zhu, John D. Rockway, Jacob White
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Detailed electromagnetic analysis of three-dimensional structures in multi-layereddielectric media is critical for automatic generation of equivalentcircuit models for the interconnects and packages in RF or mixed signalintegrated circuits. In this paper we present a new wideband surface integralformulation that can be readily combined with the well-establishedlayered Green's function techniques. In discretizing the formulation, wehave used the well-known RWG linear basis function to reduce the numberof unknowns. Using a so-called loop-star basis transformation andthe frequency normalization, the accuracy at low frequencies has beenimproved substantially. Several numerical examples are used to validatethe accuracy and robustness of this new formulation.
SRPVS: A New Motif Searching Algorithm for Protein Analysis
Authors: Xiaolu Huang, Hesham Ali, Anguraj Sadanandam, Rakesh Singh
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In some protein sequence regions, when two sequences share similar amino acid composition, they also share the same biological structure regardless of the sequence order. Traditional protein analysis tools, since they are sequence order dependent, cannot detect such a sequence order relaxing similarity. In this study, a more flexible protein comparison algorithm, the Similar enRiched Parikh Vector Searching (SRPVS) algorithm is designed to detect sequence similarity in a local-sequence-order-flexible manner. In SRPVS, a peptide sequence is broken into a group of Parikh vectors of predefined word sizes, and then Similar enRiched Parikh Vectors (SRPV) are searched between the two sequences and an Order Score is assigned to each pair of SRPV to reflect the order difference between the two sequences. A test has shown that SRPVS can detect shuffled protein sequence regions that share biological structure between two protein sequences.
Implementing SIP and H.323 Signalling as Web Services
Authors: Ge Zhang, Markus Hillenbrand
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Nowadays, existing Voice over IP (VoIP) clients are signalling protocol dependant. This means that they can only support one signalling protocol. One disadvantage of these VoIP clients is that they are rich clients, and the other is that the problem of interoperability between two clients supporting different signalling protocols must be solved by a signalling protocol translator. We propose a VoIP Web Services architecture, taking advantage of the Web Services technology to solve the above problems. This paper explores the design and implementation of a VoIP Web Services system architecture. We first propose a VoIP Web Service architecture, and then we focus mainly on designing the signalling protocol Web Services, and illustrate the call procedures between the Simple Client and the normal H.323/SIP client under this architecture. We also present the experience in implementing the prototype for the H.323/SIP Web Services, and finally give some considerations about the implementation.
Optimising flash memory tunnel programming
Authors: Fernanda Irrera, Teodoro Fristachi, Domenico Caputo, Bruno Riccò
Venue: Microelectronic Engineering (2004)

Flash memory programming by means of Fowler-Nordheim tunnelling has been studied with the aim of minimising oxide degradation and, at the same time, limiting the program voltage and reducing the program time. The target has been obtained using a waveform composed of a few number of pulses. The program accuracy has been validated by means of measurements on a set of flash cells. In particular, using 7 nm-thick tunnel oxide, program time and voltage of, respectively, 21 µs and 18 V, have been demonstrated for a target shift voltage of 1.5 V. Using the optimised waveform, cycling has negligible effects on the program window.
Evaluating support for global address space languages on the Cray X1
Authors: Christian Bell, Wei-Yu Chen, Dan Bonachea, Katherine Yelick
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

The Cray X1 was recently introduced as the first in a new line of parallel systems to combine high-bandwidth vector processing with an MPP system architecture. Alongside capabilities such as automatic fine-grained data parallelism through the use of vector instructions, the X1 offers hardware support for a transparent global-address space (GAS), which makes it an interesting target for GAS languages. In this paper, we describe our experience with developing a portable, open-source and high performance compiler for Unified Parallel C (UPC), a SPMD global-address space language extension of ISO C. As part of our implementation effort, we evaluate the X1's hardware support for GAS languages and provide empirical performance characterizations in the context of leveraging features such as vectorization and global pointers for the Berkeley UPC compiler. We discuss several difficulties encountered in the Cray C compiler which are likely to present challenges for many users, especially implementors of libraries and source-to-source translators. Finally, we analyze the performance of our compiler on some benchmark programs and show that, while there are some limitations of the current compilation approach, the Berkeley UPC compiler uses the X1 network more effectively than MPI or SHMEM, and generates serial code whose vectorizability is comparable to the original C code.
Detection and Limitation of Interval Inference in Statistical Databases
Authors: Claus Boyens, Oliver Gunther
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Interval inference is a specific kind of statisticaldisclosure where a snooper collects and analyzes publiclyavailable data to determine tight bounds on confidentialnumerical data. Institutions that disseminate public datainclude Census Bureaus and other independentorganizations such as regional healthcare initiatives thatprovide chronic disease data that is collected fromphysicians, pharmacies and health maintenanceorganizations (HMOs). Such initiatives must ensure thatthe confidential values of the data providers are protectedagainst interval inference while making sure that thereleased information is still useful for the prospectivedata users (such as medical researchers). In this paper,we consider the important case of 2-dimensional tableswhere the rows correspond to the data providers and thecolumns to confidential data categories. Although theinner cells of this table are confidential and should underno circumstances be published, marginal informationabout central tendency and dispersion can still be usefuland worth publishing. It is the task of the data-disseminatinginstitution to elicit these specific marginaldata elements for publication such that no tight bounds onany inner table cell can be inferred. We present a newmethod that maximizes the usefulness of the disseminatedinformation to the prospective data users while ensuringthe confidentiality of the inner table cell values. We give acomputational analysis and compare our methods toexisting statistical disclosure methods.
Eliminating Replica Selection - Using Multiple Replicas to Accelerate Data Transfer on Grids
Authors: Jun Feng, Marty Humphrey
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Data-intensive, high-performance computing applicationsoften require the efficient transfer of terabytesor even petabytes of data in wide-area, distributed computingenvironments. To increase the efficiency of widearea data movement, researchers have devised varioustechniques such as TCP tuning, multiple streams andasynchronous I/O. This paper adopts a new approach to increaseperformance further by exploiting replica-levelparallelism in Grids. rFTP, a new grid data transferringtool, improves the data transfer rate and reliabilityon Grids by utilizing multiple replica sources concurrently.Experiments on the NPACI Grid show as much as a2.02x speedup over a single data source by adaptively retrievingpartial data segments from 4 replicas using the data provided by NWS.
Integrity for Electronic Patient Record Reports
Authors: Ana Ferreira, Ricardo Correia, Luis Antunes, Ernesto Palhares, Pedro Marques, Pedro Costa, Altamiro da Costa Pereira
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The use of an EPR within a hospital is essential in order to integrate and centralize patienthealthcare information.With the introduction of this technology information securitybecomes an important issue, moreover when the EPR integrates several exam results andreports that need to be properly stored and managed.The Biostatistics and MedicalInformatics Department in Porto's Faculty of Medicine is implementing a centralizedElectronic Patient Record, the HSJ.ICU, to integrate several departments' information thatcomprises mainly electronic reports.The provision for the integrity of these documents isessential.Usually, the users of the system have blind trust in the information they access.The HSJ.ICU is implementing a process that digitally signs reports automatically, and thereforedoes not interfere with system's usability.It also provides for simple key management withthe use of only one public key pair focusing protection in one single point.The digitalsignature provides real trust in the way it prevents and detects inconsistencies or errors thatmay affect information integrity.The approach presented in this paper will guarantee thatwhen there is the need to access patient reports, whether now or in 20 years' time, those arestill trustable and valid to be integrated within the EPR.
Sociology and computing: introduction to this special issue
Authors: Edward Brent
Venue: Social Science Computer Review (2004)

The goal of this special issue was to include high-quality articles covering the complete spectrum of computing in sociology. The result is nine creative articles from three continents addressing a wide range of issues, including inequality in the form of the so-called digital divide, the use of computers in qualitative research and in teaching sociology, the relationship between research methods and the technologies of the Internet, and a historical analysis of the early use of computing machines in sociology.
Convex Embeddings and Bisections of 3-Connected Graphs1
Authors: Hiroshi Nagamochi, Tibor Jord&#x00e1;n, Yoshitaka Nakao, Toshihide Ibaraki
Venue: Combinatorica (2002)

Given two disjoint subsets T 1 and T 2 of nodes in an undirected 3-connected graph G = (V, E) with node set V and arc set E, where $${\left| {T_{1} } \right|}{\kern 1pt}$$ and $${\left| {T_{2} } \right|}{\kern 1pt}$$ are even numbers, we show that V can be partitioned into two sets V1 and V2 such that the graphs induced by V1 and V2 are both connected and $${\left| {V_{1} \cap T_{j} } \right|} = {\left| {V_{2} \cap T_{j} } \right|} = {\left| {T_{j} } \right|}/2$$ holds for each j = 1,2. Such a partition can be found in $$O{\left( {{\left| V \right|}^{2} {\kern 1pt} \log {\kern 1pt} {\left| V \right|}} \right)}$$ time. Our proof relies on geometric arguments. We define a new type of &#x2018;convex embedding&#x2019; of k-connected graphs into real space Rk-1 and prove that for k = 3 such an embedding always exists.
A generic architecture for adaptive agents based on reinforcement learning
Authors: Philippe Preux, Samuel Delepoulle, Jean-Claude Darcheville
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

In this paper, we present MAABAC, a generic model for building adaptive agents: they learn new behaviors by interacting with their environment. These agents adapt their behavior by way of reinforcement learning, namely temporal difference methods. MAABAC is presented in its generality and then, different instantiations of the generic model are presented and experiments are reported. These experiments show the strength of this way of learning.
Information-rich virtual environments: theory, tools, and research agenda
Authors: Doug A. Bowman, Chris North, Jian Chen, Nicholas F. Polys, Pardha S. Pyla, Umur Yilmaz
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

Virtual environments (VEs) allow users to experience and interact with a rich sensory environment, but most virtual worlds contain only sensory information similar to that which we experience in the physical world. Information-rich virtual environments (IRVEs) combine the power of VEs and information visualization, augmenting VEs with additional abstract information such as text, numbers, or graphs. IRVEs can be useful in many contexts, such as education, medicine, or construction. In our work, we are developing a theoretical foundation for the study of IRVEs and tools for their development and evaluation. We present a working definition of IRVEs, a discussion of information display and interaction in IRVEs. We also describe a software framework for IRVE development and a testbed enabling evaluation of text display techniques for IRVEs. Finally, we present a research agenda for this area.
Robust Protection against Fault-Injection Attacks on Smart Cards Implementing the Advanced Encryption Standard
Authors: Mark Karpovsky, Konrad J. Kulikowski, Alexander Taubin
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We present a method of protecting a hardwareimplementation of the Advanced Encryption Standard(AES) against a side-channel attack known as DifferentialFault Analysis attack.The method uses systematicnonlinear (cubic) robust error detecting codes.Error-detectingcapabilities of these codes depend not just onerror patterns (as in the case of linear codes) but also ondata at the output of the device which is protected by thecode and this data is unknown to the attacker since itdepends on the secret key.In addition to this, theproposed nonlinear (n,k)-codes reduce the fraction ofundetectable errors from 2{-r} to 2{-2r} as compared to thecorresponding (n,k) linear code (where n-k=r and k>=r).We also present results on a FPGA implementation of theproposed protection scheme for AES as well as simulationresults on efficiency of the robust codes.
BLAS: an efficient XPath processing system
Authors: Yi Chen, Susan B. Davidson, Yifeng Zheng
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We present BLAS, a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses P-labeling to process queries involving consecutive child axes, and D-labeling to process queries involving descendant axes traversal. The XML data is stored in labeled form, and indexed to optimize descendent axis traversals. Three algorithms are presented for translating complex XPath queries to SQL expressions, and two alternate query engines are provided. Experimental results demonstrate that the BLAS system has a substantial performance improvement compared to traditional XPath processing using D-labeling.
Context-based question-answering evaluation
Authors: Elizabeth D. Liddy, Anne R. Diekema, Ozgur Yilmazel
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this poster, we will present the results of efforts we have undertaken to conduct evaluations of a QA system in a real world environment and to understand the nature of the dimensions on which users evaluate QA systems when given full reign to comment on whatever dimensions they deem important.
On Composite Web Services Provisioning in an Environment of Fixed and Mobile Computing Resources
Authors: Zakaria Maamar, Quan Z. Sheng, Boualem Benatallah
Venue: Information Technology and Management (2004)

We present a framework for Web services provisioning in a hybrid environment of fixed and mobile computing resources. Several obstacles still hinder the seamless provisioning of Web services in mobile environments. Examples of such obstacles are: throughput and connectivity of wireless networks, limited computing resources of mobile devices, and risks of communication channel disconnections. In the proposed framework, software agents represent users, providers of services, and providers of resources. The business logic of composite services is expressed as a process model using statecharts formalism. Among other things, the use of agents provides an infrastructure that has the ability to handle disconnections during service preparation for execution. The framework also integrates a service execution planning approach to optimally select computing resources (fixed or mobile) on top of which services will be executed.
Investigating wired and wireless networks using a java-based programmable sniffer
Authors: Michael J. Jipping, Andrew Kalafut, Nathan Kooistra, Kathleen Ludewig
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Teaching students about networking requires laboratory investigation into network data. Such investigation requires examination of both wired and wireless network data. Most available network traffic sniffers are either too expensive or too cryptic to use. To implement network experiments in a classroom setting, we have developed NetSpy: a Java-based network sniffer that allows plug-in Java modules to analyze network data. NetSpy works with both wired and wireless networks. Modules are written by students as part of their experimentation with traffic data. This paper describes the NetSpy system and the way it can be used in a Networking clas.
An Efficient Hardware Implementation of Feed-Forward Neural Networks
Authors: Tamás Szabó, Gábor Horváth
Venue: Applied Intelligence (2004)

This paper proposes a new way of digital hardware implementation of nonlinear activation functions in feed-forward neural networks. The basic idea of this new realization is that the nonlinear functions can be implemented using a matrix-vector multiplication. Recently a new approach was proposed for the efficient realization of matrix-vector multipliers, and this approach can be applied for implementing nonlinear functions if these functions are approximated by simple basis functions. The paper proposes to use B-spline basis functions to approximate nonlinear sigmoidal functions, it shows that this approximation fulfils the general requirements on the activation functions, presents the details of the proposed hardware implementation, and gives a summary of an extensive study about the effects of B-spline nonlinear function realization on the size and the trainability of feed-forward neural networks.
Sharing the wealth: publishing electronic resources
Authors: Lillian N. Cassel, Edward A. Fox
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This poster describes the publication of educational resources in ACM's online Journal for Educational Resources in Computing (JERIC) and the US National Science Foundation's National STEM Digital Library (NSDL).
A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion
Authors: Józef Grabowski, Mieczyslaw Wodecki
Venue: Computers and Operations Research (2004)

This paper deals with a classic flow-shop scheduling problem with makespan criterion. Some new properties of the problem associated with the blocks have been presented and discussed, These properties allow us to propose a new very fast local search procedure based on a tabu search approach. Computational experiments (up to 500 jobs and 20 machines) are given and compared with the results yielded by the best algorithms discussed in the literature. These results show that the algorithm proposed solves the flow-shop instances with high accuracy in a very short time. The presented properties and ideas can be applied in any local search procedures.