ppxscal/embedding_network huggingface dataset:
Colour Representation in Lateral Geniculate Nucleus and Natural Colour Distributions
Authors: Naokazu Goda, Kowa Koida, Hidehiko Komatsu
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

We investigated the representation of a wide range of colours in the lateral geniculate nucleus (LGN) of macaque monkeys. We took an approach to reconstruct a colour space from responses of a population of neurons. We found that, in the derived colour space (`LGN colour space'), red and blue regions were compressed whereas purple region was expanded, compared with those in a linear cone-opponent colour space. We found that the expanding/compressing pattern in the LGN colour space was related to the colour histogram derived from a natural image database. Quantitative analysis showed that the response functions of the population of the neurons were nearly optimal according to the principle of 'minimizing errors in estimation of stimulus colour in the presence of response noise'. Our findings support the idea that the colour representation at the early neural processing stage is adapted for efficient coding of colour information in the natural environment.
Unsupervised categorization (filtering) of Google images based on visual consistency
Authors: Pooyan Fazli, Ara Bedrosian
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

The objective of this paper is to study the existing methods for unsupervised object recognition and image categorization and propose a model that can learn directly from the output of image search engines, e.g. Google Images, bypassing the need to manually collect large quantities of training data. This model can then be used to refine the quality of the image search, or to search through other sources of images. This integrated scheme has been implemented and optimized to be used in The Semantic Robot Vision Challenge as a new test-bed for research in the areas of image understanding and knowledge retrieval in large unstructured image databases.
Development of Non-contact Monitoring System of Heart Rate Variability (HRV) - An Approach of Remote Sensing for Ubiquitous Technology -
Authors: Satoshi Suzuki, Takemi Matsui, Shinji Gotoh, Yasutaka Mori, Bonpei Takase, Masayuki Ishihara
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

The aim of this study was to develop a prototype system to monitor cardiac activity using microwave Doppler radar (24.05 GHz frequency, 7 mW output power in average) without making contact with the body and without removing clothing; namely, a completely noncontact, remote monitoring system. In addition, heart rate and changes in heart rate variability (HRV) during simple mental arithmetic and computer input tasks were observed with the prototype system. The experiment was conducted with seven subjects (23.00 ± 0.82 years old). We found that the prototype system captured heart rate and HRV precisely. The strong relationship between the heart rates during tasks (r = 0.963), LF (cross-correlation = 0.76) and LF/HF (cross-correlation = 0.73) of HRV calculated from the microwave radar data and from electrocardiograph (ECG) measurements were confirmed.
An Observation Study of the Aerosol Distribution over Hebei Area through Aircraft Detection
Authors: Deng Wei, Yin Yan, Shi Lin-Xin, Duan Ying
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

Measurements of aerosol and cloud condensation (CCN) concentration at 0.3% supersaturation were made onboard by weather modification office over the Hebei area during May 2005 to October2008. The vertical distributions of aerosol particles and CCN were analyzed in different underlying surface. There are three cities, Shijiazhuang, Handan, Xingtai and Bohaiwan (the bay of Bohai). The vertical distributions of aerosol and CCN were fit to exponential distribution in May and September, but not fit in October for the haze pollution. Whether the CCN formed from aerosol is determined by aerosol average diameter in the land while the CCN concentration over the sea was determined by the aerosol concentration.
Mathematical Model of HIV Superinfection and Comparative Drug Therapy
Authors: Anil Sorathiya, Pietro Liò, Luca Sguanci
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

We have modeled the within-patient evolutionary process during HIV infection. During the HIV infection several quasispecies of the virus arise. These quasispecies are able to use different coreceptors, in particular the CCR5 and CXCR4 (R5 and X4 phenotypes, respectively). The switch in coreceptor usage has been correlated with a faster progression of the disease to the AIDS phase. As several pharmaceutical companies are getting ready to start large phase III trials for their R5 blocking drugs, models are needed to predict the co-evolutionary and competitive dynamics of virus strains. Moreover, we have considered CTLs response and effect of TNF. We present a model of HIV early infection and CTLs response which describes the dynamics of R5 quasispecie and a model of HIV late infection, specifying the R5 to X4 switch and effect of immune response. We report the following findings: quasispecies dynamics after superinfection or coinfection have time scales of several months and become even slower in presence of the CTLs response. In addition, we illustrate dynamics of HIV quasispecies on HAART, Maraviroc and Zinc-finger nucleases(ZFN) therapies. Our model represents a general framework to study the mutation and distribution of HIV quasispecies during disease progression, and can be used to design vaccines and drug therapies.
Designing a Lighting with Pleasure
Authors: Tyan-Yu Wu, Wen-Chih Chang, Yuan-Hao Hsu
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Lighting plays an important role in the enhancement of atmosphere in a house. It provides not only a luminous function, but also experiencing pleasure in the space. This study investigated the type of pleasure and its factors towards lighting. An interview was conducted to collect the responses of pleasurable feelings from 10 participants. From 250 images, 10 were extracted as stimuli for the interviews. Data analysis was used to group key sentences obtained from the responses and the results produced 7 factors which could be categorized into four types of pleasure: Appearance, Interactive, Reflective, and Novelty Pleasure. Among them, the responses related to appearance pleasure were mentioned most frequently and could elicit a consumer's pleasure, which also confirm Creusen's theory. The four pleasures can associate with Jordan and Norman's pleasure/ emotion. Particularly mentioned, novelty pleasure is distinguished from other two theories. Designer can utilize four types of pleasure in designing a lighting with pleasure as possible.
Scaling up: solving POMDPs through value based clustering
Authors: Yan Virin, Guy Shani, Solomon Eyal Shimony, Ronen Brafman
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Partially Observable Markov Decision Processes (POMDPs) provide an appropriately rich model for agents operating under partial knowledge of the environment. Since finding an optimal POMDP policy is intractable, approximation techniques have been a main focus of research, among them point-based algorithms, which scale up relatively well - up to thousands of states. An important decision in a point-based algorithm is the order of backup operations over belief states. Prioritization techniques for ordering the sequence of backup operations reduce the number of needed backups considerably, but involve significant overhead. This paper suggests a new way to order backups, based on a soft clustering of the belief space. Our novel soft clustering method relies on the solution of the underlying MDP. Empirical evaluation verifies that our method rapidly computes a good order of backups, showing orders of magnitude improvement in runtime over a number of benchmarks.
On multivariate binary data clustering and feature weighting
Authors: Nizar Bouguila
Venue: Computational Statistics Data Analysis (2010)

This paper presents an approach that partitions data sets of unlabeled binary vectors without a priori information about the number of clusters or the saliency of the features. The unsupervised binary feature selection problem is approached using finite mixture models of multivariate Bernoulli distributions. Using stochastic complexity, the proposed model determines simultaneously the number of clusters in a given data set composed of binary vectors and the saliency of the features used. We conduct different applications involving real data, document classification and images categorization to show the merits of the proposed approach.
Text summarization model based on maximum coverage problem and its variant
Authors: Hiroya Takamura, Manabu Okumura
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We discuss text summarization in terms of maximum coverage problem and its variant. We explore some decoding algorithms including the ones never used in this summarization formulation, such as a greedy algorithm with performance guarantee, a randomized algorithm, and a branch-and-bound method. On the basis of the results of comparative experiments, we also augment the summarization model so that it takes into account the relevance to the document cluster. Through experiments, we showed that the augmented model is superior to the best-performing method of DUC'04 on ROUGE-1 without stopwords.
User Behavior Mining for On-Line GUI Adaptation
Authors: Wei Pan, Yiqiang Chen, Junfa Liu
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

On-Line Graphics User Interface (GUI) Adaptation technology, which can predict and highlight user's next operation in menu based graphics interface, is the key problem in next generation pervasive human computer interaction, especially for remote control device like Wiimote assisting TV interaction. In this paper, a hierarchical Markov model is proposed for mining and predicting user's behavior from Wiimote control sequence. The modal can be on-line updated and highlight the next possible operation and then improve the system's usability. We setup our experiments on asking several volunteers to manipulate one real education web site and its embedded media player. The results shows our modal can make their interaction with GUI more convenient when using Wii for remote control.
Design of Discriminant Model on Enterprise's Life Cycle
Authors: Hongsong Liang, Huifeng Xu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

The article builds the quantitative identified model of enterprise's life cycle stage based on the five-scale, and has fuzzy math as the study tool, has P, A, E, I as the four main elements. First of all, it analyses the subordinations of P, A, E, I, recognizes the stages of enterprise's life cycle by fuzzy mathematics, builds subordinations model of single-factor based on the five-scale. Second, it builds PAEI model of multi-factor based on single-factor. Finally, it identifies HBC's current life cycle stage.
Towards Navigation Summaries: Automated Production of a Synopsis of a Robot Trajectories
Authors: Gregory Dudek, John-Paul Lobos
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In this paper we describe an approach to computing a navigation summary:a visual synopsis of the notable images that characterize a trajectory. We use a combination of PCA and supplementary features to ensure both convergeof the trajectory and appearance spaces. The results obtained from a series of experiments are promising and provide us with a method to index and classify video footage from our robot.
CGD --- A New Algorithm to Optimize Space Occupation in Ellimaps
Authors: Benoît Otjacques, Maël Cornil, Monique Noirhomme, Fernand Feltz
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

How to visualize datasets hierarchically structured is a basic issue in information visualization. Compared to the common diagrams based on the nodes-links paradigm (e.g. trees), the enclosure-based methods have shown high potential to represent simultaneously the structure of the hierarchy and the weight of nodes. In addition, these methods often support scalability up to sizes where trees become very complicated to understand. Several approaches belong to this class of visualization methods such as treemaps, ellimaps, circular treemaps or Voronoi treemaps. This paper focuses on the specific case of ellimaps in which the nodes are represented by ellipses nested one into each other. A controlled experiment has previously shown that the initial version of the ellimaps was efficient to support the perception of the dataset structure and was reasonably acceptable for the perception of the node weights. However it suffers from a major drawback in terms of display space occupation. We have tackled this issue and the paper proposes a new algorithm to draw ellimaps. It is based on successive distortions and relocations of the ellipses in order to occupy a larger proportion of the display space than the initial algorithm. A Monte-Carlo simulation has been used to evaluate the filling ratio of the display space in this new approach. The results show a significant improvement of this factor.
A new algorithm for generating equilibria in massive zero-sum games
Authors: Martin Zinkevich, Michael Bowling, Neil Burch
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in the same light: most consider Go or Chess to be more complex than Monopoly. In this paper, we discuss a new measure of game complexity that links existing state-of-the-art algorithms for computing approximate equilibria to a more human measure. In particular, we consider the range of skill in a game, i.e. how many different skill levels exist. We then modify existing techniques to design a new algorithm to compute approximate equilibria whose performance can be captured by this new measure. We use it to develop the first near Nash equilibrium for a four round abstraction of poker, and show that it would have been able to win handily the bankroll competition from last year's AAAI poker competition.
Affective Technology, Affective Management, towards Affective Society
Authors: Hiroyuki Umemuro
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

In this paper, the term affective is defined as "being capable to evoke affects in people's mind" or "being capable to deliberate affects to be evoked in people's mind". This paper discusses potential impact of concept of affectiveness on development of technological products and services, management, and value systems of societies.
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
Authors: Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
Venue: Theoretical Computer Science (2009)

In the minimum-degree minimum spanning tree (MDMST) problem, we are given a graph G, and the goal is to find a minimum spanning tree (MST) T, such that the maximum degree of T is as small as possible. This problem is NP-hard and generalizes the Hamiltonian path problem. We give an algorithm that outputs an MST of degree at most 2@D"o"p"t" (G)+o(@D"o"p"t" (G)), where @D"o"p"t" (G) denotes the degree of the optimal tree. This result improves on a previous result of Fischer [T. Fischer, Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept. of Computer Science, Cornell University, Ithaca, NY, 1993] that finds an MST of degree at most b@D"o"p"t" (G)+log"bn, for any b>1. The MDMST problem is a special case of the following problem: given a k-ary hypergraph G=(V,E) and weighted matroid M with E as its ground set, find a minimum-cost basis (MCB) T of M such that the degree of T in G is as small as possible. Our algorithm immediately generalizes to this problem, finding an MCB of degree at most k^2@D"o"p"t" (G,M)+O(kk@D"o"p"t" (G,M)). We use the push-relabel framework developed by Goldberg [A. V. Goldberg, A new max-flow algorithm, Technical Report MIT/LCS/TM-291, Massachusetts Institute of Technology, 1985 (Technical Report)] for the maximum-flow problem. To our knowledge, this is the first use of the push-relabel technique in an approximation algorithm for an NP-hard problem. The MDMST problem is closely connected to the bounded-degree minimum spanning tree (BDMST) problem. Given a graph G and degree bound B on its nodes, the BDMST problem is to find a minimum cost spanning tree among the spanning trees with maximum degree B. Previous algorithms for this problem by Konemann and Ravi [J. Konemann, R. Ravi, A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees, SIAM Journal on Computing 31(6) (2002) 1783-1793; J. Konemann, R. Ravi, Primal-dual meets local search: Approximating MST's with nonuniform degree bounds, in: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, 2003, pp. 389-395] and by Chaudhuri et al. [K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar, What would Edmonds do? Augmenting paths and witnesses for bounded degree MSTs, in: Proceedings of APPROX/RANDOM, 2005, pp. 26-39] incur a near-logarithmic additive error in the degree. We give the first BDMST algorithm that approximates both the degree and the cost to within a constant factor of the optimum. These results generalize to the case of nonuniform degree bounds.
Determinants of Participation in Global Volunteer Grids: A Cross-Country Analysis
Authors: Junseok Hwang, Jörn Altmann, Ashraf Bany Mohammed
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

Volunteer Grids, in which users share computing resources altruistically, play a critical role in fostering research. Sharing and collaboration in Volunteer Grids is determined by many factors. These determinants define the participation in Grids and the amount of contribution to such Grids. Whereas previous studies focused on explaining researchers' and countries' willingness to share resources in Volunteer Grids based on social sharing theory, this research argues that without the appropriate technological capabilities, countries or researcher cannot implement their willingness. Based on the literature review, this paper defines the influential determinants for participating in global Volunteer Grids. Besides, this research employs a multiple regression analysis of these determinants, using a total of 130 observations collected from international data repositories. Our results show that R D and Internet connection type (broadband or dial-up) are significant determinates for participating in Volunteer Grids. This result explains why developed countries are active and enjoy the benefits from Volunteer Grids, while developing countries still lag behind. Therefore, an increased participation in Grids cannot be solely achieved by interconnecting with developing countries through high-speed Internet backbones.
Application of Meta Sets to Character Recognition
Authors: Bartłomiej Starosta
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

A new approach to character recognition problem, based on meta sets, is introduced and developed. For the given compound character pattern consisting of a number of character samples accompanied by their corresponding quality degrees, and for the given testing character sample, the main theorem of the paper gives means to evaluate the correlation between the testing sample and the compound pattern. It also enables calculation of similarity degrees of the testing sample to each pattern element. The quality degrees and the correlation are expressed by means of membership degrees of meta sets representing samples in the meta set representing the compound pattern. The similarity degrees are expressed as equality degrees of these meta sets.The meta set theory is a new alternative to the fuzzy set theory. By the construction of its fundamental notions it is directed to efficient computer implementations. This paper presents an example of application of the theory to a real-life problem.
Medical Image Retrieval in Private Network Based on Dynamic Fuzzy Data Model and Wavelet Entropy
Authors: Guangming Zhang, Zhiming Cui, Jian Wu
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

By analyzing the characters of CT medical image, this paper proposes a new model for CT medical image retrieval, which is using dynamic fuzzy logic and wavelet information entropy. Firstly, the image was decomposed by 2-D discrete wavelet transform to obtain the different level information. Then the entropy from low-frequency subband of CT medical image was calculated, and a membership function based on dynamic fuzzy logic was constructed to adjust the weight for image attribute. At last a model was constructed to obtain the similarity parameter by order for CT image retrieval. The efficiency of our model indicate it is very adaptive to the medical image retrieval in nosocomial private network.
MARIA: A universal, declarative, multiple abstraction-level language for service-oriented applications in ubiquitous environments
Authors: Fabio Paterno', Carmen Santoro, Lucio Davide Spano
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2009)

One important evolution in software applications is the spread of service-oriented architectures in ubiquitous environments. Such environments are characterized by a wide set of interactive devices, with interactive applications that exploit a number of functionalities developed beforehand and encapsulated in Web services. In this article, we discuss how a novel model-based UIDL can provide useful support both at design and runtime for these types of applications. Web service annotations can also be exploited for providing hints for user interface development at design time. At runtime the language is exploited to support dynamic generation of user interfaces adapted to the different devices at hand during the user interface migration process, which is particularly important in ubiquitous environments.