ppxscal/embedding_network huggingface dataset:
Low Cost HIV Testing System for Tele-Health Applications
Authors: Ali El Kateeb, Lubna Al Azzawi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

We are presenting a low-cost HIV testing system that can provide very accurate blood testing. The system analyzed the images that appear on the quick HIV testing kits that become available in last few years. We have used a System-On-Chip (SOC) reconfigurable technology that based on Field Programmable Gate Array (FPGA) in implementing the system's prototype. The system used a CMOS digital camera to capture the image and FPGA Xilinx Virtex chip to process the captured image and send the testing results to the display unit. The system can be used in small clinics and pharmacies and eliminates the need for trained technicians. The system can be supported with a communication channel to transfer results to medical centers and hospitals to provide patients screening and provide medical advices to patients. The system has been tested successfully and the testing results shows that the system accuracy reach 100%.
Platform for the Development of Control, Vision and Navigation Techniques with the use of Multiple Sensors
Authors: L. V. B. Machado Neto
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The aim of the paper is to present the Group of Studies in Automation and Robotics of the Polytechnic Institute of PUC Minas in Brazil and the new project "Platform for the Development of Control, Vision and Navigation Techniques with the use of Multiple Sensors". This hands-on project forms part of the National Program for Engineering Development of the Brazilian Government.
Bayesian multiscale tomographic reconstruction
Authors: R. D. Nowak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper describes a new Bayesian modeling and analysis method for emission computed tomography based on a novel multiscale framework. The class of multiscale priors has the interesting feature that the "non-informative" member yields the traditional maximum likelihood solution; other choices are made to reflect prior belief as to the smoothness of the unknown intensity. Remarkably, this Bayesian multiscale framework admits a novel maximum a posteriori (MAP) reconstruction procedure using an expectation-maximization (EM) algorithm, in which the EM update equations have simple, closed-form expressions. The potential of this new framework is assessed using the Zubal brain phantom and simulated SPECT studies.
Self Management and the Future of Software Design
Authors: Peter Van Roy
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace to manage this fragility. But today there is a new challenge. Complexity is increasing rapidly as a result of two factors: the increasing use of distributed systems as a result of the sufficient reliability and bandwidth of the Internet, and the increasing scale of these systems as a result of the addition of many new computers to the Internet (e.g., mobile phones and other devices). To manage this new complexity, we propose an approach based on self-managing systems: systems that can maintain useful functionality despite changes in their environment. The paper motivates this approach and gives some ideas on how to build general self-managing software systems. An important part of the approach is to build systems as hierarchies of interacting feedback loops. We give examples of these systems and we deduce some of their design rules. The SELFMAN project is elaborating these ideas into a programming methodology and an implementation.
An Ontological Model for Knowledge Management through Concept Composition
Authors: Maryam Tayefeh Mahmoudi, Kambiz Badie, Kourosh Neshatian
Venue: Proceedings of the First International Conference on the Digital Society (2007)

In this paper, an ontology model is proposed for developing new concepts in the realm of Enterprise Knowledge Management via applying an approach called concept composition. Regarding this, when two concepts are composed, the corresponding nodes in the ontologies of their Basics, become subject to conjunction using some rules. The new ontology obtained in this way, can be proposed as an alternative concept for future applications. The proposed approach can, in the meantime, be used successfully for visualizing enterprise concepts from the viewpoint of other concepts; a fact which is quite essential to enterprise knowledge management.
Learning state-action basis functions for hierarchical MDPs
Authors: Sarah Osentoski, Sridhar Mahadevan
Venue: Proceedings of the 24th international conference on Machine learning (2007)

This paper introduces a new approach to action-value function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper extends previous work on using Laplacian bases for value function approximation by using the actions of the agent as part of the representation when creating basis functions. The approach results in a nonlinear learned representation particularly suited to approximating action-value functions, without incurring the wasteful duplication of state bases in previous work. We discuss two techniques to create state-action graphs: off-policy and on-policy. We show that these graphs have a greater expressive power and have better performance over state-based Laplacian basis functions in domains modeled as Semi-Markov Decision Processes (SMDPs). We present a simple graph partitioning method to scale the approach to large discrete MDPs.
Lossless filter banks based on two point transform and interpolative prediction
Authors: K. Komatsu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In this paper, we present a method for designing lossless versions of two-channel FIR filter banks. We demonstrate that equal length PR FIR filter banks can be decomposed into 2-point transforms and unequal length filter banks into interpolative predictions. The lossless versions of the filter banks are obtained by replacing every constituent module by the corresponding lossless version. This method allows construction of the lossless versions of filter banks with arbitrary filter length. Lossless versions of several filter banks are designed and they are found to yield good performance for lossless image compression.
Creating product development and research teams in a classroom setting
Authors: W. B. Kuhn
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

University professors are expected to hold down (at least) two main jobs-teaching and research-sometimes at the expense of performing less than optimally on one or the other. In this work-in-progress, we are exploring the concept of combining teaching and research activities in the classroom to improve quality and productivity in both areas. The combination is being addressed by incorporating research tasks and results into a product design course. The evolution of such courses is overviewed and references to Web resources are provided for those interested in exploring the subject in more depth.
Hybrid multiplier/CORDIC unit for online handwriting recognition
Authors: S. McInerney
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Traditionally online handwriting recognition (OHR) implementations use general-purpose processor architectures. The pre-processing step of OHR comprises regular array-based tasks such as normalisation, feature extraction and segmentation. Standard processor architectures cannot however efficiently support the varied arithmetic operations required by pre-processing. These tasks would seem ideally suited for custom hardware acceleration. CORDIC offers all the required elementary functions for pre-processing but is inefficient for linear mode operations (multiplication/division) due to its serial nature. A hybrid multiplier/CORDIC architecture is proposed in which a fast iterative multiplier/MAC shares hardware with a serial CORDIC unit. This multiplier retires 6b/cycle with minor additional hardware requirements. This hybrid offers improved general performance for signal-processing applications and is targeted at the pre-processing task of OHR. Performance results are included.
Performance Evaluation of a Multi-Stage Network Event Detection Scheme for Decreasing the False-Positive Rate for a Large Number of Simultaneous, Unknown Events
Authors: Tutomu Murase, Hiroki Fujiwara, Yukinobu Fukushima, Masayoshi Kobayashi, Tokumi Yokohira
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Change-point detection schemes are a promising approach for detecting network anomalies, such as attacks and epidemics by unknown viruses and worms. They detect those events as change-points. However, they generally also detect false-positive change-points, those caused by other events such as hardware trouble. A scheme is needed that only detects true-positive change-points, caused by attacks and epidemics. True-positive change-points tend to occur simultaneously in very large numbers, while false-positive change-points tend to occur sporadically. We can exclude false-positive change-points by excluding change-points that occur sporadically, based on information gathered from the entire network. In this paper, we propose a multi-stage network event detection scheme that aggregates change-point information from distributed IDSs (Intrusion Detection Systems) and detects the true-positive change-points. Simulation results show that, compared to a scheme using only one IDS, our method always yields a smaller false-positive rate under the constraint that the detection rate of the true-positive change-points must exceed 0.99.
Application to locally optimum detection of a new noise model
Authors: A. Tesei
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The authors discuss the need to provide a realistic model of a generic noise probability density function (PDF), in order to optimize the signal detection in non-Gaussian environments. The target is to obtain a model depending on a few parameters (that are quick and easy to estimate), and is so general that it is able to describe many kinds of noise (e.g., symmetric or asymmetric, with variable sharpness). To this end, a new HOS-based model is introduced, which is derived from the generalized Gaussian function, and depends on three parameters: kurtosis, for representing variable sharpness, and left and right variances (whose combination provides the same information of skewness) for describing the deviation from symmetry. This model is applied to the design of a locally optimum detection (LOD) test. Promising experimental results are presented which are derived from the application of the test to detecting signals corrupted by real underwater acoustic noise.
Interrupt Verification via Thread Verification
Authors: John Regehr, Nathan Cooprider
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Most of the research effort towards verification of concurrent software has focused on multithreaded code. On the other hand, concurrency in low-end embedded systems is predominantly based on interrupts. Low-end embedded systems are ubiquitous in safety-critical applications such as those supporting transportation and medical automation; their verification is important. Although interrupts are superficially similar to threads, there are subtle semantic differences between the two abstractions. This paper compares and contrasts threads and interrupts from the point of view of verifying the absence of race conditions. We identify a small set of extensions that permit thread verification tools to also verify interrupt-driven software, and we present examples of source-to-source transformations that turn interrupt-driven code into semantically equivalent thread-based code that can be checked by a thread verifier. Finally, we demonstrate a proof-of-concept program transformation tool that converts interrupt-driven sensor network applications into multithreaded code, and we use an existing tool to find race conditions in these applications.
Distributed Flow Monitoring Tool Using Network Processor
Authors: Yoshinori Kitatsuji, Satoshi Katsuno, Katsuyuki Yamazaki, Masato Tsuru, Yuji Oie
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

There is an emerging requirement for real-time flow-based traffic monitoring, which is vital for quality of service (QoS) monitoring, anomaly monitoring, and traffic engineering in Internet Service Provider networks. In this report, we discuss a distributed architecture for real-time and scalable flow monitoring tools and implement a prototype tool using Network Processor (NP). The contributions of the present paper are two-folds. First, we clarify the elemental functions that are required and commonly used by passive flow monitoring tools, and refine a distribution-processing architecture for combining these functions based on our previous work in order to cope with heavy-load input traffic. Second, we implement the packet distribution component, which plays a core role and might be bottleneck in the proposed architecture, by using pipeline-mode NP hardware, and experimentally prove its applicability to 10 Gbit/s-class input traffic.
Racing algorithms for conditional independence inference
Authors: Remco R. Bouckaert, Milan Studený
Venue: International Journal of Approximate Reasoning (2007)

In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L using the independence implication provided by the method of structural imsets. We present two algorithmic methods which have the interesting complementary properties that one method performs well to prove that t is implied by L, while the other performs well to prove that t is not implied by L. However, both methods do not well perform the opposite. This gives rise to a parallel algorithm in which both methods race against each other in order to determine effectively whether t is or is not implied. Some empirical evidence is provided that suggests this racing algorithms method performs considerably better than an existing method based on so-called skeletal characterization of the respective implication. Furthermore, unlike previous methods, the method is able to handle more than five variables.
Carbon: architectural support for fine-grained parallelism on chip multiprocessors
Authors: Sanjeev Kumar, Christopher J. Hughes, Anthony Nguyen
Venue: ACM SIGARCH Computer Architecture News (2007)

Chip multiprocessors (CMPs) are now commonplace, and the number of cores on a CMP is likely to grow steadily. However, in order to harness the additional compute resources of a CMP, applications must expose their thread-level parallelism to the hardware. One common approach to doing this is to decompose a program into parallel "tasks" and allow an underlying software layer to schedule these tasks to different threads. Software task scheduling can provide good parallel performance as long as tasks are large compared to the software overheads. We examine a set of applications from an important emerging domain: Recognition, Mining, and Synthesis (RMS). Many RMS applications are compute-intensive and have abundant thread-level parallelism, and are therefore good targets for running on a CMP. However, a significant number have small tasks for which software task schedulers achieve only limited parallel speedups. We propose Carbon, a hardware technique to accelerate dynamic task scheduling on scalable CMPs. Carbon has relatively simple hardware, most of which can be placed far from the cores. We compare Carbon to some highly tuned software task schedulers for a set of RMS benchmarks with small tasks. Carbon delivers significant performance improvements over the best software scheduler: on average for 64 cores, 68% faster on a set of loop-parallel benchmarks, and 109% faster on aset of task-parallel benchmarks.
High quality navigation in computer games
Authors: D. Nieuwenhuisen, A. Kamphuis, M. H. Overmars
Venue: Science of Computer Programming (2007)

Navigation plays an important role in many modern computer games. Currently the motion of entities is often planned using a combination of scripting, grid-search methods, local reactive methods and flocking. In this paper we describe a novel approach, based on a technique originating from robotics, that computes a roadmap of smooth, collision-free navigation paths. Because the vast amount of computation time is spent in the pre-processing phase, navigation during the execution of an application is almost instantaneous. The created roadmap can be queried to obtain high quality paths. Furthermore, the applications of the roadmap are not limited to navigating an entity. Therefore, besides navigation for an entity, two other applications are presented; one for planning the motion of groups of entities and one for creating smooth camera movements through an environment. All applications are based on the same underlying techniques.
Personal and wireless communications and the BSEE curriculum
Authors: L. S. Nagurney
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The personal and wireless communication industry is expected to be a major employer of electrical engineers in the future. One only has to look at the current array of cellular telephones to envision the technologies necessary for their design. These include communication theory, digital signal processing, RF design, monolithic IC design, VLSI, battery technology, and antenna design. Coupled with these technologies are the manufacturing needs of flexible PC board design, EMC compatibility issues, electromagnetic safety issues, and the human factors needs of mechanical design and human interfaces. We compare these industrial needs to the standard BSEE curriculum. We discuss modifications to current courses and possible new courses. We conclude with a projection of a personal and wireless communications curriculum.
A lower bound on the order of regular graphs with given girth pair
Authors: C. Balbuena, T. Jiang, Y. Lin, X. Marcote, M. Miller
Venue: Journal of Graph Theory (2007)

The girth pair of a graph gives the length of a shortest odd and a shortest even cycle. The existence of regular graphs with given degree and girth pair was proved by Harary and Kov&aacute;cs [Regular graphs with given girth pair, J Graph Theory 7 [1983], 209&ndash;218]. A (&delta;, g)-cage is a smallest &delta;-regular graph with girth g. For all &delta;&thinsp;&ge;&thinsp;3 and odd girth g&thinsp;&ge;&thinsp;5, Harary and Kov&aacute;cs conjectured the existence of a (&delta;,g)-cage that contains a cycle of length g&thinsp;+&thinsp;1. In the main theorem of this article we present a lower bound on the order of a &delta;-regular graph with odd girth g&thinsp;&ge;&thinsp;5 and even girth h&thinsp;&ge;&thinsp;g&thinsp;+&thinsp;3. We use this bound to show that every (&delta;,g)-cage with &delta;&thinsp;&ge;&thinsp;3 and g&thinsp;&isin;&thinsp;&lcub;5,7&rcub; contains a cycle of length g&thinsp;+&thinsp;1, a result that can be seen as an extension of the aforementioned conjecture by Harary and Kov&aacute;cs for these values of &delta;, g. Moreover, for every odd g&thinsp;&ge;&thinsp;5, we prove that the even girth of all (&delta;,g)-cages with &delta; large enough is at most (3g&thinsp;-&thinsp;3)&#x002F;2. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 153&ndash;163, 2007
Virtual Knee Joint Replacement Surgery System
Authors: S. H. Park, Y. S. Yoon, L. H. Kim, S. H. Lee, M. Han
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

In this paper, we present a virtual surgery of total knee replacement based on a mechanical CAD software. The virtual surgery is implemented using basic functions of the CAD software such as shape modeling, assembly, automation, database access, and so on. By simulating the surgical processes in advance, the system allows a surgeon to determine the amount and the angle of bone resection and choose the artificial knee joint which fits the patient's knee accurately before the real operation. In addition, a surgeon can reduce time and mistakes to choose artificial knee joints and perform the operation effectively. In the future, the system can be applied for a knee joint navigation system and a surgery training/evaluation system.
Managing Diagnostic Process Data Using Semantic Web
Authors: Vili Podgorelec, Luka Pavlic
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In the paper the use of semantic web technologies for managing medical information during a diagnostic process is studied. Following a steady international move towards optimization of health care delivery, the latest development in information technology has drawn the health care industry decision makers' attention. The introduction of proper information technology innovations within the health care processes should provide the necessary optimization. In this manner we propose an approach to manage medical data during the whole diagnostic process using the semantic web technologies.
Integrated team design
Authors: W. D. Lane, A. H. Sayles
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The purpose of the United States Military Academy at West Point is to provide the nation with leaders of character who serve the common defense. In helping to prepare these future leaders for their service to the nation and to the US Army, the Department of Electrical Engineering and Computer Science is chartered to provide a five-course electrical engineering sequence. The purpose of this sequence is to have cadets learn the engineering thought process that culminates with solving an engineering design problem. In addition, the department provides instruction for an ABET-accredited major in electrical engineering. As part of this program, cadets participate in a comprehensive capstone design project. This paper details a unique Military Academy program that provides an integrated design experience for students from both the core engineering sequence and the electrical engineering majors' program. By bringing both groups of electrical engineering students together into a single team to accomplish a significant design effort, substantial experience is gained by all. This integrated team approach has proven to be a positive learning experience for both groups, as well as for majors from other disciplines in a design team effort.
User-mode Linux
Authors: Jeff Dike
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

User-mode Linux [2](UML) is the port of the Linux kernel to Linux. It implements a Linux virtual machine running on a Linux host. Its hardware is virtual, being constructed from resources provided by the host. UML can run essentially any application that can run on the host. The design and implementation of UML has been previously described[1]. This paper will describe the work that has taken place during the last year, including changes to what was described in the previous paper. This paper will also discuss new applications of UML involving integration of the virtual and host environments, along with other possibilties such as using UML as a clustering platform.