ppxscal/embedding_network huggingface dataset:
Dynamic skin deformation with characteristic curves
Authors: L. H. You Xiaosong Yang Jian J. Zhang
Venue: Computer Animation and Virtual Worlds (2008)

By simulating motion and deformation of a set of 3D characteristic curves defining surfaces, we introduce a new skin deformation technique to animate skin deformation of character models. This technique consists of two parts, representation of characteristic curves and dynamic skin deformation. The first part is to extract characteristic curves of an existing model, that is a polygon model or a NURBS model, represent the characteristic curves with time-dependent 3D trigonometric curves, and relate the surface points of the model to these trigonometric curves. The advantage of such a treatment is that it can transform an original 3D problem into a 2D problem, making it much quicker and easier to process and compute. In the second part, a vector-valued dynamic fourth-order differential equation is employed to govern the behaviour of the time-dependent 3D trigonometric curves. These dynamic differential equations incorporate both the time component and the physical properties of the material, which are given by the user. Thus, the character model can be made to animate (deform) following the user-specified behaviour parameters. Our experiments demonstrate that this technique is able to produce realistic skin deformations efficiently and avoid the undesirable skinning problems suffered by some existing skinning techniques. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Entity Ranking Based on Category Expansion
Authors: Janne Jämsen, Turkka Näppilä, Paavo Arvola
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper introduces category and link expansion strategies for the XML Entity Ranking track at INEX 2007. Category expansion is a coefficient propagation method for the Wikipedia category hierarchy based on given categories or categories derived from sample entities. Link expansion utilizes links between Wikipedia articles. The strategies are evaluated within the entity ranking and list completion tasks.
On Efficient Resource Allocation in Communication Networks
Authors: Michał Karpowicz, Krzysztof Malinowski
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We study the problem of allocating a single divisible resource to strategic agents in communication networks. For the setting of inelastic supply we formulate conditions for the efficiency of Nash equilibria in a resulting resource allocation game. Then we answer the question how to design a mechanism which yields efficient allocations and analyze revenues generated by the proposed class of mechanisms. Finally, we propose a distributed resource allocation algorithm and prove its convergence.
Statistical Shape Space Analysis Based on Level Sets
Authors: Nina Kozic, Miguel Á. González Ballester, Moritz Tannast, Lutz P. Nolte, Mauricio Reyes
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

A framework for optimisation of specific criteria across the shape variability found in a population is proposed. The method is based on level set segmentation in the parametric space defined by Principal Component Analysis (PCA). The efficient narrow band evolution of the level set allows to search for the instances only in the neighborhood of the zero level set and not in the whole shape space. We are able to optimise any given criterion not to provide a single best fitting instance in the shape space, but rather to provide a group of instances that meet the criterion. This effectively defines a partition in the shape space, which can have any topology. The method works for data of any dimension, determined by the number of principal components retained. Results are shown on the application to shape analysis of human femora.
A Purchase Protocol with Live Cardholder Authentication for Online Credit Card Payment
Authors: Hannan Xiao, Bruce Christianson, Ying Zhang
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

While online shopping are becoming more accepted by people in modern life, cardholders are more concerned about card fraud and the lack of cardholder authentication in the current online credit card payment. This paper proposes a purchase protocol with live cardholder authentication for online transaction which combines telephone banking and online banking together. The order information and payment information are sent though the Internet and encrypted by asymmetric key encryption. The cardholder is authenticated by the card issuing bank ringing back to the customer's phone number and the cardholder inputting the secure PIN and the amount to pay. The live cardholder authentication makes the cardholder feel securer and card fraud difficult. Furthermore, the protocol does not require the cardholder to obtain a public key certificate or install additional software for the online transaction.
Comparative analysis of classical and fuzzy PI algorithms
Authors: Jenica Ileana Corcau, Eleonor Stoenescu, Mihai Lungu
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In this paper is presented a fuzzy PI controller. Fuzzy PI controller and principles their performing is considered in large applications. Some investigations deal with the comparison of PI and Fuzzy PI algorithms for application. The settings of classical controllers are based on deep common physical background. Fuzzy controller can employ better behavior comparing with classical PI controller because of its nonlinear characteristics.
Adjusting Weights and Architecture of Neural Networks through PSO with Time-Varying Parameters and Early Stopping
Authors: Lamartine A. Teixeira, Felipe T. G. Oliveira, Adriano L. I. Oliveira, Carmelo J. A. Bastos Filho
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

This paper presents results of an approach to optimize architecture and weights of MLP Neural Networks, which is based on Particle Swarm Optimization with time-varying parameters and early stopping criteria. This approach was shown to achieve a good generalization control, as well as similar or better results than other techniques, but with a lower computational cost, with the ability to generate small networks and with the advantage of the automated architecture selection, which simplify the training process.
An Interpolation Method That Minimizes an Energy Integral of Fractional Order
Authors: H. Gunawan, F. Pranolo, E. Rusyaman
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

An interpolation method that minimizes an energy integral will be discussed. To be precise, given N + 1 points (x 0,c 0), (x 1,c 1),..., (x N ,c N ) with 0 = x 0 < x 1 < ¿ < x N = 1 and c 0 = c N = 0, we shall be interested in finding a sufficiently smooth function u on [0,1] that passes through these N + 1 points and minimizes the energy integral $E_\alpha(u) := \int_0^1 |u^{(\alpha)}(x)|^2 dx$, where u (¿) denotes the fractional derivative of u of order ¿. As suggested in [1], a Fourier series approach as well as functional analysis arguments can be used to show that such a function exists and is unique. An iterative procedure to obtain the function will be presented and some examples will be given here.
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network
Authors: Ludovic Cottret, Paulo Vieira Milreu, Vicente Acuña, Alberto Marchetti-Spaccamela, Fábio Viduani Martinez, Marie-France Sagot, Leen Stougie
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

We present the first exact method based on the topology of a metabolic network to find minimal sets of metabolites (called precursors) sufficient to produce a set of target metabolites. In contrast with previous proposals, our model takes into account self-regenerating metabolites involved in cycles, which may be used to generate target metabolites from potential precursors. We analyse the complexity of the problem and we propose an algorithm to enumerate all minimal precursor sets for a set of target metabolites. The algorithm can be applied to identify a minimal medium necessary for a cell to ensure some metabolic functions. It can be used also to check inconsistencies caused by misannotations in a metabolic network. We present two illustrations of these applications.
Solving the k-Winners-Take-All Problem and the Oligopoly Cournot-Nash Equilibrium Problem Using the General Projection Neural Networks
Authors: Xiaolin Hu, Jun Wang
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

The k-winners-take-all (k-WTA) problem is to select k largest inputs from a set of inputs in a network, which has many applications in machine learning. The Cournot-Nash equilibrium is an important problem in economic models . The two problems can be formulated as linear variational inequalities (LVIs). In the paper, a linear case of the general projection neural network (GPNN) is applied for solving the resulting LVIs, and consequently the two practical problems. Compared with existing recurrent neural networks capable of solving these problems, the designed GPNN is superior in its stability results and architecture complexity.
Programming Ubiquitous and Mobile Computing Applications with TOTA Middleware
Authors: Xingbo Yu, Koushik Niyogi, Sharad Mehrotra, Nalini Venkatasubramanian
Venue: IEEE Distributed Systems Online (2003)

Computer-based systems will be increasingly embedded in many of our everyday objects and in much of our environment. Typical systems will be communication enabled and able to interact with each other in the context of complex distributed applications.
(e-)Accessibility Research from the Perspective of the Tourism, Sport and Leisure Industries --- Selected Project Results and Future Focus of the e-Motion Competence Centre
Authors: Markus Lassnig, Mark Markus, Kerstin Matausch, Franz Pühretmair, Andreas Wagner
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper presents selected research results of the project "Accessible Sport Regions" and outlines the future (e-)accessibility research initiatives within the e-Motion competence centre. Based on the empirical research, the project establishes a relation between the considerable accessibility market and the relatively small number of current tourists with disabilities in the region of Salzburg, indicating large unexploited potentials. According to experts, even moderate investments in accessible services and infrastructure could yield high returns. A disproportion between the provision of and demand for accessible infrastructure will be discussed. To provide an insight into the nature of measures for an tourism industry accessible to people with disabilities, the barriers from the perspective of tourists with disabilities across the tourism service-chain were analyzed.
Agent-Based Simulation of Group Learning
Authors: Maartje Spoelstra, Elizabeth Sklar
Venue: Multi-Agent-Based Simulation VIII: International Workshop, MABS 2007, Honolulu, HI, USA, May 15, 2007, Revised and Invited Papers (2008)

We construct groups of simulated learners that model the behaviour of humans acting in various learning environments, with the aims of studying group learning and focusing on the effects of different goal structures on individuals and groups of learners. Three sets of research objectives are investigated: (1) imitating the behaviour of human learners with a multiagent simulation by modeling characteristics outlined in pedagogical literature; (2) comparing the outcomes of simulated learners operating with different goal structures; and (3) exploring factors that influence the behaviours of simulated learners acting in groups, such as group size and composition, as well as the inclusion of team rewards. We ran a series of experiments as part of this investigation, which are outlined herein.
Bad News on Decision Problems for Patterns
Authors: Dominik D. Freydenberger, Daniel Reidenbach
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

We study the inclusion problem for pattern languages, which is shown to be undecidable by Jiang et al. (J. Comput. System Sci. 50, 1995). More precisely, Jiang et al. demonstrate that there is no effective procedure deciding the inclusion for the class of all pattern languages over all alphabets. Most applications of pattern languages, however, consider classes over fixed alphabets, and therefore it is practically more relevant to ask for the existence of alphabet-specific decision procedures. Our first main result states that, for all but very particular cases, this version of the inclusion problem is also undecidable. The second main part of our paper disproves the prevalent conjecture on the inclusion of so-called similar E-pattern languages, and it explains the devastating consequences of this result for the intensive previous research on the most prominent open decision problem for pattern languages, namely the equivalence problem for general E-pattern languages.
A computational neuroscience model with application to robot perceptual learning
Authors: D. Mitchell Wilkes
Venue:  (2007)

In robotics, one important objective is the ability to teach the robot new skills and have it reason about the current tasks at hand without explicit programming. Indeed, this idea is central to open-ended development, developmental robotics and autonomous mental development. One approach to this issue is to have the robot learn from its own past experience, which would help the robot adapt to changing environments. However, in a learning process, a critical issue to both robots and biological creatures is efficient use of the limited resources available for survival. A robot, operating in a complex, unstructured environment, will encounter many percepts and typically most of them are not relevant to the current task. This suggests the need for a capability to focus attention on the smaller number of items that are relevant to the task. Thus, prefrontal cortex working memory models may be a good fit for learning to associate perception and action, and perhaps other concepts as well, in order to perform a task. Many of the systems in the literature have only crude perceptual capabilities and as a result, the environments are usually very simplified by modifications, such as by using artificial percepts. Such systems may fail in complex, uncontrolled environments, especially under changing lighting conditions. Thus, successful task execution strongly depends on a reliable perceptual system in these types of environments. In this work, a novel implementation of a perceptual system, which operates on an extremely high dimensional feature space, is combined with a biologically inspired working memory model. The perceptual system does not rely on any parametric techniques (i.e., computing eigenvectors, covariance matrices, etc.) and the computational cost does not depend strongly on the number of dimensions. Only vision is used, as the main sensory input for the system. The resulting system initially learns basic behaviors and skills, which in turn, are used to learn more complex behaviors. The success of the system is demonstrated with a vision guided navigation task in a complex, noisy, and unmodified environment.
Progress toward e-government in Poland: Issues and dilemmas
Authors: Agnieszka Demczuk, Agnieszka Pawłowska
Venue: Information Polity (2006)

This paper considers a variety of aspects in the development of e-services in Poland. National e-government strategies as well as legal regulations that prepare the organizational conditions of electronic services delivery are presented. The authors refer to the state of electronic services development in Poland. They base their considerations on two independent research projects conducted in the years 2003-2006. The first was a project that investigated public e-services delivered through the Internet with reference to the entire public administration in Poland; the second was a project that examined Web sites of the Public Information Bulletin, (PIB) administered by local governments in the Lubelskie region. In the first project, twenty public services were investigated. The research showed that in 2004-2006, the level of public e-services in Poland increased, reaching, in most cases, the informational stage and a few in the transactional stage. The second research - executed in three stages - was aimed at answering the following questions: 1. To what extent does local administration in the Lubelskie region follow the national policy of e-government development? 2. Does the project of PIB support electronic communication between administration and citizens? 3. Does the project of PIB support services delivered by local administration? The knotty problems of public e-services development in Poland were named.
The Domain of Admissible Orientation concept: A new method for five-axis tool path optimisation
Authors: C. Castagnetti, E. Duc, P. Ray
Venue: Computer-Aided Design (2008)

This work deals with the optimisation of tool paths in five-axis machining. The objective is to improve the kinematic behaviour of machine tools during milling. The orientation of the tool axis at each point of a tool path is optimised while ensuring quality constraints. These are modelled using the Domain of Admissible Orientation (DAO) concept expressed in the P-System and transformed into the M-System. This article aims at defining the DAO and presents an example of optimisation using this concept. This optimisation is a minimisation of the movement generated by each rotation axis and is applied to two test parts.
Mining frequent items in a stream using flexible windows
Authors: Toon Calders, Nele Dexters, Bart Goethals
Venue: Intelligent Data Analysis (2008)

We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its current frequency in the stream is defined as the maximal frequency over all windows from any point in the past until the current state. We study the properties of the new measure, and propose an incremental algorithm that allows to produce the current frequency of an item immediately at any time. It is shown experimentally that the memory requirements of the algorithm are extremely small for many different realistic data distributions.
Dependent Types, Theorem Proving, and Applications for a Verifying Compiler
Authors: Yves Bertot, Laurent Théry
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

One approach to Prof. Hoare's challenge is to view the development of verified software from the perspective of interactive theorem provers. This idea is not new and many medium-scale software systems have been developed and verified in this manner. Developments based on HOL, ACL2, or PVS have already been described and advocated and our position stands on the same line: most powerful (higher-order) theorem proving systems already contain a programming language, programs can be developed and the correctness of these programs can be specified and verified, they can then be compiled into traditional executable code. In this sense, we already have a small scale example of a verification aware programming language.
Securing Grid Workflows with Trusted Computing
Authors: Po-Wah Yau, Allan Tomlinson, Shane Balfe, Eimear Gallery
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

We propose a novel scheme that uses Trusted Computing technology to secure Grid workflows. This scheme allows the selection of trustworthy resource providers based on their platform states. The integrity and confidentiality of workflow jobs are provided using cryptographic keys that can only be accessed when resource provider platforms are in trustworthy states. In addition, platform attestation is used to detect potential workflow execution problems, and the information collected can be used for process provenance.
Multivariate effects of gender, ownership, and the frequency of use on computer anxiety among high school students
Authors: Mustafa Baloğlu, Vildan Çevik
Venue: Computers in Human Behavior (2008)

Studies that address the problems associated with computer anxiety are abundant; however, fewer studies took into account multivariate nature of the construct. Moreover, studies focusing on high school students are even more limited. Thus, the present study investigated the multivariate effects of gender, ownership, and the frequency of computer use on computer anxiety levels, after controlling for the possible effects of trait anxiety among 715 Turkish high school students. The Computer Anxiety Scale and the State-Trait Anxiety Inventory were used to assess computer anxiety and state and trait anxiety levels, respectively. A 2 X 2 X 3 between-subjects factorial multivariate analysis of covariance was used on three dependent variables that are the three dimensions of computer anxiety: Affective Anxiety, Damaging Anxiety, and Learning Anxiety. Independent variables are gender, ownership (i.e., yes or no), and the frequency of computer use (i.e., everyday, several times a week, or once a week or less). Results showed a significant covariate effect of trait anxiety, significant main effects for gender, ownership, and the frequency of computer use on the dependent variables. No three-way or two-way interaction was detected. After the descriptive and comparative analyses, specific suggestions were provided based on the results.
Inferring Coreferences Among Person Names in a Large Corpus of News Collections
Authors: Octavian Popescu, Bernardo Magnini
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

We present a probabilistic framework for inferring coreference relations among person names in a news collection. The approach does not assume any prior knowledge about persons (e.g. an ontology) mentioned in the collection and requires basic linguistic processing (named entity recognition) and resources (a dictionary of person names). The system parameters have been estimated on a 5K corpus of Italian news documents. Evaluation, over a sample of four days news documents, shows that the error rate of the system (1.4%) is above a baseline (5.4%) for the task. Finally, we discuss alternative approaches for evaluation.