ppxscal/embedding_network huggingface dataset:
A numerical simulation for the blow-up of semi-linear diffusion equations
Authors: F. De La Hoz, F. Vadillo
Venue: International Journal of Computer Mathematics (2009)

Many mathematical models have the property of developing singularities at a finite time; in particular, the solution u(x, t) of the semi-linear parabolic Equation (1) may blow up at a finite time T. In this paper, we consider the numerical solution with blow-up. We discretize the space variables with a spectral method and the discrete method used to advance in time is an exponential time differencing scheme. This numerical simulation confirms the theoretical results of Herrero and Velzquez [M.A. Herrero and J.J.L. Velzquez, Blow-up behavior of one-dimensional semilinear parabolic equations, Ann. Inst. Henri Poincare 10 (1993), pp. 131-189.] in the one-dimensional problem. Later, we use this method as an experimental approach to describe the various possible asymptotic behaviours with two-space variables.
Multimodal Robot/Human Interaction in an Assistive Technology Context
Authors: Ray Jarvis
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This paper outlines the framework of a complex system to demonstrate multimodal spatial and transactional intelligence in a robot which supports aged, frail, or otherwise disabled people in a domestic assistive technology context. The intention is that the robot be able to navigate around a known multi-room environment along optimal, collision-free paths in search and retrieval of requested objects such as spectacles, books etc. and must also be capable of tracking and following humans and of reminding them of times for meals, medication etc. and to lead disoriented subjects to their meal place at appropriate times and even dispense medication, if necessary. The modes of communication interchanges with the supported human include spoken speech and gestures (including eye gaze direction) within the context of situational analysis which accommodates recent history, temporal factors and individual user behavioural models. This paper provides an overview of an ambitious research project in its early stages but where many components have already been refined through earlier work.
Quantum-Inspired Genetic Algorithm Based on Simulated Annealing for Combinatorial Optimization Problem
Authors: Wanneng Shu
Venue: International Journal of Distributed Sensor Networks (2009)

Quantum-inspired genetic algorithm (QGA) is applied to simulated annealing (SA) to develop a class of quantum-inspired simulated annealing genetic algorithm (QSAGA) for combinatorial optimization. With the condition of preserving QGA advantages, QSAGA takes advantage of the SA algorithm so as to avoid premature convergence. To demonstrate its effectiveness and applicability, experiments are carried out on the knapsack problem. The results show that QSAGA performs well, without premature convergence as compared to QGA.
Conditional Converge Cast
Authors: Daisuke Inoue, Keisuke Tanaka
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we introduce a new notion of conditional converge cast (CCC), by adding the conditional property to converge cast. A CCC protocol with predicate Q is a three-party protocol which involves two senders S0 and S1 and a receiver R. S0 owns a secret x and a message m0, so does S1 with y and m1. In a protocol, S0 and S1 send their messages to R in a masked form. R obtains the message depending on the value of Q(x,y), i.e. R obtains m0 if Q(x,y)=0, or m1 otherwise. The secrets, x and y, are not revealed to R or the other sender, and Q(x,y) is not revealed to S0 and S1. In addition to the formulation, we propose a concrete scheme for conditional converge cast with the “equality” predicate.
Learning programming through fashion and design: a pilot summer course in wearable computing for middle school students
Authors: Winnie W.Y. Lau, Grace Ngai, Stephen C.F. Chan, Joey C.Y. Cheung
Venue: ACM SIGCSE Bulletin (2009)

As enrollments in engineering and computer science programs around the world have fallen in recent years, those who wish to see this trend reversed take heart from findings that children are more likely to develop an abiding interest in technology if they are exposed to it at an early age [3, 9]. In line with this research, we now see more summer camps and workshops being offered to middle school students with the objective of teaching programming and computer technology [1, 6, 8, 12]. To offer students a stimulating and interesting environment while teaching computing subjects, the learning tools in these camps usually revolve around robots and graphical programming of animations or games. These tools tend to mainly attract youngsters who like robotics or game design. However, we believe that we can improve the diversity of the student pool by introducing other topics. In this paper, we describe our experience in designing and organizing a programming course that focuses on wearable computing, fashion and design for middle school students. We will show that 1) wearable computing is interesting and inspiring to the students, 2) wearable computing motivates both boys and girls to learn technology and computing, which implies that it may be able to increase the potential computer science population, 3) wearable computing can provide a space for students to exercise their creativity while at the same time, teaching them about technology and programming.
Estimating crude cumulative incidences through multinomial logit regression on discrete cause-specific hazards
Authors: Federico Ambrogi, Elia Biganzoli, Patrizia Boracchi
Venue: Computational Statistics Data Analysis (2009)

In the presence of competing risks, the estimation of crude cumulative incidence, i.e. the probability of a specific failure as time progresses, has received much attention in the methodological literature. It is possible to estimate crude cumulative incidence starting from models defined on cause-specific hazards or to adopt regression strategies modeling directly the quantity of interest. A generalized linear model based on discrete cause-specific hazard is used to obtain the crude cumulative incidence and its asymptotic variance. The model allows inference both on cause-specific hazard and on crude cumulative incidence in the presence of time dependent effects. Standard software can be used to compute all quantities of interest. A trial of chemoprevention of leukoplakia is considered for illustrative purposes, where different patterns of risk are suspected for the different causes of treatment failure.
Underdetermined Blind Source Separation Using Linear Separation System
Authors: Jan Cermak, Zdenek Smekal
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

In automatic speech and speech emotion recognition, a good quality of input speech signal is often required. The hit rate of recognizers is lowered by degradation of speech quality due to noise. Blind source separation can be used to enhance the speech signal as a part of preprocessing techniques. This paper presents a multi channel linear blind source separation method that can be applied even in underdetermined case i.e. when the number of source signals is higher than the number of sensors. Experiments have shown that our system outperforms conventional time-frequency binary masking in both determined and underdetermined cases and significantly increases the hit rate of speech recognizers.
SAMOS: a model for monitoring students' and groups' activities in collaborative e-learning
Authors: Angel A. Juan, Thanasis Daradoumis, Javier Faulin, Fatos Xhafa
Venue: International Journal of Learning Technology (2009)

We address the issue of monitoring students' and groups' activities in online collaborative learning environments. Such monitoring can provide valuable information to online instructors, who may guide and support the development of efficient collaborative learning projects. We have developed and tested an information system, Student Activity Monitoring using Overview Spreadsheets (SAMOS), which facilitates the automatic generation of weekly monitoring reports derived from data contained in server log files. These reports provide online instructors with visual information regarding students' and groups' activity, thus allowing for a quick and easy classification of students and groups according to their activity level. That way, entities with a low activity level are easily identified, which allows the establishment of just-in-time assistance for them. Furthermore, instructors can use complementary qualitative monitoring reports, issued by the students themselves, to anticipate potential problems &ndash; such as student dropouts or possible conflicts inside the groups &ndash; and take operational and tactical decisions to handle them.
Invariant based programming: basic approach and teaching experiences
Authors: Ralph-Johan Back
Venue: Formal Aspects of Computing (2009)

Program verification is usually done by adding specifications and invariants to the program and then proving that the verification conditions are all true. This makes program verification an alternative to or a complement to testing. We describe here another approach to program construction, which we refer to as invariant based programming, where we start by formulating the specifications and the internal loop invariants for the program, before we write the program code itself. The correctness of the code is then easy to check at the same time as one is constructing it. In this approach, program verification becomes a complement to coding rather than to testing. The purpose is to produce programs and software that are correct by construction. We present a new kind of diagrams, nested invariant diagrams, where program specifications and invariants (rather than the control) provide the main organizing structure. Nesting of invariants provide an extension hierarchy that allows us to express the invariants in a very compact manner. We have studied the feasibility of formulating specifications and loop invariants before the code itself has been written in a number of case studies. Our experience is that a systematic use of figures, in combination with a rough idea of the intended behavior of the algorithm, makes it rather straightforward to formulate the invariants needed for the program, to construct the code around these invariants and to check that the resulting program is indeed correct. We describe our experiences from using invariant based programming in practice, both from teaching programmers how to construct programs that they prove correct themselves, and from teaching invariant based programming for CS students in class.
Subobject detection through spatial relationships on mobile phones
Authors: Benjamin Brombach, Erich Bruns, Oliver Bimber
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

We present a novel image classification technique for detecting multiple objects (called subobjects) in a single image. In addition to image classifiers, we apply spatial relationships among the subobjects to verify and to predict the locations of detected and undetected subobjects, respectively. By continuously refining the spatial relationships throughout the detection process, even locations of completely occluded exhibits can be determined. This approach is applied in the context of PhoneGuide, an adaptive museum guidance system for camera-equipped mobile phones. Laboratory tests as well as a field experiment reveal recognition rates and performance improvements when compared to related approaches.
Toward a Practical Module System for ACL2
Authors: Carl Eastlund, Matthias Felleisen
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Boyer and Moore's ACL2 theorem prover combines first-order applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being used for large programs, ACL2 forces programmers to rely on manually maintained protocols for managing modularity. In this paper, we present a prototype of Modular ACL2. The system extends ACL2 with a simple, but pragmatic functional module system. We provide an informal introduction, sketch a formal semantics, and report on our first experiences.
Research on Automobile Driving State Real-Time Monitoring System Based on ARM
Authors: Hongjiang He, Yamin Zhang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Research on Automobile Driving State Real-time Monitoring System is introduced in this paper, which takes S3C2410（ARM920T）microprocessor as the core and takes Linux as the operating system. This system adds the fault diagnosis expert system to the traditional automotive driving state monitoring system, which is only storing and displaying the driving state parameters on the base of the real-time monitoring for the automobile driving state. Employing the control method of the communication between the embedded system and CAN field bus; the proposed system can efficiently collect the status data related to the security performance of the automobile and integrate them. Fault diagnosis expert system is implemented for real time monitoring and diagnosing. It can also give some reasonable suggestions to the driver by comparing and analyzing the collected data, which makes this system more humane. The information can be displayed and the audio alert can be sounded through a human-machine interface. This system has a good prospect in the field of automotive electronics.
Applying a simulation-based tool to productivity management in an automotive-parts industry
Authors: Adrián Aguirre, Enrique Müller, Sebastián Seffino, Carlos A. Méndez
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This work presents the development and application of an advanced modeling, simulation and optimization-based framework focused on the production process of a basic element of a internal combustion engine which is supplied by a leading factory in the Latin-American market. Lying on the concepts of the process-interaction approach, the principal components available in the discrete event simulation environment "SIMUL8" were used to achieve the best representation of this complex manufacturing system. Furthermore, advanced SIMUL8's Visual Logic tools were utilized for modeling specific design and operation features arising in the process under study. The developed tool provides a support system for making operative, tactical and strategic decisions, allowing the evaluation of possible scenarios ranging from different operation schemes to potential alternatives of investment. The principal aim of this work is to provide a systematic methodology to improve the productive capacity management, enhancing the process profitability and the degree of customer satisfaction.
A coding-theoretic approach for efficient message verification over insecure channels
Authors: David Slater, Patrick Tague, Radha Poovendran, Brian J. Matt
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

We address the problem of allowing authorized users, who have yet to establish a secret key, to securely and efficiently exchange key establishment messages over an insecure channel in the presence of jamming and message insertion attacks. This problem was first introduced by Strasser, Pöpper, Čapkun, and Čagalj in their recent work, leaving joint consideration of security and efficiency as an open problem. In this paper, we present three approaches based on coding theory which reduce the overall time required to verify the packets and reconstruct the original message in the presence of jamming and malicious insertion. We first present the Hashcluster scheme which reduces the total overhead included in the short packets. We next present the Merkleleaf scheme which uses erasure coding to reduce the average number of packet receptions required to reconstruct the message. We then present the Witnesscode scheme which uses one-way accumulators to individually verify packets and reduce redundancy. We demonstrate through analysis and simulation that our candidate protocols can significantly decrease the amount of time required for key establishment in comparison to existing approaches without degrading the guaranteed level of security.
Applied Pareto multi-objective optimization by stochastic solvers
Authors: Miguel Martínez-Iranzo, Juan M. Herrero, Javier Sanchis, Xavier Blasco, Sergio García-Nieto
Venue: Engineering Applications of Artificial Intelligence (2009)

It is well known that many engineering design problems with different objectives, some of which can be opposed to one another, can be formulated as multi-objective functions and resolved with the construction of a Pareto front that helps to select the desired solution. Obtaining a correct Pareto front is not a trivial question, because it depends on the complexity of the objective functions to be optimized, the constraints to keep within and, in particular, the optimizer type selected to carry out the calculations. This paper presents new methods for Pareto front construction based on stochastic search algorithms (genetic algorithms, GAs and multi-objective genetic algorithms, MOGAs) that enable a very good determination of the Pareto front and fulfill some interesting specifications. The advantages of these applied methods will be proven by the optimization of well-known benchmarks for metallic supported I-beam and gearbox design.
Smart phone for mobile commerce
Authors: Yung Fu Chang, C. S. Chen, Hao Zhou
Venue: Computer Standards Interfaces (2009)

This paper surveys most of the currently available smart phones in the market. It summarizes its features and characteristics. From this study a set of must-have and desirable-to-have features for future generations of smart phones are described. The main drivers of smart phones that enable convenient and secure mobile commerce services such as electronic wallet, electronic payment, 3G broadband Internet access, and multimedia content are then described. Finally, payer-centric payment architecture is advocated to facilitate the adoption of smart phones for mobile commerce applications, in contrast to the current prevalent mode of payee-centric payment practice.
High-Performance Embedded Architecture and Compilation Roadmap
Authors: Koen Bosschere, Wayne Luk, Xavier Martorell, Nacho Navarro, Mike O'Boyle, Dionisios Pnevmatikatos, Alex Ramirez, Pascal Sainrat, André Seznec, Per Stenström, Olivier Temam
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

One of the key deliverables of the EU HiPEAC FP6 Network of Excellence is a roadmap on high-performance embedded architecture and compilation --- the HiPEAC Roadmap for short. This paper is the result of the roadmapping process that took place within the HiPEAC community and beyond. It concisely describes the key research challenges ahead of us and it will be used to steer the HiPEAC research efforts.The roadmap details several of the key challenges that need to be tackled in the coming decade, in order to achieve scalable performance in multi-core systems, and in order to make them a practical mainstream technology for high-performance embedded systems.The HiPEAC roadmap is organized around 10 central themes: (i) single core architecture, (ii) multi-core architecture, (iii) interconnection networks, (iv) programming models and tools, (v) compilation, (vi) run-time systems, (vii) benchmarking, (viii) simulation and system modeling, (ix) reconfigurable computing, and (x) real-time systems. Per theme, a list of challenges is identified. In total 55 key challenges are listed in this roadmap. The list of challenges can serve as a valuable source of reference for researchers active in the field, it can help companies building their own R D roadmap, and --- although not intended as a tutorial document --- it can even serve as an introduction to scientists and professionals interested in learning about high-performance embedded architecture and compilation.
IT Investment Evaluation: A Suitability Analysis of Financial Evaluation Measures
Authors: Uwe Wohlfahrt
Venue:  (2007)

Investments in Information Technology (IT) seem to go without saying. IT is said to enhance organizational capabilities, resulting in improved product quality and variety, increased customer satisfaction, open up new business opportunities and markets and hence contributing to sales increases, to name only a few expectations that arise from IT investments. But at the same time executives cannot specify these benefits or do not know how to quantify them. Improvements, enabled by IT, are often not reflected in improved financial performance or productivity growth, although research and practice come up with many different financial evaluation methods. But how suitable are these methods to evaluate IT investments? To find an answer to this question Uwe Wohlfahrt analyzes the characteristics of IT investments and different evaluations measures (such as ROI, EVA, Tobin's q, Real options etc.) in detail and afterwards elaborate if these methods can meet the requirements that arise from IT investments. After showing the status quo of IT investment evaluation in practise and an examination if this is done properly, the author suggests a framework, which assigns evaluation measures to an appropriate IT investment category. Such a framework can support executives in finding a suitable measure to evaluate a certain IT investment.
Wavelet-based fingerprint image retrieval
Authors: Javier A. Montoya Zegarra, Neucimar J. Leite, Ricardo da Silva Torres
Venue: Journal of Computational and Applied Mathematics (2009)

This paper presents a novel approach for personal identification based on a wavelet-based fingerprint retrieval system which encompasses three image retrieval tasks, namely, feature extraction, similarity measurement, and feature indexing. We propose the use of different types of Wavelets for representing and describing the textural information presented in fingerprint images in a compact way. For that purpose, the feature vectors used to characterize the fingerprints are obtained by computing the mean and the standard deviation of the decomposed images in the wavelet domain. These feature vectors are used both to retrieve the most similar fingerprints, given a query image, and their indexation is used to reduce the search spaces of candidate images. The different types of Wavelets used in our study include: Gabor wavelets, tree-structured wavelet decomposition using both orthogonal and bi-orthogonal filter banks, as well as the steerable wavelets. To evaluate the retrieval accuracy of the proposed approach, a total number of eight different data sets were considered. We also took into account different combinations of the above wavelets with six similarity measures. The results show that the Gabor wavelets combined with the Square Chord similarity measure achieves the best retrieval effectiveness.