ppxscal/embedding_network huggingface dataset:
A Novel Image Compression Algorithm Using the Second Generation of Curvelet Transform and SVM
Authors: Yuancheng Li, Qiu Yang, Runhai Jiao
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper proposes a novel image compression algorithm which combines support vector machine (SVM) regression with curvelet transform. Firstly, the original image was decomposed into curvelet coefficients using fast discrete curvelet transform. Then different scales of quantized curvelet coefficients were selected for lossy compression and entropy encoding. For example, the lowest subband is encoded by differential pulse code modulation (DPCM) for including most image energy. The finer scale subbands are compressed by SVM regression, which approximates the curvelet coefficients using a fewer support vectors and weights. And some of the finer scale subbands are discarded directly because they only contain a little amount of energy and have little noticeable effect on the image quality. Compared with image compression method based on wavelet transform, experimental results show that the compression performance of our method gains much improvement. Moreover, the algorithm works fairly well for declining block effect at higher compression ratios.
Allocative efficiency of the mobile industry in India and its implications for spectrum policy
Authors: Rohit Prasad, Varadharajan Sridhar
Venue: Telecommunications Policy (2009)

This paper outlines the various stages of spectrum policy in India and highlights the underlying principle of maximal usage of spectrum advocated in the policy. It argues that allocative efficiency is a more appropriate policy measure and illustrates the absence of allocative efficiency in the Indian mobile industry. Possible causes of allocative inefficiency including insufficient spectrum allocation per operator, underpricing of spectrum, and inefficient use of the radio access network infrastructure are highlighted. Corresponding policy implications and prescriptions are discussed.
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
Authors: Ronen Shaltiel
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

A simple averaging argument shows that given a randomized algorithm $A$ and a function $f$ such that for every input $x$, $\Pr[A(x)=f(x)] \ge 1-\rho$ (where the probability is over the coin tosses of $A$), there exists a \emph{nonuniform} deterministic algorithm $B$ ``of roughly the same complexity'' such that $\Pr[B(x)=f(x)] \ge 1-\rho$ (where the probability is over a uniformly chosen input $x$). This implication is often referred to as ``the easy direction of Yao's lemma'' and can be thought of as ``weak derandomization'' in the sense that $B$ is deterministic but only succeeds on most inputs. The implication follows as there exists a fixed value $r'$ for the random coins of $A$ such that ``hardwiring $r'$ into $A$'' produces a deterministic algorithm $B$. However, this argument does not give a way to \emph{explicitly construct} $B$. In this paper we consider the task of proving \emph{uniform versions} of the implication above. That is, how to \emph{explicitly construct} a deterministic algorithm $B$ when given a randomized algorithm $A$. We prove such derandomization results for several classes of randomized algorithms. These include: randomized communication protocols, randomized decision trees (here we improve a previous result by Zimand), randomized streaming algorithms and randomized algorithms computed by polynomial size constant depth circuits. Our proof uses an approach suggested by Goldreich and Wigderson and ``extracts randomness from the input''. We show that specialized (seedless) extractors can produce randomness that is in some sense not correlated with the input. Our analysis can be applied to \emph{any} class of randomized algorithms as long as one can explicitly construct the appropriate extractor. Some of our derandomization results follow by constructing a new notion of seedless extractors that we call ``extractors for recognizable distributions'' which may be of independent interest.
Computer Orchestration Tips and Tricks
Authors: Stephen Bennett
Venue:  (2009)

Create realistic sounding orchestras on your computer Little or no musical notation knowledge needed Create scores for real players to read Tips and tricks to get the best out of your software All you need to orchestrate on computer Using modern technology, composers no longer need to wait until an orchestra plays their score to hear what their music will actually sound like. Using a computer and suitable software, it's possible for anyone to produce high-quality results that can be used for music CDs, film and TV scores - or even as a basis of a recording session using orchestral players. Many musicians would like to add synthetic orchestral colour to their work but are often left feeling frustrated that their first attempts don't sound very realistic or that the techniques needed will be too difficult to learn. This book is aimed at those with little or not understanding of music notation. It gives the reader a basic understanding or the principles of orchestration and offers tips and techniques to help get the best simulated orchestral performance out of their equipment. 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
Blind Equalization Based on a Class of Genetic Algorithms for Wireless Communication
Authors: Xu Gang, Lu Yourong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In this paper, a class of genetic algorithms (GA) is implemented as solutions to optimize the problem of blind equalization in wireless communication. Cost functions in blind equalization algorithms are described as fitness functions in GA; and because of the Characteristics of GA, the algorithm can search for the globe optimal equalizer weight vector. Another advantage is that researchers do not need to know the mathematic describe model. All those algorithms choose different fitness functions and based on GA belong to a same class. Both analyze and simulation result express the convergence and performance in this method are approximate to the equalization result with training sequence; and are much better than common linear blind equalization. Especially this method can be used in the non-linear equalization environment.
Stable Interface Conditions for Discontinuous Galerkin Approximations of Navier-Stokes Equations
Authors: Arunasalam Rahunanthan, Dan Stanescu
Venue: Journal of Scientific Computing (2009)

A study of boundary and interface conditions for Discontinuous Galerkin approximations of fluid flow equations is undertaken in this paper. While the interface flux for the inviscid case is usually computed by approximate Riemann solvers, most discretizations of the Navier-Stokes equations use an average of the viscous fluxes from neighboring elements. The paper presents a methodology for constructing a set of stable boundary/interface conditions that can be thought of as "viscous" Riemann solvers and are compatible with the inviscid limit.
Using Collectionlinks and Documents as Context for INEX 2008
Authors: Delphine Verbyst, Philippe Mulhem
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

We present in this paper the work of the Information Retrieval Modeling Group (MRIM) of the Computer Science Laboratory of Grenoble (LIG) at the INEX 2008 Ad Hoc Track. We study here the use of non structural relations between document elements (doxels) in conjunction with document/doxel structural relationships. The non structural links between doxels of the collection come from the collectionlink doxels. We characterize the non structural relations with relative exhaustivity and specificity scores. Results of experiments on the test collection are presented. Our best run is in the top 5 for iP[0.01] values for the Focused Task.
Decoding Color Structured Light Patterns with a Region Adjacency Graph
Authors: Christoph Schmalz
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

We present a new technique for decoding color stripe or color checkerboard patterns as often used for single-shot 3d range data acquisition with structured light. The key idea is to segment the camera image into superpixels with a watershed transform. We then describe a new algorithm that constructs a regions adjacency graph and uses it to solve the correspondence problem. This is an improvement over existing scanline based evaluation methods as the spatial coherence assumption can be relaxed. It allows to measure non-smooth objects that have so far posed problems for single-shot acquisition. The algorithm works in near real time even in uncontrolled environments. Experimental results are given. 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
An approximate 0-1 edge-labeling algorithm for constrained bin-packing problem
Authors: Ho Soo Lee, Mark Trumbo
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

This paper describes a constrained bin-packing problem (CBPP) and an approximate, anytime algorithm for solutions. A CBPP is a constrained version of the bin-packing problem, in which a set of items allocated to a bin are ordered in a way to satisfy constraints defined on them and achieve near-optimality. The algorithm for CBPP uses a heuristic search for labeling edges with a binary value, together with a beam search and constraint propagation. Some experimental results are provided. This algorithm has been successfully applied to industrial-scale scheduling problems.
Comprehending and generating apt metaphors: a web-driven, case-based approach to figurative language
Authors: Tony Veale, Yanfen Hao
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Examples of figurative language can range from the explicit and the obvious to the implicit and downright enigmatic. Some simpler forms, like simile, often wear their meanings on their sleeve, while more challenging forms, like metaphor, can make cryptic allusions more akin to those of riddles or crossword puzzles. In this paper we argue that because the same concepts and properties are described in either case, a computational agent can learn from the easy cases (explicit similes) how to comprehend and generate the hard cases (nonexplicit metaphors). We demonstrate that the markedness of similes allows for a large case-base of illustrative examples to be easily acquired from the web, and present a system, called Sardonicus, that uses this case-base both to understand property-attribution metaphors and to generate apt metaphors for a given target on demand. In each case, we show how the text of the web is used as a source of tacit knowledge about what categorizations are allowable and what properties are most contextually appropriate. Overall, we demonstrate that by using the web as a primary knowledge source, a system can achieve a robust and scalable competence with metaphor while minimizing the need for handcrafted resources like WordNet.
What Do Users Want to See? A Content Preparation Study for Consumer Electronics
Authors: Yinni Guo, Robert W. Proctor, Gavriel Salvendy
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

To investigate what users want to see from consumer electronic devices, a content preparation study was conducted. A questionnaire was constructed based on the results from web site content research and traditional usability studies on consumer electronics, and was completed by 401 Chinese participants. The statistical results reveal that there are nine major factors of cell phone content. Also users of different age and gender have different requirements for cell phone content, especially concerning accessory and multimedia functions. This study suggests guidelines for cell phone designers targeted at the Chinese market, as well as a base for content study of other consumer electronics.
Multi-fiber Reconstruction from DW-MRI Using a Continuous Mixture of Hyperspherical von Mises-Fisher Distributions
Authors: Ritwik Kumar, Baba C. Vemuri, Fei Wang, Tanveer Syeda-Mahmood, Paul R. Carney, Thomas H. Mareci
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

Multi-fiber reconstruction has attracted immense attention lately in the field of diffusion weighted MRI analysis. Several mathematical models have been proposed in literature but there is still scope for improvement. The key issues of importance in multi-fiber reconstruction are, fiber detection accuracy, robustness to noise and computational efficiency. To this end, we propose a novel mathematical model for representing the MR signal attenuation in the presence of multiple fibers at a single voxel and estimate the parameters of this model given the diffusion weighted MRI data. Our model for the diffusion MR signal consists of a continuous mixture of Hyperspherical von Mises-Fisher distributions. Being a continuous mixture, our model does not require the specification of the number of mixture components. We present a closed form expression for this continuous mixture that leads to a computationally efficient implementation. To validate our model we present extensive results on both synthetic and real data (human and rat brain) and demonstrate that even in presence of noise, our model clearly outperforms the state-of-the-art methods in fiber orientation estimation while maintaining a substantial computational advantage.
VideoTicket: detecting identity fraud attempts via audiovisual certificates and signatures
Authors: D. Nali, P. C. van Oorschot, A. Adler
Venue: Proceedings of the 2007 Workshop on New Security Paradigms (2008)

Identity fraud (IDF) may be defined informally as exploitation of credential information using some form of impersonation or misrepresentation of identity, in the context of transactions. Thus, IDF may be viewed as a combination of two old problems: user authentication and transaction authorization. We propose an innovative approach to detect IDF attempts, by combining av-certificates (digitally-signed audiovisual recordings in which users identify themselves) with av-signatures (audiovisual recordings showing users' explicit consent for unique transaction details). Av- certificates may be used in on-site transactions, to confirm user identity. In the case of remote (e.g. web-based) transactions, both av-certificates and av-signatures may be used to authenticate users and verify their consent for transaction details. Conventional impersonation attacks, whereby credentials (e.g. passwords, biometrics, or signing keys) are used without the consent of their legitimate users, fail against VideoTicket. The proposed solution assumes that identity thieves have access to such credentials.
Researches of the Industrial Wasteland Tourism in China
Authors: Lifang Qiao, Yichuan Zhang, Xinzheng Li, Lili Song, Da Mao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Industrial wasteland tourism has rapidly developed in China. In this review, we discussed the progress in tourism resources and tourism planning, including value evaluation of tourism resources, resources and products development, development orientation of tourism, tourism landscape planning method and technology, and the international successful cases. The results show that in contrast to other tourism fields, industrial wasteland tourism is late-formed, with deficiencies for instance the application of mathematical method and the comprehensive development plan of tourism products. It should pay more attention to the following aspects in future studies: quantitative evaluation of tourism resources, the economic and sociological research of industrial wasteland tourism, and the application of landscape ecology and ecology, landscape planning and structure-controlling.
Evolving self-assembly in autonomous homogeneous robots: Experiments with two physical robots
Authors: Christos Ampatzis, Elio Tuci, Vito Trianni, Anders Lyhne Christensen, Marco Dorigo
Venue: Artificial Life (2009)

This research work illustrates an approach to the design of controllers for self-assembling robots in which the self-assembly is initiated and regulated by perceptual cues that are brought forth by the physical robots through their dynamical interactions. More specifically, we present a homogeneous control system that can achieve assembly between two modules (two fully autonomous robots) of a mobile self-reconfigurable system without a priori introduced behavioral or morphological heterogeneities. The controllers are dynamic neural networks evolved in simulation that directly control all the actuators of the two robots. The neurocontrollers cause the dynamic specialization of the robots by allocating roles between them based solely on their interaction. We show that the best evolved controller proves to be successful when tested on a real hardware platform, the swarm-bot. The performance achieved is similar to the one achieved by existing modular or behavior-based approaches, also due to the effect of an emergent recovery mechanism that was neither explicitly rewarded by the fitness function, nor observed during the evolutionary simulation. Our results suggest that direct access to the orientations or intentions of the other agents is not a necessary condition for robot coordination: Our robots coordinate without direct or explicit communication, contrary to what is assumed by most research works in collective robotics. This work also contributes to strengthening the evidence that evolutionary robotics is a design methodology that can tackle real-world tasks demanding fine sensory-motor coordination.
Social Capital and Cognitive Bias: An Empirical Study of China
Authors: Baoshan Ge, Dongming Yu
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Social capital and cognition are crucial to opportunity identification in entrepreneurship. But there is a vast theoretical and empirical literature that poses the question of why some exploit opportunities and some do not. The possible reason lies in entrepreneur’s cognitive bias. Based on the work of Carolis and Saparito, we use 177 samples to test the relationship between social capital and cognitive bias. After empirical study, we find that trust, strong ties and shared codes and languages are positively related to overconfidence, representativeness and illusion of control respectively. Finally, we discuss the implications for future research.
Supporting Cognitive Collage Creation for Pedestrian Navigation
Authors: Augustinus H. Oomes, Miroslav Bojic, Gideon Bazen
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

How can we assist people in efficiently finding their way around a novel area? We tested a prototype navigation support system with 10 elderly pedestrians and found that adding landmark information considerably helped them in learning the structure of an unknown residential environment. We conclude that providing explicit landmark information in the learning phase seems beneficial for the creation of a rich "cognitive collage" that is fully functional in later phases when navigation support is not available.
Interaction between Dynamic LED-Light and Color Surfaces
Authors: Ralf Michel
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

The many different interactions between light and colours represent a very important research topic at the Zurich University of the Arts. This is why the Zurich ColourLight-Center was set up at the Institute for Design und Technology, idt. For more than 15 years, we have been investigating the potential of interactions of light and colour and asking fundamental questions about the relevance of the subject to the development of design education and practice. In the ColourLight-Lab, the research project, which we present from the Zurich ColourLight-Center, products and methods of presentation were created, which describe the sensory perception of light and colour as a phenomenon of seeing. The LED-ColourLab research project specially takes as its theme, the interaction of dynamic LED light and colour surfaces. 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
Vehicle Speed Measurement Based on Images Energy
Authors: Jianjun Tian, Jian Chen, Mushu Wang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This article presents a new method based on CCD images to measure the speed of vehicles. The working principle is taking twice instantaneous tandem photographs.Then based on the location of the vehicle by calculating image energy and CCD, with reference to the advance calibration rectangle, we can obtain speed of vehicle. Present a method to locate vehicle which is based on image energy and a new formula for calculating the vehicle speed. Simulations verify the effectiveness of the given method.
A constructivist approach to machine translation
Authors: Michael Carl
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

Constructivist cognitive theories conceptualize memory as a dynamic process which is directly linked to perception, memories and conclusion/induction (cf. [Sch91]). From this point of view, memory serves to establish structures that are relevant to the cognitive system in the present context of action. The function of memory is thus to participate in coherent behavior which makes survival of the acting cognitive system easier (or possible). Memories are similar to perceptions: they are perceptions without an object. Perception on the other hand is an activity (and not a passive process) that is driven by the memory.
Social Robot Design
Authors: Seita Koike, Masayuki Sugawara, Yuki Kutsukake, Sayaka Yamanouchi, Kie Sato, Yoshihiro Fujita, Junichi Osada
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

The purpose of this study is to describe the network of human and non human as the personal robot in the community. We designed an original program for the personal robot and took it to the nursery school. We participated in the community of the nursery school and supported the new play group that the children's mothers set up. They used the robot for their play actively. We made new users of the robot and changed the activity of the nursery school. As a result, the design of the interface for controlling robot changed.