ppxscal/embedding_network huggingface dataset:
Estimation of Mutual Information in Two-Class Pattern Recognition
Authors: G. A. Butler
Venue: IEEE Transactions on Computers (1974)

Although mutual information (MI) has been proposed for some time as a measure of the dependence between the class variable and pattern recognition features, it is only recently that the practical problems of designing computer programs to use MI have been raised. Within the two-class context, this paper compares two traditional approaches to the requisite entropy estimation (using the maximum likelihood and expected value estimators of class probabilities) with a new estimator: the expected value of binomial entropy (E). The latter is shown to be superior where one class has a priori dominance. E is also related to expected probability of error and, in a surprising result, it is shown that E is a better estimator of class probabilities than the maximum likelihood and expected value estimators over a wide range.
MIND: An inside Look at an Expert System for Electronic Diagnosis
Authors: A. Wilkinson
Venue: IEEE Design Test (1985)

Because of its intended purpose, it is very complicated to diagnose faults in VLSI test system hardware. When this problemis considered in the hardware design phase, it is apparent that VLSI test systems need to have built-in self-test features.For a self-test to be of any value, the circuit check program should minimize the hardware involved in each test. MIND isan expert system for VLSI test system diagnosis that integrates the principles of their hierarchical design and experts' heuristicsto achieve a practical approach to reducing test system downtime. 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
Off-line Handwritten Signature GPDS-960 Corpus
Authors: F. Vargas, M. Ferrer, C. Travieso, J. Alonso
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

The current need for large databases to evaluate automatic biometric recognition systems has motivated the developing of the GPDS-960 corpus, an off-line handwritten signature database which contains 24 genuine signatures and 30 forgeries of 960 individuals. This paper describes the GPDS signature corpus, gives details about the acquisition protocols and presents preliminary verification results obtained using the GPDS data.
Model selection via Genetic Algorithms for RBF networks
Authors: Estefane G. M. de Lacerda, André C. P. L. F. de Carvalho, Teresa B. Ludermir
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In this paper, some model selection techniques (e.g., crossvalidation and bootstrap) are used as objective functions of a Genetic Algorithm. The Genetic Algorithm is modified in order to allow the efficient use of these objective functions by means of occam's razor, growing, and other heuristics. Some modifications explore intrinsic features of Genetic Algorithms, such as their ability to handle multiple and noise objective functions. The proposed techniques are very general and may be applied to a large range of learning algorithms.
A Survey on Failure Prediction of Large-Scale Server Clusters
Authors: Zhenghua Xue, Xiaoshe Dong, Siyuan Ma, Weiqing Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

As the size and complexity of cluster systems grows, failure rates accelerate dramatically. To reduce the disaster caused by failures, it is desirable to identify the potential failures ahead of their occurrence. In this paper, we survey the state of the art in failure prediction of cluster systems. The characteristic of failures in cluster systems are addressed, and some statistic results are shown. We explore the ways of the collection and preprocessing of data for failure prediction, and suggest a procedure for preprocessing the records in automatically generated log files. Focused on the main idea of five prediction methods, including statistic based threshold, time series analysis, rule-based classification, Bayesian network models and semi-Markov process models, are analyzed respectively. In addition, concerning the accuracy and practicality, we present five metrics for evaluating the failure prediction techniques and compare the five techniques with the five metrics.
Enhanced Availability and Security by Rate Control Using Extended Policy Framework in SELinux
Authors: Pravin Shinde, Priyanka Sharma, Srinivas Guntupalli
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper we discussed an extension to Security Enhanced Linux (SELinux) to build a more available and secure system that has the capability to contain and mitigate Denial of Service (DoS) attacks by exercising rate control over resource usage. We presented an extended structure to compliment Mandatory Access Control policies of SELinux. Using this extension a system's resource usage by various entities can be kept under control, leading to a more available system.
An efficient problem-independent hardware implementation of genetic algorithms
Authors: Nadia Nedjah, Luiza de Macedo Mourelle
Venue: Neurocomputing (2007)

In this paper, we propose a massively parallel architecture for hardware implementation of genetic algorithms. This design is quite innovative as it provides a viable solution to the fitness computation problem, which depends heavily on the problem-specific knowledge. The proposed architecture is completely independent of such specifics. It implements the fitness computation using a neural network. The hardware implementation of the used neural network is stochastic and thus minimise the required hardware area without much increase in response time. Last but not least, we demonstrate the characteristics of the proposed hardware and compare it to existing ones.
A New Grid Economy Architecture with Resources Pricing Fluctuation Module
Authors: Guanfeng Liu, Yuebin Xu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The research to the grid economy is gradually becomes a new hot spot with the grid technology development. In recent years there are also some remarkable results in this area of research, for example the middleware, Grid Architecture for Computational Economy (GRACE), however, in the research process, the GRACE has been discovered that the module of pricing fluctuation is not explicit. In grid economy architecture the fixed prices of resources will cause a problem whereby the profit to the providers will be significantly reduced, additionally, this will cause the reduction of the success ratio of tasks accomplishment. This paper presents a new kind of pricing fluctuation module called Resources Pricing Fluctuation Manager (RPFM), as part of GRACE architecture. It also presents the detailed inner architecture and makes a discussion of each part of RPFM. At the end, the paper shows the significance of the RPFM module through simulating experiment.
Appearance-based 3D object recognition with time-invariant features
Authors: E. Delponte, N. Noceti, F. Odone, A. Verri
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper we explore the interlink between temporally dense view-based object recognition and sparse image rep- resentations with local keypoints. The temporal component is an add on that allows us to extract information which is distinctive of a given object in a given view-point range. We use temporal descriptions both for training and for test- ing. In the training phase each image sequence contains one object only, observed at different view points. At run time video shots are analyzed looking for known objects. Train and test video shots are represented by a structure of scale-space keypoints selected so that they are robust to view-point changes. In the matching phase we emphasize co-occurring keypoints and attenuate the importance of iso- lated points, both in the model and in the test representa- tion. With our prototype recognition system we obtained very good results in controlled and unconstrained environ- ments, setting the ground for real world applications such as automatic place recognition, or robot object grasping.
Modeling User_s Cognitive Structure in Contextual Information Retrieval
Authors: Xuan Tian, Xiaoyong Du, He Hu, Haihua Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In contextual information retrieval, the retrieval of infor- mation depends on the time and place of submitting query, history of interaction, task in hand, and many other fac- tors that are not given explicitly but implicitly lie in the in- teraction and surroundings of searching, namely the con- text. User's cognition is one of important contextual fac- tors for understanding his or her personal needs. We pro- pose a model called DOSAM to get user's individual cogni- tive structure on domain knowledge. DOSAM is developed from the spreading-activation model of psychology and is established on the domain ontology. The cost analysis of algorithm shows that it is feasible to get cognitive struc- ture by DOSAM. Personalized search experimental results on digital library indicate that DOSAM can help improve the search effectiveness and user's satisfaction.
De Finetti theorem and Borel states in [0,1]-valued algebraic logic
Authors: Jan Kühr, Daniele Mundici
Venue: International Journal of Approximate Reasoning (2007)

In this paper de Finetti's (no-Dutch-Book) criterion for coherent probability assignments is extended to large classes of logics and their algebras. Given a set A of ''events'' and a closed set W@?[0,1]^A of ''possible worlds'' we show that a map s:A->[0,1] satisfies de Finetti's criterion if, and only if, it has the form s(a)=@!"WV(a)d@m(V) for some probability measure @m on W. Our results are applicable to all logics whose connectives are continuous operations on [0,1], notably (i) every [0,1]-valued logic with finitely many truth-values, (ii) every logic whose conjunction is a continuous t-norm, and whose negation is @?x=1-x, possibly also equipped with its t-conorm and with some continuous implication, (iii) any extension of Lukasiewicz logic with constants or with a product-like connective. We also extend de Finetti's criterion to the noncommutative underlying logic of GMV-algebras.
License Plate Detection Based on Expanded Haar Wavelet Transform
Authors: Kuo-Ming Hung, Hsiang-Lin Chuang, Ching-Tang Hsieh
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper presents a fast license plate localization algorithm base on expanded wavelet transform. The system consists of three major stages. First, a wavelet transform based method is used for extracting important contrast features as guides to search for desired license plates. Then, generating candidate regions in LH sub- image. In last stage we locate the license plate accurately in HL sub-image. The 1229 tested images taken from various scenes were employed, including diverse angles, different lightening conditions and the dynamic conditions. The experiments shows that proposed method can quickly and correctly detect the region of license plate and the license plate detecting rate of success is 97.31%. The average processing time of one color image is about 0.016s. . Keywords : -Wavelets transform, license plate detection, Morphology
Visualizing processes on the web
Authors: Delfina Malandrino, Giuseppina Palmieri, Vittorio Scarano
Venue: Journal of Visual Languages and Computing (2007)

In this paper, we describe 3WPS, a framework to build distributed systems that are able to monitor and interact with a process through a 3D interface that is accessible via the World Wide Web (WWW). The 3WPS is easily configurable, easily adaptable to different processes with high reuse of its software components and its distributed architecture leverages on off-the-shelf components of the WWW infrastructure such as Java applets and Virtual Reality Modeling Language (VRML) browsers. We describe the characteristics of 3WPS framework by mainly focusing on the issue of programmability and by contextually providing an example tour of its usage.
Effects of emotion control and task on Web searching behavior
Authors: Kyung-Sun Kim
Venue: Information Processing and Management: an International Journal (2008)

The study investigated how users' emotion control and search tasks interact and influence the Web search behavior and performance among experienced Web users. Sixty-seven undergraduate students with substantial Web experience participated in the study. Effects of emotion control and tasks were found significant on the search behavior but not on the search performance. The interaction effect between emotion control and tasks on the search behavior was also significant: effects of users' emotion control on the search behavior varied depending on search tasks. Profile analyses of search behaviors identified and contrasted the most commonly occurring profiles of search activities in different search tasks. Suggestions were made to improve information literacy programs, and implications for future research were discussed.
Vehicle Ego-Motion Estimation by using Pulse-Coupled Neural Network
Authors: Yanpeng Cao, Peter Cook, Alasdair Renfrew
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

This paper presents a visual odometer system using a monocular camera for vehicle navigation. A novel algorithm for vehicle ego-motion estimation based on optical flow and image segmentation is proposed. By applying a Pulse-Coupled Neural Network (PCNN), the image is dynamically divided into road area and non-road area by analysing texture smoothness. Correct road region detection effectively reduces computation cost and improves accuracy of egomotion estimation. Then a novel optical flow optimization method is proposed to produce reliable optical flow field in the road area detected previously. It's known when the vehicle is moving on a planar structured road, its 2-D motion field is expected to have specific form. Therefore ego-motion of vehicle, instantaneous speed and angular velocity, can be recovered from optical flow field of road area. Experiments show that the visual odometer successfully provides driver with robust and accurate vehicle self motion information.
An Improved Chirp Typed Blind Watermarking Algorithm Based on Wavelet and Fractional Fourier Transform
Authors: Dian-hong Wang, Dong-ming Li, Yan Jun, Fen-xiong Chen
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Spatial domain-based Chirp signal watermark can be detected blindly through the Fractional Fourier Transform in the transform domain. The purpose of this paper is to outline the state of the research of wavelet transform domain-based watermark and to propose an improved algorithm towards it. With regard to the later we first analyze the optimum order of the Hermite matrix for the computation of Direct Discrete Fourier Transform. Then we focus on Chirp signals hiding in the low frequency band of the host image in Wavelet domain. Results of the experiments revealed that our improved blind watermark detection algorithm is more robust comparing with conventional spatial algorithm. In addition, it detects the Chirp watermark rapidly.
Semiconductor Memories: New Dimensions in Storage Technology
Authors: M. F. Slana
Venue: Computer (1977)

The prospect of a special issue on semiconductor memories might very well evoke an initial reader response that falls somewhere short of fervent. After all, isn't the subject amply treated in the trade and professional press? Product announcements and advertisements of new devices abound. What more can be said on the subject?
Color-Based Object Tracking Using Fast Survival-of-the-Fittest Method
Authors: Huiyan Zhao, Xiang Duan, Yongfeng Cao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The efficient tracking of visual objects in complex environments is a challenging task for the vision community. In a real-rime particle filter tracking, the particles are a constrained resource and should be well used. From the aspect of efficiently exploring the state space, a new particle filter method named detection based particle filter to the real time tracking of non- rigid objects are proposed. This method evenly spread particles in the possible state space at each time step, and keeps a minimum particle number in each possible target region. Color clues are used in this method. Experimental results show that this method can achieve good performance and need smaller particle number compared with sampling importance resampling (SIR) particle filter.
Effect of System Workload on Operating System Reliability: A Study on IBM 3081
Authors: R. K. Iyer
Venue: IEEE Transactions on Software Engineering (1985)

This paper presents an analysis of operating system failures on an IBM 3081 running VM/SP. We find three broad categories of software failures: error handling (ERH), program control or logic (CTL), and hardware related (HS); it is found that more than 25 percent of software failures occur in the hardware/software interface. Measurements show that results on software reliability cannot be considered representative unless the system workload is taken into account. For example, it is shown that the risk of a software failure increases in a nonlinear fashion with the amount of interactive processing, as measured by parameters such as the paging rate and the amount of overhead (operating system CPU time). The overall CPU execution rate, although measured to be close to 100 percent most of the time, is not found to correlate strongly with the occurrence of failures. The paper discusses possible reasons for the observed workload failure dependency based on detailed investigations of the failure data.
Error Sensitive Test Cases Analysis (ESTCA)
Authors: K. A. Foster
Venue: IEEE Transactions on Software Engineering (1980)

A hardware failure analysis technique adapted to software yielded three rules for generating test cases sensitive to code errors. These rules, and a procedure for generating these cases, are given with examples. Areas for further study are recommended.
L2 Cache Modeling for Scientific Applications on Chip Multi-Processors
Authors: Fengguang Song, Shirley Moore, Jack Dongarra
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

It is critical to provide high performance for scientific applications running on Chip Multi-Processors (CMP). A CMP architecture often comprises a shared L2 cache and lower-level storages. The shared L2 cache can reduce the number of cache misses if the data are accessed in common by several threads, but it can also lead to performance degradation due to resource contention. Sometimes running threads on all cores can cause severe contention and increase the number of cache misses greatly. To investigate how the performance of a thread varies when running it concurrently with other threads on the remaining cores, we develop an analytical model to predict the number of misses on the shared L2 cache. In particular, we apply the model to thread-parallel numerical programs. We assume that all the threads compute homogeneous tasks and share a fully associative L2 cache. We use circular sequence profiling and stack processing techniques to analyze the L2 cache trace to predict the number of compulsory cache misses, capacity cache misses on shared data, and capacity cache misses on private data, respectively. Our method is able to predict the L2 cache performance for threads that have a global shared address space. For scientific applications, threads often have overlapping memory footprints. We use a cycle accurate simulator to validate the model with three scientific programs: dense matrix multiplication, blocked dense matrix multiplication, and sparse matrix-vector product. The average relative errors for the three experiments are 8.01%, 1.85%, and 2.41%, respectively.
Nebula: A New Architecture and its Relationship to Computer Hardware
Authors: L. Szewerenko
Venue: Computer (1981)

The Nebula architecture of the military computer family provides, through carefully controlled visibility properties, both the flexibility to incorporate hardware advances and compatibility among family members.
Hand geometry identification without feature extraction by general regression neural network
Authors: Övünç Polat, Tülay Yıldırım
Venue: Expert Systems with Applications: An International Journal (2008)

This paper presents an approach to automatically recognize hand geometry pattern based on a database. The system does not require any feature extraction stage before the identification. General regression neural networks are used for the classification and/or verification of the patterns. Simulation results show that hand geometry pattern identification by the proposed method improves the identification rate considerably. To show the system performance, false acceptance ratio and false rejection ratio are given.
Displays on Display
Venue: IEEE Computer Graphics and Applications (1982)

"Cross-section of the axoneme." This picture, produced by Alan H. Barr at RPI's Center for Interactive Computer Graphics, shows the 9 + 2 structure of the axoneme-the motive structure of a cilium or flagellum, which allows a eucaryotic cell to generate the fluid flow used for feeding and locomotion. The ratchetlike activity of the white dynein arms, or cross-bridges, is transformed into a sliding motion between the microtubular doublets (shown in yellow and purple). The arms are attached to the tubulin-A (purple) part of the doublet, and they walk along the tubulin-B (yellow) part of the adjacent doublet. This sliding motion is converted into the bending motion used for swimming and feeding via the geometric linkage of cross-bridges. 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
Surface Integration: Two Statistical Approaches
Authors: WIlliam A. P. Smith, Edwin R. Hancock
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper we show how statistical constraints can be incorporated into the surface integration process. This problem aims to reconstruct the surface height function from a noisy field of surface normals. We propose two methods that employ a statistical model that captures variations in surface height. The first uses a coupled model that captures the variation in a training set of face surfaces in both the surface normal and surface height domain. The second is based on finding the parameters of a surface height model directly from a field of surface normals. We present experiments on ground truth face data and compare the results of the two methods with an existing surface integration technique.