ppxscal/embedding_network huggingface dataset:
Differential Impact of the FMR-1 Full Mutation on Memory and Attention Functioning: A Neuropsychological Perspective
Authors: Kim M. Cornish, Fehmidah Munir, Gareth Cross
Venue: Journal of Cognitive Neuroscience (2001)

Memory and attention processing were examined in a group of 15 adult Fragile-X syndrome (FXS) males with Fragile-X mental retardation 1 (FMR-1) full mutation and compared to two control groups: a learning disabled (LD) control and a normal functioning control. Performance was assessed across a wide range of tasks including working memory, recognition memory, selective attention, sustained attention, and attentional switching. All three groups performed at a comparable level on recognition memory tasks, and the Fragile-X males and LD control group performed worse than the control group on tasks of working memory and sustained attention. On a task of executive function, the Fragile-X males demonstrated a significant deficit in comparison to the LD control group and the normal control group, but performed better than the LD control group and at a comparable level to the control group on tasks of selective attention. Molecular analyses of the lymphocyte DNA provided little evidence for a correlation between expansion size and performance on tasks of memory and attention. The findings from the present study are discussed in the context of functional neuroimaging and brain-behavior-molecular correlates.
Interference with Performance of a Response Selection Task that has no Working Memory Component: An rTMS Comparison of the Dorsolateral Prefrontal and Medial Frontal Cortex
Authors: K. A. Hadland, M. F. S. Rushworth, R. E. Passingham, M. Jahanshahi, J. C. Rothwell
Venue: Journal of Cognitive Neuroscience (2001)

It has been suggested that the dorsolateral prefrontal cortex (DLPFC) is involved in free selection (FS), the process by which subjects themselves decide what action to perform. Evidence for this proposal has been provided by imaging studies showing activation of the DLPFC when subjects randomly generate responses. However, these response selection tasks have a hidden working memory element and it has been widely reported that the DLPFC is activated when subjects perform tasks which involve working memory. The primary aim of this experiment was to establish if the DLPFC is genuinely involved in response selection. We used repetitive transcranial magnetic stimulation (rTMS) to investigate whether temporary interference of the DLPFC could disrupt performance of a response selection task that had no working memory component. Subjects performed tasks in which they made bimanual sequences of eight nonrepeating finger movements. In the FS task, subjects chose their movements at random while a computer monitor displayed these moves. This visual feedback obviated the need for subjects to maintain their previous moves "on-line." No selection was required for the two control tasks as responses were cued by the visual display. The attentional demands of the control tasks varied. In the high load (HL) version, subjects had to maintain their attention throughout the sequence, but this requirement was absent in the low load (LL) task. rTMS over the DLPFC slowed response times on the FS task and at the end of the sequence on the HL task, but had no effect on the LL task. rTMS over the medial frontal cortex (MFC) slowed response times on the FS task but had no effect on the HL task. This suggests that a response selection task without a working memory load will depend on the DLPFC and the MFC. The difference appears to be that the DLPFC is important when selecting between competing responses or when concentrating if there is a high attentional demand, but that the MFC is only important during the response selection task.
Domain-Specific Knowledge Systems in the Brain: The Animate-Inanimate Distinction
Authors: Alfonso Caramazza, Jennifer R. Shelton
Venue: Journal of Cognitive Neuroscience (1998)

We claim that the animate and inanimate conceptual categories represent evolutionarily adapted domain-specific knowledge systems that are subserved by distinct neural mechanisms, thereby allowing for their selective impairment in conditions of brain damage. On this view, (some of) the category-specific deficits that have recently been reported in the cognitive neuropsychological literature&mdash;for example, the selective damage or sparing of knowledge about animals&mdash;are truly categorical effects. Here, we articulate and defend this thesis against the dominant, reductionist theory of category-specific deficits, which holds that the categorical nature of the deficits is the result of selective damage to noncategorically organized visual or functional semantic subsystems. On the latter view, the sensory/functional dimension provides the fundamental organizing principle of the semantic system. Since, according to the latter theory, sensory and functional properties are differentially important in determining the meaning of the members of different semantic categories, selective damage to the visual or the functional semantic subsystem will result in a categorylike deficit. A review of the literature and the results of a new case of category-specific deficit will show that the domainspecific knowledge framework provides a better account of category-specific deficits than the sensory/functional dichotomy theory.
Practical 3D animation of multiply articulated construction equipment
Authors: Vineet R. Kamat, Julio C. Martinez
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper presents research that led to the design and implementation of practical 3D animation methods to visualize multiply-articulated construction equipment in 3D animations of discrete-event construction process models. Using principles of forward and inverse kinematics, we designed and implemented generic pieces of multiply-articulated virtual construction equipment that accept task-level instructions from external software processes. Discrete event simulation models can configure and instantiate specific pieces of such equipment and instruct them to perform common construction tasks using simple, parametric statements of text. Once instructed to perform specific tasks (e.g. Load dirt), these "smart" pieces of equipment (e.g. Backhoes) automatically decipher the sequence and amplitudes of the elemental motions their components (e.g. Boom) must undergo to accomplish those tasks. The animation methods are implemented in a software tool called KineMach that integrates as an add-on with the VITASCOPE visualization system.
Remote Sensing Images Classification/Data Fusion Using Distance Weighted Multiple Classifiers Systems
Authors: Yu-Chang Tzeng
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

For a multiple classifiers system, a weighting policy is applied to fuse knowledge acquired by classifiers to arrive at an overall decision that is supposedly superior to that attainable by any one of them acting alone. The distance measured between the classifier output and its desired output can be used as a classifier performance indicator. By adopting this performance indicator, the rms and average distance weighted multiple classifiers systems are proposed in this paper. The classification performances of utilizing various multiple classifiers systems to the application of remote sensing image classification are demonstrated and compared. Experimental results show that the classification accuracy is considerably improved by making use of the multiple classifiers system. In addition, the multiple classifiers systems of using distance weighted algorithms are superior to those of using the conventional Bagging and Boosting algorithms. Moreover, average distance weighted multiple classifiers system outperform rms distance weighted multiple classifiers system slightly.
The evolution of FreeBSD and linux
Authors: Clemente Izurieta, James Bieman
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Is the nature of Open Source Software (OSS) evolution fundamentally different from that of the traditional and commercially available software systems? Lehman and others conducted a series of empirical studies that found that traditional systems grow at a linear or sub-linear rate. A prior case study of the Linux OSS system suggests that OSS may evolve in a unique manner. Godfrey and Tu found that some aspects of Linux are growing at a super-linear rate rather than a sub-linear rate. Additional studies are necessary before drawing conclusions. Thus, we examine the evolution of FreeBSD and re-analyze the evolution of Linux, and find evidence that the growth of both systems has a linear upper bound, and thus appear to grow at similar rates to that of commercial systems. These results do not support the hypothesis that OSS systems grow at rates that exceed that of traditional systems.
Optimal Design of Lossless Passive Snubber for DC/DC Converters
Authors: C. K. Huang, C. T. Chen, H. H. Nien, S. K. Changchien, H. W. Shieh
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

This paper presents an optimal design of lossless passive snubber for DC/DC converters, which offers an efficient and best design method. The proposed method can not only reduce the spike voltage Vdsp of a power switch in the circuit, but also raise the conversion efficiency of the converter. In this paper, we have used Taguchi method to create the optimal design of LC lossless snubber. It can overcome the chaotic drawback of trial-and-error method, the bias of one-factor-at-a-time experiments, and the disadvantage of too many trials for full-factorial experiments. In Taguchi method, the voltage Vds of power switch and source side current Iin are the quality characteristics of the circuit, and the snubber inductor Lc, snubber capacitor CL, transformer leakage inductor Le, and switching frequency - are control factors which influence the circuit quality characteristics. According to the control factors and levels, this paper used an orthogonal array L9(34) to implement experiments, and made a factor response table and graph. Eventually, the optimal values of the control factors Lc , CL , Le and - were decided and then increased ratio of S/N to 16.8%. The simulation results demonstrated that the proposed method applying to optimal design of LC lossless snubber circuit was feasible and efficient.
Individual Knowledge Generation for Individual User Environments by Relating User Network Ontology to Local Protocols
Authors: Kenichi Nishikawa, Nobuhide Nishiyama, Fumihiko Ito, Tetsuya Yamamura
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The diversity and sophistication of terminals and switch devices that are connected to user networks (home networks and office networks) makes it difficult for users who have no technical knowledge to operate user networks flexibly. The purpose of our research is to alleviate the difficulty of user network operation by end users. To achieve this, we believe that a knowledge base is the key. By using a knowledge base that represents each user environment well, users will not need to know the user environment in detail in order to operate the user network. Individual knowledge is a part of our proposed knowledge base and plays the important role of representing the current user environment correctly. This paper describes a method for generating individual knowledge that will support user network operation by employing user network ontology with local protocols. We have verified that the instance generation method using SNMP and UPnP works well partly in our testing environment.
Adaptive Labeling for Interactive Mobile Information Systems
Authors: G. Fuchs, M. Luboschik, K. Hartmann, K. Ali, Th. Strothotte, H. Schumann
Venue: Proceedings of the conference on Information Visualization (2006)

Textual annotations are important elements in all but the most simple visual interfaces. In order to integrate textual annotations smoothly into the dynamic graphical content of interactive information systems, fast yet high-quality label layout algorithms are required. With the ongoing pervasion of mobile applications these requirements are shifted from workstations to comparatively low-performance mobile devices. Fortunately, ubiquitous network access is also on the advance, so that mobile applications can employ remote layout services on external workstations. This paper presents two novel label layout algorithms for relevancedriven dynamic visualizations in interactive information systems. They are employed to generate adaptive visualizations in a mobile maintenance support scenario.
On the path to efficient XML queries
Authors: Andrey Balmin, Kevin S. Beyer, Fatma Özcan, Matthias Nicola
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

XQuery and SQL/XML are powerful new languages for querying XML data. However, they contain a number of stumbling blocks that users need to be aware of to get the expected results and performance. For example, certain language features make it hard if not impossible to exploit XML indexes.The major database vendors provide XQuery and SQL/XML support in their current or upcoming product releases. In this paper, we identify common pitfalls gleaned from the experiences of early adopters of this functionality. We illustrate these pitfalls through concrete examples, explain the unexpected query behavior, and show alternative formulations of the queries that behave and perform as anticipated. As results we provide guidelines for XQuery and SQL/XML users, feedback on the language standards, and food for thought for emerging languages and APIs.
Personal Learning Environments
Authors: Mark van Harmelen
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Personal Learning Environments (PLEs) are attracting increasing interest in the e-learning domain. PLEs may be characterised in a multidimensional space. Examples of PLEs are discussed.
A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
Authors: Joseph Y. Halpern, Aleta Ricciardi
Venue: Distributed Computing (2005)

It is shown that, in a precise sense, if there is no bound on the number of faulty processes in a system with unreliable but fair communication, Uniform Distributed Coordination (UDC) can be attained if and only if a system has perfect failure detectors. This result is generalized to the case where there is a bound t on the number of faulty processes. It is shown that a certain type of generalized failure detector is necessary and sufficient for achieving UDC in a context with at most t faulty processes. Reasoning about processes' knowledge as to which other processes are faulty plays a key role in the analysis.
The use of artificial neural networks in decision support in cancer: A systematic review
Authors: Paulo J. Lisboa, Azzam F. G. Taktak
Venue: Neural Networks (2006)

Artificial neural networks have featured in a wide range of medical journals, often with promising results. This paper reports on a systematic review that was conducted to assess the benefit of artificial neural networks (ANNs) as decision making tools in the field of cancer. The number of clinical trials (CTs) and randomised controlled trials (RCTs) involving the use of ANNs in diagnosis and prognosis increased from 1 to 38 in the last decade. However, out of 396 studies involving the use of ANNs in cancer, only 27 were either CTs or RCTs. Out of these trials, 21 showed an increase in benefit to healthcare provision and 6 did not. None of these studies however showed a decrease in benefit. This paper reviews the clinical fields where neural network methods figure most prominently, the main algorithms featured, methodologies for model selection and the need for rigorous evaluation of results.
Texture overlay onto deformable surface for virtual clothing
Authors: Jun Ehara, Hideo Saito
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In this article, we describe a method for overlaying arbitrary texture image onto surface of T-shirt worn by a user. In this method, the texture image is previously divided into a number of patches. On the T-shirt, markers are printed at the positions corresponding to the vertices of the patches. The markers on the surface of the T-shirt are tracked in the motion image taken by a camera. The texture image is warped according to the tracked positions of the markers, which is overlaid onto the captured image. This article presents experimental results with the pilot system of virtual clothing implemented based on the proposed method.
A descriptive characterisation of linear languages
Authors: Tore Langholm
Venue: Journal of Logic, Language and Information (2006)

Lautemann et al. (1995) gave a descriptive characterisation of the class of context-free languages, showing that a language is context-free iff it is definable as the set of words satisfying some sentence of a particular logic (fragment) over words. The present notes discuss how to specialise this result to the class of linear languages. Somewhat surprisingly, what would seem the most straightforward specialisation actually fails, due to the fact that linear grammars fail to admit a Greibach normal form. We identify an alternative specialisation, based on an alternative characterisation of context-free languages, also noted by Lautemann et al. (1995).
Cut and Pay
Authors: Marcelo Finger, Dov Gabbay
Venue: Journal of Logic, Language and Information (2006)

In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an approximation process for full propositional classical logic when the control over the use of cut is progressively weakened. A sound and complete semantics is given for each component of each of the three families of approximated logics. One of these families is shown to possess the uniform substitution property, a new result for approximated reasoning. A tableau based decision procedure is presented for each element of the approximation families and the complexity of each decision procedure is studied. We show that there are families in which every component logic can be decided polynomially.
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
Authors: Haining Fan, M. Anwar Hasan
Venue: IEEE Transactions on Computers (2007)

Based on Toeplitz matrix-vector products and coordinate transformation techniques, we present a new scheme for subquadratic space complexity parallel multiplication in GF(2^{n}) using the shifted polynomial basis. Both the space complexity and the asymptotic gate delay of the proposed multiplier are better than those of the best existing subquadratic space complexity parallel multipliers. For example, with n being a power of 2, the space complexity is about 8 percent better, while the asymptotic gate delay is about 33 percent better, respectively. Another advantage of the proposed matrix-vector product approach is that it can also be used to design subquadratic space complexity polynomial, dual, weakly dual, and triangular basis parallel multipliers. To the best of our knowledge, this is the first time that subquadratic space complexity parallel multipliers are proposed for dual, weakly dual, and triangular bases. A recursive design algorithm is also proposed for efficient construction of the proposed subquadratic space complexity multipliers. This design algorithm can be modified for the construction of most of the subquadratic space complexity multipliers previously reported in the literature.
Predicting the effect of process time variability on annual production in a cell culture manufacturing facility
Authors: Stephen Hall
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Microsoft Excel and Visual Basic for Applications were used to model process time variability in a cell culture facility. A deterministic simulation had already established that the plant had sufficient buffer, media, water and CIP (clean-in-place) capacity. The Excel model was built to answer the question, "How many batches per year can be expected, as a minimum, knowing that random failures occur and that processing time variability results in a failed batch if a queue exceeds a set value?" Aspects to be presented: a) simplifying assumptions that drilled into the question of interest, b) use of VBA to create the multi-batch per year simulation, c) drawing timelines on the screen that speak to the customer without requiring simulation jargon, d) design of modeling experiments that simulated 250 years of operation with a variety of assumptions, and e) use of statistical functions to obtain confidence intervals and probability data. 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
Large-scale vulnerability analysis
Authors: Stefan Frei, Martin May, Ulrich Fiedler, Bernhard Plattner
Venue: Proceedings of the 2006 SIGCOMM workshop on Large-scale attack defense (2006)

The security level of networks and systems is determined by the software vulnerabilities of its elements. Defending against large scale attacks requires a quantitative understanding of the vulnerability lifecycle. Specifically, one has to understand how exploitation and remediation of vulnerabilities, as well as the distribution of information thereof is handled by industry.In this paper, we examine how vulnerabilities are handled in large-scale, analyzing more than 80,000 security advisories published since 1995. Based on this information, we quantify the performance of the security industry as a whole. We discover trends and discuss their implications. We quantify the gap between exploit and patch availability and provide an analytical representation of our data which lays the foundation for further analysis and risk management.
Promoter Recognition using dinucleotide Features: A Case Study for E.Coli
Authors: T. Sobha Rani, S. Durga Bhavani, Raju S. Bapi
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Promoter recognition is based upon two complementary methods, a motif based method and a global signal based method. The literature is abound with motif search methods. But as the motifs of a promoter are consensus patterns of very short length and the chance of finding putative promoters is high, global feature methods gain importance. In this paper a simple global feature extraction method is proposed for the recognition of sigma-70 promoters in E.coli. It is shown that a simple feed forward neural network classifier achieves a precision of nearly 80% in contrast to the high end classifiers and heavy features proposed in the literature achieving a similar performance. Additionally, a scheme is proposed for locating promoter regions in a given DNA segment.