ppxscal/embedding_network huggingface dataset:
FreeFlowDB: Storage, Querying and Interacting with Structure-Activity Information from High-Throughput Drug Discovery
Authors: Rahul Singh, Elinor Velasquez, Preet Vijayant, Emmanuel Yera
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

The state of the art in modern drug discovery involves investigating a large number of drug-like molecules using medium or high-throughput assays, oj?en being conducted against multiple targets. Managing the information generated in such processes requires the ability to deal with complex, multifarious data as well as the development of new user-data interaction paradigms that help glean patterns hidden in the multitude of data by emphasizing exploration and information assimilation. This paper describes our research in developing FreeFlowDB, a drug discovery information database system that is geared towarak storing both structural as well as high-throughput assay information generated as part of a typical drug discovery process. FreeFlowDB supports powerful structural querying facilities that subsume within a common algorithmic framework exact structural matching, sub-structure querying, and in-exact matching. Furthermore, the system supports uniJied visualization-query facilities that allow interacting with assay as well as structure-activity information. This allows eflcacious and intuitive query-analysis of large amounts of data for knowledge discovery. Case studies and experimental results demonstrate the capabilities of the system.
Tactile Glyphs for Palpation of Relationships
Authors: Noritaka Osawa
Venue: Proceedings of the conference on Information Visualization (2006)

We propose the use of tactile glyphs to represent abstract information such as hierarchical relationships. A tactile glyph uses vibro-tactile feedback to the fingers and palm of the hand. By comparing two tactile glyphs, one for each hand, one can understand the relationships between the information that the glyphs represent. The use of tactile glyph comparison does not require remembering complex stimulus patterns; it only needs that some simple rules are learned. Although a limited number of stimuli can be provided to one hand, techniques for mapping hierarchical information to a pattern and using a sequence of tactile feedback enable the representation of relationships in a large hierarchy. Experimental evaluations were conducted to clarify the features of the tactile glyphs. The experimental evaluations suggested that the tactile glyphs can be used to represent hierarchical relationships and for palpation of relationships.
Electrophysiological Dissociation of Picture Versus Word Encoding: The Distinctiveness Heuristic as a Retrieval Orientation
Authors: Andrew E. Budson, Daniel B. J. Droller, Chad S. Dodson, Daniel L. Schacter, Michael D. Rugg, Philip J. Holcomb, Kirk R. Daffner
Venue: Journal of Cognitive Neuroscience (2005)

Event-related potentials (ERPs) were used to investigate the neural processes underlying the distinctiveness heuristic&mdash;a response mode in which participants expect to remember vivid details of an experience and make recognition decisions based on this metacognitive expectation. One group of participants studied pictures and auditory words; another group studied visual and auditory words. Studied and novel items were presented at test as words only, with all novel items repeating after varying lags. ERP differences were seen between the word and picture groups for both studied and novel items. For the novel items, ERP differences were largest in frontal and central midline electrodes. In separate analyses, the picture group showed the greatest ERP differences between item types in a parietally based component from 550 to 1000 msec, whereas the word group showed the greatest differences in a frontally based component from 1000 to 2000 msec. The authors suggest that the distinctiveness heuristic is a retrieval orientation that facilitates reliance upon recollection to differentiate between item types. Although the picture group can use this heuristic and its retrieval orientation on the basis of recollection, the word group must engage additional postretrieval processes to distinguish between item types, reflecting the use of a different retrieval orientation.
An Innovative System that Runs on a PDA for a Continuous Monitoring of People
Authors: M. I. Bagues, J. Bermudez, A. Burgos, A. Goni, A. Illarramendi, J. Rodriguez, A. Tablado
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Continuous pervasive monitoring has the potential to improve the quality of life of many persons (for example those who suffer from heart arrhythmias or elderly people who suffer from chronic diseases). We show the three main steps related to the monitoring process and supported by our system. First, how data are captured by sensors which send those data using wireless communications to a PDA (Personal Digital Assistant). Second, how data are analyzed, locally on the PDA, using techniques proposed in the areas of the Semantic Web and Machine Learning. Finally, how data stored at the PDA can be queried remotely using web services. Those three steps are illustrated in two different scenarios that the system can deal with: tele-assistance and monitoring of arrhythmias. Moreover, through the paper we highlight the main advantages provided by the system: active monitoring which consists in reacting to anomalous situations without direct intervention of the user; universal assistance, i.e. irrespective of time or place through the use of wireless communications and PDAs; vital signs monitoring which consists in using sensors that capture the value of those vital signs, and subsequently feed them to a decision support system that analyses them and generates an alarm if necessary; and remote monitoring which allows authorized personal to consult data on monitored patients, using the Internet. Finally we present some performance results which demonstrate the feasibility of the system.
Phoenix: Detecting and Recovering from Permanent Processor Design Bugs with Programmable Hardware
Authors: Smruti R. Sarangi, Abhishek Tiwari, Josep Torrellas
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Although processor design verification consumes ever-increasing resources, many design defects still slip into production silicon. In a few cases, such bugs have caused expensive chip recalls. To truly improve productivity, hardware bugs should be handled like system software ones, with vendors periodically releasing patches to fix hardware in the field. Based on an analysis of serious design defects in current AMD, Intel, IBM, and Motorola processors, this paper proposes and evaluates Phoenix -- novel field-programmable on-chip hardware that detects and recovers from design defects. Phoenix taps key logic signals and, based on downloaded defect signatures, combines the signals into conditions that flag defects. On defect detection, Phoenix flushes the pipeline and either retries or invokes a customized recovery handler. Phoenix induces negligible slowdown, while adding only 0.05% area and 0.48% wire overheads. Phoenix detects all the serious defects that are triggered by concurrent control signals. Moreover, it recovers from most of them, and simplifies recovery for the rest. Finally, we present an algorithm to automatically size Phoenix for new processors.
A Scalable Cluster-based Infrastructure for Edge-computing Services
Authors: Raffaella Grieco, Delfina Malandrino, Vittorio Scarano
Venue: World Wide Web (2006)

In this paper we present a scalable and dynamic intermediary infrastructure, SEcS (acronym of "Scalable Edge computing Services"), for developing and deploying advanced Edge computing services, by using a cluster of heterogeneous machines. Our goal is to address the challenges of the next-generation Internet services: scalability, high availability, fault-tolerance and robustness, as well as programmability and quick prototyping. The system is written in Java and is based on IBM's Web Based Intermediaries (WBI) [71] developed at IBM Almaden Research Center.
A Decision Support System for the Diagnosis of Coronary Artery Disease
Authors: M. G. Tsipouras, T. P. Exarchos, D. I. Fotiadis, A. Kotsia, A. Naka, L. K. Michalis
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

A rule-based Decision Support System is presented for the diagnosis of Coronary Artery Disease. The generation of the decision support system is realized automatically using a three stage methodology: (a) induction of a decision tree from a training set and extraction of a set of rules; (b) transformation of the set of rules into a fuzzy model and (c) optimization of the parameters of the fuzzy model. The system is evaluated using 199 subjects, each one characterized by 19 features, including demographic and history data, as well as laboratory examinations. Ten fold cross validation was employed and the average sensitivity and specificity obtained was 80% and 65% respectively. Our approach provides diagnosis based on easily acquired features and, since it is rule based, is able to provide interpretation for the decisions made. 1. Introduction
Creating audio keywords for event detection in soccer video
Authors: Min Xu, N. C. Maddage, Changsheng Xu, M. Kankanhalli, Qi Tian
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper presents a novel framework called audio keywords to assist event detection in soccer video. Audio keyword is a middle-level representation that can bridge the gap between low-level features and high-level semantics. Audio keywords are created from low-level audio features by using support vector machine learning. The created audio keywords can be used to detect semantic events in soccer video by applying a heuristic mapping. Experiments of audio keywords creation and event detection based on audio keywords have illustrated promising results. According to the experimental results, we believe that audio keyword is an effective representation that is able to achieve more intuitionistic result for event detection in sports video compared with the method of event detection directly based on low-level features.
Constructing Ramsey Graphs from Boolean Function Representations
Authors: Parikshit Gopalan
Venue: Proceedings of the 21st Annual IEEE Conference on Computational Complexity (2006)

Explicit construction of Ramsey graphs or graphs with no large clique or independent set, has remained a challenging open problem for a long time. While Erd ½os' probabilistic argument shows the existence of graphs on vertices with no clique or independent set of size , the best explicit constructions achieve a far weaker bound. Constructing Ramsey graphs is closely related to polynomial representations of Boolean functions; a low degree representation for the OR function can be used to explicitly construct Ramsey graphs [17]. We generalize the above relation by proposing a new framework. We propose a new definition of OR representations: a pair of polynomials represent the OR function if the union of their zero sets contains all points in {0,1}^n except the origin. We give a simple construction of a Ramsey graph using such polynomials. Furthermore, we show that all the known algebraic constructions, ones to due to Frankl-Wilson [12], Grolmusz [17] and Alon [2] are captured by this framework; they can all be derived from various OR representations of degree O(\sqrt n) based on symmetric polynomials. Thus the barrier to better Ramsey constructions through such algebraic methods appears to be the construction of lower degree representations. Using new algebraic techniques, we show that better bounds cannot be obtained using symmetric polynomials.
Sensitivity and robustness of eigendecomposition-based detectors
Authors: W. Xu, M. Kaveh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A new framework is presented for the analysis of the performance of detection methods, such as the Akaike's information criteria (AIC) and the minimum description length principle (MDL) which are based on the eigenvalues of the covariance matrix. It is shown that theoretical analysis of the probabilities of overestimation and underestimation can be much more conveniently carried out via a proposed, particularly simple, sequence of statistics. Also the breakdown of these detection methods in the presence of model nonidealities is explored by theory, simulations and experimentation with real array data. For example, theoretical arguments are given to demonstrate the high degree of sensitivity of the detectors to unknown deviations of the noise from whiteness.
On building an organizationally realistic agent-based model of local interaction and emergent network structure
Authors: James K. Hazy, Brian F. Tivnan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We describe research intended to build an agent-based model that is "organizationally realistic." By this we mean that the attributes of the artificial organization of agents conform to empirical results for human organizational systems. We build upon the definitional structure of computational organization theory (Carley and Prietula 1994b) and represent an organization as a network of agents, tasks, resources, and knowledge (Krackhardt and Carley 1998). We do not assume an a priori design requirement. Rather, organizational structures are posited to emerge endogenously, the particulars being a key area of study. Agent interactions are governed by local network dynamics, agent-specific rules, and explicit universal constraints (Hazy and Tivnan 2003).
Predicting Resource Demand in Dynamic Utility Computing Environments
Authors: Artur Andrzejak, Sven Graupner, Stefan Plantikow
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

We target the problem of predicting resource usage in situations where the modeling data is scarce, non-stationary, or expensive to obtain. This scenario occurs frequently in computing systems and networks, mostly due to the high dynamicity of the underlying processes. Utility computing environments are an important example for such a scenario, as their frequent reconfiguration reduces the amount of training data available for modeling. We propose an approach based on a genetic algorithm and fuzzy logic which allows for creation of robust prediction models even with scarce training data. The method is evaluated on demand usage traces collected from 41 servers in a business data center. The results show in the setting of scarce training data amount our method has a significantly higher prediction accuracy compared to other non-linear techniques such as decision trees or support vector machines.
The application of evaluation method based on HMM for results validity of complex simulation system
Authors: Hengjie Song, Ping Ma, Ming Yang
Venue: Proceedings of the 37th conference on Winter simulation (2005)

According to the characteristic of randomization and sequential logic in complex simulation systems, a new evaluation method based on hidden Markov model (HMM) is presented, which applies multivariate statistical theory to quantificationally evaluate the results validity of complex simulation system. By importing matrix of observed state vector, the method enhance the clarity of describing scenario and running states of simulation systems, and ultimately implement an exploring approach to quantitative analysis for the results validity. Furthermore, quantificational evaluation criterion of results validity is given and the critical algorithm adopted in the process of quantificational evaluation is discussed in detail.
Practical synchronization techniques for multi-channel MAC
Authors: Hoi-Sheung Wilson So, Giang Nguyen, Jean Walrand
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Researchers have proposed many wireless MAC protocols such as [20], [8], [25], [24], [6], and [17] which exploit frequency-agile radios and multiple available channels to increase network through-put. These protocols usually only require each node to have one radio. By carefully coordinating the frequency hopping of different nodes, different node pairs can use multiple channels simultaneously. In [17], Mo et al classified these protocols into four generalized categories and compared their performances through both analysis and simulation. They found that the Parallel Rendezvous family of protocols has the best overall performance by removing the bottleneck of a single control channel. These protocols show good promise for use with multi-hop networks because these networks suffer from self-interference and traditional MAC protocols using only one channel often fail to provide satisfactory throughput. However, we are not aware of any implemented Parallel Rendezvous multi-channel MAC protocols. We argue one major reason is that existing proposals such as McMAC[17] and SSCH[6] have not thoroughly considered a practical aspect of the design essential for a working implementation, namely: synchronization. Through an exploration including an implementation exercise on hardware, we show that synchronization for multi-channel MAC protocols is a non-trivial problem. We designed and implemented a synchronization mechanism specifically for this purpose and show that it has tackled the problem of synchronizing one-hop neighbor pairs effectively, thereby paving the way for efficient multi-channel MAC protocols.
Real-Time Scheduling of Parallel Tasks on Fewest Processors
Authors: Wan Yeon Lee, Young Woong Ko
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

A polynomial-time scheduling algorithm is proposed for the real-time parallel tasks on multiprocessors. The algorithm always finds a feasible schedule using the fewest processors. The tasks have the properties of linear speedup, flexible preemption, bounded parallelism, arbitrary arrivals and sequential deadlines with the order of Last Come First Service(LCFS). The time complexity of the algorithm is (M2 · N2) for M tasks and N processors, in the worst case.
The Effect of Learned Perceptual Associations on Visuomotor Programming Varies with Kinematic Demands
Authors: Angela M. Haffenden, Melvyn A. Goodale
Venue: Journal of Cognitive Neuroscience (2000)

The present set of experiments investigated the possibility that learned perceptual information can, under certain circumstances, be utilized by visuomotor programming. In Experiment 1 (N = 28), an association was established between the color and size of square wooden blocks (e.g., red = large; yellow = small, or vice-versa). In Experiment 2 (N = 28), an association was established between the shape and size of plastic objects (e.g., hexagon = large; circle = small, or vice-versa). It was expected that the learned associations would change the perceived size of two probe objects halfway in size between the large and small objects (the probe object matched by color or shape to the large group of objects would appear smaller than the probe object matched to the small group of objects as a result of withingroup relative size comparisons). In both experiments, half of the participants grasped the target objects, and the other half estimated the size of the objects by opening their thumb and finger a matching amount. For Experiment 1, it was predicted that an influence of the learned association on the treatment of the probe objects would be seen in manual estimations and in grip scaling because the kinematics of the grasping movement were very similar across trials. As predicted, the learned association between size and color was as easily incorporated into visually guided grasping as it was into visual perceptions. In Experiment 2, it was predicted that an influence of the learned perceptual association would be seen only in manual estimations, and not in grip scaling, because the variability in target object shape from trial to trial would demand changes in precontact finger posture across trials. Despite the significant effect of the size-shape association on size estimations, no influence was seen in preparatory grip scaling, probably because varying shape increased the metrical demands on visuomotor programming from those in Experiment 1. Together, the results suggest that visuomotor programming can make use of learned size information under some, but not all, conditions.
Tracking People by Learning Their Appearance
Authors: Deva Ramanan, David A. Forsyth, Andrew Zisserman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

An open vision problem is to automatically track the articulations of people from a video sequence. This problem is difficult because one needs to determine both the number of people in each frame and estimate their configurations. But, finding people and localizing their limbs is hard because people can move fast and unpredictably, can appear in a variety of poses and clothes, and are often surrounded by limb-like clutter. We develop a completely automatic system that works in two stages; it first builds a model of appearance of each person in a video and then it tracks by detecting those models in each frame ("tracking by model-building and detection”). We develop two algorithms that build models; one bottom-up approach groups together candidate body parts found throughout a sequence. We also describe a top-down approach that automatically builds people-models by detecting convenient key poses within a sequence. We finally show that building a discriminative model of appearance is quite helpful since it exploits structure in a background (without background-subtraction). We demonstrate the resulting tracker on hundreds of thousands of frames of unscripted indoor and outdoor activity, a feature-length film ("Run Lola Run”), and legacy sports footage (from the 2002 World Series and 1998 Winter Olympics). Experiments suggest that our system 1) can count distinct individuals, 2) can identify and track them, 3) can recover when it loses track, for example, if individuals are occluded or briefly leave the view, 4) can identify body configuration accurately, and 5) is not dependent on particular models of human motion.
CD/Mobile Hybrid Model for Student in Remote Islands
Authors: Ali Fawaz Shareef, Prof. Kinshuk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Distance education involves providing formal education in a distance. Distance education is provided using different media and using different models. This paper outlines a distance education model that was developed to deliver distance education to island communities in Maldives. The distance education model described in this paper was designed for Maldives. The model is based on a three layered approach which does not require students Internet connectivity. This paper introduces an enhancement to this model using mobile technology. The enhancement will reduce the amount time taken to receive feedback from teachers. In addition, it removes an additional layer in the model.