ppxscal/embedding_network huggingface dataset:
File system design for an NFS file server appliance
Authors: Dave Hitz, James Lau, Michael Malcolm
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Network Appliance Corporation recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system, both because an NFS appliance must be optimized for network file access and because an appliance must be easy to use. This paper describes WAFL (Write Anywhere File Layout), which is a file system designed specifically to work in an NFS appliance. The primary focus is on the algorithms and data structures that WAFL uses to implement Snapshotst, which are read-only clones of the active file system. WAFL uses a copy-on-write technique to minimize the disk space that Snapshots consume. This paper also describes how WAFL uses Snapshots to eliminate the need for file system consistency checking after an unclean shutdown.
Language Primitives and Type Discipline for Structured Communication-Based Programming Revisited: Two Systems for Higher-Order Session Communication
Authors: Nobuko Yoshida, Vasco T. Vasconcelos
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Session primitives and types provide a flexible programming style for structured interaction, and are used to statically check the safe and consistent composition of protocols in communication-centric distributed software. Unfortunately authors working on session types have recently realised that some of the previously published systems fail to satisfy the basic theorems of Subject Reduction and Type Safety. This report discusses the issues involved in higher-order session communication, presents a formulation of the recursive types as well as proofs of the Subject Reduction and Type Safety Theorems of the original session typing system by Honda-Vasconcelos-Kubo in ESOP'98. It also proposes a variant which allows a more liberal higher-order session communication, based on an idea of Gay and Hole.
The SCSI interface conformance tests generation
Authors: Slawomir Zielski, Janusz Sosnowski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The paper presents a study of generating test sequences for the SCSI (Small Computer Systems Interface) interface. For this purpose a special conformance test generator has been developed. The paper describes the conformance testing algorithm and the conditions that are assumed for the tests. Test generation method is based on UIO (Unique Input Output) technique which is an unambiguous state identification method. Test cases are generated using FSM (Finite State Machine) model of the analysed protocol. The FSM model has been obtained by the detailed transformation of SDL protocol representation. The result of the conversion is an argument for test generator. The final product of the generator is expressed in TTCN notation.
Orthographic and perspective projection influences linear vection in large screen virtual environments
Authors: Laura C. Trutoiu, Silvia-Dana Marin, Betty J. Mohler, Claude Fennema
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Vection is defined as the visually induced illusion of self motion [Fischer and Kornm&uuml;ller 1930]. Previous research has suggested that linear vection (the illusion of self-translation) is harder to achieve than circular vection (the illusion of self-rotation) in both laboratory settings (typically using 2D stimuli such as black and white stripes) [Rieser 2006] and virtual environment setups [Schulte-Pelkum 2007; Mohler et al. 2005]. In real a life situation when experiencing circular vection all objects rotate around the observer with the same angular velocity. For linear motion, however, the change in the oberver position results in a change in the observed position of closer objects with respect to farther away objects or the background. This phenomenon, motion parallax, provides pictorial depth cues as closer objects appear to be moving faster compared to more distant objects.
Evaluation of MDA/PSM database model quality in the context of selected non-functional requirements
Authors: Iwona Dubielewicz, Bogumila Hnatkowska, Zbigniew Huzar, Lech Tuzinkiewicz
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Conceptual, logical, and physical database models can be regarded as PIM, PSM1, and PSM2 data models within MDA architecture, respectively. Many different logical database models can be derived from a given conceptual database model by applying a set of transformations rules. To choose a logical database model for further transformation (to physical database model at PSM2 level) some selection criteria based on quality demands, e.g. database efficiency, easy maintainability or portability, should be established. To evaluate quality of the database models some metrics should be provided. We present metrics for measuring two selected, conflicted quality characteristics (efficiency and maintainability), next we analyse correlation between the metrics, and finally propose how to assess quality of logical database models.
Analysis of spectral and wavelet-based measures used to assess cardiac pathology
Authors: C. Heneghan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In previous studies of heart rate variability in humans, it has been demonstrated that the scale-dependent wavelet transform (WT) standard deviation [/spl sigma//sub wav/(m)] of the interbeat intervals can be used to discriminate patients with certain forms of cardiac dysfunction from normal subjects. This paper forges an explicit link between this measure and a corresponding spectral measure, which is also shown to provide discrimination between the two classes of data. The statistics of the estimator for /spl sigma//sub wav/(m) are obtained in the analytically simplest case, including expressions for its bias and variance. Numerical simulations are provided to support the theoretical analysis. We compare the bias, variance, and frequency resolution of the WT and spectral measures, and conclude that the former appears more suited to our particular circumstances.
Chinese-wall process confinement for practical distributed coalitions
Authors: Yasuharu Katsuno, Yuji Watanabe, Sanehiro Furuichi, Michiharu Kudo
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

A distributed coalition supports distributed mandatory access controls for resources whose security policies differ for each group of components over nodes, and provides secure information operations and exchanges with nodes that handle information over which conflicts of interest may occur. Many projects have proposed distributed coalitions using a virtual machine monitor, but this approach for strong confinement tends to hinder successful deployments in real world scenarios that involve complicated operations and management for applications because such access control is coarse-grained for the resources. In this paper, we propose a Chinese-Wall Process Confinement (CWPC) for practical application-level distributed coalitions that provide fine-grained access controls for resources and that emphasize minimizing the impact on the usability, using a program-transparent reference monitor. We implemented a prototype system named ALDC for standard office applications on Microsoft Windows that are used on a daily basis for business purposes and that may involve conflicts of interests, evaluated its performance and influence on usability, and show that our approach is practical.
Incomplete Star Graph: An Economical Fault-tolerant Interconnection Network
Authors: CP. Ravikumar, A. Kuchlous, G. Manimaran
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

A number of existing multiprocessors are based on the hypercube interconnection network. The popularity of the hypercube is due to its small communication diameter, which grows logarithmically with the cube size, its fault-tolerant properties, and its modularity which makes it possible to build a larger cube from smaller subcubes. The star graph has been studied as a network topology for fault-tolerant parallel com puting. Unfortunately, the size of the network grows too sharply with n to be affordable for values of n larger than 7 or 8. We introduce a novel intercon nection network known as the incomplete star graph, which overcomes the above problem while retaining the most of the advantages of the star graph. We present the architecture of the incomplete star graph and compare its performance with the full star as well as competing architectures such as the incomplete hy¬ percube and arrangement graphs. We provide routing algorithms for both non-faulty and faulty incompletestar graphs, and study their performance.
Semantic Composability Measure for Semantic Web Services
Authors: Elham Paikari, Jafar Habibi, Soheil Hassas Yeganeh
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to exploit all semantic information available for semantic web services to complete this task. For semantic web services, we propose a prioritized and limited list of other web services, with composability measure value based on feasibility of being succeeding service in a composition to fulfill the request. Due to the fact that in semantic web services, semantic information- all description and signatures- is defined by ontology language, we use some of the mapping rules to estimate a correlation between services for composability. Then we order them based on composability measure value and choose the n top values from them, for a list, which can be referenced in planning the composition with high degree of automation.
A Test Bed for Web Services Protocols
Authors: Pemadeep Ramsokul, Arcot Sowmya, S. Ramesh
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Transactions across composed web services (WS) are usually non-trivial and require the use of some pre-agreed or standard protocols. Proper specification and implementation of these protocols are critical for the correct execution and termination of transactions; incomplete or ambiguous specifications can give rise to interoperability problems. We have recently proposed a framework for specifying and verifying WS protocols. In this paper, we propose a test bed based on this framework for finding bugs in implementations of WS protocols especially when the number of entities that can participate is not always the same, which is typical of transaction protocols. We also illustrate the utility of our test bed using the implementation of an actual WS protocol.
Hierarchical Paging- Efficient Location Management
Authors: M. Szalay, S. Imre
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This paper introduces a new location management algorithm called Hierarchical Paging. A mathematical model for the proposed scheme is also presented. We have compared our solution to two other location management solutions using simulations. The environment, setup, simulation details and results are presented in this paper. It is concluded that there is a wide range of parameters where Hierarchical Paging is more efficient than the other location management algorithms.
Online Construction of Dynamic Object Process Graphs
Authors: Jochen Quante
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

A dynamic object process graph is a view on the con- trol flow graph from the perspective of a single object. It has been shown that such a graph can be a useful starting point for many reverse engineering tasks, such as program understanding, protocol recovery, and fea- ture location. In a previous paper, we described how dy- namic object process graphs can be constructed from de- tailed program traces. However, the size of such traces is immense. Moreover, the instrumentation was de- scribed only for procedural languages. Object-oriented features such as exceptions require special treatment. Also, techniques like multithreading and reflection were not handled by our previous approach. This prevented it from being applicable to real-life systems. In this paper, we introduce an alternative way of col- lecting the necessary data. By constructing an interme- diate graph online, i.e., concurrently with the running program, the trace size problem is eliminated. Addi- tional optimizations for both trace logging and online graph creation are discussed. In a case study, we show that running times are acceptable even for larger Java programs when these optimizations are applied. Addi- tionally, we discuss some special issues arising from analyzing Java instead of C.
Structure Layout Optimization for Multithreaded Programs
Authors: Easwaran Raman, Robert Hundt, Sandya Mannarswamy
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Structure layout optimizations seek to improve runtime performance by improving data locality and reuse. The structure layout heuristics for single-threaded benchmarks differ from those for multi-threaded applications running on multiprocessor machines, where the effects of false sharing need to be taken into account. In this paper we propose a technique for structure layout transformations for multithreaded applications that optimizes both for improved spatial locality and reduced false sharing, simultaneously. We develop a semi-automatic tool that produces actual structure layouts for multi-threaded programs and outputs the key factors contributing to the layout decisions. We apply this tool on the HP-UX kernel and demonstrate the effects of these transformations for a variety of already highly hand-tuned key structures with different set of properties. We show that na¨ýve heuristics can result in massive performance degradations on such a highly tuned application, while our technique generally avoids those pitfalls. The improved structures produced by our tool improve performance by up to 3.2% over a highly tuned baseline.
Fast Lagrange--Newton transformations
Authors: Ryszard Smarzewski, Joanna Kapusta
Venue: Journal of Complexity (2007)

In this paper we present explicit vector formulae for the Lagrange-Newton transformation L:K^n->K^n and its inverse L^-^1 with respect to interpolating knots x"i=@ax"i"-"1+@bi=1,2,...,n-1;x"0=@c, where @a
A novel dimensionally-decomposed router for on-chip communication in 3D architectures
Authors: Jongman Kim, Chrysostomos Nicopoulos, Dongkook Park, Reetuparna Das, Yuan Xie, Vijaykrishnan Narayanan, Mazin S. Yousif, Chita R. Das
Venue: ACM SIGARCH Computer Architecture News (2007)

Much like multi-storey buildings in densely packed metropolises, three-dimensional (3D) chip structures are envisioned as a viable solution to skyrocketing transistor densities and burgeoning die sizes in multi-core architectures. Partitioning a larger die into smaller segments and then stacking them in a 3D fashion can significantly reduce latency and energy consumption. Such benefits emanate from the notion that inter-wafer distances are negligible compared to intra-wafer distances. This attribute substantially reduces global wiring length in 3D chips. The work in this paper integrates the increasingly popular idea of packet-based Networks-on-Chip (NoC) into a 3D setting. While NoCs have been studied extensively in the 2D realm, the microarchitectural ramifications of moving into the third dimension have yet to be fully explored. This paper presents a detailed exploration of inter-strata communication architectures in 3D NoCs. Three design options are investigated; a simple bus-based inter-wafer connection, a hop-by-hop standard 3D design, and a full 3D crossbar implementation. In this context, we propose a novel partially-connected 3D crossbar structure, called the 3D Dimensionally-Decomposed (DimDe) Router, which provides a good tradeoff between circuit complexity and performance benefits. Simulation results using (a) a stand-alone cycle-accurate 3D NoC simulator running synthetic workloads, and (b) a hybrid 3D NoC/cache simulation environment running real commercial and scientific benchmarks, indicate that the proposed DimDe design provides latency and throughput improvements of over 20% on average over the other 3D architectures, while remaining within 5% of the full 3D crossbar performance. Furthermore, based on synthesized hardware implementations in 90 nm technology, the DimDe architecture outperforms all other designs -- including the full 3D crossbar -- by an average of 26% in terms of the Energy-Delay Product (EDP).
Human appearance modeling for matching across video sequences
Authors: Yang Yu, David Harwood, Kyongil Yoon, Larry S. Davis
Venue: Machine Vision and Applications (2007)

We present an appearance model for establishing correspondence between tracks of people which may be taken at different places, at different times or across different cameras. The appearance model is constructed by kernel density estimation. To incorporate structural information and to achieve invariance to motion and pose, besides color features, an additional feature of path-length is used. To achieve illumination invariance, two types of illumination insensitive color features are discussed: brightness color feature and RGB rank feature. The similarity between a test image and an appearance model is measured by the information gain or Kullback&#x2013;Leibler distance. To thoroughly represent the information contained in a video sequence with as little data as possible, a key frame selection and matching scheme is proposed. Experimental results demonstrate the important role of the path-length feature in the appearance model and the effectiveness of the proposed appearance model and matching method.
Proteomics data interoperation with applications to integrated data mining and enhanced information retrieval
Authors: Martin Schultz, Mark Gerstein
Venue:  (2006)

This thesis addresses the problem of data integration and interoperation of large-scale, widely distributed and independently maintained data, focusing on biological proteomics data which exemplifies the problem and has a practical need for better interoperation, and shows how such integrated data can be leveraged for important applications such as detailed cross-database queries in support of scientific exploratory data analysis and enhanced information retrieval. Semantic web RDF and RDF databases, which fit the problem well, are used to build two biological data integration systems called YeastHub and LinkHub. YeastHub is a lightweight semantic web data warehouse of joined RDF-formatted biological (yeast) data and allows RDF query access to it. LinkHub focuses on a high-level structuring principal or "scaffold" for biological data, storing biological identifiers (e.g. for proteins, genes, etc.) and the complex relationships among them as a large RDF directed labeled graph; LinkHub is used through web interactive and query interfaces and also complements YeastHub. Through several nontrivial RDF queries of the joined YeastHub and LinkHub data, we demonstrate that practical integrated biological data analysis can be achieved by basic, lightweight methods which don't attempt to solve the complete integration problem. A key focus of the LinkHub system is support for enhanced information retrieval of web documents and articles from the biomedical scientific literature (PubMed). We attach documents to identifier nodes in the LinkHub RDF graph and provide for the flexible retrieval of the documents through queries of the RDF graph's relational structure. In addition, we use the LinkHub RDF relational data and attached documents as training sets to construct classifiers for document relevance ranking in support of enhanced automated information retrieval of web or biomedical scientific literature documents related to biological identifiers. The results of experiments done to empirically measure the performance of this enhanced automated information retrieval for proteomics (UniProt) identifier-related documents through the use of a manually curated bibliography of yeast protein-specific literature citations are presented.
Theoretical Maximum and Saturation Throughput in The 802.11a Wireless LAN
Authors: Ha Cheol Lee
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper compares theoretical maximum throughput over ideal channels with saturation throughput over Ricean fading channels under the CSMA/CA (Carrier Sense Multiple Access/Collision Avoidance)-based DCF (Distributed Coordination Function) protocol at the MAC layer in the 802.11a wireless LAN.
Organizational Knowledge Measurement
Authors: Joanna Moczydlowska
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Knowledge is currently treated as one of the most important resources of the organization. During the time of global economy, conducted on the strongly competitive market and in conditions of turbulent changes in the surrounding, it is the knowledge which is becoming an important factor determinig the position on the market, opportunities of its development, multipling capital, and the same the worth of the enterprise. Hence the knowledge, or more -- the intelectual capital of enterprises -- have become the basic component of the worth of enterprise valuation. The article includes the try of the synthesis of the problems conected with the knowledge measurement in an organization, critical analysis of the measurement methods described in the literature. The measuremet here is widely understood, as various procedures which are supposed to deliver information on the size of the knowledge resources, the kind of the knowledge, the usage of it in the realization of the organization aims.
A Wearable 3-DOF Wire-driven Force Feedback Device
Authors: Yo-An Lim, Yong Won Seo, Jeha Ryu
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This paper addresses a new design and control of a wearable 3DOF force feedback device based on wiredriven parallel mechanisms. Unlike the existing wearable force feedback devices, the proposed wire-driven device is not supported by a rigid frame attached to the upper body. All electrical components of the device are located inside a wearable jacket and the device is powered by a few batteries. The force applied to the end-effector is produced by the tension of three wires connected to it and the tension of the wires are controlled by three motors. The kinematics and workspace analysis are discussed and a simple algorithm that makes a wire maintain minimum tension while without making it slack is proposed. Also end-effector position errors caused by the jexible positions of wire extracting points are discussed. Finally, some empirical results are presented. This device may be used in some applications which need force feedback functions, especially with mobile computer devices such as mobile phones, computers and PDAs.