ppxscal/embedding_network huggingface dataset:
Perceptual image representation
Authors: Matei Mancas, Bernard Gosselin, Benoît Macq
Venue: Journal on Image and Video Processing (2007)

This paper describes a rarity-based visual attention model working on both still images and video sequences. Applications of this kind of models are numerous and we focus on a perceptual image representation which enhances the perceptually important areas and uses lower resolution for perceptually less important regions. Our aim is to provide an approximation of human perception by visualizing its gradual discovery of the visual environment. Comparisons with classical methods for visual attention show that the proposed algorithm is well adapted to anisotropic filtering purposes. Moreover, it has a high ability to preserve perceptually important areas as defects or abnormalities from an important loss of information. High accuracy on low-contrast defects and scalable real-time video compression may be some practical applications of the proposed image representation.
On Generating Vectors That Invoke High Circuit Delays - Delay Testing and Dynamic Timing Analysis
Authors: I-De Huang, Sandeep K. Gupta
Venue: Proceedings of the 16th Asian Test Symposium (2007)

In this paper, we propose an approach to generate vectors that invoke high delays. We first identify properties of different types of paths, especially sticky paths, i.e., paths that are functionally sensitizable but not even non-robustly testable. In particular, we show that it is impossible to guarantee detection of sticky path-delay faults. We then identify logic and timing conditions that are necessary to cover a target path and develop a new logic-and-timing implication procedure to exploit these conditions. We incorporate this procedure in a new ATPG that also prioritizes the order in which these conditions are used to generate high quality vectors. We use this ATPG to identify paths that cannot or need not be tested and to generate high quality vectors for all other paths. Experimental results demonstrate that the vectors we generate invoke much higher delays than previously generated vector sets, especially for circuits with many sticky paths.
A Dynamic and Differential CMOS Lookup Table with Data-Independent Power Consumption for Cryptographic Applications on Chip Cards
Authors: M. Bucci, L. Giancane, R. Luzzi, A. Trifiletti
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

Attacks based on a differential power analysis (DPA) are a main threat when designing cryptographic functions for implementation on chip-cards. In this paper, a dynamic and differential look-up table (LUT) is presented and evaluated on a case study simulation. The proposed circuit shows a power consumption independent from the input data and can be employed to implement combinatorial functions in cryptographic processors when a high resistance against tampering is required. A typical application is the design of non-linear functions (e.g. substitution boxes) since protecting them with less expensive countermeasures (e.g. random masking) implies a significant overhead. In the adopted case study, a 1.02% spread in the power consumption has been obtained when parasitic capacitances are taken into account. Moreover, a comparison with a static CMOS implementation shows an acceptable overhead in terms of area and power consumption.
Array Processor Architecture
Authors: D. J. Theis
Venue: Computer (1981)

Today's array processors provide a cost-effective tool for increasing the speed at which highly computation-bound processing jobs can be carried out. They are maturing and expanding with greatly improved hardware and software improvements that are primarily a result of the accumulated experience of the vendors and users of these machines. All in all, it is a very competitive environment.
Visual Inspection Automation
Authors: J. F. Jarvis
Venue: Computer (1980)

Designing new products specifically for automated visual inspection may be the greatest future development in automated visual inspection technology. 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
Research of the Apriority Policy-based Multi-hop BFS Search Algorithm in P2P Network
Authors: Zhe Chen, Shize Guo, Yixian Yang, Kangfeng Zheng
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Peer-to-Peer (P2P) network is a fast developing branch of Computer Science and many researchers are developing new algorithms for such systems. After the success of systems like Napster, Kazza, the use of such networks became a necessity. This paper analyses the reason of the redundant search packets in the area of resource discovery and search of the P2P system, details in the Multi-hop BFS algorithm and the apriority policy-based model, puts forward the apriority policy-based multi-hop BFS search algorithm and gives the correctness proof of APM-MHBFS.
Enhancing End-to-End QoS for Multimedia Streaming in IMS-Based Networks
Authors: Tanir Ozcelebi, Igor Radovanovic, Michel Chaudron
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Convergence of the emerging IP Multimedia Subsystem (IMS) includes unlicensed, nondedicated and nondetemzinistic, hence uncontrollable computer access networks for IP multimedia services. It enables provision of resource demanding real-time sewices and multimedia communication raising new end-to-end Quality-of-Sewice (QoS) challenges, for which quality adaptation using resource management is proposed as a solution in this paper: This is an integrated solution taking both IMS and computer access networks into account as well as the two end-devices and the application sewers (AS) involved in communication. The best user experience is targeted under real-time variation of available network (e.g. bandwidth, buffer space) and end-device (e.g. battery, CPU, memory, storage) resources throughout a session. The multimedia content is dynamically adapted to$t the resource availability variations, achieving maximum system (i.e. network and end-devices) resource utilization and enhanced QoS. The resource availability update signalling is carried over Session Initiation Protocol (SIP) during the session. This is work in progress.
Distributed, Integrated, and Collaborative Research Environment (DiCore): An Architectural Design
Authors: Hongjun Su, Hong Zhang, Ray Hashemi
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we propose to develop a Distributed, Integrated, and Collaborative Research Environment (DiCore) that may enable a new generation of scientific discovery, learning, and innovation in all scientific areas. DiCore seamlessly integrates a set of carefully selected high quality web-based software tools with ajax-style rich user interfaces. These tools collectively satisfy the daily research needs of researchers. Underneath DiCore is a set of intelligent machine learning and data mining algorithms that are designed to serve researchers, educators, and students in different aspects, such as recommending reading materials based on researchers' interests, and suggesting working research groups. DiCore is a potential enabling research and educational environment that may satisfy our next generation collaborative research and educational needs. A wide range of new collaborative research and educational projects in all areas of computing become possible under DiCore.
System Segmentation for the Parallel Diagnosis of Computers
Authors: C. V. Ramamoorthy, Lih-Chung Chang
Venue: IEEE Transactions on Computers (1971)

In this paper we develop methods of segmenting a large system into smaller subsystems so that the letter can be diagnosed in parallel. Two basic techniques called serial segmentation and parallel segmentation are introduced. Furthermore, an algorithm is developed for the purpose of reducing the complexity and the size of the large subsystem.
Optimizing Power-Aware Routing using Zone Routing Protocol in MANET
Authors: Kyoung-Ja Kim, Hyun-Woo Koo
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The mobile ad-hoc network (MANET) is difficult to maintain the routing path from node mobility. The device in mobile ad-hoc network has limited power. It is in charge of both transmitting data packet and maintaining routing path. In consequence, the lifetime of routing path differ with the power control method We propose the routing model using PARO (Power- Aware Routing Optimization) and ZRP (Zone Routing Protocol) for effective power control and transmission. This paper presents a routing algorithm which tries to minimize the power consumed in transmitting a packet from the lifetime of the network by avoiding nodes that have a shorter lifetime remaining.
Communications and the Minicomputer
Authors: C. J. Ball
Venue: Computer (1971)

The technical literature dealing with computing and data communications contains advertisements today for a tremendous variety of data communications hardware; terminals in almost every shape and size, modems, multiplexers, communications pre-processors, and so on. Applications and software packages to be used with this hardware are being described and programmers everywhere are learning how to optimize data transmission to and from their computers. 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
Research on User Applying Mode for Video Conference System
Authors: Yuqing Zhang, Qun Wang, Jianfeng Zou, Xuezhi Tao, Libin Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Based on analysis of H.323 system, a new method called user applying mode is put forward. In user applying mode, MCU sends users information to all conference endpoints, any conferee has the ability to apply more than one video stream. The applied video streams are multiplexed and transmitted by MCU, and displayed on the endpoint independently. Therefore, the interactivity is improved, and the original size of these video streams is maintained. Test results show that this new mode has a perfect compatibility, and is superior to mixed mode in CPU and memory utilization.
A call-by-name lambda-calculus machine
Authors: Jean-Louis Krivine
Venue: Higher-Order and Symbolic Computation (2007)

We present a particularly simple lazy lambda-calculus machine, which was introduced twenty-five years ago. It has been, since, used and implemented by several authors, but remained unpublished. We also build an extension, with a control instruction and continuations. This machine was conceived in order to execute programs obtained from mathematical proofs, by means of the Curry-Howard (also known as "proof-program") correspondence. The control instruction corresponds to the axiom of excluded middle.
VHDL?Feature Description And Analysis
Authors: J. H. Aylor, R. Waxman, C. Scarratt
Venue: IEEE Design Test (1986)

In the summer of 1981, the Institute for Defense Analysis arranged a workshop to initiate the development of requirementsfor a modern hardware description language. Much effort has since been expended developing those requirements and implementinga VHSIC hardware description language (or VHDL). VHSIC is a Department of Defense program dealing with very high speed integratedcircuits. One part of this effort analyzed existing languages and their environments, extracting major advantages of each.This analysis sought to ensure that no current hardware description language capabilities had been overlooked in developingVHDL. We will present the features needed in a modern hardware description language, and describe eight hardware descriptionlanguages?examining each to determine its features. We will also analyze VHDL with respect to the language features described.
Tool Support for ISO 14598 based code quality assessments
Authors: H. Gruber, C. Korner, R. Plosch, S. Schiffer
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

There is empirical evidence, that the internal quality of software has an important impact on the external, i.e., user perceptible software quality. Our Evaluation Method for Internal Software Quality (EMISQ) -- based on the ISO 14598 standard for the evaluation of software products -- provides the methodological framework for an expert centred assessment of internal software quality, which is supported by metric values and other findings provided by off-the-shelf static code analysis tools. To perform code quality assessments in a timely and efficient manner, it is inevitable to have tool support tailored to the needs of the evaluators. For that purpose we developed the Eclipsed based tool Software Product Quality Reporter (SPQR) that supports the EMISQ method to a large extent -- from the formulation of project-specific quality models up to the generation of preliminary code quality reports. The application of SPQR already proved its usefulness in the execution of EMISQ projects.
Massively parallel simulated annealing and its relation to evolutionary algorithms
Authors: Günter Rudolph
Venue: Evolutionary Computation (1993)

Simulated annealing and single-trial versions of evolution strategies possess a close relationship when they are designed for optimization over continuous variables. Analytical investigations of their differences and similarities lead to a cross-fertilization of both approaches, resulting in new theoretical results, new parallel population-based algorithms, and a better understanding of the interrelationships.
Special Feature a Glossary of Software Tool and Techniques
Authors: D. J. Reifer
Venue: Computer (1977)

Software tools can serve as powerful aids in the design, development, test, and maintenance of computer software. So, in light of the recent growth in cost of software relative to total system cost, it should come as no surprise that the subject of software tools has sparked a good deal of interest throughout the computer industry. In response to that interest, this paper provides a comprehensive listing of the software tools and techniques currently available.
On the Time Required for Timing The Halting Problem Rephrased
Authors: J. Nievergelt
Venue: IEEE Transactions on Computers (1970)

The proof of the unsolvability of the halting problem can be reformulated to show that, in general, the best one can do to estimate the run time of programs is to execute them.
Testing, Testing
Authors: F. P. Mathur
Venue: Computer (1978)

As a direct result of the awe-inspiring changes in LSI technology, an 8-bit microcomputer today has an equivalent of 8000 transistors-which for testing purposes are quite inaccessible, said Tudor Finch of Bell Labs in his introduction to Session 8. Finch, who chaired the session, went on to point out that this level of integration forces one to resort to more indirect techniques-e.g., techniques applying stimuli to input pins and observing the corresponding responses. The stimuliresponse behavior for a fault-free chip then characterizes its fault-free signaturere -iations indicate a failure condition. These deviations long with the stimuli test patterns can then be exhaustively catalogued for each and every specific fault condition to yield what is referred to as a "fault-dictionary." The problem, observed Finch, is that the sheer combinatorics of the situation yield literally astronomical numbers, thus excluding exhaustive characterizing techniques. This circumstance has motivated the development of algorithmic as well as heuristic techniques, which for specific fault-models given the correct behavior of a circuit automatically generates all fault-signatures. The relationship of test vectors or patterns required per gate versus circuit complexity was illustrated trated by T. Finch as shown in the figure.
Fuzzy modular autonomous intelligent cruise control (AICC) system
Authors: M. A. Jarrah, A. Shaout
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

An autonomous intelligent cruise control system was designed and simulated based on measured relative distance, speed, and acceleration. These constitute the fuzzy inputs. The results have shown that the system can be robust to noisy distance measurements and modular in structure to ease its implementation. A simple way of estimating the road condition was developed, implemented and tested in simulation. The results show that based on the measured relationship between the deceleration and brake pressure, the brake pressure output gain can be adjusted to prevent lock up of the tires and the consequent loss of stability. Two controller implementations were tested. The first one is based on heuristic knowledge of the system using Mamdani inference system. The second model was based on offline adaptive neuro-fuzzy controller model.
Curvelet-Based Multi SVM Recognizer for Offline Handwritten Bangla: A Major Indian Script
Authors: A. Majumdar, B. B. Chaudhuri
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper deals with automatic recognition of offline handwritten Bangla characters. Bangla is the second most popular script among SAARC countries. A new class of features based on Curvelet transform has been used in our classification scheme. The classifier used was SVM with one-against-rest class model. The training and test set were morphologically deformed to get five versions of the same character and each version has been subject to individual SVM classifier. Five classifier outputs obtained in this way have been combined by simple majority voting scheme. The overall recognition accuracy of 95.5% has been obtained on the data set. It is hoped that the Curvelet transform along with such multi-classifier scheme will be useful in other handwritten character data as well.
Maximal Coverage Scheduling in Randomly Deployed Directional Sensor Networks
Authors: Weifang Cheng, Shanshan Li, Xiangke Liao, Shen Changxiang, Haitao Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Unlike traditional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may be able to switch to several directions and each direction has a limited angle of sensing range. Area coverage is still an essential issue in a directional sensor network which consists of a number of directional sensors. In this paper, we study a novel "area coverage by directional sensors" problem. We propose the Maximum Directional Area Coverage (MDAC) problem to maximize covered area by scheduling the working directions of the sensors in the network. We prove the MDAC to be NP-complete and propose one distributed scheduling algorithm for the MDAC. Simulation results are also presented to demonstrate the performance of the proposed algorithm.
A Parametric Spectral-Based Method for Verification of Text in Videos
Authors: V. Papavassiliou, T. Stafylakis, V. Katsouros, G. Carayannis
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A new method for verifying text areas detected in video streams is proposed. The algorithm explores the spectral properties of the horizontal projection of candidate text regions in order to reduce the high amount of false alarms that most text detection algorithms suffer from. The full algorithm (text localization followed by verification and temporal redundancy module) has been tested on newscast video sequences (MPEG-1-720x576 resolution-184 minutes). The detection module produced 94.82% recall rate but only 51.84% precision rate. The addition of the verification module increased the precision rate to 78.93%, keeping the recall rate almost unaffected.
Modelling of elastoplastic behaviour with non-local damage in concrete under compression
Authors: A. Mohamad-Hussein, J. F. Shao
Venue: Computers and Structures (2007)

In the first part, an elastoplastic damage model is proposed for concrete under compression-dominated stresses. The model is applied to typical concrete in various loading conditions. The model's parameters are determined from conventional triaxial tests. The comparison between experimental data and numerical simulations shows the performance of the model in predicting basic mechanical behaviour of concrete for a large range of stress. In the second part, an extension of the model is proposed by including a non-local damage formulation. The extended model is applied to the analysis of failure process zone in concrete related to material softening behaviour.
On correctness of probabilistic stabilization
Authors: A. N. Kotel'Nikova, N. N. Krasovskii
Venue: Automation and Remote Control (2007)

Consideration is given to the controlled object with aftereffect under indefinite and stochastic noises. The problem of feedback stabilization with probabilistic actions is discussed. Noises in the form of retarded actions of the motion history are admitted; also, the control of retarded actions of the motion history is tolerated. The paper is based on the Lyapunov stability theory [1] modernized for hereditary and stochastic systems. The approach typical of the control theory in the presence of a conflict or uncertainty is used.
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph
Authors: Michael A. Henning, Anders Yeo
Venue: Graphs and Combinatorics (2007)

In this paper we study tight lower bounds on the size of a maximum matching in a regular graph. For k &ge; 3, let G be a connected k-regular graph of order n and let a'(G) be the size of a maximum matching in G. We show that if k is even, then &alpha;'(G) &ge; min {(k2+4 / k2+k+2)} x n/2 , n-1/2}, while if k is odd, then &alpha;(G) &le; (k3-k2-2)n-2k+2 / 2(k3-3k). We show that both bounds are tight.
Location-Aware IEEE 802.11 for Spatial Reuse Enhancement
Authors: Tamer Nadeem, Lusheng Ji
Venue: IEEE Transactions on Mobile Computing (2007)

Abstract--In this paper, we propose an enhancement to the IEEE 802.11 Distributed Coordination Function (DCF). The enhancement improves the level of channel spatial reuse, thus improves overall network data throughput in dense deployments. Our modification, named the Location Enhanced DCF (LED), incorporates location information in DCF frame exchange sequences so that stations sharing the communication channel are able to make better interference predictions and blocking assessments. Hence more concurrent transmissions can be conducted in densely deployed Wireless LANs. The potential performance enhancement of LED is studied both analytically and via ns-2 simulations. The results show that the LED method can achieve up to 20% more throughput than the original DCF.