ppxscal/embedding_network huggingface dataset:
Evaluation of an E-learning Course in Biomedical Technology Management
Authors: P. Malataras, N. Pallikarakis
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

An e-learning course entitled "E-learning education in Management of Biomedical Technology" has been designed, developed, and delivered in Greece. The course was addressing a mixed group of attendees including biomedical engineers and technicians, as well as medical doctors and nurses. It has been delivered on the basis of blended Distance Learning Education, utilizing the Moodle open source platform. The course designed as a pilot case, aiming to assist the future implementation of similar courses in the field of Biomedical Technology in Greece .A three phase evaluation procedure has been conducted in order to be examined (a)the appropriateness of the asynchronous e-learning approaches for the dissemination of biomedical topics targeted to biomedical, technical and medical staff of the Greek hospitals (b)the maturity of potential users in the adaptation of distance e-learning courses(c)the design and delivery parameters of e-learning courses for university and continuous education purposes. The results of the evaluation activity are presented in this article.
Agent-oriented modeling of the dynamics of biological organisms
Authors: Catholijn M. Jonker, Jan Treur
Venue: Applied Intelligence (2007)

In this paper, the agent-oriented modeling perspective to cope with biological complexity is discussed. Three levels of dynamics can distinguished and related to each other: dynamics of externally observable agent behavior, dynamics of internal agent processes, and dynamics of multi-agent organisations. This paper addresses the first two. Basic agent concepts to describe externally observable agent behavior are introduced. In the context of two case studies on animal behavior and cell functioning, it is shown how these concepts can be used to specify dynamic properties. In addition, a number of basic agent concepts to describe an agent's internal processes are introduced. Also, these concepts are illustrated for specification of dynamic properties in the two case studies. Furthermore, the relationships between dynamic properties of externally observable behavior and dynamic properties of internal agent processes are addressed and illustrated for the animal and cell case studies.
Data-driven discourse modeling for semantic interpretation
Authors: J. Caminero-Gil, J. Alvarez-Cercadillo, C. Crespo-Casas, D. Tapias-Merino
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We propose a task-independent dialog controller that is able to work with different databases and tasks just changing a configuration file. This configuration file specifies a semantic tree for each task. The tree hierarchically organizes the information of the task and database, going from general concepts, towards more specific ones. So the dialogue controller is an inference engine that just follows the strategy specified in the data configuration file. We have defined four types of nodes that imply four different strategies. Moreover all output messages for each node in the tree are defined in the configuration file. So our message generator is task independent too. We have defined six different types of messages and two recovery strategies. Using this approach a system for information retrieval and voice commands has been built at Telefonica I+D.
Fast and High Precision Volume Haptics
Authors: Karljohan Lundin Palmerius
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Volume haptics has shown itself an effective way of enhancing precision and speed in interaction with medical or scientific visualization. This paper presents a mixed solver approach for the primitive-based volume haptics problem, to provide the best performance for every volume haptics application. For situations where the constraints are orthogonal we present a fast and high precision analytical solver. For complex configurations requiring support for non-orthogonal constraints we allow for fall-back on a numerical solver. The results show significantly improved performance with the analytical solver, allowing for higher stiffness and thus feedback of higher quality, while still allowing for transparent support for non-orthogonal constraints.
A multi-threaded server for shared hash table access
Authors: Andrej Vckovski, Jason Brazile
Venue: Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7 (2000)

This paper presents a multi-threaded socket server allowing access to shared hash tables. It is implemented using Tcl 8.1 multi-threading capabilities and runs multiple Tcl interpreters to service client requests. The application is designed as a pre-threaded server which allows a single working thread to handle many requests. The central shared data object is a hash table with structured values which allows access by all threads. Synchronization is based on a reader/writer lock implementation using the synchronization primitives available in Tcl, i.e., mutexes and condition variables. The application achieves insert rates that are significantly higher than what current commercial database management systems achieve. The usage of third-level language programming in C and application-specific scripting in Tcl allows a design based on a light-weight, robust kernel on the one hand and easily modifiable application-domain code on the other. The experiences with thread-safety and other threading features in Tcl 8.1 have been largely positive in this real-world application.
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Authors: Marc Waldman, Aviel D. Rubin, Lorrie Faith Cranor
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

We describe a system that we have designed and implemented for publishing content on the web. Our publishing scheme has the property that it is very difficult for any adversary to censor or modify the content. In addition, the identity of the publisher is protected once the content is posted. Our system differs from others in that we provide tools for updating or deleting the published content, and users can browse the content in the normal point and click manner using a standard web browser and a client-side proxy that we provide. All of our code is freely available.
Cooperative learning: effective teamwork for engineering classrooms
Authors: K. A. Smith
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A definition of cooperative learning and a brief overview of types of cooperative learning groups-informal, formal, and base, are presented. Essential elements of a well-structured formal cooperative learning group are considered along with the professor's role in structuring a problem-based cooperative learning group. A summary of research support for cooperative learning is also presented.
Blind equalization of multiuser CDMA channels: a frequency-domain approach
Authors: K. I. Diamantaras
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The blind estimation of mixing channels resulting from frequency selective fading and multipath in a multi-user CDMA system is an important problem in wireless communications. We present a novel frequency-domain approach using second order spectral statistics for recovering the unknown channels. Unlike other methods which are based on time-domain analysis we make no particular assumption about the support of the mixing channels except that they have finite length (FIR). The method is based on the fact that the source sequences obtain a known spectral color derived from the corresponding spreading code used in CDMA.
Spatially adaptive statistical modeling of wavelet image coefficients and its application to denoising
Authors: M. Kivanc Mihcak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper deals with the application to denoising of a very simple but effective "local" spatially adaptive statistical model for the wavelet image representation that was previously introduced successfully in a compression context. Motivated by the intimate connection between compression and denoising, this paper explores the significant role of the underlying statistical wavelet image model. The model used here, a simplified version of the one proposed by LoPresto, Ramchandran and Orchard (see Proc. IEEE Data Compression Conf., 1997), is that of a mixture process of independent component fields having a zero-mean Gaussian distribution with unknown variances /spl sigma//sub s//sup 2/ that are slowly spatially-varying with the wavelet coefficient location s. We propose to use this model for image denoising by initially estimating the underlying variance field using a maximum likelihood (ML) rule and then applying the minimum mean squared error (MMSE) estimation procedure. In the process of variance estimation, we assume that the variance field is "locally" smooth to allow its reliable estimation, and use an adaptive window-based estimation procedure to capture the effect of edges. Despite the simplicity of our method, our denoising results compare favorably with the best reported results in the denoising literature.
A Lightweight Taxonomy to Characterize Component-Based Systems
Authors: Holger M. Kienle, Hausi A. Muller
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

In this paper we propose a taxonomy to characterize component-based systems. The criteria of our taxonomy have been selected as a result of constructing a number of component-based software engineering tools within the Adoption-Centric Software Engineering project at the University of Victoria. We have applied the taxonomy in our work to characterize the resulting tools and to define the design space of our project's proposed tool-building methodology. Our taxonomy strives to capture the most important properties of component-based systems, resulting in a taxonomy that is both course-grained and lightweight. We believe that it is useful for other researchers in a number of ways, for instance, for component selection and to reason about certain quality attributes of components.
Derivative DFT Beamspace ESPRIT: a high performance closed-form 2-D arrival angle estimation algorithm
Authors: C. P. Mathews
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

This paper presents Derivative DFT Beamspace ESPRIT, a new closed-form algorithm for direction-of-arrival (DOA) estimation with uniform linear arrays or uniform rectangular arrays. The algorithm uses a novel virtual derivative DFT beamforming procedure to improve upon the performance of the recently developed DFT Beamspace ESPRIT algorithm. This beamforming procedure yields an additional invariance relationship which the algorithm exploits to obtain higher estimation accuracy (the algorithm is shown to outperform both DFT Beamspace ESPRIT and Unitary ESPRIT). Further, Derivative DFT Beamspace ESPRIT possesses all the attractive features (such as low computational complexity, and the ability to provide automatically paired source azimuth and elevation angle estimates) of the two aforementioned algorithms. 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
Distributed Grayscale Stereo Image Coding with Unsupervised Learning of Disparity
Authors: David Varodayan, Aditya Mavlankar, Markus Flierl, Bernd Girod
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Distributed compression is particularly attractive for stereo images since it avoids communication between cameras. Since compression performance depends on exploiting the redundancy between images, knowing the disparity is important at the decoder. Unfortunately, distributed encoders cannot calculate this disparity and communicate it. We consider the compression of grayscale stereo images, and develop an Expectation Maximization algorithm to perform unsupervised learning of disparity during the decoding procedure. Towards this, we devise a novel method for joint bitplane distributed source coding of grayscale images. Our experiments with both natural and synthetic 8-bit images show that the unsupervised disparity learning algorithm outperforms a system which does no disparity compensation by between 1 and more than 3 bits/pixel and performs nearly as well as a system which knows the disparity through an oracle.
Pervasive information: the key to 'true' mobility
Authors: S. Fallis, R. Payne, R. Limb, D. Allison
Venue: BT Technology Journal (2007)

Since Weiser's vision in 1991 for ubiquitous (also called pervasive) computing there has been little tangible progress towards it. However, over time the communications industry has begun to erode many of the hardware barriers to this vision. Even so, the utopia of pervasive computing remains out of reach, primarily as a result of the continued fixation with devices and connectivity as a way to realise mobility. However, it could be argued that users ultimately require access to information or content irrespective of the devices and connectivity around them. Consequently, pervasive information is seen as the key to true user mobility.This paper will introduce a potential secure pervasive information architecture that fits Weiser's vision, and position it with respect to a sub-set of current contenders for future systems from both academia and the telecommunications industry, and highlight their strengths and weaknesses.
A Tiny and Light-Weight Autonomic Element for Wireless Sensor Networks
Authors: Thais Braga, Fabricio Silva, Jose Marcos Nogueira, Antonio Loureiro, Linnyer Beatrys Ruiz
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

Autonomic networks are able to monitor and control themselves without direct human intervention. The smallest unit of an autonomic network is the autonomic element (AE). This work presents the model and evaluation of a specific wireless sensor network (WSNs) AE, called autonomic sensor element (ASE). The ASE has been proposed considering WSNs hardware, software, communication and energy restrictions.
Brute force attack on UNIX passwords with SIMD computer
Authors: Gershon Kedem, Yuriko Ishihara
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

As computer technology improves, the security of specific ciphers and one-way hash functions periodically must be reevaluated in light of new technological advances. In this paper we evaluate the security of the UNIX password scheme. We show that the UNIX password scheme is vulnerable to brute-force attack. Using PixelFlow, a SIMD parallel machine, we are able to "crack" a large fraction of passwords used in practice [12] in 2-3 days of computation. We explain how a SIMD machine built in today's technology could "crack" any UNIX password in two days. We also describe in this paper a simple modification to the UNIX password scheme that makes it harder to break encrypted passwords using dictionary and brute force attack, thus extending the useful life of the UNIX password scheme. The modified password scheme is compatible with the existing password scheme.
Performance analysis of a non-homogeneous GPS system under Markov modulated fluid traffic
Authors: S. Khorsandi, M. H. Radfar
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper presents a near-exact analysis of the generalized processor sharing (GPS) scheduler under Markov modulated fluid sources (MMFS). Due to the complexity of the GPS system, all previous works are based on so called bounding approach providing upper bound using deterministic analysis or decomposition techniques. These bounds are in general quite loose and result in overly conservative resource provisioning. In this paper, a novel approach is used to obtain near-exact solutions for the queue length distribution of each session. The analysis applies to the general case of N parallel queues with multi-class non-homogeneous sources and non-rate-proportional weight setting of sessions. Numerical results for traffic engineering under various system and traffic parameters are reported.
Electronic commerce on the move
Authors: John du Pré Gauntt
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

This paper will address some of the business factors and technical developments that are driving electronic commerce in mobile telecommunications. The trend towards mass-market penetration coupled with increased processing power in the handset are evolving mobile networks into one of the primary e-commerce platforms in Europe. The author will introduce two European pilot programs where the mobile handset-instead of a dedicated PC-is the vehicle for digital transactions. One program known as Smart Access is a service model that uses electronic cash, while a second model in Finland employs intelligent network technology to allow the user to 'Dial-a-Coke' from a vending machine and settle the transaction on their monthly telephone bill. The next section will introduce an aspect of third generation mobile systems known as the Virtual Home Environment (VHE). The VHE is widely considered to be that part of the network architecture where mobile electronic commerce applications or services could reside. The last section will conclude with a comment about mobile electronic commerce.
Sampling from large matrices: An approach through geometric functional analysis
Authors: Mark Rudelson, Roman Vershynin
Venue: Journal of the ACM (JACM) (2007)

We study random submatrices of a large matrix A. We show how to approximately compute A from its random submatrix of the smallest possible size O(rlog r) with a small error in the spectral norm, where r &equals; &Verbar;A&Verbar;2F/&Verbar;A&Verbar;22 is the numerical rank of A. The numerical rank is always bounded by, and is a stable relaxation of, the rank of A. This yields an asymptotically optimal guarantee in an algorithm for computing low-rank approximations of A. We also prove asymptotically optimal estimates on the spectral norm and the cut-norm of random submatrices of A. The result for the cut-norm yields a slight improvement on the best-known sample complexity for an approximation algorithm for MAX-2CSP problems. We use methods of Probability in Banach spaces, in particular the law of large numbers for operator-valued random variables.
Efficient Classloading Strategies for Interprocedural Analyses in the Presence of Dynamic Classloading
Authors: Kyungwoo Lee, Qasim Ali, Samuel P. Midkiff
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

In the presence of dynamic classloading, performing interprocedural analysis (IPA) too early can lead to repeatedly performing the IPA as new classes are loaded, while performing it too late will cause a performance degradation by running unoptimized code for too long. This paper investigates how programs load classes and how this affects the performance when performing IPA. From this investigation, two classloading techniques are described and evaluated. We first describe a classloader that eagerly preloads classes whose names appear in the constant pool. By loading classes as early as possible, the preloading classloader reduces the chances of new classes being loaded after an IPA is performed, and thus can improve performance by reducing the number of IPAs performed. We next describe a technique that delays the IPA, causing it to be performed late enough to dramatically reduce the need for re-analyses and early enough to obtain the benefits of the IPA. When these two classloading techniques are used with a real IPA . an escape analysis to enforce sequential consistency in Java programs . the speedups relative to the default nonpreloading classloader are 1.87 and 2.30 respectively, on average.
An historical overview of stable probability distributions in signal processing
Authors: B. W. Stuck
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An historical, personal and idiosyncratic overview of stable probability distributions in signal processing is presented.
Handwritten word recognition using dynamic matching with variable duration
Authors: G. Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

A fast matching algorithm using dynamic programming for handwritten word recognition is presented. The variable duration for each character is defined based on the character segmentation statistics obtained during the training phase. The variable duration represents the possible ways in which a character image can be split into segments. Experimental results prove that our approach using the variable duration outperforms the method using fixed duration in terms of both accuracy and speed. The processing time for the matching process increases at the rate of log(N) as the lexicon size N increases. A speed of 200 msec, including image handling procedures, on a single Sparc 10 platform and a recognition accuracy of 96.7% are achieved for a lexicon size of 10.
Text Mining in Radiological Data Records: An Unsupervised Neural Network Approach
Authors: William Claster, Subana Shanmuganathan, Nader Ghotbi
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The rapid growth in digitalized medical records presents new opportunities for coalescing terra bytes of data into information that could provide us with new knowledge. The knowledge discovered as such could assist medical practitioners in a myriad of ways, for example in selecting the optimal diagnostic tool from among many possible choices. We analyzed the radiology department records of children who had undergone a CT scanning procedure at Nagasaki University Hospital in the year 2004. We employed Self Organizing Maps (SOM), an unsupervised neural network based text-mining technique for the analysis. This approach led to the identification of keywords within the narratives accompanying the medical records that could contribute to reduction of unnecessary CT requests by clinicians. This is important because overuse of medical radiation poses significant health risks to children in spite of the invaluable diagnostic capacity of such procedures.