ppxscal/embedding_network huggingface dataset:
An EHR-Based Multi-Site Recruiting System for Clinical Trials
Authors: Massoud Vahabzadeh, Jia-Ling Lin, Mustapha Mezghanni, Carlo Contoreggi, Michelle Leff
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Optimizing screening and evaluation process is essential in maximizing recruiting potential participants into clinical trials. We developed a clinical recruiting system used in the management of human research studies whereby recruiting for various protocols are conducted at multiple sites by different groups with process interdependencies. The system is developed based on a multi-tier architecture with a series of real-time and on-demand decision support systems to increase the efficiency of screening and evaluation of participants during a recruiting process. It simulates various conditions by using derivation rules and recruiting templates for automatic generation of checklists in order to recommend the optimum selection rules based on existing participants' data and is seamlessly integrated into our large Human Research Information System, a comprehensive electronic health record (EHR) system for research participants.
Feature significance in generalized additive models
Authors: B. Ganguli, M. P. Wand
Venue: Statistics and Computing (2007)

This paper develops inference for the significance of features such as peaks and valleys observed in additive modeling through an extension of the SiZer-type methodology of Chaudhuri and Marron (1999) and Godtliebsen et al. (2002, 2004) to the case where the outcome is discrete. We consider the problem of determining the significance of features such as peaks or valleys in observed covariate effects both for the case of additive modeling where the main predictor of interest is univariate as well as the problem of studying the significance of features such as peaks, inclines, ridges and valleys when the main predictor of interest is geographical location. We work with low rank radial spline smoothers to allow to the handling of sparse designs and large sample sizes. Reducing the problem to a Generalised Linear Mixed Model (GLMM) framework enables derivation of simulation-based critical value approximations and guards against the problem of multiple inferences over a range of predictor values. Such a reduction also allows for easy adjustment for confounders including those which have an unknown or complex effect on the outcome. A simulation study indicates that our method has satisfactory power. Finally, we illustrate our methodology on several data sets.
An integrated junior-year laboratory based on an autonomous mobile robot platform
Authors: J. Y. Hung
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

In the Fall 1997 quarter, the Department of Electrical Engineering (EE) at Auburn University implemented a new curriculum model. A significant feature of the new curriculum is a set of 6 core laboratories, occurring over the sophomore and junior years. Unlike prior EE laboratories that are closely aligned with a specific course topic, the new core laboratories are designed to present EE topics in an integrated, multidisciplinary fashion. In this paper, the author describes one of the junior-year laboratory courses, "EE 305-Laboratory V". The EE 305 laboratory course appears in the students' second quarter of the junior year, and is based on a design problem in which teams of 2-3 students attempt to design and fabricate an electronic control system for a small autonomous mobile robot. Topics from several EE subdisciplines are studied as students attack the design project. In addition to reinforcing concepts from earlier and concurrent courses, the course serves as a platform for exposing students to topics that appear in greater depth in later courses, including electives. Also, students mature in areas such as oral and written communication, awareness of professional ethics issues, and working effectively in a team-based setting. 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
Generalized anti-Hebbian learning for source separation
Authors: Hsiao-Chun Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

The information-theoretic framework for source separation is highly suitable. However the choice of the nonlinearity or the estimation of the multidimensional joint probability density function are nontrivial. We propose here a generalized Gaussian model to construct a generalized blind source separation network based on the minimum entropy principle. This new separation network can suppress the interference to a significant amount compared to the traditional LMS-echo-canceler. The simulation is given to show the disparity of the performance as a varies. Finally how to choose the appropriate a in our generalized anti-Hebbian rule is discussed.
Non-uniform filter banks based on a multi-prototype cosine modulation
Authors: F. Argenti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

A method of designing non-uniform FIR filter banks is presented. It is based on the cosine modulation of more than one prototype, having different passbands. The method aims at the cancellation of the main component of aliasing: this imposes constraints on the prototypes, which become dependent of each other. The method is simple and requires numerical optimization only for the narrowest prototype, being the others derived in a straightforward way from this one. For this reason, the method seems particularly suitable when banks with a large number of coefficients must be designed.
High Performance Seamless Channel Transition Video-Broadcasting Scheme
Authors: Yong Wang, Junzhong Gu, Kai-Zhong Jiang, Zi-Cheng Li
Venue: Proceedings of the First International Conference on the Digital Society (2007)

In VOD system, allocating more bandwidths to broadcast hotter videos, the minimization of average client waiting time will be archived. But the hot degree of videos is changed dynamically. Now, there are only a few schemes with the capability of changing the bandwidth allocated to broadcast a video (also called channel transition) seamlessly and dynamically, such as SFB, SFB-With Preload, and SSB etc. But all of them are derived from Fast Broadcasting scheme, and have the same limit of low bandwidth utilization ratio. It can effectively improve the bandwidth utilization ratio that using lower channel bandwidth than video's playing rate, such as Greedy Equal Bandwidth Broadcasting (GEBB) scheme and Poly-Harmonic Broadcasting (PHB) etc, but they do not change the bandwidth seamlessly and dynamically. Base on the characteristics, this paper proposed a new scheme, High Performance Seamless Channel Transition Video-Broadcasting scheme (HPSCT) with scalability and higher performance. Furthermore, with adoption of additional channels, the process of channel transition in HPSCT is transparent to clients and easier to be realized. The analysis of performance shows that HPSCT with scalability is more bandwidth-effective.
A Brief Survey of Distributed Computational Toys
Authors: Eric Schweikardt, Mark D. Gross
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

Distributed Computational Toys are physical artifacts that function based on the coordination of more than one computing device. Often, these toys take the form of a microcontroller network embedded in a children's construction kit. We present a survey of Distributed Computational Toys. Although most of the toys we surveyed were built in the last five years and exist only as research projects, they build on the rich history of Constructivism, Constructionism and Kinesthetic Learning. Projects are tagged according to their structure, status, and intended functionality: Construction Kits, Physical Programming, and Cellular Automata.
Measuring conference quality by mining program committee characteristics
Authors: Ziming Zhuang, Ergin Elmacioglu, Dongwon Lee, C. Lee Giles
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Bibliometrics are important measures for venue quality in digital libraries. Impacts of venues are usually the major consideration for subscription decision-making, and for ranking and recommending high-quality venues and documents. For digital libraries in the Computer Science literature domain, conferences play a major role as an important publication and dissemination outlet. However, with a recent profusion of conferences and rapidly expanding fields, it is increasingly challenging for researchers and librarians to assess the quality of conferences. We propose a set of novel heuristics to automatically discover prestigious (and low-quality) conferences by mining the characteristics of Program Committee members. We examine the proposed cues both in isolation and combination under a classification scheme. Evaluation on a collection of 2,979 conferences and 16,147 PC members shows that our heuristics, when combined, correctly classify about 92% of the conferences, with a low false positive rate of 0.035 and a recall of more than 73% for identifying reputable conferences. Furthermore, we demonstrate empirically that our heuristics can also effectively detect a set of low-quality conferences, with a false positive rate of merely 0.002. We also report our experience of detecting two previously unknown low-quality conferences. Finally, we apply the proposed techniques to the entire quality spectrum by ranking conferences in the collection.
Competitive baseline methods set new standards for the NIPS 2003 feature selection benchmark
Authors: Isabelle Guyon, Jiwen Li, Theodor Mader, Patrick A. Pletscher, Georg Schneider, Markus Uhr
Venue: Pattern Recognition Letters (2007)

We used the datasets of the NIPS 2003 challenge on feature selection as part of the practical work of an undergraduate course on feature extraction. The students were provided with a toolkit implemented in Matlab. Part of the course requirements was that they should outperform given baseline methods. The results were beyond expectations: the student matched or exceeded the performance of the best challenge entries and achieved very effective feature selection with simple methods. We make available to the community the results of this experiment and the corresponding teaching material [Anon. Feature extraction course, ETH WS 2005/2006. http://clopinet.com/isabelle/Projects/ETH]. These results also provide a new baseline for researchers in feature selection.
Homes that make us smart
Authors: Alex S. Taylor, Richard Harper, Laurel Swan, Shahram Izadi, Abigail Sellen, Mark Perry
Venue: Personal and Ubiquitous Computing (2007)

In this article we consider what it should mean to build "smartness" or "intelligence" into the home. We introduce an argument suggesting that it is people who imbue their homes with intelligence by continually weaving together things in their physical worlds with their everyday routines and distinct social arrangements. To develop this argument we draw on four ongoing projects concerned with designing interactive surfaces. These projects illustrate how, through the use of surfaces like fridge doors and wall displays, and even bowl shaped surfaces, we keep in touch with one another, keep the sense of our homes intact, and craft our homes as something unique and special. Intelligence, here, is seen to be something that emerges from our interactions with these surfaces--seen in the thoughtful placement of things throughout the home's ecology of surfaces. IT for the home is thus understood less as something to be designed as intelligent and more as a resource for intelligence.
Physically Based Sound Synthesis for Large-Scale Virtual Environments
Authors: Nikunj Raghuvanshi, Ming C. Lin
Venue: IEEE Computer Graphics and Applications (2007)

Recorded sound clips have two main drawbacks. First, the sound generated is repetitive. Real sounds depend on how objects collide and where impact occurs, and prerecorded sound clips fail to capture such factors. Second, recording original sound clips for all the sound events in a virtual environment is a labor-intensive and tedious process. Physically based sound synthesis, on the other hand, can automatically capture the subtle shift of tone and timbre due to factors such as change in impact location, material property, and object geometry. The authors describe several techniques for accelerating sound simulation, thereby enabling realistic, physically based sound synthesis for large-scale virtual environments.
Modeling of a Horizontal Active Magnetic Bearing System with Uncertainties in Deterministic Form
Authors: Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Halim Mohd Yatim
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

A Mobile Ad hoc NETwork (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET, but most studies have not focused on the limitations of battery resource. To alleviate these problems, a new routing protocol called Energy-Aware Grid Multipath Routing (EAGMR) protocol is proposed. The proposed protocol can conserve energy and provide the best path to route according to probability. Simulation results indicate that this new energy-aware protocol can save energy of mobile hosts and improve data packet delivery ratio.
An investigation of interactional coherence in asynchronous learning environments
Authors: Laurie P. Dringus
Venue:  (2007)

Numerous studies have affirmed the value of asynchronous online communication as a learning resource. Several investigations, however, have indicated that discussions in asynchronous environments are often neither interactive nor coherent. This research sought to develop an enhanced understanding of interactional coherence in asynchronous learning environments. The study used Rhetorical Structure Theory (RST) to analyze and assess the coherence of a several asynchronous discussions. The analysis revealed that the discussions were structurally dynamic. While RST structures resulting from static documents are acyclic tree-shaped structures, the rhetorical networks representing asynchronous threads are frequently cyclic. Thus, the analysis required a modified form of RST based on reduced constraints and restricted schemas. By this means, it was possible to create structural models of the discussions. These models were used to investigate asynchronous argumentation and topic drift and to perform a comparative analysis of multiple discussions. The investigation found argumentation was more prevalent in some groups than others. In one group the analysis indicated the dominant mode of interaction was disagreement; in another group, argumentation was generally constructive; and in a third group, argumentation tended to be supportive and concessive. The investigation found that topic drift does not occur as a matter of chance. Participants use topic drift in order to adapt discussion to a topic of preference. As such, topics do not drift so much as they are pushed and pulled. A consequence of this process is that threads often begin with a strong research-based opening message, but descend to anecdotes and personal commentary. The conferencing systems used for the discussions were similar in their features, but the discussions differed, particularly in their use of threading. In one group, less than half of the messages were threaded, with the remainder posted as singletons. In other groups most of the messages were in threads. This research provides a framework and a terminology for fine-grained analysis of interactional coherence. By showing the applicability of RST to asynchronous discussion, the study has offered evidence that assessment technology could be developed for online discussions. In addition, the development of rhetorical networks as a directed graph theory for representing the semantics of asynchronous interaction could lead to new knowledge representation technologies for multi-agent collaboration systems.
Decoupled estimation of DOA and coherence loss for multiple sources in uncertain propagation environments
Authors: J. Ringelstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The problem of direction of arrival (DOA) estimation of multiple sources is addressed considering possible coherence loss along the impinging wavefronts. The loss results from wave propagation through a fluctuating medium and leads to a decreasing signal correlation from sensor to sensor. Two new algorithms are proposed that are significantly less computationally complex than the well known covariance matching (CM) approach. Furthermore a polynomial approximation of the coherence loss parameters is introduced, which pen-nits a decoupling of the DOA estimation from the estimation of all other parameters. The proposed algorithms and theoretical results are verified by numerical examples.
A Distributed Load Balancing Scheme for Data Parallel Applications
Authors: Walid R. Tout, Sakti Pramanik
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

In data parallel applications, a major source of load trnbalance is in the uneven didribtitton of data between the nodes. The majar contribution of this paper is the analysis o j a new distributed Ioad balancing scheme based on random probing. Sequential probing was shown to create hot spot problems. Random probing, on the other hand, avoids these hot spots problems. We hove modeled this load balancing scheme bath anaiytically and experimentally. Distributed Hash Joan was used as an example application. The experimenls were done on a BEN TC2OOO rnulttprocessov- system.
A differential error reference adaptive echo canceller for multilevel PAM line codes
Authors: I. A. Perez-Alvarez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The objective of any local echo canceller connected to any end of a digital subscriber line (DSL) is to compensate the outgoing transmit signal energy in the receiving path (commonly called near-echo) that the hybrid circuit leaks. The observed signals that usually play the role of error references for adaptive echo cancellers (EC) in data communications are basically composed by far-end data plus a residual echo. The EC goal is to eliminate that residual echo. However, depending on the convergence stage, the presence of data in the error reference may mask the effective error reference (the residual echo). We show a new adaptive EC that offers better convergence properties than those associated to the simplest EC algorithms (standard LMS and decision-directed) for multilevel PAM signals. It exploits the discrete nature of the far-end signal to self-cancel the masking effect by adding (or subtracting) a weighted old version of the error reference to the current one. We show that the new error cost function is now closer to the instantaneous optimal one: its corresponding MLE. This new error surface presents a more robust (or uniform) behavior during the convergence period.
Blind separation of multiple binary sources using a single linear mixture
Authors: K. I. Diamantaras
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Multiple binary sequences are blindly separated from a single linear mixture using the structure of the probability distribution function of the observed data. No specific assumptions are made regarding the second or higher order statistics of the sources. Assuming additive Gaussian noise the PDF is a mixture of Gaussians centered at points that uniquely determine (a) the mixing parameters and (b) the source signals up to a permutation and a sign ambiguity. We present both the theoretical framework for this novel approach and a new recursive blind separation algorithm based on our framework. Simulations show that the method can successfully separate at least up to 10 binary source signals at different noise levels.
Virtual Prototyping of Directed Energy Weapons on Thousands of Processors
Authors: M. T. Bettencourt, L. A. Bowers, K. L. Cartwright, A. D. Greenwood, T. P. Fleming, M. D. Haworth, N. P. Lockwood, P. J. Mardahl
Venue: Proceedings of the HPCMP Users Group Conference (2006)

This paper documents the changes required to permit ICEPIC to scale efficiently to the thousand CPU range. Substantial changes were made to the communication paradigm within the code, so that only one synchronization point is now required. This led to increase of a factor four in the number of processors ICEPIC can productively use on real world problems.
Non-repudiable service usage with host identities
Authors: Seppo Heikkinen
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Security design of many communication systems relies on the authentication of the users, but equally important is to consider the authorisation of actions. Often authorisation is implied from authentication, but this may not take into account the privacy or privilege granularity requirements. Another view point is that providing compensation for the usage of the resources can be regarded as an act that fulfils the authorisation requirement. Thus, both the user and the provider of service have economic interests regarding the service usage and they should have a uniform view of the transactions taking place. Currently, there are no strong means in use to ensure this and the both parties have the possibility of cheating at the time of charging. This paper considers how inclusion of an authorisation mechanism into Host Identity Protocol (HIP) can be used to provide a communication system that ensures correctness of service charging for both parties and better granularity of rights.
Performance Analysis of Updating Mechanisms for Dynamic Content in Peer-to-Peer Networks
Authors: Daniel Villela
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In current peer-to-peer applications content is generally static, i.e. it does not change over time. In the case of content that is modified over time, peers that host such dynamic content are required to have a mechanism that refreshes content hosted by them. In unstructured peer-to- peer networks this is challenging because of its decentralized nature. In this paper we develop a model that captures for dynamic content in a peer-to-peer network the impact of its refreshing rate and its popularity to the bandwidth required from the network. We compare four simple mechanisms for updating peers that can be used in a protocol devised to work in this kind of scenario. We find that there is an optimal number of updates to proactively push into the network in order to minimize the bandwidth consumption. Since unstructured peer-to-peer networks offer little guarantees of reliability, the use of one of the mechanisms studied here is highly recommended.