ppxscal/embedding_network huggingface dataset:
The impact of a computer-based reading intervention program, "academy of reading" on the reading achievement of second and third graders
Authors: Mabel C. Okojie
Venue:  (2008)

This study's purpose was to examine the impact of a computer-assisted reading program, "Academy of Reading," on reading achievement of 2nd and 3rd grade readers. The researcher studied the impact a computer-aided reading program had on the reading achievement of students in a central Mississippi suburban school district. A quasi-experimental research design was used to conduct the research. There were a total of 8 intact classes out of 30 classes from 1 elementary school used in the study. Of these 8, 4 were 2nd-grade classes of 15 intact classes and 4 were 3rd-grade classes of 15 intact classes. The 2nd grade reading classes that were selected were identified as below average according to the Scientific Research Association (SRA) Reading Placement Test. The 3rd grade classes selected were performing at grade level. The 3rd grade did not have many intact classes below the established grade 3 level as in 2nd grade. The selected classes were randomly put in the control and quasi-experimental groups. Both groups were given the STAR reading assessment as a pretest. The quasi-experimental group contained 65 students who received the treatment for a 9-week period. Each class went to the computer lab 3 times a week for 30-minute sessions. The control group contained 68 students who continued with independent reading activities in the classroom. At the end of the quasi-experimental treatment both groups were administered the STAR reading assessment as the post-test. The control group had a pretest mean score of 3.14 and the quasi-experimental group had 2.64. An analysis of covariance was used to adjust for the pretest differences. The post-test scores indicated a slight increase in the mean scores in reading performance of both groups. The mean score for the control group was 3.30 and the quasi-experimental group was 2.87. The control group students improved the mean score by 0.16 and the quasi-experimental group improved by 0.23 points. There was no significant difference; therefore the null hypothesis was accepted. The quasi-experimental group had increased in reading performance as suggested by many articles and research publications, such as Fiedorowicz and Trites (1987), Colorado Commission of the States (1999), and Schacter (2000) supporting Academy of Reading. When the data were analyzed based on gender, ethnicity, and grade level, the quasi-experimental group had the largest increase in the mean scores. However, the findings showed that there was no statistical difference among the groups based on these demographic variables.
Virtual Forced Splitting, Demotion and the BV-Tree
Authors: Alan P. Sexton, Richard Swinbank
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

In external multi-dimensional access methods, Forced Splitting is an approach used to ensure that, when a page splits, no sub-tree of the page belongs under both halves, thereby guaranteeing that only one path from the root need be searched to find any point in the tree. This reduces occupancy of forcibly split pages, possibly down to single entries in pathological cases. Freeston introduced a novel approach to obtaining the benefits of forced splitting while avoiding the negative consequences for a class of access methods he called BV-Trees. Perhaps because of its rather abstract presentation and the lack of complete algorithm descriptions, we believe that this idea has not achieved the recognition it deserves. We present a different view of the BV-Tree concept in terms of what we call Virtual Forced Splitting (VFS), show how the semantics of a VFS tree can be understood by its relationship to a much simpler Forced Split tree obtained by reduction from the VFS tree. This allows an explanation of the complex issue of demotion; a requirement for correct implementation that is acknowledged but not discussed in the literature before now. We show how various multi-dimensional algorithms such as k-Nearest Neighbour and Range Search can be effectively implemented on such trees, and, finally, discuss our own implementation of a BV-Tree, and report performance results in comparison to the R*-Tree.
Methods for Linear and Differential Cryptanalysis of Elastic Block Ciphers
Authors: Debra L. Cook, Moti Yung, Angelos D. Keromytis
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

The elastic block cipher design employs the round function of a given, b-bit block cipher in a black box fashion, embedding it in a network structure to construct a family of ciphers in a uniform manner. The family is parameterized by block size, for any size between b and 2b. The design assures that the overall workload for encryption is proportional to the block size. When considering the approach taken in elastic block ciphers, the question arises as to whether cryptanalysis results, including methods of analysis and bounds on security, for the original fixed-sized cipher are lost or, since original components of the cipher are used, whether previous analysis can be applied or reused in some manner.With this question in mind, we analyze elastic block ciphers and consider the security against two basic types of attacks, linear and differential cryptanalysis. We show how they can be related to the corresponding security of the fixed-length version of the cipher. Concretely, we develop techniques that take advantage of relationships between the structure of the elastic network and the original version of the cipher, independently of the cipher.This approach demonstrates how one can build upon existing components to allow cryptanalysis within an extended structure (a topic which may be of general interest outside of elastic block ciphers). We show that any linear attack on an elastic block cipher can be converted efficiently into a linear attack on the fixed-length version of the cipher by converting the equations used to attack the elastic version to equations for the fixed-length version. We extend the result to any algebraic attack. We then define a general method for deriving the differential characteristic bound of an elastic block cipher using the differential bound on a single round of the fixed-length version of the cipher. The structure of elastic block ciphers allows us to use a state transition method to compute differentials for the elastic version from differentials of the round function of the original cipher.
A domain specific modeling language for multiagent systems
Authors: Christian Hahn
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Software systems are becoming more and more complex with a large number of interacting partners often distributed over a network. A common dilemma faced by software engineers in building complex systems is the lack of clear requirements and domain knowledge needed to come up with a detailed design of the system. Agent technologies are a suitable programming paradigm to cope with the complexity of modern software systems. However, existing agent-based methodologies and tools are developed for experienced programmers and are not suitable for non-agent experts. This paper discusses a domain specific modeling language for multiagent systems that (i) provides a clear syntax and semantics to define agent-based systems in a graphical visualized manner and (ii) can be used to automatically derive code from its design through model transformations.
Navigational Path Expressions on XML Schemas
Authors: Federico Cavalieri, Giovanna Guerrini, Marco Mesiti
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

XML Schema is employed for describing the type and structure of information contained in valid XML documents. As for a document, a schema can be navigated and its components can be identified through a path language. In this paper we discuss the drawbacks of using XPath for this purpose and present XSPath, a language tailored for specifying path expressions on schemas.
Security lapses and the omission of information security measures: A threat control model and empirical test
Authors: Michael Workman, William H. Bommer, Detmar Straub
Venue: Computers in Human Behavior (2008)

Organizations and individuals are increasingly impacted by misuses of information that result from security lapses. Most of the cumulative research on information security has investigated the technical side of this critical issue, but securing organizational systems has its grounding in personal behavior. The fact remains that even with implementing mandatory controls, the application of computing defenses has not kept pace with abusers' attempts to undermine them. Studies of information security contravention behaviors have focused on some aspects of security lapses and have provided some behavioral recommendations such as punishment of offenders or ethics training. While this research has provided some insight on information security contravention, they leave incomplete our understanding of the omission of information security measures among people who know how to protect their systems but fail to do so. Yet carelessness with information and failure to take available precautions contributes to significant civil losses and even to crimes. Explanatory theory to guide research that might help to answer important questions about how to treat this omission problem lacks empirical testing. This empirical study uses protection motivation theory to articulate and test a threat control model to validate assumptions and better understand the ''knowing-doing'' gap, so that more effective interventions can be developed.
An Extension to the Sammon Mapping for the Robust Visualization of Speaker Dependencies
Authors: Andreas Maier, Julian Exner, Stefan Steidl, Anton Batliner, Tino Haderlein, Elmar Nöth
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We present a novel method for the visualization of speakers which is microphone independent. To solve the problem of lacking microphone independency we present two methods to reduce the influence of the recording conditions on the visualization. The first one is a registration of maps created from identical speakers recorded under different conditions, i.e., different microphones and distances in two steps: Dimension reduction followed by the linear registration of the maps. The second method is an extension of the Sammon mapping method, which performs a non-linear registration during the dimension reduction procedure. The proposed method surpasses the two step registration approach with a mapping error ranging from 17 % to 24 % and a grouping error which is close to zero.
Constraints for Argument Filterings
Authors: Harald Zankl, Nao Hirokawa, Aart Middeldorp
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and KBO, argument filterings play a key role. In this paper we propose an encoding of argument filterings in propositional logic. By incorporating propositional encodings of simplification orders, the search for suitable argument filterings is turned into a satisfiability problem. Preliminary experimental results show that our logic-based approach is significantly faster than existing implementations.
Neural-Based Separating Method for Nonlinear Mixtures
Authors: Ying Tan
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A neural-based method for source separation in nonlinear mixture is proposed in this paper. A cost function, which consists of the mutual information and partial moments of the outputs of the separation system, is defined to extract the independent signals from their nonlinear mixtures. A learning algorithm for the parametric RBF network is established by using the stochastic gradient descent method. This approach is characterized by high learning convergence rate of weights, modular structure, as well as feasible hardware implementation. Successful experimental results are given at the end of this paper.
Probability of collisions in soft input decryption
Authors: Natasa Zivic, Christoph Ruland
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this work, probability of collision in Soft Input Decryption has been analyzed and calculated. Collisions of cryptographic check values cause wrong verification results. Therefore, it is important to find an analytical form of a probability of collisions, which can be used for estimation of an efficiency of Soft Input Decryption. It is known, that shorter cryptographic check values cause often collisions. For that reason, the number of collisions for cryptographic check values has been tested and compared with the theoretical results.
Efficient Bisecting k-Medoids and Its Application in Gene Expression Analysis
Authors: Rasha Kashef, Mohamed S. Kamel
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

The medoid-based clustering algorithm, Partition Around Medoids (PAM), is better than the centroid-based k-means because of its robustness to noisy data and outliers. PAM cannot recognize relatively small clusters in situations where good partitions around medoids clearly exist. Also PAM needs O(k(n-k)2) operations to cluster a given dataset, which is computationally prohibited for large n and k. In this paper, we propose a new bisecting k-medoids algorithm that is capable of grouping the co-expressed genes together with better clustering quality and time performances. The proposed algorithm is evaluated over three gene expression datasets in which noise components are involved. The proposed algorithm takes less computation time with comparable performance relative to the Partitioning Around Medoids algorithm.
GATiB-CSCW, Medical Research Supported by a Service-Oriented Collaborative System
Authors: Konrad Stark, Jonas Schulte, Thorsten Hampel, Erich Schikuta, Kurt Zatloukal, Johann Eder
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Medical research is a collaborative process in an interdisciplinary environment that may be effectively supported by a Computer Supported Cooperative Work (CSCW) system. Such a system imposes specific requirements in order to allow flexible integration of data, analysis services and communication mechanisms. Persons with different expertise and access rights cooperate in mutually influencing contexts (e.g. clinical studies, research cooperations). Thus, appropriate virtual environments are needed to facilitate context-aware communication, deployment of biomedical tools as well as data and knowledge sharing. We systematically elaborate the main requirements of a medical CSCW system and present a conceptual model, as well as an architectural proposal satisfying the demands. We design a prototypical virtual workbench to support research and routine activities in the context of the GATiB (Genome Austria Tissue Bank) initiative.
Parallel I/O prefetching using MPI file caching and I/O signatures
Authors: Surendra Byna, Yong Chen, Xian-He Sun, Rajeev Thakur, William Gropp
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Parallel I/O prefetching is considered to be effective in improving I/O performance. However, the effectiveness depends on determining patterns among future I/O accesses swiftly and fetching data in time, which is difficult to achieve in general. In this study, we propose an I/O signature-based prefetching strategy. The idea is to use a predetermined I/O signature of an application to guide prefetching. To put this idea to work, we first derived a classification of patterns and introduced a simple and effective signature notation to represent patterns. We then developed a toolkit to trace and generate I/O signatures automatically. Finally, we designed and implemented a thread-based client-side collective prefetching cache layer for MPI-IO library to support prefetching. A prefetching thread reads I/O signatures of an application and adjusts them by observing I/O accesses at runtime. Experimental results show that the proposed prefetching method improves I/O performance significantly for applications with complex patterns.
Parameterised Extra-Functional Prediction of Component-Based Control Systems --- Industrial Experience
Authors: Ian D. Peake, Heinz W. Schmidt
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Delivering and maintaining dependable component-based systems within budget is a significant practical challenge. Best practice even in large organisations is only just starting to move beyond simple testing for verification of performance and reliability.The eCAP(-CBCS) project, a collaboration between ABB Corporate Research and Monash University, Australia, seeks to extend research in architectural modelling and analysis, and apply it to distributed, embedded control systems. Background theory developed by Monash's Distributed Systems and Software Engineering group includes generic models for composing parameterised component interaction protocols, behaviours, types and properties such as reliability and execution time.The project produced a prototype to detect and diagnose excessive peak load in controllers caused by high task worst-case execution time / interval time ratios. Development incorporated typical business and technical requirements, both functional and extra-functional, e.g., integration into an existing development platform, prediction strategy to cope with components without source, usability, and adequate analyser performance.Lessons learned and observations include: applications for software metrics and profile visualisation techniques; design refinements such as component type parameterisation for accurate, context-sensitive component property analyses, and; ideas for exploiting underlying theory such as context-sensitive model-driven performance testing.
Universal Design: Lessons for Wearable Computing
Authors: Maribeth Gandy, David Ross, Thad E. Starner
Venue: IEEE Pervasive Computing (2003)

The concept of universal design attempts to create products that are as usable as possible by as many people as possible, regardless of age, ability, or situation. These designs more accessible to people with disabilities and more usable and functional for all users. The practice of universal design has resulted in many products originally intended for the disabled population that benefit everyone. Current efforts are underway to create enabling technology for wearable computers.
Photonic Reservoir Computing with Coupled Semiconductor Optical Amplifiers
Authors: Kristof Vandoorne, Wouter Dierckx, Benjamin Schrauwen, David Verstraeten, Peter Bienstman, Roel Baets, Jan Campenhout
Venue: Proceedings of the 1st international workshop on Optical SuperComputing (2008)

We propose photonic reservoir computing as a new approach to optical signal processing and it can be used to handle for example large scale pattern recognition. Reservoir computing is a new learning method from the field of machine learning. This has already led to impressive results in software but integrated photonics with its large bandwidth and fast nonlinear effects would be a high-performance hardware platform. Therefore we developed a simulation model which employs a network of coupled Semiconductor Optical Amplifiers (SOA) as a reservoir. We show that this kind of photonic reservoir performs even better than classical reservoirs on a benchmark classification task.
Service Robot System Using Personal Attribute and Acquisition Preference Attribute with Networked Robots
Authors: Kota Nakamura, Yoshiharu Yoshida, Toru Yamaguchi, Eri-Shimokawara-Sato
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In this research, the authors aimed to implement human-centered system, which understands user and provides a service which suits user. This paper consists of two systems. First, the authors implement service robot system, which provides information by employing user's personal attribute. "Personal attribute" consists of "Preference attribute" and "Body attribute" The system has networked robots share personal attribute information and provides useful information for user. Second, the authors focus on a method for getting user's preference attribute. The authors provide a method for getting user's preference attribute from user's buying history and watching TV history by SOM algorithm. Then, the authors implement service robot systems in a store and room by using the method. In a store and room, the system gets user's preference attribute and provides a service. Finally authors summarized our service robot systems.
Legal, Political and Methodological Issues in Confidentiality in the European Statistical System
Authors: Jean-Marc Museux, Martine Peeters, Maria João Santos
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

The paper discusses the challenges linked to the need of the research community to have access to microdata files for scientific purposes. These needs have to be adequately balanced with the legal requirement of preserving the confidentiality of respondents. The paper presents the policies and instruments available at the European Union to progress in the supply of data to the research community, while respecting the legal requirements. More specifically, the paper explains the current process dealing with research projects and the work of the European Statistical System Network (ESSnet) project for statistical disclosure control. Finally the paper describes future trends that are currently investigated in the European Union, and more specifically the development of remote access facilities, the enhancement of disclosure control tools and the convergence towards common policies in Member States.
An Adaptable Multichannel Architecture for Cortical Stimulation
Authors: J. M. Ferrández, E. Liaño, M. P. Bonomini, E. Fernández
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

An architecture for a cortical stimulator with visual neuroprosthetic purposes is presented. This device uses a 3D penetrating multielectrode array, which will be implanted in V1, offering different signal amplitude sets with the programable current source module. This electrode array has been proved for injecting current (charge) in a safety, secure and precise way during animal acute experimentation. The dynamic characteristic of the stimulator provide the possibility to adapt the current level to the different electrodes and tissue impedances. The architectureis based on a microprocessor circuit with programmable waveforms with a transistor based current injection stage. With the proposed system, a wide stimuli set can be used for obtaining the optimal parameters to use in a visual neuroprosthesis using as input a retinomorphic system. The histological results validate the stimulation and implantation procedures.