ppxscal/embedding_network huggingface dataset:
Virtual active touch: Perceived roughness through a pointing-stick-type tactile interface
Authors: Takahiro Yamauchi, Masashi Konyo, Shogo Okamoto, Satoshi Tadokoro
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

For realizing a tactile display for a handheld device, active touch movement should be represented on a small interface. We propose the addition of a tactile feedback mechanism for a pointing-stick-type (PS) input device. In this study, we describe a method for enabling virtual active touch with a cursor on the screen operated by the PS-type tactile interface without actual touch movement. First, to validate our concept, we compared tactile detection capabilities of roughness information represented by the PS-type tactile interface and the interface with actual touch movement. The experimental results showed that the PS-type tactile interface exhibited almost the same ability as the interface involving actual touch movement. We also found that the force-to-velocity scaling factor of the cursor movement had a significant influence on the roughness detection capability of the interface. In addition, to apply our method to devices having small screens, such as mobile phones, we tried to restrict the cursor velocity in proportion to the object size that appears on the screen. The experimental results showed that the PS-type tactile interface can represent almost the same roughness information as the original object size.
Preserving sharp edges in geometry images
Authors: Mathieu Gauthier, Pierre Poulin
Venue: Proceedings of Graphics Interface 2009 (2009)

A geometry image offers a simple and compact way of encoding the geometry of a surface and its implicit connectivity in an image-like data structure. It has been shown to be useful in multiple applications because of its suitability for efficient hardware rendering, level of detail, filtering, etc. Most existing algorithms generate geometry images by parameterizing the surface onto a domain, and by performing a regular resampling in this domain. Unfortunately, this regular resampling fails to capture sharp features present on the surface. In this paper, we propose to slightly alter the grid to align sample positions with corners and sharp edges in the geometric model. While doing so, our goal is to maintain the resulting geometry images simple to interpret, while producing higher quality reconstructions. We demonstrate an implementation in the planar domain and show results on a range of common geometrical models.
C Programming for the Absolute Beginner, 2nd edition
Authors: Michael Vine
Venue:  (2007)

If you are new to programming with C and are looking for a solid introduction, this is the book for you. Developed by computer science instructors, books in the for the absolute beginner series teach the principles of programming through simple game creation. C is not an easy language to learn, but fortunately the clear explanations, examples, and pictures in this book make learning C easy and fun. Each chapter contains programming challenges, a chapter review, and a complete program that uses chapter-based concepts to construct an easily built application. You will acquire the skills that you need for more practical C programming applications and will learn how these skills can be put to use in real-world scenarios. Additionally, by the time you finish this book, you will be able to apply the programming principles youve learned to the next programming language you tackle.
Switching cell embedded in photonic crystal
Authors: Almir Wirth Lima,  Jr, A. S. B. Sombra
Venue: Microsystem Technologies (2009)

We analyze and propose a directional optical coupler embedded in photonic crystal (PhC) for the C, L, and U bands of ITU (International Telecommunications Union), which is driven by an external command signal. Therefore, this switching cell can work in an all-optical switch. The switching method uses a low power external command signal, inserted in the central coupling region, which acts as another waveguide. The switching process is based on the change of the straight state to the cross state owing to the external command signal.
Effects of Peers Interactivity and Self-regulated Learning Strategies on Learning Art Appreciation through Weblog
Authors: Sau Hung Cheung, Percy Lai Yin Kwok
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Twenty-five visual arts learners experienced eight weeks of studying art appreciation in sculptures to try out new senior (Grade 10-11) art curriculum with weblog in the contemporary art classroom. Ten weblogs were created to facilitate collaborative learners in the virtual learning community to co-construct scare art knowledge, enrich aesthetic abilities, and develop generic skills and positive attitude for becoming competent learners in the long run. The study aimed to gain understanding of learners' perception with weblog, to scrutinize potential functions of weblog to integrate web interactivity, social cognitive learning theories and uses of self-regulated learning strategies to achieve intended learning goals of art appreciation. On the whole, learners could direct diversified learner-to-learner and peer-to-content web interactivity that empowered themselves confidence and motivation to co-construct an archive of sculpture research in weblogs. With positive effect of peer collaboration, all learners could assume holistic responsibility.
Variational formulations for resting irreversible fluids with heat flow
Authors: Stanislaw Sieniutycz, Piotr Kuran
Venue: Proceedings of the 2nd conference on European computing conference (2008)

Nonequilibrium statistical mechanics helps to estimate corrections to the entropy and energy of the fluid with heat flux in terms of the nonequilibrium distribution function, f. This leads to the coefficients of wave model of heat: relaxation time, propagation speed and thermal inertia. With these data a quadratic Lagrangian and a variational principle of Hamilton's type follows for the fluid in the field representation of fluid's motion. We analyze canonical conservation laws and show the satisfaction of the second law under the constraint of these conservation laws.
Approximation of functions on the Sobolev space on the sphere in the average case setting
Authors: Heping Wang, Xuebo Zhai, Yanwei Zhang
Venue: Journal of Complexity (2009)

In this paper, we discuss the best approximation of functions by spherical polynomials and the approximation by Fourier partial summation operators, Vallee-Poussin operators, Cesaro operators, and Abel operators, on the Sobolev space on the sphere with a Gaussian measure, and obtain the average error estimates. We also get the asymptotic values for the average Kolmogorov and linear widths of the Sobolev space on the sphere and show that, in the average case setting, the spherical polynomial subspaces are the asymptotically optimal subspaces in the L"q(1@?q
Uniformly Convergent Iterative Methods for Discontinuous Galerkin Discretizations
Authors: Blanca Ayuso De Dios, Ludmil Zikatanov
Venue: Journal of Scientific Computing (2009)

We present iterative and preconditioning techniques for the solution of the linear systems resulting from several discontinuous Galerkin (DG) Interior Penalty (IP) discretizations of elliptic problems. We analyze the convergence properties of these algorithms for both symmetric and non-symmetric IP schemes. The iterative methods are based on a "natural" decomposition of the first order DG finite element space as a direct sum of the Crouzeix-Raviart non-conforming finite element space and a subspace that contains functions discontinuous at interior faces. We also present numerical examples confirming the theoretical results.
Handbook of Network and System Administration
Authors: Jan Bergstra, Jan Bergstra, Mark Burgess
Venue:  (2007)

System administration is about the design, running and maintenance of human-computer systems. Examples of human-computer systems include business enterprises, service institutions and any extensive machinery that is operated by, or interacts with human beings. System administration is often thought of as the technological side of a system: the architecture, construction and optimization of the collaborating parts, but it also occasionally touches on softer factors such as user assistance (help desks), ethical considerations in deploying a system, and the larger implications of its design for others who come into contact with it.This book summarizes the state of research and practice in this emerging field of network and system administration, in an anthology of chapters written by the top academics in the field. The authors include members of the IST-EMANICS Network of Excellence in Network Management.This book will be a valuable reference work for researchers and senior system managers wanting to understand the essentials of system administration, whether in practical application of a data center or in the design of new systems and data centers. - Covers data center planning and design- Discusses configuration management- Illustrates business modeling and system administration- Provides the latest theoretical developments
Integral and ideals in Riesz spaces
Authors: A. Boccuto, D. Candeloro
Venue: Information Sciences: an International Journal (2009)

A convergence in Riesz spaces is given axiomatically. A Bochner-type integral for Riesz space-valued functions is introduced and some Vitali and Lebesgue dominated convergence theorems are proved. Some properties and examples are investigated.
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I
Authors: Jacek Sroka, Jan Hidders
Venue: Fundamenta Informaticae (2009)

Workflow development and enactment workbenches are becoming a standard tool for conducting in silico experiments. Their main advantages are easy to operate user interfaces, specialized and expressive graphical workflow specification languages and integration with a huge number of bioinformatic services. A popular example of such a workbench is Taverna, which has many additional useful features like service discovery, storing intermediate results and tracking data provenance. We discuss a detailed formal semantics for Scufl - the workflow definition language of the Taverna workbench. It has several interesting features that are notmet in other models including dynamic and transparent type coercion and implicit iteration, control edges, failure mechanisms, and incominglinks strategies. We study these features and investigate their usefulness separately as well as in combination, and discuss alternatives. The formal definition of such a detailed semantics not only allows to exactly understand what is being done in a given experiment, but is also the first step toward automatic correctness verification and allows the creation of auxiliary tools that would detect potential errors and suggest possible solutions to workflow creators, the same way as Integrated Development Environments aid modern programmers. A formal semantics is also essential for work on enactment optimization and in designing the means to effectively query workflow repositories. This paper is the first of two. It defines, explains and discusses fundamental notions for describing Scufl graphs and their semantics. Then, in the second part, we use these notions to define the semantics and show that our definition can be used to prove properties of Scufl graphs.
Effects of Note-Taking Strategies on Understanding of School Learning
Authors: Hitomi Saito, Masahiro Genda
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

In this study, we investigated the effects of using note-taking strategies on the understanding of school learning. The following six note-taking strategies were extracted from learners' notes in our first survey: lists, font, figures, underlines, enclosing, and arrowed lines. In our second survey, we examined the relationship of post-test scores and strategies used or keywords written in learners' notes. The results of analysis showed that learners who scored high on the post-test: (1) extracted crucial points from the contents of the learning objects and (2) used note-taking strategies to take notes more clearly than learners who scored low on the post-test. These findings indicate that it is necessary to help learners use note-taking strategies and extract the key points.
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Authors: Frederic Dorn, Jan Arne Telle
Venue: Discrete Applied Mathematics (2009)

Branchwidth and treewidth are connectivity parameters of graphs of high importance in algorithm design. By dynamic programming along the associated branch- or tree-decomposition one can solve most graph optimization problems in time linear in the graph size and exponential in the parameter. If one of these parameters is bounded on a class of graphs, then so is the other, but they can differ by a small constant factor and this difference can be crucial for the resulting runtime. In this paper we introduce semi-nice tree-decompositions and show that they combine the best of both branchwidth and treewidth. We first give simple algorithms to transform a given tree-decomposition or branch-decomposition into a semi-nice tree-decomposition. We then give two templates for dynamic programming along a semi-nice tree-decomposition, one for optimization problems over vertex subsets and another for optimization problems over edge subsets. We show that the resulting runtime will match or beat the runtimes achieved by doing dynamic programming directly on either a branch- or tree-decomposition. For example, given a graph G on n vertices with path-, tree- and branch-decompositions of width pw,tw and bw respectively, the Minimum Dominating Set problem on G is solved in time O(n2^m^i^n^{^1^.^5^8^p^w^,^2^t^w^,^2^.^3^8^b^w^}) by a single dynamic programming algorithm along a semi-nice tree-decomposition. On the applied side the immediate gain is that for each optimization problem one can achieve the benefits of both treewidth, branchwidth and pathwidth while developing and implementing only one dynamic programming algorithm. On the theoretical side the combination of the best properties of both branchwidth and treewidth in a single decomposition is a step towards a more general framework giving the fastest possible algorithms on tree-like graphs.
The price of anarchy in bertrand games
Authors: Shuchi Chawla, Feng Niu
Venue: Proceedings of the tenth ACM conference on Electronic commerce (2009)

The Internet is composed of multiple economically-independent service providers that sell bandwidth in their networks so as to maximize their own revenue. Users, on the other hand, route their traffic selfishly to maximize their own utility. How does this selfishness impact the efficiency of operation of the network? To answer this question we consider a two-stage network pricing game where service providers first select prices to charge on their links, and users pick paths to route their traffic. We give tight bounds on the price of anarchy of the game with respect to social value--the total value obtained by all the traffic routed. Unlike recent work on network pricing, in our pricing game users do not face congestion costs; instead service providers must ensure that capacity constraints on their links are satisfied. Our model extends the classic Bertrand game in economics to network settings.
A Discriminant Analysis Method for Face Recognition in Heteroscedastic Distributions
Authors: Zhen Lei, Shengcai Liao, Dong Yi, Rui Qin, Stan Z. Li
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Linear discriminant analysis (LDA) is a popular method in pattern recognition and is equivalent to Bayesian method when the sample distributions of different classes are obey to the Gaussian with the same covariance matrix. However, in real world, the distribution of data is usually far more complex and the assumption of Gaussian density with the same covariance is seldom to be met which greatly affects the performance of LDA. In this paper, we propose an effective and efficient two step LDA, called LSR-LDA, to alleviate the affection of irregular distribution to improve the result of LDA. First, the samples are normalized so that the variances of variables in each class are consistent, and a pre-transformation matrix from the original data to the normalized one is learned using least squares regression (LSR); second, conventional LDA is conducted on the normalized data to find the most discriminant projective directions. The final projection matrix is obtained by multiply the pre-transformation matrix and the projective directions of LDA. Experimental results on FERET and FRGC ver 2.0 face databases show the proposed LSR-LDA method improves the recognition accuracy over the conventional LDA by using the LSR step.
Research on the Emotions Interpreted from Emoticons in Japanese Cellular Telephone Email
Authors: Masayoshi Yanagisawa, Mayu Kobayashi, Yuuki Kato, Shogo Kato, J. Scott Douglass
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Japanese textual communication as cellular telephones has been characterized as the main mediated-communication method for Japanese young people. In textual interaction, misunderstandings of emotions tend to be easily done. However, some previous studies have consistently found the benefits of using emoticons in CMC interaction because these marks can convey social emotions and reduce perceptions of flaming. In this study, we focused on the readers of email messages and how they interpreted the emotional content of various emoticons. A comparison was made between the emoticons which evoked positive and negative emotions by comparing their relative breadth of interpretations. As a result, the emoticons which evoked negative emotions are considered to have a greater number of emotional interpretations. The findings suggest that emoticons with negative emotional interpretations may increase the chances of miscommunication when used in text messages.
The Ramsey model with logistic population growth and benthamite felicity function revisited
Authors: Massimiliano Ferrara, Luca Guerrini
Venue: WSEAS Transactions on Mathematics (2009)

In this paper we extend the study done by Ferrara and Guerrini [12], where two different research lines within the Ramsey model were joined together: the one studying the role of a logistic population growth rate (Accinelli and Brida [2]), and the one analyzing the effects of a Benthamite formulation for the utility function. The results obtained in [12] for the special case of a constant intertemporal elasticity of substitution (CIES) utility function and a Cobb-Douglas production function are provided to be still true for a general utility function and a neoclassical production function. We have that the model is described by a three dimensional dynamical system, whose unique non-trivial steady state equilibrium is a saddle point with a two dimensional stable manifold. Consequently, the speed of convergence is determined by two stable roots, rather than only one as in the basic Ramsey model. In addition, in the special case of a CIES utility function and a Cobb-Douglas technology, an explicit solution for the model can be derived, when capital's share is equal to the reciprocal of the intertemporal elasticity of substitution.
Students' Metacognition, Strategy, and Affective Anxiety While Executing a Spreadsheet Activity
Authors: Trang Thi Thuy Nguyen, Lyn Henderson
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper presents findings from a research project that examined Vocational Education and Training (VET) students' thinking profiles during the execution of an electronic spreadsheet activity. The empirical qualitative study was centered in a information processing theory and mediating processes paradigm that utilised stimulated recall interviews. The aim was to ascertain any links between metacognition, strategy and thoughts about the affective area of anxiety. The findings revealed that, at least in this study, metacognition plays a critical role in the selection, or failure to select, appropriate strategies. The males used control-type metacognition to look for strategies to solve problems whereas females were preponderantly of the self-awareness metacognition. As the result, males performed better than females did, overall. However, both males and females reported thoughts about experiencing computer anxiety. Anxiety had significant effects on their metacognition and strategies. This study offers further insights to the literature about these connections.
OpenCog: A Software Framework for Integrative Artificial General Intelligence
Authors: David Hart, Ben Goertzel
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

The OpenCog software development framework, for advancement of the development and testing of powerful and responsible integrative AGI, is described. The OpenCog Framework (OCF) 1.0, to be released in 2008 under the GPLv2, is comprised of a collection of portable libraries for OpenCog applications, plus an initial collection of cognitive algorithms that operate within the OpenCog framework. The OCF libraries include a flexible knowledge representation embodied in a scalable knowledge store, a cognitive process scheduler, and a plug-in architecture for allowing interaction between cognitive, perceptual, and control algorithms.
Statistical Parsing with Context-Free Filtering Grammar
Authors: Michael Demko, Gerald Penn
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

Statistical parsers that simultaneously generate both phrase-structure and lexical dependency trees have been limited to date in two important ways: detecting non-projective dependencies has not been integrated with other parsing decisions, and/or the constraints between phrase-structure and dependency structure have been overly strict. We introduce context-free filtering grammar as a generalization of a lexicalized factored parsing model, and develop a scoring model to resolve parsing ambiguities for this new grammar formalism. We demonstrate the new model's flexibility by implementing a statistical parser for German, a freer-word-order language exhibiting a mixture of projective and non-projective syntax, using the TüBa-D/Z treebank [1].
Burrows-Wheeler transform and palindromic richness
Authors: Antonio Restivo, Giovanna Rosone
Venue: Theoretical Computer Science (2009)

The investigation of the extremal case of the Burrows-Wheeler transform leads to study the words w over an ordered alphabet A={a"1,a"2,...,a"k}, with a"1