ppxscal/embedding_network huggingface dataset:
Generalizing the design of a computer tutor using delimited explanations
Authors: S. Rubin
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

A computer tutor is defined to be any combination of artificial intelligence and multimedia for instructional purposes. It uses forms, arrays, databases, and other constructs in its effective realization. The main problem in the construction of such tutors is threefold. The first is mastering the subject to be taught so that an effective tutoring system can be laid out. The second is mastering the authoring tool so that an effective presentation can be produced. The third is mastering the techniques of artificial intelligence so that navigation within the presentation becomes more natural and so that the overall task of producing a tutor can be randomized, thus minimizing the overall burden on the designer. There are two ways of doing this, not mutually exclusive. The first is through generalized schematic templates and the second is through delimited responses to user requests for assistance.
Particle filters for demodulation of M-ary modulated signals in noisy fading communication channels
Authors: E. Punskaya
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We address the problem of demodulation of M-ary modulated signals under conditions of noisy fading channels. The transmitted signal is corrupted in a random manner by a variety of possible mechanisms, and our aim is to recover the original message from the observations. This is a challenging non-linear filtering problem, and in order to solve it an efficient simulation-based algorithm, based on particle filters, is developed. The method combines sequential importance sampling, a selection scheme, Markov chain Monte Carlo (MCMC) methods and variance reduction techniques. Optimal fixed-lag smoothing is also considered. An application to the problem of demodulation of digital M-ary differential phase shift keyed (MDPSK) signals is presented and an extensive simulation study is carried out. The results show that the algorithm outperforms the current methods that are routinely used in most communication applications.
A Framework for Holographic Scene Representation and Image Synthesis
Authors: Remo Ziegler, Peter Kaufmann Markus Gross
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a framework for the holographic representation and display of graphics objects. As opposed to traditional graphics representations, our approach reconstructs the light wave reflected or emitted by the original object directly from the underlying digital hologram. Our novel holographic graphics pipeline consists of several stages including the digital recording of a full-parallax hologram, the reconstruction and propagation of its wavefront, and rendering of the final image onto conventional, framebuffer-based displays. The required view-dependent depth image is computed from the phase information inherently represented in the complex-valued wavefront. Our model also comprises a correct physical modeling of the camera taking into account optical elements, such as lens and aperture. It thus allows for a variety of effects including depth of field, diffraction, interference, and features built-in anti-aliasing. A central feature of our framework is its seamless integration into conventional rendering and display technology which enables us to elegantly combine traditional 3D object or scene representations with holograms. The presented work includes the theoretical foundations and allows for high quality rendering of objects consisting of large numbers of elementary waves while keeping the hologram at a reasonable size.
Computer Based Psychotherapy for Treatment of Depression and Anxiety
Authors: Byron Purves, David Purves
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

This paper describes a new computer based delivery method of Cognitive Behavioral Therapy for relief of depression or anxiety. Blues Begone combines established psychological principles with a novel implementation that makes depression recovery available to many more people than face-to-face therapy, and without the side effects of drugs. A flexible architecture makes possible significant variation in content without software change.
Monitoring utilization in an NT workstation lab
Authors: Paul Kranenburg
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

This paper describes a set of tools used to monitor and maintain NT workstations at the faculty of Economics at the Erasmus University Rotterdam. These tools have been employed in different shapes and on a variety of systems since 1992. In particular, the data gathered on usage patterns of workstations in the faculty's public student labs has proved to be valuable for long-term planning of lab capacity and resource allocation. The collected data is also made available for live monitoring of workstation status and utilization. This is helpful both to tutors giving classes and to lab assistants while troubleshooting. Since mid-1997, all lab machines run Windows NT and the monitoring and maintenance system has been updated to take advantage of features that NT offers.
A QoS policy configuration modeling language for publish/subscribe middleware platforms
Authors: Joe Hoffert, Douglas Schmidt, Aniruddha Gokhale
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Publish/subscribe (pub/sub) middleware platforms for event-based distributed systems often provide many configurable policies that affect end-to-end quality of service (QoS). Although the flexibility and functionality of pub/sub middleware platforms has matured, configuring their QoS policies in semantically compatible ways has become more complex. This paper makes two contributions to reducing the complexity of configuring QoS policies for event-based distributed systems. First, it evaluates various approaches for managing complex QoS policy configurations in pub/sub middleware platforms. Second, it describes a domain-specific modeling language (DSML) that automates the analysis and synthesis of semantically compatible QoS policy configurations.
Statistically optimal null filters: Kalman equivalence
Authors: R. Agarwal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A new approach in the enhancement/suppression of narrowband signals, based on the combination of the maximum output SNR and the least-squares optimizing criteria, has been presented previously. The resulting statistically-optimal null filters (SONFs) have also been presented as recursive filters. Because of their time-varying nature, optimality under the MSE criterion and the similarity to the RLS method, it is anticipated that the SONFs may be related to the well known Kalman filter. In this paper, we show the SONFs to be an alternate implementation of the Kalman filter. For the first order case we show this analytically. Due to mathematical intractability, for the higher order case we set up the mathematical formulations and use simulations for verification.
The general quaternionic M-J sets on the mapping z←zα+c(α ε N)
Authors: Xing-Yuan Wang, Yuan-Yuan Sun
Venue: Computers Mathematics with Applications (2007)

Fractal nature exists not only in complex plane but also in higher dimensional space. It is a focus to find new modals to construct new 3-D fractals. In this paper, the general Mandelbrot sets and Julia sets on the mapping f:z
Oncological Image Analysis: Medical and Molecular Image Analysis
Authors: Michael Brady
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Cancer is, after heart disease, one of the major causes of death in the developed world. Cancer statistics make grim reading. One in three people in developed countries will be diagnosed with cancer during their lifetime. The worldwide incidence (number of new cases) is currently 10 million, a figure that is expected to double over the next 15-20 years. It is estimated that over 550,000 people died of cancer in the USA alone in 2002. For women, the incidence of breast cancer is 31% (so that one woman in 9 will be diagnosed during her life), followed by lung (12%) and colorectal (12%). For men, the leading cancer is of the prostate (30%), followed by the lung (14%) and colorectum (11%). Colorectal cancer most often metastasises to the liver or pelvis, both with poor prognosis. The first part of this paper concentrates on colorectal and liver cancer, which have been the major focus of our work over the past two years, primarily on a project carried out jointly with GE Healthcare.
JACME2T: an industry-academic consortia to enhance continuing engineering education
Authors: C. S. Elliott
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The three state Universities in Arizona (Arizona State University, University of Arizona, Northern Arizona University) and six of the largest, high tech companies (AlliedSignal, Boeing, Hughes Missile Systems, IBM, Intel and Motorola) have completed a Technology Reinvestment Program (NSF award 3518) which is now a permanent self-supporting consortia known as JACME2T (Joint Arizona consortium-Manufacturing and Engineering Education for Tomorrow). The Consortium is devoted to advancing university industry interactions-especially in life long learning areas. Overall direction is provided by a Policy Board of top industry, university and public sector leaders. Day to day direction is provided by the Technical Advisory Board, again comprised of industry and university managers. A central office is maintained at ASU and a branch office for Southern Arizona at Hughes Missile Systems in Tucson. Six curriculum development groups are developing/providing advanced level education at the noncredit, certificate and graduate levels in the following areas: manufacturing processes, IPPD, software, environmental, design and quality. 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
Same problem, different solutions: attempts at improving retention in engineering at a research vs. a teaching university
Authors: D. G. Woolston, K. Shook, J. Wilson
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Two campuses in the University of Wisconsin system (UW-Madison and UW-Platteville) have recently attacked the problem of sub optimal retention of students who enter engineering as first year students. At both locations, independent analyses of students' reasons for leaving were conducted during the past two years, and efforts made to reduce the number of students who leave engineering degree programs shortly after entering. While it is too early to evaluate the long term success of any of these efforts, it is productive to compare the approaches at these two universities, one of which is a large, research oriented institution, and the other a smaller teaching oriented campus. The paper contrasts the data obtained on students' reasons for leaving engineering at these two schools, and the freshman level introduction to engineering courses implemented at each to help improve retention. It also raises the question of what retention goal we are seeking in engineering education.
Optimal control of the convection-diffusion equation using stabilized finite element methods
Authors: Roland Becker, Boris Vexler
Venue: Numerische Mathematik (2007)

In this paper we analyze the discretization of optimal control problems governed by convection-diffusion equations which are subject to pointwise control constraints. We present a stabilization scheme which leads to improved approximate solutions even on corse meshes in the convection dominated case. Moreover, the in general different approaches &#x201c;optimize-then- discretize&#x201d; and &#x201c;discretize-then-optimize&#x201d; coincide for the proposed discretization scheme. This allows for a symmetric optimality system at the discrete level and optimal order of convergence.
Integration of Vision and Inertial Sensors for 3D Arm Motion Tracking in Home-based Rehabilitation
Authors: Yaqin Tao, Huosheng Hu, Huiyu Zhou
Venue: International Journal of Robotics Research (2007)

The integration of visual and inertial sensors for human motion tracking has attracted significant attention recently, due to its robust performance and wide potential application. This paper introduces a real-time hybrid solution to articulated 3D arm motion tracking for home-based rehabilitation by combining visual and inertial sensors. Data fusion is a key issue in this hybrid system and two different data fusion methods are proposed. The first is a deterministic method based on arm structure and geometry information, which is suitable for simple rehabilitation motions. The second is a probabilistic method based on an Extended Kalman Filter (EKF) in which data from two sensors is fused in a predict-correct manner in order to deal with sensor noise and model inaccuracy. Experimental results are presented and compared with commercial marker-based systems, CODA and Qualysis. They show good performance for the proposed solution.
A Practical Synthesis of Dynamic Role Settings in Telecare Services
Authors: Ying Liu, Jean Bacon
Venue: Proceedings of the First International Conference on the Digital Society (2007)

Role provisioning is an essential yet complex aspect of the design of virtual organisations. This paper addresses an even more complex scenario, that of role provisioning in telecare. Here the roles may be doctor, nurse, carer, etc. And they must be enabled to participate in monitoring remote care-receivers via the internet, using their professional expertise and skills, with access to online-resources. We show that the complexity of role provisioning is attributable not only to defining a role or roles within an organisation, but also to a large degree of uncertainty on how to manage online-contexts. We illustrate this by giving practical scenarios including services in on/offline mode, patient participation, and professional participation with different care-levels. We call these online-contexts "dynamic role settings". This work describes an approach to establishing a dynamic channel of interaction between a care-provider (e.g. doctor), necessary resources, and a care-receiver (e.g. patient), so as to manage the care-receivers' needs and the care-providers' responsibilities.
Finding near neighbors through cluster pruning
Authors: Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Finding near(est) neighbors is a classic, difficult problem in data management and retrieval, with applications in text and image search,in finding similar objects and matching patterns. Here we study cluster pruning, an extremely simple randomized technique. During preprocessing we randomly choose a subset of data points to be leaders the remaining data points are partitioned by which leader is the closest. For query processing, we find the leader(s) closest to the query point. We then seek the nearest neighbors for the query point among only the points in the clusters of the closest leader(s). Recursion may be used in both preprocessing and in search. Such schemes seek approximate nearest neighbors that are "almost as good" as the nearest neighbors. How good are these approximations and how much do they save in computation. Our contributions are: (1) we quantify metrics that allow us to study the tradeoff between processing and the quality of the approximate nearest neighbors; (2) we give rigorous theoretical analysis of our schemes, under natural generative processes (generalizing Gaussian mixtures) for the data points; (3) experiments on both synthetic data from such generative processes, as well as on from a document corpus, confirming that we save orders of magnitude in query processing cost at modest compromises in the quality of retrieved points. In particular, we show that p-spheres, a state-of-the-art solution, is outperformed by our simple scheme whether the data points are stored in main or in external memo.
The Impact of the NSA Cyber Defense Exercise on the Curriculum at the Air Force Institute of Technology
Authors: Barry E. Mullins, Timothy H. Lacey, Robert F. Mills, Joseph M. Trechter, Samuel D. Bass
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes how the curriculum and course format at the Air Force Institute of Technology (AFIT) has evolved based on our experience with the highly-successful Cyber Defense Exercise (CDX) sponsored by the National Security Agency (NSA). Using industry-standard hardware and software, AFIT graduate students designed, built, and operated a robust network infrastructure that survived scans, denial of service attacks, social engineering, viruses, and root kits orchestrated by a team of NSA-sponsored hackers. AFIT's two-quarter graduate-level course format changed this year to provide more hands-on, student-initiated education, which we found to be an effective teaching style for information security courses. This change in course format placed more emphasis on a coordinated team approach to defending the network. In this paper, we explain how the students formed teams and planned their activities and discuss how effective organization and division of labor can successfully thwart cyber attacks.
Discriminant Locality Preserving Projections: A New Method to Face Representation and Recognition
Authors: Weiwei Yu, Xiaolong Teng, Chongqing Liu
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Locality Preserving Projections (LPP) is a linear projective map that arises by solving a variational problem that optimally preserves the neighborhood structure of the data set. Though LPP has been applied in many domains, it has limits to solve recognition problem. Thus, Discriminant Locality Preserving Projections (DLPP) is presented in this paper. The improvement of DLPP algorithm over LPP method benefits mostly from two aspects. One aspect is that DLPP tries to find the subspace that best discriminates different face classes by maximizing the between-class distance, while minimizing the within-class distance. The other aspect is that DLPP reduces the energy of noise and transformation difference as much as possible without sacrificing much of intrinsic difference. In the experiments, DLPP achieves the better face recognition performance than LPP.
Optimizing software cache performance of packet processing applications
Authors: Qin Wang, Junpu Chen, Weihua Zhang, Min Yang, Binyu Zang
Venue: ACM SIGPLAN Notices (2007)

Network processors (NPs) are widely used in many types of networking equipment due to their high performance and flexibility. For most NPs, software cache is used instead of hardware cache due to the chip area, cost and power constraints. Therefore, programmers should take full responsibility for software cache management which is neither intuitive nor easy to most of them. Actually, without an effective use of it, long memory access latency will be a critical limiting factor to overall applications. Prior researches like hardware multi-threading, wide-word accesses and packet access combination for caching have already been applied to help programmers to overcome this bottleneck. However, most of them do not make enough use of the characteristics of packet processing applications and often perform intraprocedural optimizations only. As a result, the binary codes generated by those techniques often get lower performance than that comes from hand-tuned assembly programming for some applications. In this paper, we propose an algorithm including two techniques - Critical Path Based Analysis (CPBA) and Global Adaptive Localization (GAL), to optimize the software cache performance of packet processing applications. Packet processing applications usually have several hot paths and CPBA tries to insert localization instructions according to their execution frequencies. For further optimizations, GAL eliminates some redundant localization instructions by interprocedural analysis and optimizations. Our algorithm is applied on some representative applications. Experiment results show that it leads to an average speedup by a factor of 1.974.
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Venue: International Conference on Principles and Practice of Declarative Programming (2007)

This volume contains the papers presented at PPDP 2007, the 9th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, held July 14-16, 2007 in Wroc?aw, Poland. The Symposium aims to provides a forum that brings together those in the declarative programming communities including those working in the logic, constraint and functional programming paradigms, but also embracing a variety of other paradigms such as visual programming, executable specification languages, database languages, AI languages and knowledge representation languages used, for expample, in the "semantic web". The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others. This years PPDP was held in conjunction with the 22nd Annual IEEE Symposium on Logic in Computer Science (LICS) and the 34th International Colloquium on Automata, Languages and Programming (ICALP). The START conference management system was used for the handling of electronic submissions, for allocation of reviewing duties, and for filing of reviews. The committee decided to accept 20 papers. In addition to the regular paper presentation, the scientific program included three invited talks, by Josh Berdine (Microsoft Research Cambridge, UK), Konstantinos Sagonas (National Technical University of Athens, Greece) and Witold Charatonik (University of Wroc?aw, Poland).
Information fusion for wireless sensor networks: Methods, models, and classifications
Authors: Eduardo F. Nakamura, Antonio A. F. Loureiro, Alejandro C. Frery
Venue: ACM Computing Surveys (CSUR) (2007)

Wireless sensor networks produce a large amount of data that needs to be processed, delivered, and assessed according to the application objectives. The way these data are manipulated by the sensor nodes is a fundamental issue. Information fusion arises as a response to process data gathered by sensor nodes and benefits from their processing capability. By exploiting the synergy among the available data, information fusion techniques can reduce the amount of data traffic, filter noisy measurements, and make predictions and inferences about a monitored entity. In this work, we survey the current state-of-the-art of information fusion by presenting the known methods, algorithms, architectures, and models of information fusion, and discuss their applicability in the context of wireless sensor networks.