ppxscal/embedding_network huggingface dataset:
Innovative applications of computer science in medicine
Authors: G. Anthony Gorry
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

For a variety of economic, social and geographical reasons, there currently exists a maldistribution of medical expertise with respect to the needs of the population both in this country and perhaps more markedly abroad. The particular characteristics of the computer, its large memory and the industry of its computing engine, suggest the possibility of its use to provide replicable and distributable packages of expertise. Attempts to build such packages, however, until recently have been confined to rather sharply circumscribed medical problems. Success has been somewhat limited, and the net effect of this work has been small when compared to the problems which exist in the health care industry. Advances in computer science, and in particular in the domain of artificial intelligence, offer hope that some of the major impediments to success in this area can be eliminated. This session will be concerned with current work in the area of computer science applications in medicine. Particular attention will be paid to the identification of the cutting edge of computer science and artificial intelligence technology in medicine and to the major problems which as yet remain unresolved. 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
Adaptive inter-router links for low-power, area-efficient and reliable Network-on-Chip (NoC) architectures
Authors: Avinash Karanth Kodi, Ashwini Sarathy, Ahmed Louri, Janet Wang
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The increasing wire delay constraints in deep sub-micron VLSI designs have led to the emergence of scalable and modular Network-on-Chip (NoC) architectures. As the power consumption, area overhead and performance of the entire NoC is influenced by the router buffers, research efforts have targeted optimized router buffer design. In this paper, we propose iDEAL - inter-router, dual-function energy and area-efficient links capable of data transmission as well as data storage when required. iDEAL enables a reduction in the router buffer size by controlling the repeaters along the links to adaptively function as link buffers during congestion, thereby achieving nearly 30% savings in overall network power and 35% reduction in area with only a marginal 1 -- 3% drop in performance. In addition, aggressive speculative flow control further improves the performance of iDEAL. Moreover, the significant reduction in power consumption and area provides sufficient headroom for monitoring Negative Bias Temperature Instability (NBTI) effects in order to improve circuit reliability at reduced feature sizes.
A New Model for Classifying Inputs and Outputs and Evaluating the DMUs Efficiency in DEA Based on Cobb-Douglas Production Function
Authors: S. M. Hatefi, F. Jolai, H. Kor, H. Iranmanesh
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

In conventional data envelopment analysis it is assumed that the input versus output status of each chosen performance measures is known. In some conditions finding a statue of some variables from the point view of input or output is very difficult; these variables treat as both an input and output and are called flexible measures. This paper proposes a new model based on Cobb- Douglas production function for classifying inputs and outputs and evaluating the performance of Decision making units by considering flexible measures. The model is capable to provide marginal output elasticities and marginal rates of output transformation. The presented model is evaluated comparing with the recent model in the literature. The result shows that the measure efficiencies of our model are statistically closer to true efficiencies and have higher rank correlation with true efficiencies. We illustrate the applicationof proposed model with the real data found in literature. Also results obtained from simulated and real data show that there are high correlation between our model and the recent model.
Extension of fuzzy TOPSIS method based on interval-valued fuzzy sets
Authors: Behzad Ashtiani, Farzad Haghighirad, Ahmad Makui, Golam ali Montazer
Venue: Applied Soft Computing (2009)

Decision making is one of the most complex administrative processes in management. In circumstances where the members of the decision making team are uncertain in determining and defining the decision making criteria, fuzzy theory provides a proper tool to encounter with such uncertainties. However, if decision makers cannot reach an agreement on the method of defining linguistic variables based on the fuzzy sets, the interval-valued fuzzy set theory can provide a more accurate modeling. In this paper the interval-valued fuzzy TOPSIS method is presented aiming at solving MCDM problems in which the weights of criteria are unequal, using interval-valued fuzzy sets concepts.
Proceedings of the 4th ACM/IEEE international conference on Human robot interaction
Venue: ACM/IEEE International Conference on Human-Robot Interaction (2009)

It is our great pleasure to welcome you to the 4th ACM/IEEE International Conference on Human-Robot Interaction (HRI 2009). HRI is a single-track, highly selective annual conference that showcases the very best research and thinking in human-robot interaction. HRI is inherently interdisciplinary and multidisciplinary, reflecting work from researchers in social psychology, cognitive science, HCI, human factors, artificial intelligence, robotics, organizational behavior, anthropology, and many more. The theme of HRI 2009, "Interacting Naturally With Robots" reflects the importance of robots meeting the complex demands of the environments and contexts in which they operate. In particular, natural human-like communications are becoming critical for robots operating in everyday settings such as the home, office, schools, shopping malls, and other public and private spaces. This year's conference places special emphasis on robots interacting naturally with people. The call for papers attracted 120 full paper and 62 late-breaking abstract submissions from Asia, Europe, the Middle East, Canada, and the United States. The program committee led by the program co-chairs conducted a very rigorous review process for full papers this year, accepting 23 full papers for oral presentation and publication in the proceedings in the ACM Digital Library. Furthermore, 59 late-breaking abstracts were screened for relevance to the HRI conference, and are presented as posters, exposing a broader perspective of solutions and challenges in HRI. They will be made available in the ACM Digital Library as non-archival abstracts. Finally, a total of 13 videos (out of 19 submissions) were accepted based on importance, novelty and entertainment value and will be shown in a special video session. The accepted presentations cover a variety of topics, including human-robot communication, robot perception and prediction, interface design, and methods for studying human-robot interaction.
Overview of the alternative power system economic analysis model
Authors: Richard B. Davis, Jerome V. V. Kasper
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The Alternative Power System Economic Analysis Model (APSEAM) is an interactive computer model which can be applied in three ways: (1) the model projects the annual, after-tax costs of capital investment in various conventional and non-conventional energy technologies for each and every year in the investment time horizon; (2) the model serves as an investment analysis tool; and (3) the model serves as a tool which can be used for evaluating the impact of specific policies on specific investors.
The aspect Bernoulli model: multiple causes of presences and absences
Authors: Ella Bingham, Ata Kab&#x00e1;n, Mikael Fortelius
Venue: Pattern Analysis Applications (2009)

We present a probabilistic multiple cause model for the analysis of binary (0&#x2013;1) data. A distinctive feature of the aspect Bernoulli (AB) model is its ability to automatically detect and distinguish between &#x201c;true absences&#x201d; and &#x201c;false absences&#x201d; (both of which are coded as 0 in the data), and similarly, between &#x201c;true presences&#x201d; and &#x201c;false presences&#x201d; (both of which are coded as 1). This is accomplished by specific additive noise components which explicitly account for such non-content bearing causes. The AB model is thus suitable for noise removal and data explanatory purposes, including omission/addition detection. An important application of AB that we demonstrate is data-driven reasoning about palaeontological recordings. Additionally, results on recovering corrupted handwritten digit images and expanding short text documents are also given, and comparisons to other methods are demonstrated and discussed.
A new modeling method in feature construction for the HSQC spectra screening problem
Authors: Hiromi Arai, Satoru Watanabe, Takanori Kigawa, Masayuki Yamamura
Venue: Bioinformatics (2009)

Motivation: Large-scale biological analyses produce huge amounts of data. As a consequence, automation in the data analysis process is needed. Sample screening problems in NMR high-throughput protein structure analysis are the typical examples. Especially, screening by protein 1H−15N heteronuclear single quantum coherence (HSQC) spectra must be done quantitatively by a human expert. One popular solution for this problem is data mining. Machine learning methods can automatically extract rules and achieve high accuracy in prediction when a good quality training dataset is prepared. However, they tend to be a black box and the learned machines suffer the risk of overfitting to the dataset. Results: We propose a model which evaluates HSQC spectra for feature construction. The model calculates similarity between the measured chemical shifts and those of a random coil peak model. We applied our feature construction method for the machine learning discrimination of folded protein HSQC spectra from unfolded ones, and compared our model-based features with those of conventional sequence-based features and image recognition features. The results revealed that our method has sufficient discrimination power and less overfits on training data, as compared to the other methods. In addition, our method succeeded reduction of input data complexity towards further investigation. Contact: arai@es.dis.titech.ac.jp Supplementary information: Supplementary data are available at Bioinformatics online.
Digital filter design using non-uniform sampling
Authors: K. Busawon, Wai-Pang Ng
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

In this paper, a non-uniform sampling algorithm is proposed for one-dimensional bandlimited time varying signals. The main feature of the proposed sampling scheme is that the sampling steps are inversely proportional to signal gradient or slope of the signal. As a result, a smaller sampling step is obtained whenever the gradient is high and vice-versa. Thus, a better representation of the signal is obtained when it is linearly interpolated between the samples. The proposed sampling algorithm is then applied to the design of digital filters using the well-known impulse invariance method. It is shown that the nonuniform sampling allows to design a FIR filter whose length is 14 times shorter than what is obtained with uniform sampling; with both filters having similar characteristiscs. Simulations are provided to show the performance and characteristics of the sampling sequence.
High precision antenna design with hybrid feeds for GPS requirements
Authors: Habibullah Jamal, Haris U. Gul
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

Microstrip patch antennas provide good compatibility with communication system's printed circuitry. Here a circular microstrip patch antenna with circular configuration of ground plane and substrate has been designed for GPS using a cavity line model. RHCP is obtained by placing coaxial pins quadraturly and symmetrically along the two main axes and pins are fed through a hybrid feed arrangement. Circular ground plane effect is investigated for return loss and VSWR, which are typical parameter used to study the behavior of antennas. The results obtained provide a workable antenna design for incorporation in GPS receivers.
Recalling Temporal Sequences of Patterns Using Neurons with Hysteretic Property
Authors: Johan Sveholm, Yoshihiro Hayakawa, Koji Nakajima
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Further development of a network based on the Inverse Function Delayed (ID) model which can recall temporal sequences of patterns, is proposed. Additional advantage is taken of the negative resistance region of the ID model and its hysteretic properties by widening the negative resistance region and letting the output of the ID neuron be almost instant. Calling this neuron limit ID neuron, a model with limit ID neurons connected pairwise with conventional neurons enlarges the storage capacity and increases it even further by using a weightmatrix that is calculated to guarantee the storage after transforming the sequence of patterns into a linear separation problem. The network's tolerance, or the model's ability to recall a sequence, starting in a pattern with initial distortion is also investigated and by choosing a suitable value for the output delay of the conventional neuron, the distortion is gradually reduced and finally vanishes.
A PTAS for Cutting Out Polygons with Lines
Authors: Sergey Bereg, Ovidiu Daescu, Minghui Jiang
Venue: Algorithmica (2009)

We present a simple O(m+n 6/&#x03b5; 12) time (1+&#x03b5;)-approximation algorithm for finding a minimum-cost sequence of lines to cut a convex n-gon out of a convex m-gon.
Network Creation Games with Disconnected Equilibria
Authors: Ulrik Brandes, Martin Hoefer, Bobo Nick
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

In this paper we extend a popular non-cooperative network creation game (NCG) [11] to allow for disconnected equilibrium networks. There are n players, each is a vertex in a graph, and a strategy is a subset of players to build edges to. For each edge a player must pay a cost &plusmn;, and the individual cost for a player represents a trade-off between edge costs and shortest path lengths to all other players. We extend the model to a penalized game (PCG), for which we reduce the penalty for a pair of disconnected players to a finite value &sup2;. We prove that the PCG is not a potential game, but pure Nash equilibria always exist, and pure strong equilibria exist in many cases. We provide tight conditions under which disconnected (strong) Nash equilibria can evolve. Components of these equilibria must be (strong) Nash equilibria of a smaller NCG. But in contrast to the NCG, for the vast majority of parameter values no tree is a stable component. Finally, we show that the price of anarchy is &tilde;(n), several orders of magnitude larger than in the NCG. Perhaps surprisingly, the price of anarchy for strong equilibria increases only to at most 4.
Extremal Optimisation and Bin Packing
Authors: Tim Hendtlass, Marcus Randall
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

Extremal Optimisation (EO) is a fairly new entrant into the realms of stochastic based optimisation techniques. Its behaviour differs from other more common algorithms as it alters a poorly performing part of the one solution used without regard to the effect this will have on the quality of the solution. While this means that its performance on assignment problems may be poor if used on its own, this same `failing' makes it a very suitable base for a meta-heuristic. An analysis of the performance of naive EO on the classic bin packing problem is performed in this paper. Results are also presented that show that the same naive EO can be used in a meta-heuristic that performs very well.
A wideband high-CMRR single-ended to differential converter
Authors: Francesco Centurelli, Raimondo Luzzi, Pasquale Tommasino, Alessandro Trifiletti
Venue: Analog Integrated Circuits and Signal Processing (2009)

A novel circuit topology that provides wideband single-ended to differential conversion is presented. The proposed circuit exploits a negative feedback loop to generate a second input signal for a differential pair, thus obtaining 6 dB extra conversion gain and higher CMRR with respect to a simple differential pair driven single-ended. A signal and noise model for the circuit is proposed, based on admittance parameters and the use of a novel analysis technique to open the feedback loop while maintaining closed loop loading effects. The model is exploited to derive design guidelines in bipolar and MOS technologies. Measurements on a test chip in STMicroelectronics BiCMOS7 technology are reported to compare the performance of the proposed topology and of a simple differential pair used as single-ended to differential converter.
The Phonemic Approach for Sanskrit Text
Authors: R. K. Joshi, T. N. Dharmadhikari, Vijay Vasudev Bedekar
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

Professor Joshi proposes that a phonemic encoding scheme be adopted as the standard for machine processing of Sanskrit text. In the scheme he details, each phoneme is represented by a single character code that represents a single Sanskrit sound. Graphic units in Devanagari corresponding to syllabic units, including consonant plus /a/, are represented as sequences. Glyphs corresponding to intial vowels verses dependent vowels are not given distinct encodings; rather they are selected based upon context. (P. Scharf)
Honeypot Scheme for Distributed Denial-of-Service
Authors: Vinu V. Das
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Honeypots are physical or virtual machines successfully used as intrusion detection tools to detect worm-infected hosts. Denial of service (DoS) attack consumes the resources of a remote client or network itself, there by denying or degrading the service to the legitimate users. In a DoS defense mechanism, a honeypot acts as a detective server among the pool of servers in a specific network; where any packet received by the honeypot is most likely a packet from an attacker. This paper points out a number of drawbacks such as Legitimate Attacker and Link Unreachable problem in the existing honeypot schemes. This paper proposes a new efficient honeypot model to solve all the existing problems by opening a virtual communication port for any specific communication between an authorized client and server; and by providing facility to act as an Active Server (AS) for any honeypot.
Multi-Objective Optimization for the Functional Configuration Design of Mobile Devices Using Analytic Hierarchy Process
Authors: Chensheng Wang, Fei Zhou, Joris Vergeest
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

The optimization of multi-objectives is crucial to the functional configuration design of industrial products, especially to the functional design of mobile devices. In the design of mobile devices, due to the complexity of functional implementation and their interactions, an optimized functional configuration for a product is hardly to achieve. In this paper, the functional configuration design of a mobile phone is taken as an example, and by applying the analytic hierarchy process multiple objectives in the designing process are optimized with a harmonization of competing factors. The proposed method is associated with graphical operators to construct the optimization model and relevant constraints, in which each objective is weighted either by its information entropy or by individual subjective partiality. The evaluation of design results utilizing our method demonstrates that the method is capable of delivering the best functional configuration, by means of providing reference identifying the best functional configuration from a variety of possible design schemes.
Urban granularities--a data structure for cognitively ergonomic route directions
Authors: Alexander Klippel, Stefan Hansen, Kai-Florian Richter, Stephan Winter
Venue: Geoinformatica (2009)

This paper addresses a data structure specification for route directions that incorporates essential aspects of cognitive information processing. Specifically, we characterize levels of granularity in route directions as the result of the hierarchical organization of urban spatial knowledge. We discuss changes of granularity in route directions that result from combining elementary route information into higher-order elements (so called spatial chunking). We provide a framework that captures the pertinent aspects of spatial chunking. The framework is based on established principles used--from a cognitive perspective--for changing the granularity in route directions. The data structure we specify based on this framework allows us to bridge the gap between results from behavioral cognitive science studies and requirements of information systems. We discuss the theoretical underpinning of the core elements of the data structure and provide examples for its application.
An Approach for Enhancing Inter-processor Data Locality on Chip Multiprocessors
Authors: Guilin Chen, Mahmut Kandemir
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

The tighter integration on chip multiprocessors exerts a higher pressure on off-chip accesses to the memory system. This makes minimizing the number of off-chip accesses a critical optimization goal. This paper discusses a compiler-based solution to this problem for the embedded applications that perform stencil computations. An important characteristic of this solution is that it distinguishes between the intra-processor data reuse and inter-processor data reuse. The first of these captures the data reuse that occurs across loop iterations assigned to the same processor, whereas the second one represents the data reuse that takes place across the loop iterations assigned to different processors. The proposed approach then optimizes inter-processor reuse by re-organizing the loop iterations of each processor carefully, considering how data elements are shared across processors. The goal is to ensure that the different processors access the shared data within a short period of time, so that the data can be captured in the on-chip memory space at the time of the reuse. This paper also presents an evaluation of the proposed optimization and compares it to an alternate scheme that optimizes data locality for each processor in isolation. The results obtained by applying our implementation to eight loop-intensive benchmark codes from the embedded computing domain show that our approach improves over the mentioned alternate scheme by 15.6% on average.