ppxscal/embedding_network huggingface dataset:
An Improved Structured Light Inspection of Specular Surfaces Based on Quaternary Coding
Authors: Chengkun Xue, Yankui Sun
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

Structured light techniques with binary coding are practical to inspect the specular surfaces. The structured light approaches use a scanned array of point sources and images of the resulting reflected highlights to compute local surface orientation. Binary coding scheme is the classic scheme for efficiently coding the light sources. This paper proposes a novel quaternary coding scheme which is much more efficient than the classic binary coding scheme. In this scheme, polychromatic light sources are utilized and coded in quaternary scheme. Our experimental system is described in detail. The problem caused by the polychromatic light sources is discussed too. To solve the problem, we drew lesson from the erosion operator from the Mathematical Morphology and designed an effective algorithm. The experiment results show the new quaternary coding scheme not only keeps a very high accuracy, but also greatly improves the efficiency of the inspection of specular surface.
Parameterised notions of computation
Authors: Robert Atkey
Venue: Journal of Functional Programming (2009)

Moggi's Computational Monads and Power et al.'s equivalent notion of Freyd category have captured a large range of computational effects present in programming languages. Examples include non-termination, non-determinism, exceptions, continuations, side effects and input/output. We present generalisations of both computational monads and Freyd categories, which we call parameterised monads and parameterised Freyd categories, that also capture computational effects with parameters. Examples of such are composable continuations, side effects where the type of the state varies and input/output where the range of inputs and outputs varies. By considering structured parameterisation also, we extend the range of effects to cover separated side effects and multiple independent streams of I/O. We also present two typed λ-calculi that soundly and completely model our categorical definitions – with and without symmetric monoidal parameterisation – and act as prototypical languages with parameterised effects.
Comparing Student-Constructed Open Learner Model Presentations to the Domain
Authors: Andrew Mabbott, Susan Bull
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Increasingly, learning environments are opening the learner model to the user it represents. This paper describes a study in which students were able to create their own presentations of their learner model. We examine the nature of the learner model views created, and the degree of correspondence with the domain. Our results suggest learners have different preferences for the type of view they would like to create, and in many cases use informal or unstructured representational systems.
A Column Generation Algorithm for Choice-Based Network Revenue Management
Authors: Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo Vulcano
Venue: Operations Research (2009)

During the past few years, there has been a trend to enrich traditional revenue management models built upon the independent demand paradigm by accounting for customer choice behavior. This extension involves both modeling and computational challenges. One way to describe choice behavior is to assume that each customer belongs to a segment, which is characterized by a consideration set, i.e., a subset of the products provided by the firm that a customer views as options. Customers choose a particular product according to a multinomial-logit criterion, a model widely used in the marketing literature. In this paper, we consider the choice-based, deterministic, linear programming model (CDLP) of Gallego et al. (2004) [Gallego, G., G. Iyengar, R. Phillips, A. Dubey. 2004. Managing flexible products on a network. Technical Report CORC TR-2004-01, Department of Industrial Engineering and Operations Research, Columbia University, New York], and the follow-up dynamic programming decomposition heuristic of van Ryzin and Liu (2008) [van Ryzin, G. J., Q. Liu. 2008. On the choice-based linear programming model for network revenue management. Manufacturing Service Oper. Management10(2) 288--310]. We focus on the more general version of these models, where customers belong to overlapping segments. To solve the CDLP for real-size networks, we need to develop a column generation algorithm. We prove that the associated column generation subproblem is indeed NP-hard and propose a simple, greedy heuristic to overcome the complexity of an exact algorithm. Our computational results show that the heuristic is quite effective and that the overall approach leads to high-quality, practical solutions.
Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop
Venue: International Conference On Computational Linguistics (2006)

Welcome to the COLING/ACL 2006 Student Research Workshop! The Student Research Workshop is now an established tradition at ACL conferences. This year, we received 40 submissions ranging from 20 countries, and accepted 15 of them. 8 will be presented orally, and 7 as posters, during a common poster session with the main conference.
A numerical study of incompressible flows using the finite element approach
Authors: Karel Frana, Vít Honzejk
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

A finite-element method with the streamline upwind and pressure stabilized Petrov-Galerkin approach is adopted for three dimensional turbulent flow simulations. This flow is mathematically described by partial differential type equations represented by so called Navier-Stokes, continuity and turbulent transport equations. The computational grid is unstructured and is consisted of the tetrahedral element type with equal order interpolation function for velocity and pressure. The robustness and effectiveness of applied numerical approaches are demonstrated on simulations of flows past a cylinder. Simulation parameters such as grid resolutions and computational time are studied in details. Furthermore, obtained numerical results such as velocity fields, Reynolds shear stress tensor or frequency spectra were in good agreement to experiments or numerical results provided by calculations using different computational code.
WSMX 1.0: A Further Step toward a Complete Semantic Execution Environment
Authors: Federico Michele Facca, Srdjan Komazec, Ioan Toma
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

The Web Service Execution Environment (WSMX) project is a continuously ongoing effort that aims at delivering a middleware covering all the Semantic Web Services life cycle. WSMX represents the reference implementation of the Semantically enabled Service Oriented Architecture (SESA) [1]. In this demonstration we aim to present the latest achievements that include: Web Service monitoring, Web Service ranking and Web Service grounding.
Cross-tier, label-based security enforcement for web applications
Authors: Brian J. Corcoran, Nikhil Swamy, Michael Hicks
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

This paper presents SELinks, a programming language focused on building secure multi-tier web applications. SELinks provides a uniform programming model, in the style of LINQ and Ruby on Rails, with language syntax for accessing objects residing either in the database or at the server. Object-level security policies are expressed as fully-customizable, first-class labels which may themselves be subject to security policies. Access to labeled data is mediated via trusted, user-provided policy enforcement functions. SELinks has two novel features that ensure security policies are enforced correctly and efficiently. First, SELinks implements a type system called Fable that allows a protected object's type to refer to its protecting label. The type system can check that labeled data is never accessed directly by the program without first consulting the appropriate policy enforcement function. Second, SELinks compiles policy enforcement code to database-resident user-defined functions that can be called directly during query processing. Database-side checking avoids transferring data to the server needlessly, while still allowing policies to be expressed in a customizable and portable manner. Our experience with two sizable web applications, a modelhealth-care database and a secure wiki with fine-grained security policies, indicates that cross-tier policy enforcement in SELinks is flexible, relatively easy to use, and, when compared to a single-tier approach, improves throughput by nearly an order of magnitude. SELinks is freely available.
Digital watermarking for relational databases using traceability parameter
Authors: Burepalli V. S. Rao, Munaga V. N. K. Prasad
Venue: International Journal of Computer Applications in Technology (2009)

Proving ownership right on outsourced relational database is a crucial issue in today's internet-based application environments and in many content distribution applications. We present a mechanism for proof of ownership which is based on the secure embedding of a robust imperceptible watermark in the relational database. It is achieved by formulating a watermarking method, which will watermark only the numeric attributes and introduce the traceability parameter in the watermark detection technique. This monitors the modifications made to the relational database by the attacker. Proposed watermark detection technique is having a time complexity of O(&#951;), where &#951; is the number of tuples in the relational database and this technique is resilient to subset attack, alteration attack and data replacement attack.
Concurrent Composition Using Loci
Authors: Yang Zhang, Edward Luke
Venue: Computing in Science and Engineering (2009)

The parallel coordination of tasks and data is the most significant challenge in high-performance scientific software development. Performance dictates that distributed data communication is best performed outside of a software module, but this comes with a cost of increased coupling and loss of system cohesion. Therefore, developers often face complicated component interactions and distributed data management problems that are hard to design and optimize. The authors developed a software framework called Loci that provides an automatic system for the generating the communication and synchronization that are required to correctly compose software modules. Within Loci, software components only document their needs: the communication coupling between components is removed because the framework automatically generates it. This significantly simplifies concurrency management for those who develop simulation codes and results in a cleaner software architecture and clear separations of concerns between the numerical algorithms and management of distributed datasets.
Analysis of shape coding approaches used in MPEG-4
Authors: Alaa Hamdy, Mayada Khairy
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

In this paper, a comparative study of shape-coding approaches dealing with "shape from contours" family of techniques used in MPEG-4 is presented. The research focuses on four coding methods; chain code, signature, skeleton and splitting. The analysis includes the relation between bit rate and distortion. The study allows for a more flexible tradeoff between approximation error and bit budget. An operational rate-distortion (ORD), providing tradeoff, is calculated at different levels using different coding methods. A comprehensive comparison, based on the results of using coding methods, shows the capability of each method for different objects -normal and complex- at different levels. Modifications have been done in signature method to deal with complicated objects.
Using Wavelet Based Neural Networks for Feedback Signals Estimation of a Vector Controlled Induction Motor Drive
Authors: Hassan Moghbelli, Akbar Rahideh, Ali A Safavi
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this investigation, a vector controlled induction motor drive is simulated and the feedback signals of this vector controlled drive are estimated using neural networks. The neural networks receive the machine terminal signals as inputs and estimate the rotor flux and unit vectors cos¿ e and sin¿ e as outputs. These outputs are used in the vector controlled drive system. The calculated feedback signals by the neural networks are not sensitive to the motor parameter variations. In this paper, three types of neural networks (i.e. multilayer perceptron (MLP), radial basis function (RBF) and wavenet) are used and the obtained results are compared. Finally, on the basis of the advantages of wavenets, the results prove the accuracy and effectiveness of the wavenet based estimator.
Dramatization Meets Narrative Presentations
Authors: Rossana Damiano, Vincenzo Lombardo, Antonio Pizzo, Fabrizio Nunnari
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In recent times, information presentation has evolved towards sophisticated approaches that involve multi-modal aspects and character-based mediation. This paper presents a novel methodology for creating information presentations based on a dramatization of the content exposition in two respects. On one side, the author plots a character's monologue that aims at achieving presentation goal and exhibits an engaging inner conflict; on the other side, the system architecture dynamically assembles the elementary units of the plot scripted by the author by implementing a tension between contrasting communicative functions. The methodology has been applied in the implementation of a virtual guide to an historical site.
Organizing Coherent Coalitions
Authors: Jan Broersen Rosja Mastop John-Jules Ch. Meyer Paolo Turrini
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we provide and discuss a language to talk about coherence, a property of interaction that ensures players' abilities non to contradict one other and the empty coalition not to make active choices. With this property we can model a closed-world interaction, such as those of a Coordination Game or of a Prisoner Dilemma, where all the outcomes are determined only by the choices of the agents that are present.
Accelerated A* path planning
Authors: David Šišlák, Přemysl Volf, Michal Pěchouček
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The paper addresses the area of path planning for non-holonomic vehicles operating in a large-scale dynamic continuous three-dimensional space where the vehicle has to avoid given obstacles and restricted areas. For vehicles, motion dynamics is defined by means of constraints on the driving manoeuvres and restrictions on smoothness of the trajectory. The paper addresses only the basic spatial path planning problem -- a process searching for a spatial arrangement of the trajectory from the given start position and orientation to the given target position and orientation. Extended problems like incremental planning are not considered by this paper. The dynamic environment means that obstacles' and restricted areas' definitions are altered almost after each particular search.
Modeling Complex Living Systems: A Kinetic Theory and Stochastic Game Approach, 1st edition
Authors: Nicola Bellomo
Venue: Modeling And Simulation In Science, Engineering And Technology (2007)

Using tools from mathematical kinetic theory and stochastic game theory, this work deals with the modeling of large complex systems in the applied sciences, particularly those comprised of several interacting individuals whose dynamics follow rules determined by some organized, or even "intelligent" ability. Traditionally, methods of mathematical kinetic theory have been applied to model the evolution of large systems of interacting classical or quantum particles. This book, on the other hand, examines the modeling of living systems as opposed to inert systems. The author develops new mathematical methods and toolshopefully a "new" mathematicstoward the modeling of living systems. Such tools need to be far more complex than those dealing with systems of inert matter. The first part of the book deals with deriving general evolution equations that can be customized to particular systems of interest in the applied sciences. The second part of the book deals with various models and applications. The presentation unfolds using the following commonapproach in each chapter: * Phenomenological interpretation of the physical system in the context of mathematical modeling * Derivation of the mathematical model using methods from mathematical kinetic theory for active particles * Simulations, parameter sensitivity analysis, and critical inspection of the derived model towards validation * Overview of presented ideas to improve existing models, with special emphasis on applications Specific topics covered include: * Modeling of the competition between cells of an aggressive invasive agent and cells of the immune system * Modeling of vehicular traffic flow * Modeling of swarms and crowd dynamics in complex geometric environments * Methodological aspects related to multiscale modeling of large systems viewed as interconnected subsystems Modeling Complex Living Systemsis a valuable resource for applied mathematicians, engineers, physicists, biologists,economists, and graduate studentsinvolved in modeling complex social systems and living matter in general. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Solving the linear multiple choice knapsack problem with two objectives: profit and equity
Authors: George Kozanidis
Venue: Computational Optimization and Applications (2009)

In this paper, we study an extension of the Linear Multiple Choice Knapsack (LMCK) Problem that considers two objectives. The problem can be used to find the optimal allocation of an available resource to a group of disjoint sets of activities, while also ensuring that a certain balance on the resource amounts allocated to the activity sets is attained. The first objective maximizes the profit incurred by the implementation of the considered activities. The second objective minimizes the maximum difference between the resource amounts allocated to any two sets of activities. We present the mathematical formulation and explore the fundamental properties of the problem. Based on these properties, we develop an efficient algorithm that obtains the entire nondominated frontier. The algorithm is more efficient than the application of the general theory of multiple objective linear programming (MOLP), although there is a close underlying relationship between the two. We present theoretical findings which provide insight into the behavior of the algorithm, and report computational results which demonstrate its efficiency for randomly generated problems.
Towards an Intelligent Tutoring System for Propositional Proof Construction
Authors: Marvin Croy, Tiffany Barnes, John Stamper
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

This article reports on recent efforts to develop an intelligent tutoring system for proof construction in propositional logic. The report centers on data derived from an undergraduate, general education course in Deductive Logic taught at the University of North Carolina at Charlotte. Within this curriculum, students use instructional java applets to practice state-transition problem solving, truth functional analysis, proof construction, and other aspects of propositional logic. Two project goals are addressed here: 1) identifying at-risk students at an early stage in the semester, and 2) generating a visual representation of student proof efforts as a step toward understanding those efforts. Also discussed is the prospect for developing a Markov Decision Process approach to providing students with individualized help.
Compact and low-cost tendon vibrator for inducing proprioceptive illusions
Authors: Ozkan Celik, Marcia K. O'Malley, R. Brent Gillespie, Patricia A. Shewokis, Jose Luis Contreras-Vidal
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Recent literature suggests that inducing proprioceptive movement illusions with predefined movement trajectories via tendon vibration requires use of multiple vibrators and precisely controlled frequency profiles. In this study, we report the design, modeling and control of a compact, low-cost tendon vibrator and illustrate its capability of accurately following time-varying frequency profiles. During the demonstration, participants will test the vibrator to experience illusory elbow flexion.
Game as life --- life as game
Authors: Winslow Burleson, Collin Ruffenach, Camilla Jensen, Uday Kumar Bandaru, Kasia Muldner
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In Game As Life --- Life As Game (GALLAG), ubiquitous computing and personally-tailored game scenarios integrate activities across the virtual and physical domains to further extend emerging avant-garde "real-life games" that are coordinated by digital means to blur digital-physical-social barriers. Influences and activities in GALLAG game scenarios affect real life and vice versa. To realize this, we are using several methods of experience and behavioral assessment, as well as environmental, contextual and physiological sensors, in conjunction with participatory design approaches that include end-user-programming. This agenda empowers users to create their own synergies between their on-line activities to help them achieve their personal realworld aspirations. Ultimately GALLAG is leading to "Life Long Games" that provide persistent, supportive, and actualizing experiences.
Low complexity bit-parallel multipliers based on a class of irreducible pentanomials
Authors: José Luis Imaña, Romá Hermida, Francisco Tirado
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

In this paper, we consider the design of bit-parallel canonical basis multipliers over the finite field GF(2m) generated by a special type of irreducible pentanomial that is used as an irreducible polynomial in the Advanced Encryption Standard (AES). Explicit formulas for the coordinates of the multiplier are given. The main advantage of our design is that some of the expressions obtained are common to any irreducible polynomial, so our multiplier can be generalized to perform the multiplication over general irreducible polynomials. Moreover, the obtained expressions can be easily converted to parameterizable code using hardware description languages. The theoretical complexity analysis also shows that our bit-parallel multipliers present a reduced number of XOR gates with respect to the best known results found in the literature.