ppxscal/embedding_network huggingface dataset:
Incorporation of Telehealth Resources in Belo Horizonte's SAMU: Qualifying and Improving Care
Authors: Alaneir de Fátima dos Santos, Cláudio de Souza, Neuslene Rivers de Queiroz, Gustavo Cancela e. Penna, Eliete Miriam Neves de. Pinho e. Medeiros, Humberto José Alves
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

In Brazil the use of information communication technologies increased considerably in this last few years, but there are still very incipient experiments using telemedicine for pre-hospital care. This article reports the deployment of resources of telehealth on SAMU (Emergency Mobile Assistance Service) of Belo Horizonte and the preliminary results of the project, involving European partners, the Federal University of Minas Gerais School of Medicine and the City of Belo Horizonte Department of Health. It is applied to the Brazilian reality, through the appropriation of good practices existing in Europe and the integration of technology development. We have been using multiparametric monitors, videos of the patient and ultrasound, and 3G technology to enhance transfer of pre-hospital data, from ambulances, to data banks in hospitals, to improve patient care.
A grammatical evolution approach to intrusion detection on mobile ad hoc networks
Authors: Sevil Şen, John Andrew Clark
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

In recent years mobile ad hoc networks (MANETs) have become a very popular research topic. By providing communication in the absence of a fixed infrastructure they are very attractive for many applications such as tactical and disaster recovery operations and virtual conferences. On the other hand, this flexibility introduces new security risks. Moreover, different characteristics of MANETs make conventional security systems ineffective and inefficient for this new environment. Intrusion detection, which is an indispensable part of a security system, presents also a particular challenge due to the dynamic nature of MANETs, the lack of central points, and their highly constrained nodes. In this paper, we propose to investigate the use of an artificial intelligence based learning technique to explore this difficult design space. The grammatical evolution technique inspired by natural evolution is explored to detect known attacks on MANETs such as DoS attacks and route disruption attacks. Intrusion detection programs are evolved for each attack and distributed to each node on the network. The performance of these programs is evaluated on different types of networks with different mobility and traffic patterns to show their effects on intrusion detection ability.
Orthogonal rational functions and rational modifications of a measure on the unit circle
Authors: Karl Deckers, Adhemar Bultheel
Venue: Journal of Approximation Theory (2009)

In this paper we present formulas expressing the orthogonal rational functions associated with a rational modification of a positive bounded Borel measure on the unit circle, in terms of the orthogonal rational functions associated with the initial measure. These orthogonal rational functions are assumed to be analytic inside the closed unit disc, but the extension to the case of orthogonal rational functions analytic outside the open unit disc is easily made. As an application we obtain explicit expressions for the orthogonal rational functions associated with a rational modification of the Lebesgue measure.
Generalized Hilbert transform and its properties in 2D LCT domain
Authors: Xu Guanlei, Wang Xiaotong, Xu Xiaogang
Venue: Signal Processing (2009)

Hilbert transform plays an important role in signal processing. With the development of new transforms, one-dimensional (1D) Hilbert transform has been extended into fractional Fourier transform domain. However, the researches of two-dimensional (2D) Hilbert transform in linear canonical transform (LCT) domain become complicated for the reasons of the complexity of 2D signals and more parameters in LCT, and now they are in the infancy. In this paper, the definitions of half-planed Hilbert transform, cross-orthant Hilbert transform and single-orthant Hilbert transform are yielded in LCT domain. In addition, the relation between time domain and transformed domain is discussed. Moreover, some important properties and conclusions are obtained as well. Finally, we defined and derived 2D Bedrosian's principle in LCT domain.
2009 Special Issue: Embodying meaning: Insights from primates, autism, and Brentano
Authors: Juan Carlos Gómez
Venue: Neural Networks (2009)

In this paper I offer an analysis of social meaning in terms of coding intentional relations between agents and objects. This analysis is amenable to embodied interpretations of intentionality and Theory of mind and may prove of help for the task of simulating the attribution of intentionality with neural networks. Work with non-human primates suggests that evolution first dealt with the problem domain of social meaning by selecting specific adaptations for coding behaviour as intentional in the sense of Brentano, i.e., as directed to or being about objects (for example, gaze following behaviours). Work with autism suggests that alterations in these basic mechanisms of intentional attribution may explain some of the most prevalent problems with social meaning in this condition. Brentanian mechanisms for encoding intentional relations between agents and objects are more basic and evolutionarily more primitive than representational theories of mind. However, some of the key components of representational theories of mind may be already present in the intentional abilities of primates, suggesting that the decisive evolutionary step may have consisted of a re-organization of existing abilities rather than the creation of new skills. Neural network models and models of the evolution and development of primitive mechanisms for intentional encoding may benefit from mutual cross-fertilization.
Knowledge Management for Educational Innovation: IFIP WG 3.7 7th Conference on Information Technology in Educational Management
Authors: Arthur Tatnall, Toshio Okamoto, Adrie Visscher
Venue:  (2007)

This book contains selected papers presented at the seventh Conference on Working Group 3.7 of the Internation Federation for Information Processing. The focus of Working Froup 3.7 is on ITEM: Information Technology in Educational Management. Theevent toook place in Hamamatsu, Japan, and enabled the exchange of findings and ideas between researchers in educational management and information technology, policy-makers in the field of education, developers of ITEM systems, and vendors. The overall goal of the conferencewas to demonstrate and explore directions for developing and improving all types of educational institutions throughITEM. Contributions to this conference hailed from all over the world. Thepapers in this volume investigate how ITEM can support and improve educational practice at the level of instruction as well as at the institutional level, an analysis of the historyof ITEM as a field of study and practice, results of researcdh on how training can promote the implementation of ITEM systems, and theoretical analyses of the conditions under which ITEM will have the strongest impact. Moreover, all sectors of educational systems (from schools to universities) arerepresented by the various chapters of this book.
Memory subsystem simulation in software TLM/T models
Authors: Eric Cheung, Harry Hsieh, Felice Balarin
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Design of Multiprocessor System-on-a-Chips requires efficient and accurate simulation of every component. Since the memory subsystem accounts for up to 50% of the performance and energy expenditures, it has to be considered in system-level design space exploration. In this paper, we present a novel technique to simulate memory accesses in software TLM/T models. We use a compiler to automatically expose all memory accesses in software and annotate them onto efficient TLM/T models. A reverse address map provides target memory addresses for accurate cache and memory simulation. Simulating at more than 10MHz, our models allow realistic architectural design space explorations on memory subsystems. We demonstrate our approach with a design exploration case study of an industrial-strength MPEG-2 decoder.
Reordering for improved constrained reconstruction from undersampled k-space data
Authors: Ganesh Adluru, Edward V. R. DiBella
Venue: Journal of Biomedical Imaging (2008)

Recently, there has been a significant interest in applying reconstruction techniques, like constrained reconstruction or compressed sampling methods, to undersampled k-space data in MRI. Here, we propose a novel reordering technique to improve these types of reconstruction methods. In this technique, the intensities of the signal estimate are reordered according to a preprocessing step when applying the constraints on the estimated solution within the iterative reconstruction. The ordering of the intensities is such that it makes the original artifact-free signal monotonic and thus minimizes the finite differences norm if the correct image is estimated; this ordering can be estimated based on the undersampled measured data. Theory and example applications of the method for accelerating myocardial perfusion imaging with respiratory motion and brain diffusion tensor imaging are presented.
Emerging application domains: research challenges and opportunities for FPGAs
Authors: Jason H. Anderson
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Communications infrastructure, data processing and industrial electronics are the cornerstone application areas for programmable logic today. But what are the application domains of tomorrow? What nascent application areas could explode the growth of programmable logic usage and expand the programmable market? In this workshop, we will hear speakers from industry and academia talk about the emerging application areas for FPGAs and the challenges and opportunities in these areas. We will consider how programmable hardware and the associated tools should be enhanced to become better-suited to tomorrow's applications. The overarching aim of the workshop is to seed ideas in the research community by giving an applications perspective of the fertile topics for future research on FPGA architecture, CAD and applications.
An Argumentative Approach for Modelling Coalitions Using ATL
Authors: Nils Bulling, Carlos I. Chesñevar, Jürgen Dix
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

During the last decade argumentation has evolved as a successful approach to formalize commonsense reasoning and decision making in multiagent systems. In particular, recent research has shown that argumentation can be used to provide a framework for reasoning about coalition formation, formalizing the adoption of coalitions by the agents in association with different argumentation semantics. At the same time Alternating-time Temporal Logic (atl for short) has been successfully used to reason about the behavior and abilities of coalitions of agents. However, an important limitation of atl operators is that they account only for the existence of successful strategies of coalitions, not considering whether coalitions can be actually formed.This paper is an attempt to combine both frameworks in order to develop a logical system through which we can reason at the same time (1) about abilities of coalitions of agents and (2) about the formation of coalitions. In order to achieve this, we provide a formal extension of atl, called Coalitional atl (coalATL for short), in which the actual computation of the coalition is modelled in terms of argumentation semantics. Moreover, we integrate goals as agents' incentive to join coalitions. We show that coalATL's proof theory can be understood as a natural extension of the model checking procedure used in atl.
Applying a genetic algorithms programming to natural cheese products
Authors: Ratchadaporn Oonsivilai, Anant Oonsivilai
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Model integrates cheese manufacturing has attracted considerable in recent years. Most modifications of Genetic Algorithms (GA) for solving optimization problems are to find some mathematical support to the GA. This paper applies genetic algorithms to achieve the parameters of the processed cheese products. The genetic algorithms are very suitable for searching discrete, noisy, multimodal and complex space. The economic evaluation of standaized milk for cheese making is given and the objective is to make the profit of the natural cheese. As recognized, exploitation of the optimization based on Genetic Algorithms gives advanced results.
Panoramic screen-based simulation with dynamic background
Authors: Samsun Lampotang, David E. Lizdas, John J. Tumino, Nikolaus Gravenstein, Harshdeep S. Wilkhu
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A national focus group evaluating a preliminary screen-based simulation found navigation between multiple screens representing different operating room (OR) entities challenging. Consequently, we re-designed the simulation without using multiple screens. To address the challenge of aesthetically depicting both extensive scope and minute detail of an OR on a single screen without using a patchwork collage of graphics, we developed a novel approach using a panoramic photograph captured from an anesthesia provider's typical vantage point. We used Director to render the panoramic background interactive and dynamic. In spite of extensive computation to allow smooth 360&deg; panning around the OR, image de-warping, animation and sonification of the panoramic background and projecting mathematical models up to 3 hours forward in time, the simulation runs in real time with imperceptible delay on a regular Windows notebook computer. Users can jump forward and backward in time. Clinicians worldwide are currently using the simulation for training.
Dynamic Frequency and Resource Allocation with Adaptive Error Control Based on RTP for Multimedia QoS Guarantees in Wireless Networks
Authors: Ana Pajares, Juan Carlos Guerri, Manuel Esteve, Carlos Palau, Antonio Leon, Narcis Cardona
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Providing QoS guarantees in wireless networks is a much more complex problem than in fixed networks. Conventional fixed allocation schemes are not suitable for these traffic patterns and it becomes necessary to design new dynamic resource allocation schemes. This paper deals with three of the main wireless networks problems to provide multimedia QoS guarantees, i.e., frequency assignation, bandwidth requirements and error rate. For the former problem, several frequency assignation algorithms have been evaluated. For the second, a dynamic resource allocation algorithm is proposed. The goal of this algorithm is to share the available wireless bandwidth between the major number of connections, and offer the maximum QoS to all of them depending on the connections state. For the later, error rate effects are corrected by means of an adaptive error control algorithm based on RTP. This algorithm tries to balance the channels quality of the on-going calls to obtain a fair error quality for all of them.
A discrete model of thin shells
Authors: Eitan Grinspun
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We describe a discrete model for the dynamics of thin flexible structures, such as hats, leaves, and aluminum cans, which are characterized by a curved undeformed configuration. Previously such thin shell models required complex continuum mechanics formulations and correspondingly complex algorithms. We show that a simple shell model can be derived geometrically for triangle meshes and implemented quickly by modifying a standard cloth simulator. Our technique convincingly simulates a variety of curved objects with materials ranging from paper to metal, as we demonstrate with several examples including a comparison of a real and simulated falling hat. This chapter is based on the publication by Eitan Grinspun, Anil Hirani, Mathieu Desbrun, and Peter Schr&ouml;der which appeared in the Proceedings of the Symposium for Computer Animation 2003, and on subsequent collaborations with the group of Denis Zorin at New York University and Zo&euml; Wood at Cal Poly San Luis Obispo.
Advanced placement computer science: the future of tracking the first year of instruction
Authors: Owen Astrachan, Henry Walker, Chris Stephenson, Lien Diaz, Jan Cuny
Venue: ACM SIGCSE Bulletin (2009)

The Advanced Placement (AP) Computer Science program is intended to reflect enough of a common core of a first semester or year of university-level computer science so that placement or credit can be awarded for work done before college. The SIGCSE symposia have a long history of providing forums for discussing the evolution of the AP program from its inception [1] to the transition from Pascal to C++ [3] to the transition from C++ to Java [2,5,7,8,9]. Panels related to how credit and placement are awarded have also been part of the SIGCSE conferences [4,6]. This special session is a report of the ongoing process of developing new and possible wide-ranging changes to the AP program.
Proceedings of the 2009 workshop on Foundations of aspect-oriented languages
Venue: Aspect-oriented software development (2009)

It is our great pleasure to welcome you to the Foundations of Aspect-Oriented Languages 2009 workshop. This year the workshop continues its tradition of being a major forum for presentation and discussion of recent research results on the formal underpinnings of aspect oriented programming languages. The call for papers attracted 12 submissions from Asia, Europe, North and South America. The program committee accepted 6 papers that cover topics ranging from fundamental issues of the semantics of AO languages to applications of formal methods for the safe composition of features.
Brief paper: H∞ functional filtering for stochastic bilinear systems with multiplicative noises
Authors: S. Halabi, H. Souley Ali, H. Rafaralahy, M. Zasadzinski
Venue: Automatica (Journal of IFAC) (2009)

This paper deals with the design of a reduced-order H"~ filter for a stochastic bilinear system with a prescribed H"~ norm criterion. The considered system is bilinear in control and with multiplicative noises in the dynamics and in the measurement equations. The problem is transformed into the search of a unique gain matrix by using Sylvester-like constraints. The approach is based on the resolution of LMI and is then easily implementable.
Study on the Technique and Error Analysis of Nonlinear Combining Forecasts Based Fuzzy System
Authors: Shi-ying Shi
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A combination forecasting method based on fuzzy logical system is presented in this paper. The main idea of this method is that the nonlinear combination forecasting function Ф(x) can be simulated by Takgi Sugeon fuzzy model. Not only the difficulty of constructing Ф(x) is reduced, but also the predicted precise is improved by the new combination forecasting method.
Stackelberg Routing in Arbitrary Networks
Authors: Vincenzo Bonifaci, Tobias Harks, Guido Schäfer
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We investigate the impact of Stackelberg routing to reduce the price of anarchy in network routing games. In this setting, an &alpha; fraction of the entire demand is first routed centrally according to a predefined Stackelberg strategy and the remaining demand is then routed selfishly by (nonatomic) players. Although several advances have been made recently in proving that Stackelberg routing can in fact significantly reduce the price of anarchy for certain network topologies, the central question of whether this holds true in general is still open. We answer this question negatively. We prove that the price of anarchy achievable via Stackelberg routing can be unbounded even for single-commodity networks. In light of this negative result, we consider bicriteria bounds. We develop an efficiently computable Stackelberg strategy that induces a flow whose cost is at most the cost of an optimal flow with respect to demands scaled by a factor of $1 + \sqrt{1-\alpha}$. Finally, we analyze the effectiveness of an easy-to-implement Stackelberg strategy, called SCALE. We prove bounds for a general class of latency functions that includes polynomial latency functions as a special case. Our analysis is based on an approach which is simple, yet powerful enough to obtain (almost) tight bounds for SCALE in general networks. This work was supported by the European Regional Development Fund (ERDF).
A VDD independent temperature sensor circuit with scaled CMOS process
Authors: H. Oshiyama, T. Matsuda, K. Suzuki, H. Iwata, T. Ohzone
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

A supply voltage (VDD) independent temperature sensor circuit by a standard 90 nm CMOS process achieves the predicted errors about &minus;1.0 to +2.0 &deg;C (&minus;0.6 to +0 &deg;C) for the temperature range of &minus;20 to +100 &deg;C (+20 to +80 &deg;C) for two-point calibration lines. This temperature sensor has a good tolerance to the change of VDD from 2.5 to 1.5 V, which corresponds to the measurement error of 0.9 &deg;C.
Optimal Control Approach to Robust Control of Nonlinear Systems Using Neural Network Based HJB solution
Authors: Dipak M. Adhyaru, I. N. Kar, M. Gopal
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, a Hamilton-Jacobi-Bellman (HJB) equation based optimal control algorithm for robust controller design, is proposed for a nonlinear system. Utilizing the Lyapunov direct method, controller is shown to be optimal with respect to a cost functional that includes maximum bound on system uncertainty. Controller is continuous and requires the knowledge of the upper bound of system uncertainty. In the proposed algorithm, Neural Network (NN) is used to find approximate solution of HJB equation. Proposed algorithm has been applied on a nonlinear uncertain system.
Opendda: a Novel High-Performance Computational Framework for the Discrete Dipole Approximation
Authors: James Mc Donald, Aaron Golden, S. Gerard Jennings
Venue: International Journal of High Performance Computing Applications (2009)

This work presents a highly optimized computational framework for the Discrete Dipole Approximation, a numerical method for calculating the optical properties associated with a target of arbitrary geometry that is widely used in atmospheric, astrophysical and industrial simulations. Core optimizations include the bit-fielding of integer data and iterative methods that complement a new Discrete Fourier Transform (DFT) kernel, which efficiently calculates the matrix-vector products required by these iterative solution schemes. The new kernel performs the requisite 3-D DFTs as ensembles of 1-D transforms, and by doing so, is able to reduce the number of constituent 1-D transforms by 60% and the memory by over 80%. The optimizations also facilitate the use of parallel techniques to further enhance the performance. Complete OpenMP-based shared-memory and MPI-based distributed-memory implementations have been created to take full advantage of the various architectures. Several benchmarks of the new framework indicate extremely favorable performance and scalability.