ppxscal/embedding_network huggingface dataset:
Statistical Disclosure Control for Microdata Using the R-Package sdcMicro
Authors: Matthias Templ
Venue: Transactions on Data Privacy (2008)

The demand for high quality microdata for analytical purposes has grown rapidly among researchers and the public over the last few years. In order to respect existing laws on data privacy and to be able to provide microdata to researchers and the public, statistical institutes, agencies and other institutions may provide masked data. Using our flexible software tools with which one can apply protection methods in an exploratory manner, it is possible to generate high quality confidential (micro-)data. In this paper we present highly flexible and easy to use software for the generation of anonymized microdata and give insights into the implementation and the design of the <strong>R</strong>-Package <em>sdcMicro</em>. <strong>R</strong> is a highly extendable system for statistical computing and graphics, distributed over the net. <em>sdcMicro</em> contains almost all popular methods for the anonymization of both categorical and continuous variables. Furthermore, several new methods have been implemented. The package can also be used for the comparison of methods and for measuring the information loss and disclosure risk of the masked data.
Fixed-parameter evolutionary algorithms and the vertex cover problem
Authors: Stefan Kratsch, Frank Neumann
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms to the input size and the cost of a minimum solution and point out that the search process of evolutionary algorithms creates partial solutions that are similar to the effect of a kernelization (i.e. a special type of preprocessing from parameterized complexity). Based on this, we show that evolutionary algorithms solve the vertex cover problem efficiently if the size of a minimum vertex cover is not too large, i.e. the expected runtime is bounded by O(f(OPT) nc), where c is a constant and f a function that only depends on OPT. This shows that evolutionary algorithms are randomized fixed-parameter tractable algorithms for the vertex cover problem.
First Observations from Reflective Learning on a Knowledge Repository
Authors: Gee Kin Yeo, Paulus Insap Santosa, J. B. Foo, P. C. Low
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)

An ontology-based knowledge repository, similar to the common digital archives for libraries, has been built to support collaborative on-line learning. A notable difference in the repository is that a resource in the depository needs not have a physical presence. Features in resource categorization and ratings provide opportunities for reflective thinking on a particular resource in the repository and its relevancy to the study domain. This paper describes the motivation, design theories and components of the repository system. An initial assessment of the system in actual use in a large class is obtained and the result is discussed.
A novel approach to interactive playgrounds: the interactive slide project
Authors: Joan Soler-Adillon, Jaume Ferrer, Narcís Parés
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

The incipient research on interactive playgrounds is a promising field that can enhance in many ways growth, health and education of children and youngsters. In this paper, we present a novel approach to interactive playgrounds by describing the physical and interaction design of a new platform: the Interactive Slide. We concentrate on the main design issues and relate the acceptance of this platform; specifically through two applications that we have designed for it: one for children 4 to 8 years and a second for youngsters 10 to 14. This platform can provide a fertile ground for creative, leisure and educational applications and experiences. However, our main focus is on countering lack of physical activity and lack of socialization in children, which are important issues in all developed countries (and some underdeveloped ones) and especially important in Europe because of their accelerated pace of incidence.
An interactive design environment for C-based high-level synthesis of RTL processors
Authors: Dongwan Shin, Andreas Gerstlauer, Rainer Dömer, Daniel D. Gajski
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Much effort in register transfer level (RTL) design has been devoted to developing "push-button" types of tools. However, given the highly complex nature, and lack of control on RTL design, push-button type synthesis is not accepted by many designers. Interactive design with assistance of algorithms and tools can be more effective if it provides control to the steps of synthesis. In this paper, we propose an interactive RTL design environment which enables designers to control the design steps and to integrate hardware components into a system. Our design environment is targeting a generic RTL processor architecture and supporting pipelining, multicycling, and chaining. Tasks in the RTL design process include clock definition, component allocation, scheduling, binding, and validation. In our interactive environment, the user can control the design process at every stage, observe the effects of design decisions, and manually override synthesis decisions at will. We present a set of experimental results that demonstrate the benefits of our approach. Our combination of automated tools and interactive control by the designer results in quickly generated RTL designs with better performance than fully-automatic results, comparable to fully manually optimized designs.
Term generalization and synonym resolution for biological abstracts: using the gene ontology for subcellular localization prediction
Authors: Alona Fyshe, Duane Szafron
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

The field of molecular biology is growing at an astounding rate and research findings are being deposited into public databases, such as Swiss-Prot. Many of the over 200,000 protein entries in Swiss-Prot 49.1 lack annotations such as subcellular localization or function, but the vast majority have references to journal abstracts describing related research. These abstracts represent a huge amount of information that could be used to generate annotations for proteins automatically. Training classifiers to perform text categorization on abstracts is one way to accomplish this task. We present a method for improving text classification for biological journal abstracts by generating additional text features using the knowledge represented in a biological concept hierarchy (the Gene Ontology). The structure of the ontology, as well as the synonyms recorded in it, are leveraged by our simple technique to significantly improve the F-measure of subcellular localization text classifiers by as much as 0.078 and we achieve F-measures as high as 0.935.
Comparative analysis for the new generation of encryption algorithms involved in NESSIE and CRYPTREC projects
Authors: Ciprian Racuciu, Dan Grecu, Florin Medeleanu, Nicolae Jula, Dan Raducanu
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

In February 2000 the NESSIE project has launched an open call for the next generation of cryptographic algorithms. The NESSIE project has received 39 algorithms, many of these from major players. In October 2001, the project completed the first phase of the evaluation and has selected 24 algorithms for the second phase. The selection of the portfolio of 17 recommended algorithms has been announced in February 2003. In 2000, Ministry of Economy Trade and Industry (formerly the Ministry of International Trade and Industry) entrusted the task of evaluating cryptographic techniques useful for the e-Government to the Information-technology Promotion Agency, Japan (IPA). In 2001, IPA and Telecommunications Advancement Organization of Japan (TAO) became a joint secretariat for the CRYPTREC Evaluation Committee, which works together with the newly organized CRYPTREC Advisory Committee. This article presents testing and evaluation procedures for block ciphers used within these projects.
Stability of a Cartesian grid projection method for zero Froude number shallow water flows
Authors: Stefan Vater, Rupert Klein
Venue: Numerische Mathematik (2009)

In this paper a Godunov-type projection method for computing approximate solutions of the zero Froude number (incompressible) shallow water equations is presented. It is second-order accurate and locally conserves height (mass) and momentum. To enforce the underlying divergence constraint on the velocity field, the predicted numerical fluxes, computed with a standard second order method for hyperbolic conservation laws and applied to an auxiliary system, are corrected in two steps. First, a MAC-type projection adjusts the advective velocity divergence. In a second projection step, additional momentum flux corrections are computed to obtain new time level cell-centered velocities, which satisfy another discrete version of the divergence constraint. The scheme features an exact and stable second projection. It is obtained by a Petrov&#x2013;Galerkin finite element ansatz with piecewise bilinear trial functions for the unknown height and piecewise constant test functions. The key innovation compared to existing finite volume projection methods is a correction of the in-cell slopes of the momentum by the second projection. The stability of the projection is proved using a generalized theory for mixed finite elements. In order to do so, the validity of three different inf-sup conditions has to be shown. The results of preliminary numerical test cases demonstrate the method&#x2019;s applicability. On fixed grids the accuracy is improved by a factor four compared to a previous version of the scheme.
TK-AKA: using temporary key on authentication and key agreement protocol on UMTS
Authors: Hsia-Hung Ou, Iuon-Chang Lin, Min-Shiang Hwang, Jinn-Ke Jan
Venue: International Journal of Network Management (2009)

Mobile communication is definitely one of the major high-technology applications that offer present-day people a modern life of appropriate convenience. In recent years, the third-generation cell phone system has approached maturity. The Universal Mobile Telecommunication System (UMTS) is currently the most widely used system around the world. The Third Generation Partnership Project is equipped with the Authentication and Key Agreement (AKA) protocol to maintain secrecy and security both during the authentication process and during the telecommunication session through UMTS. However, Hung and Li have pointed out that the UMTS-AKA protocol has three problems, involving bandwidth consumption, space overhead and synchronization of the sequence number, which are yet to be resolved. In addition, they have proposed an extension of the UMTS-AKA protocol, named the X-AKA protocol, to overcome these obstacles. Nevertheless, the X-AKA protocol too appears to have problems of its own. In this article, the weaknesses of X-AKA are enumerated. In addition, a more practical AKA protocol for UMTS is presented. The new protocol, based on the same framework as its predecessor, proves to be more efficient and practical, satisfying the requirements of modern living.
The Nonlinear Universe: Chaos, Emergence, Life, 1st edition
Authors: Alwyn C. Scott
Venue: The Frontiers Collection (2007)

Written in Alwyn Scotts inimitable style lucid and accessible The Nonlinear Universe surveys and explores the explosion of activity in nonlinear science that began in the 1970s and 1980s and continues today. The book explains the wide-ranging implications of nonlinear phenomena for future developments in many areas of modern science, including mathematics, physics, engineering, chemistry, biology, and neuroscience. Arguably as important as quantum theory, modern nonlinear science and an appreciation of its implications is essential for understanding scientific developments of the twenty-first century. 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
Digging Deeper Into AutoCAD Civil 3D 2008 - Level 2 Training
Authors: Rick Ellis, Scott Wolter
Venue:  (2007)

This advanced level book Civil 3D book builds on the foundations of our popular introductory level books for AutoCAD Civil 3D. The authors are skilled instructors with direct industry and classroom experience. You will learn the best procedures for many advanced tasks, including: Creating Horizontal Alignments Editing Alignments Working with Superelevatons Working with Profiles Working with Corridors Designing Intersections Plan Production Working with Pipe Setting and Rules Designing Pipe Networks\ Working with Grading Criteria Grading with Feature Lines Performing Finished Surface Analysis Calculating Final Earthwork Volumes Managing Project Data with Vault Features and Benefits of All Cadapult Books: Cadapult Software Solutions is an Authorized Autodesk Publisher Lessons build upon one another using a contiguous dataset, providing consistency through the entire book Skills learned through easy-to-follow, step-by-step procedures Sequential exercises that follow one logical, real-world example project Flexible datasets allow you to skip ahead to a relevant lesson, or use as an on-demand reference guide Detailed explanations and chapter summaries facilitate learning and retention Written by instructors with decades of industry and teaching experience Tested and refined in classrooms with a broad cross-section of students
GraphPad: a CS2/CS7 tool for graph creation
Authors: Sam Bryfczynski
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

This poster demonstrates a web-based software tool called GraphPad designed to facilitate interactivity in a CS2/CS7 course in which Tablet PCs or WACOM tablets are available. Using one of these devices users can use their own handwriting to construct graphs just as naturally as they would on paper without restrictions or limitations. For example, if a student would like to draw a node they would simply draw a circle on the screen followed by the label they would like to add to the node. Then a clean Circle and formatted text will appear in the place of the user's handwriting. Drawing edges is accomplished in the same intuitive way. By drawing a line or arrow between nodes, an edge forms between the two nodes. These edges may also have weights/labels added to them. This freedom is important for our academic applications of this software. It allows teachers to get a good sense of how students might write answers on quizzes or tests. GraphPad allows teachers and students to interact in a number of unique ways. Instructors may conduct a synchronous exercises or different asynchronous exercises.
Multi-Agent Reinforcement Learning Algorithm with Variable Optimistic-Pessimistic Criterion
Authors: Natalia Akchurina
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

A reinforcement learning algorithm for multi-agent systems based on variable Hurwicz's optimistic-pessimistic criterion is proposed. The formal proof of its convergence is given. Hurwicz's criterion allows to embed initial knowledge of how friendly the environment in which the agent is supposed to function will be. Thorough testing of the developed algorithm against well-known reinforcement learning algorithms has shown that in many cases its successful performance can be explained by its tendency to force the other agents to follow the policy which is more profitable for it. In addition the variability of Hurwicz's criterion allowed it to converge to best-response against opponents with stationary policies.
Automatic detection of breast cancers in mammograms using structured support vector machines
Authors: Defeng Wang, Lin Shi, Pheng Ann Heng
Venue: Neurocomputing (2009)

Breast cancer is one of the most common cancers diagnosed in women. Large margin classifiers like the support vector machine (SVM) have been reported effective in computer-assisted diagnosis systems for breast cancers. However, since the separating hyperplane determination exclusively relies on support vectors, the SVM is essentially a local classifier and its performance can be further improved. In this work, we introduce a structured SVM model to determine if each mammographic region is normal or cancerous by considering the cluster structures in the training set. The optimization problem in this new model can be solved efficiently by being formulated as one second order cone programming problem. Experimental evaluation is performed on the Digital Database for Screening Mammography (DDSM) dataset. Various types of features, including curvilinear features, texture features, Gabor features, and multi-resolution features, are extracted from the sample images. We then select the salient features using the recursive feature elimination algorithm. The structured SVM achieves better detection performance compared with a well-tested SVM classifier in terms of the area under the ROC curve.
QoX-driven ETL design: reducing the cost of ETL consulting engagements
Authors: Alkis Simitsis, Kevin Wilkinson, Malu Castellanos, Umeshwar Dayal
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

As business intelligence becomes increasingly essential for organizations and as it evolves from strategic to operational, the complexity of Extract-Transform-Load (ETL) processes grows. In consequence, ETL engagements have become very time consuming, labor intensive, and costly. At the same time, additional requirements besides functionality and performance need to be considered in the design of ETL processes. In particular, the design quality needs to be determined by an intricate combination of different metrics like reliability, maintenance, scalability, and others. Unfortunately, there are no methodologies, modeling languages or tools to support ETL design in a systematic, formal way for achieving these quality requirements. The current practice handles them with ad-hoc approaches only based on designers' experience. This results in either poor designs that do not meet the quality objectives or costly engagements that require several iterations to meet them. A fundamental shift that uses automation in the ETL design task is the only way to reduce the cost of these engagements while obtaining optimal designs. Towards this goal, we present a novel approach to ETL design that incorporates a suite of quality metrics, termed QoX, at all stages of the design process. We discuss the challenges and tradeoffs among QoX metrics and illustrate their impact on alternative designs.
Comprehensive Optimization of Declarative Sensor Network Queries
Authors: Ixent Galpin, Christian Y. Brenninkmeijer, Farhana Jabeen, Alvaro A. Fernandes, Norman W. Paton
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

We present a sensor network query processing architecture that covers all the query optimization phases that are required to map a declarative query to executable code. The architecture is founded on the view that a sensor network truly is a distributed computing infrastructure, albeit a very constrained one. As such, we address the problem of how to develop a comprehensive optimizer for an expressive declarative continuous query language over acquisitional streams as one of finding extensions to classical distributed query processing techniques that contend with the peculiarities of sensor networks as an environment for distributed computing.
Designing oral participation in second life – a comparative study of two language proficiency courses
Authors: Mats Deutschmann, Luisa Panichi, Judith Molka-danielsen
Venue: ReCALL (2009)

The following paper presents two stages of an action research project involving two oral proficiency courses held in the virtual world Second Life. Course 1 was conducted during the Autumn of 2007. Based on the experiences of this course, we redesigned many aspects of it in order to improve student activity in terms of oral participation and gave the course again in Spring 2008. By analysing the recordings of four 90-minute sessions, two from each course, we were able to measure student participation based on floor space, turn lengths and turn-taking patterns, and in the study we discuss how different changes in design may have contributed to more favourable outcomes. Results seem to indicate that meaning focussed task design, which involves authenticity and collaborative elements, has a direct impact on learner participation and engagement. Furthermore, our results seem to suggest that technical and social initiations into a complex environment such as SL are important factors that have to be worked into the course design.
Logical omniscience as a computational complexity problem
Authors: Sergei Artemov, Roman Kuznets
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views logical omniscience as a computational complexity problem. We suggest the following approach: we assume that the knowledge of an agent is represented by an epistemic logical system E; we call such an agent not logically omniscient if for any valid knowledge assertion A of type F is known, a proof of F in E can be found in polynomial time in the size of A. We show that agents represented by major modal logics of knowledge and belief are logically omniscient, whereas agents represented by justification logic systems are not logically omniscient with respect to t is a justification for F.
Health status and air quality parameters monitoring based on mobile technology and WPAN
Authors: O. A. Postolache, P.M.B. Silva Girao, P. Sinha, A. Anand, G. Postolache
Venue: International Journal of Advanced Media and Communication (2009)

The paper presents a Wireless Personal Area Network (WPAN) including two Bluetooth-enabled measuring nodes that delivers information about some physiological parameters extracted from photo-plethysmographic signals and provides information of indoor air temperature and relative humidity. The data from the node of physiological and air parameters measurement are received by a smart phone device through Bluetooth communication. J2ME developed software assures Bluetooth device detection and identification, data reading, primary processing, data storage and automatic alarm generation. Critical health status associated with the assessed person leads to an automatic SMS generation. Elements related to Heart-Rate Variability (HRV) estimation are also included in the paper. This is an expanded version of a paper presented at the 3rd IEEE International Workshop on Medical Measurements and Applications, 9 10 May 2008, Ottawa, ON, Canada.