ppxscal/embedding_network huggingface dataset:
Between information and communication: middle spaces in computer media for learning
Authors: Christopher M. Hoadley, Noel Enyedy
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

In this paper, we identify two categories of media that are common in computer-supported collaborative learning and software in general: communication media, and information media. These two types of media map easily on to two types of social activities in which learning is grounded: dialogue and monologue. Drawing on literature in learning theory, we suggest the need for interfaces that help students transition from dialogue to monologue and back again. This "middle space" between communication and information interfaces is illustrated with several examples from CSCL. We advocate filling in this middle space with software and activities that transcend some of the traditional design tradeoffs associated with information and communication interfaces.
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Authors: Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, Laurent Falquet
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a single computer often runs for many hours or even days. High performance infrastructures such as clusters or computational Grids provide the techniques to speed up the process by distributing the workload to remote nodes, running parts of the work load in parallel. Biologists often do not have access to such hardware systems. Therefore, we propose a new system using a modern Grid approach to optimise an embarrassingly parallel problem. We achieve speed ups by at least two orders of magnitude given that we can use a powerful, world-wide distributed Grid infrastructure. For large-scale problems our method can outperform algorithms designed for mid-size clusters even considering additional latencies imposed by Grid infrastructures.
A Review of Negotiation Techniques in Component Based Software Engineering
Authors: John Hutchinson, Gerald Kotonya
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Building software is an intellectually intensive activity. The processes and tools that have been developed to support custom software development, to ensure that the activity is carried out successfully, do not necessarily address some of the key challenges of creating software systems out of COTS components. Primary among these challenges are component selection and integration, where competing requirements present the system developer with complex problems unlike those found in custom development. A number of approaches have been proposed for tackling these problems, in many cases borrowing from other disciplines where similar problems have led to the development of sophisticated decision making strategies. We present a review of various proposed approaches in an attempt to identifL the relative strengths, and shortcomings, of each before attempting to identlfi the issues that must be addressed to support component selection.
Combining Crypto with Biometrics Effectively
Authors: Feng Hao, Ross Anderson, John Daugman
Venue: IEEE Transactions on Computers (2006)

We propose the first practical and secure way to integrate the iris biometric into cryptographic applications. A repeatable binary string, which we call a biometric key, is generated reliably from genuine iris codes. A well-known difficulty has been how to cope with the 10 to 20 percent of error bits within an iris code and derive an error-free key. To solve this problem, we carefully studied the error patterns within iris codes and devised a two-layer error correction technique that combines Hadamard and Reed-Solomon codes. The key is generated from a subject's iris image with the aid of auxiliary error-correction data, which do not reveal the key and can be saved in a tamper-resistant token, such as a smart card. The reproduction of the key depends on two factors: the iris biometric and the token. The attacker has to procure both of them to compromise the key. We evaluated our technique using iris samples from 70 different eyes, with 10 samples from each eye. We found that an error-free key can be reproduced reliably from genuine iris codes with a 99.5 percent success rate. We can generate up to 140 bits of biometric key, more than enough for 128-bit AES. The extraction of a repeatable binary string from biometrics opens new possible applications, where a strong binding is required between a person and cryptographic operations. For example, it is possible to identify individuals without maintaining a central database of biometric templates, to which privacy objections might be raised.
Automated MRI-Based Quantification of the Cerebral Atrophy Providing Diagnostic Information on Mild Cognitive Impairment and Alzheimer's Disease
Authors: Klaus Fritzsche, Aldo von Wangenheim, Rudiger Dillmann, Roland Unterhinninghofen
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Alzheimer's disease (AD) is a major public health challenge as the median age of the industrialized world's population is increasing gradually. No cure for this disease has yet been found and the development of new treatments has become a topic of major research interest. This paper aims to propose a sequence of fully automated MRI-based image analysis steps to measure the development stage of atrophy in the brain. The results have been validated on a mixed group of 68 subjects by distinguishing between AD patients, MCIs and health controls using linear classifiers and ANNs. The best classifier identified unseen AD patients correctly in 80% of the cases and control subjects in 85%. Recognizing more than 8 out of 10 MCI subjects, the method also yields an early indication of AD. This simple yet powerful analysis can compete with othermore time-consuming and semi-automaticmethodologies. It could abet an AD diagnosis and provide a tool for measuring the success of therapies.
On Preprocessing of SELDI-MS Data and its Evaluation
Authors: Julien Prados, Alexandros Kalousis, Melanie Hilario
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Mass spectrometry is becoming an important tool in proteomics. Mass spectral data are characterized by very high dimensionality and a high level of redundancy. Both issues are quite challenging when one wants to perform knowledge discovery and push existing tools to their limits. We tackle both via a preprocessing pipeline that drastically reduces dimensionality and redundancy of the initial representation in order to focus on biologically relevant information. Essentially preprocessing performs feature extraction in a manner that reflects domain knowledge. We propose a framework for the evaluation of the given pipeline and in fact of any mass spectrometry preprocessing pipeline which is based on the level of conservation of discriminatory information. The discriminatory information content of a given representation is objectively measured by the classification performance of a number of classification algorithms evaluated on the given representation. This approach also allows us to compare a number of different preprocessing possibilities, namely using peak intensities vs peak areas to represent peaks and how non observed peaks should be treated, and demonstrate which is the most informative one.
FPU Recurrence in the KdV-Type Equations
Authors: Yung-Ming Chang, Juan-Ming Yuan, Chin-Chieh Chiang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

This paper is concerned with the study of recurrence phenomena in nonlinear dispersive wave equations using numerical simulation. The generalized KdV-equation, u_t + u^pu_x + \in u_x_x_= 0, is investigated. The numerical evidence presented here shows that even non-integrable equations exhibit recurrence phenomena. We also determine an approximate relationship between recurrence time and \in.
An integrated, distributed traffic control strategy for the future internet
Authors: Hao Che, Wenjing Su, Constantino Lagoa, Ke Xu, Chunyu Liu, Yong Cui
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Due to the lack of a general theoretical foundation, today's distributed traffic control mechanisms developed at the networking layer, transport layer, and overlay are largely disintegrated. As a result, traffic control protocols developed at different layers may achieve conflicting design objectives and interact with one another in an unpredictable fashion. In this paper, we propose a novel strategy to tackle this issue. First, we propose a theoretical foundation for distributed traffic control. On the basis of this foundation, we then propose an integrated, multilayer, multi-domain traffic control structure. This structure makes it possible to develop traffic control protocols at different layers, possessing the following nice features: (1) they achieve non-conflicting design objectives; (2) they enable rich service quality features, including Quality-of-Service (QoS), Traffic Engineering (TE), and Fast Failure Recovery (FFR); (3) they lead to highly scalable, globally stable and optimal control; (4) they can deal with network diversities and tussles among administrative domains; (5) they allow effective control of dynamically generated overlay networks. The proposed strategy only makes two assumptions about the Internet architecture, i.e., the ability to support multiple domains and multi-path forwarding. As a result, the proposed strategy can be applied to the existing or any future Internet architectures for which these two assumptions hold.
Debugging schema mappings with routes
Authors: Laura Chiticariu, Wang-Chiew Tan
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

A schema mapping is a high-level declarative specification of the relationship between two schemas; it specifies how data structured under one schema, called the source schema, is to be converted into data structured under a possibly different schema, called the target schema. Schema mappings are fundamental components for both data exchange and data integration. To date, a language for specifying (or programming) schema mappings exists. However, developmental support for programming schema mappings is still lacking. In particular, a tool for debugging schema mappings has not yet been developed. In this paper, we propose to build a debugger for understanding and exploring schema mappings. We present a primary feature of our debugger, called routes, that describes the relationship between source and target data with the schema mapping. We present two algorithms for computing all routes or one route for selected target data. Both algorithms execute in polynomial time in the size of the input. In computing all routes, our algorithm produces a concise representation that factors common steps in the routes. Furthermore, every minimal route for the selected data can, essentially, be found in this representation. Our second algorithm is able to produce one route fast, if there is one, and alternative routes as needed. We demonstrate the feasibility of our route algorithms through a set of experimental results on both synthetic and real datasets.
Grid-Enabled Bio-Sample Management Application for Data-Intensive Biomarker Analysis
Authors: Erik Lickerman, L. Bry, N. Herring, Y. Pandelidis, Nighat Afsheen, A. Sharif
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Data intensive biomarker analysis using well characterized clinical samples can benefit from grid capabilities for sample annotation. Lack of quality annotated samples remains a critical bottleneck in medical research, particularly when considering samples associated with sentinel events, such as acute myocardial infarction or initial diagnosis of rheumatic diseases. Pathology departments receive process and discard these and other useful samples daily upon completion of clinical testing. The Department of Pathology at Brigham and Women's Hospital has developed a core IT platform to support prospective collection of discarded samples. This platform will serve investigators with IRB-approved protocols and support operations of the bio-banking facility.
Low-complexity tools in AVS part 7
Authors: Feng Yi, Qi-Chao Sun, Jie Dong, Lu Yu
Venue: Journal of Computer Science and Technology (2006)

Audio Video coding Standard (AVS) is established by the AVS Working Group of China. The main goal of AVS part 7 is to provide high compression performance with relatively low complexity for mobility applications. There are 3 main low-complexity tools: deblocking filter, context-based adaptive 2D-VLC and direct intra prediction. These tools are presented and analyzed respectively. Finally, we compare the performance and the decoding speed of AVS part 7 and H.264 baseline profile. The analysis and results indicate that AVS part 7 achieves similar performance with lower cost.
Counterfeiting attack on a lossless authentication watermarking scheme
Authors: Yongdong Wu, Changsheng Xu, Feng Bao
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

This paper describes an effective attack on a lossless authentication watermarking scheme [Fridrich et. al 2001]. Given sufficient number of pairs of stego-images and its cover-images, an attacker can obtain the data (e.g., random walk sequence, lookup table) generated from a secret key. With these data, the attacker can easily forge authentic images. The experiment demonstrates this attack is very efficient to the lossless watermarking scheme. To avoid such attack, we modify the process of lookup table generation so that the table is variable with the content of the cover-image.
Zora: a graphical multi-user environment to share stories about the self
Authors: Marina Umaschi Bers
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Zora is a narrative-based graphical multi-user environment purposefully design to help people understand and affect the ways in which identity and values are actively constructed by both an individual and a community. Zora engages young people in building artifacts as representations of their complex self and creating communities in which values and attitudes are put to the test. It supports 1) creation of a virtual city with its different spaces, objects and interactive characters, 2) communication between the users, and 3) introspection about role models, personal and community values. This paper describes the theoretical framework that conceives identity as dynamically constructed by putting together diverse and conflicting elements and values. Based on this framework, Zora's design principles are presented, as well as preliminary results from a pilot experience in which young people used Zora to learn about identity and values in a hands-on, constructionist way.
Common and Differential Neural Mechanisms Supporting Imitation of Meaningful and Meaningless Actions
Authors: Raffaella I. Rumiati, Peter H. Weiss, Alessia Tessari, Ann Assmus, Karl Zilles, Hans Herzog, Gereon R. Fink
Venue: Journal of Cognitive Neuroscience (2005)

Neuropsychological studies indicate that, after brain damage, the ability to imitate meaningful or meaningless actions can be selectively impaired. However, the neural bases supporting the imitation of these two types of action are still poorly understood. Using PET, we investigated in 10 healthy individuals the neural mechanisms of imitating novel, meaningless actions and familiar, meaningful actions. Data were analyzed using SPM99. During imitation, a significant positive correlation (p < .05, corrected) of regional cerebral blood flow with the amount of meaningful actions was observed in the left inferior temporal gyrus only. In contrast, a significant positive correlation (p < .05, corrected) with the amount of meaningless movements was observed in the right parieto-occipital junction. The direct categorical comparison of imitating meaningful (100%) relative to meaningless (100%) actions showed differential increases in neural activity (p < .001, uncorrected) in the left inferior temporal gyrus, the left parahippocampal gyrus, and the left angular gyrus. The reverse categorical comparison of imitating meaningless (100%) relative to meaningful (100%) actions revealed differential increases in neural activity (p < .001, uncorrected) in the superior parietal cortex bilaterally, in the right parieto-occipital junction, in the right occipital&ndash;temporal junction (MT, V5), and in the left superior temporal gyrus. Increased neural activity common to imitation of meaningless and meaningful actions compared to action observation was observed in a network of areas known to be involved in imitation of actions including the primary sensorimotor cortex, the supplementary motor area, and the ventral premotor cortex. These results are compatible with the two-route model of action imitation which suggests that there are at least two mechanisms involved in imitation of actions: a direct mechanism transforming a novel action into a motor output, and a semantic mechanism, on the basis of stored memories, that allows reproductions of known actions. Our results indicate that, in addition to shared neural processes, the direct and the semantic mechanisms that underlie action imitation also draw upon differential neural mechanisms. The direct mechanism underlying imitation of meaningless actions differentially involves visuospatial transformation processes as evidenced by activation of areas belonging to the dorsal stream. In contrast, imitation of meaningful actions differentially involves semantic processing as evidenced by activation of areas belonging to the ventral stream.
Arc-length preserving curve deformation based on subdivision
Authors: Zhixun Su, Ling Li, Xiaojie Zhou
Venue: Journal of Computational and Applied Mathematics (2006)

An arc-length preserving deformation for curves is presented by combining subdivision and inverse Kinematic. A curve is discreted into polyline first, then the polyline is deformed with its arc-length preserved in the sense of minimizing energy. Subdivision method is applied to obtain a smooth curve (at least C1 continuity) with proper weights selected to keep the length of the resulting curve equal to the original curve. This technique also provides interactive response by progressively refining the solution of the optimization problem.
Episodic Action Memory for Real Objects: An ERP Investigation With Perform, Watch, and Imagine Action Encoding Tasks Versus a Non-Action Encoding Task
Authors: Ava J. Senkfor, Cyma Van Petten, Marta Kutas
Venue: Journal of Cognitive Neuroscience (2002)

Cognitive research shows that people typically remember actions they perform better than those that they only watch or imagine doing, but also at times misremember doing actions they merely imagined or planned to do (source memory errors). Neural research suggests some overlap between brain regions engaged during action production, motor imagery, and action observation. The present study evaluates the similarities/differences in brain activity during the retrieval of various types of action and nonaction memories. Participants study real objects in one of four encoding conditions: performing an action, watching the experimenter perform an action, or imagining an action with an object, or a nonmotoric task of estimating an object's cost. At test, participants view color photos of the objects, and make source memory judgments about the initial encoding episodes. Event-related potentials (ERPs) during test reveal (1) content-specific brain activity depending on the nature of the encoding task, and (2) a hand tag, i.e., sensitivity to the hand with which an object had been manipulated at study. At fronto-central sites, ERPs are similar for the three action-retrieval conditions, which are distinct from those to the cost-encoded objects. At occipital sites ERPs distinguished objects from encoding conditions with visual motion (Perform and Watch) from those without visual motion (Imagine and Cost). Results thus suggest some degree of recapitulation of encoding brain activity during retrieval of memories with qualitatively distinct attributes.
Bipolar Queries and Queries with Preferences (Invited Paper)
Authors: Slawomir Zadrozny, Janusz Kacprzyk
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The concepts of bipolar queries and queries with preferences are studied. Various interpretations of the former, recently defined by Dubois and Prade, are discussed. The latter were defined by Chomicki together with a new relational algebra operator winnow. The fuzzy version of the winnow operator is proposed. It is shown how it may be used to express a selected interpretation of the bipolar queries.
Meta-compilation of language abstractions
Authors: Ian Horswill
Venue:  (2006)

High-level programming languages are currently transformed into efficient low-level code using optimizations that are encoded directly into the compiler. Libraries, which are semantically rich user-level abstractions, are largely ignored by the compiler. Consequently, library writers often provide a complex, low-level interface to which programmers "manually compile" their high-level ideas. If library writers provide a high-level interface, it generally comes at the cost of performance. Ideally, library writers should provide a high-level interface and a means to compile it efficiently. This dissertation demonstrates that a compiler can be dynamically extended to support user-level abstractions. The Sausage meta-compilation system is an extensible source-to-source compiler for a subset of the Scheme programming language. Since the source language lacks nearly all the abstractions found in popular languages, new abstractions are implemented by a library and a compiler extension. In fact, Sausage implements all its general-purpose optimizations for functional languages as compiler extensions. A meta-compiler, therefore, is merely a shell that coordinates the execution of many external extensions to compile a single module. Sausage demonstrates that a compiler designed to be extended can evolve and adapt to new domains without a loss of efficiency.
Towards integrated verification of timed transition models
Authors: Mark Lawford, Vera Pantelic, Hong Zhang
Venue: Fundamenta Informaticae (2005)

This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling Environment (TAME) has been modified to provide a formal model for Time Transition Models (TTMs) in the PVS proof checker. Strong and weak state-event observation equivalences are formalized in PVS for state-event labeled transition systems (SELTS), the underlying semantic model of TTMs. The state-event equivalences form the basis of truth value preserving abstractions for a real-time temporal logic. When appropriate restrictions are placed upon the TTMs, their PVS models can be easily translated into input for the SAL model-checker. A simple real-time control system is specified and verified using these theories. While these preliminary results indicate that the combination of PVS and SAL could provide a useful environment to perform equivalence verification, model-checking and compositional model reduction of real-time systems, the current implementation in the general purpose SAL model-checker lags well behind state of the art real-time model-checkers.