ppxscal/embedding_network huggingface dataset:
Evaluation of Online Assessment: The Role of Feedback in Learner-Centered e-Learning
Authors: Noorminshah Iahad, Georgios A. Dafoulas, Emmanouil Kalaitzakis, Linda A. Macaulay
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Advancement of the Information and Communication Technologies enables the integrationof technology with daily activities and education is not an exception. E-learning, which applies the concept of open and distance learning is learning through the Internet. It had been reviewed as an efficient knowledge transfer mechanism. E-learning is seen as a future application worldwide, promoting life long learning by enabling learners to learn anytime, anywhere and at the learner's pace.This paper presents the evaluation of an online test based on a case study of an e-Commerce course offered by the Computation Department, University of Manchester Institute of Science and Technology (UMIST). The main aim of the online test is to provide rich' feedback to students, which is one of the requirements of the learner-centred learningparadigm. The online test, in the form of multiple choice questions, provides feedback through automatic grading, providing correct answers and referring the students to the learning content which explains the correct answers.Evaluation of the online test was based on two criteria: functionality and usability. In terms of functionality, evaluation was meant to get the students' view of the feedback provided by the system, while in terms of usability, the evaluation sought to ensure that the system not only functions as expected by the users but is also usable. Results show that the online test is suitable for online-learning and provides rich feedback.
I-DIAG: from community discussion to knowledge distillation
Authors: Mark S. Ackerman, Anne Swenson, Stephen Cotterill, Kurtis DeMaagd
Venue: Communities and Technologies (2003)

I-DIAG is an attempt to understand how to take the collective discussions of a large group of people and distill the messages and documents into more succinct, durable knowledge. I-DIAG is a distributed environment that includes two separate applications, CyberForum and Consolidate. The goals of the project, the architecture of I- DIAG, and the two applications are described. We focus on technical mechanisms to augment social maintenance and social regulation in the system.
Systematic Design for Optimization of High-Resolution Pipelined ADCs
Authors: Mohammad Taherzadeh-Sani, Reza Lotfi, Omid Shoaei
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Pipelining is the promising approach to implement high-speed medium-to-high resolution analog-to-digital converters with minimum power consumption. In this paper, the most important specifications of a pipelined ADC including the signal-to-noise-and-distortion ratio and spurious-free dynamic range as well as the total current consumption of the converter are presented in closed-form equations and an optimization methodology for design of pipelined ADCs is suggested. Simulation results confirming the effectiveness of the methodology are presented.
Configuration of progressive dies
Authors: B. T. Cheok, A. Y. C. Nee
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The computer-assisted configuration of progressive die is a computationally mixed problem. This paper describes the progressive die design problem and reviews some existing research related to the configuration of progressive dies. It explains the model-based reasoning approach used to configure the intermediate and final solutions to the design problem. In particular, the various shape representation and spatial reasoning techniques are presented. Finally, a computer software architecture for the die design system is presented.
Robust Histogram Construction from Color Invariants for Object Recognition
Authors: Theo Gevers, Harro Stokman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--An effective object recognition scheme is to represent and match images on the basis of histograms derived from photometric color invariants. A drawback, however, is that certain color invariant values become very unstable in the presence of sensor noise. To suppress the effect of noise for unstable color invariant values, in this paper, histograms are computed by variable kernel density estimators. To apply variable kernel density estimation in a principled way, models are proposed for the propagation of sensor noise through color invariant variables. As a result, the associated uncertainty is obtained for each color invariant value. The associated uncertainty is used to derive the parameterization of the variable kernel for the purpose of robust histogram construction. It is empirically verified that the proposed density estimator compares favorably to traditional histogram schemes for the purpose of object recognition.
Tocorime apicu: design of an experimental search engine using an information sharing model
Authors: Reginald Louis Walker
Venue:  (2003)

The design of the Tocorime Apicu integrated search engine draws upon the honeybee information sharing model, which is an inherently parallel, hierarchical model for task distribution and communication. The hierarchical structure is the foundation to the clustered approach for delegating and partitioning tasks. These tasks include foraging the Internet for information, assessing the computational effort required to retrieve information in the form of Web pages, sharing information among indexer nodes, and extracting knowledge from the information. A variety of search engines and their respective information retrieval systems are compared with the information sharing model to show the usefulness of this latter approach. The advent of WWW search engines addressed the shortcomings of early information retrieval systems. However, current systems are hampered by their reliance on outdated information, the result of an Internet retrieval approach for gathering new and updated pages as opposed to a resource discovery system based on the information sharing model. The honeybee information sharing model provides a solution to these problems, and provides an alternative model for what is really needed to index the WWW. This model uses hierarchical communication mechanisms to convey resource requirements associated with tasks needed for efficient use of information. Unique aspects of the honeybee model have been adapted as building blocks for the Tocorime Apicu search engine. The word Tocorime, meaning &ldquo;spirit,&rdquo; comes from an ancient Amazon Indian language. Apicu comes from the Latin apis cultura, meaning &ldquo;honeybee culture&rdquo; or &ldquo;the study of honeybees.&rdquo; The phrase Tocorime Apicu is used as &ldquo;in the spirit of bee culture.&rdquo;
A tunable gm-C filter with low variation across Process, Voltage and Temperature
Authors: Qadeer Ahmad Khan, Sanjay Kumar Wadhwa, Kulbhushan Misri
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

A tunable gm-C filter with cutoff frequencyinsensitive to Process, Voltage and Temperature isproposed. An external clock frequency is used togenerate a current using a switched capacitor circuit.The proposed filter is ideally suited for applicationswhere a tight control on cutoff frequency is desiredacross different operating conditions of the chip. Thecircuit was designed in 3.3V BiCMOS technology andsimulations were carried out using SPICE. Thesimulation results show that the total variation in thecutoff frequency is 1% as compared to the 27%variation in conventional gm-C filter over thetemperature range of -40 to 120 degC. The variationacross process corners is 2.4% and is almostindependent of the capacitor variation due to processand temperature.
Generating Small Combinatorial Test Suites to Cover Input-Output Relationships
Authors: Christine Cheng, Adrian Dumitrescu, Patrick Schroeder
Venue: Proceedings of the Third International Conference on Quality Software (2003)

In this paper, we consider a problem that arises in blackbox testing: generating small test suites (i.e., sets of testcases) where the combinations that have to be covered arespecified by input-output parameter relationships of a softwaresystem. That is, we only consider combinations of inputparameters that affect an output parameter. We also donot assume that the input parameters have the same numberof values. To solve this problem, we revisit the greedy algorithmfor test generation and show that the size of the testsuite it generates is within a logarithmic factor of the optimal.Unfortunately, the algorithm's main weaknesses areits time and space requirements for construction. To addressthis issue, we present a problem reduction techniquethat makes the greedy algorithm or any other test suite generationmethod more efficient if the reduction in size is significant.
Presentation of a control law for IM drive based on the dynamic reconfiguration of a DTC algorithm and a SVM-DTC algorithm
Authors: E. Monmasson, J. P. Louis
Venue: Mathematics and Computers in Simulation (2003)

In this paper, the authors present an original control law for induction motor drive. It is based on a dynamic reconfiguration of a basic direct torque control (DTC) algorithm and a direct torque control algorithm associated to space vector modulation (SVM-DTC). The criterion of reconfiguration concerns the state of the machine. Indeed, during transient states DTC algorithm is activated in order to get the best torque dynamic. Then, at steady-state, a SVM-DTC algorithm is preferred because it allows to reduce significantly the torque ripples. Besides, an original and well-adapted modelling based on a polar representation of the state variables is also introduce. Finally, experimental results are presented that confirm the interest of this solution.
A Framework for Selecting a Location Based Service (LBS) Strategy and Service Portfolio
Authors: David Tilson, Kalle Lyytinen, Ryan Baxter
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Location-based services (LBS) add value by exploiting knowledge of a mobile device's location. The arrival of broadband mobile data networks has revived interest in these serviceswhich are seen as a major source of revenue growth. We propose a framework that supportsthe generation and assessment of LBS service concepts. The proposed framework offers apromising foundation for a design theory of LBS strategies and services. The analysis of theframework points towards avenues for future research by highlighting deficiencies in currentknowledge of mobility and location awareness.
Fabrication of Schottky barrier MOSFETs using self-assembly CoSi2 nanopatterning and spacer gate technologies
Authors: Q. T. Zhao, P. Kluth, H. Bay, S. Mantl
Venue: Microelectronic Engineering (2003)

A self-assembly patterning method for generation of epitaxial CoSi2 nanostructures was used to fabricate 50 nm channel-length MOSFETs. The transistors have either a symmetric structure with Schottky source and drain or an asymmetric structure with n+-source and Schottky drain. The patterning technique is based on anisotropic diffusion of Co/Si atoms in a strain field during rapid thermal oxidation. The strain field is generated along the edges of a mask consisting of 20 nm SiO2 and 300 nm Si3N4. During rapid thermal oxinitridation (RTON) of the masked silicide structure, a well-defined separation of the silicide layer forms along the edge of the mask. These highly uniform gaps define the channel region of the fabricated device. The separated silicide layers act as metal source and drain. A poly-Si spacer was used as the gate contact. The asymmetric transistor was fabricated by ion implantation into the unprotected CoSi2 layer and a subsequent out-diffusion process to form the n+-source. I-V characteristics of both the symmetric and asymmetric transistor structures have been investigated.
Economics of Linux Adoption in Developing Countries
Authors: Nir Kshetri
Venue: IEEE Software (2004)

Since the 1980s, software development has gone from a specialised and esoteric discipline concentrated primarily among American and European white-collar workers to a significant global driver of emerging national economies. Software managers and developers who ignore this global expansion do so at their own fiscal and productivity peril, since of software globalization affects the optimum build-versus-buy decision process at every level and phase of software development. This paper looks at one of the most interesting and controversial instances of software globalization, which is the expansion of the open-source software (OSS) operating system Linux into software development efforts in developing countries.
Concurrency abstractions in a C++ class library
Authors: Eshrat Arjomandi, Ivan Kalas, William O'Farrell
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

C++ is increasingly becoming the language of choice among software developers. It is therefore not surprising to see the many attempts that have been made to add concurrency to C++. Concurrency can be added to C++ either by extending the language or through the use of a class library.There is much debate among language designers about the approach to take in the integration of two paradigms of concurrency and object-oriented programming (OOP). The library approach keeps the language small, allows the programmer to work with familiar compilers and tools, provides the option of sup - porting many concurrent models through a variety of libraries, and eases porting of code to other architectures (usually, a small amount of assembler code needs to be changed). Software developers typically have large investments in existing code and are reluctant to adopt a new language. A class library with sufficient flexibility that can provide most of the functionality of a new or extended language is often more palatable. On the other hand, new or extended languages can use the compiler to provide higher-level constructs, compile-time type checking, and enhanced performance.The Parallel Computing Project at the Centre for Advanced Studies has been researching the possibility of adding concurrency to C++ with the assistance of a class library. The library consists of two layers. The bottom layer provides a set of low level concurrency primitives. The top layer, ABC++, uses the bottom layer to provide implicit parallelism. To our knowledge, ABC++ is the only concurrent class library that provides almost all of the functionality of extended languages without requiring the users to deal with explicit concurrency control and without imposing severe limitations. This paper outlines the progress of the project, the low level concurrency primitives and describes how ABC++ differs from other existing concurrent class libraries for C++.
Genetic search methods in air traffic control
Authors: James V. Hansen
Venue: Computers and Operations Research (2004)

Of primary importance to the efficient operation and profitability of an airline is adherence to its flight schedule. This paper examines that segment of air traffic control, termed traffic management adviser (TMA), which is charged with the complex task of scheduling arriving aircraft to available runways in a manner that minimizes delays and satisfies safety constraints. In particular, we investigate the effectiveness and efficiency of using genetic search methods to support the scheduling decisions made by TMA.Four different genetic search methods are tested on TMA problems suggested by recent work at the NASA Ames Research Center. For problems of realistic size, optimal or near-optimal assignments of aircraft to runways are achieved in real time.
A Formal Classification of 3D Medial Axis Points and Their Local Geometry
Authors: Peter Giblin, Benjamin B. Kimia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--This paper proposes a novel hypergraph skeletal representation for 3D shape based on a formal derivation ofthe generic structure of its medial axis. By classifying each skeletal point by its order of contact, we show that, generically, the medial axis consists of five types of points, which are then organized into sheets, curves, and points: 1) sheets (manifolds with boundary) which are the locus of bitangent spheres with regular tangency A_1^2 (A_k^n notation means n distinct k{\hbox{-}}{\rm{fold}} tangencies of the sphere of contact, as explained in the text); two types of curves, 2) the intersection curve of three sheets and the locus of centers of tritangent spheres, A_1^3, and 3) the boundary of sheets, which are the locus of centers of spheres whose radius equals the larger principal curvature, i.e., higher order contact A_3 points; and two types of points, 4) centers of quad-tangent spheres, A_1^4, and 5) centers of spheres with one regular tangency and one higher order tangency, A_1A_3. The geometry of the 3D medial axis thus consists of sheets (A_1^2) bounded by one type of curve (A_3) on their free end, which corresponds to ridges on the surface, and attached to two other sheets at another type of curve (A_1^3), which support a generalized cylinder description. The A_3 curves can only end in A_1A_3 points where they must meet an A_1^3 curve. The A_1^3 curves meet together in fours at an A_1^4 point. This formal result leads to a compact representation for 3D shape, referred to as the medial axis hypergraph representation consisting of nodes (A_1^4 and A_1 A_3 points), links between pairs of nodes (A_1^3 and A_3 curves) and hyperlinks between groups of links (A_1^2 sheets). The description of the local geometry at nodes by itself is sufficient to capture qualitative aspects of shapes, in analogy to 2D. We derive a pointwise reconstruction formula to reconstruct a surface from this medial axis hypergraph together with the radius function. Thus, this information completely characterizes 3D shape and lays the theoretical foundation for its use in recognition, morphing, design, and manipulation of shapes.
On the Error-Correcting Capabilities of Cycle Codes of Graphs
Authors: Laurent Decreusefond, Gilles Zémor
Venue: Combinatorics, Probability and Computing (1997)

We are interested in a function f(p) that represents the probability that a random subset of edges of a &Delta;-regular graph G contains half the edges of some cycle of G. f(p) is also the probability that a codeword is corrupted beyond recognition when words of the cycle code of G are submitted to the binary symmetric channel. We derive a precise upper bound on the largest p for which f(p) can vanish when the number of edges of G goes to infinity. To this end, we introduce the notion of fractional percolation on trees, and calculate the related critical probabilities.
Care-O-bot II&mdash;Development of a Next Generation Robotic Home Assistant
Authors: Birgit Graf, Matthias Hans, Rolf D. Schraft
Venue: Autonomous Robots (2004)

Technical aids allow elderly and handicapped people to live independently and supported in their private homes for a longer time. As a contribution to such technological solutions, two demonstrator platforms for a robotic home assistant&mdash;called Care-O-bot&mdash;were designed and implemented at Fraunhofer IPA, Stuttgart. Whereas Care-O-bot I is only a mobile platform with a touch screen, Care-O-bot II is additionally equipped with adjustable walking supporters and a manipulator arm. It has the capability to navigate autonomously in indoor environments, be used as an intelligent walking support, and execute manipulation tasks. The control software of Care-O-bot II runs on two industrial PCs and a hand-held control panel. The walking aid module is based on sensors in the walking aid handles and on a dynamic model of conventional walking aids. In &ldquo;direct mode&rdquo;, the user can move along freely with the robot whereas obstacles are detected and avoided. In &ldquo;planned mode&rdquo;, he can specify a target and be lead there by the robotic assistant. Autonomous planning and execution of complex manipulation tasks is based on a symbolic planner and environmental information provided in a database. The user input (graphical and speech input) is transferred to the task planner and adequate actions to solve the task (sequence of motion and manipulation commands) are created. A new method for sensor based manipulation using a tilting laser scanner and camera integrated in the head of the robot has been implemented. Additional sensors in the robot hand increase the grasping capabilities. The walking aid has been tested with elderly users from an assisted living facility and a nursery home. Furthermore, the execution of fetch and carry tasks has been implemented and tested in a sample home environment.
TiltText: using tilt for text input to mobile phones
Authors: Daniel Wigdor, Ravin Balakrishnan
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

TiltText, a new technique for entering text into a mobile phone is described. The standard 12-button text entry keypad of a mobile phone forces ambiguity when the 26- letter Roman alphabet is mapped in the traditional manner onto keys 2-9. The TiltText technique uses the orientation of the phone to resolve this ambiguity, by tilting the phone in one of four directions to choose which character on a particular key to enter. We first discuss implementation strategies, and then present the results of a controlled experiment comparing TiltText to MultiTap, the most common text entry technique. The experiment included 10 participants who each entered a total of 640 phrases of text chosen from a standard corpus, over a period of about five hours. The results show that text entry speed including correction for errors using TiltText was 23% faster than MultiTap by the end of the experiment, despite a higher error rate for TiltText. TiltText is thus amongst the fastest known language-independent techniques for entering text into mobile phones.
Critical strategies for information systems development projects: perceptions of developers from the United States and Japan
Authors: Chung S. Kim, Dane K. Peterson
Venue: Advanced topics in global information management (2003)

This study investigated the perceptions of information systems (IS) developers from the United States and Japan with regards to the relative importance of 18 strategies that prior research has indicated are important for the successful implementation of an IS. The results of a principal components analysis revealed that the 18 IS strategies could be reduced to five components: (1) Organizational Integration, (2) Communications, (3) Characteristics of the Project Leader, (4) Characteristics of the Project Team Members, and (5) Project Development Techniques. The analysis also indicated that there were a significant difference in the perceptions of developers from the U.S. and Japan with respect to the importance of the five components. The developers from the U.S. viewed Communications as the most critical component and Project Leader Characteristics as the least important component. Conversely, developers from Japan perceived the Project Leader as the most crucial component for determining the success of an IS project. Team Member Characteristics was viewed as the least important component by developers from Japan. The results were discussed in terms of cultural differences.