ppxscal/embedding_network huggingface dataset:
Knowledge management in intelligent manufacturing enterprise
Authors: I. Dumitrache, S. I. Caramihai, A. Stanescu
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The paper is presenting new trends in manufacturing paradigm, supported by knowledge management concepts and architectures. Evolution of manufacturing and of knowledge management was a dual process, each of them supporting and triggering the other's qualitative shifts. In the context of future e-economy and knowledge society, new challenges are appearing. A knowledge management architecture is presented, supporting intelligent enterprise, by using concepts from complex system theory and control engineering approaches.
Devanagari OCR using a recognition driven segmentation framework and stochastic language models
Authors: Suryaprakash Kompalli, Srirangaraj Setlur, Venu Govindaraju
Venue: International Journal on Document Analysis and Recognition (2009)

This paper describes a novel recognition driven segmentation methodology for Devanagari Optical Character Recognition. Prior approaches have used sequential rules to segment characters followed by template matching for classification. Our method uses a graph representation to segment characters. This method allows us to segment horizontally or vertically overlapping characters as well as those connected along non-linear boundaries into finer primitive components. The components are then processed by a classifier and the classifier score is used to determine if the components need to be further segmented. Multiple hypotheses are obtained for each composite character by considering all possible combinations of the classifier results for the primitive components. Word recognition is performed by designing a stochastic finite state automaton (SFSA) that takes into account both classifier scores as well as character frequencies. A novel feature of our approach is that we use sub-character primitive components in the classification stage in order to reduce the number of classes whereas we use an n-gram language model based on the linguistic character units for word recognition.
Development of a Real-Time Evaluation System for Microteaching
Authors: Kouichi Shiraishi, Shin'nosuke Yamaguchi, Yoshimasa Ohnishi, Kazunori Nishino
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

We have developed an evaluation system for microteaching. Unlike conventional evaluation methods using paper medium, our system enables evaluation comments to be inputted in real time. In addition, our system enables evaluation comments to be displayed using a video while microteaching. As a result, an evaluator is able to input a comment while watching the teaching practice and the student is able to check the comments while watching the video.
Early Recognition of Gesture Patterns Using Sparse Code of Self-Organizing Map
Authors: Manabu Kawashima, Atsushi Shimada, Rin-Ichiro Taniguchi
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

We propose a new gesture recognition method which is called "early recognition". Early recognition is a method to recognize sequential patterns at their beginning parts. Therefore, in the case of gesture recognition, we can get a recognition result of human gestures before the gestures have finished. We realize early recognition by using sparse codes of Self-Organizing Map.
A service-oriented approach for integrating multiagent system designs
Authors: Walamitien H. Oyenan, Scott A. DeLoach, Gurdip Singh
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

As agent technology acceptance grows, there is a need for software engineering approaches to deal with the design of large, complex multiagent applications. Currently, existing approaches work well for small systems but are not well suited for large, complex applications. Thus, we propose extending multiagent approaches with service-oriented principles to simplify the design of such systems. Our approach composes small multiagent-based services to build larger, more complex applications. This paper introduces the key concepts required to design reusable multiagent services and shows how the services can be composed to create complex multiagent applications.
Multiparadigm Programming in Object-Oriented Languages: Current Research
Authors: Jörg Striegnitz, Kei Davis
Venue: Object-Oriented Technology. ECOOP 2008 Workshop Reader: ECOOP 2008 Workshops Paphos, Cyprus, July 7-11, 2008 Final Reports (2008)

While OO has become ubiquitously employed for design, implementation, and even conceptualization, many practitioners recognize the concomitant need for other programming paradigms according to problem domain. Nevertheless, the choice of a programming paradigm is strongly influenced by the supporting programming language facilities. In turn, choice of programming language is usually highly constrained by practical considerations.We seek answers to the question of how to address the need for other programming paradigms, or even domain specific languages, in the general context of OO languages.It is clear that this field is active and fluid: novel, disparate approaches and techniques are still being discovered or invented, and this very novelty adds a significant element of intellectual entertainment. This article describes the cross section of research efforts reported at the workshop on Multiparadigm Programming in Object-Oriented Languages held at the 2008 European Conference on Object-Oriented Programming.
Impact of Comment Statement on Code Stability in Open Source Development
Authors: Hirohisa Aman, Hirokazu Okazaki
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Comment statements written in a source code are important information to understand and to maintain the source code. This paper performs an empirical study of impacts of comment statements on source code stability in an open source development. The study collected 4,521 source code and their version-upgrade data from a major open source software project, Eclipse. The empirical results show the following findings: (1) a source code with a high comment-density (about more than 40%) has a tendency to be stable through the upgrdes, but (2) a source code with frequently-written comments has the opposite tendency. This work thus concludes that describing many comments is recommend for developing a stable code, but frequently describing comments is discouraged.
MIMO system reduction using modified pole clustering and genetic algorithm
Authors: C. B. Vishwakarma, R. Prasad
Venue: Modelling and Simulation in Engineering (2009)

A new mixed method for reducing the order of the large-scale linear dynamic multi-input-multi-output (MIMO) systems has been presented. In this method, the common denominator polynomial of the reduced-order transfer function matrix is synthesized by using modified pole clustering while the coefficients of the numerator elements are computed by minimizing the integral square error between the time responses of the original and reduced system element using Genetic Algorithm. The modified pole clustering generates more dominant cluster centres than cluster centres obtained by pole clustering technique already available in literature. The proposed algorithm is computer-oriented and comparable in quality. This method guarantees stability of the reduced model if the original high-order system is stable. The algorithm of the proposed method is illustrated with the help of an example and the results are compared with the other well-known reduction techniques.
Supply Chain Management with Revenue-Sharing Contract in a JIT Setting
Authors: Taigui Qin
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper investigates supply chain management between the retailer and the supplier with revenue-sharing contract under uncertain demand by means of a single-period order within a Just-In-Time setting. And we also show how to effectively handle the demand uncertainty in a supply chain, both for the case of a centralized-decision-making system and the case of decentralized-decision-making system. The aim of the paper is to find the optimal order from the retailer in both systems in order that the total expected profits are maximal. The paper focuses not only on the overall performance but also on the allocation of the profit between the retailer and the supplier.
Extending the metaphor GIS query language and environment to 3D domains
Authors: G. Tortora, L. Paolino, M. Sebillo, G. Vitiello, F. Pittarello
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The aim of our research is to provide GIS users with a visual environment where they can formulate spatial queries which implicitly capture the double nature of geographical data. In particular, in this paper we propose an extension to the MGISQL visual environment, where users may pose 3D queries about those phenomena where the third dimension is a relevant feature for data retrieving. The interaction between users and the visual environment is performed by manipulating 3D geometaphors. The underlying algebra for spatial operators is enriched accordingly. Visual queries are composed in a 3D environment, called the Sensitive Cube, characterized by the 3D geometaphors, visualized as 'floating objects'. A prototype of the 3D MGISQL visual environment has been realized, which allows users to query an archaeological--geographical database, whose experimental data refer to a site located around the city of Salerno.
Multicarrier authentication at the physical layer
Authors: Paul L. Yu, John S. Baras, Brian M. Sadler
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Authentication is the process where claims of identity are verified. Though authentication mechanisms typically exist above the physical layer, physical layer methods have recently been introduced that do not require extra bandwidth. In this paper we propose a multi-carrier extension to the work and consider the stealth and robustness tradeoffs. We conclude by discussing the power-reliability tradeoff and the applicability to cross-layer security.
Artificial neural networks for optimization of gold-bearing slime smelting
Authors: David Liu, Yudie Yuan, Shufang Liao
Venue: Expert Systems with Applications: An International Journal (2009)

Pyrometallurgy is often used in the industrial process for treating gold-bearing slime. Slag compositions have remarkable influences on the recovery of gold and the gold content in slag. A method for determining optimum flux compounding with neural networks is studied in this paper, and the neural network model for estimating the gold contents with different slag compositions is presented. On the basis of the neural network model, an algorithm for searching the optimum flux compounding in the gold-slime smelting process is proposed, and the optimum flux compositions are obtained accordingly.
Double submissions: publishing misconduct or just effective dissemination?
Authors: Henning Schulzrinne
Venue: ACM SIGCOMM Computer Communication Review (2009)

As the community develops an ever more diverse set of venues for disseminating and discussing technical work and as the traditional resource constraints change from pages and shelf space to reviewer time, the traditional prohibition against double submission deserves closer consideration. We discuss reasons why double submissions have been frowned upon, and try to establish a set of guidelines that ensure appropriate review and dissemination, without preventing informal early discussion of research projects.
Extractive summarization based on event term clustering
Authors: Maofu Liu, Wenjie Li, Mingli Wu, Qin Lu
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

Event-based summarization extracts and organizes summary sentences in terms of the events that the sentences describe. In this work, we focus on semantic relations among event terms. By connecting terms with relations, we build up event term graph, upon which relevant terms are grouped into clusters. We assume that each cluster represents a topic of documents. Then two summarization strategies are investigated, i.e. selecting one term as the representative of each topic so as to cover all the topics, or selecting all terms in one most significant topic so as to highlight the relevant information related to this topic. The selected terms are then responsible to pick out the most appropriate sentences describing them. The evaluation of clustering-based summarization on DUC 2001 document sets shows encouraging improvement over the well-known PageRank-based summarization.
Improving communication barriers for on-site information flow: An exploratory study
Authors: Ming-Kuan Tsai
Venue: Advanced Engineering Informatics (2009)

On-site information management is an important issue. Since the lack of on-site information impacts project management, this study focuses on the improvement of on-site information flow. When activity workers report on-site activity information, activity managers can understand the status of on-site activities. This procedure forms the flow of on-site information from the activity workers to the activity managers. By examining a material management case study, this study found that communication barriers affected the on-site information flow, even though several types of information technology were used at the construction site. For improving the communication barriers, this study developed an exploratory system through integrating both wireless and speech technologies. The exploratory system achieved two-way speech communication between the activity workers and operation devices. Information interdependence, human-machine collaboration, and the relationship of project participants were also enhances. In summary, the findings of this study are useful for similar issues in project management.
Tail recursion by using function generalization
Authors: Manuel Rubio-Sánchez, J. Ángel Velázquez-Iturbide
Venue: ACM SIGCSE Bulletin (2009)

The design of tail recursive algorithms may require thinking about iteration rather than recursion. This paper provides a methodology for deriving tail recursive functions that is based on declarative programming and the concept of function generalization, which allow to avoid iterative thinking.
Tailoring greenstone for seniors
Authors: Sally Jo Cunningham, Erin K. Bennett
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

We present a re-design of Greenstone to support seniors (aged over 65) in managing documents reflecting their life history.
Reasoning about Movement in Two-Dimensions
Authors: Joshua Gross
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

Reasoning about movement in two-dimensions can be broken down to depth and spatial relations between objects. This paper covers previous work based on the formal logic descriptions in situational calculus. Also covered is a simulator that produces data for a logical reasoner to process and potentially make decisions about motion in two-dimensions. 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
Open educational practices and resources based on social software, UTPL experience
Authors: Nelson Piedra, Janneth Chicaiza, Jorge López, Edmundo Tovar, Oscar Martínez
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

Open Educational Practices and Resources are a direct response to privatization of knowledge; they promote their exchange across the world with the aim of increasing human intellectual capacity. In this document we will discuss the Open Educational Practices and Resources Movement and the notion that knowledge is a public good where technology in general, and specifically Web 2.0, provide an extraordinary opportunity for people to acquire key competences in a knowledge society while they share, use, and re-use digital contents. We will describe the key function of tools and services based on Social Software in the Web 2.0 environment in the OERs production, based on experiences gained at the Universidad T&eacute;cnica Particular de Loja (Ecuador). Moreover, we describe the commitment of the University to the promotion of open educational practices and resources and their impact on society and knowledge economy. This is accomplished through the use of Social Software as a potential key to producing changes in the actual production model, moving from a hierarchical transfer of knowledge from the teacher to a new range of open and collaborative educational practices centered on the student.
Anticipative coordinated cognitive processes for interactivist and Piagetian theories
Authors: Jean-Charles Quinton, Jean-Christophe Buisson, Filipo Perotto
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

This paper presents a model of intelligence based on principles introduced by Piaget and the interactivist framework. It focuses on embodiment and sensory-motor aspects of the mind but copes with general issues such as regulation, accommodation to noise and variability or synchronization of the agent internal dynamics with the environment. The proposed evolutionary and constructivist theory is illustrated by a real-time rhythm recognition program and goal-reaching algorithm, both based on prediction and assimilation.
Recursive modeling for completed code generation
Authors: Selo Sulistyo, Andreas Prinz
Venue: Proceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture (2009)

Model-Driven Development is promising to software development because it can reduce the complexity and cost of developing large software systems. The basic idea is the use of different kinds of models during the software development process, transformations between them, and automatic code generation at the end of the development. But unlike the structural parts, fully-automated code generation from the behavior parts is still hard, if it works at all, restricted to specific application areas using a domain specific language, DSL. This paper proposes an approach to model the behavior parts of a system and to embed them into the structural models. The underlying idea is recursive refinements of activity elements in an activity diagram. With this, the detail generated code depends on the depth at which the refinements are done, i.e. if the lowest level of activities is mapped into activities executors, the completed code can be obtained.
Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
Authors: Douglas Cenzer, Johanna N. Franklin, Jiang Liu, Guohua Wu
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high, but not superhigh, c.e. degrees. Recent research shows that the notion of superhighness is closely related to algorithmic randomness and effective measure theory. Jockusch and Mohrherr proved in [4] that the diamond lattice can be embedded into the c.e. tt-degrees preserving 0 and 1 and that the two atoms can be low. In this paper, we prove that the two atoms in such embeddings can also be superhigh.
How to Trace and Revise Identities
Authors: Julien Gaugaz, Jakub Zakrzewski, Gianluca Demartini, Wolfgang Nejdl
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

The Entity Name System (ENS) is a service aiming at providing globally unique URIs for all kinds of real-world entities such as persons, locations and products, based on descriptions of such entities. Because entity descriptions available to the ENS for deciding on entity identity--Do two entity descriptions refer to the same real-world entity?--are changing over time, the system has to revise its past decisions: One entity has been given two different URIs or two entities have been attributed the same URI. The question we have to investigate in this context is then: How do we propagate entity decision revisions to the clients which make use of the URIs provided by the ENS?In this paper we propose a solution which relies on labelling the IDs with additional history information. These labels allow clients to locally detect deprecated URIs they are using and also merge IDs referring to the same real-world entity without needing to consult the ENS. Making update requests to the ENS only for the IDs detected as deprecated considerably reduces the number of update requests, at the cost of a decrease in uniqueness quality. We investigate how much the number of update requests decreases using ID history labelling, as well as how this impacts the uniqueness of the IDs on the client. For the experiments we use both artificially generated entity revision histories as well as a real case study based on the revision history of the Dutch and Simple English Wikipedia.
Regularization and feature selection in least-squares temporal difference learning
Authors: J. Zico Kolter, Andrew Y. Ng
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We consider the task of reinforcement learning with linear value function approximation. Temporal difference algorithms, and in particular the Least-Squares Temporal Difference (LSTD) algorithm, provide a method for learning the parameters of the value function, but when the number of features is large this algorithm can over-fit to the data and is computationally expensive. In this paper, we propose a regularization framework for the LSTD algorithm that overcomes these difficulties. In particular, we focus on the case of l1 regularization, which is robust to irrelevant features and also serves as a method for feature selection. Although the l1 regularized LSTD solution cannot be expressed as a convex optimization problem, we present an algorithm similar to the Least Angle Regression (LARS) algorithm that can efficiently compute the optimal solution. Finally, we demonstrate the performance of the algorithm experimentally.
Distributed Continuous Action Recognition Using a Hidden Markov Model in Body Sensor Networks
Authors: Eric Guenterberg, Hassan Ghasemzadeh, Vitali Loseu, Roozbeh Jafari
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

One important application of Body Sensor Networks is action recognition. Action recognition often implicitly requires partitioning the sensor data into intervals, then labeling the partitions according to the actions each represents or as a non-action. The temporal partitioning stage is called segmentation and the labeling is called classification. While many effective methods exist for classification, segmentation remains problematic. We present a technique inspired by continuous speech recognition that combines segmentation and classification using Hidden Markov Models. This technique is distributed and only involves limited data sharing between sensor nodes. We show the results of this technique and the bandwidth savings over full data transmission.