ppxscal/embedding_network huggingface dataset:
Security analysis of a cryptographically-enabled RFID device
Authors: Stephen C. Bono, Matthew Green, Adam Stubblefield, Ari Juels, Aviel D. Rubin, Michael Szydlo
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

We describe our success in defeating the security of an RFID device known as a Digital Signature Transponder (DST). Manufactured by Texas Instruments, DST (and variant) devices help secure millions of SpeedPassTM payment transponders and automobile ignition keys. Our analysis of the DST involved three phases: 1. Reverse engineering: Starting from a rough published schematic, we determined the complete functional details of the cipher underpinning the challenge-response protocol in the DST. We accomplished this with only "oracle" or "black-box" access to an ordinary DST, that is, by experimental observation of responses output by the device. 2. Key cracking: The key length for the DST is only 40 bits. With an array of of sixteen FPGAs operating in parallel, we can recover a DST key in under an hour using two responses to arbitrary challenges. 3. Simulation: Given the key (and serial number) of a DST, we are able to simulate its RF output so as to spoof a reader. As validation of our results, we purchased gasoline at a service station and started an automobile using simulated DST devices. We accomplished all of these steps using inexpensive off-the-shelf equipment, and with minimal RF expertise. This suggests that an attacker with modest resources can emulate a target DST after brief short-range scanning or long-range eavesdropping across several authentication sessions. We conclude that the cryptographic protection afforded by the DST device is relatively weak.
Utterance verification using prosodic information for Mandarin telephone speech keyword spotting
Authors: Yeou-Jiunn Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this paper, the prosodic information, a very special and important feature in Mandarin speech, is used for Mandarin telephone speech utterance verification. A two-stage strategy, with recognition followed by verification, is adopted. For keyword recognition, 59 context-independent subsyllables, i.e., 22 INITIALs and 37 FINALs in Mandarin speech, and one background/silence model, are used as the basic recognition units. For utterance verification, 12 anti-subsyllable HMMs, 175 context-dependent prosodic HMMs, and five anti-prosodic HMMs, are constructed. A keyword verification function combining phonetic-phase and prosodic-phase verification is investigated. Using a test set of 2400 conversational speech utterances from 20 speakers (12 males and 8 females), at 8.5% false rejection, the proposed verification method resulted in 17.8% false alarm rate. Furthermore, this method was able to correctly reject 90.4% of nonkeywords. Comparison with a baseline system without prosodic-phase verification shows that the prosodic information can benefit the verification performance.
Sparse probabilistic classifiers
Authors: Romain Hérault, Yves Grandvalet
Venue: Proceedings of the 24th international conference on Machine learning (2007)

The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining this practice. Thus, when classification uncertainty has to be assessed, it is safer to resort to classifiers estimating conditional probabilities of class labels. Here, we focus on the ambiguity in the vicinity of the boundary decision. We propose an adaptation of maximum likelihood estimation, instantiated on logistic regression. The model outputs proper conditional probabilities into a user-defined interval and is less precise elsewhere. The model is also sparse, in the sense that few examples contribute to the solution. The computational efficiency is thus improved compared to logistic regression. Furthermore, preliminary experiments show improvements over standard logistic regression and performances similar to support vector machines.
Infrastructure for standardization of Asian language resources
Authors: Tokunaga Takenobu, Nicoletta Calzolari, Chu-Ren Huang, Laurent Prevot, Virach Sornlertlamvanich, Monica Monachini, Xia YingJu, Shirai Kiyoaki, Thatsanee Charoenporn, Claudia Soria, Yu Hao
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

As an area of great linguistic and cultural diversity, Asian language resources have received much less attention than their western counterparts. Creating a common standard for Asian language resources that is compatible with an international standard has at least three strong advantages: to increase the competitive edge of Asian countries, to bring Asian countries to closer to their western counterparts, and to bring more cohesion among Asian countries. To achieve this goal, we have launched a two year project to create a common standard for Asian language resources. The project is comprised of four research items, (1) building a description framework of lexical entries, (2) building sample lexicons, (3) building an upper-layer ontology and (4) evaluating the proposed framework through an application. This paper outlines the project in terms of its aim and approach.
An Internet-based computer laboratory for DSP courses
Authors: A. Clausen
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

In this paper, an Internet-based laboratory for an introductory digital signal processing (DSP) class is presented. The laboratory consists of five exercises covering topics like discrete- and continuous-time convolution, Z-transform, pole-zero plots, filter design and fast Fourier transform (FFT). The software includes webpages which describe the laboratory exercises and supporting Java programs. The Java programs enable visualization of complicated mathematical concepts and allow students to design active simulations of DSP systems. This virtual laboratory has the advantage that students can perform the exercises from remote locations. The paper presents the different programs which were developed for this laboratory and describes several exercises that involve interactive DSP simulations in a user-friendly object oriented environment. The software has been used at Arizona State University (USA) for a senior/graduate level digital signal processing (DSP) course. The paper presents experiences gained by using this innovative software in a class setting and provides information compiled from student evaluations.
A simulation study of the /spl omega/-k SAR algorithm for the highly squinted case with application to runway imaging
Authors: N. Cadalli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The wavenumber-domain SAR algorithm is studied for the case of a high squint angle with particular application to runway imaging from an approaching aircraft. The feasibility of using the algorithm for this application is shown by point target simulations which indicate that aberrations due to the high squint angle can be eliminated with finer interpolation in the processing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Secondary storage management for web proxies
Authors: Evangelos P. Markatos, Manolis G. H. Katevenis, Dionisis Pnevmatikatos, Michail Flouris
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

World-Wide Web proxies are being increasingly used to provide Internet access to users behind a firewall and to reduce wide-area network traffic. Recent results suggest that disk I/O is increasingly becoming the limiting factor for the performance of web proxies. In this paper we study the overheads associated with disk I/O for web proxies, and propose secondary storage management alternatives that improve performance. We use a combination of experimental evaluation and simulation based on traces from busy web proxies. We show that web proxies experience significant overheads due to disk I/O. We propose several file management methods that reduce the disk I/O overhead overhead by a factor of 25 overall, resulting in a single-disk service rate that exceeds 500 (URL-get) operations per second.
A Grid Software for Virtual Eye Surgery Based on Globus 4 and gLite
Authors: Karoly Bosa, Wolfgang Schreiner, Michael Buchberger, Thomas Kaltofen
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

"Grid-Enabled SEE++" is based on the SEE++ software system for the biomechanical simulation of the human eye. "Grid-Enabled SEE++" extends SEE++ in several steps in order to develop an efficient grid-based tool for "Evidence Based Medicine", which supports surgeons in choosing optimal surgery techniques for the treatment of certain eye motility disorders. Recently, we refined the design of "Grid-Enabled SEE++" and we worked on an extended version of the software, which is able to utilize the "Web Service Resource Framework" architecture of the Globus Toolkit 4. Sincewe met with some limitations of Globus 4, we also designed a version of "Grid-Enabled SEE++" compatible with the gLite grid middleware. In this paper, we report on our experience of porting a grid application to Globus 4 and gLite, describe the problems we encountered and discuss possible solution strategies. This may assist the porting of other applications to the grid using these middleware products.
Spatial properties of light fields in natural scenes
Authors: Alexander A. Mury, Sylvia C. Pont, Jan J. Koenderink
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Light fields [Gershun 1939] of natural scenes are highly complex and vary within a scene from point to point. However, in many applications complex lighting can be successfully replaced by its low order approximation [Ramamoorthi and Hanrahan 2001]. The purpose of this research was to investigate the spatial behavior of light fields in natural scenes. We describe the light fields in terms of spherical harmonics and analyze their qualitative properties. We show that low order approximations of natural light fields vary smoothly and systematically, in accordance with very simple models. This finding has important implications for graphics, visualization, architectural design and scene perception research.
A Schur method for multiuser multichannel blind identification
Authors: L. Deneire
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We address the problem of blind multiuser multichannel identification in a spatial division multiple access (SDMA) context. Using a stochastic model for the input symbols and only second order statistics, we develop a simple algorithm, based on the generalized Schur algorithm to apply LDU decomposition of the covariance matrix of the received data. We show that this method leads to identification of the channel, up to a unitary mixture matrix. Furthermore, the identification algorithm is shown to be robust to channel length overestimation and approaches the performance of the weighted linear prediction (WLP) method, at low computational cost.
The Need for a Customer-centric Approach for Services Development and Operation in the Brazilian Telecommunications Market
Authors: Luiz Faro, Edison Spina
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Historically, Brazilian Telecommunications Service Providers (SP's) have created services entirely based on the available technology platforms, an excessively technical approach (usually dubbed "build it and they'll come") that has distorted their perception of what Quality of Service means. Furthermore, the day-to-day operation of these services has been focused only on maintaining a set of network-related metrics at adequate levels. The end user, on the other hand, understands Quality of Service as a matter of Customer Care and Support. This difference in understanding leads to the need of a change in both the methodology used by SP's to create new services and the techniques used to manage these services once deployed. The new service development methodology, the focus of this paper, must be able to assess users' needs and translate them into meaningful parameters to be captured by newly developed services. Quality Function Deployment fits this bill perfectly. The new operation techniques must bring the Service Provider closer to the more abstract requirements of the customer (including emotional and affective requirements and perceptions). Are the current Service Level Management techniques adequate to this reality?
Automatic high-dimensional association rule generation for large relational data sets
Authors: Wei Zhang, G. Wang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

Data mining extracts knowledge from a large amount of data. It has been used in a variety of applications ranging from business and marketing to bioinformatics and genomics. Many data mining algorithms currently available, however, generate relatively simple rules that include a small number of attributes. Moreover, these algorithms need to build decision trees, which take a significant amount of time due to a large number of attributes and lack of field knowledge. Thus, in this paper, we propose a method that automatically generates high-dimensional association rules in large data sets with high accuracy and broad coverage.
Multidimensional reverse kNN search
Authors: Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui Xiao
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2007)

Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such queries have at least one of the following deficiencies: they (i) do not support arbitrary values of k, (ii) cannot deal efficiently with database updates, (iii) are applicable only to 2D data but not to higher dimensionality, and (iv) retrieve only approximate results. Motivated by these shortcomings, we develop algorithms for exact RkNN processing with arbitrary values of k on dynamic, multidimensional datasets. Our methods utilize a conventional data-partitioning index on the dataset and do not require any pre-computation. As a second step, we extend the proposed techniques to continuous RkNN search, which returns the RkNN results for every point on a line segment. We evaluate the effectiveness of our algorithms with extensive experiments using both real and synthetic datasets.
Virtual Reality in the Brain--Sensory System Works as Keyboard Instrument
Authors: Shigeo Kobayashi
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

We feel that colors and sounds exist in outer world. However, they are our subjective sensations as virtual reality. Materials really present in outer physical world are objects that release physical quantities such as electromagnetic (EM) and air waves. Hence the usual theory that sensory system executes equivalent transformation of physical quantities cannot explain our sensations. Instead, I propose a new theory that sensory system works as keyboard instrument, where physical quantities play keyboard to create colors and sounds as virtual reality. EM and air waves of various frequencies released from objects play the keyboard (receptors) in eyes and ears, which generate action potentials on discrete paths, traveling to target neurons in the brain. When target neurons are excited, information innately stored in these cells is expressed and we feel that objects release various colors and sounds, which accurately reflect physical world.
Transparent control independence (TCI)
Authors: Ahmed S. Al-Zawawi, Vimal K. Reddy, Eric Rotenberg, Haitham H. Akkary
Venue: ACM SIGARCH Computer Architecture News (2007)

Superscalar architectures have been proposed that exploit control independence, reducing the performance penalty of branch mispredictions by preserving the work of future misprediction-independent instructions. The essential goal of exploiting control independence is to completely decouple future misprediction-independent instructions from deferred misprediction-dependent instructions. Current implementations fall short of this goal because they explicitly maintain program order among misprediction-independent and misprediction-dependent instructions. Explicit approaches sacrifice design efficiency and ultimately performance. We observe it is sufficient to emulate program order. Potential misprediction-dependent instructions are singled out a priori and their unchanging source values are checkpointed. These instructions and values are set aside as a "recovery program". Checkpointed source values break the data dependencies with co-mingled misprediction-independent instructions - now long since gone from the pipeline - achieving the essential decoupling objective. When the mispredicted branch resolves, recovery is achieved by fetching the self-sufficient, condensed recovery program. Recovery is effectively transparent to the pipeline, in that speculative state is not rolled back and recovery appears as a jump to code. A coarse-grain retirement substrate permits the relaxed order between the decoupled programs. Transparent control independence (TCI) yields a highly streamlined pipeline that quickly recycles resources based on conventional speculation, enabling a large window with small cycle-critical resources, and prevents many mispredictions from disrupting this large window. TCI achieves speedups as high as 64% (16% average) and 88% (22% average) for 4-issue and 8-issue pipelines, respectively, among 15 SPEC integer benchmarks. Factors that limit the performance of explicitly ordered approaches are quantified.
Concepts, techniques and tools for an educational modeling language
Authors: F. Barbier, P. Laforcade
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

In the context of e-learning, educational modeling languages (EML) aim in essence to first produce intelligible models and next derive education-oriented software components and services to implement cognitive learning applications on the top of open distance learning platforms. The convergence between software engineering concerns such as reusability and interoperability, knowledge management in education and Web-based information systems, generates the need for business languages as extensions of standards. This paper presents the CPM (Cooperative Problem-based learning Metamodel) language, a VML-based modeling language, dedicated to problem-based learning (PBL) process design. Since the recent implementation of this language in a CASE tool this paper discusses the deep nature, the use, user validation and the compatibility of this language with existing e-learning approaches and norms.
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
Authors: Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We study linear programming relaxations of Vertex Cover and Max Cutarising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting from the standard linear programming relaxation. For Vertex Cover, Arora, Bollobas, Lovasz and Tourlakis prove thatthe integrality gap remains at least 2-ε after Ωε(log n) rounds, where n is the number ofvertices, and Tourlakis proves that integrality gap remains at least 1.5-ε after Ω((log n)2) rounds. Fernandez de laVega and Kenyon prove that the integrality gap of Max Cut is at most 12 + ε after any constant number of rounds. (Theirresult also applies to the more powerful Sherali-Adams method. We prove that the integrality gap of Vertex Cover remains at least 2-ε after Ωε (n) rounds, and that theintegrality gap of Max Cut remains at most 1/2 +ε after Ωε(n) rounds.
On the accuracy of embeddings for internet coordinate systems
Authors: Eng Keong Lua, Timothy Griffin, Marcelo Pias, Han Zheng, Jon Crowcroft
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Internet coordinate systems embed Round-Trip-Times (RTTs) between Internet nodes into some geometric space so that unmeasured RTTs can be estimated using distance computation in that space. If accurate, such techniques would allow us to predict Internet RTTs without extensive measurements. The published techniques appear to work very well when accuracy is measured using metrics such as absolute relative error. Our main observation is that absolute relative error tells us very little about the quality of an embedding as experienced by a user. We define several new accuracy metrics that attempt to quantify various aspects of user-oriented quality. Evaluation of current Internet coordinate systems using our new metrics indicates that their quality is not as high as that suggested by the use of absolute relative error.
Breast cancer diagnosis using least square support vector machine
Authors: Kemal Polat, Salih Güneş
Venue: Digital Signal Processing (2007)

The use of machine learning tools in medical diagnosis is increasing gradually. This is mainly because the effectiveness of classification and recognition systems has improved in a great deal to help medical experts in diagnosing diseases. Such a disease is breast cancer, which is a very common type of cancer among woman. In this paper, breast cancer diagnosis was conducted using least square support vector machine (LS-SVM) classifier algorithm. The robustness of the LS-SVM is examined using classification accuracy, analysis of sensitivity and specificity, k-fold cross-validation method and confusion matrix. The obtained classification accuracy is 98.53% and it is very promising compared to the previously reported classification techniques. Consequently, by LS-SVM, the obtained results show that the used method can make an effective interpretation and point out the ability of design of a new intelligent assistance diagnosis system.
An Experimentally Verified Model of the Perceived "Coldness' of Objects
Authors: Wouter M. Bergmann Tiest
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In this paper, a numerical model of the thermal process of touching an object is described. The model takes into account the object geometry and temperature, the thermal parameters of the material and the contact resistance between finger and object. Based on the heat extraction rate, this model predicts which materials will feel warm or cold to the touch. The model is empirically verified with psychophysical experiments. In a temperature-controlled box, subjects had to discriminate between stimuli of different materials and geometries based on thermal cues. The results are in line with the idea that the perceived "coldness' of materials is determined by the initial heat transfer rate, as predicted by the model.