ppxscal/embedding_network huggingface dataset:
Toward the placement of power management points in real-time applications
Authors: Nevine AbouGhazaleh, Daniel Mossé, Bruce Childers, Rami Melhem
Venue: Compilers and operating systems for low power (2003)

Dynamically changing CPU voltage and frequency has been shown to greatly save the processor energy. These adjustments can be done at specific power management points (PMPs), which are not without overheads. In this work we study the effect of different overheads on both time and energy; these can be seen as the overhead of computing the new speed, and then the overhead of dynamically adjusting the speed. We propose a theoretical solution for choosing the granularity of inserting PMPs in a program taking into consideration such overheads. We validate our theoretical results and show that the accuracy of the theoretical model is very close to the simulations we carry out.
Fractional-order system identification based on continuous order-distributions
Authors: Tom T. Hartley, Carl F. Lorenzo
Venue: Signal Processing (2003)

This paper discusses the identification of fractional- and integer-order systems using the concept of continuous order-distribution. Based on the ability to define systems using continuous order-distributions, it is shown that frequency domain system identification can be performed. Least-squares techniques are applied to discretized order-distributions. Methods are presented for properly discretizing the order-distribution.
Metadata Standards for Educational Resources
Authors: Marilyn McClelland
Venue: Computer (2003)

The Dublin Core and IEEE Learning Object Metadata standards facilitate reuse of educational resources.
Information encoding into and decoding from dot texture for active forms
Authors: Bilan Zhu, Masaki Nakagawa
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

We describe here information encoding and decoding methods applied to dot texture for active forms. We employ dot texture made of tiny dots and looking like gray color to print various forms. This facilitates the separation of handwriting from its input frame even under monochrome printing/reading environments. It also makes the forms determine how to process filled-in handwriting according to the information embedded in the dot texture. The embedded information results in an improved recognition rate of handwriting, and allows the form processing to be directed by the form itself rather than by the form reading machine. Thus, the form-reading machine becomes a general-purpose machine allowing different forms inputted into it to be processed differently as specified by each form. We compare various dot shapes and information encoding/decoding methods for those shapes. Then, we present how to locate input frames, separate handwriting from input frames and segment handwriting into characters. We also present preliminary evaluation of the described methods.
On the minor-minimal 3-connected matroids having a fixed minor
Authors: Manoel Lemos, James Oxley
Venue: European Journal of Combinatorics (2003)

Let N be a minor of a 3-connected matroid M such that no proper 3-connected minor of M has N as a minor. This paper proves a bound on |E(M) - E(N)| that is sharp when N is connected.
Self-assembling DNA graphs
Authors: Phiset Sa-Ardyen, Natašsa Jonoska, Nadrian C. Seeman
Venue: Natural Computing: an international journal (2003)

It has been shown theoretically that three dimensional graph structure and DNA self-assembly can be used to solve numerous computational problems such as 3-SAT and 3-colorability in a constant number of laboratory steps. In this assembly, junction molecules and duplex DNA molecules are the basic building blocks. This paper presents experimental results of DNA self-assembly of non regular graphs using junction molecules as vertices and duplex DNA molecules as edge connections.
Parallel Two-Step W-Methods with Peer Variables
Authors: Bernhard A. Schmitt, Rüdiger Weiner
Venue: SIAM Journal on Numerical Analysis (2004)

A new class of methods for the solution of stiff initial value problems is introduced that is parallel by design. It has a two-step character and propagates s different "peer" solution variables with essentially identical characteristics from step to step. The main work lies in the solution of s independent linear stage equations which may be solved in parallel. Convergence of order s-1 and stability for general stepsize sequences are proved. Conditions for order s and stronger stability criteria are addressed as well. Promising methods up to order 7 are identified by numerical tests with some widely used stiff test problems. Some of these are competitive with existing software even in sequential computations.
A Multi-Interface, Multi-Profiling System for Chronic Disease Management Learning
Authors: Jim Warren, Maria Lundström, David Osborne, Monica Kempster, Sara Jones, Chunlan Ma, Mark Jasiunas
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

A key aspect of successful chronic disease management is active partnership between consumer and provider -- this is particularly important in diabetes management, where many key activities are in the hands of the patient. We have developed a multi-interface system that promotes high-quality diabetes management through profiling and adaptive support of both consumer and provider in the context of a University podiatry clinic. Handheld devices are used for decision support, data capture and notification of patient concerns in consultation. Consultation data integrates with Web-based learning environments for podiatry students and consumers. The architecture implements our approach to patient-provider partnership and exemplifies integration of system goals across platforms, users and devices. Upcoming field trials will assess whether we have achieved an acceptable system that improves quality of management activities.
Image compression using self-organizing maps
Authors: C. Amerijckx, J.-D. Legat, M. Verleysen
Venue: Systems Analysis Modelling Simulation (2003)

The self-organizing Kohonen map is a reliable and efficient way to achieve vector quantization. Typical application of such algorithm is image compression. Moreover, Kohonen networks realize a mapping between an input and an output space that preserves topology. This feature can be used to build new compression schemes which allow to obtain better compression rate than with classical method as JPEG without reducing the image quality. Compared to JPEG, our lossy compression scheme shows better performances (in terms of PSNR) for compression rates higher than 30 [C. Amerijckx, M. Verleysen, P. Thissen and J.-D. Legat (1998). Image compression by self-organized Kohonen map. IEEE Transactions on Neural Networks, 9(3), 503-507.]. For lossless compression, this rate is about 2.7 for standard images.
Godunov-Type Methods for Conservation Laws with a Flux Function Discontinuous in Space
Venue: SIAM Journal on Numerical Analysis (2004)

Scalar conservation laws with a flux function discontinuous in space are approximated using a Godunov-type method for which a convergence theorem is proved. The case where the flux functions at the interface intersect is emphasized. A very simple formula is given for the interface flux. A numerical comparison between the Godunov numerical flux and the upstream mobility flux is presented for two-phase flow in porous media. A consequence of the convergence theorem is an existence theorem for the solution of the scalar conservation laws under consideration. Furthermore, for regular solutions, uniqueness has been shown.
Narrative event adaptation in virtual environments
Authors: Karl E. Steiner, Jay Tomkins
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

There is a tension between user and author control of narratives in multimedia systems and virtual environments. Reducing the interactivity gives the author more control over when and how users experience key events in a narrative, but may lead to less immersion and engagement. Allowing the user to freely explore the virtual space introduces the risk that important narrative events will never be experienced. One approach to striking a balance between user freedom and author control is adaptation of narrative event presentation (i.e. changing the time, location, or method of presentation of a particular event in order to better communicate with the user). In this paper, we describe the architecture of a system capable of dynamically supporting narrative event adaptation. We also report results from two studies comparing adapted narrative presentation with two other forms of unadapted presentation - events with author selected views (movie), and events with user selected views (traditional VE). An analysis of user performance and feedback offers support for the hypothesis that adaptation can improve comprehension of narrative events in virtual environments while maintaining a sense of user control.
Experimental evaluation of vision and speech based multimodal interfaces
Authors: Emilio Schapira, Rajeev Sharma
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

Progress in computer vision and speech recognition technologies has recently enabled multimodal interfaces that use speech and gestures. These technologies o er promising alternatives to existing interfaces because they emulate the natural way in which humans communicate. However, no systematic work has been reported that formally evaluates the new speech/gesture interfaces. This paper is concerned with formal experimental evaluation of new human-computer interactions enabled by speech and hand gestures.The paper describes an experiment conducted with 23 subjects that evaluates selection strategies for interaction with large screen displays. The multimodal interface designed for this experiment does not require the user to be in physical contact with any device. Video cameras and long range microphones are used as input for the system. Three selection strategies are evaluated and results for Different target sizes and positions are reported in terms of accuracy, selection times and user preference. Design implications for vision/speech based interfaces are inferred from these results. This study also raises new question and topics for future research.
Multicasting in mobile ad-hoc networks: achieving high packet delivery ratios
Authors: Thomas Kunz
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Multicasting is intended for group-oriented computing. There are more and more applications where one-to-many or many-to-many dissemination is an essential task. The multicast service is critical in applications characterized by the close collaboration of teams. Many applications, such as audio/video distribution, can tolerate loss of data content, but many other applications cannot. In addition, even loss-tolerant applications will suffer a performance penalty: an audio stream may experience a short gap or lower fidelity in the presence of loss. This paper describes our experience with implementing a multicast routing protocol that delivers packets to all intended recipients with high probability. Due to a number of reasons, 100% packet delivery cannot be achieved, but packet delivery ratios in excess of 99% are possible in most cases.
Probabilistic neural network classifier versus multilayer perceptron classifier in discriminating brain spect images of patients with diabetes from normal controls
Authors: I. Kalatzis, N. Piliouras, D. Pappas, E. Ventouras, D. Cavouras
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The aim of this study was to compare the performance of the probabilistic neural network (PNN) classifier with the multilayer perceptron (MLP) classifier, in an attempt to discriminate between patients with diabetes mellitus type II (DMII) and normal subjects using medical images from brain single photon emission computed tomography (SPECT). Features from the gray-level histogram and the spatial-dependence matrix were generated from image-samples collected from brain SPECT images of diabetic patients and healthy volunteers, and they were used as input to the PNN and the MLP classifiers. Highest accuracies were 99.5% for the MLP and 99% for the PNN and they were achieved in the left inferior parietal lobule, employing the mean value and correlation features. Our findings show that the MLP classifier outperformed slightly the PNN classifier in almost all cerebral regions, but the lower computational time of the PNN makes him a very useful classification tool. The high precision of both classifiers indicate significant differences in radio-pharmaceutical (99mTc-ECD) uptake of diabetic patients compared to the normal controls, which may be due to cerebral blood flow disruption in patients with DMII.
Mechanical systems and assemblies modeling using knowledge-intensive Petri nets formalisms
Authors: X. F. Zha, H. Du
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

This paper presents a novel knowledge-based Petri net approach to mechanical systems and assemblies modeling within a design with objects environment. A new unified class of object-oriented knowledge Petri nets, which can incorporate a knowledge-based system with ordinary Petri nets, is defined and used for the unified representations of assembly design and modeling. The object knowledge Petri nets, as a graphical language and a new knowledge-based description scheme, can be used to express the qualitative and quantitative aspects of the assembly design and modeling process in an interactive and integrated way. The four-level hierarchy model is proposed and constructed in terms of function-behaviors, structures, geometries, and features. The function-behavior-structure description is built on more abstract concepts so that it can match well top-down design. The static and dynamic characteristics in the design of assembly can also be captured. With the help of fuzzy logic, the incomplete, imprecise knowledge and uncertainty in the design process can also be dealt with. Therefore, the hybrid design object model can incorporate product data model, top-down design process, and assembly process model using an object-oriented, knowledge-based, feature-based, parametric, and constraint-based modeling approach, and can provide a more accurate and more flexible representation. To verify and demonstrate the effective use of the proposed hybrid design object model, a prototype system has been developed. This research provides a knowledge-intensive framework for intelligent assembly design and modeling.
Towards the creation of accessibility agents for non-visual navigation of the web
Authors: K. Kottapally, C. Ngo, R. Reddy, E. Pontelli, T. C. Son, D. Gillan
Venue: Issue 73-74 (June-September 2002) (2002)

In this paper, we highlight the main research directions currently pursued by the investigators for the development of new tools to improve Web accessibility for users with visual disabilities. The overall principle is to create intelligent software agents used to assist visually impaired individuals in accessing complex on-line data organizations (e.g., tables, frame structures) in a meaningful way. Accessibility agents make use of knowledge representation structures (automatically or manually derived) to assist users in developing navigation plans; these are employed to locate given pieces of information or to answer user's desired goals.
Triangle-Free Graphs with Large Degree
Authors: C. C. Chen, G. P. Jin, K. M. Koh
Venue: Combinatorics, Probability and Computing (1997)

A graph G is called an H-type graph for some graph H if there is a mapping from V(G) to V(H) preserving edges. In this paper, we shall prove that: (1) every triangle-free graph G of order n with &chi;(G)&le;3 and &delta;(G)>n&#x002F;3 is of Fd-type for some d&ge;1, where Fd is a certain d-regular triangle-free Hamiltonian Cayley graph of order 3d&minus;1, (2) every triangle-free graph G of order n with &chi;(G)&ge;4 and &delta;(G)>n&#x002F;3 contains the Mycielski graph (see Figure 2) as a subgraph.
A new approach for implementing stand-alone and Web-based interpreters for Java
Authors: Stephan Diehl, Claudia Bieg
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Compared to imperative programming languages like Pascal or Basic, or functional programming languages like ML or Haskell learning Java is hampered by the fact that to get even the simplest running program the learner has to define a public class and a method with a certain signature. We present both a stand-alone and a web-based interpreter which execute Java fragments and relieve the learner from programming all the extra code. The implementation of these interpreters extremely differs from other Java interpreters and exploits the Java compiler as much as possible to preserve the original semantics of Java and allow access to all features and APIs of Java. By virtue of these interpreters the learner can explore primitive values, variables, expressions, assignments, and control-flow statements before even knowing about classes and methods. The web-based interpreter has been integrated into an online tutorial for learning Java programming from basic principles.
Understanding the semantics of sensor data
Authors: Murali Mani
Venue: ACM SIGMOD Record (2003)

Our system architecture to manage sensor data is described. Our data mining applications require past history of the sensor data. Therefore, unlike most present systems that focus on streaming data, and cache a small window of historic data, we store the entire historic data. Several interesting problems arise in these scenarios. We study two of them: (a) Given that a sensor can send data corresponding to its current configuration at any particular instant, how do we define the data that should be stored in the database? (b) Sensors try to minimize the amount of data transmitted. Also there could be data loss in the network. So the data stored will have lots of "holes". In this case, how can an application make sense of the stored data? In this paper, we describe our approach to solve these problems that enables an application to recreate the environment that generated the data as precisely as possible.
Object persistence in Java
Authors: Tom Lunney, Aidan McCaughey
Venue: Proceedings of the 2nd international conference on Principles and practice of programming in Java (2003)

Object persistence in Java is first introduced and basic object persistence is demonstrated via exemplars that address both applications and applets. We then proceed to consider Java language persistence and overview research activity in this area.
Signal processing and eigenvalue decomposition of polygonal meshes and applications
Authors: Eugene L. Fiume
Venue:  (2003)

The continuing trend of increased mesh complexity appears to have reached a point where traditional computed-aided geometric design techniques, especially those based on geometric optimization, are often too expensive computationally. In this thesis, we take a signal processing approach to model and solve problems related to large, irregular 3-D meshes, and provide the first formal treatment of the topic. We formalize the basic concepts of mesh signal processing by defining and studying several important concepts from image processing, such as convolution, in the 3-D irregular grid setting. We analyze eigenvalue decomposition , which extends the classical Fourier transform (DFT) to ED-transforms for mesh modeling, from a theoretical point of view. We suggest necessary conditions under which ED-transforms resemble the classical DFTs and examine the similarities and differences between them. In particular, we formulate and prove several fundamental results about ED-transforms that are analogous to the basic DFT theorems of 1-D signals. We also explore the many useful applications of eigenvalue decomposition, such as mesh fairing, feature enhancement, mesh partitioning, spectral compression, and water marking. Specifically, we present new algorithms and techniques we have developed for shape-preserving mesh fairing, e.g., using Butterworth filters, and for shape matching and similarity. Finally, our study has motivated us to design a new and improved linear operator for eigenvalue decomposition.
Automatically creating personalised exercises based on student profiles
Authors: Chye-Foong Yong, Colin Higgins
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Course Marker (CM - previously called Course Master), is a CAA system that marks programming code and diagrams and is a reengineered version of the Ceilidh system. It has been used in many higher institutions around the world, including at its developers' base, the School of Computer Science & IT, at the University of Nottingham. CM allows teachers to set exercises, and students to submit their solutions to these exercises. Upon each submission, students obtain immediate marks and detailed feedback from the system [4].The system has been well received and is excellent at marking exercises. However it can be extended in a variety of ways. This paper describes such an enhancement based on customising the questions to individual students by generating a personalised set of questions. Currently, all students are given the same set of exercises.To improve the learning environment, the idea is to use tailored multi-modal questionnaires. Firstly new types of question have been added to CourseMarker functionality. Initially these are the fixed response type of question such as multiple choice and multiple answer. Later more sophisticated types based on the full power of CourseMarker will be added. These are combined with currently available programming exercises and diagram based questions into a multi-modal questionnaire consisting of multiple types of question.Initially the questions in a given questionnaire are fixed by the teacher and pre-selected from a question bank. The next step is to allow the system to choose a set of questions dynamically from the question bank so as to give each student a different questionnaire.A major enhancement to this, and the main thrust of the research, is to tailor each questionnaire individually to each student at an appropriate level of difficulty for that students' ability. That is we will generate personalised exercises for each student, according to some individual student profile.Metadata for the students' profile, such as their background, their current level of knowledge on pre-requisite and current topics and subjects, and their preferred or best learning modes, are to be stored in a user model [2]. All this information can be obtained by interacting with applications such as Knowledge Tree [3] and WHURLE [1] and by using the outcome of earlier questionnaires.This poster presentation will explain the work involved to incorporate these enhancements.
The design and implementation of a reconfigurable processor for problems of combinatorial computation
Authors: Iouliia Skliarova, António B. Ferrari
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2003)

The paper analyses different techniques that might be employed in order to solve various problems of combinatorial optimization and argues that the best results can be achieved by the use of software running on a general-purpose computer together with an FPGA-based reconfigurable co-processor. It suggests an architecture for a combinatorial coprocessor that is based on hardware templates and consists of reconfigurable functional and control units. Finally the paper demonstrates how the co-processor can be applied to two practical applications formulated over discrete matrices, the Boolean satisfiability and covering problems.