ppxscal/embedding_network huggingface dataset:
Transformation Techniques for Toeplitz and Toeplitz-plus-Hankel Matrices Part I. Transformations
Authors: A. W. Bojanczyk, George Heinig
Venue:  (1996)

Transformations of the form A -< C1AC2 are investigated that transform Toeplitz and Toeplitz-plus-Hankel matrices into generalized Cauchy matrices. C1 and C2 are matrices related to the discrete Fourier transformation or to various real trigonometric transformations. Combining these results with pivoting techniques, in part II algorithms for Toeplitz and Toeplitz-plus-Hankel systems will be presented that are more stable than classical algorithms.
Animal-Machine Interfaces
Authors: Jesus Savage, R. A. Sanchez-Guzmán Walterio Mayol, Leobardo Arce, Alejandro Hernandez, Laura Brier, Felipe Martinez, Anaid Velazquez, Gerardo Lopez
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

During the last decades, too much effort has been done to develop human-machine interfaces that have lead to several devices that help humans to use them. Our main motivation for this project is that those traditional human-machine interfaces and their advantages can be extended to other living beings. In order to provide them comfort and to enhance human-animal communication. In this paper we present the results of the first two-years of a research project named UNAM-CAN, which is a joint effort of the Engineering and Zoological faculties at UNAM University. The project involves a service dog that carries a computer (Wearable Computer) that gives simple commands through a speaker. The main idea is that a complex task can be decomposed into simple sequential tasks that the dog can execute. One of the main problems to solve is that the dog needs to perform the requested tasks without the presence of a person. We did some experiments that show that this is feasible.
Handwritten Document Retrieval
Authors: Gregory Russell, Michael P. Perrone, Yi-min Chee, Aiman Ziq
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper investigates the use of both typed and handwritten queries to retrieve handwritten documents. The recognition-based approach reported here is novel in that it expands documents in a fashion analogous to query expansion: Individual documents are expanded using N-best lists which embody additional statistical information from a Hidden Markov Model (HMM) based handwriting recognizer used to transcribe each of the handwritten documents.This additional information enables the retrieval methods to be robust to machine transcription errors, retrieving documents which otherwise would be unretrievable. Cross-writer experiments on a database of 10985 words in 108 documents from 108 writers, and within-writer experiments in a probabilistic framework, on a database of 537724 words in 3342 documents from 43 writers, indicate that significant improvements in retrieval performance can be achieved. The second database is the largest database of on-line handwritten documents known to us.
A new bound on the size of the largest critical set in a Latin square
Authors: Richard Bean, E. S. Mahmoodian
Venue: Discrete Mathematics (2003)

A critical set in an n × n array is a set C of given entries, such that there exists a unique extension of C to an n × n Latin square and no proper subset of C has this property. The cardinality of the largest critical set in any Latin square of order n is denoted by lcs(n). In 1978, Curran and van Rees proved that lcs(n) ≤ n2 - n. Here, we show that lcs(n) ≤ n2 - 3n + 3.
Superlinear Convergence of a Minimax Method
Authors: Shih Han
Venue:  (1978)

To solve a minimax problem Han [1977b] suggested the use of quadratic programs to find search directions. If the matrices in the quadratic programs are positive definite, the method can be shown convergent globally. In this paper we study that for efficiency the matrices should also be good approximations to a certain convex combination of Hessians on some subspace. Therefore, we suggest Powell''s scheme [Powell 1977] for updating these matrices. By doing so, we can avoid computing Hessians. Meanwhile, the matrices maintain positive definiteness and Han''s global convergence theorems can apply. Besides, the convergence of the resulting method is superlinear, indeed.
On-Chip Generation of Ramp and Triangle-Wave Stimuli for ADC BIST
Authors: S. Bernard, F. Azaïs, Y. Bertrand, M. Renovell
Venue: Journal of Electronic Testing: Theory and Applications (2003)

In the context of analog BIST for ADC, this paper presents two structures for the internal generation of a linear signal used with the histogram-based test technique. All of these structures use wide-swing current mirrors and an original adaptive system to make the generators less sensitive to process variations. The first structure allows us to generate high quality ramp signal. In a second step, a very high accuracy triangle-wave signal generator is presented in order to improve the equivalent linearity of the generated analog test signal.
Impact of Interoperability on CAD-IP Reuse: An Academic Viewpoint
Authors: Andrew B. Kahng, Igor L. Markov
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

Mind-boggling complexity of EDA tools necessitates reuseof intellectual property in any large-scale commercial or academicoperation. However, due to the nature of software,a tool component remains an ill-defined concept, in contrastto a hardware component (core) with its formally specifiedfunctions and interfaces. Furthermore, EDA tasks oftenevolve rapidly to fit new manufacturing contexts or newdesign approaches created by circuit designers; this leadsto moving targets for CAD software developers. Yet, it isuneconomical to write off tool reuse as simply an endemic"software problem". Our main message is that CAD toolsshould be planned and designed in terms of reusable componentsand glue code. This implies that industrial and academicresearch should focus on (1) formulating practicaltool components in terms of common interfaces, (2) implementingsuch components, and (3) performing detailedevaluations of such components. While this is reminiscentof hardware reuse, most existing EDA tools are designed asstand-alone programs and interface through files.
Perspectives on the right to publish: Globalinequalities, digital publications, and thelegacy of revolutionary France
Authors: William Wresch
Venue: Ethics and Information Technology (2003)

By 1789 the French Enlightenment had already established that the rights of citizens included the right to speak, write, and print freely. This right has since been enshrined in various national and international documents, but remains elusive in much of the world. One way to consider these freedoms is to look not just across the world comparing nations that have or don't have freedom, but back through time at the first effort to promulgate these new rights &ndash; the French Revolution. When the French Revolution created freedom of the press in 1789, the French book publishing industry was noted for five attributes: complete censorship of all publications, a rigidly enforced printing monopoly, copyright protection for all authors, fossilized content, and the proliferation of illegal presses. Digital technology is enabling a second dawn of press freedoms, but the five problems found in France two centuries ago can still be seen in various forms, especially in the massive monopoly of book publishing by a few countries. The answers created by France in 1810 present a partial basis for how current governments could respond to contemporary problems with freedom of the press. Rightly used, new digital technology also has an opportunity to finally facilitate one of civilization's fundamental freedoms.
Trading off Reliability and Power-Consumption in Ultra-Low Power Systems
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Critical systems like pace-makers, defibrillators, wearable computers and other electronic gadgets have to be designed not only for reliability but also for ultra-low power consumption due to limited battery life. This paper explores architecture, logic and circuit level approaches to this tradeoff. Fault tolerance techniques at the architecture level can be broadly classified into spatial or temporal redundancy. Using an example of counters (Binary and Gray) we show that temporal redundancy is best suited for these ultra-low power and low performance systems as it consumes 30% less power than an area redundant technique. Circuit techniques allow power-reliability tradeoffs of about 50% in each measure. A methodology is developed based on low-level fault simulation using SPICE, which allows detailed circuit models for both power consumption and reliability in current and future CMOS technology.
Survey on User Interface Programming
Authors: Brad A. Myers, Mary B Rosson
Venue:  (1992)

This paper reports on the results of a survey of user interface programming. The survey was widely distributed, and we received 74 responses. The results show that in today''s applications, an average of 48% of the code is devoted to the user interface portion. The average time spent on the user interface portion is 45% during the design phase, 50% during the implementation phase, and 37% during the maintenance phase. 34% of the systems were implemented using a toolkit, 27% used a UIMS, 14% used an interface builder, and 26% used no tools. The projects using only toolkits spent the largest percentage of the time and code on the user interface (around 60%) compared to around 45% for those with no tools. This appears to be because the toolkit systems had more sophisticated user interfaces. The projects using UIMSs or interface builders spent the least percent of time and code on the user interface (around 41%) suggesting that these tools are effective. In general, people were happy with the tools they used, especially the graphical interface builders. The most common problems people reported when developing a user interface included getting users'' requirements, writing help text, achieving consistency, learning how to use the tools, getting acceptable performance, and communicating among various parts of the program.
The Sharing of Rights and Information in a Capability-Based Protection System
Authors: Matt Bishop
Venue:  (1988)

The paper examines the question of sharing of rights and information in the Take-Grant Protection Model by concentrating on the similarities between the two; in order to do this, we state and prove new theorems for each that specifically show the similarities. The proof for one of the original theorems is also provided. These statements of necessary and sufficient conditions are contrasted to illustrate the proposition that transferring rights and transferring information are fundamentally the same, as one would expect in a capability-based system. We then discuss directions for future research in light of these results. 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
Is Prior Knowledge of a Programming Language Important for Software Quality?
Authors: Claes Wohlin
Venue: Proceedings of the 2002 International Symposium on Empirical Software Engineering (2002)

Software engineering is human intensive. Thus, it is important to understand and evaluate the value of different types of experiences, and their relation to the quality of the developed software. Many job advertisements focus on requiring knowledge of specific programming languages. This may seem sensible at first sight, but maybe it is sufficient to have general knowledge in programming and then it is enough to learn a specific language within the newjob. A key question is whether prior knowledge actually does improve software quality. This paper presents an empirical study where the programming experience of students is assessed using a survey at the beginning of a course on the Personal Software Process (PSP), and theoutcome of the course is evaluated, for example, using the number of defects and development time. Statistical tests are used to analyse the relationship between programmingexperience and the performance of the students in terms of software quality. The results are mostly unexpected, for example, we are unable to show any significant relation between experience in the programming language used and the number of defects detected.
A Client-Oriented Distribution Architecture for Web Search Agents
Authors: H. Seung, D.-H. Bae
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Among the agents deployed on the Web, search agents which can query multiple search engines simultaneously are gaining popularity among end-users. As the number of users and search engines increase, however, establishing multiple connections to remote search engines has the potential to saturate the network and increase the load on the server running the search agent. To resolve these issues, we propose a client-oriented distribution architecture for Web search agents. Our architecture allows having multiply replicated agents distributed throughout the network initiate the queries while localizing the network traffic to the client's machine. Special attention has been made on the design and implementation of a search agent based on our proposed architecture that limits its use of network resources and prevents skewing the logs on the remote sites. We also present the evaluation results of our Web search agent.
Cooperative Workflows to Coordinate Asynchronous Cooperative Applications in a Simple Way
Authors: C. Godart, F. Charoy, O. Perrin, H. Skaf-Molli
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Current workflow models are mainly concerned with the automation of administrative and production business processes. These processes coordinate well-defined activities, which execute in isolation, i.e. synchronize only at their start/terminate states. If these models apply efficiently for a class of applications, they show their limits when one wants to model the subtlety of cooperative interactions as they occur in more creative processes, typically co-design and co-engineering processes.In this paper, we introduce the concept of {\it cooperative workflow}, i.e. a workflow model which extends classical workflow models with capabilities to synchronize activities interacting not only when they start and they terminate, but also at any point of their execution. In the spirit of the workflow approach, modeling and enactment of cooperative workflows (must) remain simple.
Dynamic Light-Weight Groups
Authors: Katherine Guo
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Luis RodriguesThe virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that use a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps user groups onto instances of a virtually synchronous implementation is called a Light-Weight Group Service.This paper discusses the Light-Weight Group protocols in dynamic environments, where mappings cannot be defined a priori and may change over time. We show that it is possible to establish mappings that promote sharing and, at the same time, minimize interference. These mappings can be established in an automated manner, using heuristics applied locally at each node. Experiments using an implementation in the Horus system show that significant performance improvements can be achieved with this approach.
Lines in One Orthographic and Two Perspective Views
Authors: Nassir Navab, Yakup Genc, Mirko Appel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We introduce a linear algorithm to recover the Euclidean motion between an orthographic and two perspective cameras from straight line correspondences filling the gap in the analysis of motion estimation from line correspondences for various projection models. The general relationship between lines in three views is described by the trifocal tensor. Euclidean structure from motion for three perspective views is a special case in which the relationship is defined by a collection of three matrices. Here, we describe the case of two calibrated perspective views and an orthographic view. Similar to the other cases, our linear algorithm requires 13 or more line correspondences to recover 27 coefficients of the trifocal tensor.
Smiley-An Interactive Tool for Monitoring Inter-Module Function Calls
Authors: Neil M. Goldman
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Applications running under modern operating systems obtain a significant portion of their functionality from code that is distributed in binary modules distinct from the application's own executable. This functionality is accessed by load- or run-time linkage from the application executable or by interprocess communication. Examples of such functionality include user-interface management, file system access, process and thread creation and synchronization, and network communications.In the Windows NT operating system, an application obtains this functionality through calls on functions exported from shared libraries. Smiley is a monitoring program that can selectively log these calls as they are made by any application. It does so without any modification of the persistent executable images of either the application or the libraries.Logs of library calls provide insight into an application's implementation. By interactively selecting libraries and functions to monitor an analyst gradually homes in on aspects of an implementation that are relevant to his objectives. Since it requires only the distributed binary form of the application, Smiley can be used as an aid in comprehending the implementation of COTS software.
Market Price Fluctuations: Contact Point Between Agent Based Approach and Stochastic Processes
Authors: Aki-Hiro Sato
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

I present a contact point between agent based approach and stochastic process.Fromthree view points market price fluctuations are approached; statistic all properties of foreign exchange rules (macroscopic), a artificial market (microscopic) and stochasticprocesses (microscopic).A simple artificial market model is introduced and investigatedboth numerically and analytically.A stochastic process for price dynamics is derivedfrom the artificial market model and its statistical property is exhibited.I believe thatthis study establishes a bridge between artificial market model and stochastic processes. 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
Discrete wavelet transforms over finite sets which are translation invariant
Authors: Lute Kamstra
Venue:  (2001)

The discrete wavelet transform was originally a linear operator that works on signals that are modeled as functions from the integers into the real or complex numbers. However, many signals have discrete function values. This paper builds on two recent developments: the extension of the discrete wavelet transform to finite valued signals and the research of nonlinear wavelet transforms triggered by the introduction of the lifting scheme by Sweldens. It defines an essentially nonlinear translation invariant discrete wavelet transform that works on signals that are functions from the integers into any finite set. Such transforms can be calculated very time efficiently since only discrete arithmetic is needed. Properties of these generalized discrete wavelet transforms are given along with an elaborate example of such a transform. In addition, an upper bound is given for the number of certain kinds of discrete wavelet transforms over finite sets and it is shown that, in case the finite set is a ring, there are much more nonlinear transforms than linear transforms. Finally the paper presents some ideas to find explicit examples of discrete wavelet transforms over finite sets.
Generating a Random Cyclic Permutation
Authors: David Gries, Jinyun Xue
Venue:  (1986)

NOT SUPPLIED
Recursive Depth Estimation from a Sequence of Images
Authors: V. Shantaram, M. Hanmandlu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The paper presents the new formulation for estimation of depth using Extended Kalman filter for the case of known/unknown motion parameters. The use of spherical projection, which is the hallmark of the present work, has simplified the formulations. Two approaches have been suggested: one in which, measurements are not part of the state vector, and another in which measurements are part of the state vector. When the measurements are included in the state vector, it leads to nonlinear state equation. On the other hand, when the measurements are not included in the state vector, it leads to nonlinear measurement equation. The second approach is also amenable to estimate more number of depths by increasing both the measurement and state vectors.The performance of the above approaches has been evaluated on a sequence of images of vase and cube. It is observed that results due to the approach where measurements are not part of the state vector are found to be converging and more close to approximately measured depth values. The Extended Kalman filter is more sensitive to initial values.
How Do Image Statistics Impact Lossy Coding Performance?
Authors: Subhasis Saha, Rao Vemuri
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

It has been observed that when we compress a variety of images of different types using a fixed wavelet filter, the peak signal-to-noise ratio (PSNR) values vary widely from image to image. This large variation in PSNR by as much as 30 dB can only be attributed to the nature and inherent characteristics of the image, since everything else is fixed. In this paper, we analyze the set of test images to determine the statistics in the images that may cause the coding performance variations. It is shown that most of the gray-level image statistics do not have any direct effect on the coding performance, and image activity measure is the only feature that has a correlation with the PSNR value.
Rigidity Problem of Autodual Clones
Authors: Masahiro Miyakawa, Ivo G. Rosenberg
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

The rigidity problem for sets of autodual clones leads to two specific problems in clone theory: (\rn{1}) What are the sets $R$ of permutations of $\bm{k}=\{0,1, \ldots, k-1\}$ such that 1) each $r\in R$ has all cycles of the same prime length and 2) the only unary function on $\bm{k}$ which commutes with all elements of $R$ is the identity $e$? (\rn{2}) If a clone $C$ is the intersection of the autodual clones Pol $r^\Box, r\in R$ and if holds $C^{(1)}=\{e\}$, what is the least $n$ such that C{(n)}\not\subseteq J$ where $J$ is the set of all projections? We give some partial answers to these problems.