ppxscal/embedding_network huggingface dataset:
An Improved Learning Content Management System Framework
Authors: Liyong Wan, Chengling Zhao, Ming Zhao, Luo Qi, Libing Jiang
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

The core of an e-Learning system typically consists of a learning content management system (LCMS). It is aimed at managing learning content which is typically stored in a database. An LCMS provides many essential benefits to e-Learning, but the current system architecture has some disadvantages. The authors analyzed these disadvantages and proposed an improved LCMS (ILCMS) framework. The new framework evolves from local to global. It starts with a local system for local users, and then connects with other local systems to build the broader network.
Production for Graphic Designers, 5th edition
Authors: Alan Pipes
Venue:  (2009)

Now in its fifth edition, thisbook covers the most up-to-date technological advances in graphics and print production, fully explaining all the standard prepress and printing processes, including detailed coverage of the latest digital direct-to-plate offset and small-run on-demand color printing. Production for Graphic Designers gives clear and concisely written advice on preparing artwork for printers, examines the creative potential of typography in a digital environment, and provides comprehensive coverage of working with illustrations, layout and proofing in both computerized and conventional workflows.
Visual versus haptic progressive guidance for training in a virtual dynamic task
Authors: Joel C. Huegel, Marcia K. O'Malley
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

The objective of this work is to demonstrate that progressive haptic guidance can accelerate and improve motor task training outcomes over visual or practice-only methods in a training virtual environment (TVE). To that end, we design haptic and visual guidance schemes based on detailed analyses of performance differences between experts and novice trainees performing a dynamic motor control task in a TVE. Research shows that TVEs that include haptic interfaces produce significant short-term performance gains over audio visual TVEs. However, improved or accelerated long-term training outcomes for dynamic tasks have yet to be demonstrated due, at least in part, to the increasing dependence of the trainee on the assistance. To avoid this dependence, a progressive guidance controller can gradually remove the assistance as the performance of the trainee improves. However, the inputs to the guidance controller must be based on measurements of performance in the necessary kinematic and dynamic components of the task. Prior work introduced two such quantitative performance measures. We implement similar measures, trajectory error and input frequency, to identify and classify performance levels, thereby providing valid and robust inputs to the guidance controller. We demonstrate that progressive haptic guidance schemes can improve training in a dynamic task.
Multi-document summarization by visualizing topical content
Authors: Rie Kubota Ando, Branimir K. Boguraev, Roy J. Byrd, Mary S. Neff
Venue: NAACL-ANLP 2000 Workshop on Automatic Summarization (2000)

This paper describes a framework for multi-document summarization which combines three premises: coherent themes can be identified reliably; highly representative themes, running across subsets of the document collection, can function as multi-document summary surrogates; and effective end-use of such themes should be facilitated by a visualization environment which clarifies the relationship between themes and documents. We present algorithms that formalize our framework, describe an implementation, and demonstrate a prototype system and interface.
The application of the fluctuation expansion with extended basis set to numerical integration
Authors: Cosar Gözüirmizi, Metin Demiralp
Venue: WSEAS Transactions on Mathematics (2009)

According to the fluctuationlessness theorem the matrix representation of a function can be approximated by the image of independent variable operator's matrix representation under that function. The independent variable operator's action is defined as the multiplication of the operand by the independent variable. Hence itself and therefore its matrix representation is universal, do not depend on the function. The application of this approximation to numerical integration forms a quadrature whose structure can be manipulated by changing the basis set of an n-dimensional Hilbert space. This work focuses on reflecting the effects of a complementary Hilbert space to a restricted Hilbert subspace by forming the basis set as certain linear combinations of some basis functions in order to improve the accuracy of the numerical integration based on fluctuationlessness theorem.
Learning and Applying SolidWorks 2007-2008, 2nd edition
Authors: Scott Hansen
Venue:  (2007)

OVERVIEW FOR RELEASES 2003-2008. This unique reference was written with the intention that users can learn Solid Works on their own with little or no outside help. Unlike other books of its kind, it begins at a very basic level and ends at a fairly advanced level. Its perfect for anyone enrolled in Engineering and Technology programs, as well as professionals interested in learning Solid Works. 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
A New Fuzzy Connectivity Measure for Fuzzy Sets
Authors: Olivier Nempont, Jamal Atif, Elsa Angelini, Isabelle Bloch
Venue: Journal of Mathematical Imaging and Vision (2009)

Fuzzy set theory constitutes a powerful representation framework that can lead to more robustness in problems such as image segmentation and recognition. This robustness results to some extent from the partial recovery of the continuity that is lost during digitization. In this paper we deal with connectivity measures on fuzzy sets. We show that usual fuzzy connectivity definitions have some drawbacks, and we propose a new definition that exhibits better properties, in particular in terms of continuity. This definition leads to a nested family of hyperconnections associated with a tolerance parameter. We show that corresponding connected components can be efficiently extracted using simple operations on a max-tree representation. Then we define attribute openings based on crisp or fuzzy criteria. We illustrate a potential use of these filters in a brain segmentation and recognition process.
The geological model and the groundwater aspects of the area surrounding the eastern shores of the dead sea (DS) -Jordan
Authors: E. Akawwi, M. Kakish, N. Hadaden
Venue: WSEAS Transactions on Information Science and Applications (2009)

Many different cross sections were created along the eastern shores of the Dead Sea (DS). These geological cross sections were used to develop a geological model of the DS area and determine the groundwater directions in the area surrounding DS. The geological model showed that the direction of the groundwater flow is to the west and northwest directions toward the Dead Sea. This model shows that the most of the geological units dip to the west and southwest directions toward the Dead Sea. In the area adjacent to the eastern shores of the Dead Sea the B2/A7 which is defined as upper aquifers were eroded and the Kurnub sand stone, Zarka and Ram sandstone group which are defined as a lower aquifers crop out. It shows that the groundwater flows from the east and northeast to the west and southwest toward the Dead Sea. At the east of the Dead Sea the upper aquifer is unsaturated because it crops out.
Photoabsorption and Carrier Transport Modeling in Thin Multilayer Photovoltaic Cell
Authors: František Čajko, Alexander I. Fedoseyev
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The paper describes an efficient implementation of a photoabsorption model for modern thin photovoltaic (PV) cells. As the modelling of solar cells constitutes a multiphysic and multiscale problem, a special attention was paid to the speed while retaining a reasonable accuracy. The model is restrained to a normal incidence but accounts for the whole solar spectrum. Applied transfer matrix method yields an accurate distribution of the light intensity in the semiconductor structure. Usage of equivalent parameters makes it possible to simulate both plain semiconductor material and a quantum dot superlattice based material, which is used to enhance the PV device performance.
On the Fourier spectrum of symmetric Boolean functions
Authors: Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi
Venue: Combinatorica (2009)

We study the following question What is the smallest t such that every symmetric boolean function on &#x03ba; variables (which is not a constant or a parity function), has a non-zero Fourier coefficient of order at least 1 and at most t? We exclude the constant functions for which there is no such t and the parity functions for which t has to be &#x03ba;. Let &#x03c4; (&#x03ba;) be the smallest such t. Our main result is that for large &#x03ba;, &#x03c4; (&#x03ba;)&#x2264;4&#x03ba;/log&#x03ba;. The motivation for our work is to understand the complexity of learning symmetric juntas. A &#x03ba;-junta is a boolean function of n variables that depends only on an unknown subset of &#x03ba; variables. A symmetric &#x03ba;-junta is a junta that is symmetric in the variables it depends on. Our result implies an algorithm to learn the class of symmetric &#x03ba;-juntas, in the uniform PAC learning model, in time n o(&#x03ba;) . This improves on a result of Mossel, O&#x2019;Donnell and Servedio in [16], who show that symmetric &#x03ba;-juntas can be learned in time n 2&#x03ba;/3.
Real-Time Java Programming: With Java RTS, 1st edition
Authors: Eric J. Bruno, Greg Bollella
Venue:  (2009)

The Definitive Guide to Java RTS for Developers and Architects For Java developers and architects moving to real-time, and real-time developers moving to Java Walks through start-to-finish case study applications, identifying their constraints and discussing the APIs and design patterns used to address them Written by the former leader of the real-time Java standards process and one of Wall Streets top real-time developers Sun Microsystems Java Real-Time System (Java RTS) is proving itself in numerous, wide-ranging environments, including finance, control systems, manufacturing, and defense. Java RTS and the RTSJ standard (JSR-001) eliminate the need for complicated, specialized, real-time languages and operating environments, saving money by leveraging Javas exceptional productivity and familiarity. In Real-Time Java Programming, two of Suns top real-time programming experts present the deep knowledge and realistic code examples that developers need to succeed with Java RTS and its APIs. As they do so, the authors also illuminate the foundations of real-time programming in any RTSJ-compatible environment. Key topics include Real-time principles and concepts, and the unique requirements of real-time application design and development How Java has been adapted to real-time environments A complete chapter on garbage collection concepts and Java SE collectors Using the Java RTS APIs to solve actual real-time system problems as efficiently as possible Utilizing todays leading Java RTS development and debugging tools Understanding real-time garbage collection, threads, scheduling, and dispatching Programming new RTSJ memory models Dealing with asynchronous event handling and asynchronous transfer of control
Dynamic hypertext generation for reusing open corpus content
Authors: Ben Steichen, Séamus Lawless, Alexander O'Connor, Vincent Wade
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Adaptive hypermedia systems traditionally focus on providing personalised learning services for formal or informal learners. The learning material is typically sourced from a proprietary set of closed corpus content. A fundamental problem with this type of architecture is the need for handcrafted learning objects, enriched with considerable amounts of metadata. The challenge of generating adaptive and personalised hypertext presentations from open source content promises a dramatic improvement of the choice of information shown to the learner. This paper proposes an architecture of such a dynamic hypertext generation system and its use in an authentic learning environment. The system is evaluated in terms of educational benefit, as well as the satisfaction of the users testing the system. Concluding from this evaluation, the paper will explore the future work necessary to further enhance the system performance and learning experience.
Autonomous Leaves Graph Applied to the Boundary Layer Problem
Authors: Sanderson L. Oliveira, Mauricio Kischinhevsky
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

In physics and fluid mechanics, the boundary layer is the fluid layer in the immediate vicinity of a bounding surface. It is important in many aerodynamic problems. This work presents a numerical simulation of the bidimensional laminar boundary-layer problem considering a steady incompressible flow with no-slip condition on the surface by Autonomous Leaves Graph based on finite volume discretizations. In addition, a Modified Hilbert Curve numbers the control volumes. Initially, the numerical solution of the flat-plate problem is compared to its analytical solution, namely Blasius Solution. Secondly, simulations of the flow along a NACA airfoil shape are presented. Computer experiments show that an adaptive mesh refinement using the Autonomous Leaves Graph with the Modified Hilbert Curve numbering is appropriate for a aerodynamic problem. Finally, results illustrate that the method provides a good trade-off between speed and accuracy.
Evolutionary testing of autonomous software agents
Authors: Cu D. Nguyen, Anna Perini, Paolo Tonella, Simon Miles, Mark Harman, Michael Luck
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

A system built in terms of autonomous agents may require even greater correctness assurance than one which is merely reacting to the immediate control of its users. Agents make substantial decisions for themselves, so thorough testing is an important consideration. However, autonomy also makes testing harder; by their nature, autonomous agents may react in different ways to the same inputs over time, because, for instance they have changeable goals and knowledge. For this reason, we argue that testing of autonomous agents requires a procedure that caters for a wide range of test case contexts, and that can search for the most demanding of these test cases, even when they are not apparent to the agents' developers. In this paper, we address this problem, introducing and evaluating an approach to testing autonomous agents that uses evolutionary optimization to generate demanding test cases.
Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools, 2nd edition
Authors: Michael J. de Smith, Michael F. Goodchild, Paul A. Longley
Venue:  (2007)

This second edition of the widely acclaimed "Geospatial Analysis" guide has been updated and extended to include a major new chapter on Geocomputational Methods. It addresses the full spectrum of analytical techniques that are provided within modern Geographic Information Systems (GIS) and related geospatial software products. It is broad in its treatment of concepts and methods and representative in terms of the software that people actually use.Topics covered include: the principal concepts of geospatial analysis, their origins and methodological context; core components of geospatial analysis, including distance and directional analysis, geometrical processing, map algebra, and grid models; basic methods of exploratory spatial data analysis (ESDA) and spatial statistics, including spatial autocorrelation and spatial regression; surface analysis, including surface form analysis, gridding and interpolation methods; network and locational analysis, including shortest path calculation, traveling salesman problems; facility location and arc routing; Geocomputational methods, including Cellular automata, Agent Based Modelling, Neural Networks and Genetic Algorithms.The Guide has been designed for everyone involved in geospatial analysis, from undergraduate and postgraduate to professional analyst, software engineer and GIS practitioner. It builds upon the spatial analysis topics included in the US National Academies 'Beyond Mapping' and 'Learning to think spatially' agendas, the UK 'Spatial Literacy in Teaching' program, the NCGIA Core Curriculum and the AAAG/UCGIS Body of Knowledge. As such it provides a valuable reference guide and accompaniment to courses built around these programs.
Plenary lecture 6: textual substitution methods for image compression
Authors: Bruno Carpentieri
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

Textual substitution methods, often called dictionary methods, or Lempel-Ziv methods after the important work of Lempel and Ziv, are one-dimensional compression methods that maintain a constantly changing dictionary of strings to adaptively compress a stream of characters by replacing common sub strings with indices (pointers) into a dictionary. Lempel and Ziv proved that the proposed schemes were practical as well as asymptotically optimal for a general source model. Essentially the algorithms that stemmed from these works are collectively known as Lempel Ziv (LZ) coders and are divided in two significantly different classes: LZ1 and LZ2 type methods. These the two classes differ in the way the pointers are represented and in the type of objects to which the pointers point. Two-dimensional (i.e. images) applications of textual substitution methods have been widely studied in the past, as for instance by Lempel and Ziv themselves and Sheinwald. Substantially those applications involve first the application of a linearization strategy to the input data, and then the encoding of the resulting monodimensional vector using LZ type one dimensional methods. Storer first suggested the possibility of using dynamic dictionary methods in combination with Vector Quantization for lossless and lossy compression of bi dimensional data. The AVQ algorithm of Constantinescu and Storer and the LZ1 based algorithm of Storer and Helfgott pioneered this approach by showing that it has a number of advantages with respect to current state-of-the art algorithms such as JPEG. In this presentation we will review the textual substitution methods for image compression, with particular attention to the AVQ class of algorithms, and present recent advances in the field.
An integrated indicator-based system for soil environmental quality assessment in sustainable rehabilitation of mine waste area
Authors: Xiang Zhu, Yingyi Chen, Daoliang Li
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

Establishment and monitoring soil environmental quality in rehabilitation of mine waste area is quite often a difficult task. The efficiency of the scheme selected can be substantially improved by using adequate simple indicators system so that trends can be plotted, elucidated and assessed. This article presents here an indicator-based system of soil environmental quality that evaluates sustainable rehabilitation of mine waste through a set of 2 subindicators, chemical fertility and stocks of organic matter, and further combines them into a single general Indicator of Soil Quality (GISQ). The design and calculation of the indicators were based on sequences of multivariate analyses. Principal component analysis (PCA) was used to assess soil quality overall. A GISQ combined the different subindicators providing a global assessment of soil environmental quality. Our findings provide evidence that selected indicators can provide a definitive, quantitative assessment of soil environmental quality and lend credence to the value of our approach in quantifying relationships between soil function and indicators for specific areas.
A data structure for graph to facilitate hiding of information in a graph's segments &ndash; a graph theoretic approach to steganography
Authors: Vinay Kumar, Sunil Kumar Muttoo
Venue: International Journal of Communication Networks and Distributed Systems (2009)

In this paper, we present a data structure that is suitable for graph representation that can be used as a cover object in steganography. Steganography is a science of hiding information with the purpose of making the information unreadable by a third party. The information is placed in the cover object in such a way that the distortion introduced in the cover object is as minimal as possible and to the extent not recognisable by the human eye. To accomplish the task, redundancy in the representation of the cover object is identified before placing the information in it. There exists a number of data structure for graph representation e.g., adjacency matrix, incidence matrix, adjacency list, etc. These classical data structures allow little scope of finding redundancy in graph. The data structure presented in this paper is file based. It divides a graph into three components: node, segment and intermediate points that constitute a segment. Under the scheme, only planar graph is being considered to maintain clarity in spatial representation of a graph. The presented data structure is aimed to facilitate graph theoretic approach to steganography.
Improvement of the performance using received message on learning of communication codes
Authors: Tatsuya Kasai, Hayato Kobayashi, Ayumi Shinohara
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Communication is a key for facilitating multi-agent coordination on cooperative problems. On unknown problems, however, it is hard to construct beneficial communication codes. In order to tackle such problems, we focus on a method that allows agents to learn communication codes autonomously. Kasai et al. [2] proposed Signal Learning, by which agents learn policies of communication and action concurrently in multi-agent reinforcement learning framework. In this paper, we extend the existing signal learning and apply the extended method to an example problem, where agents can observe only partial information, for verifying the power of communication. We show that the performance of the proposed method is better than that of the existing method, and agents can obtain optimal policies on the applied problem by using the proposed method.
Estimation of Atrial Multiple Reentrant Circuits from Surface ECG Signals Based on a Vectorcardiographic Approach
Authors: Cédric Duchêne, Mathieu Lemay, Jean-Marc Vesin, Adriaan Oosterom
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

This paper presents a simulation study on the identifiability of multiple reentrant circuits on the basis of the vectorcardiogram. The methods involved include an advanced tracking of the basic frequencies of the dominant rotors and a supporting identification based on the observed loops of their vectorcardiogram. The vector cardiogram was derived from body surface potentials spatially sampled by different lead systems. The results indicate that up to three independent circuits can be identified reliably.