ppxscal/embedding_network huggingface dataset:
HomeWindow: an augmented reality domestic monitor
Authors: Paul Lapides, Ehud Sharlin, Saul Greenberg
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Computation is increasingly prevalent in the home: it serves as a way to control the home itself, or it is part of the many digital appliances within it. The question is: how can home inhabitants effectively understand and control the digital home? Our solution lets a person examine and control their home surroundings through a mobile display that serves as a 'magic lens', where the detail shown varies with proximity. In particular, HomeWindow is an augmented reality system that superimposes an interactive graphical interface atop of physical but digital artifacts in the home. One can get an overview of a room's computational state by looking through the display: the basic state of all digital hot spots are shown atop their physical counterparts. As one approaches a particular digital spot, more detailed information as well as a control interface is shown using a semantic zoom. Our current implementation works with two home devices. First, people can examine and remotely control the status of mobile domestic robots. Second, people can discover the power consumption of household appliances, where appliances are surrounded by a colorful aura that reflects its current and historical energy use.
Efficiently finding the 'best' solution with multi-objectives from multiple topologies in topology library of analog circuit
Authors: Yu Liu, Masato Yoshioka, Katsumi Homma, Toshiyuki Shibuya
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents a new method using multi-objective optimization algorithm to automatically find the best solution from a topology library of analog circuits. Firstly this method abstracts the Pareto-front of each topology in the library by SPICE simulation. Then, the Pareto-front of the topology library is abstracted from the Pareto-fronts of topologies in the library followed by the theorem we proved. The best solution which is defined as the nearest point to specification on the Pareto-front of the topology library is then calculated by the equations derived from collinearity theorem. After the local searching using Nelder-Mead method maps the calculated best solution back to design variable space, the non-dominated best solution is obtained. Comparing to the optimization methods using single-objective optimization algorithms, this work can efficiently find the best non-dominated solution from multiple topologies for different specifications without additional time-consuming optimizing iterations. The experiments demonstrate that this method is feasible and practical in actual analog designs especially for uncertain or different multidimensional specifications.
Landau's theorem for planar harmonic mappings
Authors: Ming-Sheng Liu
Venue: Computers Mathematics with Applications (2009)

Chen, Gauthier and Hengartner obtained two versions of Landau's theorem for bounded planar harmonic mappings. Later, Dorff and Nowak improved their estimates. Furthermore, Grigoryan and Huang independently improved their results. In this note, we improve these last results by obtaining better coefficient estimates for bounded and normalized planar harmonic mappings. In particular, our theorems are sharp when M=1, which are consistent with Landau's theorem when M=1.
Explicit and implicit FEM-FCT algorithms with flux linearization
Authors: Dmitri Kuzmin
Venue: Journal of Computational Physics (2009)

A new approach to the design of flux-corrected transport (FCT) algorithms for continuous (linear/multilinear) finite element approximations of convection-dominated transport problems is pursued. The algebraic flux correction paradigm is revisited, and a family of nonlinear high-resolution schemes based on Zalesak's fully multidimensional flux limiter is considered. In order to reduce the cost of flux correction, the raw antidiffusive fluxes are linearized about an auxiliary solution computed by a high- or low-order scheme. By virtue of this linearization, the costly computation of solution-dependent correction factors is to be performed just once per time step, and there is no need for iterative defect correction if the governing equation is linear. A predictor-corrector algorithm is proposed as an alternative to the hybridization of high- and low-order fluxes. Three FEM-FCT schemes based on the Runge-Kutta, Crank-Nicolson, and backward Euler time-stepping are introduced. A detailed comparative study is performed for linear convection-diffusion equations.
Web-Based Technology Use and Computer Self-Efficacy as Predictors of Faculty Perceptions of Support for the Implementation of eLearning
Authors: Elizabeth Romero, Leyla Zhuhadar, Christopher Wagner, Robert Wyatt
Venue: Proceedings of the 2009 International Conference on Mobile, Hybrid, and On-line Learning (2009)

This study examine faculty levels of implementation of web-based instructional technology (WBIT) and computer self-efficacy beliefs (CSE) as factors associated to faculty perception of institutional mechanisms and its relative importance as conditions supporting the implementation of elearning in higher education. Using a sample of 334 faculty teaching at selected universities in the Commonwealth of Kentucky, faculty perceptions of support mechanisms were examined. Findings reveal that factors such as stages of concern about using WBIT, levels of use, and measures of computer self-efficacy provide an explanation of the perception differences. Developing a profile of faculty WBIT use and self-efficacy beliefs is anticipated to provide insight for the development of strategies and administrative practices necessary for eLearning to succeed in higher education institutions.
Characterizing On/Off Pattern of Broadband Internet Users
Authors: Emanuel V. Valle, Humberto T. Marques Neto, Wagner Meira Jr., Virgílio A. F. Almeida
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

It is well known that the duration of Internet user's sessions grows with the increase of broadband Internet access. Nevertheless, it is still not clear how much their usage increases, that is, whether the user issues requests during the whole session or there are periods during which users request nothing. This work presents a characterization of on/off pattern of broadband Internet users. We determine the statistical distribution of session on/off time and found that on-time is fits better to the Weibull distribution and offtime to the Lognormal. Furthermore, we model the on/off pattern with a state transition graph called CBMG (Customer Behavior Model Graph).
Computational Structure of the Aṣṭādhyāyī and Conflict Resolution Techniques
Authors: Sridhar Subbanna, Shrinivasa Varakhedi
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

Pānini's Aṣṭādhyāyī consists of sūtras that capture fundamentals of Sanskrit language and define its structure in terms of phonology, morphology and syntax. The Aṣṭādhyāyī can be thought of as an automaton to generate words and sentences. In object oriented programming terms, prescribing sūtras are objects having its transformation rule as its method. The meta rules or paribhāṣā sūtras and paribhāṣā vārtikās define the flow of the program. During application of sktras, conflicts may arise among two or more competing sktras. In this paper, computational structure of the Aṣṭādhyāyī, sktra objects observing the environment, tree representation of sktras and mathematical representation of conflict resolution techniques are presented.
Self-Organizing Map with False-Neighbor Degree between Neurons for Effective Self-Organization
Authors: Haruna Matsushita, Yoshifumi Nishio
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In the real world, it is not always true that neighboring houses are physically adjacent or close to each other. in other words, “neighbors” are not always “true neighbors.” In this study, we propose a new Self-Organizing Map (SOM) algorithm, SOM with False-Neighbor degree between neurons (called FN-SOM). The behavior of FN-SOM is investigated with learning for various input data. We confirm that FN-SOM can obtain a more effective map reflecting the distribution state of input data than the conventional SOM and Growing Grid.
Developing geographic information infrastructures: the role of access policies
Authors: B. van Loenen
Venue: International Journal of Geographical Information Science (2009)

Within societies, information availability is a key issue affecting society's well-being. For geographic information, a geographic information infrastructure (GII) facilitates availability and access to geographic information for all levels of government, the commercial sector, the non-profit sector, academia, and ordinary citizens. Although the importance of access policies in the development of a GII is commonly understood, research that has assessed the impact of access policies on this development is scant. This article adds this perspective. Based on information acquired from case-study and literature research, the author argues that open-access policies do not always promote GII development and in specific instances are counter-productive. These findings may explain why many nations still adhere to cost-recovery policies instead of following access policies recommended by research. The article provides alternatives for changing current policies into new access policies that promote GII development.
All Pairings Are in a Group
Authors: Chang-An Zhao, Fangguo Zhang, Jiwu Huang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we suggest that all pairings are in a group from an abstract angle. Based on the results, some new pairings with the short Miller loop are constructed for great efficiency. It is possible that our observation can be applied into other aspects of pairing-based cryptosystems.
What's New in SAS 9.2
Authors: SAS Publishing
Venue:  (2008)

Gives you a quick, convenient overview of new functionality, enhanced features, and new products that you might use in SAS 9.2.
Telepresence for in-situ microscopy
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: We present an approach for remote operation of instruments in the Internet environment. We have applied this approach to in-situ electron microscopy experiments that require dynamic interaction with the specimen under observation, as it is excited with external stimuli, i.e., temperature variation, EM field variation etc. The dynamic operations include control of the sample's position and orientation under the electron beam, the illumination conditions and focus, etc. Remote control via wide area networks like the Internet that do not offer real time data and command delivery guarantees is not practical for the finely tuned adjustments that dynamic studies require. We suggest that an effective approach to remote operation for this class of dynamic control applications must involve automated control operations performed near the instrument in order to eliminate the wide area network real-time delivery requirement. Our approach to this problem is based on advanced computer vision algorithms that permit instrumentation adjustments to be made in response to information extracted from the video signal generated by the microscope imaging system. We have determined the type of servo loops needed to enable remote operation and collaboration, and have introduced a novel partitioning of the control architecture for implementing this approach.
Alison: statified cooperative storytelling in dissociative identity disorders
Authors: Matthew Smith, Evan Boucher
Venue: ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies (2008)

In the Alison installation, different plot elements are presented based on the viewer's movement within a physical space. The space works as both a form of interaction and another method of presenting story elements.
Design and Analysis of the Composed Telecom Services
Authors: Piergiorgio Bertoli, Laura Ferrari, Raman Kazhamiakin, Corrado Moiso, Marco Pistore, Ermes Thuegaz
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Telecommunication (TelCo) is a key applicative area where adopting the web service paradigm has an enormous potential to facilitate the development process of powerful, complex functionalities on top of existing ones. At the same time, the specific features of TelCo applications pose difficult challenges to the adoption of standard languages and tools for web services. For instance, they need to cope with asynchronous communications, driven by heterogeneous events, and to handle concurrent, long-running transactions, involving the interaction of dynamically evolving sets of partners.The contribution of this paper is twofold. First, based on our analysis of current TelCo standards, and referring to a real-life case study, we identify and discuss a restricted set of orchestration patterns, and show how these can be modeled using the de-facto standard language for web services, ws-bpel. Then, we confront with the crucial issue of guaranteeing the correctness of such models, providing an automated support for the formal verification of their behavior, based on specific and advanced model-checking techniques. Our tests on the reference scenario witness the effectiveness of the approach, and identify its limits.
GUI-HDMR - A software tool for global sensitivity analysis of complex models
Authors: T. Ziehn, A. S. Tomlin
Venue: Environmental Modelling Software (2009)

The high dimensional model representation (HDMR) method is a set of tools which can be used to construct a fully functional metamodel and to calculate variance based sensitivity indices very efficiently. Extensions to the existing set of random sampling (RS)-HDMR tools have been developed in order to make the method more applicable for complex models with a large number of input parameters as often appear in environmental modelling. The HDMR software described here combines the RS-HDMR tools and its extensions in one Matlab package equipped with a graphical user interface (GUI). This makes the HDMR method easily available for all interested users. The performance of the GUI-HDMR software has been tested in this paper using two analytical test models, the Ishigami function and the Sobol' g-function. In both cases the model is highly non-linear, non-monotonic and has significant parameter interactions. The developed GUI-HDMR software copes very well with the test cases and sensitivity indices of first and second order could be calculated accurately with only low computational effort. The efficiency of the software has also been compared against other recently developed approaches and is shown to be competitive. GUI-HDMR can be applied to a wide range of applications in all fields, because in principle only one random or quasi-random set of input and output values is required to estimate all sensitivity indices up to second order. The size of the set of samples is however dependent on the problem and can be successively increased if additional accuracy is required. A brief description of its application within a range of modelling environments is given.
The Photoshop CS4 Companion for Photographers
Authors: Derrick Story
Venue:  (2008)

"Derrick shows that Photoshop can be friendly as well as powerful. In part, he does that by focusing photographers on the essential steps of an efficient workflow. With this guide in hand, you'll quickly learn how to leverage Photoshop CS4's features to organize and improve your pictures." -- John Nack, Principal Product Manager, Adobe Photoshop & Bridge Many photographers -- even the pros -- feel overwhelmed by all the editing options Photoshop provides. The Photoshop CS4 Companion for Photographers pares it down to only the tools you'll need most often, and shows you how to use those tools as part of an efficient and enjoyable workflow. This book explains an easy method for processing your images using the new user-friendly features that come with Photoshop CS4, including Adobe Bridge, Photo Downloader, and Adobe Camera Raw. A perfect fit for your laptop bag, this guide is designed to help you process photos in the field. Professional photographer and bestselling author Derrick Story teaches you how to quickly and efficiently organize and edit your photos without compromising the originals. With this book, you will: Import your images and apply metadata with Photo Downloader Rate your images and add keywords with Adobe Bridge Make basic (and reversible) edits with Adobe Camera Raw, such as cropping, color balance, and tonal adjustments Use advanced ACR tools for black & white conversion, spot removal, batch processing, and more Refine your images with Photoshop using adjustment layers, masking, and smart objects Apply advanced Photoshop techniques for retouching portaits, swapping colors, correcting lens distortion, and much more To use Photoshop effectively, photographers mustknow which tools they really need and which ones they don't. The Photoshop CS4 Companion for Photographers gives you the knowledge to create your own efficient path to great-looking photos.
On the Design of Fault-Tolerant Scheduling Strategies Using Primary-Backup Approach for Computational Grids with Low Replication Costs
Authors: Qin Zheng, Bharadwaj Veeravalli, Chen-Khong Tham
Venue: IEEE Transactions on Computers (2009)

Fault-tolerant scheduling is an imperative step for large-scale computational Grid systems, as often geographically distributed nodes co-operate to execute a task. By and large, primary-backup approach is a common methodology used for fault tolerance wherein each task has a primary copy and a backup copy on two different processors. In this paper, we identify two cases that may happen when scheduling dependent tasks with primary-backup approach. We derive two important constraints that must be satisfied. Further, we show that these two constraints play a crucial role in limiting the schedulability and overloading efficiency of backups of dependent tasks. We then propose two strategies to improve schedulability and overloading efficiency, respectively. We propose two algorithms (MRC-ECT and MCT-LRC), to schedule backups of independent jobs and dependent jobs, respectively. MRC-ECT is shown to guarantee an optimal backup schedule in terms of replication cost for an independent task, while MCT-LRC can schedule a backup of a dependent task with minimum completion time and less replication cost. We conduct extensive simulation experiments to quantify the performance of the proposed algorithms.
Sample-path solution of stochastic variational inequalities, with applications to option pricing
Authors: Gül Gürkan, A. Yonca Özge, Stephen M. Robinson
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper shows how to apply a variant of sample path optimization to solve stochastic variational in equalities, including as a special case finding a zero of a gradient. We give a new set of sufficient conditions for almost-sure convergence of the method, and exhibit bounds on the error of the resulting approximate solution. We also illustrate the application of this method by using it to price an American call option on a dividend-paying stock.
A Priority-Driven Flow Control Mechanism for Real-Time Traffic in Multiprocessor Networks
Authors: Shobana Balakrishnan, Füsun Özgüner
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

Real-time applications when mapped to distributed memory multiprocessors produce periodic messages with an associated deadline and priority. Real-time messages may be hard or soft deadline. Real-time extensions to wormhole routing (WR) with multiple virtual channels (VCs) and priority-based physical link arbitration and VC allocation have been proposed in the literature. With a fixed number of VCs/link, a message can face an unbounded priority inversion, rendering the global priority ineffective. In this paper, we propose a new flow control mechanism called Preemptive Pipelined Circuit Switching for Real-Time messages (PPCS-RT) to reduce the priority inversion problem. For the proposed model, with some architectural support, we present an off-line approach to compute delivery guarantees of hard deadline real-time messages. We also perform a comparison of real-time WR and PPCS-RT in terms of performance with soft deadline traffic. The overall miss ratio percentage is over 30 percent higher for WR than PPCS-RT with one VC/link at high traffic loads. Finally, we compare the architectural complexity of a PPCS-RT router and other real-time routers.
An 8-bit, 200 MSPS Folding and Interpolating ADC
Authors: Øystein Moldsvor, Geir S. Østrem
Venue: Analog Integrated Circuits and Signal Processing (1998)

An 8-bit, 200 MSPS folding and interpolating analog-to-digital converter, ADC, has been implemented in a 1.2 &micro;m BiCMOS-process. It achieves 7.5 effective bits with a power dissipation of 575mW. The active area is 4mm^2. The implementation and measured results are presented. A simple analytical model for the interpolation-induced nonlinearity in a folding and interpolating ADC using sinusoidal folding is presented. The bowing of the reference ladder due to interaction with the input stages is analyzed, and analytical models are derived.
Exact Solution of the Two-Dimensional Finite Bon Packing Problem
Authors: Silvano Martello, Daniele Vigo
Venue: Management Science (1998)

Given a set of rectangular pieces to be cut from an unlimited number of standardized stock pieces (bins), the Two-Dimensional Finite Bin Packing Problem is to determine the minimum number of stock pieces that provide all the pieces. The problem is NP-hard in the strong sense and finds many practical applications in the cutting and packing area. We analyze a well-known lower bound and determine its worst-case performance. We propose not lower bounds which are used within a branch-and-bound algorithm for the exact solution of the problem. Extensive computational testing on problem instances from the literature involving up to 120 pieces shows the effectiveness of the proposed approach.
Arithmetic coding revisited
Authors: Alistair Moffat, Radford M. Neal, Ian H. Witten
Venue: ACM Transactions on Information Systems (TOIS) (1998)

Over the last decade, arithmetic coding has emerged as an important compression tool. It is now the method of choice for adaptive coding on myltisymbol alphabets because of its speed, low storage requirements, and effectiveness of compression. This article describes a new implementation of arithmetic coding that incorporates several improvements over a widely used earlier version by Witten, Neal, and Cleary, which has become a de facto standard. These improvements include fewer multiplicative operations, greatly extended range of alphabet sizes and symbol probabilities, and the use of low-precision arithmetic, permitting implementation by fast shift/add operations. We also describe a modular structure that separates the coding, modeling, and probability estimation components of a compression system. To motivate the improved coder, we consider the needs of a word-based text compression program. We report a range of experimental results using this and other models. Complete source code is available.
Compact Integrated Motion Sensor With Three-Pixel Interaction
Authors: Jörg Kramer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1996)

An integrated circuit with on-chip photoreceptors is described, that computes the bi-directional velocity of a visual stimulus moving along a given axis in the focal plane by measuring the time delay of its detection at two positions. Due to the compactness of the circuit, a dense array of such motion-sensing elements can be monolithically integrated to estimate the velocity field of an image and to extract higher-level image features through local or global interaction.