ppxscal/embedding_network huggingface dataset:
Comparison of two bounds of the quantum correlation set
Authors: David Avis, Tsuyoshi Ito
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and quantum correlation experiments, the latter of which is called the quantum correlation set. Whereas little is known about the quantum correlation set, Tsirelson's theorem (1980) can be seen as the exact characterization of possible pairwise quantum correlations, where mean values of individual observables are discarded. In this paper, we compare two previously shown bounds of the quantum correlation set in the case where two parties have m and n choices of dichotomic observables, respectively. One bound comes from the direct application of Tsirelson's theorem and the no-signalling condition. The other bound, recently introduced by Avis, Imai and Ito, refines the application of Tsirelsonfs theorem in the previous bound. We show that for any m, n \ge 2, this new bound is strictly tighter than the earlier bound. In other words, there are correlations that satisfy Tsirelson's theorem, but are not realizable in a quantum setting.
Towards Fair Event Dissemination
Authors: Sebastien Baehni, Rachid Guerraoui, Boris Koldehofe, Maxime Monod
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Event dissemination in large scale dynamic systems is typically claimed to be best achieved using decentralized peer-to-peer architectures. The rationale is to have every participant in the system act both as a client (information consumer) and as a server (information dissemination enabler), thus, precluding specific brokers which would prevent scalability and fault-tolerance. We argue that, for such decentralized architectures to be really meaningful, participants should serve the system as much as they benefit from it. That is, the system should be fair in the sense that the extend to which a participant acts as a server should depend on the extend to which it has the opportunity to act as a client. This is particularly crucial in selective information dissemination schemes where clients are not all interested in the same information. In this position paper, we discuss what a notion of fairness could look like, explain why current architectures are not fair, and raise several challenges towards achieving fairness.
Auto-Extraction, Representation and Integration of a Diabetes Ontology Using Bayesian Networks
Authors: Ken McGarry, Sheila Garfield, Stefan Wermter
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper describes how high level biological knowledge obtained from ontologies such as the Gene Ontology (GO) can be integrated with low level information extracted from a Bayesian network trained on protein interaction data. We can automatically generate a biological ontology by text mining the type II diabetes research literature. The ontology is populated with the entities and relationships from protein-to-protein interactions. New, previously unrelated information is extracted from the growing body of research literature and incorporated with knowledge already known on this subject from the gene ontology and databases such as BIND and BioGRID. We integrate the ontology within the probabilistic framework of Bayesian networks which enables reasoning and prediction of protein function.
Service Engineering: Linking Business and IT
Authors: Tiziana Margaria, Bernhard Steffen
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Service-oriented design has long driven the development of the telecommunications infrastructure and applications, especially intelligent network services. Applying the same principles of domain specificity, virtualization, loose coupling, and seamless vertical integration to business processes has the potential to lead to a new generation of personalized, secure, and highly available Web services
A Study on Detecting Network Anomalies Using Sampled Flow Statistics
Authors: Ryoichi Kawahara, Tatsuya Mori, Noriaki Kamiyama, Shigeaki Harada, Shoichiro Asano
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

We investigate how to detect network anomalies using flow statistics obtained through packet sampling. First, we show that network anomalies generating a huge number of small flows, such as network scans or SYN flooding, become dificult to detect when we execute packet sampling. This is because such flows are more unlikely to be sampled than normal flows. As a solution to this problem, we then show that spatially partitioning the monitored traffic into groups and analyzing the traffic of individual groups can increase the detectability of such anomalies. We also show the effectiveness of the partitioning method using network measurement data.
Spatial averaging of time-frequency distributions
Authors: Yimin Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper presents a novel approach based on time-frequency distributions (TFDs) for separating signals received by a multiple antenna array. This approach provides a significant improvement in performance over the previously introduced spatial time-frequency distributions, specifically for signals with close time-frequency signatures. In this approach, spatial averaging of the time-frequency distributions of the sensor data is performed to eliminate the interactions of the sources signals in the time-frequency domain, and as such restore the realness property and the diagonal structure of the source TFDs, which are necessary for source separation. It is shown that the proposed approach yields improved performance over both cases of no spatial averaging and averaging using time-frequency smoothing kernels.
Determining Readmission Time Window Using Mixture of Generalised Erlang Distribution
Authors: Eren Demir, Thierry Chaussalet, Haifeng Xie
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The absence of a unified definition of readmissions has motivated the development of a modelling approach, to systematically tackle the issue surrounding the appropriate choice of a time window which defines readmission. The population of discharged patients can be broadly divided in two groups - a group at high risk of readmission and a group at low risk. This approach extends previous work by the authors, without restricting the number of stages, that patients may experience in the community. Using the national data (UK), we demonstrate its usefulness in the case of chronic obstructive pulmonary disease (COPD) which is known to be one of the leading causes of readmission. We further investigate variability in the definition of readmission among 10 strategic health authorities (SHAs) in England and observe that there are differences in the estimated time window across SHAs. The novelty of this modelling approach is the ability of capturing time to readmission that exhibit a non-zero mode and to estimate an appropriate time window based on evidence objectively derived from operational data.
Finding security vulnerabilities in java applications with static analysis
Authors: V. Benjamin Livshits, Monica S. Lam
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

This paper proposes a static analysis technique for detecting many recently discovered application vulnerabilities such as SQL injections, cross-site scripting, and HTTP splitting attacks. These vulnerabilities stem from unchecked input, which is widely recognized as the most common source of security vulnerabilities in Web applications. We propose a static analysis approach based on a scalable and precise points-to analysis. In our system, user-provided specifications of vulnerabilities are automatically translated into static analyzers. Our approach finds all vulnerabilities matching a specification in the statically analyzed code. Results of our static analysis are presented to the user for assessment in an auditing interface integrated within Eclipse, a popular Java development environment. Our static analysis found 29 security vulnerabilities in nine large, popular open-source applications, with two of the vulnerabilities residing in widely-used Java libraries. In fact, all but one application in our benchmark suite had at least one vulnerability. Context sensitivity, combined with improved object naming, proved instrumental in keeping the number of false positives low. Our approach yielded very few false positives in our experiments: in fact, only one of our benchmarks suffered from false alarms.
Energy efficient system partitioning for distributed wireless sensor networks
Authors: Alice Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A scheme for efficient system partitioning of computation in wireless sensor networks is presented. Local computation of the sensor data in wireless networks can be highly energy-efficient, because redundant communication costs can be reduced. It is important to develop energy-efficient signal processing algorithms to be run at the sensor nodes. This paper presents a technique to optimize system energy by parallelizing computation through the network and by exploiting underlying hooks for power management. By parallelizing computation, the voltage supply level and clock frequency of the nodes can be lowered, which reduces energy dissipation. A 60% energy reduction for a sensor application of source localization is demonstrated. The results are generalized for finding optimal voltage and frequency operating points that lead to minimum system energy dissipation.
Super-resolution based on interpolation and global sub pixel translation
Authors: Kamel Mecheri, Djemel Ziou, Francois Deschenes
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper we present a new class of reconstruction algorithms that are basically different from the traditional approaches. We deviate from the traditional technique which treats the pixels of the image as point samples. In this work, the pixels are treated as rectangular surface samples. It is in conformity with image formation process, in particular for CCD/CMOS sensors, which are a matrix of rectangular surfaces sensitive to the light. We show that results of better quality in terms of the measurements employed are obtained by formulating the reconstruction as a two-stage process: the restoration of image followed by the application of the point spread function (PSF) of the imaging sensor. By coupling the PSF with the reconstruction process, we satisfy a measure of accuracy that is based on the physical limitations of the sensor. Effective techniques for the restoration of image are derived to invert the effects of the PSF and estimate the original image. For the algorithm of restoration, we introduce a new method of interpolation implying a sequence of images, not necessarily a temporal sequence, shifted compared to an image of reference. Keywords: Super-Resolution, Reconstruction, Intra-Pixel Restoration, Interpolation.
Decoding metrics and their applications in VLSI turbo decoders
Authors: Z. Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

In this paper, a set of variables which can be easily computed in the course of iterative decoding of turbo decoders called decoding metrics (DMs) are introduced. According to the measured DMs after each iteration, a lot of information other than signal-to-noise ratio (SNR) in the received bits, such as how good/bad the current block is and how close the current iteration of decoding is to convergence, can be obtained. Detailed discussions are provided regarding why these variables are chosen. Based on the measured DMs after the first iteration, an approximate SNR-related variable L/sub c/ can be obtained for MAP-based turbo decoders. Simulation results show that there is almost no performance degradation if approximated L/sub c/ values are used instead of exact values. It is also shown that adaptive decoding using DMs is more efficient than existing methods both in terms of hardware and latency. Other applications of DMs are pointed out at last.
Optimum Supply Voltages for Minimization of Leakage Currents in SRAM in Stand-by Mode
Authors: Lava P. Kumar, Baquer Mazhari
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

An effective technique for reducing leakage currents in an SRAM cell in standby mode is by reducing effective supply voltage across the cell. It is shown that raising of negative supply voltage level (VSS) is more effective in reducing subthreshold leakage currents, while reduction in positive supply voltage level (VDD) has relatively larger impact on gate leakage currents. As a result, for a fixed effective supply voltage across the cell in standby mode, there is an optimum combination of supply rails that minimizes leakage currents depending on the relative importance of subthreshold and gate leakage currents. Simulation results based on BPTM (Berkeley Predictive Technology Model) are presented that show that for a net voltage across the cell of 0.5V, supply voltages (VDD, VSS) of (0.35, 0.85), (0.25, 0.75) and (0.1, 0.6) yield minimum leakage currents in 90nm, 65nm and 45nm technology nodes respectively.
On compact and efficient routing in certain graph classes
Authors: Feodor F. Dragan, Irina Lomonosov
Venue: Discrete Applied Mathematics (2007)

In this paper we refine the notion of tree-decomposition by introducing acyclic (R,D)-clustering, where clusters are subsets of vertices of a graph and R and D are the maximum radius and the maximum diameter of these subsets. We design a routing scheme for graphs admitting induced acyclic (R,D)-clustering where the induced radius and the induced diameter of each cluster are at most 2. We show that, by constructing a family of special spanning trees, one can achieve a routing scheme of deviation @D=
Detection for binary transmission based on the empirical characteristic function
Authors: J. Ilow
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We present a new, suboptimum, method for the detection of signals in noise for which standard methods of inference are difficult to implement. The method is based on the empirical characteristic function (ECF) and exploits the correlation structure of the ECF evaluated at the finite number of points. We assume discrete time detection so that N i.i.d. data samples are available per symbol. We examine the performance of the proposed method for the mixture of /spl alpha/-stable and Gaussian noise. The detectors based on the ecf show substantial improvements in performance compared to linear detectors and exhibit better performance than the locally optimum (LO) detectors.
Bluetooth Based Sensor Networks Issues and Techniques
Authors: Chandrashekhar Dethe, Digambar Wakde, Chandrakant Jaybhaye
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Wireless sensor networks consist of a number of small processors, nodes, which communicate by using Ad Hoc techniques. Bluetooth can be a good candidate for communications in short range sensor networks. There has been little interest in Bluetooth sensor networks though the idea is not new. In this paper, we describe an experimental Bluetooth sensor network and related implementation issues
Mutual Coupling Effects on MIMO-Adaptive Beamforming Systems
Authors: Mostafa Hefnawi, Jing Gai, Rachid Abou Elasoued
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper we investigate the impact of mutual coupling (MC) on the performance of a MIMO-beamforming system with closely spaced antenna elements. Simulation results confirm the decrease in system performance when antenna mutual coupling is taken into account.
Universal successive refinement of CELP speech coders
Authors: Hui Dong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Many speech coding standards are based upon code-excited linear prediction (CELP), and it is desirable to develop layered coding methods that are compatible with this installed base of coders. We propose a layered speech coding structure that is universally compatible with all CELP-based coders. This structure encodes the reconstruction error signal from layer 1 using a low-delay, adaptive tree coder based upon the mean squared error (MSE) criterion. We note that rate distortion optimal successive refinement is achievable using two different distortion criteria and we derive expressions for the rate distortion function under autoregressive Gaussian assumptions on the source and the two different distortion measures. We demonstrate the universality of the approach by developing two-layer coders for a 3.65 kbps CELP coder, G.723.1, and G.729. We show that our layering method is favorably competitive with the MPEG-4 layering method at 8.7 kbps for both clean and noisy speech. Using tree coding and the MSE criterion in layer 2 improves speech naturalness when coding noisy speech.
Corporate structure in the classroom: a model for teaching engineering design
Authors: K. Collier, J. Hatfield, S. Howell, D. Larson, G. Thomas
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Experiences at the authors' university with a senior-level engineering design course have demonstrated the educational value of challenging design tasks performed on a real project for a real customer. The students enter the course with strong analytical skills and enthusiasm but without adequate experience in doing design, dealing with uncertainty, working as part of a team, and implementing a complex project. To correct this, we implemented some changes in our engineering curriculum and piloted an interdisciplinary sophomore-level design course in the Fall 1994 semester. The course was structured as a simulated engineering company dealing with the design of robotic devices for use in hazardous materials handling. An interdisciplinary faculty team faculty played the roles of company president, division managers and a quality manager. The students played the roles of design engineers. A member of the college's industrial advisory board played the role of our customer, and our campus safety officer played the role of an EPA representative. The course dealt with technical, legal, ethical, financial and personnel issues, and addressed problems of incomplete information, limited resources and materials availability, team dynamics, and employee and public safety. Communication and documentation were emphasized. The challenge we now face is to structure these courses with a reasonable student-to-faculty ratio while still maintaining the team teaching approach and the simulated corporate structure. This paper describes the first offering of the two linked interdisciplinary design courses.
Visualizing NetFlows for security at line speed: the SIFT tool suite
Authors: William Yurcik
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The first step in improving Internet security is measurement - security events must be made visible. The irony in making this happen is that there is no lack of security measurement data, in fact, quite the opposite. However, making security manifest faces a major challenge: the large volume and multi-dimensional nature of security data typically obscures valuable security events. NCSA has developed a suite of tools that solves this problem and is making this software available to the Internet community. We present two visualization tools, (1) NVisionIP and (2) VisFlowConnect-IP. Both of these tools have been developed based on system administrator requirements, their design peer-reviewed in security research forums, and usability testing is in process. These tools both present large volume complex data transparently to system administrators in simple intuitive visual interfaces that support human cognitive processes. NVisionIP visually represents the state of all IP addresses on large networks on a single screen window (we use a Class B address space as the default) with capabilities to filter and drill-down to subnets and individual machines for details-on-demand. VisFlowConnect-IP visually represents flows between internal network IP hosts and the Internet showing who is connecting with whom with capabilities to filter and drill-down to subnets and individual machines for details-on-demand. NVisionIP and VisFlowConnect-IP can be used individually or in unison for correlating events. This work is distinguished from others in that these are the first Internet security visualization tools to be freely available on the Internet and deployed in large production environments.
The region trap library: handling traps on application-defined regions of memory
Authors: Tim Brecht, Harjinder Sandhu
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1999)

User-level virtual memory (VM) primitives are used in many different application domains including distributed shared memory, persistent objects, garbage collection, and checkpointing. Unfortunately, VM primitives only allow traps to be handled at the granularity of fixed-sized pages defined by the operating system and architecture. In many cases, this results in a size mismatch between pages and application-defined objects that can lead to a significant loss in performance. In this paper we describe the design and implementation of a library that provides, at the granularity of application-defined regions, the same set of services that are commonly available at a page-granularity using VM primitives. Applications that employ the interface of this library, called the Region Trap Library (RTL), can create and use multiple objects with different levels of protection (i.e., invalid, read-only, or read-write) that reside on the same virtual memory page and trap only on read/write references to objects in an invalid state or write references to objects in a read-only state. All other references to these objects proceed at hardware speeds. Benchmarks of an implementation on five different OS/architecture combinations are presented along with a case study using region trapping within a distributed shared memory (DSM) system, to implement a region-based version of the lazy release consistency (LRC) coherence protocol. Together, the benchmark results and the DSM case study suggest that region trapping mechanisms provide a feasible region-granularity alternative for application domains that commonly rely on page-based virtual memory primitives.