ppxscal/embedding_network huggingface dataset:
Automatic and Semi-Automatic Skill Coding With a View Towards Supporting On-Line Assessment
Authors: Carolyn Rosé, Pinar Donmez, Gahgene Gweon, Andrea Knight, Brian Junker, William Cohen, Kenneth Koedinger, Neil Heffernan
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper explores the problem of automatic and semi-automatic coding of on-line test items with a skill coding that allows the assessment to occur at a level that is both indicative of overall test performance and useful for providing teachers with information about specific knowledge gaps that students are struggling with. In service of this goal, we evaluate a novel text classification approach for improving performance on skewed data sets that exploits the hierarchical nature of the coding scheme used. We also address methodological concerns related to semi-automatic coding.
Peer assessments using the moodle workshop tool
Authors: John F. Dooley
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

n this Tip, we describe our experiences over the past four years in using the Workshop tool in the Moodle Learning Management System (LMS) to allow students to do peer assessments of student written journal article reviews. In our junior-level Software Development course, students are required to read and review several journal articles, producing a written review of 2-4 pages. Students are then required to use the Workshop tool to read and assess the work of several of their peers using an instructor-supplied rubric. In this Tip we describe the Workshop tool, how it is set up for student use, and the results of several experiences with this approach.
Analysis and scheduling of practical network coding in OFDMA relay networks
Authors: Yuedong Xu, John C. S. Lui, Dah-Ming Chiu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization. Specifically, we aim to explore the following questions: (1) When and how can wireless nodes select relay paths in the presence of network coding? (2) How can an OFDMA relay system assign network resource such as subcarrier and power for all the transmitting nodes? (3) What are the impacts of OFDMA system parameters on the network coding gain? To answer these questions, two efficient coding-aware relay strategies are presented to select forwarding paths with fixed and dynamic power allocation. In order to exploit the network capacity in slow frequency selective fading channels, we formulate optimization frameworks and propose channel-aware coding-aware resource allocation algorithms for an arbitrary traffic pattern. Our studies show that the network coding (i.e. XOR) gain depends on the nodes' powers, traffic patterns etc. Especially, OFDMA relay network with dynamic power possesses both coding gain and power gain. Extensive simulations are performed to verify our analysis and demonstrate the throughput improvement of our proposals in the presence of XOR coding.
Stable solving of CVRPs using hyperheuristics
Authors: Pablo Garrido, Carlos Castro
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

In this paper we present a hill-climbing based hyperheuristic which is able to solve instances of the capacitated vehicle routing problem. The hyperheuristic manages a sequence of constructive-perturbative pairs of low-level heuristics which are applied sequentially in order to construct and improve partial solutions. We present some design considerations that we have taken into account to find the most promising sequence and allow the collaboration among low-level heuristics. Our approach has been tested using some standard state-of-the-art benchmarks and we have compared them with several well-known methods proposed in the literature. We have obtained, on average, stable and good quality solutions after solving various types of problems. Thus, we conclude that our collaborative framework is an interesting approach as it has proved to be: (1) able to adapt itself to different problem instances by choosing a suitable combination of low-level heuristics and (2) capable of preserving stability when solving different types of problems.
Structure identification of uncertain general complex dynamical networks with time delay
Authors: Hui Liu, Jun-An Lu, Jinhu Lü, David J. Hill
Venue: Automatica (Journal of IFAC) (2009)

It is well known that many real-world complex networks have various uncertain information, such as unknown or uncertain topological structure and node dynamics. The structure identification problem has theoretical and practical importance for uncertain complex dynamical networks. At the same time, time delay often appears in the state variables or coupling coefficients of various practical complex networks. This paper initiates a novel approach for simultaneously identifying the topological structure and unknown parameters of uncertain general complex networks with time delay. In particular, this method is also effective for uncertain delayed complex dynamical networks with different node dynamics. Moreover, the proposed method can be easily extended to monitor the on-line evolution of network topological structure. Finally, three representative examples are then given to verify the effectiveness of the proposed approach.
Building search applications with Marklogic Server
Authors: Ron Avnur
Venue: Proceedings of the First International Workshop on Keyword Search on Structured Data (2009)

Keyword search is recognized as an important technique to unlocking the information found in both structured and semi-structured information. With XML as the data model and XQuery as the programming language, MarkLogic Server[1] allows developers to build search into their information-centric applications. We are increasingly interested in lowering the learning curve of application development. This demo will show a tool that interrogates a corpus of information, presents a user interface to define the behavior of an application, and then compiles and deploys a search application over a set of XML documents.
Smart Policies for Workplace Technology: Email, Blogs, Cell Phones & More
Authors: Lisa Guerin
Venue:  (2009)

Keep your workplace safe -- create a sensible technology policy with this all-in-one-guide. Sixty-eight percent of employees in the U.S. have sent emails that exposed their company to risk, and more than 229 million records have been taken from stolen business laptops or hacked business websites since 2005. It is no wonder, then, that technology dangers consistently rank number one on the list of employers' concerns. Every new device that promises to make our lives easier brings with it the risk of misuse -- whether accidental or intentional. That's why it's so important that any business that employs both people and computers create a safe and sensible policy for technologies in the workplace. Smart Policies for Workplace Technologies provides the tools employers need to assess your current policies' effectiveness, along with information on how to draft or revise, then distribute and enforce your new customized policies. Learn how to protect your business with a policy that addresses: Trade secret protection Customer, employer and employee privacy Communicating with employees regarding privacy policy Managing electronic documents and tools Limiting liability for employee misconduct Conserving company resources Co-published with the Society of Human Resource Management (SHRM), Smart Policies for Workplace Technologies keeps your business safe, online and off.
Principles of Information Security, 3rd edition
Authors: Michael E. Whitman, Herbert J. Mattord
Venue:  (2007)

Explore the field of information security and assurance with this valuable resource that focuses on both the managerial and technical aspects of the discipline. Principles of Information Security, Third Edition builds on internationally recognized standards and bodies of knowledge to provide the knowledge and skills that information systems students need for their future roles as business decision-makers. Coverage includes key knowledge areas of the CISSP (Certified Information Systems Security Professional), as well as risk management, cryptography, physical security, and more. The third edition has retained the real-world examples and scenarios that made previous editions so successful, but has updated the content to reflect technologys latest capabilities and trends. With this emphasis on currency and comprehensive coverage, readers can feel confident that they are using a standards-based, content-driven resource to prepare them for their work in the field.
Understanding learners' perspectives on m-learning: results from a survey
Authors: Yong Liu, Feng Hu, Hongxiu Li
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

China adopts an unprecedented way of diffusing m-learning in which mobile manufacturers play a central role in offering and developing m-learning products and services. This study reports current situation of m-learning in China. A questionnaire was developed with a collection of 65 responses. Based on the survey, this study aims to investigate learners' preference for daily m-learning usage as well as the impact of technological restrictions. Finally, the market potentials of m-learning in China are investigated as well.
Supporting the end users' views
Authors: David F. Redmiles
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

End users of software have the right to systems that are both useful and usable, a property termed usability in the software and human-computer interaction communities. Unfortunately, it is not obvious what methods or techniques developers of software should adopt in order to achieve good usability in a product. There are a confounding number of questions. How can different points of view among end users be incorporated into a software development process? What does it mean to treat software developers as end users, namely of software tools? How do the limitations of software practice, such as minimizing time to release, affect what information can be collected and used to make usability decisions? This paper presents a variety of possibilities for supporting all the end users' views in a software development activity. Both tools and methods are suggested, roughly organized according to the different activities in software development. Moreover, end users are defined to be a variety of stakeholders in a software development project, including at the very least the end users of a product but also developers who are end users of software tools.
Measuring communication gap in software requirements elicitation process
Authors: Abdullah Mohd Zin, Noraini Che Pa
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Requirements elicitation is a process of seeking, uncovering, acquiring and elaborating requirements for developing a computer-based system. These processes involve communication between customers and developers. Techniques of communication that are normally used includes verbal, written and interpersonal. According to previous researches, there are numerous communication problems occurred between customers and developers during the requirement elicitation process. This study describes a technique for measuring communication gap between customers and developers during requirements elicitation. This technique is constructed by using Iterative Triangulation method. Five variables are proposed in this measurement: input, communication skills, personality, medium and procedures. The evaluation indicates that the proposed technique is able to produce the right measurement of the communication gap between customers and developers during requirements elicitation.
Theoretical Kaleidoscope, 1st edition
Authors: I. B. Khriplovich
Venue: Lecture Notes In Physics (2007)

This book is based on material taught in general and special theoretical physics courses given by I.B. Khriplovich at the Physics Department of Novosibirsk University, Russia. It is assumed that the reader is acquainted with fundamentals of classical mechanics, classical electrodynamics, quantum mechanics, and (in the last chapter only) relativistic quantum mechanics. These fundamentals are not discussed explicitly but instead demonstrate, by solving concrete problems, how they work in practice. Indeed, according to Newton, in studies of science, examples are more useful than rules. To the best of Khriplovichs knowledge, most of these problems have never been discussed in textbooks, and it is believed that this is certainly true for the solutions presented. In all the texts discussions, reliance is on intuitive, qualitative arguments, the only exception in this respect being Chapter 4 which contains a consistent presentation of the semiclassical approximation in complex plane. 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
MIR closures of polyhedral sets
Authors: Sanjeeb Dash, Oktay G&#x00fc;nl&#x00fc;k, Andrea Lodi
Venue: Mathematical Programming: Series A and B (2009)

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objective using additional variables to produce a linear MIP model that solves the separation problem exactly. Using a subset of these additional variables yields an MIP model which solves the separation problem approximately, with an accuracy that depends on the number of additional variables used. Our analysis yields an alternative proof of the result of Cook et al. (1990) that the split closure of a polyhedral set is again a polyhedron. We also discuss a heuristic to obtain MIR cuts based on our approximate separation model, and present some computational results.
Efficient Learning from Massive Spatial-Temporal Data through Selective Support Vector Propagation
Authors: Yilian Qin, Zoran Obradovic
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)

In the proposed approach, learning from large spatial-temporal data streams is addressed using the sequential training of support vector machines (SVM) on a series of smaller spatial data subsets collected over shorter periods. A set of representatives are selected from support vectors corresponding to an SVM trained with data of a limited spatial-temporal coverage. These representatives are merged with newly arrived data also corresponding to a limited spacetime segment. A new SVM is learned using both sources. Relying on selected representatives instead of propagating all support vectors to the next iteration allows efficient learning of semi-global SVMs in a non-stationary series consisting of correlated spatial datasets. The proposed method is evaluated on a challenging geoinformatics problem of aerosol retrieval from Terra satellite based Multi-angle Imaging Spectro Radiometer instrument. Regional features were discovered that allowed spatial partitioning of continental US to several semi-global regions. Developed semi-global SVM models were reused for efficient estimation of aerosol optical depth from radiances with a high level of accuracy on data cycles spanning several months. The obtained results provide evidence that SVMs trained as proposed have an extended spatial and temporal range of applicability as compared to SVM models trained on samples collected over shorter periods. In addition, the computational cost of training a semi-global SVM with selective support vector propagation (SSVP) was much lower than when training a global model using spatial observations from the entire period.
Changing middle-school students' attitudes and performance regarding engineering with computer-based social models
Authors: E. Ashby Plant, Amy L. Baylor, Celeste E. Doerr, Rinat B. Rosenberg-Kima
Venue: Computers Education (2009)

Women's under-representation in fields such as engineering may result in part from female students' negative beliefs regarding these fields and their low self-efficacy for these fields. In this experiment, we investigated the use of animated interface agents as social models for changing male and female middle-school students' attitudes toward engineering-related fields, their self-efficacy for these fields, and their math performance. Students interacted with either a female or a male computer-based agent or they did not interact with an agent. The female agent increased interest, utility beliefs, self-efficacy, and math performance compared to control and, for boys, decreased stereotyping. Mediational analyses indicated that the female agent facilitated interest and math performance by enhancing self-efficacy. The findings indicate that interface agents may be used effectively as social models for influencing attitudes and beliefs and supporting performance.
Students' performance and satisfaction with Web vs. paper-based practice quizzes and lecture notes
Authors: Mônica Macedo-Rouet, Muriel Ney, Sandrine Charles, Geneviève Lallich-Boidin
Venue: Computers Education (2009)

The use of computers to deliver course-related materials is rapidly expanding in most universities. Yet the effects of computer vs. printed delivery modes on students' performance and motivation are not yet fully known. We compared the impacts of Web vs. paper to deliver practice quizzes that require information search in lecture notes. Hundred and twenty two undergraduate students used either a web site or printed documents to answer 18 mathematics questions during a tutored session. A revised Web site was designed based on ergonomic criteria, to test the hypothesis that improved usability would decrease time spent on the task, the number of pages consulted, and students' perceived cognitive load. The group working with printed documents had the highest performance. Furthermore, students perceived the paper materials as less effortful to read, and expressed preference for printing lecture notes and questions. However, students appreciated having a Web site available. No differences were found between the two sites. We conclude that Web delivery imposed higher perceived cognitive load due to the need to read lengthy documents. We suggest possible ways to improve Web-based practice materials, such as simultaneous display of questions and lecture notes.
Making Project Fields Accessible
Authors: Naoko Osada, Naomi Miyake
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Many computer-based courses in higher education use a project-based design to promote students' autonomy and in-depth understanding. Although these courses fully exploit the power of computer-supported collaborative learning (CSCL) environments, we know little about effective course design to include authentic project fields. In this study, we investigated the accessibility that connects students' activities in CSCL settings and the real world. As a result, we identified three design requirements for the improvement of accessibility to deepen students' activities. These are: 1) Set the opportunity for shared and concrete field experience in the early stages of the course; 2) promote diverse inquiry, and 3) increase field activities based on sufficient reflection.
Fast Algorithm for Graph Isomorphism Testing
Authors: José Luis López-Presa, Antonio Fernández Anta
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using backtracking, with a (possibly partial) automorphism precomputing that allows to prune the search tree. We propose an algorithm, conauto, that has a space complexity of O(n 2 logn) bits. It runs in time O(n 5) with high probability if either one of the input graphs is a G(n,p) random graph, for p ¿ [¿(ln 4 n / n ln ln n ), 1 ¿ ¿(ln 4 n / n ln ln n )]. We compare the practical performance of conauto with other popular algorithms, with an extensive collection of problem instances. Our algorithm behaves consistently for directed, undirected, positive, and negative cases. Additionally, when it is slower than any of the other algorithms, it is only by a small factor.
EXPTIME-complete Decision Problems for Modal and Mixed Specifications
Authors: Adam Antonik, Michael Huth, Kim G. Larsen, Ulrik Nyman, Andrzej Wąsowski
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Modal and mixed transition systems are formalisms that allow mixing of over- and under-approximation in a single specification. We show EXPTIME-completeness of three fundamental decision problems for such specifications: whether a set of modal or mixed specifications has a common implementation, whether a sole mixed specification has an implementation, and whether all implementations of one mixed specification are implementations of another mixed or modal one. These results are obtained by a chain of reductions starting with the acceptance problem for linearly bounded alternating Turing machines.
An architecture for recycling intermediates in a column-store
Authors: Milena G. Ivanova, Martin L. Kersten, Niels J. Nes, Romulo A.P. Gonçalves
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Automatically recycling (intermediate) results is a grand challenge for state-of-the-art databases to improve both query response time and throughput. Tuples are loaded and streamed through a tuple-at-a-time processing pipeline avoiding materialization of intermediates as much as possible. This limits the opportunities for reuse of overlapping computations to DBA-defined materialized views and function/result cache tuning. In contrast, the operator-at-a-time execution paradigm produces fully materialized results in each step of the query plan. To avoid resource contention, these intermediates are evicted as soon as possible. In this paper we study an architecture that harvests the by-products of the operator-at-a-time paradigm in a column store system using a lightweight mechanism, the recycler. The key challenge then becomes selection of the policies to admit intermediates to the resource pool, their retention period, and the eviction strategy when facing resource limitations. The proposed recycling architecture has been implemented in an open-source system. An experimental analysis against the TPC-H ad-hoc decision support benchmark and a complex, real-world application (SkyServer) demonstrates its effectiveness in terms of self-organizing behavior and its significant performance gains. The results indicate the potentials of recycling intermediates and charters a route for further development of database kernels.