ppxscal/embedding_network huggingface dataset:
Implementing group signature schemes with smart cards
Authors: Sébastien Canard, Marc Girault
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

Group signature schemes allow a group member to sign messages on behalf of the group. Such signatures must be anonymous and unlinkable but, whenever needed, a designated group manager can reveal the identity of the signer. During the last decade group signatures have been playing an important role in cryptographic research; many solutions have been proposed and some of them are quite efficient, with constant size of signatures and keys ([1], [6], [7] and [15]). However, some problems still remain among which the large number of computations during the signature protocol and the difficulty to achieve coalition-resistance and to deal with member revocation. In this paper we investigate the use of a tamper-resistant device (typically a smart card) to efficiently solve those problems.
Divisible Load Scheduling: An Approach Using Coalitional Games
Authors: Thomas E. Carroll, Daniel Grosu
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Scheduling divisible loads in distributed systems is the subject of Divisible Load Theory (DLT). In this paper we show that coalitional game theory is a natural fit for modeling DLT as the participants in the scheduling algorithm must cooperate in order to execute a job. We devise a coalitional scheduling game in which the job owners and the independent organizations that own processors form coalitions in order to maximize their profits. We examine the payoffs to the participants and show that the core of the proposed coalitional scheduling game is non-empty. Then we examine the "fair sharing" of the payoffs among the participants using the Shapley value. Finally we study by simulation the properties of the proposed coalitional scheduling game considering different distributed systems configurations.
Project Hosting: Expanding the Scientific Programmer's Toolbox
Authors: George K. Thiruvathukal
Venue: Computing in Science and Engineering (2007)

Emerging technologies such as free and open source project hosting will hopefully broaden interest in scientific programming in a business context.
Identification of musical chords using CONSTANT-Q spectra
Authors: S. H. Nawab
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We present an approach to the extraction of frequencies corresponding to chords in western polyphonic music. In the first phase of this approach constant-Q spectral analysts directly provides the features from which the fundamental frequencies for 43 of the 57 possible categories of chords can be extracted without ambiguity. Each remaining chord category has a potential ambiguity associated with it because of frequency resolution problems The second phase of our approach is designed to address such ambiguities. A software implementation of our approach was used successfully to validate its performance on a representative set of polyphonic musical signals.
Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems
Authors: Xinyuan Wang, Shiping Chen, Sushil Jajodia
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Many proposed low-latency anonymous communication systems have used various flow transformations such as traffic padding, adding cover traffic (or bogus packets), packet dropping, flow mixing, flow splitting, and flow merging to achieve anonymity. It has long been believed that these flow transformations would effectively disguise network flows, thus achieve good anonymity. In this paper, we investigate the fundamental limitations of flow transformations in achieving anonymity, and we show that flow transformations do not necessarily provide the level of anonymity people have expected or believed. By injecting unique watermark into the inter-packet timing domain of a packet flow, we are able to make any sufficiently long flow uniquely identifiable even if 1) it is disguised by substantial amount of cover traffic, 2) it is mixed or merged with a number of other flows, 3) it is split into a number subflows, 4) there is a substantial portion of packets dropped, and 5) it is perturbed in timing due to either natural network delay jitter or deliberate timing perturbation. In addition to demonstrating the theoretical limitations of low-latency anonymous communications systems, we develop the first practical attack on the leading commercial low-latency anonymous communication system. Our real-time experiments show that our flow watermarking attack only needs about 10 minutes activeWeb browsing traffic to "penetrate" the Total Net Shield service provided by www.anonymizer.com. Our analytical and empirical results demonstrate that achieving anonymity in low-latency communication systems is much harder than we have realized, and current flow transformation based low-latency anonymous communication systems need to be revisited.
Kerberos on wall street
Authors: Isaac Hollander, P. Rajaram, Constantin Tanno
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Morgan Stanley, an international financial services firm, has a significant investment in Kerberos. We have been using Kerberos 4 since 1993, and began a transition to Kerberos 5 in 1995. Kerberos has helped us progress towards solving the classic security problems of cleartext passwords and single sign-on. However, because of Morgan Stanley's specialized requirements, and a lack of support for Kerberos among operating system and application vendors, we have faced a number of practical integration problems not faced by the research community. This paper discusses those problems, the tools we have built to solve them, and the areas in which we feel vendors must provide better support for Kerberos.
Poisson versus periodic path probing (or, does PASTA matter?)
Authors: Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Constantinos Dovrolis, Mostafa Ammar
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

The well-known PASTA ("Poisson Arrivals See Time Averages") property states that, under very general conditions, the fraction of Poisson arrivals that observe an underlying process in a particular state is equal, asymptotically, to the fraction of time the process spends in that state. When applied to network inference, PASTA implies that a Poisson probing stream provides an unbiased estimate of the desired time average. Our objective is to examine the practical significance of the PASTA property in the context of realistic RTT, loss rate and packet pair dispersion measurements with a finite (but not small) number of samples. In particular, we first evaluate the differences between the point estimates (median RTT, loss rate, and median dispersion) that result from Poisson and Periodic probing. Our evaluation is based on a rich set of measurements between 23 PlanetLab hosts. The experimental results show that in almost all measurement sessions the differences between the Poisson and Periodic point estimates are insignificant. In the case of RTT and dispersion measurements, we also used a non-parametric goodness-of-fit test, based on the Kullback-Leibler distance, to evaluate the similarity of the distributions that result from Poisson and Periodic probing. The results show that in more than 90% of the measurements there is no statistically significant difference between the two distributions.
On deciding well-definedness for query languages on trees
Authors: Stijn Vansummeren
Venue: Journal of the ACM (JACM) (2007)

The well-definedness problem for a database query language consists of checking, given an expression and an input type, that the expression never yields a runtime error on any input adhering to the input type. In this article, we study the well-definedness problem for query languages on trees that are built from a finite set of partially defined base operations by adding variables, constants, conditionals, let bindings, and iteration. We identify properties of base operations that can make the problem undecidable and give restrictions that are sufficient to ensure decidability. As a direct result, we obtain a large fragment of XQuery for which well-definedness is decidable.
A 2.4 GHz driver amplifier for Bluetooth application based on 0.35 /spl mu/m CMOS
Authors: J. P. Kim, S. G. Lee, Y. H. Oh, S. S. Park
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A driver amplifier for Bluetooth application is implemented in 0.35 /spl mu/m CMOS technology. This paper presents a driver amplifier with high linearity and gain, and demonstrates that linearity has a quality factor dependency of inductive load. The linearity difference of the driver amplifier between the external and on-chip inductive load is analyzed analytically and it is confirmed by a measurement. The measurement shows that the driver amplifier with an off-chip inductive load has a higher linearity of 3.6 dB and a higher gain of 1.6 dB than the driver amplifier with the on-chip inductive load has.
Introducing 9-12 grade students to electrical engineering technology through hands-on laboratory experiences
Authors: K. Torres
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

At Penn State Erie, The Behrend College, an outreach project has been designed and implemented to provide 9th through 12th grade students with electrical engineering technology (EET) experiences. The high school students are brought onto the college campus and given a ten-minute presentation on the EET program and career opportunities. The students then participate individually in two thirty-minute hands-on laboratory experiences, one introducing the students to PSpice(R) and the other laboratory introducing the students to LabVIEW/sup TM/. Given two electronic circuits, the students are introduced to PSpice(R) for simulation. In the LabVIEW/sup TM/ experience the presentation begins with a tone generator program. The graphical user interface allows the students to control the amplitude and frequency of the waveform. In a second program the students simulate the functions of a touch tone telephone. The workshops have been conducted for high schools resulting in very positive feedback.
GPSQL Miner: SQL-grammar genetic programming in data mining
Authors: C. Y. Ishida, A. T. R. Pozo
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The present work describes GPSQL Miner, a genetic programming system for mining relational databases. This system uses grammar genetic programming for classification's task and one of its main features is the representation of the classifiers. The system uses SQL grammar, which facilitates the evaluation process, once the data are in relational databases. The tool was tested with some databases and the results were compared with other algorithms. These first experiments have shown promising results for the classification task.
Quickest Detection of a Minimum of Two Poisson Disorder Times
Authors: Erhan Bayraktar, H. Vincent Poor
Venue: SIAM Journal on Control and Optimization (2007)

A multisource quickest detection problem is considered. Assume there are two independent Poisson processes $X^{1}$ and $X^{2}$ with disorder times $\theta_{1}$ and $\theta_{2}$, respectively; i.e., the intensities of $X^1$ and $X^2$ change at random unobservable times $\theta_1$ and $\theta_2$, respectively. $\theta_1$ and $\theta_2$ are independent of each other and are exponentially distributed. Define $\theta \triangleq \theta_1 \wedge \theta_2=\min\{\theta_{1},\theta_{2}\}$. For any stopping time &tgr; that is measurable with respect to the filtration generated by the observations, define a penalty function of the form $R_{\tau}=\mathbb{P}(\tau<\theta)+c \mathbb{E}\left[(\tau-\theta)^{+}\right],$ where $c>0$ and $(\tau-\theta)^{+}$ is the positive part of $\tau-\theta$. It is of interest to find a stopping time &tgr; that minimizes the above performance index. This performance criterion can be useful, e.g., in the following scenario: There are two assembly lines that produce products $A$ and $B$, respectively. Assume that the malfunctioning (disorder) of the machines producing $A$ and $B$ are independent events. Later, the products $A$ and $B$ are to be put together to obtain another product $C$. A product manager who is worried about the quality of $C$ will want to detect the minimum of the disorder times (as accurately as possible) in the assembly lines producing $A$ and $B$. Another problem to which we can apply our framework is the Internet surveillance problem: A router receives data from, say, $n$ channels. The channels are independent, and the disorder times of channels are $\theta_1, \ldots, \theta_n$. The router is said to be under attack at $\theta=\theta_1 \wedge \cdots \wedge \theta_n$. The administrator of the router is interested in detecting $\theta$ as quickly as possible. Since both observations $X^{1}$ and $X^{2}$ reveal information about the disorder time &thgr;, even this simple problem is more involved than solving the disorder problems for $X^{1}$ and $X^{2}$ separately. This problem is formulated in terms of a three-dimensional sufficient statistic, and the corresponding optimal stopping problem is examined. The solution is characterized by iterating a suitable functional operator.
Using Multiple Expansion Ratios and Dependency Analysis to Improve Test Compression
Authors: Richard Putman, Nur A. Touba
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

A methodology is presented for improving the amount of compression achieved by continuous-flow decompressors by using multiple ratios of scan chains to tester channels (i.e., expansion ratios). The idea is to start with a higher expansion ratio than normal and then progressively reduce the expansion ratio to detect any faults that remain undetected. By detecting faults at the highest expansion ratio possible, the amount of compression can be significantly improved compared with conventional approaches. The expansion ratio is progressively reduced by concatenating scan chains together using MUXes to make fewer and longer scan chains. Selecting which scan chains to concatenate is done by using a dependency analysis procedure that takes into account structural dependencies among the scan chains as well as free-variable dependencies in the logic driving the scan chains to improve the probability of detecting faults. Results for applying the proposed approach to industrial designs using various types of decompressors indicate significant improvements in compression are possible.
Concilium: Collaborative Diagnosis of Broken Overlay Routes
Authors: James W. Mickens, Brian D. Noble
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

In a peer-to-peer overlay network, hosts cooperate to forward messages. When a message does not reach its final destination, there are two possible explanations. An intermediate overlay host may have dropped the message due to misconfiguration or malice. Alternatively, a bad link in the underlying IP network may have prevented an earnest, properly configured host from forwarding the data. In this paper, we describe how overlay peers can distinguish between the two situations and ascribe blame appropriately. We generate probabilistic notions of blame using distributed network tomography, fuzzy logic, and secure routing primitives. By comparing application-level drop rates with network characteristics inferred from tomography, we can estimate the likelihood that message loss is due to a misbehaving overlay host or a poor link in the underlying IP network. Since faulty nodes can submit inaccurate tomographic data to the collective, we also discuss mechanisms for detecting such misbehavior.
Geographic routing made practical
Authors: Young-Jin Kim, Ramesh Govindan, Brad Karp, Scott Shenker
Venue: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2 (2005)

Geographic routing has been widely hailed as the most promising approach to generally scalable wireless routing. However, the correctness of all currently proposed geographic routing algorithms relies on idealized assumptions about radios and their resulting connectivity graphs. We use testbed measurements to show that these idealized assumptions are grossly violated by real radios, and that these violations cause persistent failures in geographic routing, even on static topologies. Having identified this problem, we then fix it by proposing the Cross-Link Detection Protocol (CLDP), which enables provably correct geographic routing on arbitrary connectivity graphs. We confirm in simulation and further testbed measurements that CLDP is not only correct but practical: it incurs low overhead, exhibits low path stretch, always succeeds in real, static wireless networks, and converges quickly after topology changes.
Integrating Matlab Neural Networks Toolbox functionality in a fully reusable software component library
Authors: Arturo J. M&#x00e9;ndez, Emilio G. Rosell&#x00f3;, Mar&#x00ed;a J. Lado, Jacinto G. Dacosta, Manuel P. Cota
Venue: Neural Computing and Applications (2007)

In this work, we present a reusable software component library, called IMO.Net Artificial Neural Networks library, which encapsulates the functionality of the Matlab Neural Networks Toolbox (MNNT). The MNNT is a powerful tool to work with neural networks. However, MNNT has not been conceived as a reusable and integrable software piece, and its results are clearly inadequate to be used for development of applications. The component library presented in this paper is fully reusable, allowing the integration of the neural networks toolbox objects and functions in software applications, independently of the platform and tools used to build it. Furthermore, this library provides two different sets of classes to the programmers, one of them presenting an application program interface (API) similar to the Matlab toolbox, and the other a fully object-oriented designed API, which is easier to use and more adequate for object-oriented and rapid application development. This library combines the advantages of being fully reusable and internally employing the MNNT to perform the algorithmic task, consequently inheriting all its power, robustness and comprehensiveness, but without its reusability limitations.
Degeneracy of Angular Voronoi Diagram
Authors: Hidetoshi Muta, Kimikazu Kato
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Angular Voronoi diagram was introduced by Asano et al. as fundamental research for a mesh generation. In an angular Voronoi diagram, the edges are curves of degree three. From view of computational robustness we need to treat the curves carefully, because they might have a singularity. We enumerate all the possible types of curves that appear as an edge of an angular Voronoi diagram, which tells us what kind of degeneracy is possible and tells us necessity of considering a singularity for computational robustness.
Qualitative Modeling for Requirements Engineering
Authors: Tim Menzies, Julian Richardson
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Acquisition of "quantitative" models of sufficient accuracy to enable effective analysis of requirements tradeoffs is hampered by the slowness and difficulty of obtaining sufficient data. "Qualitative" models, based on expert opinion, can be built quickly and therefore used earlier. Such qualitative models are nondeterminate which makes them hard to use for making categorical policy decisions over the model. The nondeterminacy of qualitative models can be tamed using "stochastic sampling" and "treatment learning". These tools can quickly find and set the "master variables" that restrain qualitative simulations. Once tamed, qualitative modeling can be used in requirements engineering to assess more options, earlier in the life cycle.
Impact of NBTI on FPGAs
Authors: K. Ramakrishnan, S. Suresh, N. Vijaykrishnan, M. J. Irwin
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Device scaling such as reduced oxide thickness and high electric field has given rise to various reliability concerns. One such growing issue of concern is the degradation of PMOS devices due to Negative Bias Temperature Instability (NBTI). NBTI has detrimental effects on the threshold voltage of the PMOS transistor thereby leading to lower performance and noise degradation over time in digital systems. The degradation is measured as reduction in Static Noise Margin (SNM) of SRAMcells in memories and as timing impact in digital circuits. In this work, we provide a comprehensive analysis of the impact of NBTI on different components for current and future generation FPGAs. We provide solutions based on the reversible nature of this phenomenon and the static probabilities at the gate of the PMOS devices in any system.We recover an average of 53.2%of the lost SNM and improve the FIT rate by 2.48% for a X4VFX40 device by using our proposed method.
Multiplication by a Constant is Sublinear
Authors: Vassil Dimitrov, Laurent Imbert, Andrew Zakaluzny
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

This paper explores the use of the double-base number system (DBNS) for constant integer multiplication. The DBNS recoding scheme represents integers - in this case constants in a multiple-radix way in the hope of minimizing the number of additions to be performed during constant multiplication. On the theoretical side, we propose a formal proof which shows that our recoding technique diminishes the number of additions in a sublinear way. Therefore, we prove Lef`evre's conjecture that the multiplication by an integer constant is achievable in sublinear time. In a second part, we investigate various strategies and we provide numerical data showcasing the potential interest of our approach.
A Motion Blending Approach Based on Unsupervised Clustering
Authors: Zhongyu Chen, Xiangbin Zhu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Motion blending, which allows the generation of new motions by interpolation or transition between motion capture sequences, is widely accepted as a standard technique in computer animation. But the transition time and duration is manually chosen in traditional blending approaches and all frames of motion clips must be computed to select the right transition point. This paper presents a new motion blending method that can reduce computing work by extracting the key frames for selecting the transition point and can automatically select the transition time. To evaluate the effectiveness of the improved method, we have done extensive experiments. The experiment results show that the novel motion blending method is effective in smoothly blending between two motion sequences