ppxscal/embedding_network huggingface dataset:
Formal analysis of security protocols: protocol composition logic
Authors: John C. Mitchell
Venue:  (2006)

We develop Protocol Composition Logic (PCL)---a Floyd-Hoare style logic for axiomatic proofs of protocol properties that is sound with respect to the standard symbolic model of protocol execution and attack. PCL can express temporal ordering of actions and knowledge, naturally capturing security properties such as authentication and secrecy. The induction rule for proving invariants and the composition theorems allow us to prove properties of compound protocols by combining independent proofs of their components. In order to bridge the gap between the symbolic and computational models of security, we develop Computational PCL (CLCP)---a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a new probabilistic, polynomial-time semantics for a subset of PCL. Using CPCL we formulate a specification of secure key exchange that is closed under general composition with steps that use the key and present sound formal proof rules based on this game-based condition.
A New Game Device Using Body-Braille for Visually Impaired People
Authors: Satoshi Ohtsuka, Nobuyuki Sasaki, Sadao Hasegawa, Tetsumi Harakawa
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

During the last five years, we have been developing the Body-Braille system which uses 6 vibration motors corresponding to the units of Braille. Disabled people can wear this system and sense Braille characters by vibration patterns on any part of the body. We have performed several experiments in which disabled people could get needed support for daily life through Body-Braille. Since we are developing a new type of equipment, we chose to make one of its main applications a game. Our new equipment is so small that it is very easy to carry it anywhere, such as on a train. Disabled people can play a game using the equipment while traveling around. The software of the game application employs a table based structure so that anyone can create a new game application with very little programming work. As a result, we have successfully developed the software for game creation.
Impedance matching elements [microwave structure teaching]
Authors: V. C. Parro
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The purpose of this article is to present a methodology for teaching design and optimization of microwave structures used as impedance matching elements. To achieve this objective visualization tools were developed in MATLAB.
Hardness of fully dense problems
Authors: Nir Ailon, Noga Alon
Venue: Information and Computation (2007)

In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpinski from 1995 and that of Frieze and Kannan from 1996. We address the problem of proving hardness results for (fully) dense problems, which has been neglected despite the fruitful effort put in upper bounds. In this work, we prove hardness results of dense instances of a broad family of CSP problems, as well as a broad family of ranking problems which we refer to as CSP-Rank. Our techniques involve a construction of a pseudorandom hypergraph coloring, which generalizes the well-known Paley graph, recently used by Alon to prove hardness of feedback arc-set in tournaments.
TCP-friendly congestion control mechanism for an UDP-based high speed radar application and characterization of fairness
Authors: S. L. Bangolae, A. P. Jayasumana, V. Chandrasekar
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The transfer of digitized radar data over the Next Generation Internet at data rates ranging from 64 Mbps to 384 Mbps, is an emerging real-time, high-bandwidth application using the UDP transport protocol. We propose the TCP-friendly Rate Adaptation Based on Loss (TRABOL) algorithm that relies on relevant QoS parameters feedback from the receiver to the source to control the transmission rate for congestion control. We also characterize the fairness of the system of UDP-based and TCP-based flows sharing a single bottleneck link bandwidth, using a throughput-based fairness index and show by experiments that the congestion-controlled radar application is TCP-friendly.
Hybrid multi-mode/multi-rate CS-ACELP speech coding for adaptive voice over IP
Authors: G. Ruggeri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a hybrid multi-mode/multi-rate, toll quality CS-ACELP coder developed for voice over IP applications. The coder uses coding modes compatible with the three 6.4, 8, and 11.8 kbit/s coding schemes standardised by ITU-T in G.729. In particular, the algorithm presents 4 coding categories, with an average bit rate ranging between about 3 and 8 kbit/s, that adapt the rate to changes in network conditions.
Structured covariance matrix estimation: a parametric approach
Authors: M. Jansson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The problem of estimating a positive semi-definite Toeplitz covariance matrix consisting of a low rank matrix plus a scaled identity from noisy data arises in many applications. We propose a computationally attractive (noniterative) covariance matrix estimator with certain optimality properties. For example, under suitable assumptions the proposed estimator achieves the Cramer-Rao lower bound on the covariance matrix parameters. The resulting covariance matrix estimate is also guaranteed to possess all of the structural properties of the true covariance matrix. Previous approaches to this problem have either resulted in computationally unattractive iterative solutions or have provided estimates that only satisfy some of the structural relations.
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Authors: Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stochastic gradient descent steps and projection steps. We prove that the number of iterations required to obtain a solution of accuracy &epsilon; is &Otilde;(1/&epsilon;). In contrast, previous analyses of stochastic gradient descent methods require &Omega; (1/&epsilon;2) iterations. As in previously devised SVM solvers, the number of iterations also scales linearly with 1/&lambda;, where &lambda; is the regularization parameter of SVM. For a linear kernel, the total run-time of our method is &Otilde; (d/(&lambda;&epsilon;)), where d is a bound on the number of non-zero features in each example. Since the run-time does not depend directly on the size of the training set, the resulting algorithm is especially suited for learning from large datasets. Our approach can seamlessly be adapted to employ non-linear kernels while working solely on the primal objective function. We demonstrate the efficiency and applicability of our approach by conducting experiments on large text classification problems, comparing our solver to existing state-of-the-art SVM solvers. For example, it takes less than 5 seconds for our solver to converge when solving a text classification problem from Reuters Corpus Volume 1 (RCV1) with 800,000 training examples.
The globe distribution network
Authors: A. Bakker, E. Amade, G. Ballintijn, I. Kuz, P. Verkaik, I. van der Wijk, M. van Steen, A. S. Tanenbaum
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The goal of the Globe project is to design and build a middleware platform that facilitates the development of large-scale distributed applications, such as those found on the Internet. To demonstrate the feasibility of our design and to test our ideas, we are currently building a new Internet application: The Globe Distribution Network. The Globe Distribution Network, or GDN, is an application for the efficient, worldwide distribution of free software and other free data. The GDN can be seen as an improvement to anonymous FTP and the World Wide Web due to its flexibility and extensive support for replication. This paper describes the design of the GDN. We start by explaining how the replication facilities of the Globe middleware are used to make the GDN efficient, and how these facilities are implemented. Next, we present the architecture of the GDN and discuss how the Domain Name System can be used as a first approach towards a worldwide service for naming software packages and other entities. This is followed by an analysis of the security requirements for the GDN and measures taken to satisfy these requirements. We hope to make Globe and GDN itself available for free under the BSD license by 2001.
Emotions in HCI: an affective e-learning system
Authors: Robin Kaiser, Karina Oertel
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

This paper presents results of a master thesis at the Fraunhofer Institute for Computer Graphics Rostock (IGD-R) at the department for Human-Centered Interaction. Using an emotion recognition sensor system, an e-learning system was enhanced with affective abilities. By taking certain actions, the user is supported to handle negative emotions, which should enable a better learning as well as a greater satisfaction. The affective communication and actions are encapsulated by an Affective Component, which was implemented as a prototype and evaluated at a first glance.
Low-g accelerometer fast prototyping for automotive applications
Authors: F. D'Ascoli, F. Iozzi, C. Marino, M. Melani, M. Tonarelli, L. Fanucci, A. Giambastiani, A. Rocchi, M. De Marinis
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents an application of the ISIF chip (Intelligent Sensor InterFace), for conditioning a dual-axis low-g accelerometer in MEMS technology. MEMS are nowadays the standard in automotive applications (and not only), as they feature a drastic reduction in cost, area and power, while they require a more complex electronic interface with respect to traditional discrete devices. ISIF is a Platform On Chip implementation, aiming to fast prototype a wide range of automotive sensors thanks to its high configuration resources, achieved both by full analog / digital IPs trimming options and by flexible routing structures. This accelerometer implementation exploits a relevant part of ISIF hardware resources, but also requires signal processing add-ins (software emulation of digital DSP blocks) for the closed loop conditioning architecture and for performance improvement (for example temperature drift compensation). In spite the short prototyping time, the resulting system achieves good performances with respect to commercial devices, featuring a 0.9 mg/&radic;Hz noise density with 1024 LSB/g sensitivity on the digital output over a +/- 2g FS, and an offset drift over 100&deg;C range within 30 mg, with 2% of FS sensitivity drift. Miniboards have been developed as product prototypes, consisting of a small PCB with ISIF and accelerometer dies bonded together, firmware embedded in EEPROM and communication transceivers.
Statistical Device Variability and its Impact on Yield and Performance
Authors: Asen Asenov
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

The years of "happy scaling' are over and the fundamental challenges that the semiconductor industry faces, at both technology and device level, will impinge deeply upon the design of future integrated circuits and systems. It is widely recognised that variability in device characteristics and the need to introduce novel device architectures represent major challenges to scaling and integration for present and next generation nano-CMOS transistors and circuits. This will in turn demand revolutionary changes in the way in which future integrated circuits and systems are designed. Strong links must be established between circuit design, system design and fundamental device technology to allow circuits and systems to accommodate the individual behaviour of every transistor on a chip. Design paradigms must change to accommodate this increasing variability. Adjusting for new device architectures and device variability will add significant complexity to the design process, requiring orchestration of a broad spectrum of design tools by geographically distributed teams of device experts, circuit and system designers.
Hi-BIN: an alternative approach to wideband speech coding
Authors: R. Taori
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this paper, an encoding technique called Hi-BIN (High Band Injection), which can be combined with any narrowband coder to achieve good quality wideband speech, is described. The principle behind this technique is to model frequencies above 4 kHz by noise with an appropriate spectral shape. This simple way of injecting synthetic noise in the higher frequencies gives surprisingly good quality when compared to very widely used computationally intensive waveform coding techniques such as CELP. We show that Hi-BIN offers a low bit-rate representation of the higher band and is backwards compatible with existing narrowband speech coding systems.
A Multi-Directions Algorithm for Edge Detection Based on Fuzzy Mathematical Morphology
Authors: Dong Hu, Xiangzhong Tian
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper brings forward a multi-directions algorithm for image edge detection based on fuzzy mathematical morphology. In this algorithm, we integrate the multi-directions characteristic of structure elements and fuzzy image characteristic into mathematical morphology, and then use mathematical morphology to detect image edge. It is indicated from experiment that this algorithm has succeeded in edge detection, and it has better effect than other traditional arithmetic operators of edge detection.
Comparison of JXTA and WSRF
Authors: Asif Akram, Rob Allan
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Virtual Collaboration among geographically dispersed resources, groups or organizational units requires support from their environment. The establishment, management and exploitation of dynamic, cross-organizational sharing relationship require new technology, which is independent of any proprietary technology and have backing of mainstream development and research institutes. This paper critically compares two Peer-to-Peer (P2P) protocols i.e. JXTA and Web Services Resource Framework (WSRF) with respect to their effectiveness for Virtual Collaboration. The comparison is based on our experiences of developing a prototype for Virtual Organization. This paper is result of out going research to build community for efficient resource discovery.
Conversation Clock: Visualizing audio patterns in co-located groups
Authors: Tony Bergstrom, Karrie Karahalios
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Aural conversation is ephemeral by nature. The interaction history of conversation fades as the present moment demands the attention of participants. In this paper, we explore the nature of group interaction by augmenting aural conversation with a persistent visualization of audio input. This visualization, Conversation Clock, displays individual contribution via audio input and provides a corresponding social mirror over the course of interaction. This paper describes the implementation of Conversation Clock, provides observations on an initial pilot study, and outlines the future progression of this research.
An exact global optimization method for deriving weights from pairwise comparison matrices
Authors: Emilio Carrizosa, Frédéric Messine
Venue: Journal of Global Optimization (2007)

Some multiple-criteria decision making methods rank actions by associating weights to the different criteria or actions, which are pairwise compared via a positive reciprocal matrix A. There is a vast literature on proposals of different mathematical-programming methods to infer weights from such matrix A. However, it is seldom observed that such optimization problems may be multimodal, thus the standard local-search resolution techniques suggested may be trapped in local optima, yielding a wrong ranking of alternatives. In this note we show that standard tools of global optimization based on interval analysis, lead to globally optimal weights in reasonable time.
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Venue: Symposium on Principles of Database Systems (2007)

This volume contains the proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2007), held in Beijing, China, on June 11-13, 2007, in conjunction with the 2007 ACM SIGMOD International Conference on Management of Data. The proceedings include papers based on the keynote address by Dan Suciu and two invited tutorials by Nicole Schweikardt and Jan Van den Bussche, and 28 contributed papers that were selected by the Program Committee from 187 submissions. Most of these papers are extended abstracts and, while they have been read by the program committee, they have not been formally refereed. It is anticipated that many of them will appear in more polished form in scientific journals. The program committee selected the paper "Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants" by Georg Gottlob, Zoltan Miklos and Thomas Schwentick as the recipient of the Best Paper Award, and the paper "XML Transformation by Tree-Walking Transducers with Invisible Pebbles" by Joost Engelfriet, Hendrik Jan Hoogeboom and Bart Samwel as the recipient of the Best Newcomer Award. Warmest congratulations to the authors. I thank all authors who submitted papers to the conference, and the members of the program committee for the enormous amount of work they have done. The program committee did not meet in person, but carried out extensive discussion during the electronic PC meeting.
An Empirical Study of Test Case Filtering Techniques Based on Exercising Information Flows
Authors: Wes Masri, Andy Podgurski
Venue: IEEE Transactions on Software Engineering (2007)

Some software defects trigger failures only when certain local or nonlocal program interactions occur. Such interactions are modeled by the closely related concepts of information flows, program dependences, and program slices. The latter concepts underlie a 78variety of proposed test data adequacy criteria, and they form a potentially important basis for filtering existing test cases. We report the results of an empirical study of several test case filtering techniques that are based on exercising information flows. Both coverage-based and profile-distribution-based filtering techniques are considered. They are compared to filtering techniques based on exercising simpler program elements, such as basic blocks, branches, function calls, and call pairs, with respect to their effectiveness for revealing defects.
Minitrack: Electronic Democracy
Authors: Suzanne Beaumaster, Ann Macintosh, Eric Welch
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

E-Democracy focuses on the use of information and communication technologies to support the democratic decision-making processes and to allow more effective and transparent engagement between government, business, NGOs and citizens. As such e-democracy examines the interrelation of technological innovation, institutions of government, decision making practices, elections, and the societal effect of technology on the democratic process.
Blind source separation using the second derivative of the second characteristic function
Authors: A. Yeredor
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A new algorithm for blind source separation is presented, which does not require any iterations with the raw data, and is therefore of a "closed-form" type. The algorithm is based on estimating the second-derivative matrices of the second joint characteristic function of the observations. These derivatives can be consistently estimated at various points, termed "processing points". A consistent estimate of the mixing matrix can in turn be obtained by applying approximate joint diagonalization to the estimated derivative matrices. Performance depends strongly on the choice of processing points, and can compare favorably to other BSS algorithms. We demonstrate the superior performance using simulations results.
Operating systems should support business change
Authors: Jeffrey C. Mogul
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

Existing enterprise information technology (IT) systems often inhibit business flexibility, sometimes with dire consequences. In this position paper, I argue that operating system research should be measured, among other things, against our ability to improve the speed at which businesses can change. I describe some of the ways in which businesses need to change rapidly, speculate about why existing IT infrastructures inhibit useful change, and suggest some relevant OS research problems.
Predicting Metastasis in Breast Cancer: Comparing a Decision Tree with Domain Experts
Authors: Amir R. Razavi, Hans Gill, Hans Åhlfeldt, Nosrat Shahsavar
Venue: Journal of Medical Systems (2007)

Breast malignancy is the second most common cause of cancer death among women in Western countries. Identifying high-risk patients is vital in order to provide them with specialized treatment. In some situations, such as when access to experienced oncologists is not possible, decision support methods can be helpful in predicting the recurrence of cancer. Three thousand six hundred ninety-nine breast cancer patients admitted in south-east Sweden from 1986 to 1995 were studied. A decision tree was trained with all patients except for 100 cases and tested with those 100 cases. Two domain experts were asked for their opinions about the probability of recurrence of a certain outcome for these 100 patients. ROC curves, area under the ROC curves, and calibration for predictions were computed and compared. After comparing the predictions from a model built by data mining with predictions made by two domain experts, no significant differences were noted. In situations where experienced oncologists are not available, predictive models created with data mining techniques can be used to support physicians in decision making with acceptable accuracy.
Cdt: a general and efficient container data type library
Authors: Kiem-Phong Vo
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

Cdt is a container type library that provides a uniform set of operations to manage dictionaries based on the common storage methods: list, stack, queue, set, and ordered set. It is implemented on top of linked lists, hash tables, and splay trees. Applications can dynamically change both object description and storage methods so that abstract operations can be exactly matched with run-time requirements to optimize performance. This paper briefly overviews Cdt and presents a performance study comparing it to other popular container data type packages.