ppxscal/embedding_network huggingface dataset:
A Real-Time Parallel Optical Processing Technique
Authors: W. E. Kock
Venue: IEEE Transactions on Computers (1975)

Numerous parallel processing capabilities of holography have been described [1], [2]. Certain of these which are inherent in a (holographic) synthetic aperture radar [3]-[7] have also been discussed [8], including its parallel (simultaneous) phase curvature adjustments for all near-field reflecting objects, and its automatic (and parallel) adjustment of the (synthetic) aperture size so as to cause the metric resolution to be independent of range. It is here suggested that a real-time hologram reconstruction tube [9] could be incorporated to advantage in certain synthetic aperture systems.
Sequential Machines Having Quasi-Stable States
Authors: T. Tamesada
Venue: IEEE Transactions on Computers (1980)

This correspondence investigates a model of description for sequential systems having state-transitions among any number of stable states, quasi-stable states, and unstable states. The quasi-stable states are typically seen in the so-called astable and monostable multivibrators in pulse circuits.
Evaluating Classification Reliability for Combining Classifiers
Authors: Pasquale Foggia, Gennaro Percannella, Carlo Sansone, Mario Vento
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The implementation of a multiple classifier system implies the definition of a rule (combining rule) for determining the most likely class, on the basis of the class attributed by each single classifier. The availability of a criterion to evaluate the reliability of the decision taken by a classifier can be profitably used in order to implement an effective combining rule. In this paper, we propose a method that evaluates the reliability of each classification act by using an \in-Support Vector Regression approach. This idea yields to define four combining rules that work also with classifiers providing as their only output the guess class. The results obtained on some standard datasets by these reliability-based rules are compared with those obtained by using different well-known combining criteria, in order to assess the effectiveness of the proposed approach.
A Multi-scale Relativity Retrieval Algorithm Based on Image Shape
Authors: Baojuan Huang, Dehong Yu, Jian Zhuang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Two kinds of image retrieval reference frame were compared in the paper. It is found that the polar coordinates facilitate processing multi-scale images. The interpolation method for edge sequence points is designed, where two compared clusters edge points are endowed with the same length, and all original characteristic boundary points were reserved. By means of the characters of similar image boundaries with the maximum relativity in the space distance, the multi-scale relativity algorithm for shape-based image retrieval (MSRA) is proposed, which is sensitive to the changed image contours, but insensitive to the image size. Compared with common boundary points Fourier descriptor algorithm (CBPFD)the identification rate of MSRA gets higher 29% than that of CBPFD in the natural image collections and the identification rate of MRASB is almost 2.5 times of that of CBPFD in the artificial image collections.
Dynamic Conflict-free Query Scheduling for Wireless Sensor Networks
Authors: Octav Chipara, Chenyang Lu, John Stankovic
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

With the emergence of high data rate sensor net-work applications, there is an increasing demand for high-performance queryservices in such networks. To meet this challenge, we propose Dynamic Conflict-free Query Scheduling (DCQS), a novel schedulingtechnique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networksand workloads, DCQS is specifically designed for query services supporting in-network data aggregation. DCQS has several importantfeatures. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedenceconstraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads and rate changes withoutexplicitly reconstructing the transmission schedule. In addition, we provide an analytical capacity bound for DCQS in termsof query completion rate. This bound enables DCQS to handle overload through rate control. NS2 simulation results demonstratethat DCQS significantly outperforms a representative TDMA protocol (DRAND) and the 802.11 protocol in terms of query latency,throughput, and energy efficiency.
Empirical Analysis of the Dependence of Test Power, Delay, Energy and Fault Coverage on the Architecture of LFSR-Based TPGs
Authors: Shaahin Hessabi
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

Power dissipation, energy consumption of CUT and also number of required test vectors for obtaining predetermined fault coverage are the most important criteria used for evaluating the quality of a test pattern generator (TPG). In this paper, we analyze LFSR's flexibility in improving these evaluation criteria for TPG. Usually, we are interested in considering these different criteria simultaneously, while looking for the best configuration. For this purpose, we use genetic algorithm as our optimization algorithm and define some new optimization functions and analyze the capability of LFSR to reduce power, energy and test delay under these functions. From our experimental results on ISCAS'89 and ITC'99, we show that power dissipation of CUT is approximately independent of different optimization functions, and so energy consumption only depends on the number of test vectors. On the other hand, test delay depends on the optimization function, which enforces us to include delay term in the function to avoid test vector increment. Finally, by analyzing energy efficiency values and behavior of energy consumption in terms of fault coverage, under different optimization functions, we show that delay is a suitable optimization function for LFSRs with respect to the number of test vectors, power dissipation, energy consumption and energy efficiency.
Principle Hessian direction based parameter reduction with process variation
Authors: Alex Mitev, Michael Marefat, Dongsheng Ma, Janet M. Wang
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As CMOS technology enters the nanometer regime, the increasing process variation is bringing manifest impact on circuit performance. In this paper, we propose a Principle Hessian Direction (PHD) based parameter reduction approach. This new approach relies on the impact of each parameter on circuit performance to decide whether keeping or reducing the parameter. Compared with the existing principle component analysis (PCA) method, this performance based property provides us a significantly smaller set of parameters after reduction. The experimental results also support our conclusions. In all cases, an average of 53% of reduction is observed with less than 3% error in the mean value and less than 8% error in the variation.
Handwritten Numeral Recognition of Six Popular Indian Scripts
Authors: U. Pal, N. Sharma, T. Wakabayashi, F. Kimura
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

India is a multi-lingual multi-script country but there is not much work towards handwritten character recognition of Indian languages. In this paper we propose a modified quadratic classifier based scheme towards the recognition of off-line handwritten numerals of six popular Indian scripts. Here we consider Devnagari, Bangla, Telugu, Oriya, Kannada and Tamil scripts for our experiment. The features used in the classifier are obtained from the directional information of the numerals. For feature computation, the bounding box of a numeral is segmented into blocks and the directional features are computed in each of the blocks. These blocks are then down sampled by a Gaussian filter and the features obtained from the down sampled blocks are fed to a modified quadratic classifier for recognition. Here we have used two sets of feature. We have used 64 dimensional features for high-speed recognition and 400 dimensional features for high-accuracy recognition in our proposed system. A five-fold cross validation technique has been used for result computation and we obtained 99.56%, 98.99%, 99.37%, 98.40%, 98.71% and 98.51% accuracy from Devnagari, Bangla, Telugu, Oriya, Kannada, and Tamil scripts, respectively.
The next 700 Krivine machines
Authors: Rémi Douence, Pascal Fradet
Venue: Higher-Order and Symbolic Computation (2007)

The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure ¿-terms. While its original description has remained unpublished, this machine has served as a basis for many variants, extensions and theoretical studies. In this paper, we present the Krivine machine and some well-known variants in a common framework. Our framework consists of a hierarchy of intermediate languages that are subsets of the ¿-calculus. The whole implementation process (compiler¿+¿abstract machine) is described via a sequence of transformations all of which express an implementation choice. We characterize the essence of the Krivine machine and locate it in the design space of functional language implementations. We show that, even within the particular class of Krivine machines, hundreds of variants can be designed.
Testing for Intermittent Faults in Digital Circuits
Authors: M. A. Breuer
Venue: IEEE Transactions on Computers (1973)

In this paper we present a few fundamental results related to the problems of characterization and detection of intermittent faults in digital circuits, which, up to now, have been almost totally ignored. This problem is important since in many technologies intermittency is a predominant mode of failure.
On the Use of Case Based Reasoning Techniques in Flexible Querying
Authors: Guy de Tre, Tom Matthe, Parisa KordJamshidi, Marysa Demoor
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Case based reasoning (CBR) is a methodology where new problems are solved by investigating, adapting and reusing solutions to a previously solved, similar problem. Hereby knowledge is deduced from the characteristics of a collection of past cases, rather than induced from a set of knowledge rules that are stored in a knowledge base. In this paper we describe how fuzzy CBR techniques can be used to enhance the accessibility of relational databases, more specifically, flexible querying of regular relational databases. Two approaches are discussed: an approach where a database system is extended with a standalone instance-based prediction facility and an approach where such a prediction facility is embedded as an extension of the relational algebra. In both approaches, fuzzy set theory is used for the gradual modelling of similarity. Furthermore, its related possibility theory is used for the modelling of query satisfaction and for the handling of the inevitable uncertainty that occurs when predictions are made.
Addressing the data aspects of compliance with industry models
Authors: M. Delbaere, R. Ferreira
Venue: IBM Systems Journal (2007)

A fundamental aspect of compliance involves the capability to produce business reports which constitute adequate audit and control records. This presents two significant challenges. Very often, international and government regulators do not coordinate their policies, creating a great deal of overhead for the implementing organizations, particularly those represented in multiple geographical areas. In addition, the information required to produce these reports may be in inconsistent formats throughout the enterprise or unavailable at the right level of detail. To overcome these challenges, organizations need to develop an enterprise-wide data architecture that enables the consolidation of regulatory reporting requirements and the integration of data from different business areas. The definition of data standards and the use of common data-modeling techniques throughout the enterprise can assist in this effort. IBM has developed a series of industry models that address these challenges based on the principles of data warehousing and business intelligence. This paper describes in detail the technical and business challenges of information management in the context of compliance and presents a few practical examples of how customers in the financial services industry have addressed compliance requirements such as Basel II and Solvency II by using enterprise-wide information management approaches based on industry models and related technology.
Rectification of 3D Data Obtained from Moving Range Sensors by using Multiple View Geometry
Authors: Kazuki Kozuka, Jun Sato
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

For measuring the 3D shape of large objects, scanning by a moving range sensor is one of the most efficient method. However, if we use moving range sensors, the obtained data have some distortions due to the movement of the sensor during the scanning process. In this paper, we propose a method for recovering correct 3D range data from a moving range sensor by using the multiple view geometry. We assume that range sensor radiates laser beams in raster scan order, and they are observed from a static camera. We first show that we can deal with range data as 3D space-time images, and show that the extended multiple view geometry can be used for representing the relationship between the 3D space-time of camera image and the 3D space-time of range data. We next show that the multiple view geometry under extended projections can be used for rectifying 3D data obtained by the moving range sensor. The method is implemented and tested in synthetic images and range data. The stability of recovered 3D shape is also evaluated.
Genetic Algorithm-based Study on Flow Allocation in a Multicommodity Stochastic-flow Network with Unreliable Nodes
Authors: Qiang Liu, Hailin Zhang, Xiaoxian Ma, Qingzhen Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Many real-life networks can be abstracted into a stochastic-flow network. In this paper, we assume there are several sorts of resource flows transmitting through a stochastic-flow network with unreliable nodes. We want to find a optimal resource flow allocation and control strategy upon arcs and nodes. Under this strategy, the probability of satisfying sink nodes' demand is maximized when resource flows transmit from source nodes to sink nodes. We propose a genetic algorithm to seek the optimal strategy. At last, a numerical example is given to test the proposed algorithm.
Dynamic Detection of COTS Component Incompatibility
Authors: Leonardo Mariani, Mauro Pezzè
Venue: IEEE Software (2007)

Developing component-based systems supports reuse and modularity but introduces new compatibility problems. Testing and analysis are usually based on the availability of either the source code or the specifications, but COTS components are commonly provided without source code and with incomplete specifications. A dynamic analysis technique called behavior capture and test can reveal COTS component misbehaviors and incompatibilities. BCT first automatically derives behavioral models by monitoring component executions and then dynamically checks these models when the components are replaced or used as part of a new system. Another article related to software composition also appears in this issue ("Open Source Software: All You Do Is Put It Together").
3D input for 3D worlds
Authors: Sreeram Sreedharan, Edmund S. Zurita, Beryl Plimmer
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Virtual Worlds present a 3D space to the user. However, input devices are typically 2D. This unnatural mapping reduces the engagement of the experience. We are exploring using Wii controllers to provide 3D gesture-based input to the 3D virtual world, Second Life. By evaluating its usability, we found that gesture-based interfaces are appealing and natural for hand gestures such as wave but difficult to map to facial expressions.
Toward a Deeper Understanding of the Role of Interaction in Information Visualization
Authors: Ji Soo Yi Youn ah Kang John Stasko
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Even though interaction is an important part of information visualization (Infovis), it has garnered a relatively low level of attention from the Infovis community. A few frameworks and taxonomies of Infovis interaction techniques exist, but they typically focus on low-level operations and do not address the variety of benefits interaction provides. After conducting an extensive review of Infovis systems and their interactive capabilities, we propose seven general categories of interaction techniques widely used in Infovis: 1) Select, 2) Explore, 3) Reconfigure, 4) Encode, 5) Abstract/Elaborate, 6) Filter, and 7) Connect. These categories are organized around a user's intent while interacting with a system rather than the low-level interaction techniques provided by a system. The categories can act as a framework to help discuss and evaluate interaction techniques and hopefully lay an initial foundation toward a deeper understanding and a science of interaction.
Developing Wireless Sensor Nodes for Real-World Applications
Authors: Robert Newman, John Kemp
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper describes the development of a wireless sensor node platform, driven by the requirements of two real-world applications. Although there are several commercial, off the shelf platforms available, none was found to be suitable against the needs of the two applications. The platform that has been developed provides a number of advantages over existing systems, the primary one being rapidity of development of both software and the integration new transducer types. Although targeted at the two applications described, the platform makes available a 'multi modal mote' which mimics the multi-sensor card available with the popular MICA mote, but offers a better performance.
Analysis the priority of security requirement items for the process improvement by ISO/IEC 15504 and ISO/IEC 15408
Authors: Eun-Ser Lee, Haeng-kon Kim, Sun-myoung Hwang
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A software process can be characterized as the ISO/IEC 15504. A common process framework is established by defining a small number of framework activities that are applicable to all software projects, regardless of their size or complexity. There are many risk items of the project development that cause the process maturity level occurring in the quality problems during process management and project progress. This paper designs the opportunity tree that management of security requirement the current domain and their problems solution as well. And this paper reference ISO/IEC 15504 and ISO/IEC 15408 as the international standard. In this paper, we propose a security requirement handing based approach considering security when developing system.
The effects of explicit referencing in distance problem solving over shared maps
Authors: Mauro Cherubini, Pierre Dillenbourg
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Explicit Referencing is a mechanism for enabling deictic gestures in on-line communication. Little is known about the impact of ER on distance problem solving. In this paper, we report on a study where 120 students (60 pairs) had to solve a problem collaboratively, at a distance, using chat tools that differed in the way a user may relate an utterance to the task context. Results indicate that team performance is improved by explicit referencing mechanisms. However, when Explicit Referencing is implemented in a way that is detrimental to the linearity of the conversation, resulting in the visual dispersion or scattering of messages, its use has negative consequences for collaborative work at a distance. The role of a linear message history in the collaboration mechanisms was equally important than that of Explicit Referencing.
The design and implementation of a VR-architecture for smooth motion
Authors: F. A. Smit, R. van Liere, B. Fröhlich
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

We introduce an architecture for smooth motion in virtual environments. The system performs forward depth image warping to produce images at video refresh rates. In addition to color and depth, our 3D warping approach records per-pixel motion information during rendering of the three-dimensional scene. These enhanced depth images are used to perform per-pixel advection, which considers object motion and view changes. Our dual graphics card architecture is able to render the 3D scene at the highest possible frame rate on one graphics card, while doing the depth image warping on a second graphics engine at video refresh rate. This architecture allows us to compensate for visual artifacts, also called motion judder, arising when the rendering frame rate is lower than the video refresh rate. The evaluation of our method shows motion judder can be effectively removed.
An Educational Digital Image Processing Facility
Authors: H. C. Andrews
Venue: Computer (1977)

The growth of digital image processing-from a few research centers 10 years ago to a number of large-scale facilities scattered throughout the world today-has created a need for educating people qualified to use the extremely sophisticated hardware and software that go into these facilities. This paper traces the development of a facility dedicated solely to the educational and research goals of students pursuing graduate degrees. Unlike most facilities currently in operation, this one experiences little-if any-production, but all users have hands-on access to rapidly processed digital imagery results.
A new hybrid evolutionary mechanism based on unsupervised learning for Connectionist Systems
Authors: Ana Porto, Alfonso Araque, Juan Rabuñal, Julián Dorado, Alejandro Pazos
Venue: Neurocomputing (2007)

Recent studies have confirmed that the modulation of synaptic efficacy affects emergent behaviour of brain cells assemblies. We report the first results of adding up the behaviour of particular brain circuits to Artificial Neural Networks. A new hybrid learning method has emerged. In order to find the best solution to a given problem, this method combines the use of Genetic Algorithms with particular changes to connection weights based on this behaviour. We show this combination in feed-forward multilayer architectures initially created to solve classification problems and we illustrate the benefits obtained with this new method.