ppxscal/embedding_network huggingface dataset:
Adaptive Web-Based Learning System
Authors: Fahad T. Alotaiby, Jim X. Chen, Harry Wechsler, Edward J. Wegman, Debra Sprague
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper reports a web-based platform-independent adaptive learning system that serves both students and teachers. The content in the system is individually tailored toward student knowledge, which makes learning more personal, adaptive towards individual needs, and specialized. For teachers, the system provides a generic rules-based library to supervise student learning. These rules enable teachers to choose different assessment, assignment, and learning strategies. The system automatically accommodates these strategies for students according to the teacherýs selections and the studentýs performance. Our system architecture is component-based and web-based. The learning environment in the system is comparable to classroom learning environments.
Modeling Prior Shape and Appearance Knowledge in Watershed Segmentat
Authors: Xiaoxing Li, Ghassan Hamarneh
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Watershed transform is widely used in image segmentation. However, its shortcomings such as over-segmentation and sensitivity to noise often make it unsuitable as an automatic tool for segmenting medical images. Utilizing prior shape knowledge has been demonstrated to improve robustness of medical image segmentation algorithms. In this paper, we propose a novel method for incorporating prior shape and appearance knowledge into watershed segmentation. Our method is based on iteratively aligning a shape-histogram with the result of an improved k-means clustering algorithm. No human interaction is needed in the whole process. We demonstrate the robustness of our method through segmenting the corpora callosa from a set of 51 brain magnetic resonance (MR) images. Numerical validation of the results is provided.
Design of the MUC-6 evaluation
Authors: Ralph Grishman, Beth Sundheim
Venue: Proceedings of the 6th conference on Message understanding (1995)

The sixth in a series of "Message Understanding Conferences", which are designed to promote and evaluate research in information extraction, was held last fall. MUC-6 introduced several innovations over prior MUCs, most notably in the range of different tasks for which evaluations were conducted. We describe the development of the "message understanding" task over the course of the prior MUCs, some of the motivations for the new format, and the steps which led up to the formal evaluation.
Research at the U. of Illinois
Authors: Dave Waltz
Venue: Issue 79 (January 1982) (1982)

The following people now have appointments to work on NL research at CSL: Dave Waltz, Associate Professor, CSL and Electrical Engineering; Jerry DeJong, Assistant Professor, CSL and Electrical Engineering; La Raw Maran, Research Associate, CSL; Rick Dinitz, Research Assistant: Jeff Gibbons, Research Assistant (as of 1/1/82); Jordan Pollack, Research Assistant; Alberto Segre, Research Assistant (as of 1/21/82); David Spoor, Research Assistant.
On the elimination of numerical Cerenkov radiation in PIC simulations
Authors: Andrew D. Greenwood, Keith L. Cartwright, John W. Luginsland, Ernest A. Baca
Venue: Journal of Computational Physics (2004)

Particle-in-cell (PIC) simulations are a useful tool in modeling plasma in physical devices. The Yee finite difference time domain (FDTD) method is commonly used in PIC simulations to model the electromagnetic fields. However, in the Yee FDTD method, poorly resolved waves at frequencies near the cut off frequency of the grid travel slower than the physical speed of light. These slowly traveling, poorly resolved waves are not a problem in many simulations because the physics of interest are at much lower frequencies. However, when high energy particles are present, the particles may travel faster than the numerical speed of their own radiation, leading to non-physical, numerical Cerenkov radiation. Due to non-linear interaction between the particles and the fields, the numerical Cerenkov radiation couples into the frequency band of physical interest and corrupts the PIC simulation. There are two methods of mitigating the effects of the numerical Cerenkov radiation. The computational stencil used to approximate the curl operator can be altered to improve the high frequency physics, or a filtering scheme can be introduced to attenuate the waves that cause the numerical Cerenkov radiation. Altering the computational stencil is more physically accurate but is difficult to implement while maintaining charge conservation in the code. Thus, filtering is more commonly used. Two previously published filters by Godfrey and Friedman are analyzed and compared to ideally desired filter properties.
Complete translation of unsafe native code to safe bytecode
Authors: Brian Alliet, Adam Megacz
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

Existing techniques for using code written in an unsafe language within a safe virtual machine generally involve transformations from one source code language (such as C, Pascal, or Fortran) to another (such as Java) which is then compiled into virtual machine bytecodes.We present an alternative approach which translate MIPS binaries produced by any compiler into safe virtual machine bytecodes. This approach offers four key advantages over existing techniques: it is language agnostic, it offers bug-for-bug compiler compatibility, requires no post-translation human intervention, and introduces no build process modifications.We also present NestedVM, an implementation of this technique, and discuss its application to six software packages: LINPACK (Fortran), which was used as one of our performance tests, TEX (Pascal), which was used to typeset this document, libjpeg, libmspack, and FreeType (all C source), which are currently in production use as part of the Ibex Project [13], and gcc, which was used to compile all of the aforementioned.Performance measurements indicate a best case performance within 3x of native code and worst case typically within 10x, making it an attractive solution for code which is not performance-critical.
Together is better: strengthening the confidence of women in computer science via a learning community
Authors: GianMario Besana, Lucia Dettori
Venue: Journal of Computing Sciences in Colleges (2004)

The decreasing enrollment and high drop/fail rate of female students in introductory Computer Science (CS) courses over the last year, motivated us to create an integrated peer-and-mentor support group for female Information Technology (IT) students. The project aims at strengthening the confidence of female students by enveloping them in a community of learners. The design and implementation of the project is presented. Qualitative data showing its impact and potential is also discussed.
Preemptive online algorithms for scheduling with machine cost
Authors: Yiwei Jiang, Yong He
Venue: Acta Informatica (2005)

For most scheduling problems the set of machines is fixed initially and remains unchanged. Recently Imreh and Noga proposed adding the concept of machine cost to scheduling problems and considered the so-called List Model problem. For this problem, we are given a sequence of independent jobs with positive sizes, which must be processed non-preemptively on a machine. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. The objective is to minimize the sum of the makespan and cost of machines. In this paper, a modified model of List Model is presented where preemption is allowed. For this model, it is shown that better performance is possible. We present an online algorithm with a competitive ratio of $(2\sqrt{6} + 2)/5\approx 1.3798$ while the lower bound is 4/3. For the semi-online problem with decreasing sizes, we design an optimal algorithm with a competitive ratio of 4/3, which improves the known upper bound of 3/2. The algorithm does not introduce any preemption, and hence is also an optimal semi-online algorithm for the non-preemptive semi-online problem. For the semi-online problem with known largest size, we present an optimal algorithm with a competitive ratio of 4/3.
Adjustable Deliberation of Self-Managing Systems
Authors: M. Randles, A. Taleb-Bendiab, P. Miseldine, A. Laws
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In this paper a cybernetics-based viable system architectural model is introduced, which provides a blueprint for high-assurance systems and a meta-control model necessary for the adjustable deliberation and autonomy of self-managing systems. The logical formalism is provided by the Situation Calculus and underpinned by an EnhancedBelief-Desires-Intentions (EBDI) framework to facilitate the representation and reasoning of scaleable autonomic computing systems.
A Hybrid Decision Support System Model for Disaster Management
Authors: Sohail Asghar, Damminda Alahakoon, Leonid Churilov
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Model integration is one of the most important and widely researched areas in model management of Decision Support Systems (DSS). In disaster management area, independent DSS models handle specific decision-making needs, but it is possible that the need for combination of these models will be required. Therefore, the need for model integration and selection of such models arises. This paper presents the idea of decision support model integration based on software agents in an interactive disaster management domain. In this environment an automated model agent communicates with the other decision support system models and presents the hybrid decision support system model as a solution. This system starts with minimal information about the user's preferences, and preferences are elicited and inferred incrementally by analyzing the needs and requirements of the user.
Peta-Scale Computing
Authors: Eric P. Kronstadt
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In a few short years, computers capable of over one Petaflops performance will become a reality. The most likely approach for first successfully reaching this performancelevel will involve several thousands of parallel processing elements. What are the key considerationsfor building such systems? What are the software requirements and demands? How will applications scale? How reliable are they likely to be? What will they be good for? We will address these questions and more based on early experience with the BlueGene system.
Linux TCP network stack analysis and partitioning for network processors
Authors: Ralf Lehmann, Alexander Schill
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Current high speed networks cannot be fully utilized by today's high end systems. The processing requirements of applications and advanced services or security processing aggravate this situation. To overcome these shortcomings intelligent network cards with network protocol offload engines, for example based on a network processor, are necessary. To reduce development time, we reuse existing software protocol stack implementations for partitioning and implementing on the network card. Since manual partitioning is very expensive and fault-prone, we use a modified automatic debugging tool for the analysis. We outline the results of Linux TCP network stack analysis and partitioning when using an automatic debugger.
Context-sensitive electronic dictionaries
Authors: Gábor Prószéky, Balázs Kis
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

This paper introduces a context-sensitive electronic dictionary that provides translations for any piece of text displayed on a computer screen, without requiring user interaction. This is achieved through a process of three phases: text acquisition from the screen, morpho-syntactic analysis of the context of the selected word, and the dictionary lookup. As with other similar tools available, this program usually works with dictionaries adapted from one or more printed dictionaries. To implement context sensitive features, however, traditional dictionary entries need to be restructured. By splitting up entries into smaller pieces and indexing them in a special way, the program is able to display a restricted set of information that is relevant to the context. Based on the information in the dictionaries, the program is able to recognize---even discontinuous---multiword expressions on the screen.The program has three major features which we believe make it unique for the time being, and which the development focused on: linguistic flexibility (stemming, morphological analysis and shallow parsing), open architecture (three major architectural blocks, all replaceable along public documented APIs), and flexible user interface (replaceable dictionaries, direct user feedback).In this paper, we assess the functional requirements of a context-sensitive dictionary as a start; then we explain the program's three phases of operation, focusing on the implementation of the lexicons and the context-sensitive features. We conclude the paper by comparing our tool to other similar publicly available products, and summarize plans for future development.
Web Services Notifications
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2004)

As Web services have matured, theyýve also acquired the need for asynchronous push capabilities. Early Web services were seemingly all remote procedure call (RPC)-oriented. In an RPC system, the receiver normally performs the requested service and sends a response back to the caller over the same connection on which the request arrived, which means the details required by the service for sending a reply are implicit in the RPC network connection. Unfortunately, these kinds of implied communication details are wholly inadequate for asynchronous push Web services.
Face Synthesis and Recognition from a Single Image under Arbitrary Unknown Lighting Using a Spherical Harmonic Basis Morphable Model
Authors: Lei Zhang, Sen Wang, Dimitris Samaras
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Understanding and modifying the effects of arbitrary illumination on human faces in a realistic manner is a challenging problem both for face synthesis and recognition. Recent research demonstrates that the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace using spherical harmonics representation. Morphable models are statistical ensembles of facial properties such as shape and texture. In this paper, we integrate spherical harmonics into the morphable model framework, by proposing a 3D Spherical Harmonic Basis Morphable Model(SHBMM) and demonstrate that any face under arbitrary unknown lighting can be simply represented by three low-dimensional vectors: shape parameters, spherical harmonic basis parameters and illumination coefficients. We show that, with our SHBMM, given one single image under arbitrary unknown lighting, we can remove the illumination effects from the image (face "delighting") and synthesize new images under different illumination conditions (face "re-lighting"). Furthermore, we demonstrate that cast shadows can be detected and subsequently removed by using the image error between the input image and the corresponding rendered image. We also propose two illumination invariant face recognition methods based on the recovered SHBMM parameters and the de-lit images respectively. Experimental results show that using only a single image of a face under unknown lighting, we can achieve high recognition rates and generate photo-realistic images of the face under a wide range of illumination conditions, including multiple sources of illumination.
Dynamic Analysis of Flexible Supercavitating Vehicles Using Modal-Based Elements
Authors: Jou-Young Choi, Massimo Ruzzene, Olivier A. Bauchau
Venue: Simulation (2004)

This article presents a numerical model for the simulation of the flight mechanics behavior of flexible supercavitating vehicles. Supercavitating vehicles exploit supercavitation as a means to reduce drag and increase underwater speed. In the proposed formulation, the vehicle's rigid body motion is described by six degrees of freedom, which define pitch, yaw, and roll motion and the displacement of the center of gravity with respect to an inertial reference system. The developed numerical model predicts the dynamic response of the vehicles resulting from perturbation of the control surfaces and assigned maneuvers. The results highlight the potential instability of the vehicles' behavior and its sensitivity to the considered control maneuvers. The analysis is motivated by the need of accurately modeling the structural characteristics of supercavitating vehicles to estimate vibrations in the structure and to envision and design systems that improve their guidance and control efficiency.
Regulation as a barrier to electronic commerce in Europe: the case of the European fund management industry
Authors: Jeremy Fisher, G. Harindranath
Venue: European Journal of Information Systems (2004)

This paper presents results of exploratory research into the question of whether the distribution of investment funds via the Internet in Europe is being deterred by regulatory barriers. The paper examines the theoretical underpinnings behind financial services regulation and then asks if current regulation in place within the European Union and its Member States is consistent with this theory or indeed if regulation is acting as a barrier. Using both primary data and secondary sources, this exploratory study argues that European fund management firms face different regulatory obstacles, often the result of protectionism and the inconsistent application of financial regulations, in different EU countries. As a result, they are unable to reap the benefits that electronic commerce should bring in an industry that appears highly suited for it.
On the complexity of computation in the presence of link failures: the case of a ring
Authors: Oded Goldreich, Liuba Shrira
Venue: Distributed Computing (1991)

We investigate the message complexity of distributed computations on rings of asynchronous processors. In such computations, each processor has an initial local value and the task is to compute some predetermined function of all local values. Our work deviates from previous works concerning the complexity of ring computations in that we consider the effect of link failures. A link is said to fail if some message sent through it never reaches its destination. We show that the message complexity of any function, which is "sensitive to all its inputs", is Θ(n log n) when n, the number of processors, is a-priori known; and is Θ(n2) when n is not known. Interestingly, these tight bounds do not depend on whether the identity of a leader is a-priori known before the computation starts. These results stand in sharp contrast to the situation in asynchronous rings with no link failures, where the message complexity is affected by the a-priori knowledge of a leader but is not affected by the knowledge of n.
An Architecture and Interfaces for Distributed Manufacturing Simulation
Authors: Charles Mclean, Frank Riddick, Y. Tina Lee
Venue: Simulation (2005)

This article presents an overview of a neutral reference architecture and data model for integrating distributed manufacturing simulation systems with each other, with other manufacturing software applications, and with manufacturing data repositories. Other manufacturing software applications include but are not limited to systems used to design products, specify processes, engineer manufacturing systems, and manage production. The architecture identifies the software building blocks and interfaces that will facilitate the integration of distributed simulation systems and enable the integration of those systems with other manufacturing software applications. The architecture builds on the High Level Architecture standard for simulation. The National Institute of Standards and Technology and its collaborators have created several implementations of portions of the architecture using commercial off-the-shelf simulators. These implementations demonstrated the feasibility of the architecture and highlighted the need for a neutral data model for exchanging manufacturing data between simulations.
Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing
Venue: UbiMob; Vol. 64 (2004)

The French &Eacute;cole Sup&eacute;rieure en Sciences Informatiques (ESSI), Sophia Antipolis (France), together with the I3S and INRIA labs, is happy and proud to welcome the First French Speaking Conference on "Mobility and Ubiquity".The "Mobiquitous" thematic is indeed familiar to ESSI and to I3S and INRIA. Since several years, ESSI offers school projects to its students on topics such as wearable computers and mobile applications for the visually impaired. The co-chairing of the "Mobilit&eacute; et Ubiquit&eacute; 2004" conference gives us the opportunity to concretize collaborations on "Mobiquity" which already bring together our respective research teams: Rainbow (I3S) and Acacia (INRIA). Within the GUI teaching module we co-manage, many small projects deal with Mobiquity, and the ESSI course of study "Real-time embedded systems and mobile applications" provides our students with real-time applications of the future. The coorganizing of DeViNT'2003 and DeViNT'2004 (the latter in conjunction with "Mobilit&eacute; et Ubiquit&eacute; 2004"), two conferences on new information and communication technologies for the visually impaired, allowed us to grasp the significance of Mobiquity for specific users, and to better know these users' requirements. As organizers of conferences for manufacturers (such as the InTech'Sophia seminar on "Device Independence"), we also better understood the needs of mobiquitous application developers.We are convinced that the work presented during this first french-speaking conference on "Mobilit&eacute; et Ubiquit&eacute;" will give users and application developers enriching answers to their questions about Mobiquity. And we hope that the conference will meet the expectations of the community of "Mobilit&eacute; et Ubiquit&eacute;" researchers to such a stage that it will decide to organize the next edition of this conference!
USER INTERFACE DESIGN EXPERTISE AND LEARNING IN THE SOFTWARE INDUSTRY
Authors: Lori Marchak, Teresa Forster, Robert Braudes
Venue: ACM SIGCHI Bulletin (1991)

The reality in the software industry today is that software engineers with little or no formal training in human factors frequently have primary responsibility for the user interface design of industry products. The purpose of this study is to assess the degree of user-interface design expertise among these professionals. Both character-based and graphical user interface expertise are assessed. This study assesses overall design expertise as function of years experience, and asks whether serious problems have a greater probability of identification than non-serious problems, and whether lexical or surface-level problems are more apparent to software engineers than syntactic problems.