ppxscal/embedding_network huggingface dataset:
Uclinux: a linux security module for trusted-computing-based usage controls enforcement
Authors: David Kyle, José Carlos Brustoloni
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

Usage controls allow the distributor of some information to limit how recipients of that information may use it. The Trusted Computing Group has standardized Trusted Platform Modules (TPMs) that are built into an increasing number of computers and could greatly harden usage controls against circumvention. However, existing operating systems support TPMs only partially. We describe UCLinux, a novel Linux Security Module that, unlike previous work, supports TPM-based attestation, sealing, and usage controls on existing processors and with minimal modifications in the operating system kernel and applications. Experiments show that UCLinux has modest impact on the system's boot latency and run-time performance.
Sharp adaptation for spherical inverse problems with applications to medical imaging
Authors: Ja-Yong Koo, Peter T. Kim
Venue: Journal of Multivariate Analysis (2008)

This paper examines the estimation of an indirect signal embedded in white noise for the spherical case. It is found that the sharp minimax bound is determined by the degree to which the indirect signal is embedded in the linear operator. Thus, when the linear operator has polynomial decay, recovery of the signal is polynomial, whereas if the linear operator has exponential decay, recovery of the signal is logarithmic. The constants are determined for these classes as well. Adaptive sharp estimation is also carried out. In the polynomial case a blockwise shrinkage estimator is needed while in the exponential case, a straight projection estimator will suffice. The framework of this paper include applications to medical imaging, in particular, to cone beam image reconstruction and to diffusion magnetic resonance imaging. Discussion of these applications are included.
Evaluation of game engines for simulated surgical training
Authors: Stefan Marks, John Windsor, Burkhard Wünsche
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

The increasing complexity and costs of surgical training and the constant development of new surgical procedures has made virtual surgical training an essential tool in medical education. Unfortunately, commercial tools are very expensive and have a small support base. Game engines offer unique advantages for the creation of highly interactive and collaborative environments. This paper examines the suitability of currently available game engines for developing applications for medical education and simulated surgical training. We formally evaluate a list of available game engines for stability, availability, the possibility of custom content creation and the interaction of multiple users via a network. Based on these criteria, three of the highest ranked engines are used for further case studies. We found that in general it is possible to easily create scenarios with custom medical models that can be cooperatively viewed and interacted with. Limitations in physical simulation capabilities make some engines unsuitable for fully interactive applications, but they can be used in combination with predefined animations. We show that overall game engines represent a good foundation for low cost virtual surgery applications and we discuss technologies which can be used to further extend their physical simulation capabilities.
Flute an Expert Floor Planner for Full-Custom VLSI Design
Authors: Hiroyuki Watanabe
Venue: IEEE Design Test (1987)

Flute is a heuristic floorplanner that operates as part of Cadre, a system of cooperating expert agents for converting a hierarchicalstructural description into full-custom VLSI layout. Flute is modeled on the human floorplanning process and uses a mixtureof rule-based programming, state control, and algorithmic operators. Initially, a topological plan is generated by placingmodules on a grid graph. From this plan, a constraint graph is prepared. This graph is solved to add geometric size and placementinformation to the floorplan. Though Flute handles a fairly small number of submodules at a time, it can construct a floorplanof complex VLSI layout using a hierarchical structure of ICs. Flute is implemented in Zeta-lisp on Symbolics Lisp machines.
FluNet: A hybrid internet simulator for fast queue regimes
Authors: Yung Yi, Sanjay Shakkottai
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

Motivated by the scale and complexity of simulating large-scale networks, recent research has focused on hybrid fluid/packet simulators, where fluid models are combined with packet models in order to reduce simulation complexity as well as to track dynamics of end-sources accurately. However, these simulators still need to track the queuing dynamics of network routers, leading to considerable simulation complexity in a large-scale network model. In this paper, we propose a new hybrid simulator - FluNet - where queueing dynamics are not tracked, but instead, an equivalent rate-based model is used. The FluNet simulator is predicated on a fast-queueing regime at bottleneck routers, where the queue length fluctuates on a faster time-scale than end systems. This allows us to simulate large-scale systems, where the simulation ''time step-size'' is governed only by the time-scale of the end-systems, and not by that of the intermediate routers; whereas a queue-tracking based fluid simulator would require decreasingly smaller step-sizes as the system scale size increases. We validate our model using a ns-2 based implementation. Our results indicate a good match between packet systems and the associated FluNet system.
Design of a DSP-based instrument for real-time classification of pulmonary sounds
Authors: Sameer Alsmadi, Yasemin P. Kahya
Venue: Computers in Biology and Medicine (2008)

Auscultation of pulmonary sounds provides valuable clinical information but has been regarded as a tool of low diagnostic value due to the inherent subjectivity in the evaluation of these sounds. In this work, a Digital Signal Processor is used to design an instrument capable of acquiring, parameterizing and subsequently classifying lung sounds into two classes with an aim to evaluate them objectively in real time. The instrument operates on sound signal from a chest microphone and flow signal from a pneumotachograph. The classification is carried out separately on the 12 reference libraries (pathological and healthy) of six sub-phases of a full respiration cycle and the results are combined to arrive at a final decision. The k-nearest neighbour and minimum distance classifiers with different distance metrics have been implemented in the instrument. The instrument was tested in the clinical environment, attaining 96% accuracy in real-time classification.
Forward-Secure Traceable Ring Signature
Authors: Chengyu Hu, Daxing Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A traceable ring scheme is a ring signature except that it can restrict "excessive" anonymity. The traceable ring signature has a tag that consists of a list of ring members and an issue that refers to, for instance, a social affair or an election. A ring member can make any signed but anonymous opinion regarding the issue, but only once (per tag). The traceable ring signature can suit to many applications, such as an anonymous voting on a BBS, a dishonest whistleblower problem, and unclonable group identification. In this paper, we suggest solutions to the key exposure problem in traceable ring signature. We propose the first forward secure traceable ring signature scheme and we prove its security in random oracle model.
The Metric Bridge Partition Problem: Partitioning of a Metric Space into Two Subspaces Linked by an Edge in Any Optimal Realization
Authors: Alain Hertz, Sacha Varone
Venue: Journal of Classification (2007)

Let G = (V,E,w) be a graph with vertex and edge sets V and E, respectively, and w:E ¿ R + a function which assigns a positive weight or length to each edge of G. G is called a realization of a finite metric space (M,d), with M = { 1,...,n} if and only if { 1,...,n} ¿ V and d(i,j) is equal to the length of the shortest chain linking i and j in G ¿ i,j = 1,...,n. A realization G of (M,d), is said optimal if the sum of its weights is minimal among all the realizations of (M,d). Consider a partition of M into two nonempty subsets K and L, and let e be an edge in a realization G of (M,d); we say that e is a bridge linking K with L if e belongs to all chains in G linking a vertex of K with a vertex of L. The Metric Bridge Partition Problem is to determine if the elements of a finite metric space (M,d) can be partitioned into two nonempty subsets K and L such that all optimal realizations of (M,d) contain a bridge linking K with L. We prove in this paper that this problem is polynomially solvable. We also describe an algorithm that constructs an optimal realization of (M,d) from optimal realizations of (K,d|K) and (L,d|L).
Improving vulnerability discovery models
Authors: Andy Ozment
Venue: Proceedings of the 2007 ACM workshop on Quality of protection (2007)

Security researchers are applying software reliability models to vulnerability data, in an attempt to model the vulnerability discovery process. I show that most current work on these vulnerability discovery models (VDMs) is theoretically unsound. I propose a standard set of definitions relevant to measuring characteristics of vulnerabilities and their discovery process. I then describe the theoretical requirements of VDMs and highlight the shortcomings of existing work, particularly the assumption that vulnerability discovery is an independent process.
SIMD processor-based turbo decoder supporting multiple third-generation wireless standards
Authors: Myoung-Cheol Shin, In-Cheol Park
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A programmable turbo decoder is designed to support multiple third-generation wireless communication standards. We propose a hybrid architecture of hardware and software, which has small size, low power, and high performance like hardware implementations, as well as the flexibility and programmability of software. It mainly consists of a configurable hardware soft-input-soft-output (SISO) decoder and a 16-b single-instruction multiple-data processor, which is equipped with five processing elements and special instructions customized for interleaving in order to provide interleaved data at the speed of the hardware SISO. A fast and flexible software implementation of the block interleaving algorithm is also proposed. The interleaver generation is split into two parts, preprocessing and on-the-fly generation, to reduce the timing overhead of changing the interleaver structure. We present detailed descriptions of the interleaving implementation applied to the W-CDMA and cdma2000 standard turbo codes. The decoder occupies 8.90 mm2 in a 0.25-µm CMOS with five metal layers and exhibits the maximum decoding rate of 5.48 Mb/s.
Query decomposition based on ontology mapping in data integration system
Authors: Xuezhou Xu, Hong Xiang, Jingyu Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

A method of query decomposition based on ontology mapping is proposed. By analyzing the domain models and schemas of data sources, a global ontology and local ontology are established, and the mapping between them are generated as well. During the query process, the query is expressed in the form of a tree, and by taking advantage of mapping rules, the query is decomposed into sub-queries.
Semiautomatic evaluation of retrieval systems using document similarities
Authors: Ben Carterette, James Allan
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Semiautomatic evaluation of retrieval systems using document similarities.
Using Comprehensive Analysis for Performance Debugging in Distributed Storage Systems
Authors: Andrew W. Leung, Eric Lalonde, Jacob Telleen, James Davis, Carlos Maltzahn
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Achieving performance, reliability, and scalability presents a unique set of challenges for large distributed storage. To identify problem areas, there must be a way for developers to have a comprehensive view of the entire storage system. That is, users must be able to understand both node specific behavior and complex relationships between nodes. We present a distributed file system profiling method that supports such analysis. Our approach is based on combining node-specific metrics into a single cohesive system image. This affords users two views of the storage system: a micro, per-node view, as well as, a macro, multinode view, allowing both node-specific and complex internodal problems to be debugged. We visualize the storage system by displaying nodes and intuitively animating their metrics and behavior allowing easy analysis of complex problems.
Multiple Fault Detection in Combinational Networks
Authors: J. W. Gault
Venue: IEEE Transactions on Computers (1972)

Combinational networks with no internal fan-out are considered from the point of view of testing for multiple faults. Several different approaches utilizing added inputs and observable outputs are considered and the tradeoffs are discussed.
Analysis of stochastic attractors under the stationary point-cycle bifurcation
Authors: I. A. Bashkirtseva, T. V. Perevalova
Venue: Automation and Remote Control (2007)

In this paper, consideration is given to the stationary point-cycle bifurcation in nonlinear dynamical systems affected by random perturbations. To describe probabilistic properties of corresponding stochastic attractors, we propose to use a new construction, i.e., function of stochastic sensitivity. This function allows describing the spread of random trajectories about the determinate attractor in quite a simple manner. The theoretical description of the function of stochastic sensitivity is given both for the stationary point and limit cycle. The potential of this approach is demonstrated by the examples of stochastic Hopf, Van der Pol, and brusselator models.
Experiments in 3D interaction for mobile phone AR
Authors: Anders Henrysson, Joe Marshall, Mark Billinghurst
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

In this paper we present an evaluation of several different techniques for virtual object positioning and rotation on a mobile phone. We compare gesture input captured by the phone's front camera, to tangible input, keypad interaction and phone tilting in increasingly complex positioning and rotation tasks in an AR context. Usability experiments found that tangible input techniques are best for translation tasks, while keypad input is best for rotation tasks. Implications for the design of mobile phone 3D interfaces are presented as well as directions for future research.
A Note on Atrubin's Real-Time Iterative Multiplier
Authors: L. N. Goyal
Venue: IEEE Transactions on Computers (1976)

This correspondence presents a new multiplication algorithm for Atrubin's one-dimensional real-time iterative multiplier such that all the cells including the first cell in the array are identical in all respects, for the no-delay case.
A proof-theoretic foundation of abortive continuations
Authors: Zena M. Ariola, Hugo Herbelin, Amr Sabry
Venue: Higher-Order and Symbolic Computation (2007)

We give an analysis of various classical axioms and characterize a notion of minimal classical logic that enforces Peirce's law without enforcing Ex Falso Quodlibet. We show that a "natural" implementation of this logic is Parigot's classical natural deduction. We then move on to the computational side and emphasize that Parigot's ¿ μ corresponds to minimal classical logic. A continuation constant must be added to ¿ μ to get full classical logic. The extended calculus is isomorphic to a syntactical restriction of Felleisen's theory of control that offers a more expressive reduction semantics. This isomorphic calculus is in correspondence with a refined version of Prawitz's natural deduction.
"Upgrading" membranes to shells-The CEG rotation free shell element and its application in structural analysis
Authors: Johannes Linhard, Roland Wüchner, Kai-Uwe Bletzinger
Venue: Finite Elements in Analysis and Design (2007)

A multi-purpose general rotation free element for the analysis of thin Kirchhoff-Love type shells is presented: Isoparametric displacement elements are used as basic geometrical description and to determine the membrane strains. Calculation of curvature to determine bending strains is based on discrete nodal directors, which are assigned to each node and determined by the geometry of the surrounding elements. The kinematic is formulated completely nonlinear. The technology is modular allowing for adding bending stiffness to an initial membrane model using the same geometrical discretization and, thus, supporting the entire design procedure from form finding to ultimate load or dynamic analysis of thin shells. Different examples ranging from static wrinkling analysis of a membrane to nonlinear dynamic analysis of a thin metal shelter show the multitude of possible applications.
Interactive Two-sided Refraction for Dynamic Object on GPU
Authors: Shuai Li, Yujian Gao, Aimin Hao, Lili Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper introduces an approach to interactively compute two-sided refraction on GPU and gains comparable realistic effects with ray tracing, while most current interactive techniques are restricted to single refraction. Our approach is also efficient for total internal reflection (TIR).When processing rigid movable object, we render the object's normal to a cube map first before entering the render loop. And for deformable object, the object's normal is rendered to a cube map at each frame. Then we compute the back interface refraction point by binary search in fragment shader. At last the refracted color is determined by indexing into a distant environment cube map using the second refracted ray as texture coordinate. Because our approach can fully exploit the capabilities of GPU, it achieves realistic refraction results and interactive frame rate even for fairly complex objects on common PCs.
Sequential Algorithm for the Determination of Maximum Compatibles
Authors: K. E. Stoffers
Venue: IEEE Transactions on Computers (1974)

This correspondence describes an algorithm which finds the maximum compatibles (maximal complete subgraphs of a symmetric graph) sequentially and in lexicographic order. The algorithm is intended for use in digital computers, where it requires only a small program and very little memory space.
Geometric Feature Equalizers Based on Hybrid Genetic Algorithm
Authors: Renxiang Zhu, Lenan Wu, Ruo Shu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A nonlinear geometric feature equalizer adopting minimum bit error rate principle is proposed in this paper for the filtering of noise and interference whose frequency band overlaps with the desired signal in communications, and a novel hybrid genetic algorithm, namely hybrid genetic algorithm-stochastic gradient, is also proposed for training the equalization model. Considering that the noise and the interference have different stochastic character, the desired information is recovered by neural network based on minimum bit error rate principle. Simulation results show that when extended binary phase shifting keying signal is contaminated by the mix of white Gaussian noise and relatively strong interference signals of amplitude modulation and frequency modulation, the performance of matched filter or linear equalizer degenerates rapidly, but geometric feature equalizer provides very low bit error rate. Furthermore, performance of hybrid genetic algorithm is superior to that of stochastic gradient.
Sparseness Achievement in Hidden Markov Models
Authors: Manuele Bicego, Marco Cristani, Vittorio Murino
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, a novel learning algorithm for Hidden Markov Models (HMMs) has been devised. The key issue is the achievement of a sparse model, i.e., a model in which all irrelevant parameters are set exactly to zero. Alternatively to standard Maximum Likelihood Estimation (Baum Welch training), in the proposed approach the parameters estimation problem is cast into a Bayesian framework, with the introduction of a negative Dirichlet prior, which strongly encourages sparseness of the model. A modified Expectation Maximization algorithm has been devised, able to determine a MAP (Maximum A Posteriori probability) estimate of HMM parameters in this Bayesian formulation. Theoretical considerations and experimental comparative evaluations on a 2D shape classification task contribute to validate the proposed technique.
Customizable Fault Tolerance forWide-Area Replication
Authors: Yair Amir, Brian Coan, Jonathan Kirsch, John Lane
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. We present a new, scalable replication architecture, built upon logical machines specifically designed to perform well in wide-area systems spanning multiple sites. The physical machines in each site implement a logical machine by running a local state machine replication protocol, and a wide-area replication protocol runs among the logical machines. Implementing logical machines via the state machine approach affords free substitution of the fault tolerance method used in each site and in the wide-area replication protocol, allowing one to balance performance and fault tolerance based on perceived risk. We present a new Byzantine fault-tolerant protocol that establishes a reliable virtual communication link between logical machines. Our communication protocol is efficient (a necessity in wide-area environments), avoiding the need for redundant message sending during normal-case operation and allowing a logical machine to consume approximately the same wide-area bandwidth as a single physical machine. This dramatically improves the wide-area performance of our system compared to existing logical machine based approaches. We implemented a prototype system and compare its performance and fault tolerance to existing solutions.
Value-Based Empirical Research Plan Evaluation
Authors: Stefan Biffl, Dietmar Winkler
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

The planning phase of empirical studies is a success-critical key activity in empirical research to achieve best benefits for contributing stakeholders, e.g., researchers and industry partners, and to reduce study risks, e.g., insufficient validity and unaddressed stakeholder win conditions. The design of empirical studies typically covers issues of empirical methodology, but seldom explicitly discusses tradeoffs between conflicting study goals. This work proposes a value-based empirical research planning framework for eliciting and reconciling stakeholder win conditions in order to compare the benefits and risks of empirical study variants and reports on findings from an initial feasibility study in a recent ISERN meeting of empirical research experts.