ppxscal/embedding_network huggingface dataset:
Design, implementation and validation of a Europe-wide pedagogical framework for e-Learning
Authors: Andrina Granić, Charles Mifsud, Maja ukušić
Venue: Computers Education (2009)

Within the context of a Europe-wide project UNITE, a number of European partners set out to design, implement and validate a pedagogical framework (PF) for e- and m-Learning in secondary schools. The process of formulating and testing the PF was an evolutionary one that reflected the experiences and skills of the various European partners and secondary schools involved in the project. The framework involved pedagogies which underpin the teaching of subject matter in a number of European secondary schools as well as the ways in which learning is delivered and assessed. The PF represents an essential part of the e-Learning system conceptualization and development and offers sound concepts for the development of learning scenarios in order to enhance the learning experience of students in secondary schools. A five-component framework which, by means of its constituents, drives and guides the creation of e-Learning scenarios was designed and tested. It is composed of the pedagogical framework context, pedagogical approaches, assessment techniques, teacher education and national specifics and current pedagogical practices implemented in national curricula. A series of learning scenarios were created to test the PF in classrooms. A detailed exemplar of a scenario in practice is offered. An evaluation of the scenarios based on [Reeves, T. C., 1994. Evaluating what really matters in computer-based education. In M. Wild, D. Kirkpatrick (Eds.), Computer education: new perspectives (pp. 219-246). Perth, Australia: MASTEC] pedagogical dimensions revealed that UNITE is based on constructivist and cognitive foundations. With increased experience of the system the teachers' implementation of the pedagogical framework developed into increased mastery in the school context. Teachers from the second validation phase became more confident in their application of the framework principles and evaluated more positively the outcomes. This helped them to become more aware of the opportunities offered by the framework in their secondary school teaching. In order to bring this about the supports for change were put into place at the levels of pedagogical design, administrative support and the provision of the required resources and appropriate continuing professional development. The project has sought to create this support structure to ensure maximal benefits of the system for teaching and learning. Such a pedagogical support PF has offered scope for both collaborative and autonomous learning which have brought about value-added teaching and learning effects in the Europe-wide network of schools.
A multiquadric quasi-interpolation with linear reproducing and preserving monotonicity
Authors: Ronghua Chen, Xuli Han, Zongmin Wu
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we develop a multiquadric (MQ) quasi-interpolation which has the properties of linear reproducing and preserving monotonicity. Moreover, we give its approximation error by theoretic analysis and illustrate the effect by means of two examples. One of the examples is to approach the linear combination of two sine functions with different frequencies. Another is to approximate a function with discontinuity. From the results of the examples, we believe that the present MQ quasi-interpolation is feasible.
An Automatic Course Generation System for Organizing Existent Learning Objects Using Particle Swarm Optimization
Authors: Yen-Ting Lin, Shu-Chen Cheng, Jin-Tan Yang, Yueh-Min Huang
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

The purpose of this study is to consider that how to help instructors re-organize a well-structured teaching material utilizing existing learning objects. To cope with this problem, this study adopts a novel approach - particle swarm optimization (PSO) to achieve this aim. By employing this algorithm, the proposed approach can automatically re-organize a teaching material and meet multiple criteria specified by the instructors. In addition, evaluation results have demonstrated that the proposed approach is applicable that can help most instructors re-organize teaching materials efficiently and effectively.
Properly Coloured Cycles and Paths: Results and Open Problems
Authors: Gregory Gutin, Eun Jung Kim
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of transformations of an edge-coloured multigraph G into an ordinary graph that allow us to check the existence of PC cycles and PC (s,t)-paths in G and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible solution to the problem.
A Study of the Construction of a Large-Scale Water Quality Spatial Database Based on ArcSDE
Authors: Xu Shuna, Yang Lingbin, Zhang Xia, Wu Jin
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Taking into account of the rapid deterioration of water environment in China, as well as the complexity of water environment data, a new way has been proposed for the secure and efficient management of water environment information by using the powerful spatial data and non-spatial data seamless integration capabilities of ARCSDE. Firstly, a discussion has been made about the function, architecture and data storage mode of ARCSDE. Then on this basis, based on ARCSDE9.0+SQLServer2000 model, with the client by the secondary development of MO, constructing a large-scale water quality spatial database management system of Jinlin province. It has been proved by practice that the system is running well and perfect to meet the diverse needs of water quality management.
Exploring History with Narrative Timelines
Authors: Robert B. Allen, Sumanth Nalluru
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

We develop novel timeline interfaces which separate the events in timelines into threads and then allow users to select among them. This interface is illustrated with five threads describing the causes of the American Civil War. In addition to selecting each of the threads, the sequence of events it describes can be played. That is, the user can step through the sequence of events and get a description of each event in the context of its thread. In addition, many of the events have links to more focused timelines and to external resources such as Wikipedia.
Belief Logic Programming
Authors: Hui Wan
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Various forms of quantitative logic programming have been widely used for dealing with uncertainty and inconsistency in knowledge representation. A less explored issue in quantitative logic programming is combining correlated pieces of information. Most works disregard correlation or assume that all sources are independent. Others make an effort to take some forms of correlation into account, but in an ad hoc manner.
Webjig: An Automated User Data Collection System for Website Usability Evaluation
Authors: Mikio Kiura, Masao Ohira, Ken-Ichi Matsumoto
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

In order to improve website usability, it is important for developers to understand how users access websites. In this paper, we present Webjig, which is a support system for website usability evaluation in order to resolve the problems associated with the existing systems. Webjig can collect users' interaction data from static and dynamic websites. Moreover, by using Webjig, developers can precisely identify users' activities on websites. By performing an experiment to evaluate the usefulness of Webjig, we have confirmed that developers could effectively improve website usability.
Scientific Workflow Model for Provenance Analysis Based on Many-sorted High-Level Nets
Authors: Ning Li, Jinqiang Hu
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Scientific workflow is becoming an important paradigm for scientific computations and collaborations. Provenance information plays an important role to reproduce data and prove the soundness of result for scientific workflow. The provenance information can be collected by keeping a complete trace of the workflow execution. In this paper, we give a high level Workflow Net model based on many-sorted signature algebraic nets. The model combines data type and Petri Net, and it is easy to depict the relation between provenance and workflow execution. Based on the model, it is convenient to capture provenance information and make further query.
Research of Transaction Request Handling Queueing System in the e-Business Environment Based on Queuing Theory
Authors: Liu Changfu, Liu Zhenyu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This study set up mathematical and simulation models to analyze and evaluate the efficiency impact brought by the variation of the transaction request queuing system in the e-Business environment based on queuing theory. The theoretic conclusion and simulation output have proved that the structural adjustment of queuing systems in the e-Business environment can reduce customer mean waiting time along with the simplicity of input and output of documents, and then improve customer service experience. This article had also studied a more common situation of customer arrival which has the characteristic of peak period distribution. The simulation result indicates when the customer interarrival times have the characteristic of peak period distribution, the decreased mean waiting time brought by the structural adjustment of queuing system in the e-Business environment is prominently less than the negative exponential distribution, and the efficiency improvement of request handling has been reduced, but the conclusion is still tenable.
A Search Algorithm Based on Referral Trust in Unstructured P2P Systems
Authors: Wang Ping, Qiu Jing, Qiu Yu Hui
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Efficient search algorithm is one of the important issues in unstructured P2P systems. However, current search mechanisms are not efficient or scalable enough with the expansion of system. Gossip-based P2P techniques are reliable and scalable protocols for information dissemination. To this end, one search algorithm based on gossip algorithm with referral trust is proposed in our paper, in which peers can disseminate the query with low traffic and better efficiency.
DEMORS: A hybrid multi-objective optimization algorithm using differential evolution and rough set theory for constrained problems
Authors: Luis V. Santana-Quintero, Alfredo G. Hernández-Díaz, Julián Molina, Carlos A. Coello Coello, Rafael Caballero
Venue: Computers and Operations Research (2010)

The aim of this paper is to show how the hybridization of a multi-objective evolutionary algorithm (MOEA) and a local search method based on the use of rough set theory is a viable alternative to obtain a robust algorithm able to solve difficult constrained multi-objective optimization problems at a moderate computational cost. This paper extends a previously published MOEA [Hernandez-Diaz AG, Santana-Quintero LV, Coello Coello C, Caballero R, Molina J. A new proposal for multi-objective optimization using differential evolution and rough set theory. In: 2006 genetic and evolutionary computation conference (GECCO'2006). Seattle, Washington, USA: ACM Press; July 2006], which was limited to unconstrained multi-objective optimization problems. Here, the main idea is to use this sort of hybrid approach to approximate the Pareto front of a constrained multi-objective optimization problem while performing a relatively low number of fitness function evaluations. Since in real-world problems the cost of evaluating the objective functions is the most significant, our underlying assumption is that, by aiming to minimize the number of such evaluations, our MOEA can be considered efficient. As in its previous version, our hybrid approach operates in two stages: in the first one, a multi-objective version of differential evolution is used to generate an initial approximation of the Pareto front. Then, in the second stage, rough set theory is used to improve the spread and quality of this initial approximation. To assess the performance of our proposed approach, we adopt, on the one hand, a set of standard bi-objective constrained test problems and, on the other hand, a large real-world problem with eight objective functions and 160 decision variables. The first set of problems are solved performing 10,000 fitness function evaluations, which is a competitive value compared to the number of evaluations previously reported in the specialized literature for such problems. The real-world problem is solved performing 250,000 fitness function evaluations, mainly because of its high dimensionality. Our results are compared with respect to those generated by NSGA-II, which is a MOEA representative of the state-of-the-art in the area.
A theory of forgetting in logic programming
Authors: Kewen Wang, Abdul Sattar, Kaile Su
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

The study of forgetting for reasoning has attracted considerable attention in AI. However, much of the work on forgetting, and other related approaches such as independence, irrelevance and novelty, has been restricted to the classical logics. This paper describes a detailed theoretical investigation of the notion of forgetting in the context of logic programming. We first provide a semantic definition of forgetting under the answer sets for extended logic programs. We then discuss the desirable properties and some motivating examples. An important result of this study is an algorithm for computing the result of forgetting in a logic program. Furthermore, we present a modified version of the algorithm and show that the time complexity of the new algorithm is polynomial with respect to the size of the given logic program if the size of certain rules is fixed. We show how the proposed theory of forgetting can be used to characterize the logic program updates.
The Solving Methods of Storing Data Lost in Testing System at the Power Breaking Off Time
Authors: Zhang Huixin, Wu Kerui, Liu Wenyi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper summarizes the traditional storing and testing methods in the first place. Brings forward the mostly used memory mode of data mixing edit frame and data separately edit frame. Illuminates the problem of data lost at power off time in each storing method. Then several solving methods aiming at the data losing situation of testing system at the power breaking off time are brought forward. Then analyzes the strongpoint and disadvantage of every method. In actual using process, we may choose the appropriate one according to the using environment and the memory medium. Carrying out the comparing and analyzing to the results of every storing method, the paper finally gives out the using conclusion, offers the consulting information for correlative specialties.
Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
Authors: Xu Guo, Junfeng Fan, Patrick Schaumont, Ingrid Verbauwhede
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

Elliptic Curve Cryptography implementations are known to be vulnerable to various side-channel attacks and fault injection attacks, and many countermeasures have been proposed. However, selecting and integrating a set of countermeasures targeting multiple attacks into an ECC design is far from trivial. Security, performance and cost need to be considered together. In this paper, we describe a generic ECC coprocessor architecture, which is scalable and programmable. We demonstrate the coprocessor architecture with a set of countermeasures to address a collection of side-channel attacks and fault attacks. The programmable design of the coprocessor enables tradeoffs between area, speed, and security.
Investigation of Network Structure in Taiwan Automobile Industry
Authors: Chang-Jan Yu, Ting-Lin Lee
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Many factors affected the supply chain network are almost based on inter-organizational relationships (IORs). Few supply chain scholars used social network analysis (SNA) to map communication between partners and figure out the supply chain network communication pattern, especially automobile industry. With SNA, the study finds out core-periphery structure, and explores four sub-groups (competition, co-design and developing, knowledge-sharing and proprietorship) in a large automobile network. Centrality is associated with perceived organizational function positively. The research suggested that perceptions of organizational performance are associated with the position in the network; central firms are more likely to perceive the organization performs well than those on the periphery.
Quantification of the Effect of Security on Performance in Wireless LANs
Authors: Gh. Rasool Begh, Ajaz Hussain Mir
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

This paper investigates and quantifies the effect of different security protocols on the performance of a wireless LAN. Experiments were performed on a wireless test-bed and the data obtained was analyzed for throughput, delay and packet loss under different security scenarios. Both TCP and UDP traffic streams were analyzed at three different data rates. The effect of congestion is also quantified. The results reveal that no significant degradation in performance occurs by enabling security protocols in a wireless LAN.
Unsupervised Learning of Probabilistic Object Models (POMs) for Object Classification, Segmentation, and Recognition Using Knowledge Propagation
Authors: Yuanhao Chen, Long (Leo) Zhu, Alan Yuille, HongJiang Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We present a method to learn probabilistic object models (POMs) with minimal supervision, which exploit different visual cues and perform tasks such as classification, segmentation, and recognition. We formulate this as a structure induction and learning task and our strategy is to learn and combine elementary POMs that make use of complementary image cues. We describe a novel structure induction procedure, which uses knowledge propagation to enable POMs to provide information to other POMs and “teach them” (which greatly reduces the amount of supervision required for training and speeds up the inference). In particular, we learn a POM-IP defined on Interest Points using weak supervision [1], [2] and use this to train a POM-mask, defined on regional features, which yields a combined POM that performs segmentation/localization. This combined model can be used to train POM-edgelets, defined on edgelets, which gives a full POM with improved performance on classification. We give detailed experimental analysis on large data sets for classification and segmentation with comparison to other methods. Inference takes five seconds while learning takes approximately four hours. In addition, we show that the full POM is invariant to scale and rotation of the object (for learning and inference) and can learn hybrid objects classes (i.e., when there are several objects and the identity of the object in each image is unknown). Finally, we show that POMs can be used to match between different objects of the same category, and hence, enable objects recognition.
Radius-Distance Based Semi-Supervised Algorithm
Authors: Zheng-Hua Qi, Geng Yang, Xun-Yi Ren
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

in order to improve the accuracy and efficiency of directly use of the K-Means clustering for semi-supervised learning, the paper proposes a new semi-supervised learning algorithm based on Radius-Distance. In the algorithm, according to Radius, farthest distance of sample to the cluster center of unlabelled samples using K-Means, and Distance, from cluster center of unlabelled samples to center of labeled samples, a small amount of unlabeled data are selected to aid training learning. Experimental results on the Kddcup'99 demonstrate that the advantages of proposed algorithm over the K-Means method and S3VM.
Understanding performance tradeoffs in algorithms for solving oversubscribed scheduling
Authors: Laurence A. Kramer, Laura V. Barbulescu, Stephen F. Smith
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips their availability and some subset of goals or tasks must be excluded. Two basic classes of techniques to solve oversubscribed scheduling problems have emerged: searching directly in the space of possible schedules and searching in an alternative space of task permutations (by relying on a schedule builder to provide a mapping to schedule space). In some problem contexts, permutation-based search methods have been shown to outperform schedule-space search methods, while in others the opposite has been shown to be the case. We consider two techniques for which this behavior has been observed: TaskSwap (TS), a schedule-space repair search procedure, and Squeaky Wheel Optimization (SWO), a permutation-space scheduling procedure. We analyze the circumstances under which one can be expected to dominate the other. Starting from a real-world scheduling problem where SWO has been shown to outperform TS, we construct a series of problem instances that increasingly incorporate characteristics of a second real-world scheduling problem, where TS has been found to outperform SWO. Experimental results provide insights into when schedule-space methods and permutation-based methods may be most appropriate.
A privacy expectations and security assurance offer system
Authors: Jeffrey Hunker
Venue: Proceedings of the 2007 Workshop on New Security Paradigms (2008)

Consumers accessing web sites for information or to purchase products face limited opportunity to express their privacy preferences, and even less recourse if security violations lead to inadvertent disclosure of privacy sensitive information. A privacy expectations and security assurance offer system is proposed in which on-line organizations with web sites offer consumers, in exchange for a fee, a choice of privacy preferences and information security levels; if privacy is violated under the terms of this privacy expectations and security assurance instrument, consumers will be compensated. The proposed offer system directly links responsibility and accountability for security of privacy information to the on-line organization, and has other benefits. Adoption is problematic, and will require market experimentation.