ppxscal/embedding_network huggingface dataset:
An Ontology-based Approach for “Procedural CAD Models” Data Exchange
Authors: Samer Abdul Ghafour, Parisa Ghodous, Behzad Shariat, Eliane Perna
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

In the Concurrent Engineering environment, the interoperability of various CAD systems requires maintaining the design intent. In this paper, we present an ontology based approach as a mean for semantic data exchange in engineering design area. Our purpose is to provide capabilities to transfer procedural model data including the design intent. The devised approach consists of developing generic feature-based design ontology in addition of specific design ontologies for CAD systems. Concepts defined in our ontology include parts, features, constraints, history of construction. Interoperability among ontologies is fulfilled by defining several mapping rules. We use descriptive logic language, notably OWL to represent formally our ontology.
Covering a set of points in a plane using two parallel rectangles
Authors: Chandan Saha, Sandip Das
Venue: Information Processing Letters (2009)

In this paper we consider the problem of finding two parallel rectangles in arbitrary orientation for covering a given set of n points in a plane, such that the area of the larger rectangle is minimized. We propose an algorithm that solves the problem in O(n^3) time using O(n^2) space. Without altering the complexity, our approach can be used to solve another optimization problem namely, minimize the sum of the areas of two arbitrarily oriented parallel rectangles covering a given set of points in a plane.
Sentiment analysis of blogs by combining lexical knowledge with text classification
Authors: Prem Melville, Wojciech Gryc, Richard D. Lawrence
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

The explosion of user-generated content on the Web has led to new opportunities and significant challenges for companies, that are increasingly concerned about monitoring the discussion around their products. Tracking such discussion on weblogs, provides useful insight on how to improve products or market them more effectively. An important component of such analysis is to characterize the sentiment expressed in blogs about specific brands and products. Sentiment Analysis focuses on this task of automatically identifying whether a piece of text expresses a positive or negative opinion about the subject matter. Most previous work in this area uses prior lexical knowledge in terms of the sentiment-polarity of words. In contrast, some recent approaches treat the task as a text classification problem, where they learn to classify sentiment based only on labeled training data. In this paper, we present a unified framework in which one can use background lexical information in terms of word-class associations, and refine this information for specific domains using any available training examples. Empirical results on diverse domains show that our approach performs better than using background knowledge or training data in isolation, as well as alternative approaches to using lexical knowledge with text classification.
Towards a semantic self-organising web page-ranking mechanism using computational geometry
Authors: Marios Poulos, Sozon Papavlasopoulos
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In the proposed method for Web page-ranking, a novel theoretic model is introduced and tested by examples of order relationships among IP addresses. The goal is, through a self-organizing procedure, to learn from these examples a real-valued ranking function that induces ranking via a convexity feature. We consider the problem of self-organizing learning from IP data to be represented by a semi-random convex polygon procedure, in which the vertices correspond to IP addresses. Taking into account recent developments in our regularization theory for convex polygons and corresponding Euclidean distance based methods for classification, we develop an algorithmic framework for learning ranking functions based on a Computational Geometric Theory. We provide generalization guarantee for our algorithm, given our recent results, and experimental verification of the potential advantages of our framework.
Determination of Opening Learning Scenarios in Intelligent Tutoring Systems
Authors: Adrianna Kozierkiewicz
Venue: Proceeding of the 2008 conference on New Trends in Multimedia and Network Information Systems (2008)

The main purpose of intelligent tutoring systems is to guarantee an effective learning and offer the optimal learning path for each student. Therefore, determination of learning scenario is a very important task in a learning process. After a new student is registered in the system, he is classified to the appropriate group. Before he begins to learn an opening scenario is determined based on final scenarios of students who belong to the class of learners similar to the new one. The new student is offered the optimal learning path suitable for his preferences, learning styles and personal features. In this paper new knowledge structure, which involves version of lessons, is proposed. For the defined knowledge structure definitions of learning scenario, distance function and the procedure of the scenario determination are presented.
English ABLE
Authors: Diego Zapata-Rivera, Waverely Vanwinkle, Valerie Shute, Jody S. Underwood, Malcolm Bauer
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Assessment-Based Learning Environments (ABLE) make use of assessment information coming from a variety of sources (e.g., formative and summative) to guide instruction. We have developed English ABLE, an assessment based learning environment designed to help English language learners (ELLs) learn about English grammar. Main features of English ABLE include: Item/task reuse (900 enhanced TOEFL® items were recalibrated based on data from all native Spanish speakers who have taken the test), a Bayesian psychometric student model that makes use item statistics, adaptive feedback, adaptive sequencing of tasks, pedagogical agents (Dr. Grammar, Jorge and Carmen), and an indirectly visible student model. This paper presents English ABLE and reports on some preliminary results from a study that involved 149 native Spanish-speaking ELLs.
Using tricitation to dissect the citation image: Conrad Hal Waddington and the rise of evolutionary developmental biology
Authors: Katherine W. McCain
Venue: Journal of the American Society for Information Science and Technology (2009)

An author's citation image is the set of authors with whom the author is cocited. When mapped using standard author cocitation analysis methods based on cited name co-occurrence counts across the entire citation database, the original context of cocitation (the focal author cocited with others) is lost. The citation image of Conrad Hal Waddington, a developmental biologist and evolutionary theorist, is mapped using both cocitation and tricitation approaches over three successive decades, 1975&ndash;1984, 1985&ndash;1994, and 1995&ndash;2004. All authors are tagged with a subject ID based on a principal components analysis of the cocitation data. The cocitation analyses place Waddington in a general subject context. The tricitation PFNets bring the major themes in articles citing Waddington into clearer focus. The changing scholarly landscape in which Waddington's work is used is demonstrated by changes in the citation image author set. These changes are associated with a shift from a primary focus on the mechanisms of evolutionary change (Waddington's work on canalization-genetic assimilation) to a resurgence of interest in Waddington's early experimental embryological work. The latter is linked to the emergence of evolutionary developmental biology, an interdisciplinary research area that examines the role of organismal development in evolutionary change. &copy; 2009 Wiley Periodicals, Inc.
Replica arrangement for location dependent data in consideration of network partition in ad hoc networks
Authors: Gen Tsuchida, Susumu Ishihara
Venue: International Journal of Communication Networks and Distributed Systems (2009)

We propose link-aware and density based replica arrangement (LDR) method for dynamical arrangement of replicas of location dependent data that addresses the difficulties encountered by mobile hosts in ad hoc networks when trying to access data on other hosts due to the movement of hosts, obstacles, etc. In this LDR method, replicas of location dependent data items are placed on mobile hosts neighbouring branch points in the ad hoc network and the density of replicas is controlled in accordance with the degree of the network topology. Performance evaluation by simulation showed that the LDR method performs better than other methods when the requesting host is distant from the location where the target data item is associated and the host is moving quickly.
Fingerprint and On-Line Signature Verification Competitions at ICB 2009
Authors: Bernadette Dorizzi, Raffaele Cappelli, Matteo Ferrara, Dario Maio, Davide Maltoni, Nesma Houmani, Sonia Garcia-Salicetti, Aurélien Mayoue
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

This paper describes the objectives, the tasks proposed to the participants and the associated protocols in terms of database and assessment tools of two competitions on fingerprints and on-line signatures. The particularity of the fingerprint competition is to be an on-line competition, for evaluation of fingerprint verification tools such as minutiae extractors and matchers as well as complete systems. This competition will be officialy launched during the ICB conference. The on-line signature competition will test the influence of multi-sessions, environmental conditions (still and mobility) and signature complexity on the performance of complete systems using two datasets extracted from the BioSecure database. Its result will be presented during the ICB conference.
Sub-graphing web service ontologies to support resource constraints of mobile devices
Authors: Dan Schrimpsher, Letha Etzkorn
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

As web service ontologies grow larger, the ability of mobile devices, such as cell phones and PDA's, to download and reason across them is severely limited. Given that an agent on a mobile device only needs a subset of what is described in a web service ontology, an ontology sub-graph can be created. In this paper, we propose five new metrics to measure the quality in terms of correct query handling of ontology sub-graphs relative to the original ontology. We then correlate these metrics to mean average recall of each ontology sub-graph to show confidence in the metrics ability to predict quality.
Adobe Photoshop Elements 6 Maximum Performance: Unleash the hidden performance of Elements
Authors: Mark Galer
Venue:  (2007)

Unleash the hidden potential for professional image editing in Adobe Photoshop Elements with this project-based, real-world guide.Using step-by-step instructions and accompanying movie tutorials, Mark Galer leads you through the less well-known and most powerful post-production editing techniques Adobe Photoshop Elements has to offer. Cunning tricks and clever workarounds help you to create professional images without features from the full Adobe Photoshop package that you need but don't want to pay for - perform tasks you didn't think were possible in Adobe Photoshop Elements!Whether you're an imaging professional or a photography enthusiast, this book will help you get the maximum performance from your software. Learn how to:* Create striking effects with no commercial lighting or studio equipment* Extend the dynamic range of your digital camera by merging multiple exposures* Optimize, enhance and montage images with stunning resultsThe accompanying DVD provides extensive support with movie tutorials for all projects, high resolution images, multilayered files of completed projects, a stock library and a keyboard shortcut guide.Mark Galer is a freelance photographer, accomplished lecturer and best-selling author of number books on photography. He is an official Adobe Ambassador for Adobe Photoshop and Adobe Photoshop Elements. * Save money by unleashing the hidden potential of Elements for professional image editing rather than upgrading to the full Photoshop software * Practical, step-by-step projects show you how to solve real-world problems and create stunning images using clever workarounds and powerful, little-known techniques * Free DVD includes more than 5 hours of tutorials, image files, a stock library and keyboard shortcut guide - worth the cover price alone! 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
Culture-specific communication management for virtual agents
Authors: Birgit Endrass, Matthias Rehm, Elisabeth André
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Human interaction depends on several individual factors such as personality, social relations, age or gender. But also the society we live in influences our behaviour. Thus culture affects the way communication is led. As virtual agents interact in a more and more human-like manner, culture-specific behaviour should also be taken into account. In this paper, we investigate communication management as one aspect of communication. Our findings in culture related differences are based on a video corpus that was recorded in Germany and Japan as well as on findings described in the literature. To this end, the use of pauses in speech as well as the occurrence of overlapping speech was analyzed and integrated into a demonstrator using virtual agents. In a preliminary study, we investigated whether subjects perceive a difference between agent dialogs that are in line with culture-specific findings and agent dialogs that are not.
Hardware Implementation of Finite-Field Arithmetic, 1 edition
Authors: Jean-Pierre Deschamps
Venue:  (2009)

Implement Finite-Field Arithmetic in Specific Hardware (FPGA and ASIC)Master cutting-edge electronic circuit synthesis and design with help from this detailed guide. Hardware Implementation of Finite-Field Arithmetic describes algorithms and circuits for executing finite-field operations, including addition, subtraction, multiplication, squaring, exponentiation, and division.This comprehensive resource begins with an overview of mathematics, covering algebra, number theory, finite fields, and cryptography. The book then presents algorithms which can be executed and verified with actual input data. Logic schemes and VHDL models are described in such a way that the corresponding circuits can be easily simulated and synthesized. The book concludes with a real-world example of a finite-field application--elliptic-curve cryptography. This is an essential guide for hardware engineers involved in the development of embedded systems. Get detailed coverage of:Modulo m reductionModulo m addition, subtraction, multiplication, and exponentiationOperations over GF(p) and GF(pm)Operations over the commutative ring Zp[x]/f(x)Operations over the binary field GF(2m) using normal, polynomial, dual, and triangular Table of contentsChapter 1. Mathematical backgroundChapter 2. Mod m reductionChapter 3. Mod m operationsChapter 4. Operations over GF(p)Chapter 5. Operations over Zp [x] / f(x)Chapter 6. Operations over GF(pn)Chapter 7. Operations over GF(2m) - Polynomial basesChapter 8. Operations over GF(2m) - Normal basesChapter 9. Operations over GF(2m) - Other basesChapter 10. Elliptic curve cryptographyAppendix A. p = 2(192) - 2(64) - 1Appendix B. Optical Extension FieldsAppendix C. Binary FieldsAppendix D. Ada versus VHDLIndex
Real-time dynamics for geometric textures in shell
Authors: Jin Huang, Hanqiu Sun, Kun Zhou, Hujun Bao
Venue: Computer Animation and Virtual Worlds (2009)

Embedding geometric textures in a shell space around an arbitrary surface has been a popular way to add highly detailed geometric details and enhance visual richness in graphics community, but the dynamic effects of geometric textures have not been modeled and simulated. In this paper, we introduce an efficient algorithm for deforming geometric textures with dynamic effects. The algorithm consists of two steps. First, it computes a deformed shell space by optimizing a material related energy function, which is then used to evaluate the equilibrium position of the geometric texture. Second, an explicit time integration scheme is applied for vibrating the geometric texture around its equilibrium position. Users can deform the geometric textures by dragging its vertices directly, and the dynamic behavior of the geometric textures can be changed by adjusting several material parameters. The dynamic simulation of geometric textures can be easily implemented on GPU and runs at real-time rates. Copyright &copy; 2009 John Wiley & Sons, Ltd. In this paper we introduce a real-time two step method for deforming geometric textures with dynamic effects. The major technical contributions include a shell deformation method which is aware of Poisson's ratio and a vibration simulation algorithm for geometric textures which support variant effects. The simulation can be both driven by an animation sequence of the base mesh or directly manipulating the geometric textures. Dynamic effects of geometric textures can be simulated efficiently by our two-step scheme. In the left, we render the base mesh as a green solid, and the offset mesh as a translucent surface. The right figure shows one frame of the dynamic deformation of the geometric textures which are embedded between them.
Architecture-based performance and reliability analysis of concurrent software applications
Authors: Reda A. Ammar
Venue:  (2008)

Architecture-based performance and reliability analysis of software applications has been the focus of several recent research efforts, as these applications have grown in size and complexity. Prevalent research in the area of architecture-based performance analysis considers concurrency only implicitly, while efforts in the area of architecture-based reliability analysis have focus primarily on sequential applications. Concurrency, however, may be common in modern software applications that are developed using the object-oriented software development paradigm. Thus, performance and reliability analysis considering concurrency within the context of the application architecture is necessary for such applications. This research describes an integrated performance and reliability analysis methodology for concurrent software applications. Central to this methodology is a state space approach, based on Discrete Time Markov Chains (DTMCs) to represent the architecture of a concurrent application. Further, we derive analytical expressions for the expected application performance and reliability, based on the average execution times and constant failure rates of the components and architectural statistics of the application obtained from the solution of the DTMC model representing the application architecture, for both terminating and continuously running applications. We extend our research by relaxing the assumption that the component's execution time is exponentially distributed and consider non-exponential distributions (i.e. hypoexponential and hyperexponential distributions). To enable the application of the methodology to real-life software applications, we further describe how the application architecture may be extracted from UML specification of the application and application's source code. We illustrate the value of the methodology we present a various set of illustrations including (1) illustrative numerical examples, (2) application emulation for terminating and consciously running applications and (3) a case study of a Multithreaded RSS (MRSS) news ticker application. Finally we discuss different solutions for the state-space explosion problem that could arise form our model.
Transfer via soft homomorphisms
Authors: Jonathan Sorg, Satinder Singh
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

The field of transfer learning aims to speed up learning across multiple related tasks by transferring knowledge between source and target tasks. Past work has shown that when the tasks are specified as Markov Decision Processes (MDPs), a function that maps states in the target task to similar states in the source task can be used to transfer many types of knowledge. Current approaches for autonomously learning such functions are inefficient or require domain knowledge and lack theoretical guarantees of performance. We devise a novel approach that learns a stochastic mapping between tasks. Using this mapping, we present two algorithms for autonomous transfer learning -- one that has strong convergence guarantees and another approximate method that learns online from experience. Extending existing work on MDP homomorphisms, we present theoretical guarantees for the quality of a transferred value function.
A language for information flow: dynamic tracking in multiple interdependent dimensions
Authors: Avraham Shinnar, Marco Pistoia, Anindya Banerjee
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

This paper presents &lambda;I, a language for dynamic tracking of information flow across multiple, interdependent dimensions of information. Typical dimensions of interest are integrity and confidentiality. &lambda;I supports arbitrary domain-specific policies that can be developed independently. &lambda;I treats information-flow metadata as a first-class entity and tracks information flow on the metadata itself (integrity on integrity, integrity on confidentiality, etc.). This paper also introduces IMPOLITE, a novel class of information-flow policies for &lambda;I. Unlike many systems, which only allow for absolute-security relations, IMPOLITE can model more realistic security policies based on relative-security relations. IMPOLITE demonstrates how policies on interdependent dimensions of information can be simultaneously enforced within &lambda;I's unified framework.
inPD: An Emerging Theoretical Framework for Educational Professional Development in the Information Age
Authors: Simon Hughes
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper seeks to enunciate a theoretical framework for i-enabled Continuing Professional Development (CPD). It deliberately avoids the metaphorical application of the prefix 'e', to symbolise a more holistic approach to professional development than is currently afforded by assumptions in e-learning. Drawing on the Apple MacintoshTM metaphor of 'i' approaches to life (iTunes, iMovie, iPod etc), it plays with the more personal contiguities of 'I'-ness. It extrapolates from the post-modern concept of the 'self', which can be seen to be central to all personal development activities and then explores what in might mean where some of the factors identified here, interactive, intelligent, international and integrated are taken to be critical in effective professional development.