ppxscal/embedding_network huggingface dataset:
Core Animation for Mac OS X and the iPhone: Creating Compelling Dynamic User Interfaces (Pragmatic Programmers)
Authors: Bill Dudney
Venue:  (2008)

Mac OS X Leopard introduces a fantastic new technology that makes writing applications with animated and cinematic user interfaces much easier. We'll explore this new technology by starting with the familiar concepts you already know from the pre-Leopard development kits. Then we'll see how they apply to the new frameworks and APIs. We'll build on your existing knowledge of Cocoa and bring you efficiently up to speed on what Core Animation is all about.With this book in hand, you can add Core Animation to your Cocoa applications, and make stunning user interfaces that your user's will be showing off to their friends.
The VoiceBot: a voice controlled robot arm
Authors: Brandi House, Jonathan Malkin, Jeff Bilmes
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present a system whereby the human voice may specify continuous control signals to manipulate a simulated 2D robotic arm and a real 3D robotic arm. Our goal is to move towards making accessible the manipulation of everyday objects to individuals with motor impairments. Using our system, we performed several studies using control style variants for both the 2D and 3D arms. Results show that it is indeed possible for a user to learn to effectively manipulate real-world objects with a robotic arm using only non-verbal voice as a control mechanism. Our results provide strong evidence that the further development of non-verbal voice controlled robotics and prosthetic limbs will be successful.
Intraday trade and quote dynamics: A Cox regression analysis
Authors: Chad R. Bhatti
Venue: Mathematics and Computers in Simulation (2009)

In this paper we apply the Cox proportional hazards model with an automated forward variable selection algorithm to identify the prominent market microstructure variables affecting the arrival rates of the trade and response quote processes. We use this flexible data-driven modeling approach to empirically examine the informational dynamics of individual securities and the economic similarities in trade and response quote dynamics across samples without imposing a structured relationship on the data.
Research on the model of enterprise application integration with web services
Authors: Xin Jin
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

In order to improve business by automating business processes that span these isolated systems, the enterprise needs to integrate the isolated systems and applications with Enterprise Application Integration (EAI), which would be linking diverse systems and applications of the enterprise to enable the enterprise to adapt to the dynamic business environment. Whereas, with traditional EAI solution, it is difficult to efficiently link the different proprietary applications and data sources, and difficult to enable the system to rapidly identify and respond to changes in the dynamic business environment. This paper discusses the traditional EAI technologies and the bottlenecks for applications integration, also elaborates the Web Services technology and the advantages suited for applications integration. Therefore, the model of EAI with Web Services (EAIWS) is proposed to efficiently implement the integration of diverse applications and systems within or between the enterprises. With EAIWS, this paper provides an example to explain how the application system works. This paper also discusses the advantages of EAIWS.
Classifying search queries using the Web as a source of knowledge
Authors: Evgeniy Gabrilovich, Andrei Broder, Marcus Fontoura, Amruta Joshi, Vanja Josifovski, Lance Riedel, Tong Zhang
Venue: ACM Transactions on the Web (TWEB) (2009)

We propose a methodology for building a robust query classification system that can identify thousands of query classes, while dealing in real time with the query volume of a commercial Web search engine. We use a pseudo relevance feedback technique: given a query, we determine its topic by classifying the Web search results retrieved by the query. Motivated by the needs of search advertising, we primarily focus on rare queries, which are the hardest from the point of view of machine learning, yet in aggregate account for a considerable fraction of search engine traffic. Empirical evaluation confirms that our methodology yields a considerably higher classification accuracy than previously reported. We believe that the proposed methodology will lead to better matching of online ads to rare queries and overall to a better user experience.
Multiple-Image-Based Restoration for Motion Blur with Non-uniform Point Spread Function
Authors: Karn Patanukhom, Akinori Nishihara
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A blind image restoration for non-linear motion blurs with non-uniform point spread functions based on multiple blurred versions of a same scene is proposed. The restoration is separately considered as identification and deconvolution problems. In the proposed identification process, an identification difficulty is introduced to rank an order of blur identification. A blurred image with the lowest identification difficulty is initially identified by using a single-image-based scheme. Then, other images are identified based on a cross convolution relation between each pair of blurred images. In addition, an iterative feedback scheme is applied to improve the identification results. For the deconvolution process, a spatial adaptive scheme using regional optimal terminating points is modified from a conventional iterative deconvolution scheme. The images are decomposed into sub-regions based on smoothness. The regional optimal terminating points are independently assigned to suppress a noise in smooth regions and sharpen the image in edgy regions. The optimal terminating point for each region is decided by considering a discrepancy error. Restoration examples of simulated and real world blurred images are experimented to demonstrate the performance of the proposed method.
Arrow tag: a direction-key-based technique for rapidly selecting hyperlinks while gazing at a screen
Authors: Atsuhiko Maeda, Hirohito Inagaki, Masanobu Abe
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Television sets and video game consoles equipped with a web browser have appeared, and we are now able to browse web pages on television screens. However, existing navigation techniques are too difficult in this situation. In this paper, we propose Arrow Tag, a new link selection technique for web browsers on TV. In this technique, sequences of arrow signs called Arrow Tags are assigned to the links of the web pages, so users can select the links by pushing the four direction keys a few times, while keeping her/his gaze fixed on the television screen. User studies show that Arrow Tag significantly outperforms the conventional techniques of Focus Move and Number Tag. Moreover, most participants preferred Arrow Tag over either Focus Move or Number Tag.
On the modelling and simulation of the competition for a secession under media influence by active particles methods and functional subsystems decomposition
Authors: G. Ajmone Marsan
Venue: Computers Mathematics with Applications (2009)

This paper deals with the development of a mathematical model for complex socio-economical systems, where external actions play a key role. The aim of the paper is to show the emergence of collective behaviors or macroscopic trends from individual based interactions, where agents are identified by functional subsystems. The approach is based on the methods of the mathematical kinetic theory for active particles, which describes the evolution of large systems of interacting entities which are carriers of specific functions: in our specific application socio-political activities subjected to the influence of the media.
Question of Existence and Uniqueness of Solution for Navier-Stokes Equation with Linear "Do-Nothing" Type Boundary Condition on the Outflow
Authors: Tomáš Neustupa
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The paper deals with the mathematical model of a flow of a viscous incompressible fluid through a 2D cascade of profiles. We consider a splited "do---nothing" type boundary condition on the outflow. The existence of a weak solution of a corresponding steady boundary value problem is known, see [2] and [3]. We recall the weak formulation, the theorem on existence and we study the uniqueness of the weak solution in this paper. 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
Expanded single-chip principles in practical application
Authors: Randy M. Dumse
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

For the past two decades the semiconductor industry has been in a headlong rush to pack more and more features on a single piece of silicon. The creation of the microprocessor as a single LSI device naturally gave inspiration for further advances. The microcomputer on a chip followed quickly and was again a technological stepping point rather than a final goal. New generations and process development variations made possible larger, faster, and more powerful systems on a chip. There is, however, a limit on the amount of CPU, ROM, RAM, and special-purpose devices that can be placed on a single, easily manufactured silicon die with current technology. In order to give the cost-reducing features of a one-chip computer with the flexibility of a multichip set, the expanded single-chip computer was developed. This paper will explain the theory behind that development, and then explore its application in a specific example. 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
A runtime approach to model-independent schema and data translation
Authors: Paolo Atzeni, Luigi Bellomarini, Francesca Bugiotti, Giorgio Gianforme
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-line fashion. In the original approach, the source database is imported into a dictionary, where it is stored according to a universal model. Then, the translation is applied within the tool as a composition of elementary transformation steps, specified as Datalog programs. Finally, the result is exported into the operational system. Here we illustrate a new, lightweight approach where the database is not imported. The tool needs only to know the model and the schema of the source database and generates views on the operational system that transform the underlying data (stored in the source schema) according to the corresponding schema in the target model. Views are generated in an almost automatic way, on the basis of the Datalog rules for schema translation.
A Novel Method of Combined Feature Extraction for Recognition
Authors: Tingkai Sun, Songcan Chen, Jingyu Yang, Pengfei Shi
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Multimodal recognition is an emerging technique to overcome the non-robustness of the unimodal recognition in real applications. Canonical correlation analysis (CCA) has been employed as a powerful tool for feature fusion in the realization of such multimodal system. However, CCA is the unsupervised feature extraction and it does not utilize the class information of the samples, resulting in the constraint of the recognition performance. In this paper, the class information is incorporated into the framework of CCA for combined feature extraction, and a novel method of combined feature extraction for multimodal recognition, called discriminative canonical correlation analysis (DCCA), is proposed. The experiments show that DCCA outperforms some related methods of both unimodal recognition and multimodal recognition.
UDEC-based Stability Analysis of the Goafs in Fragment Ore Section
Authors: Qingfa Chen, Keping Zhou, Tengteng Long, Jianhua Hu, Dan Wang
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Taking the fragment ore section of orebody No. 105 with the high value in Gaofeng mine in Guangxi province for example, three representative kinds of goafs in all scales were selected on the basis of the differences of goaf scale, surrounding rock conditions and situ stress field, and their stability were calculated by the universal distinct element code (UDEC). The calculation results showed as follows: 1) with the increase of goaf scale, the tensile stress scope in the goaf roof expanded from 12m to 60m; 2) the tensile failure mode of joints surfaces was primary, and that of ore block was auxiliary; 3) the maximum principal stress peak could reach 40.3MPa which exceeded rock body tensile strength 38.07MPa, but the influence on goaf stability was small because the peak was far away from goaf; 4) the plastic zone in roof changed from 7m to 12m because of the increased scale, so the goaf stability became worse gradually; 5) the objective principles that the whole plastic zone distributed on the left part of goaf roof and no plastic zone in pillar provided reference for choosing proper position of filling wellhead.
Brief paper: Computing the L2 gain for linear periodic continuous-time systems
Authors: Michael Cantoni, Henrik Sandberg
Venue: Automatica (Journal of IFAC) (2009)

A method to compute the L"2 gain is developed for the class of linear periodic continuous-time systems that admit a finite-dimensional state-space realisation. A bisection search for the smallest upper bound on the gain is employed, where at each step an equivalent discrete-time problem is considered via the well-known technique of time-domain lifting. The equivalent problem involves testing a bound on the gain of a linear shift-invariant discrete-time system, with the same state dimension as the periodic continuous-time system. It is shown that a state-space realisation of the discrete-time system can be constructed from point solutions to a linear differential equation and two differential Riccati equations, all subject to only single-point boundary conditions. These are well behaved over the corresponding one period intervals of integration, and as such, the required point solutions can be computed via standard methods for ordinary differential equations. A numerical example is presented and comparisons made with alternative techniques.
Mathematical programming representations for state-dependent queues
Authors: Wai Kin Victor Chan, Lee W. Schruben
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Discrete-event dynamic systems with feedback, where the behavior of the system depends on the system state, are difficult to model due to the uncertainties and dependencies of system performance on the system state. Service systems, in particular, tend to exhibit this behavior where servers may work faster (or slower) when facing an increasingly long line of impatient customers. A common example is a state-dependent queue where the service rate depends on the queue size, which can change during service. In this paper, we present a mathematical programming representation for the sample path dynamics of a state-dependent queue, and illustrate its application in sensitivity analysis.
A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism
Authors: Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The growing popularity of multicore architectures has renewed interest in language-based approaches to the exploitation of parallelism. Logic programming has proved an interesting framework to this end, and there are parallel implementations which have achieved significant speedups, but at the cost of a quite sophisticated low-level machinery. This machinery has been found challenging to code and, specially, to maintain and expand. In this paper, we follow a different approach which adopts a higher level view by raising some of the core components of the implementation to the level of the source language. We briefly present an implementation model for independent and-parallelism which fully supports non-determinism through backtracking and provides flexible solutions for some of the main problems found in previous and-parallel implementations. Our proposal is able to optimize the execution for the case of deterministic programs and to exploit unrestricted and-parallelism, which allows exposing more parallelism among clause literals than fork-join-based proposals. We present performance results for an implementation, including data for benchmarks where and-parallelism is exploited in non-deterministic programs.
Privacy enhanced personalization in e-learning
Authors: Mohd M. Anwar, Jim Greer, Christopher A. Brooks
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Web-based learning involves provision of personal on-line spaces to learners and teachers. Yet due to a lack of proper privacy policies and technical frameworks to implement them, seemingly innocent data transactions can carry risks to privacy in e-learning environments. We investigate privacy issues in e-learning and make recommendations for building environments that enhance privacy but allow features like content personalization and peer- collaboration. iHelp, a learning environment that supports both learners and instructors, implements many of these recommendations.
Simulation of stochastic hybrid systems with switching and reflecting boundaries
Authors: Derek Riley, Xenofon Koutsoukos, Kasandra Riley
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Modeling and simulation of biochemical systems are important tasks because they can provide insights into complicated systems where traditional experimentation is expensive or impossible. Stochastic hybrid systems are an ideal modeling paradigm for biochemical systems because they combine continuous and discrete dynamics in a stochastic framework. Simulation of these systems is difficult because of the inherent error which is introduced near the boundaries. In this work we develop a method for stochastic hybrid system simulation that explicitly considers switching and reflective boundaries. We also present a case study of the water/electrolyte balance system in humans and provide simulation results to demonstrate the usefulness of the improved simulation techniques.
Non-interactive Timestamping in the Bounded-Storage Model
Authors: Tal Moran, Ronen Shaltiel, Amnon Ta-Shma
Venue: Journal of Cryptology (2009)

A timestamping scheme is non-interactive if a stamper can stamp a document without communicating with any other player. The only communication done is at validation time. Non-Interactive timestamping has many advantages, such as information theoretic privacy and enhanced robustness. Non-Interactive timestamping, however, is not possible against polynomial-time adversaries that have unbounded storage at their disposal. As a result, no non-interactive timestamping schemes were constructed up to date. In this paper we show that non-interactive timestamping is possible in the bounded-storage model, i.e., if the adversary has bounded storage, and a long random string is broadcast to all players. To the best of our knowledge, this is the first example of a cryptographic task that is possible in the bounded-storage model but is impossible in the &#x201c;standard cryptographic setting,&#x201d; even when assuming &#x201c;standard&#x201d; cryptographic assumptions. We give an explicit construction that is secure against all bounded storage adversaries and a significantly more efficient construction secure against all bounded storage adversaries that run in polynomial time.
Based on the Adaptive Noise Three-dimensional Mesh Digital Watermark Removal Algorithms
Authors: Xincuan Cui, Xingqiang Yang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A novel attack method on robust 3D mesh object watermarking applications was proposed. Here we propose an adaptive noise of watermarking attack, which can make the noise intensity and the noise direction adjust in different parts of 3D mesh object. The proposed attacks consist of two main stages. First, adjust the 3D mesh object in the direct neighborhood, which can ensure to remove the watermark which watermark intensity is out of the direct neighborhood. Second, different regions of object use different smoothing method to filter. Third, add adaptive noise to the 3D mesh object of data points and in the HVS human visual system constraints adaptive noise has always been maintained a greater intensity noise. The results show that the watermark attack algorithm is better than other similar algorithms in the average performance.
Multi-Scale Feature for Recognition
Authors: Songze Lei, Chongyang Hao, Min Qi
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

For combining global and local features effectively, a multi-scale description and feature extraction algorithm is proposed. The original image is decomposed into two levels by wavelet analysis, and the two reconstructed approximate images are divided into several regions. On each region the singular value features are extracted, and then these singular value features are organized and used as an eigenvector of the image. Finally Fisher linear discriminant analysis is used for classification and recognition under these multi-scale singular value vectors. The experiments were made on ORL face database with recognition rate of 97.5%, and on ear database with recognition rate of 98.33%. Compared with corresponding algorithms, the proposed algorithm can achieve high recognition rate under the low dimension eigenvector. The results show that the multi-scale singular value vector includes not only global feature but also local feature of image, so more discriminant information for pattern recognition is contained.
Anticipating the Digital University
Authors: Mihai Nadin
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

The University of the Digital Society is based on interactions that facilitate learning in a new pragmatic context. Catalysts involved in the learning process replace the traditional professor. Students dynamically constitute classes of shared interest, which cease to exist once learning goals are achieved or prove unattainable. Learning, procedural in nature, takes place in the interaction, eventually embodied in a project. The digital infrastructure of the widely distributed, new virtual learning environment must be specified in terms of educational goals. Extremely rich data and many different computations will have to be seamlessly integrated. Modeling and access to data, corresponding to intuitive forms of interaction, will exceed all other forms of computation—a major challenge to everyone involved in conceiving methods appropriate to the new education. Learning driven by anticipation--proactive acquisition and dissemination of knowledge instead of training in reaction to the problems we face--is the basis of the new education.