ppxscal/embedding_network huggingface dataset:
Relevant estimation among fields using field association words
Authors: Akihiro Tanaka, El-Sayed Atlam, Kazukiro Morita, Yohei Tsukuda, Masao Fuketa, Jun-ichi Aoe
Venue: International Journal of Computer Applications in Technology (2009)

In recent years, there has been a tremendous growth of online text information related to the explosive growth of the web which provides a very useful information resource to all types of users who access the Internet for various purposes. The major demand of these users is to get required information within the stipulated time. Humans can recognise subjects of document fields by reading only some relevant specific words called field association words in the field. This paper presents a method of relevant estimation among fields by using field association words. Two methods are proposed in this paper: first is a method of extraction of co-occurrence among fields and the second is a method of judgment of similarity among fields as the methods of relevant estimation among fields. From experimental results, precision of the first method is high when relevance among fields is very high and considering direction of fields, preferable results are obtained in the second method.
Combining Music Practicing with the Submission of Self-Made Videos for Pre-School Teacher Education
Authors: Katsuko T. Nakahira, Yukiko Fukami, Miki Akahane
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

It has been pointed out that it is difficult to raise students' skill in piano playing within the limited hours of face-to-face lessons possible in the training of prospective pre-school teachers. It has been believed that the only solution to this problem is to increase the number of hours of face-to-face lessons. Our new approach to solving this problem is to require students to take videos of their own playing/singing and submit them to their instructors. This has led to improved skill in performing without increasing the length of face-to-face lessons. In order to reduce students' worry about using a complicated system, we used “KS20” from Company F, which offers the capability of managing information easily. The results of our trials with this approach indicated that (1) students who submitted videos 4 or 5 times made a significant improvement in their performing skills, and (2) this approach was effective in improving basic skills for piano playing and singing.
Decision Making Based on Emergency Plan Templates
Authors: Pan Tang, Hongwei Wang, Wei Zeng
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

Decision making based on emergency plans is the main mechanism of problem solving in emergency management. According to characteristics of emergency plan texts, this paper extracts four main components and describes them with formal models. Based on emergency plan templates, we develop a dynamic decision making model to support the normative problem-solving process during emergencies. It provides foundation to develop decision support system for emergency managerst.
The Computer as Cognitive Artifact and Simulator of Worlds
Authors: Philip Brey
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

In this essay, the relation between computers and their human users will be analyzed from a philosophical point of view. I will argue that there are at least two philosophically interesting relationships between humans and computers: functional and phenomenal relationships. I will first analyze the functional relationship between computers and humans. In doing this, I will abstract from ordinary functions of computers, such as word processor, information provider, and gaming device, to arrive at a generalized account of the functional relationship between humans and computers. Next, I will explore the phenomenal relationship between humans and computers, which is the way in which computers transform our experience of and interaction with our environment or world. Both analyses, I will argue, point to a dual role of computers for humans: a cognitive role, in which the computer functions as a cognitive device that extends or supplements human cognition, and an ambient role, in which the computer functions as a simulation device that simulates objects and environments.
EAP-Sens: a security architecture for wireless sensor networks
Authors: M. Abdul Alim, Behcet Sarikaya
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

We present the design, implementation and simulation of a security protocol based on Extensible Authentication Protocol nick-named EAP-Sens for wireless sensor networks. We use the generalized pre-shared key authentication method for authentication and key establishment. Standard EAP model is used for authenticating sensor nodes within the radio range of the authenticator. For distant nodes, we use Relay Authenticators to tunnel EAP messages to the authenticator. We have defined EAP message encapsulations for IEEE 802.15.4 standard and a key hierarchy for EAP-Sens. To analyze EAP-Sens performance on larger configurations a simulation model has been developed. We have implemented an EAP-Sens prototype for Tmote sensors and showed that EAP based security protocol is feasible in wireless sensor networks.
Graph characteristics from the heat kernel trace
Authors: Bai Xiao, Edwin R. Hancock, Richard C. Wilson
Venue: Pattern Recognition (2009)

Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the problems that arises in the analysis of structural abstractions of objects is graph clustering. In this paper, we explore how permutation invariants computed from the trace of the heat kernel can be used to characterize graphs for the purposes of measuring similarity and clustering. The heat kernel is the solution of the heat equation and is a compact representation of the path-length distribution on a graph. The trace of the heat kernel is given by the sum of the Laplacian eigenvalues exponentiated with time. We explore three different approaches to characterizing the heat kernel trace as a function of time. Our first characterization is based on the zeta function, which from the Mellin transform is the moment generating function of the heat kernel trace. Our second characterization is unary and is found by computing the derivative of the zeta function at the origin. The third characterization is derived from the heat content, i.e. the sum of the elements of the heat kernel. We show how the heat content can be expanded as a power series in time, and the coefficients of the series can be computed using the Laplacian spectrum. We explore the use of these characterizations as a means of representing graph structure for the purposes of clustering, and compare them with the use of the Laplacian spectrum. Experiments with the synthetic and real-world databases reveal that each of the three proposed invariants is effective and outperforms the traditional Laplacian spectrum. Moreover, the heat-content invariants appear to consistently give the best results in both synthetic sensitivity studies and on real-world object recognition problems.
A D-optimal design approach to constrained multiresponse robust design with prioritized mean and variance considerations
Authors: Jami Kovach, Byung Rae Cho
Venue: Computers and Industrial Engineering (2009)

The traditional measures of ensuring quality, derived from viewing quality as simply conforming to specifications, does not adequately address today's global markets and value-driven customers. Consequently, process improvement projects are often performed to improve operational performance in order to increase customer satisfaction. Therefore, process improvement methods, such as robust design, are important to industrial quality improvement initiatives. Yet, little of the work in the area of robust design has specifically addressed problems involving physical processing constraints that create an irregularly shape experimental region and the simultaneous consideration of multiple quality characteristics. To address these issues, we propose a new approach to robust design that utilizes D-optimal experimental designs in the context of multiresponse optimization problems in order to overcome the limitations of standard experimental approaches often used in robust design studies. Specifically, we formulate our optimization models as a preemptive nonlinear goal programming problem that focuses on consideration of the mean and variance. We also investigate the extension of optimization models traditionally used in robust design investigations to address multiple responses and compare the outcomes of our proposed approaches using a numerical example.
Expression Recognition Based on Multi-scale Block Local Gabor Binary Patterns with Dichotomy-Dependent Weights
Authors: Zheng Zhang, Zheng Zhao, Tiantian Yuan
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

In order to accomplish subject-independent facial expression recognition, a weighted Multi-scale Block Local Gabor Binary Patterns (MB-LGBP) based facial expression recognition approach is presented in this paper. Gabor filters have been proved to be effective for expression recognition because of its superior capability of multi-scale representation, while MB-LBP is a powerful descriptor for encoding local-holistic textures. We combine the idea of Multi-scale Gabor representation with the concept of MB-LBP encoding to achieve both locally and globally informative MB-LGBP features. In recognition, we introduce dichotomy-dependent weights for SVM classification and compare its performance with the traditional weighted Chi square distance based paradigm. The promising result proves the superiority of the MB-LGBP composite features to some other popular features in expression recognition.
Edge Mashups for Service-Oriented Collaboration
Authors: Ken Birman, Jared Cantwell, Daniel Freedman, Qi Huang, Petko Nikolov, Krzysztof Ostrowski
Venue: Computer (2009)

The Live Distributed Objects platform makes it possible to combine hosted content with P2P protocols in a single object-oriented framework.
The equivalence of convergences of sequences of fuzzy numbers and its applications to the characterization of compact sets
Authors: Zhitao Zhao, Congxin Wu
Venue: Information Sciences: an International Journal (2009)

In this paper, with the help of the convergence of sequences of fuzzy numbers with respect to the Lebesgue measure, we study the relationship between convergences of sequences of fuzzy numbers with respect to the endograph metric, the sendograph metric and the L"p metric. We prove that these convergences are equivalent under proper conditions. In addition, by applying our result, we give a new characterization of compact sets in fuzzy number space with the sendograph metric.
Evolving rule induction algorithms with multi-objective grammar-based genetic programming
Authors: Gisele L. Pappa, Alex A. Freitas
Venue: Knowledge and Information Systems (2009)

Multi-objective optimization has played a major role in solving problems where two or more conflicting objectives need to be simultaneously optimized. This paper presents a Multi-Objective grammar-based genetic programming (MOGGP) system that automatically evolves complete rule induction algorithms, which in turn produce both accurate and compact rule models. The system was compared with a single objective GGP and three other rule induction algorithms. In total, 20 UCI data sets were used to generate and test generic rule induction algorithms, which can be now applied to any classification data set. Experiments showed that, in general, the proposed MOGGP finds rule induction algorithms with competitive predictive accuracies and more compact models than the algorithms it was compared with.
I/O-Efficient Algorithms for Graphs of Bounded Treewidth
Authors: Anil Maheshwari, Norbert Zeh
Venue: Algorithmica (2009)

We present an algorithm that takes $\mathcal {O}(\mathrm {sort}(N))$I/Os (sort(N)=&#x0398;((N/(DB))log&#x2009; M/B (N/B)) is the number of I/Os it takes to sort N data items) to compute a tree decomposition of width at most&#x00a0;k, for any graph&#x00a0;G of treewidth at most&#x00a0;k and size&#x00a0;N, where k is a constant. Given such a tree decomposition, we use a dynamic programming framework to solve a wide variety of problems on G in $\mathcal {O}(N/(DB))$I/Os, including the single-source shortest path problem and a number of problems that are NP-hard on general graphs. The tree decomposition can also be used to obtain an optimal separator decomposition of&#x00a0;G. We use such a decomposition to perform depth-first search in&#x00a0;G in&#x00a0; $\mathcal {O}(N/(DB))$I/Os. As important tools that are used in the tree decomposition algorithm, we introduce flippable DAGs and present an algorithm that computes a perfect elimination ordering of a k-tree in $\mathcal {O}(\mathrm {sort}(N))$I/Os. The second contribution of our paper, which is of independent interest, is a general and simple framework for obtaining I/O-efficient algorithms for a number of graph problems that can be solved using greedy algorithms in internal memory. We apply this framework in order to obtain an improved algorithm for finding a maximal matching and the first deterministic I/O-efficient algorithm for finding a maximal independent set of an arbitrary graph. Both algorithms take $\mathcal {O}(\mathrm {sort}(|V|+|E|))$I/Os. The maximal matching algorithm is used in the tree decomposition algorithm.
K-SNCC: group deviations in subsidized non-cooperative computing
Authors: Andrey Klinger, Moshe Tennenholtz
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

A function is subsidized non-cooperative computable [SNCC] if honest agents can compute it by reporting truthfully their private inputs, while unilateral deviations by the players are not beneficial: if a deviation from truth revelation can mislead other agents, this deviation will decrease the deviator's chances of correct computation, or, it will not affect these chances but the expected payment to the deviator will decrease; in addition, deviations can not increase the expected monetary payments to a deviator without decreasing his chances of correct computation. This paper extends the study of SNCC functions to the context of group deviations. A function is K-SNCC if deviations by a group of at most K agents are not beneficial. We provide a full characterization of the K-SNCC functions, both for the independent values and the correlated values settings.
Perturbed flows of a second-order fluid in a uniform straight tube
Authors: Fernando Carapau
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

The aim of this paper is to analyze the perturbed flows of a non-Newtonian incompressible second-order fluid in a straight rigid axisymmetric tube with circular cross-section of constant radius. To study this problem, we use the 1D nine-director Cosserat theory approach which reduces the exact three-dimensional equations to a system depending only on time and on a single spatial variable. From this one-dimensional system we obtain the relationship between mean pressure gradient and volume flow rate over a finite section of the tube. Attention is focused on some numerical simulation of steady/unsteady flows on the analysis of perturbed flows.
Plenary lecture 4: flexible superfinishing modules used in SME (small and medium enterprises)
Authors: Badea Lepadatescu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

In the paper are presented some achievements regarding the uses of flexible superfinishing modules that can be used to obtain the surface finish requirements for the products in small and medium enterprises. These modules have a range of flexibility that make them to adapt to a large sort of products and to a great range shape and dimensions of workpieces.
Object categorization for affordance prediction
Authors: James M. Rehg, Aaron Bobick
Venue:  (2008)

A fundamental requirement of any autonomous robot system is the ability to predict the affordances of its environment. In this dissertation, we develop a computational model of affordance learning with object categorization where a robot explicitly learns the object categories in a partially supervised manner and conducts experiments on its enviorment to both refine its model of categories and affordances. We demonstrate that compared with the conventional direct perception approach, categories make the affordance learning problem scalable, especially with scare training data and in incremental learning of new affordances. Another key aspect of our approach is to leverage the ability of a robot to perform experiements on its environment and gather information independent of human trainer. We validate our theory on experiements with physically-situated robots. Finally, we refocus the object categorization problem of computer vision back to the robotics workd and extend the Gluck-Corter category utility for the task of affordance prediciton.
The impact of technology on the payment system in Kuwait
Authors: Hana Razzouqi
Venue: Proceedings of the 2009 conference on Information Science, Technology and Applications (2009)

One of the Primary functions of any central bank in a given country, is the provision of safe and robust payment means and mechanisms. These mechanisms range from availing currency and coins (normally referred to as cash) to cheques, cards, and electronic money transfers. This presentation will focus on the impact that technology has on advancing the payment services, and project the current payment system in Kuwait and its future in that regard.
Network Know-How: An Essential Guide for the Accidental Admin
Authors: John Ross
Venue:  (2009)

Are the machines in your office living isolated lives? Do you have a few computers at home that you want to connect to each other and the Internet? The best way to share files on a group of computers is to create a network. But how do you do that? Network Know-How is your guide to connecting your machines, filled with practical advice that will show you how to get things done. You'll learn the nitty-gritty of network setup, design, and maintenance, from running cables and placing wireless access points to configuring file sharing and printing. This practical and comprehensive guide will teach you how to implement security, create intranets, and more. You'll learn how to: Connect Windows, Macintosh, and Linux computers Implement network addressing Configure your network adapters, hubs, switches, and router Share music, photos, and documents Automate household appliances and stream digital audio and video to your home entertainment center Troubleshoot network slowdowns and failures No matter which operating system you use, and even if you've never installed or run a network before, you'll get what you need to know in Network Know-How..
MaJaB: improving resource management for web-based applications on mobile devices
Authors: Du Li, Manish Anand
Venue: Proceedings of the 7th international conference on Mobile systems, applications, and services (2009)

The Web has become the host platform for interactive and collaborative applications that usually consist of multiple Web services. This transition is pushing the browsers to perform operating system like functionalities for better resource utilization. Unfortunately, there exists limited support for resource management on current Web platforms. This problem is further aggravated on mobile devices because of their limited resources. If current Web communication APIs were used as-is, mobile users would suffer from low responsiveness, battery drainage, and expensive charges. This paper describes the design and implementation of Mobile Ajax Broker (or MaJaB), a middleware layer that performs management and coordination of networking activities of multiple Web services residing in a Web page. MaJaB integrates a range of optimization techniques that were typically applied at the OS level including scheduling, multiplexing, piggybacking, and priority-switching. This work has been implemented as part of EasyMeet, a Web service that enables anytime, anywhere conference participation using any device. MaJaB is built using standard Web technologies to promote easy deployment across platforms. We have evaluated MaJaB over a real-world workload that we observed during our four-month pilot of EasyMeet. Our results show that MaJaB was successful in achieving its goal and, compared to a naive implementation, reduced the percentage of CPU busy periods by 99%, energy consumption by 21%, and network traffic by 25-81% for different participants. While all those improvements result in better user experience, the reduction in network traffic in particular can translate into over $800 saving in international roaming even for a two-user meeting that lasts only for an hour.
Interpreting Face Images by Fitting a Fast Illumination-Based 3D Active Appearance Model
Authors: Salvador E. Ayala-Raggi, Leopoldo Altamirano-Robles, Janeth Cruz-Enriquez
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

We present a fast and robust iterative method for interpreting face images under non-uniform lighting conditions by using a fitting algorithm which utilizes an illumination-based 3D active appearance model in order to fit a face model to an input face image. Our method is based on improving the Jacobian each iteration using the parameters of lighting that have been estimated in preceding iterations. In the training stage, we precalculate a set of synthetic face images of basis reflectances and albedo generated from displacing one at the time, each one of the model parameters, and subsequently, in the fitting stage, we use all these images in combination with lighting parameters for assembling a Jacobian matrix adapted to the illumination estimated in the last iteration. In contrast to other works where an initial pose is required to begin the fit, our approach only uses a simple initialization in translation and scale. At the end of the fitting process, our algorithm obtains a compact set of parameters of albedo, 3D shape, 3D pose and illumination which describe the appearance of the input face image.
An arbitration system for student evaluation based on XML signature
Authors: Robert Andrei Buchmann, Sergiu Jecan
Venue: Proceedings of the 2nd conference on European computing conference (2008)

This paper promotes an e-learning application model for student evaluation, based on AJAX frameworks in order to provide improved user experience and asynchronous data exchange and the XML Signature standard in order to impose message authentications for the test papers. The motivation of this research is the need to arbitrate contestation for e-learning evaluation by providing an authentication and non-repudiation mechanism for both the students 'answers and the teachers' evaluation criteria and rating, especially in open answer tests.