ppxscal/embedding_network huggingface dataset:
The digital curriculum design and implement of teacher's professional growth
Authors: Rong-Jyue Fang, Shu-Hui Wang, Tz-Yauw Lin, Hua-Lin Tsai
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

This article main objective with digital the teacher's professional grows up curriculum activity design and implement: In a case study of the "New e-courses quick start" workshop as an example. Discuss how to design a curriculum for teacher within electric society profession growth, also carry out junior high school teacher further, The purpose is promoting teacher's information to integrate teaching consciousness, and helps it to understand how to create a new network class technique and actual situation, then carrying out the target of diverse teaching. That is to say, by on-line curriculum and actual curriculum of k12 digital school, in the meantime through intercollegiate exchanges and interaction, and guide a teacher to know principle and actual situation that to create a new network class, and try establishment network curriculum. And find that member in the work workshop has 63% to indicate to should grow up after the implement the curriculum collect the teaching and the related resource aspect v ery helpful; 75% indicates high pleasure to create a new network class; 88% indicates the advantage of network teaching helpful to student. And almost all participants in the work shops all approve a network to create a new network class to communicate to have a help to the teachers and the students. In the end, from the teachers' professional growth curriculum activity of design and performance result, put forward the draw-up of related project, growth programming, work demonstration and management of curriculum to expand...etc. and to put forward a suggestion.
Knowledge-Oriented Middleware Using Topic Maps
Authors: Robert Barta
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

In this work we present an architectural overview over a knowledge-based middleware based on Topic Maps. In that, we exploit the TM paradigm as much as possible trying to solve typical middleware-specific tasks. Hereby we use the concept of virtualization to homogenize the data landscape, the TM query language for semantic transformations and a dedicated, RESTful protocol for TM fragment interchange. 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
An Architecture for User Interface R&D
Authors: Antony Williams
Venue: IEEE Computer Graphics and Applications (1986)

The architecture described in this article evolved from an extensive research and experimentation effort in man-machine interaction in the Informatics Division of RAL. Its primary goal is to support research into improving user interface design. The architecture is based on the concept of direct manipulation without time-sequential user-machine dialogues. That is, the user forms his plan of action and carries it out in the sequence best suited to his needs. The system imposes no syntactic structure on the command language, and thus does not enforce particular time sequences. Such a model should extend to cover interaction with dynamic processes as well as simple modification of stored data. The long-term goal of this effort is to evolve the design of a truly general-purpose user interface management system as part of the client architecture. The activities at present include developing a window manager, including defining a client-server interface; developing a preliminary toolkit for user interfaces; and applying the toolkit to the development of an interactive post processor for viewing and manipulating the results of finite element analysis. 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
CME: A Contour Mapping Engine in Wireless Sensor Networks
Authors: Yingqi Xu, Wang-Chien Lee, Gail Mitchell
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Contour maps, showing topological distribution of extracted features, are crucial for many applications. Building a dynamic contour map in a wireless sensor network is a challenging task due to the constrained network resources. In this paper, we present the design of a {\em contour mapping engine} (CME) in wireless sensor networks. Our design incorporates in-network processing based on binary classification to reduce the total number of active nodes. The underlying network architecture is analyzed to derive an optimal configuration. We show, by extensive simulations, the superiority of CME over the state-of-the-art contour mapping techniques.
Syllable-based automatic Arabic speech recognition
Authors: Mohamed Mostafa Azmi, Hesham Tolba, Sherif Mahdy, Mervat Fashal
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

In this paper, we concentrate on the automatic recognition of Egyptian Arabic speech using syllables. Arabic spoken digits were described by showing their constructing phonemes, triphones, syllables and words. Speaker-independent hidden markov models (HMMs)-based speech recognition system was designed using Hidden markov model toolkit (HTK). The database used for both training and testing consists from forty-four Egyptian speakers. Experiments show that the recognition rate using syllables outperformed the rate obtained using monophones, triphones and words by 2.68%, 1.19% and 1.79% respectively. A syllable unit spans a longer time frame, typically three phones, thereby offering a more parsimonious framework for modeling pronunciation variation in spontaneous speech. Moreover, syllable-based recognition has relatively smaller number of used units and runs faster than word-based recognition.
A Social Networking Exploration of Political Blogging in Greece
Authors: Kostas Zafiropoulos, Vasiliki Vrana
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

The paper considers the recent Web debate relatively to the election of Pan-Hellenic Socialist Movement (PASOK) new President. PASOK was defeated on the national election of September 2007, and this defeat brought up a major leadership crisis. Election for a new leader was held on November 2007. The paper examines the posts of blogs linking to the two main candidates. Using social networking theory and statistical analysis, it measures blogs' connectivity, conversational patterns, and variations over time. It examines the skewdeness of incoming blog links and finds the core blog groups that serve as focal points for political bloggers.
Application of the Monte-Carlo Method to Nonlinear Stochastic Optimization with Linear Constraints
Authors: Leonidas Sakalauskas
Venue: Informatica (2004)

We consider a problem of nonlinear stochastic optimization with linear constraints. The method of ε-feasible solution by series of Monte-Carlo estimators has been developed for solving this problem avoiding &ldquo;jamming&rdquo; or &ldquo;zigzagging&rdquo;. Our approach is distinguished by two peculiarities: the optimality of solution is tested in a statistical manner and the Monte-Carlo sample size is adjusted so as to decrease the total amount of Monte-Carlo trials and, at the same time, to guarantee the estimation of the objective function with an admissible accuracy. Under some general conditions we prove by the martingale approach that the proposed method converges a.s. to the stationary point of the problem solved. As a counterexample the maximization of the probability of portfolio desired return is given, too.
Brief paper: A constructive solution for stabilization via immersion and invariance: The cart and pendulum system
Authors: J. Á. Acosta, R. Ortega, A. Astolfi, I. Sarras
Venue: Automatica (Journal of IFAC) (2008)

Immersion and Invariance (I&I) is the method to design asymptotically stabilizing control laws for nonlinear systems that was proposed in [Astolfi, A., & Ortega, R. (2003). Immersion and invariance: A new tool for stabilization and adaptive control of nonlinear systems. IEEE Transactions on Automatic Control, 48, 590-606]. The key steps of I&I are (i) the definition of a target dynamics, whose order is strictly smaller than the order of the system to be controlled; (ii) the construction of an invariant manifold such that the restriction of the system dynamics to this manifold coincides with the target dynamics; (iii) the design of a control law that renders the manifold attractive and ensures that all signals are bounded. The second step requires the solution of a partial differential equation (PDE) that may be difficult to obtain. In this short note we use the classical cart and pendulum system to show that by interlacing the first and second steps, and invoking physical considerations, it is possible to obviate the solution of the PDE. To underscore the generality of the proposed variation of I&I, we show that it is also applicable to a class of n-dimensional systems that contain, as a particular case, the cart and pendulum system.
DRLinda: A Distributed Message Broker for Collaborative Interactions Among Business Processes
Authors: J. Fabra, P. Álvarez, J. Ezpeleta
Venue: Proceedings of the 8th international conference on E-Commerce and Web Technologies (2007)

Recently, coordinationmiddleware systemshave evolved in order to describe coordination protocols in business process scenarios. This evolution proposes the use of three main components, being one of them a message broker to handle collaborative interactions among business processes. In a previous work, we proposed a framework for coordination in open BPM systems which used a centralised Linda-based implementation of amessage broker. The use of a centralised implementation leads to some common problems which a distributed model tries to solve in an efficient manner. In this paper, we present DRLinda, a distributed and dynamic implementation of the message broker based on the RLinda model, which improves and extends the RLinda's features and can be configured at runtime, being suitable formore complex and highly-dynamic business process scenarios. The performance of the proposed implementation is empirically evaluated on a cluster computing environment.
Local Modelling in Classification
Authors: Gero Szepannek, Julia Schiffner, Julie Wilson, Claus Weihs
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

In classification tasks it may sometimes not be meaningful to build single rules on the whole data. This may especially be the case if the classes are composed of several subclasses. Several common as well as recent issues are presented to solve this problem. As it can e.g. be seen in Weihs et al. (2006) there may result strong benefit from such local modelling. All presented methods are evaluated and compared on four real-world classification problems in order to obtain some overall ranking of their performance following an idea of Hornik and Meyer (2007).
Accessible Content Processing Introduction to the Special Thematic Session
Authors: David Crombie, Jan Engelen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The Special Thematic Session (STS) on Accessible Content Processing (ACP) is intended to provide a focus for different but related activities that can be described as having an emphasis on process rather than product. The European Accessible Information Network (EUAIN) was established to bring together the different stakeholders in the accessible content processing chain and to build on common concerns. The parallel PRO-ACCESS project seeks to build on this work and provide ISO 9001 industry-faced guidelines. The papers in this STS address many of the issues addressed by these initiatives and the breadth of interest demonstrates the need for further applied research in this area.
Energy Efficient In-Network Phase RFID Data Filtering Scheme
Authors: Dong-Sub Kim, Ali Kashif, Xue Ming, Jung-Hwan Kim, Myong-Soon Park
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

One of the limitations that prevent proliferation of RFID technology is redundant data transmission within the network usually caused by unreliability of readers and duplicate readings generated by adjacent readers. Such redundancies unnecessarily consume resources of network and depreciate the performance of RFID installation. In this paper, we propose a CLIF, an energy-efficient filtering scheme that detects the in-network redundant data and eliminates it. The simulation results show that the CLIF significantly reduces the number of comparisons required for detecting duplicates while it achieves relatively high duplicate data elimination ratio considering the location of reader. Consequently, CLIF reduces the considerable amount of transmission within the network.
Compiling Declarative Specifications of Parsing Algorithms
Authors: Carlos Gómez-Rodríguez, Jesús Vilares, Miguel A. Alonso
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be able to handle all kinds of schemata for context-free grammars, tree adjoining grammars and other grammatical formalisms, providing an extensibility mechanism which allows the user to define custom notational elements.
Kinetic and dynamic data structures for closest pair and all nearest neighbors
Authors: Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
Venue: ACM Transactions on Algorithms (TALG) (2008)

We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors for a set of n moving points in the plane; insertions and deletions of points are also allowed. If no insertions or deletions take place, the structure for the closest pair uses O(n log n) space, and processes O(n2&beta;s+2(n)log n) critical events, each in O(log2n) time. Here s is the maximum number of times where the distances between any two specific pairs of points can become equal, &beta;s(q) &equals; &lambda;s(q)/q, and &lambda;s(q) is the maximum length of Davenport-Schinzel sequences of order s on q symbols. The dynamic version of the problem incurs a slight degradation in performance: If m &ge; n insertions and deletions are performed, the structure still uses O(n log n) space, and processes O(mn&beta;s+2(n)log3 n) events, each in O(log3n) time. Our kinetic data structure for all nearest neighbors uses O(n log2 n) space, and processes O(n2&beta;2s+2(n)log3 n) critical events. The expected time to process all events is O(n2&beta;s+22(n) log4n), though processing a single event may take &Theta;(n) expected time in the worst case. If m &ge; n insertions and deletions are performed, then the expected number of events is O(mn&beta;2s+2(n) log3n) and processing them all takes O(mn&beta;2s+2(n) log4n). An insertion or deletion takes O(n) expected time.
An Ontology-Based Focused Crawler
Authors: Lefteris Kozanidis
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

In this paper we present a novel approach for building a focused crawler. The goal of our crawler is to effectively identify web pages that relate to a set of pre-defined topics and download them regardless of their web topology or connectivity with other popular pages on the web. The main challenges that we address in our study are: (i) how to effectively identify the pages' topical content before these are fully downloaded and processed and (ii) how to obtain a well-balanced set of training examples that the crawler will regularly consult in its subsequent web visits.
AFPL, an Abstract Language Model for Firewall ACLs
Authors: S. Pozo, R. Ceballos, R. M. Gasca
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Design and management of firewall rule sets is difficult and error prone, mainly because the translation of access control requirements to low level languages is difficult. Abstract languages have been proposed, but none have been adopted by the industry. We think that the main reason is that their complexity is close to many of the existing low level languages. Complexity is defined as the difficulty to express knowledge from the reality being modeled (access control requirements). In this paper, we analyze the most widely used firewall languages and different possibilities of abstraction. Based on this analysis, a model for Firewall languages is proposed, and a new simple yet expressive and powerful firewall abstract language, Abstract Firewall Policy Language (AFPL), is proposed. AFPL can then be translated to existing low level firewall languages, or be directly interpreted by firewall platforms. We expect that AFPL can fill the gap between requirements and low level firewall languages.
A segment-based unsupervised classification for multispectral image
Authors: Nana Liu, Jingwen Lia, Ning Li
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

We present an unsupervised approach for multispectral image classification with graph-based segment and fuzzy c-means clustering. Our method mainly involves following steps: First, represent image as graph H = (V, E) based on the feature vectors of per pixel, and segment it into groups of sub-regions using the graph-based algorithm. Then the fuzzy c-means classifier is used to obtain the classification map based on the sub-regions. Experiments turn out that the approach proposed in this paper can achieve higher accuracy and efficiency by comparing the result with pixel-based fuzzy c-means classification.
A Software Client for Wi-Fi Based Real-Time Location Tracking of Patients
Authors: Xing Liu, Abhijit Sen, Johannes Bauer, Christian Zitzmann
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

More and more healthcare personnel are using computer networks and wireless enabled PDAs (personal digital assistants) in their daily work. This leads to the vision of smart environments with location-based knowledge and information services in healthcare facilities. Location tracking of healthcare workers and patients naturally facilitates the realization of such visions. It is also useful in enhancing the safety of the residents in a nursing facility. This paper introduces the authors' efforts in applying wireless technology to track the locations of residents in nursing homes. A software client is developed for an industrial location tracking product. The design and implementation of the software client are discussed in this paper. Test results are also reported.
A Fast Method for Training Linear SVM in the Primal
Authors: Trinh-Minh-Tri Do, Thierry Artières
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

We propose a new algorithm for training a linear Support Vector Machine in the primal. The algorithm mixes ideas from non smooth optimization, subgradient methods, and cutting planes methods. This yields a fast algorithm that compares well to state of the art algorithms. It is proved to require O(1/¿¿) iterations to converge to a solution with accuracy ¿. Additionally we provide an exact shrinking method in the primal that allows reducing the complexity of an iteration to much less than O(N) where N is the number of training samples.
Automatic Generation of Virtual Computer Rooms on the Internet Using X3D
Authors: Aybars Uğur, Tahir Emre Kalayci
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In this paper, some natural links between virtual reality and interactive 3D computer graphics are specified and Web3D technologies especially VRML and X3D are briefly introduced. Web-based tool which is called EasyLab3D was designed and implemented using X3D. This web-based tool is used to generate automatically 3D virtual computer rooms that can be navigated in. It is important for introduction of departments, companies and organizations which have computer laboratories and for planning new computer rooms. As a result, state-of-the art technologies and methods in development of automatic 3D scene and model generation tools are discussed.
Integrating Web Services and Intelligent Agents in Supply Chain for Securing Sensitive Messages
Authors: Esmiralda Moradian
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Security is a global issue for today's businesses that operate at the crossroads on multiple e-supply chains. Organizations increasingly use agent technologies and web services that allow assembling unique business processes. Businesses share information and manage electronic transactions with trading partners throughout the e-supply chains. The key factor in business success is decisions made on the basis of correct information that needs to be protected. In this paper, we present an approach of integrating web services and intelligent agents in supply chain in order to protect secret business information from being disclosed, modified and lost. To prevent loss and disclosure of sensitive information but also provide information integrity and availability, we apply meta-agents to monitor the software agents' actions and then direct the software agents' work.
Signature Verification Using a Bayesian Approach
Authors: Sargur N. Srihari, Kamal Kuzhinjedathu, Harish Srinivasan, Chen Huang, Danjun Pu
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

The fully Bayesian approach has been shown to be powerful in machine learning. This paper describes signature verification using a non-parametric Bayesian approach. Given sample(s) of Genuine signatures of an individual, the task of signature verification is a problem of classifying a questioned signature as Genuine or Forgery. The verification problem is a two step approach - (i)Enrollment: Genuine signature samples of an individual are provided. The method presented here maps from features space to distance space by comparing all the available genuine signature samples amongst themselves to obtain a distribution in distance space - "within person distribution". This distribution captures the variation and similarities that exist within a particular person's signature; (ii)Classification: The questioned signature to be classified, is then compared to each of the genuine signatures to obtain another distribution in distance space - "Questioned vs Known distribution". The two distributions are then compared using a new Bayesian similarity measure to test whether the samples in the distribution are from the same distribution(Genuine) or not(Forgery). The approach yields improved performance over other non-parametric non Bayesian approaches.