ppxscal/embedding_network huggingface dataset:
SCORM and the Learning Grid
Authors: Fred Neumann, Rüdiger Geys
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

The Sharable Content Object Reference Model (SCORM) is a profile of several eLearning specifications to ensure the reusability and interoperability of eLearning content in web based Learning Management Systems (LMSs). Learning Grids-learning environments built on the technology of Grid services-are a promising new approach to enhance quality of eLearning by overcoming the page oriented structure of the web. This paper investigates how SCORM can be used in conjunction with Learning Grids. After an introduction to the relevant aspects of SCORM two major scenarios are discussed: the use of Grid enhanced content in a SCORM compliant LMS and the use of SCORM content in the context of a Learning Grid.
Mobile 3D Graphics: with OpenGL ES and M3G
Authors: Kari Pulli, Jani Vaarala, Ville Miettinen, Tomi Aarnio, Kimmo Roimela
Venue: The Morgan Kaufmann Series In Computer Graphics (2007)

Graphics and game developers must learn to program for mobility. This book will teach you how. "This book - written by some of the key technical experts...provides a comprehensive but practical and easily understood introduction for any software engineer seeking to delight the consumer with rich 3D interactive experiences on their phone. Like the OpenGL ES and M3G standards it covers, this book is destined to become an enduring standard for many years to come." - Lincoln Wallen, CTO, Electronic Arts, Mobile"This book is an escalator, which takes the field to new levels. This is especially true because the text ensures that the topic is easily accessible to everyone with some background in computer science...The foundations of this book are clear, and the authors are extremely knowledgeable about the subject." - Tomas Akenine-Mller, bestselling author and Professor of Computer Science at Lund University "This book is an excellent introduction to M3G. The authors are all experienced M3G users and developers, and they do a great job of conveying that experience, as well as plenty of practical advice that has been proven in the field." - Sean Ellis, Consultant Graphics Engineer, ARM LtdThe exploding popularity of mobile computing is undeniable. From cell phones to portable gaming systems, the global demand for multifunctional mobile devices is driving amazing hardware and software developments. 3D graphics are becoming an integral part of these ubiquitous devices, and as a result, Mobile 3D Graphics is arguably the most rapidly advancing area of the computer graphics discipline. Mobile 3D Graphics is about writing real-time 3D graphics applications for mobile devices. The programming interfaces explained and demonstrated in this must-have reference enable dynamic 3D media on cell phones, GPS systems, portable gaming consoles and media players. The text begins by providing thorough coverage of background essentials, then presents detailed hands-on examples, including extensive working code in both of the dominant mobile APIs, OpenGL ES and M3G. C/C++ and Java Developers, graphic artists, students, and enthusiasts would do well to have a programmable mobile phone on hand to try out the techniques described in this book. The authors, industry experts who helped to develop the OpenGL ES and M3G standards, distill their years of accumulated knowledge within these pages, offering their insights into everything from sound mobile design principles and constraints, to efficient rendering, mixing 2D and 3D, lighting, texture mapping, skinning and morphing. Along the way, readers will benefit from the hundreds of included tips, tricks and caveats. *Written by key industry experts who helped develop the standards of the field*Hands-on code examples are presented throughout the book, and are also offered on the companion website*Provides examples in the two most popular programing interfaces, OpenGL ES and M3G
Routability of network topologies in FPGAs
Authors: Manuel Saldaña, Lesley Shannon, Jia Shuo Yue, Sikang Bian, John Craig, Paul Chow
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

A fundamental difference between application-specific integrated circuits (ASICs) and field-programmable gate arrays (FPGAs) is that the wires in ASICs are designed to match the requirements of a particular design. Conversely, in an FPGA, the area is fixed and the routing resources exist whether or not they are used. In this paper, we investigate how well several common network topologies map onto a modern FPGA routing fabric. Different multiprocessor network topologies with between 8 and 64 nodes are mapped to a single large FPGA. Except for the fully-connected networks, it is observed that the difference in logic resources used and routing overhead among these topologies is insignificant for the systems tested. Fully-connected networks up to about 22 nodes are also feasible on the same FPGA although the logic and routing utilization clearly grows much faster. The conclusion is that a modern FPGA fabric is very rich in resources and capable of supporting highly interconnected topologies. For systems with a modest number of nodes implemented on current large FPGAs, it is not necessary to use the connectivity-limited topologies typically used for networks-on-chip. Rather, direct point-to-point connections between all communicating nodes can be considered.
Flexible simulation of deformable models using discontinuous Galerkin FEM
Authors: Peter Kaufmann, Sebastian Martin, Mario Botsch, Markus Gross
Venue: Graphical Models (2009)

We propose a simulation technique for elastically deformable objects based on the discontinuous Galerkin finite element method (DG FEM). In contrast to traditional FEM, it overcomes the restrictions of conforming basis functions by allowing for discontinuous elements with weakly enforced continuity constraints. This added flexibility enables the simulation of arbitrarily shaped, convex and non-convex polyhedral elements, while still using simple polynomial basis functions. For the accurate strain integration over these elements we propose an analytic technique based on the divergence theorem. Being able to handle arbitrary elements eventually allows us to derive simple and efficient techniques for volumetric mesh generation, adaptive mesh refinement, and robust cutting. Furthermore, we show DG FEM not to suffer from locking artifacts even for nearly incompressible materials, a problem that in standard FEM requires special handling.
Virtualization security
Authors: Edward Ray, Eugene Schultz
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Many organization fail to take into account the security of virtual servers, which can result in potential loss of data from internal and external threats. Virtualization has now become commonplace throughout the world; however few if any organizations know the risks associated with running multiple machines on the same physical hardware. The purpose of this paper is to provide an overview of both the benefits and risks associated with virtualization, and steps that should be taken to minimize risks associated with deployment.
Managing information access controls in digital ecosystems environments
Authors: Ilung Pranata, Geoff Skinner
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

Resource and information protection plays a significant role in engaging the enterprises to actively participate inside a Digital Ecosystem environment. However, current developments of such security mechanisms for protecting these resources are still in their infancy. Most of the proposed protection frameworks do not provide a scalable and effective mechanism for multiple interacting entities in particular. This is even a greater issue when multiple resources are exchanged and shared in an open and dynamic environment. This paper proposes a distributed mechanism for individual enterprises to manage their own authorization processes and information access permissions with the aim of providing rigorous protection of enterprise resources.
Fast algorithms with low complexity for adaptive filtering
Authors: Madjid Arezki, Daoud Berkani
Venue: WSEAS Transactions on Signal Processing (2009)

The numerically stable version of fast recursive least squares (NS-FRLS) algorithms represent a very important load of calculation that needs to be reduced. Its computational complexity is of 8L operations per sample, where L is the finite impulse response filter length. We propose an algorithm for adaptive filtering, while maintaining equilibrium between its reduced computational complexity and its adaptive performances. We present a new (M-SMFTF) algorithm for adaptive filtering with fast convergence and low complexity. It is the result of a simplified FTF type algorithm, where the adaptation gain is obtained only from the forward prediction variables and using a new recursive method to compute the likelihood variable. This algorithm presents a certain interest, for the adaptation of very long filters, like those used in the problems of echo acoustic cancellation, due to its reduced complexity, its numerical stability and its convergence in the presence of the speech signal. Its computational complexity is of 6L and this is considerably reduced to 2L+4P when we use a reduced P-size (P≪L) forward predictor.
Getting closer: tailored human&#x2013;computer speech dialog
Authors: Florian Metze, Roman Englert, Udo Bub, Felix Burkhardt, Joachim Stegmann
Venue: Universal Access in the Information Society (2009)

This paper presents an advanced call center, which adapts presentation and interaction strategy to properties of the caller such as age, gender, and emotional state. User studies on interactive voice response (IVR) systems have shown that these properties can be used effectively to &#x201c;tailor&#x201d; services to users or user groups who do not maintain personal preferences, e.g., because they do not use the service on a regular basis. The adopted approach to achieve individualization of services, without being able to personalize them, is based on the analysis of a caller&#x2019;s voice. This paper shows how this approach benefits service providers by being able to target entertainment and recommendation options. It also shows how this analysis at the same time benefits the customer, as it can increase accessibility of IVR systems to user segments which have particular expectations or which do not cope well with a &#x201c;one size fits all&#x201d; system. The paper summarizes the authors&#x2019; current work on component technologies, such as emotion detection, age and gender recognition on telephony speech, and presents results of usability and acceptability tests as well as an architecture to integrate these technologies in future multi-modal contact centers. It is envisioned that these will eventually serve customers with an avatar representation of an agent and tailored interaction strategies, matching powerful output capabilities with advanced analysis of the user&#x2019;s input.
An adaptive bidding strategy for combinatorial auctions-based resource allocation in dynamic markets
Authors: Xin Sui, Ho-Fung Leung
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Combinatorial auctions, where bidders are allowed to submit bids for bundles of items, are preferred to single-item auctions when bidders have complementarities and substitutabilities among items and therefore achieve better social efficiency. A large unexplored area of research is the design of bidding strategies. In this paper, we propose a new adaptive bidding strategy for combinatorial auctions-based resource allocation. The bidder adopting this strategy can adjust his profit margin constantly, and thus perceive and respond to the market in a timely way. Experiment results show that the adaptive strategy performs fairly well when compared to an intelligent strategy, which is artificially generated according to prior knowledge of the market.
NX 5 for Designers
Authors: Sham Tickoo
Venue:  (2007)

NX 5 for Designers is a comprehensive textbook that introduces the users to feature based 3D parametric solid modeling using the NX 5 software. The textbook covers all major environments of NX with a thorough explanation of all tools, options, and their applications to create real-world products. About 60 mechanical engineering industry examples are used as tutorials and an additional 35 as exercises to ensure that the users can relate their knowledge and understand the design techniques used in the industry to design a product. After reading the textbook, the user will be able to create parts, assemblies, drawing views with bill of materials, and learn the editing techniques that are essential to make a successful design. Also, in this book, the author emphasizes on the solid modeling techniques that improve the productivity and efficiency of the user.Salient Features of the Textbook Consists of 13 pedagogical sequenced chapters covering the Sketching, Modeling, Assembly, and Drafting environments of NX. The first page of every chapter summarizes the topics that will be covered in it.Real-world projects and examples focusing on industry experience.Step-by-step examples that guide the user through the learning process.Additional information is provided throughout the book in the form of tips and notes.Self-Evaluation test and review questions are provided at the end of each chapter so that the users can assess their knowledge.Free Teaching and Learning Resources CADCIM Technologies provides the following Free Teaching and Learning Resources with this textbook: Technical support by contacting techsupport@cadcim.com.Drawing files of the models used in illustrations, examples, and exercises. Customizable PowerPoint presentations for every chapter in this textbook.Instructor s guide that provides solutions to review questions and exercises provided in the textbook.Student projects to enhance the skills.Course outline listing the topics that will be covered in the basic and advanced classes.
Maximization of energy efficiency in wireless ad hoc and sensor networks with SERENA
Authors: Saoucene Mahfoudh, Pascale Minet
Venue: Mobile Information Systems (2009)

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. SERENA is based on a two-hop coloring algorithm, whose complexity in terms of colors and rounds is evaluated. We then quantify the slot reuse. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks. We compare SERENA with classical TDMA and optimized variants such as USAP in wireless ad hoc and sensor networks.
On a Mission without a Home Base: Conceptualizing Nomadicity in Student Group Work
Authors: Cristian Bogdan, Chiara Rossitto, Maria Normark, Pedro Jorge (Adler), Kerstin Severinson Eklundh
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

We are observing that the current body of CSCW research is focusing either on stable workplaces with a single cooperative unit or on mobile work, with highly mobile professionals. We are attempting to fill the gap between workplace and mobile with a field study of student work, which we regard as exhibiting a high degree of nomadicity. After comparing student work with centres of coordination and mobility work, we unpack the notion of nomadicity as a work condition, constituted by a complex of discontinuities, leading to work partitioning and re-assembly. We draw design and methodological implications.
Implementing a hierarchical Bayesian visual cortex model on multi-core processors
Authors: Pavan Yalamanchili, Sumod Mohan, Tarek Taha
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Recent scientific studies of the brain have led to new models of information processing. Some of these models are based on Hierarchical Bayesian Networks and have several benefits over traditional neural networks. Large scale implementations of brain models have the potential for strong inference capabilities, and hierarchical Bayesian models lend themselves well to large scales. Multi-core processors are currently the standard architectural approach utilized for high performance computing platforms. In this paper we examine the parallelization and optimization of Dean's hierarchical Bayesian model onto two multi-core architectures: the nine-core IBM Cell and the quad-core Intel Xeon processors. This is the first study of the parallelization of this class of models onto multi-core processors. We evaluate two parallelization strategies and examine the performance of the model as it is scaled. Our results indicate that the Cell processor can provide speedups of up to 108 times over a serial implementation of the model for the network sizes examined. The quad-core Intel Xeon processor provided a speedup of 36 times for the same model configuration.
An on-line task modification method for singularity avoidance of robot manipulators
Authors: Changwu Qiu, Qixin Cao, Shouhong Miao
Venue: Robotica (2009)

In this paper, we present an on-line task modification method (OTMM) to realize singularity avoidance for nonredundant and redundant manipulators at the velocity level. The method introduces a correction vector, constructed from the task velocity and the singular vector corresponding to the minimum singular value, into the task velocity. The performance is simply affected by the choice of the lower limit of the minimum singular value and a scalar adjusting function, which is monotone with respect to the minimum singular value. The method makes unnecessary avoiding the singularity point by off-line path planning for nonredundant or redundant manipulators, and the effort to check whether the singularity is escapable for redundant manipulators. The simulation results show the effectiveness of the OTMM for on-line singularity avoidance in manipulator motion control.
WS-BPEL Extensions for Versioning
Authors: Matjaz B. Juric, Ana Sasa, Ivan Rozman
Venue: Information and Software Technology (2009)

This article proposes specific extensions for WS-BPEL (Business Process Execution Language) to support versioning of processes and partner links. It introduces new activities and extends existing activities, including partner links, invoke, receive, import, and onmessage activities. It proposes version-related extensions to variables and introduces version handlers. The proposed extensions represent a complete solution for process-level and scope-level versioning at development, deployment, and run-time. It also provides means to version applications that consist of several BPEL processes, and to put temporal constraints on versions. The proposed approach has been tested in real-world environment. It solves major challenges in BPEL versioning.
Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks
Authors: Vincent Reinhard, Joanna Tomasik, Dominique Barth, Marc-Antoine Weisser
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

The CARRIOCAS project aims to guarantee QoS connectivity services to distributed applications in a Telecom carrier network. A large number of these applications (for example video applications) use a multicast service packet delivery. Multicast which minimizes the total used bandwidth in the MPLS network has become an important subject. We study multicast routing in the network where only some routers can duplicate packets. We prove that the construction of a multicast tree minimizing the bandwidth used in such a network is a NP-complete problem and we propose an heuristic algorithm to solve it. We evaluate the performance of the heuristic in terms of total bandwidth used by the multicast for different network sizes.
Visual simulation of multiple unmixable fluids
Authors: Wen Zheng, Jun-Hai Yong, Jean-Claude Paul
Venue: Journal of Computer Science and Technology (2007)

We present a novel grid-based method for simulating multiple unmixable fluids moving and interacting. Unlike previous methods that can only represent the interface between two fluids (usually between liquid and gas), this method can handle an arbitrary number of fluids through multiple independent level sets coupled with a constrain condition. To capture the fluid surface more accurately, we extend the particle level set method to a multi-fluid version. It shares the advantages of the particle level set method, and has the ability to track the interfaces of multiple fluids. To handle the dynamic behavior of different fluids existing together, we use a multiphase fluid formulation based on a smooth weight function.
MSDA: Wordsense Discrimination Using Context Vectors and Attributes
Authors: Abdulrahman Almuhareb, Massimo Poesio
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We present MSDA (Major Senses Discovery Algorithm) --a development over the context vector approach to (noun) sense discrimination [20, 24] that uses attributes and values instead of word features to cluster contexts, and does not require for the number of senses to be fixed beforehand. The algorithm achieves a precision of 89% on a dataset including both ambiguous and non-ambiguous nouns, twice that of previous algorithms.
The static hedging of CDO tranche correlation risk
Authors: Michael B. Walker
Venue: International Journal of Computer Mathematics (2009)

This article gives examples illustrating the static hedging of Collateratized debt obligation (CDO) correlation risk. Changes in correlation result in changes in the relative portioning out of the total expected loss of a reference portfolio to the different tranches. Thus, portfolios with low correlation risk contain a number of CDO tranches whose weights are adjusted, so that the daily changes in the mark-to-market values of the different tranches tend to cancel out. Example portfolios are backtested for immunization against correlation and index spread risks using iTraxx CDO market spreads for the challenging period following the 5 May 2005 Standard and Poor's downgrade of Ford and General Motors. The implementation is carried out by using the static loss-surface model of Walker [CDO Models-Towards the Next Generation: Incomplete Markets and Term Structure, 2005. Available at http://www.physics.utoronto.ca/~qocmp/nextGenDefaultrisk.pdf; CDO Valuation: Term Structure, Tranche Structure, and Loss Distributions, 2006. Available at http://www.physics.utoronto.ca/~qocmp/nextLongB.2006.09.22.pdf] and Torresetti et al. [Implied Expected Tranched Loss Surface from CDO Data, 2006. Available at http://www.damianobrigo.it].