ppxscal/embedding_network huggingface dataset:
Late-binding SCORM Contents in Dynamic Learning Environments
Authors: Shueh-Cheng Hu
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

The dynamics of organizations result in frequently-changed learning objectives and the necessary learning resources. Applications of the SCORM reduce the time spent on re-developing sharable learning resources. However, the time spent on re-assembling different instructional packages to meet dynamic learning needs still incurs significant overhead. A method for binding learning resources into SCORM-conformant instructional contents during delivery time is presented. The application of this method, needs limited changes in existing SCORM-conformant environments, will improve usability of the SCORM in dynamic learning environments.
Minimal realization algorithm for MIMO (q, r)-D continuous-discrete systems
Authors: Valeriu Prepelita
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

A class of multidimensional time-invariant MIMO hybrid systems is studied, which depends on q continuous-time variables and on r discrete-time ones. The formula of the input-output map of these systems is obtained. A multiple (q, r)-hybrid Laplace transformation is defined and it is used to determine the transfer matrices of the considered systems. The minimal realization problem is analysed and an algorithm is given which provides minimal realizations.
Neimark-sacker and flip bifurcations in a discrete-time dynamic system for internet congestion
Authors: Gabriela Mircea, Dumitru Opris
Venue: WSEAS Transactions on Mathematics (2009)

The aim of this paper is to study the Neimark-Sacker and flip bifurcations for the discrete-time dynamic system, which describes the Internet congestion, with a single link and two sources. We describe the algorithm in order to determine the Neimark-Sacker bifurcation and the normal form. We establish the existence of a flip bifurcation for the case when the model's two parameters depend on the real parameter a, which influences the existence of the bifurcation. The numerical simulations verify the theoretical results.
Haptic rendering of complex deformations through handle-space force linearization
Authors: Carlos Garre, Miguel A. Otaduy
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions between deforming objects. In this paper we introduce a novel method for satisfying high force update rates with deformable objects, yet retaining the visual quality of complex deformations and interactions. The objects that are haptically manipulated may have many degrees of freedom, but haptic interaction is often implemented in practice through low-dimensional force-feedback devices. We exploit the low-dimensional domain of the interaction for devising a novel linear approximation of interaction forces that can be efficiently evaluated at force-update rates. Moreover, our linearized force model is time-implicit, which implies that it accounts for contact constraints and the internal dynamics of deforming objects. In this paper we show examples of haptic interaction in complex situations such as large deformations, collision between deformable objects (with friction), or even self-collision.
Bayesian network models for hierarchical text classification from a thesaurus
Authors: Luis M. de Campos, Alfonso E. Romero
Venue: International Journal of Approximate Reasoning (2009)

We propose a method which, given a document to be classified, automatically generates an ordered set of appropriate descriptors extracted from a thesaurus. The method creates a Bayesian network to model the thesaurus and uses probabilistic inference to select the set of descriptors having high posterior probability of being relevant given the available evidence (the document to be classified). Our model can be used without having preclassified training documents, although it improves its performance as long as more training data become available. We have tested the classification model using a document dataset containing parliamentary resolutions from the regional Parliament of Andalucia at Spain, which were manually indexed from the Eurovoc thesaurus, also carrying out an experimental comparison with other standard text classifiers.
Hybrid BIST Scheme for Multiple Heterogeneous Embedded Memories
Authors: Li-Ming Denq, Yu-Tsao Hsing, Cheng-Wen Wu
Venue: IEEE Design Test (2009)

Many embedded memories in SoCs have wide data words, leading to a high routing penalty in the BIST circuits. This novel hybrid BIST architecture reduces this routing penalty, while allowing at-speed test and diagnosis of memory cores. The MECA system facilitates mapping the diagnostic syndrome to the memory cell's defect information. A failure bitmap viewer provides visual information for design and process diagnostics.
Emotional agent in serious game (DINO)
Authors: H. L. Zhang, Z. Shen, X. Tao, C. Miao, B. Li, Ailiya, Y. Cai
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper, we introduce an novel emotional agent system in 3D virtual world based on OCC (Ortony, Clore and Collins) theory, FCM (Fuzzy Cognitive Map) and GoalNet. The agent system is designed based on Goal Net model. Emotional modeling and decision making are based on OCC and FCM inference. Emotions modeled by the OCC model are incorporated into FCM inference. It has been shown emotion has a great impact in decision making. The proposed agent system has been applied to design human-like dinosaur agents in the research project "Immersion and Embodied Learning: Traces of Dinosaurs in Earth System Science" supported by National Research Foundation (NRF) Singapore. In this project, we have developed an agent mediated immersive Interactive Digital Media that appropriately recreates and replays the traces of Earth's history using intelligent agent technology and 3D multi-user environment. The virtual world and emotional dinosaur agents are shown in the demo. The experiments conducted by students in secondary schools in Singapore have shown the emotional agents enable deep learning of earth science.
Lessons Learned from a Structured Undergraduate Mentorship Program in Computational Mathematics at George Mason University
Authors: John Wallin, Tim Sauer
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

We present the results from the first two years of the Undergraduate Research for Computational Mathematics (URCM) program at George Mason University (Mason). In this program, students work on a year-long research project in Computational Science while being supervised by a mentor. We describe the structure and goals of this program along with some observations about the elements that we have found that have been challenging in its implementation. Finally, we will provide a summary of the outcomes of the first two years of this project.
On triconnected and cubic plane graphs on given point sets
Authors: Alfredo García, Ferran Hurtado, Clemens Huemer, Javier Tejel, Pavel Valtr
Venue: Computational Geometry: Theory and Applications (2009)

Let S be a set of n>=4 points in general position in the plane, and let h=4 is even and h=
MA-DIDS: A Multi-Agent Based Distributed Intrusion Detection System
Authors: Huihua Yang, Yong Wang, Hongmei Zhang, Xingyu Wang
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

In this paper, a novel architecture of multi-agent based distributed intrusion detection system is presented. MA-DIDS developed the frameworks of Common Intrusion Detection Framework (CIDF) and Autonomous Agent for Intrusion Detection (AAFID), and actualized distributed data collection, detection and response. MA-DIDS consists of 7 kinds of agents, namely, data collection agent (DCA), data preprocessing agent (DPA), intrusion detection agent (IDA), event analyzing agent (EAA), management agent (MA), intrusion responding agent (IRA), and communication agent (CA). MA-DIDS is platform independent, dynamically structure scalable and function shrinkable, it endows network security manager more power and flexibility to configure a DIDS. In this paper, the network-based DCA and DPA, and Linux host-based and Windows host based DCA and DPA are briefly illustrated. In MA-DIDS, all the anomaly detection IDAs are implemented using support vector machines; and CAs are specifically designed to enhance the communication security and response speed, with them, the agents can communicate safely and cooperate harmony. The architecture of MA-DIDS can efficiently cut off the network traffic added up by IDS, and promote the detected performance.
User model on a key
Authors: Tsvi Kuflik, Katerina Poteriaykina
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

Provision of personalized services to users requires accurate modeling of their interests and needs. However, such information may not be available to the service provider. Previously suggested solutions, such as user modeling servers and user modeling mediation demonstrate technological possible solution to the problem. However, at the same time they introduce privacy problem. This paper proposes a general framework for enhancing the privacy of user modeling in personalization systems by keeping the user "in control" of his/her personal information. The UM on a Key that combined a user modeling server and mediation mechanism will allow the user to explicitly select what information to disclose to service provider and to do that at the right format.
Hybrid Reasoning and the Future of Iconic Representations
Authors: Catherine Recanati
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

We give a brief overview of the main characteristics of diagrammatic reasoning, analyze a case of human reasoning in a mastermind game, and explain why hybrid representation systems (HRS) are particularly attractive and promising for AGI and Computer Science in general.
A Fast Method for Property Prediction in Graph-Structured Data from Positive and Unlabelled Examples
Authors: Susanne Hoche, Peter Flach, David Hardcastle
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

The analysis of large and complex networks, or graphs, is becoming increasingly important in many scientific areas including machine learning, social network analysis and bioinformatics. One natural type of question that can be asked in network analysis is “Given two sets R and T of individuals in a graph with complete and missing knowledge, respectively, about a property of interest, which individuals in T are closest to R with respect to this property?”. To answer this question, we can rank the individuals in T such that the individuals ranked highest are most likely to exhibit the property of interest. Several methods based on weighted paths in the graph and Markov chain models have been proposed to solve this task. In this paper, we show that we can improve previously published approaches by rephrasing this problem as the task of property prediction in graph-structured data from positive examples, the individuals in R, and unlabelled data, the individuals in T, and applying an inexpensive iterative neighbourhood's majority vote based prediction algorithm (“iNMV”) to this task. We evaluate our iNMV prediction algorithm and two previously proposed methods using Markov chains on three real world graphs in terms of ROC AUC statistic. iNMV obtains rankings that are either significantly better or not significantly worse than the rankings obtained from the more complex Markov chain based algorithms, while achieving a reduction in run time of one order of magnitude on large graphs.
Social engineering: a serious underestimated problem
Authors: Guido Rößling, Marius Müller
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

We describe two experiments to get security-relevant data using Social Engineering. The success of the experiments is disturbing.
Design of an interconnect architecture and signaling technology for parallelism in communication
Authors: Jongsun Kim, Ingrid Verbauwhede, Mau-Chung Frank Chang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

The need for efficient interconnect architectures beyond the conventional time-division multiplexing (TDM) protocol-based interconnects has been brought on by the continued increase of required communication bandwidth and concurrency of small-scale digital systems. To improve the overall system performance without increasing communication resources and complexity, this paper presents a cost-effective interconnect architecture, communication protocol, and signaling technology that exploits parallelism in board-level communication, resulting in shorter latency and higher concurrency on a shared bus or link: the proposed source synchronous CDMA interconnect (SS-CDMA-I) enables dual concurrent transactions on a single wire line as well as flexible input/output (I/O) reconfiguration. The SS-CDMA-I utilizes 2-bit orthogonal CDMA coding and a variation of source synchronous clocking for multilevel superposition; a single 3-level SSCDMA-I line operates as if it consists of dual virtual time-multiplexed interconnects, which exploits communication parallelism with a reduced number of pins, wires, and complexity. The unique multiple access capability of the SSCDMA-I improves real-time communication between multiple semiconductor intellectual property (IP) blocks on a shared link or bus by reducing the bus contention interference from simultaneous traffic requests and by taking advantage of shorter request latency. The prototype transceiver chip is implemented in 0.18-µm CMOS and the 10-cm test PC board system achieves an aggregate data rate of 2.5 Gb/s/pin between four off-chip (2Tx-to-2Rx) I/Os.
Computational Intelligence in Integrated Airline Scheduling, 1st edition
Authors: Tobias Grosche
Venue:  (2009)

An airline schedule represents the central planning element of each airline. In general, the objective of airline schedule optimization is to find the airline schedule that maximizes operating profit. This planning task is not only the most important but also the most complex task an airline is confronted with. Until now, this task is performed by dividing the overall planning problem into smaller and less complex subproblems that are solved separately in a sequence. However, this procedure is only of minor capability to deal with interdependencies between the subproblems, resulting in less profitable schedules than those being possible with an approach solving the airline schedule optimization problem in one step. In this work, two planning approaches for integrated airline scheduling are presented. One approach follows the traditional sequential approach: existing models from literature for individual subproblems are implemented and enhanced in an overall iterative routine allowing to construct airline schedules from scratch. The other planning appraoch represents a truly simultaneous airline scheduling: using metaheuristics, airline schedules are processed and optimized at once without a separation into different optimization steps for its subproblems.
Increasing trustworthiness in web-page searches by using an alternative approach for web-page ranking
Authors: Robert Kilmer
Venue:  (2008)

Current Web search-and-retrieval system algorithms produce a significant number of untrustworthy results that, in turn, cause inefficiencies for Web users, including increased time determining what information can be trusted and decreased accuracy of Web search results. The purpose of this design research study was to develop and examine the relative efficacy of a new approach to trustworthiness of Web-page ranking based on the number of categories and characteristics associated with a keyword. This design research study consisted of a conceptual model codified for the purpose of theory development of Web search and retrieval applying concepts in Computational Linguistics and Natural Language Processing. Two areas were investigated for impact on the trustworthiness of Web page results: first the placement of characters to search and frequency of the characteristics of the keyword being searched in a Web page, and second how well the new approach performed compared to the traditional PageRank&trade; Web-page ranking algorithm by manually assigning points to Web pages using a trustworthiness scale developed for this study, calculating results, and validating the results through a reverse look up of the Web page. A key finding from this study is that when Web pages are ranked by categories and characteristics of a keyword, marginal improvements are made in trustworthy Web-page results compared to PageRank&trade;. A positive social impact resulting from this study is an improvement in the trustworthiness of Web search-andretrieval ranking results. A recommendation is that Web search-and-retrieval systems should include ranking through categories and characteristics of keywords to improve the trustworthiness of results.
Extracting a representation from text for semantic analysis
Authors: Rodney D. Nielsen, Wayne Ward, James H. Martin, Martha Palmer
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

We present a novel fine-grained semantic representation of text and an approach to constructing it. This representation is largely extractable by today's technologies and facilitates more detailed semantic analysis. We discuss the requirements driving the representation, suggest how it might be of value in the automated tutoring domain, and provide evidence of its validity.
Plenary lecture 2: safety, uncertainty, and real-time problems in developing autonomous robots
Authors: Vitaliy Rybak
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

Recent developments in robotics outside traditional industrial applications increasingly focus on operation of robots in an unstructured environment and human vs. robot interactions. Examples of new applications of robots in unstructured environments that are actively pursued today are personal and service robotics, space and underwater robotics, medical and rehabilitation robotics, construction robotics, and agriculture robotics. The new trends in robotics research have a general goal of getting robots closer to human social needs. In this case a key problem of robotics is the problem of safety of robot and its surrounding. For safe autonomous functioning in a dynamic unstructured environment, a robot should possess a capability of real-time data processing under information uncertainty. These three issues - safety, uncertainty, and real-time data processing are closely related: planning safe actions based on uncertain data usually requires more computation than planning without uncertainty because multiple possible outcomes of actions should be considered. The main sources of the uncertainty are inaccuracy of sensorial data measurement, time-delay of sensorial data acquisition and processing, and time-delayed feedback in a robot's control system. As increase of accuracy of measurements and speed of data processing has technical and economic restrictions, there is a necessity for search of practical decisions in the conditions of existing possibilities. We propose a method of real-time data processing under information uncertainty that deals with different acceptable levels of uncertainty and collaborative processing of various data, visual and non-visual. Finally we present the examples of application of the proposed method for building of robot's environment model and for robot motion planning with obstacles avoiding.
Variant Narrowing and Equational Unification
Authors: Santiago Escobar, José Meseguer, Ralf Sasse
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Narrowing is a well-known complete procedure for equational E-unification when E can be decomposed as a union E=@D@?B with B a set of axioms for which a finitary unification algorithm exists, and @D a set of confluent, terminating, and B-coherent rewrite rules. However, when B
Fast perspective volume ray casting method using GPU-based acceleration techniques for translucency rendering in 3D endoluminal CT colonography
Authors: Taek-Hee Lee, Jeongjin Lee, Ho Lee, Heewon Kye, Yeong Gil Shin, Soo Hong Kim
Venue: Computers in Biology and Medicine (2009)

Recent advances in graphics processing unit (GPU) have enabled direct volume rendering at interactive rates. However, although perspective volume rendering for opaque isosurface is rapidly performed using conventional GPU-based method, perspective volume rendering for non-opaque volume such as translucency rendering is still slow. In this paper, we propose an efficient GPU-based acceleration technique of fast perspective volume ray casting for translucency rendering in computed tomography (CT) colonography. The empty space searching step is separated from the shading and compositing steps, and they are divided into separate processing passes in the GPU. Using this multi-pass acceleration, empty space leaping is performed exactly at the voxel level rather than at the block level, so that the efficiency of empty space leaping is maximized for colon data set, which has many curved or narrow regions. In addition, the numbers of shading and compositing steps are fixed, and additional empty space leapings between colon walls are performed to increase computational efficiency further near the haustral folds. Experiments were performed to illustrate the efficiency of the proposed scheme compared with the conventional GPU-based method, which has been known to be the fastest algorithm. The experimental results showed that the rendering speed of our method was 7.72fps for translucency rendering of 1024x1024 colonoscopy image, which was about 3.54 times faster than that of the conventional method. Since our method performed the fully optimized empty space leaping for any kind of colon inner shapes, the frame-rate variations of our method were about two times smaller than that of the conventional method to guarantee smooth navigation. The proposed method could be successfully applied to help diagnose colon cancer using translucency rendering in virtual colonoscopy.