ppxscal/embedding_network huggingface dataset:
Robust Estimation of Reflectance Functions from Polarization
Authors: Gary A. Atkinson, Edwin R. Hancock
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper presents a new approach to image-based reflectance function estimation. The method first uses Fresnel theory for reflection and polarization analysis to estimate the surface orientation for each image pixel from a single view. The method is confined to the case where the light source and camera lie in the same direction from the target. A 2D histogram of surface zenith angles and pixel intensities is then calculated. This histogram is processed using a robust and computationally efficient statistical analysis. Histogram data are fitted to probability density functions to deduce the reflectance function. Objects of varying complexity and material are analysed and compared to ground truth.
An Interactive Debugging Environment
Authors: Frits van Der Linden, Ian Wilson
Venue: IEEE Micro (1985)

A Forthinspired debug language, Fifth, provides an environment in which testing and debugging time is signifcantly reduced.
Some Aspects of a Complexity Theory for Continuous Time Systems
Authors: Marco Gori, Klaus Meer
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

In this paper we survey previous work by the authors defining a complexity measure for certain continuous time systems. Starting point are energy functions of a particular structure. Global minimizers of such energies correspond to solutions of a given problem, for example an equilibrium point of an ordinary differential equation. The structure of such energies is used to define complexity classes for continuous problems and to obtain completeness results for those classes. We discuss as well algorithmic aspects of minimizing energy functions.
Usability and Accessibility on the Internet: Effects of Accessible Web Design on Usability
Authors: Wolfram Huber, Peter Vitouch
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Despite the overlapping scope and aims of web-usability and web-accessibility (such as problems in using the web and the barriers in accessing the web) threre are only few studies which analyse the connections between the two areas. The present study investigates the relationship between web-accessibility and web-usability. To analyse this relationship we have designed an online test environment. We developed three complete internet presences (testportals), each one with a different level of accessibility. 131 test users were recruited viewed these three testportals and rated their usability. The instrument to evaluate usability was an especially modified and reduced version of the Web Usability Index (WUI) which was made available online in the form of a questionnaire. The central question this study sought to answer was: is there a difference in the usability ratings between websites with different levels of accessibility? The findings resulting from the central question were clear. The mean values show a significant difference in the usability ratings of the three portals. Other question our study sought to answer were the influences of the disability and the age factors. These influences are partly significant.
A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints
Authors: Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich
Venue: Constraints (2008)

We consider a class of production/inventory control problems that has a single product and a single stocking location, for which a stochastic demand with a known non-stationary probability distribution is given. Under the widely-known replenishment cycle policy the problem of computing policy parameters under service level constraints has been modeled using various techniques. Tarim and Kingsman introduced a modeling strategy that constitutes the state-of-the-art approach for solving this problem. In this paper we identify two sources of approximation in Tarim and Kingsman's model and we propose an exact stochastic constraint programming approach. We build our approach on a novel concept, global chance-constraints, which we introduce in this paper. Solutions provided by our exact approach are employed to analyze the accuracy of the model developed by Tarim and Kingsman.
Animal navigation: general properties of directed walks
Authors: Allen Cheung, Shaowu Zhang, Christian Stricker, Mandyam V. Srinivasan
Venue: Biological Cybernetics (2008)

The ability to locomote is a defining characteristic of all animals. Yet, all but the most trivial forms of navigation are poorly understood. Here we report and discuss the analytical results of an in-depth study of a simple navigation problem. In principle, there are two strategies for navigating a straight course. One is to use an external directional reference and to continually reorient with reference to it. The other is to monitor body rotations from internal sensory information only. We showed previously that, at least for simple representations of locomotion, the first strategy will enable an animal or mobile agent to move arbitrarily far away from its starting point, but the second strategy will not do so, even after an infinite number of steps. This paper extends and generalizes the earlier results by demonstrating that these findings are true even when a very general model of locomotion is used. In this general model, error components within individual steps are not independent, and directional errors may be biased. In the absence of a compass, the expected path of a directed walk in general approximates a logarithmic spiral. Some examples are given to illustrate potential applications of the quantitative results derived here. Motivated by the analytical results developed in this work, a nomenclature for directed walks is proposed and discussed. Issues related to path integration in mammals and robots, and measuring the curvature of a noisy path are also addressed using directed walk theory.
Implicit Detection of Hidden Processes with a Feather-Weight Hardware-Assisted Virtual Machine Monitor
Authors: Yan Wen, Jinjing Zhao, Huaimin Wang, Jiannong Cao
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Process hiding is a commonly used stealth technique which facilitates the evasion from the detection by anti-malware programs. In this paper, we propose a new approach called Aries to implicitly detect the hidden processes. Aries introduces a novel feather-weight hardware-assisted virtual machine monitor (VMM) to obtain the True Process List (TPL). Compared to existing VMM-based approaches, Aries offers three distinct advantages: dynamic OS migration, implicit introspection of TPL and non-bypassable interfaces for exposing TPL. Unlike typical VMMs, Aries can dynamically migrate a booted OS on it. By tracking the low-level interactions between the OS and the memory management structures, Aries is decoupled with the explicit OS implementation information which is subvertable for the privileged malware. Our functionality evaluation shows Aries can detect more process-hiding malware than existing detectors while the performance evaluation shows desktop-oriented workloads achieve 95.2% of native speed on average.
Best-Shot Selection for Video Face Recognition Using FPGA
Authors: Leonardo Chang, Ivis Rodés, Heydi Méndez, Ernesto Toro
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

Video face recognition is widely used for security surveillance and other applications in which the information about faces is extracted and processed. One of the problems usually present in video face recognition is to determine in real time the suitable images for the good performance of the algorithms, taking into account that although computers keep getting faster, the amount of information to process is higher than the capacity of image processing algorithms available. In this work we propose a method that allows to obtain in real time the best image of each person present in the scene from a sequence of images, considering both image and face characteristics, and using FPGA technology to accelerate the image processing. With the proposed implementation of the method we managed to process 37 times more images per second, and 97% of the selected images proved to be adequate for face recognition.
Pattern Discovery for High-Dimensional Binary Datasets
Authors: Václav Snášel, Pavel Moravec, Dušan Húsek, Alexander Frolov, Hana &#;344ezanková, Pavel Polyakov
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

In this paper we compare the performance of several dimension reduction techniques which are used as a tool for feature extraction. The tested methods include singular value decomposition, semi-discrete decomposition, non-negative matrix factorization, novel neural network based algorithm for Boolean factor analysis and two cluster analysis methods as well. So called bars problem is used as the benchmark. Set of artificial signals generated as a Boolean sum of given number of bars is analyzed by these methods. Resulting images show that Boolean factor analysis is upmost suitable method for this kind of data.
Acoustic Event Detection: SVM-Based System and Evaluation Setup in CLEAR'07
Authors: Andrey Temko, Climent Nadeu, Joan-Isaac Biel
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

In this paper, the Acoustic Event Detection (AED) system developed at the UPC is described, and its results in the CLEAR evaluations carried out in March 2007 are reported. The system uses a set of features composed of frequency-filtered band energies and perceptual features, and it is based on SVM classifiers and multi-microphone decision fusion. Also, the current evaluation setup and, in particular, the two new metrics used in this evaluation are presented.
Dependent Component Analysis: A Hyperspectral Unmixing Algorithm
Authors: José M. Nascimento, José M. Bioucas-Dias
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest.This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical properties of hyperspectral data.DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. The performance of the method is illustrated using simulated and real data.
Extended Recursive Filtering Estimation of Detector Offset Nonuniformity in Infrared Imaging Systems
Authors: César San-Martin, Jorge Pezoa, Sergio Torres, Pablo Meza, Diana Gutierrez
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In [1] we presented a recursive filter to estimate the detector offset nonuniformity (NU) noise present in infrared (IR) imaging systems. Such a filter was derived considering an estimation time-window short enough so that the offset NU can be regarded as a constant in noise. Since the offset NU is non-stationary, upon the arrival of new blocks of IR data new estimates of the offset NU have to be computed. In this paper, this recursive filter is extended by adding to the so-called intra-block processing (where offset NU is a constant) an inter-block processing algorithm. The inter-block processing algorithm considers the time varying effect in the offset NU and models it as a discrete-time Gauss-Markov random process. So, the extended filter is designed to compensate continuously for the NU when new blocks of frames arrive. In addition, the theoretical analysis of the estimator provides us expressions for selecting the appropriate parameters required by the algorithm. The ability of the method to compensate for the offset NU is demonstrated by employing several mid-wavelength IR video sequences.
Brief paper: Exponential stabilization controller design for interconnected time delay systems
Authors: Chang-Chun Hua, Qing-Guo Wang, Xin-Ping Guan
Venue: Automatica (Journal of IFAC) (2008)

Decentralized robust control problem is investigated for a class of large scale systems with time varying delays. The considered systems have mismatches in time delay functions. A state coordinate transformation is first employed to change the original system into a cascade system. Then the virtual linear state feedback controller is developed to stabilize the first subsystem. Based on the virtual controller, a memoryless state feedback controller is constructed for the second subsystem. By choosing new Lyapunov Krasovskii functional, we show that the designed decentralized continuous adaptive controller makes the solutions of the closed-loop system exponentially convergent to a ball, which can be rendered arbitrary small by adjusting design parameters. Finally, a numerical example is given to show the feasibility and effectiveness of the proposed design techniques.
Tuning Bandit Algorithms in Stochastic Environments
Authors: Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this paper we consider a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account the empirical variance of the different arms. In earlier experimental works, such algorithms were found to outperform the competing algorithms. The purpose of this paper is to provide a theoretical explanation of these findings and provide theoretical guidelines for the tuning of the parameters of these algorithms. For this we analyze the expected regret and for the first time the concentration of the regret. The analysis of the expected regret shows that variance estimates can be especially advantageous when the payoffs of suboptimal arms have low variance. The risk analysis, rather unexpectedly, reveals that except for some very special bandit problems, the regret, for upper confidence bounds based algorithms with standard bias sequences, concentrates only at a polynomial rate. Hence, although these algorithms achieve logarithmic expected regret rates, they seem less attractive when the risk of suffering much worse than logarithmic regret is also taken into account.
Resource Load Balancing Based on Multi-agent in ServiceBSP Model
Authors: Yan Jiang, Weiqin Tong, Wentao Zhao
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Based on ServiceBSP model, a resource load balancing algorithm with Multi-Agent is put forward in this paper which achieves the goal of dynamic load balancing and favorable fault-tolerant. The algorithm calculates the load value according to the status of usage of resources of a node and scheduling tasks relies on the load value, while updating the load information dynamically depending on Multi-Agent. The method also can avoid frequent communications on load information. Furthermore, the paper introduces the function of agents, relations and communications among agents in details. Finally, by comparing response time and distribution of load using proposed method with other available methods such as without no load balancing and load balancing only based on the usage of CPU, the experimental simulation shows that the load balancing based on Multi-Agent possesses superior performance on response time and load balancing.
Plenary lecture 2: decision support systems, human centric/centered computing, and computing
Authors: Janusz Kacprzyk
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

We start with a brief account of complex decision making problems, and advocate the use of modern approaches to real world decision making emphasizing the concept of a decision making process that involves more factors and aspects like: the use of explicit and tacit knowledge, intuition, individual habitual domains, non-trivial rationality, different paradigms, etc. We stress the need for computer based decision support systems that should exhibit some "intelligence" which is meant in an individual and collective perspective, and give an overview of main types of decision support systems. We present some new so-called computing paradigms that try to attain a synergy, and bridge the gap between the human user and computer systems that is mainly caused by the fact that natural language is the only fully natural means of communication and articulation for a human being but it is "strange" to the computer. We advocate the so-called: human centric computing, human centered computing, human computing, etc. that can help bridge this gap. Then, we present Zadeh's paradigm of computing with words (and perceptions) as a tool that may help bring computing closer to the human being by an explicit use of (quasi)natural language in many phases of computing, problem solving, etc. We indicate relations between the computing with words and human centric computing paradigms, and indicate - first - that the former can be viewed as an attempt at providing proper tools to implement the latter, and that both can play a crucial role in intelligent decision support systems. We show some implementations of using linguistic data summaries in a business context and show that they can be viewed as extremely human consistent data mining tools, notably for novice users.
Reliability Assessment of Ensemble Classifiers: Application in Mammography
Authors: Maciej A. Mazurowski, Jacek M. Zurada, Georgia D. Tourassi
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

In classifier ensembles predictions of different classifiers regarding a query are combined into one final decision. It was previously shown that using ensemble techniques can significantly improve classification performance. In this study we build upon this result and propose to use variability in the predictions of classifiers contributing to the final decision as an indicator of its reliability. The study hypothesis is tested with respect to previously proposed information-theoretic computer-aided decision (IT-CAD) system for detection of masses in mammograms. A database of 1820 regions of interest (ROIs) extracted from digital database of screening mammography (DDSM) is used. Experimental results show that the proposed reliability assessment successfully identifies decisions that can not be trusted. Further, a low correlation between reliability and the classifier output is noted. This opens a possibility of combining reliability and ensemble output into one improved decision.
High-Performance Concurrent Error Detection Scheme for AES Hardware
Authors: Akashi Satoh, Takeshi Sugawara, Naofumi Homma, Takafumi Aoki
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

This paper proposes an efficient concurrent error detection scheme for hardware implementation of the block cipher AES. The proposed scheme does not require an additional arithmetic unit, but simply divides the round function block into two sub-blocks and uses the sub-blocks alternately for encryption (or decryption) and error detection. The number of clock cycles is doubled, but the maximum operating frequency is increased owing to the shortened critical path of the sub-block. Therefore, the proposed scheme has a limited impact on hardware performance with respect to size and speed. AES hardware with the proposed scheme was designed and synthesized using a 90-nm CMOS standard cell library with size and speed optimization options. The compact and high-speed implementations achieved performances of 2.21 Gbps @ 16.1 Kgates and 3.21 Gbps @ 24.1 Kgates, respectively. In contrast, the performances of AES hardware without error detection were 1.66 Gbps @ 12.9 Kgates for the compact version and 4.22 Gbps @ 30.7 Kgates for the high-speed version. There is only a slight difference between the performances with and without error detection. The performance overhead caused by the error detection is evaluated at the optimal balance between size and speed and was estimated to be 14.5% at maximum. Conversely, the AES hardware with the proposed scheme had better performance in some cases. If pipeline operation is allowed, as in the CTR mode, throughputs can easily be boosted by further dividing the sub-blocks. Although the proposed error detection scheme was applied to AES in the present study, it can also be applied to other algorithms efficiently.
Expression Decomposition in a Rely/Guarantee Context
Authors: Joey W. Coleman
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

This paper describes a technique of expression decomposition which allows the use of rely/guarantee development rules that do not assume atomic expression evaluation. This decomposition provides a means of addressing the fact that the logical meaning of expressions relative to a single state and the semantic evaluation of expressions in a fine-grained concurrent language do not provide the same results; in particular, the former results in a single value whereas the latter can result in many possible values. Rely/guarantee development rules tend to depend on the logical meaning of expressions in cases where they are used; expression decomposition identifies where it is safe to do so, and provides some tools for where it is not.
Implementing Virtual Buffer for Electric Power Grids
Authors: Rong Gao, Lefteri H. Tsoukalas
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The electric power grid is a vital network for every aspect of our life. The lack of buffer between generation and consumption makes the power grid unstable and fragile. While large scale power storage is not technically and economically feasible at present stage, we argue that a virtual buffer could be effectively implemented through a demand side management strategy built upon the concept of dynamic data driven paradigm. An intelligent scheduling module implemented inside a smart meter enables customers to access electricity safely and economically. The managed use of electricity acts effectively as a buffer to provide the much needed stability for the power grid. Pioneering efforts intending to implement these concepts have been conducted by groups such as the Consortium for the Intelligent Management of Electric Grid. Progresses have been made and reported in this paper.
Driven by Compression Progress
Authors: Jürgen Schmidhuber
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data in a better way. Curiosity is the desire to create or discover more data that allows for compression progress. This drive motivates exploring infants, pure mathematicians, composers, artists, dancers, comedians, yourself, and recent artificial systems.