ppxscal/embedding_network huggingface dataset:
Configurable variable length code for video coding
Authors: N.-M. Cheung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The variable length code (VLC) tables in MPEG-1/2/4 and H.263 are fixed and optimized for a limited range of bit-rates, and they cannot handle a variety of applications. The universal variable length code (UVLC) is a new scheme to encode syntax elements and has some configurable capabilities. It is also being considered in ITU-T H.26L. However, the configurable feature of the UVLC has not been well explored. We propose configuring the UVLC with the additional code configuration (ACC). The ACC is used to adapt UVLC to different symbol distributions by adjusting the partitioning of the symbols into different categories, and the code size assignment to different categories. Experimental results show that the UVLC with ACC outperforms the current proposed scheme in H.26L and the VLC tables of existing standards, while drastically simplifying the encoding and decoding process, and is applicable to a variety of applications.
Quantum list decoding from quantumly corrupted codewords for classical block codes of polynomially small rate
Authors: Tomoyuki Yamakami
Venue: Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65 (2007)

Our task of quantum list decoding for a classical block code is to recover from a given quantumly corrupted codeword a short list containing all messages whose codewords have high "presence" in this quantumly corrupted codeword. All known families of efficiently quantum list decodable codes, nonetheless, have exponentially-small message rate. We show that certain generalized Reed-Solomon codes concatenated with Hadamard codes of polynomially-small rate and constant codeword alphabet size have efficient quantum list decoding algorithms, provided that target codewords should have relatively high presence in a given quantumly corrupted codeword.
Agent-Based Design of Load Balancing System for RFID Middlewares
Authors: Jian Feng Cui, Heung Seok Chae
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

RFID middleware technology has been applied to various applications such as retail, health care, logistics, etc, due to its competitive business value. In order to get a stable and reliable working environment, load balancing should be considered for RFID middlewares. In the past several years, agent technology has played a central role in many application areas. Agent technology also provides a decentralized and adaptive approach for load balancing problem. Load balancing technology should consider five policies: information gathering policy, initiation policy, job transfer policy, selection policy, and location policy. In this paper, we propose an agent based load balancing approach for RFID middleware according to those policies and two agents are developed, LGA and RLBA. LGA is a mobile agent and compliant to the first policy, while RLBA is a stationary agent and compliant to the other four policies. We have successfully implemented this approach on JADE mobile agent platform which proves to be feasible and efficient compared with traditional approaches.
Automatic test pattern generation for resistive bridging faults
Authors: P. Engelke, I. Polian, M. Renovell
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

An ATPG for resistive bridging faults is proposed that combines the advantages of section-based generation and interval-based simulation. In contrast to the solutions introduced so far, it can handle arbitrary non-feedback bridges between two nodes, including ones detectable at higher resistance and undetectable at lower resistance, and faults requiring more than one vector for detection.
Dp-slam
Authors: Ronald Parr
Venue:  (2005)

We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate map in real time despite imperfect information about the robot's trajectory through the environment. Unlike other approaches that assume predetermined landmarks (and must deal with a resulting data-association problem) our algorithm uses the sensor range data directly to build metric occupancy maps. Our algorithm uses a particle filter to represent both robot poses and possible map configurations. By using a new map representation, which we call distributed particle (DP) mapping, we are able to maintain and update hundreds of candidate maps and robot poses efficiently. Through careful design, we are able to achieve a time complexity which is linear in both the area observed and the number of particles used. This thesis also presents an autonomous method for learning an appropriate motion model for the robot, providing a more accurate posterior distribution, and thus requiring fewer resources. Furthermore, we develop a hierarchical framework for SLAM which allows DP-SLAM to maintain appropriate amounts of uncertainty for significantly longer than would otherwise be possible. Our technique makes essentially no assumptions about the environment yet it is accurate enough to close loops over 250m in length with crisp, perpendicular edges on corridors and minimal or no misalignment errors, despite significant noise and ambiguity in the environment. We also provide methods for extending DP-SLAM into three dimensional maps.
Applications for ubiquitous computing and communications
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The session views some potential use cases and applications that use ubiquitous computing and communications. The new aspects of these applications and the basic design challenges and solutions will be addressed. 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
Interactive presentation: Techniques for designing noise-tolerant multi-level combinational circuits
Authors: K. Nepal, R. I. Bahar, J. Mundy, W. R. Patterson, A. Zaslavsky
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

As CMOS technology downscales, higher noise levels, wider threshold variation, and low supply voltage will force designers to contend with high rates of soft logical errors and many defective devices. A probabilistic design framework based on Markov random fields (MRF) has been previously proposed to address dynamic fault and noise vulnerability of ultimate digital CMOS circuitry. The idea is to use additional transistors and feedback loops to achieve significant noise immunity and ensure correct logic operations at low VDD. However, the extra reliability achieved in previously published work came at a cost of high transistor counts. In this paper, we present techniques to reduce the transistor count of larger multi-level combinational circuits built within the MRF framework by using variable sharing, implied dependence and supergates. Using these techniques we show an average reduction of approximately 28% in transistor counts over a range of combinational benchmark circuits built within the MRF framework compared to the best previously published results.
A speech spectrum distortion measure with interframe memory
Authors: F. Nordin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present a novel spectral distortion measure with interframe memory. The memory gives the possibility to take into account the dynamics of the time evolution of the speech spectrum, which has shown to have a significant importance on the perceived speech quality. Memory is introduced by linear filtering of the time evolution of the difference log spectrum. This facilitates smoothing of spectrum with an ability to track quick transitions. Our results point at a substantially improved performance when rapidly evolving spectrum errors are punished in the measure.
A chain coding approach for real-time recognition of on-line handwritten characters
Authors: Hung Yuen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A novel chain coding approach is proposed for real-time recognition of isolated on-line handwritten English characters. A new type of generalized chain code (GCC) is proposed for lossless encoding of the variably-spaced handwritten data points produced naturally by an electronic writing tablet due to the fixed sampling rate and the variable writing speed. Distinctive features for each character are then extracted based on the segmented cumulative differential normalized GCC values and structural descriptors. Experiments showed successful real-time recognition of isolated on-line handwritten lowercase English characters on a 486 class PC. 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
Computerized voting: problems and solutions
Authors: David Amurao
Venue: ACM SIGCAS Computers and Society (2006)

At first glance, electronic voting can seem to be an end-all solution to the problems produced by the "chad-prone" punch-card ballots in the 2000 Florida recount, as well as to the limitations and problems of other types of ballots. Electronic voting offers advantages to both the voter and the polling place in its efficiency, speed, and convenience. However, electronic voting is prone to other types of problems that are inherent in computers themselves. Votes can be greatly skewed in these computerized voting machines by a plethora of factors such as glitches, hackers, viruses and even by the voting machine makers who may be sympathetic to particular political parties. In using these computerized voting systems nationally, the votes of millions of Americans may be compromised. Still, these computer-related problems can be fixed and the systems can be made more secure with rigorous testing and evaluation by independent computer science experts. Many changes regarding security and reliability must be implemented to even consider computerized voting systems for national use.
Linking Object-Z with Spec#
Authors: Shengchao Qin, Guanhua He
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Formal specifications have been a focus of software engineering research for many years and have been applied in a wide variety of settings. Their use in software engineering not only promotes high-level verification via theorem proving or model checking, but also inspires the "correct-by-construction" approach to software development via formal refinement. Although this correct-by-construction method proves to work well for small software systems, it is still a utopia in the development of large and complex software systems. This paper moves one step forward in this direction by designing and implementing a sound linkage between the high level specification language Object-Z and the object-oriented specification language Spec#. Such a linkage would allow system requirements to be specified in a high-level formal language but validated and used in program language level. This linking process can be readily integrated with an automated program refinement procedure to achieve correctness-by-construction. In case no such procedures are applicable, the obtained contract-based specification can guide programmers to manually generate program code, which can then be verified against the obtained specification using any available program verifiers.
A MATLAB graphical user interface for linear quadratic control design
Authors: J. Watkins
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The optimal linear quadratic regulator (LQR) method is a powerful technique for designing controllers for complex systems that have stringent performance requirements. For most realistic applications, the LQR problem must be solved via a computer aided design (CAD) package such as MATLAB. With the CAD packages solving the optimization problems, the challenge lies in how the weighting matrices are chosen. With experience, practising engineers become quite adept at choosing these matrices for a specific application. Students in a typical quarter or semester long course do not have the luxury of this experience. Consequently, the authors have written a MATLAB graphical user interface (GUI) that allows the students to easily tune the weighting matrices and immediately see the consequences of those changes. This paper describes the motivation behind the LQR Design GUI, the GUI construction process, and the use of the LQR Design GUI in the senior-level modern control systems course at the U.S. Naval Academy.
Visualizing tags over time
Authors: Micah Dubinko, Ravi Kumar, Joseph Magnani, Jasmine Novak, Prabhakar Raghavan, Andrew Tomkins
Venue: ACM Transactions on the Web (TWEB) (2007)

We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any photo in the system. Over the past year, users have on average added over a million tags each week. Understanding the evolution of these tags over time is therefore a challenging task. We present a new approach based on a characterization of the most interesting tags associated with a sliding interval of time. An animation provided via Flash in a Web browser allows the user to observe and interact with the interesting tags as they evolve over time. New algorithms and data structures are required to support the efficient generation of this visualization. We combine a novel solution to an interval covering problem with extensions to previous work on score aggregation in order to create an efficient backend system capable of producing visualizations at arbitrary scales on this large dataset in real time.
Technology of culture: the roadmap of a journey undertaken
Authors: Parthasarathi Banerjee
Venue: AI Society (2007)

Artificial intelligence (AI) impacts society and an individual in many subtler and deeper ways than machines based upon the physics and mechanics of descriptive objects. The AI project involves thus culture and provides scope to liberational undertakings. Most importantly AI implicates human ethical and attitudinal bearings. This essay explores how previous authors in this journal have explored related issues and how such discourses have provided to the present world a roadmap that can be followed to engage in discourses with ethical and aesthetic implications of contemporary cognitive sciences.
Marking Technique to Isolate Boundary Router and Attacker
Authors: Vaarun Vijairaghavan, Darshak Shah, Pallavi Galgali, Amit Shah, Nikhil Shah, Venkatesh Srinivasan
Venue: Computer (2007)

A new method for identifying denial-of-service attacks uses the attacker's media accesscontrol address for identification and traceback. The technique pinpoints the boundary routerthe attacker is connected to, allows identification after the attack, and imposes minimal extraload on the network.
Transparent run-time defense against stack smashing attacks
Authors: Arash Baratloo, Navjot Singh, Timothy Tsai
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The exploitation of buffer overflow vulnerabilities in process stacks constitutes a significant portion of security attacks. We present two new methods to detect and handle such attacks. In contrast to previous work, the new methods work with any existing pre-compiled executable and can be used transparently per-process as well as on a system-wide basis. The first method intercepts all calls to library functions known to be vulnerable. A substitute version of the corresponding function implements the original functionality, but in a manner that ensures that any buffer overflows are contained within the current stack frame. The second method uses binary modification of the process memory to force verification of critical elements of stacks before use. We have implemented both methods on Linux as dynamically loadable libraries and shown that both libraries detect several known attacks. The performance overhead of these libraries range from negligible to 15%.
buySAFE: Creating and Profiting from the Bonded Seller^TM Advantage
Authors: Eric K. Clemons Jeff Grass, Steve Woda
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Information asymmetry and the buyer's information deficit reduces buyers' willingness to pay, and in extreme cases can lead to market collapse. buySAFE's certification of sellers and bonding their transactions for amounts up to $25,000 improve buyers' information endowment, increase willingness to pay, and increase sellers' margins and total revenues. The company is moving beyond its initial positioning on eBay to become a more general guarantor of online transactions.
Comparing binary and real-valued coding in hybrid immune algorithm for feature selection and classification of ECG signals
Authors: Michał Bereta, Tadeusz Burczyński
Venue: Engineering Applications of Artificial Intelligence (2007)

The paper presents a new algorithm for feature selection and classification. The algorithm is based on an immune metaphor, and combines both negative and clonal selection mechanisms characteristic for B- and T-lymphocytes. The main goal of the algorithm is to select the best subset of features for classification. Two level evolution is used in the proposed system for detectors creation and feature selection. Subpopulations of evolving detectors (T-lymphocytes) are able to discover subsets of features well suited for classification. The subpopulations cooperate during evolution by means of a novel suppression mechanism which is compared to the traditional suppression mechanism. The proposed suppression method proved to be superior to the traditional suppression in both recognition performance and its ability to select the proper number of subpopulations dynamically. Some results in the task of ECG signals classification are presented. The results for binary and real coded T-lymphocytes are compared and discussed.
Construction of nonlinear dynamic MEMS component models using Cosserat theory
Authors: C. Wang, D. Liu, R. Rosing, B. De Masi, A. Richardson
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This paper presents a new modelling method for MEMS components based on Cosserat theory. By constructing Cosserat elements, generating symbolic code and development of numeric code in VHDL-AMS for selected demonstrators, we are able to effectively simulate and predict their linear and nonlinear behavior in estimating system performance and guiding the reliability verification process. The simplicity of the Cosserat approach follows from the possibility to formulate interconnected slender components in terms of a network of quasi-rigid bodies (Cosserat elements). This modularization fits well into the behavioral modelling where a relatively low degree of freedom is needed to capture salient features of system. Furthermore, the manner in which Cosserat elements and their interactions are formulated makes this method ideally suited for nonlinear dynamic simulations in the presence of large deflections.
Fourier tags: Smoothly degradable fiducial markers for use in human-robot interaction
Authors: Junaed Sattar, Eric Bourque, Philippe Giguere, Gregory Dudek
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper we introduce the Fourier tag, a synthetic fiducial marker used to visually encode information and provide controllable positioning. The Fourier tag is a synthetic target akin to a bar-code that specifies multi-bit information which can be efficiently and robustly detected in an image. Moreover, the Fourier tag has the beneficial property that the bit string it encodes has variable length as a function of the distance between the camera and the target. This follows from the fact that the effective resolution decreases as an effect of perspective. This paper introduces the Fourier tag, describes its design, and illustrates its properties experimentally.
Service learning with student organizations
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Recently, there has been an increased demand on fiscal accountability in all sectors, but perhaps even more so in the educational arena. Recruitment and retention have become very important in a time of shrinking engineering enrolments. This means that special efforts need to be made to attract new students to our College of Engineering and Applied Sciences, especially under-represented minorities and women. At the same time, extra efforts need to be made to retain the students already recruited. All of this takes time and money. The College of Engineering and Applied Sciences at Arizona State University has a plan that supports both recruitment and retention within the college in a cost-effective manner while at the same time it provides service learning to students. Starting last year in a pilot project, a student organization and the Associate Dean for Student and Business Affairs contracted a win-win solution. The Engineering Dean's Office provided money for the air fare to an annual national conference in exchange for service hours for recruitment and retention activities of the college. The experiment was very successful and has now been expanded to other student organizations. This paper describes how the exchange works and the types of services done by the students.
JEmacs: the Java/scheme-based Emacs
Authors: Per Bothner
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

JEmacs is a re-implementation of the Emacs programmable text editor. It is written in Java, and uses the Swing GUI toolkit. Emacs is based on the extension language Emacs Lisp (Elisp), which is a dynamically-scoped member of the Lisp family. JEmacs supports Elisp, as well as the use of Scheme, a more modern statically-scoped Lisp dialect. Both languages get compiled to Java bytecodes, either in advance or on-the-fly, using the Kawa compilation framework.
Subspace methods for blind identification of SIMO-FIR systems
Authors: E. Moulines
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Blind identification of single-input multiple-output (SIMO) FIR systems based on second order statistics has attracted a lot of research efforts. We focus on subspace estimation procedures, which exploit the structure of the range space of certain matrix-valued statistics constructed by arranging in a prescribed order the covariance coefficients of the observations. General subspace identifiability results are obtained, based on the properties of minimal polynomial bases of rational subspaces. Several subspace estimation procedures are then derived. These estimators are all based on the (possibly weighted) least-square solution of an overdetermined system of linear equations and are thus well-suited for practical implementations.