ppxscal/embedding_network huggingface dataset:
''What''&mdash;Then&mdash;''Where'' in Visual Working Memory: An Event-Related fMRI Study
Authors: Bradley R. Postle, Mark D'esposito
Venue: Journal of Cognitive Neuroscience (1999)

Behavioral studies indicate that spatial and object working memory are computed by dissociable subsystems. We investigated the neural bases of this dissociation with a whole-brain fMRI design and analysis technique that permitted direct assessment of delay-period activity, uncontaminated by other components of the trial. The task employed a ''what''-then''where'' design, with an object and a spatial delay period incorporated in each trial; within-trial order of delay conditions was balanced across each scan. Our experiment failed to find evidence, at the single-subject level and at the group level, for anatomical segregation of spatial and object working memory function in the frontal cortex. Delay-period activity in the caudate nucleus revealed a sensitivity to position in the trial in the spatial, but not the object, condition. In posterior regions, spatial delay-period activity was associated with preferential recruitment of extrastriate areas falling within Brodmann's area 19 and, less reliably,the superior parietal lobule. Object-specific delay-period activity was found predominantly in ventral regions of the posterior cortex and demonstrated more topographic variability across subjects than did spatial working memory activity.
A Shortest Learning Path Selection Algorithm in E-learning
Authors: Chengling Zhao, Liyong Wan
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic network. The desired knowledge is provided by the student as a direct request or from search results, mapping the owned knowledge onto the target knowledge. How to select a learning path which costs the least time and effort is critical. In this paper, we described the relationships between different nodes in the graph structure of knowledge units and propose an algorithm to select the shortest learning paths to learn the target knowledge.
Left But Not Right Temporal Involvement in Opaque Idiom Comprehension: A Repetitive Transcranial Magnetic Stimulation Study
Authors: Massimiliano Oliveri, Leonor Romero, Costanza Papagno
Venue: Journal of Cognitive Neuroscience (2004)

It has been suggested that figurative language, which includes idioms, is controlled by the right hemisphere. We tested the right hemisphere hypothesis by using repetitive transcranial magnetic stimulation (rTMS) to transiently disrupt the function of the frontal and temporal areas of the right versus left hemisphere in a group of normal participants involved in a task of opaque idiom versus literal sentence comprehension. Forty opaque, nonambiguous idioms were selected. Fifteen young healthy participants underwent rTMS in two sessions. The experiment was run in five blocks, corresponding to the four stimulated scalp positions ( left frontal and temporal and right frontal and temporal) and a baseline. Each block consisted of 16 trials&mdash;8 trials with idioms and 8 trials with literal sentences. In each trial, the subject was presented with a written sentence, which appeared on the screen for 2000 msec, followed by a pair of pictures for 2500 msec, one of which corresponded to the sentence. The alternative corresponded to the literal meaning for idioms and to a sentence differing in a detail in the case of literal sentences. The subject had to press a button corresponding to the picture matching the string. Reaction times increased following left temporal rTMS, whereas they were unaffected by right hemisphere rTMS, with no difference between idiomatic and literal sentences. Left temporal rTMS also reduced accuracy without differences between the two types of sentences. These data suggest that opaque idiom and literal sentence comprehension depends on the left temporal cortex.
Real-Time Memory Management: Life and Times
Authors: Andrew Borg, Andy Wellings, Christopher Gill, Ron K. Cytron
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

As real-time and embedded systems become increasingly large and complex, the traditional strictly static approach to memory management begins to prove untenable. The challenge is to provide a dynamic memory model that guarantees tight and bounded time and space requirements without overburdening the developer with memory concerns. This paper provides an analysis of memory management approaches in order to characterise the tradeoffs across three semantic domains: space, time and a characterisation of memory usage information such as the lifetime of objects. A unified approach to distinguishing the merits of each memory model highlights the relationship across these three domains, thereby identifying the class of applications that benefit from targeting a particular model. Crucially, an initial investigation of this relationship identifies the direction future research must take in order to address the requirements of the next generation of complex embedded systems. Some initial suggestions are made in this regard and the memory model proposed in the Real-Time Specification for Java is evaluated in this context.
Support for High-Frequency Streaming in CMPs
Authors: Ram Rangan, Neil Vachharajani, Adam Stoler, Guilherme Ottoni, David I. August, George Z. N. Cai
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

As the industry moves toward larger-scale chip multiprocessors, the need to parallelize applications grows. High inter-thread communication delays, exacerbated by over-stressed high-latency memory subsystems and ever-increasing wire delays, require parallelization techniques to create partially or fully independent threads to improve performance. Unfortunately, developers and compilers alike often fail to find sufficient independent work of this kind. Recently proposed pipelined streaming techniques have shown significant promise for both manual and automatic parallelization. These techniques have wide-scale applicability because they embrace inter-thread dependences (albeit acyclic dependences) and tolerate long-latency communication of these dependences. This paper addresses the lack of architectural support for this type of concurrency, which has blocked its adoption and hindered related language and compiler research. We observe that both manual and automatic techniques create high-frequency streaming threads, with communication occurring every 5 to 20 instructions. Even while easily tolerating inter-thread transit delays, high-frequency communication makes thread performance very sensitive to intrathread delays from the repeated execution of the communication operations. Using this observation, we define the design-space and evaluate several mechanisms to find a better trade-off between performance and operating system, hardware, and design costs. From this, we find a light-weight streaming-aware enhancement to conventional memory subsystems that doubles the speed of these codes and is within 2% of the best-performing, but heavy-weight, hardware solution.
How Are Java Software Developers Using the Eclipse IDE?
Authors: Gail C. Murphy, Mik Kersten, Leah Findlater
Venue: IEEE Software (2006)

Eclipse is a leading development environment that provides a rich set of features supporting Java development. However, little data is available about its usage. Usage data from 41 developers using Java and Eclipse shows that they're using advanced features such as refactoring and are extending the environment using third-party tools. However, they rarely use some of the other features, such as bookmarking places in the code. The article also includes briefly describes the authors' Eclipse-based open-source analysis framework. Open-source projects such as Eclipse should be gathering and analyzing more usage data to ensure the tools they're building evolve to meet user communities' needs.
Opportunistic Networks: Challenges in Specializing the P2P Paradigm
Authors: Leszek Lilien, Z. Huma Kamal, Ajay Gupta
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

We introduce the notion of opportunistic networks or oppnets, some of which can be considered a subclass of the peer-to-peer (P2P) networks. Initially, a relatively small seed oppnet is deployed, which grows into a bigger expanded oppnet. Oppnet growth starts with detecting diverse systems existing in its relative vicinity. Systems with best evaluations are invited by an oppnet to become its helpers. The oppnet leverages vast collective capabilities and resources of its helpers, employing them to execute diverse tasks in support of its goals. Though oppnet characteristics make them a natural fit for emergency response applications, we expect that they will prove beneficial in many other application areas. We discuss challenges in the development and use of the oppnet technology. Oppnets that use P2P interactions can be viewed as a specialization of the more general paradigm of P2P networks. To the best of our knowledge, we were the first to define and are now the first to investigate oppnets.
A Double Dissociation in the Affective Modulation of Startle in Humans: Effects of Unilateral Temporal Lobectomy
Authors: E. Sumie Funayama, Christian Grillon, Michael Davis, Elizabeth A. Phelps
Venue: Journal of Cognitive Neuroscience (2001)

In the present study we report a double dissociation between right and left medial temporal lobe damage in the modulation of fear responses to different types of stimuli. We found that right unilateral temporal lobectomy (RTL) patients, in contrast to control subjects and left temporal lobectomy (LTL) patients, failed to show potentiated startle while viewing negative pictures. However, the opposite pattern of impairment was observed during a stimulus that patients had been told signaled the possibility of shock. Control subjects and RTL patients showed potentiated startle while LTL patients failed to show potentiated startle. We hypothesize that the right medial temporal lobe modulates fear responses while viewing emotional pictures, which involves exposure to (emotional) visual information and is consistent with the emotional processing traditionally ascribed to the right hemisphere. In contrast, the left medial temporal lobe modulates fear responses when those responses are the result of a linguistic/cognitive representation acquired through language, which, like other verbally mediated material, generally involves the left hemisphere. Additional evidence from case studies suggests that, within the medial temporal lobe, the amygdala is responsible for this modulation.
Low-latency wireless video over 802.11 networks using path diversity
Authors: A. Miu, J. G. Apostolopoulos, Wai-tian Tan, M. Trott
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Wireless local area networks, such as 802.11b, are becoming wide-spread as they provide simple wireless connectivity and data delivery. This paper examines low-latency (conversational) video communication over 802.11b networks. The challenges to enable low-latency video include overcoming the highly variable delays, losses, and bandwidth of 802.11b wireless networks. To overcome these challenges we (1) employ the H.264/MPEG-4 advanced video coding (AVC) standard for high video compression efficiency and good resilience to losses, (2) use low-latency best-effort transport mechanisms, and (3) exploit the potential path diversity between each mobile client and multiple access points in the infrastructure, where we use multiple paths simultaneously or switch between multiple paths (site selection) as a function of channel characteristics. Our results indicate that the proposed system can provide significant benefits over conventional single access point (single path) systems.
A consistent, numerically efficient Bayesian framework for combining the selection, detection and estimation tasks in model-based signal processing
Authors: A. Quinn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Bayesian marginalization is shown to measure the complexity of a model, objectively quantifying Ockham's Razor via the Ockham parameter inference (OPI). This is not possible in likelihood-based inference. The OPI rejects any hypothesis which is poorly supported by the data. This leads to the Censored Marginal A Posteriori (CMaAP) estimation policy which returns confident estimates well below the maximum likelihood (ML) thresholds. CMaAP estimation performs an alternative-free hypothesis test, thereby subsuming detection. In a multi-hypothesis environment, the procedure combines selection and estimation into a consistent framework which avoids the numerical approximations of the Bayesian evidence approach and the MDL (minimum description length) criterion. It is therefore robust in stressful regimes and affords major computational savings. 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
Handling variations and uncertainties
Authors: Tim Cheng
Venue: IEEE Design Test (2006)

With increased technology scaling, high variability and low reliability will likely be the main challenges for chip design and testing. This issue discusses some of the key issues for handling increasing variations and uncertainties. Also, D&T's plans for 2007 special themes have been finalized.
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
Authors: Matthias Scheutz, Paul Schermerhorn
Venue: Journal of Parallel and Distributed Computing (2006)

We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs definable in the framework and a more specific variant P-ABMS for "spatial ABMs" targeted at SWARM and ANT-based models, where the additional spatial information can be utilized to obtain performance improvements. Both algorithms can automatically distribute ABMs over multiple CPUs and dynamically adjust the degree of parallelization based on available computational resources throughout the simulation runs. We also describe a first implementation of P-ABMS in our SWAGES environment and report both results from simulations with simple SWARM agents that provide a lower bound for the performance gains achievable by the algorithm and results from simulations with more complex deliberative agents, which need to synchronize their state after each update cycle. Even in the latter case, we show that in some conditions the algorithm is able to achieve close-to-maximum performance gains.
An Inquiry Tool for Stakeholder Concerns of Architectural Viewpoints: a Case Study at a Large Financial Service Provider
Authors: Henk Koning, Rik Bos, Sjaak Brinkkemper
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

IEEE Std 1471 defines architectural views as addressing related stakeholder concerns, but gives no guidance as to what architectural concerns are or how they should be found. In this paper we present an inquiry tool to solicit IEEE Std 1471 stakeholder concerns. The tool is a list of interview questions which help a stakeholder to express his concerns. The tool helps the enterprise architect to be aware of which architectural concerns are relevant in a given situation. We demonstrate the use of this tool in a case study at a Dutch bank, where an architecture documentation practice is evaluated and three stakeholder concerns are uncovered that are not yet addressed.
EbXML-Based Application Integration in Service-Oriented Business
Authors: Quan Wen
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

The XML-based e-Business specifications are the main stream in B2B (Business to Business) field, and the ebXML (electronic business XML) specification is the most promising industry-defined XML schema. This paper addresses service-oriented business integration based on ebXML. It introduces the evolvement of ebXML and presents how ebXML technologies enable enterprises to collaborate at the business process level. In particular, it discusses data interchange from EDI (Electronic Data Interchange) to ebXML in business processes. Some business requirements are also discussed including service-oriented computing, business process modeling, etc. Specifically, the business process modeling is described by modeling flow and message sequence. The recent implementations and the development trends are shown by two cases of official projects on the basis of ebXML.
Evidence combination in hidden markov models for gene prediction
Authors: Bronislava Brejova
Venue:  (2006)

This thesis introduces new techniques for finding genes in genomic sequences. Genes are regions of a genome encoding proteins of an organism. Identification of genes in a genome is an important step in the annotation process after a new genome is sequenced. The prediction accuracy of gene finding can be greatly improved by using experimental evidence. This evidence includes homologies between the genome and databases of known proteins, or evolutionary conservation of genomic sequence in different species. We propose a flexible framework to incorporate several different sources of such evidence into a gene finder based on a hidden Markov model. Various sources of evidence are expressed as partial probabilistic statements about the annotation of positions in the sequence, and these are combined with the hidden Markov model to obtain the final gene prediction. The opportunity to use partial statements allows us to handle missing information transparently and to cope with the heterogeneous character of individual sources of evidence. On the other hand, this feature makes the combination step more difficult. We present a new method for combining partial probabilistic statements and prove that it is an extension of existing methods for combining complete probability statements. We evaluate the performance of our system and its individual components on data from the human and fruit fly genomes. The use of sequence evolutionary conservation as a source of evidence in gene finding requires efficient and sensitive tools for finding similar regions in very long sequences. We present a method for improving the sensitivity of existing tools for this task by careful modeling of sequence properties. In particular, we build a hidden Markov model representing a typical homology between two protein coding regions and then use this model to optimize a component of a heuristic algorithm called a spaced seed. The seeds that we discover significantly improve the accuracy and running time of similarity search in protein coding regions; and are directly applicable to our gene finder.
Programming with heterogeneous structures: manipulating XML data using bondi
Authors: F. Y. Huang, C. B. Jay, D. B. Skillicorn
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

Manipulating semistructured data, such as XML, does not fit well within conventional programming languages. A typical manipulation requires finding all occurrences of a structure matching a structured search pattern, whose context may be different in different places, and both aspects cause difficulty. If a special-purpose query language is used to manipulate XML, an interface to a more general programming environment is required, and this interface typically creates runtime overhead for type conversion. However, adding XML manipulation to a general-purpose programming language has proven difficult because of problems associated with expressiveness and typing.We show an alternative approach that handles many kinds of patterns within an existing strongly-typed general-purpose programming language called bondi. The key ideas are to express complex search patterns as structures of simple patterns, pass these complex patterns as parameters to generic data-processing functions and traverse heterogeneous data structures by a generalized form of pattern matching. These ideas are made possible by the language's support for pattern calculus, whose typing on structures and patterns enables path and pattern polymorphism. With this approach, adding a new kind of pattern is just a matter of programming, not language design.
Browsing the SemanticWeb
Authors: Ora Lassila
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Presenting RDF graphs to the end user as hypertext enables interactive exploration and inquiry of "semantic" data. In this paper we present a tool that allows users to "see" their RDF data, without having to decipher syntactic representations that are typically not human-friendly. The tool is part of a broader architecture designed for viewing many different types of data in Semantic Web formalisms, for experimenting with the caching of dynamically changing data, and for exploring the possible ad hoc integration of data from multiple sources. Additionally, this tool enables browsing of semantic data on a mobile device, by adapting the hypertext generation to better suit small screens.
On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols
Authors: Jose Mocito, Ana Respicio, Luis Rodrigues
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Total order broadcast protocols have been successfully applied as the basis for the construction of many fault- tolerant distributed systems. Unfortunately, the implemen- tation of such a primitive can be expensive both in terms of communication steps and of number of messages ex- changed. To alleviate this problem, optimistic total order protocols have been proposed. This paper addresses the problem of offering optimistic total order in geographically wide-area systems. We present a protocol that outperforms previous work, by minimizing the average latency of the op- timistic notification.
Extracting key-substring-group features for text classification
Authors: Dell Zhang, Wee Sun Lee
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostly focused on different variants of generative Markov chain models. Although discriminative machine learning methods like Support Vector Machine (SVM) have been quite successful in text classification with word features, it is neither effective nor efficient to apply them straightforwardly taking all substrings in the corpus as features. In this paper, we propose to partition all substrings into statistical equivalence groups, and then pick those groups which are important (in the statistical sense) as features (named key-substring-group features) for text classification. In particular, we propose a suffix tree based algorithm that can extract such features in linear time (with respect to the total number of characters in the corpus). Our experiments on English, Chinese and Greek datasets show that SVM with key-substring-group features can achieve outstanding performance for various text classification tasks.