ppxscal/embedding_network huggingface dataset:
S3PAS: A Scalable Shoulder-Surfing Resistant Textual-Graphical Password Authentication Scheme
Authors: Huanyu Zhao, Xiaolin Li
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

The vulnerabilities of the textual password have been well known. Users tend to pick short passwords or passwords that are easy to remember, which makes the passwords vulnerable for attackers to break. Furthermore, textual password is vulnerable to shoulder-surfing, hidden-camera and spyware attacks. Graphical password schemes have been proposed as a possible alternative to text-based scheme. However, they are mostly vulnerable to shoulder-surfing. In this paper, we propose a Scalable Shoulder- Surfing Resistant Textual-Graphical Password Authentication Scheme (S3PAS). S3PAS seamlessly integrates both graphical and textual password schemes and provides nearly perfect resistant to shoulder-surfing, hidden-camera and spyware attacks. It can replace or coexist with conventional textual password systems without changing existing user password profiles. Moreover, it is immune to brute-force attacks through dynamic and volatile session passwords. S3PAS shows significant potential bridging the gap between conventional textual password and graphical password. Further enhancements of S3PAS scheme are proposed and briefly discussed. Theoretical analysis of the security level using S3PAS is also investigated.
Smooth wavelet frames with application to denoising
Authors: I. W. Selesnick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper considers the design and application of wavelet tight frames based on iterated oversampled filter banks. The greater design freedom available makes possible the construction of wavelets with a high degree of smoothness, in comparison with orthonormal wavelet bases. Grobner bases are used to obtain the solutions to the nonlinear design equations. Following the dual-tree DWT of Kingsbury (see Proceedings of the Eighth IEEE DSP Workshop, Utah, 1998, and Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing (ICASSP), Phoenix, 1999), one goal is to keep the redundancy-factor bounded by 2, instead of allowing it to grow as it does for the undecimated DWT (which is exactly shift-invariant). For the tight frame presented here, optimal-tree based denoising algorithms can be directly applied.
Voluntary cooperation in pervasive computing services
Authors: Mark Burgess, Kyrre Begnum
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The advent of pervasive computing is moving us towards a new paradigm for computing in terms of ad hoc services. This carries with it a certain risk, from a security and management viewpoint. Users become increasingly responsible for their own hosts. A form of service transaction based on minimal trust is discussed. A proof of concept implementation of nondemand (voluntary) services is discussed for pervasive computing environments. 'Voluntary Remote Procedure Call' is a test-implementation of the proposed protocol integrated into cfengine, to show how voluntary cooperation of nodes can allow a cautious exchange of collaborative services, based on minimal trust. An analysis of implementation approaches followed by a discussion of the desirability of this technology is presented.
Sampling Eigenvalues in Hardy Spaces
Authors: Amin Boumenir, Vu Kim Tuan
Venue: SIAM Journal on Numerical Analysis (2007)

In this work we extend the sampling method to compute eigenvalues of singular non-self-adjoint Sturm-Liouville problems in the presence of a continuous spectrum. We first show that the characteristic function, whose zeros are the eigenvalues, belongs to a Hardy space, and then develop a new sampling formula for its reconstruction. We estimate the truncation error, obtain computable error bounds, and test the method with a few numerical experiments.
Detecting defects in Erlang programs using static analysis
Authors: Konstantinos Sagonas
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

This talk will review the main techniques used in the Dialyzer (Discrepancy AnaLYZer of ERlang programs) defect detection tool. Dialyzer employs various forms of static program analysis to automatically identify software errors in large applications written in Erlang, a concurrent functional language developed by Ericsson and commonly used for developing telecommunications software. Dialyzer is completely automatic, relatively fast, requires no annotations from its user to detect defects, and is exceptional in that it does not report any false positives. The heart of Dialyzer's analysis is inter-modular inference of success typings for Erlang functions and the talk will explain what success typings are and how they differ from type inference in statically typed language. Dialyzer, which nowadays is part of the Erlang/OTP (Open Telecom Platform) system, has been applied to large code bases of Erlang code and has identified a significant number of software defects that have remained unnoticed after years of extensive testing. The talk will also describe experiences and main lessons learned from Dialyzer's development and from feedback from its user community. More information about the tool and a set of related publications can be found in Dialyzer's website: http://www.it.uu.se/research/group/hipe/dialyzer.
Voice quality conversion in TD-PSOLA speech synthesis
Authors: Xuejing Sun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The capability of producing different voice qualities is highly desirable in modern speech synthesis systems. Diphone based synthesizers using TD-PSOLA can generate high quality synthetic speech. However, one of the drawbacks of such systems in comparison to the formant synthesizer or the LPC synthesizer is its inflexibility in voice quality conversion (VQC). In this paper, the author presents a VQC method for the TD-PSOLA synthesis system. For vocal fry, the ST-signals are multiplied by a Kaiser window with alternate magnitude; for breathy voice, the ST-signals are first convolved with a one-pole filter, and then combined with shaped noise signals, and finally multiplied by a Hanning window. All the windowed ST-signals are then overlap-added as in standard TD-PSOLA. The perceptual evaluation test shows that this method can generate the desired voice quality successfully. 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
Newborn EEG seizure pattern characterisation using time-frequency analysis
Authors: B. Boashash
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Previous techniques for seizure detection in newborn babies are inefficient. The main reason for their relative poor performance resides in their assumption of stationarity of the EEG. To remedy this problem, we use time-frequency distributions (TFD) to analyse and characterise the newborn EEG seizure patterns as a first step toward a time-frequency (TF) based seizure detection and classification scheme. This paper presents the results of the analysis of these time-frequency patterns for two abnormal newborn EEGs. We demonstrate that the newborn EEG seizures are well described by a class of mono- and multi-component linear FM signals. This result is novel and contradicts the simplistic assumptions routinely made in the field.
A publisher of last resort: enduring document access
Authors: George Buchanan
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Ensuring long-term access to valuable online content is complicated by legal constraints and practical difficulties. We introduce a new technique for ensuring the long-term availability of digital content on the internet. The technique combines legal and technical measures to guarantee that a document remains available when its original goes offline, either permanently or long-term: a "publisher of last resort".
Adaptive blind source separation by second order statistics and natural gradient
Authors: Yong Xiang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Separation of sources that are mixed by an unknown (hence, "blind") mixing matrix is an important task for a wide range of applications. This paper presents an adaptive blind source separation method using second order statistics (SOS) and natural gradient. The SOS of observed data is shown to be sufficient for separating mutually uncorrelated sources provided that the temporal coherences of all sources are linearly independent of each other. By applying the natural gradient, new adaptive algorithms are derived that have a number of attractive properties such as invariance of asymptotical performance (with respect to the mixing matrix) and guaranteed local stability. Simulations suggest that the new algorithms are highly efficient and outperform some of the best existing ones.
Secure Display and Secure Transactions Using a Handset
Authors: Sandeep Singh Ghotra, Baldev Kumar Mandhan, Sam Shang Chun Wei, Yi Song, Chris Steketee
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The security risks of using standard personal computers and operating systems for confidential transactions such as Internet banking are well-known. This is one reason for the interest in the mobile phone/ handset as a Personal Trusted Device (PTD). However, mobile phones have other shortcomings, for example the constraints of working with a small screen. This paper explores the use of a dedicated device - a Secure Display Device (SDD) - which, when used together with a mobile phone, combines the security of the phone as PTD with the characteristics, such as large display size, that can be offered by non-portable hardware. We describe three prototype SDD systems which we built in order to test these ideas. Two of them use a simulated SDD implemented entirely in software on a personal computer: a Mobile Banking system in which the SDD is used for its display capability, and a Payment System in which the SDD is an Automatic Teller Machine. In addition, we describe our work on a prototype hardware-based implementation of the Mobile Banking system that can be plugged into a standard computer monitor or TV. We conclude by analysing the lessons learnt and canvassing further use cases for SDD systems.
Analyzing a Digital Image in a Way that is Useful to a Student of Art
Authors: Martin Constable
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

When traditional artists are painting they will often look at their work in a dark room (or sometimes by candle light). This filters out most of detail information (which our eyes don't perceive well in the dark) and also removes the color from an image. The artist is then free to asses the paintings all-important tonal structure as well as it's large masses. There are many such tricks in the artist's lexicon and they all serve to provide valuable feedback to the many complex structures that underpin a manufactured image. This feedback is especially useful to the student who is needful of an impartial reflection upon their progress. What are the equivalents to such tricks in digital practice? What unique visual feedback do they offer and how can it be used?
Programmable Digital Frequency Multiplier
Authors: Sanjay K. Wadhwa, Deeya Muhury, Krishna Thakur
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

A programmable digital frequency multiplier with wide multiplication factor range and low lock time is presented. A digital algorithm is used to generate output frequency and an inbuilt PVT compensation mechanism ensures good frequency stability if there is any change in voltage and temperature during circuit operation. The circuit has been designed in 90nm CMOS process for input reference frequency of 32.768 KHz and multiplication factor range of 128 to 1023. The silicon results show less than 2% of average frequency error at maximum multiplication factor.
Designing mega widgets in the Tix library
Authors: Ioi K. Lam
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

Tcl/Tk graphical applications are built by assembling Tk widgets. The Tix library pre-packages the standard Tk widgets into an extensive set of higher-level GUI components, a.k.a. mega-widgets, so that applications ban be built more rapidly and in a more structural manner. With many new widgets, the Tix library enriches Tcl/Tk applications by introducing new interaction techniques. The Tix mega-widgets have a powerful application programming interface (API) designed to boost application programmers' productivity. This paper describes the mega-widgets in the Tix library and discusses the principles for designing the API of mega-widgets.
Declarative Data Services: This Is Your Data on SOA
Authors: Mike Carey
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

With the current push towards service-oriented architectures (SOA) and process orientation, data seems to be getting lost in the SOA shuffle. At the end of the day, however, most applications are still about data, and service-oriented applications are no different. In this talk, we will argue that data services are a critical piece of the SOA application puzzle. We will discuss an approach to SOA data modeling that involves defining a network of related data services. We will also make the case for a declarative approach to defining such services, showing how the proposed approach enables a level of highly performant composition (reuse) that is not attainable through other, more traditional approaches. Along the way we will identify industry standards from W3C and other consortia that offer a standards-based foundation for data services.
Using Object Models as Domain Knowledge in Perceptual Organization: An Approach for Object Category Identification in Video Sequences
Authors: Gaurav Harit, Rajesh Bharatia, Santanu Chaudhury
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

In this paper we present a framework which integrates object-model knowledge with the perceptual organization process. We demonstrate the advantages of the add-on grouping evidences as contributed by the object models for a more robust perceptual organization in the spatio-temporal domain. Our system performs detection of foreground objects along with recognition in video.
Automating Embedded Software Testing on an Emulated Target Board
Authors: Jooyoung Seo, Ahyoung Sung, Byoungju Choi, Sungbong Kang
Venue: Proceedings of the Second International Workshop on Automation of Software Test (2007)

An embedded system consists of heterogeneous layers including hardware, HAL (Hardware Abstraction Layer), OS kernel and application layer. Interactions between these layers are the software interfaces to be tested in an embedded system. The identified interfaces are important criterion that selects test cases and monitors the test results in order to detect faults and trace their causes. In this paper, we propose an automated scheme of embedded software interface test based on the emulated target board. The automated scheme enables to identify the location of interface in the source code to be tested, to generate test cases, and to determine "pass' or "fail' on the interface. We implemented the test tool called "Justitia' based on the proposed scheme. As a case study, we applied the "Justitia' to mobile embedded software on the S3C2440 microprocessor and Linux kernel v2.4.20.
Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors
Authors: Karen A. Tomko, Santosh G. Abraham
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

We develop compile-time iteration partitioning techniques for private-cache shared-memory mulriprocessors. Our techniques assign loop iterations to a set of processors so that cache coherency traffic due io interprocessor communication is minimized and load balance is maintained. In contrast to most previous research that has examined uniformly-generated dependences, we develop methods for non-uniform dependences that are generated by stride conflicts. Furthermore, we consider the effects of a long cache line size and minimize false coherency traffic. Our methods can handle conflicts between any two integer strides. We have conducted experiments on a 32-processor KSR-1 from Kendall Square Research which show 2x performance improvement using our partitioning algorithm over standard contiguous partitioning techniques.
Toward a scalable test methodology for 2D-mesh Network-on-Chips
Authors: Kim Petersén, Johnny Öberg
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a BIST strategy for testing the NoC interconnect network, and investigates if the strategy is a suitable approach for the task. All switches and links in the NoC are tested with BIST, running at full clock-speed, and in a functional-like mode. The BIST is carried out as a go/no-go BIST operation at start up, or on command. It is shown that the proposed methodology can be applied for different implementations of deflecting switches, and that the test time is limited to a few thousand-clock cycles with fault coverage close to 100%.
A Predictive Technique for Replica Selection in Grid Environment
Authors: Rashedur M. Rahman, Ken Barker, Reda Alhajj
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Replication in a Data Grid reduces access latency and bandwidth consumption. However, when different sites hold replicas of a particular file, there is a significant benefit realized by selecting the best replica from among them. The best replica is the one that optimizes the desired performance criterion such as absolute performance (i.e. speed), cost, security or transfer time. By selecting the best replica, the access latency can be minimized. We develop a predictive framework that uses data from various sources and predicts transfer times of the sites that host replicas. With this estimate, one site can request the replica from the site that has the lowest transfer time. We use a neural network (NN) for transfer time prediction of different sites that currently hold file replicas. We compare the results with a multi-regression model and the simulation results demonstrate that the neural network technique is capable of predicting transfer time more accurately than the regression based model.
Computer technology, digital transactions, and legal discovery: a phenomenological study of possible paradoxes
Authors: Toni Greif
Venue:  (2007)

Computer technology provides numerous conveniences while societal dependency is increasing. As computer technology becomes engrained into daily routines, tremendous amounts personal information are being digitized, stored, and in many cases distributed or sold to organizations for secondary uses. This phenomenological research study examined possible infringements of Fourth Amendment rights on individuals when personal digital transactions generated as part of their daily lives are mined for purposes other than the creator's original intent. While society is becoming dependent on electronic media not only for mundane tasks such as paying bills or receiving loyalty discounts, it may be jeopardizing personalized segments of socialization and networking. The study found that the secondary uses of personal data for purposes other than the intent of the originating transaction are escalating. These subsequent uses have an impact on individual privacy. The study concluded that the Fourth Amendment only protects United States citizens from illegal search and seizure by the government and does not protect personal data from a third party. Current laws and court rulings do not view personal information as belonging to an individual. The study also determined that a social paradigm shift is occurring in the way the youth of the 21st century communicate and are now being socialized. Social networking using MYSPACE&trade; and blogging internet sites is replacing the street corner and playground discussions of the past. The permanency of digital information is expansive as the digital comments and diaries of today can last through the life of their originator. Any digital record can confront its author again as an e-discovery document in a court of law.
News: This Little Standard Went to Market; This Little Standard Blew Up
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2006)

Wireless technology competition derailed two IEEE 802 task groups this year. The 802.15.3a task group, which was working on personal area network technology, and the 802.20 working group, which was developing a standard for mobile broadband wireless access.
Feature-based portability
Authors: Glenn S. Fowler, David G. Korn, John J. Snyder, Kiem-Phong Vo
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

Current computing platforms encompass a dizzying variety of hardware and software. A software application may live or die based on how portable it is. Much has been written and talked about how to enhance portability. But few tools are available to support writing portable code and, more importantly, to encode porting knowledge. This paper describes IFFE, a tool and an accompanying programming style that supports software portability. IFFE has enabled the porting and construction of many large software applications on heterogeneous platforms with virtually no user intervention
Genus characterizes the complexity of certain graph problems: Some tight results
Authors: Jianer Chen, Iyad A. Kanj, Ljubomir Perković, Eric Sedgwick, Ge Xia
Venue: Journal of Computer and System Sciences (2007)

We study the fixed-parameter tractability, subexponential time computability, and approximability of the well-known NP-hard problems: independent set, vertex cover, and dominating set. We derive tight results and show that the computational complexity of these problems, with respect to the above complexity measures, is dependent on the genus of the underlying graph. For instance, we show that, under the widely-believed complexity assumption W[1] NP, the independent set problem on graphs of genus bounded by g"5(n) has no PTAS if g"5(n)=@W(n), and the vertex cover and dominating set problems on graphs of genus bounded by g"6(n) have no PTAS if g"6(n)=n^@W^(^1^).