ppxscal/embedding_network huggingface dataset:
Etude des m&eacute;taphores temporelles sur la perception du temps d'attente
Authors: Guillaume Gronier, Salim Gomri
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

During the Human-Computer Interactions (HCI), the user is sometimes faced with waiting periods. Presentations of metaphors like icons or progress bars often improve these waiting periods. This current research will examine the influence of time's metaphors on user satisfaction and their perception of waiting periods. The hypothesis supported in this article consists of some metaphors giving the user an impression of a shorter waiting period than others, displaying an equally long period. Based on collected data through experimentation, it is then possible to differentiate between interfaces with high or low "waiting period improvement" for the design of human-computer interfaces.
Narrowing the generation gap between virtual machines and minicomputers
Authors: Henry J. Theberge, Eric E. Beaverstock
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

A virtual machine system has been defined by R. Goldberg as "A system ... which ... is a hardware-software duplicate of a real existing machine in which a non-trivial subset of the virtual machine's instructions execute directly on the host machine, ...".
A Novel Local Smoothness Constrained Side-Information Frame Generator
Authors: Peng Wang, Jia Wang, Songyu Yu, Yuye Pang
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The quality of the Side-information frame (S frame) influences significantly the rate-distortion performance in the Distributed Video Coding (DVC). In this letter, we propose an efficient Side-Information Frame Generator (SIFG). It considers smoothness constraints of both the motion vector field and spatial adjacent pixels. Simulation results show that the proposed techniques provide potential rate-distortion performance advantages. Besides, the fine visual quality of the S frame is obtained.
Optimised Computational Functional Imaging for Arteries
Authors: Ramiro Moreno, Ming Chau, Shirod Jeetoo, Franck Nicoud, Frédéric Viart, Anne Salvayre, Hervé Rousseau
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The general framework of the Optimised Computational Functional Imaging for Arteries (OCFIA) program is to introduce high-performance scientific computing in the medical domain with the aim to rationalize therapeutic decisions in respect to vascular diseases yet poorly understood. More precisely, it consists in coupling medical imaging techniques, essentially morphological, with scientific computing, through Computational Fluid Dynamics (CFD), to yield functional imaging, thus providing to physicians a better quantitative knowledge of the biomechanical state (field of speeds, pressure, wall and Stent Graft loads ...) to the patients.
SPM management using Markov chain based data access prediction
Authors: Taylan Yemliha, Shekhar Srikantaiah, Mahmut Kandemir, Ozcan Ozturk
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular accesses like scalar values and array expressions with affine subscript functions have been tractable for compiler analysis (to be prefetched into SPM), irregular accesses like pointer accesses and indexed array accesses have not been easily amenable for compiler analysis. This paper presents an SPM management technique using Markov chain based data access prediction for such irregular accesses. Our approach takes advantage of inherent, but hidden reuse in data accesses made by irregular references. We have implemented our proposed approach using an optimizing compiler. In this paper, we also present a thorough comparison of our different dynamic prediction schemes with other SPM management schemes. SPM management using our approaches produces 12.7% to 28.5% improvements in performance across a range of applications with both regular and irregular access patterns, with an average improvement of 20.8%.
A Robust Denoising Filter with Adaptive Edge Preservation
Authors: Li-Cheng Chiu, Chiou-Shann Fuh
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

To preserve edge information during noise removal, bilateral filtering is designed as a powerful denoising filter using Gaussian function with geometric and photometric information. Unfortunately, peak noise will be regarded as effective high-frequency information and degrade the performance of bilateral filter. We design a new robust denoising filter employing image pre-processing and high-frequency edge detection. This filter can preserve details and remove noise simultaneously and it performs better than bilateral filter.
Investigation on mechanical strength and lifetime of PANDA polarization-maintaining fibers fabricated by PCVD method
Authors: Honghai Wang, Jing Li, Feng Tu, Hongbo Wei, Song Wang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, the brief fabricating process of PANDA polarization maintaining optical fibers by PCVD method is introduced. And the mechanical strength and employing lifetime of PCVD polarization maintaining fibers under room temperature and 125&deg;C temperature are investigated and compared. All results indicate that PANDA polarization maintaining fibers fabricated by PCVD method possess excellent mechanical properties and long-term reliability.
An automatic method for burn scar mapping using support vector machines
Authors: X. Cao, J. Chen, B. Matsushita, H. Imura, L. Wang
Venue: International Journal of Remote Sensing (2009)

Wildfires release large amounts of carbon, smoke and aerosols that strongly impact the global climatic system. Burn scar is an important parameter when modelling the impact of wildfires on the ecosystem and the climatic system. We have developed an automatic burn scar mapping method using daily Moderate Resolution Imaging Spectroradiometer (MODIS) data, in which the Global Environment Monitoring Index (GEMI), a vegetation index VI3T and a new index, GEMI-Burn scar (GEMI-B), were used together to enhance the differences between burned and unburned pixels related to vegetation photosynthesis, surface temperature and vegetation water content, respectively, and an automatic region growing method based on Support Vector Machines (SVMs) was used to classify burn scars without any predefined threshold. A case study was carried out to validate the new method at the border area between Mongolia and China, where a wildfire took place in May 2003. The results show that the burn scar area extracted by the new method is consistent with that from Landsat Thematic Mapper (TM) data with high accuracy. The sound performance of the new technique is due to the following reasons: (1) multiple features of burn scar spectra were combined and used, (2) a reasonable assumption was made stating that the neighbourhoods of active fires (hotspots) are most likely to be burn scars, (3) an SVM classifier was adopted that works well with a small number of training samples, and (4) an iterative classification procedure was developed that is capable of running continuous training for the SVM classifier to deal with the transitionary features of burn scar pixels. The results suggest that the new index GEMI-B and automatic mapping method based on SVMs have the potential to be applied to near real-time burn scar mapping in grassland areas.
Design and Realization of Embedded Web Gateway Server
Authors: Huimin He, Jing Wang, Lingling Si, Shuying Li
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Information and digital age presents tremendous opportunity to the development of embedded products and shows the embedded market a prosperous prospect, Web server embedded in equipment can provide uniform operation and control interface based on browser mode for any legal user accessing to its network, browser has become the front control board of equipment and a hot spot for development in recent years. This paper introduces in detail the transplantation and system software design of embedded Web server, methods of constructing Boa Web server under a constructed ARM+μCLinux development platform and design and realization process of remote monitoring application program.
STREAM: A First Programming Process
Authors: Michael E. Caspersen, Michael Kolling
Venue: ACM Transactions on Computing Education (TOCE) (2009)

Programming is recognized as one of seven grand challenges in computing education. Decades of research have shown that the major problems novices experience are composition-based---they may know what the individual programming language constructs are, but they do not know how to put them together. Despite this fact, textbooks, educational practice, and programming education research hardly address the issue of teaching the skills needed for systematic development of programs. We provide a conceptual framework for incremental program development, called Stepwise Improvement, which unifies best practice in modern software development such as test-driven development and refactoring with the prevailing perspective of programming methodology, stepwise refinement. The conceptual framework enables well-defined characterizations of incremental program development. We utilize the conceptual framework to derive a programming process, STREAM, designed specifically for novices. STREAM is a carefully down-scaled version of a full and rich agile software engineering process particularly suited for novices learning object-oriented programming. In using it we hope to achieve two things: to help novice programmers learn faster and better while at the same time laying the foundation for a more thorough treatment of more advanced aspects of software engineering. In this article, two examples demonstrate the application of STREAM. The STREAM process has been taught in the introductory programming courses at our universities for the past three years and the results are very encouraging. We report on a small, preliminary study evaluating the learning outcome of teaching STREAM. The study indicates a positive effect on the development of students&rsquo; process competences.
A novel approach to color normalization using neural network
Authors: H. D. Cheng, Xiaopeng Cai, Rui Min
Venue: Neural Computing and Applications (2009)

Color is a powerful descriptor that often simplifies object extraction and identification, and many computer vision systems use color to aid object recognition. However, image colors strongly depend on lighting geometry (direction and intensity of light source) and illuminant color (spectral power distribution). Either small variation in the intensity or the change of scene illumination can dramatically make object color changed. To overcome the lighting dependency problem, a color constancy or normalization algorithm should be used for preprocessing. This paper presents a novel approach to performing color normalization. A nonlinear mapping function is estimated using a neural network. Once the mapping function is found accurately, an image under unknown illumination may be transformed to the image under the predetermined illumination, which will be useful for color image processing. Three groups of experiments were conducted. In our experiments, images are processed by various neural networks and the performance is boosted by using a committee machine, and then the mapping errors are estimated and the results are compared with those of other algorithms. The experimental results demonstrate that the performance of the proposed method is superior to that of other color normalization algorithms.
Automating the constraining process
Authors: Joel J. Luna
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The typical approach to finding minimum levels of resources that still allow support and operational performance goals to be met for military aircraft is based on a manual trial-and-error method. This is because the function to be minimized (total manpower levels) is an input, and constraints (in terms of support and operational goals) are outputs. An approach with algorithms for automating this optimization, called constraining, is presented, based on dividing the range of total manpower into partitions and then searching for the lowest partition that still returns a manpower allocation that meets the performance goals. A tool, which was developed implementing this approach, is also discussed and results are presented. The conclusion is that while analysts are surprisingly good at finding minimum levels of resources, an automated approach produces acceptable results which are also reproducible and reduce analyst workload.
Experiences Building a Standards-Based Service Description Repository
Authors: Paul A. Buhler, Robert W. Thomas
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

Approaches to Web service composition are dependent upon some form of repository to hold service descriptions. Most service composition software relies upon highly-optimized and proprietary formats for representing service descriptions and storing them into a repository. Unlike these approaches, this paper reports on the development and evolution of a standards-based service description repository. The evolutionary aspect of the described service description repository is of interest as it provides insight into the rapidly changing landscape of semantic technologies and tools; from topic maps to triple-spaces. The work described in this paper is contextualized against the backdrop of the Web Services Challenge an annual software competition which fosters research in the realm of Web service discovery and composition.
Speeding up call center simulation and optimization by Markov chain uniformization
Authors: Eric Buist, Wyean Chan, Pierre L'Ecuyer
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their sensitivity. Simplified models that provide tractable formulas are unrealistic in general. In this paper we explore an intermediate solution, based on an approximate continuous-time Markov chain model of the call center. This model is more accurate than the commonly used approximations, and yet can be simulated faster than a more realistic simulation (based on non-exponential distributions and additional details). To speed up the simulation, we uniformize the Markov chain and simulate only its discrete-time version. We show how performance measures such as the fraction of calls of each type answered within a given waiting time limit can be recovered from this simulation, how to synchronize common random numbers in this setting, and how to use this in the first phase of an optimization algorithm based on the cutting plane method. We also discuss various implementation issues and provide empirical results.
Keynote lecture I: distributed estimation using wireless sensor networks
Authors: Georgios B. Giannakis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Envisioned applications of wireless sensor networks (WSNs) include surveillance, monitoring and tracking tasks. These motivate well decentralized estimation and smoothing of deterministic and (non)stationary random signals using (possibly correlated) observations collected across distributed sensors. In this talk we present state-of-the-art algorithms for consensus-based distributed estimation using ad hoc WSNs where sensors communicate over single-hop noisy links. The novel framework reformulates basic estimation criteria such as least-squares, maximum-likelihood, maximum a posteriori, and linear mean-square error, as decomposable, constrained, convex optimization problems that are amenable to distributed solutions. The resultant distributed estimators are provably convergent to their centralized counterparts and robust to communication noise. Besides stationary, the framework encompasses adaptive filtering and smoothing of non-stationary signals through distributed LMS and Kalman filtering.
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
Authors: F. Babonneau, J.-P. Vial
Venue: Mathematical Programming: Series A and B (2009)

This paper proposes an implementation of a constrained analytic center cutting plane method to solve nonlinear multicommodity flow problems. The new approach exploits the property that the objective of the Lagrangian dual problem has a smooth component with second order derivatives readily available in closed form. The cutting planes issued from the nonsmooth component and the epigraph set of the smooth component form a localization set that is endowed with a self-concordant augmented barrier. Our implementation uses an approximate analytic center associated with that barrier to query the oracle of the nonsmooth component. The paper also proposes an approximation scheme for the original objective. An active set strategy can be applied to the transformed problem: it reduces the dimension of the dual space and accelerates computations. The new approach solves huge instances with high accuracy. The method is compared to alternative approaches proposed in the literature.
Constraint Satisfaction Problems with Infinite Templates
Authors: Manuel Bodirsky
Venue: Complexity of Constraints: An Overview of Current Research Themes (2008)

Allowing templates with infinite domains greatly expands therange of problems that can be formulated as a non-uniformconstraint satisfaction problem. It turns out that many CSPs overinfinite templates can be formulated with templates that are&omega;-categorical. We survey examples of such problems intemporal and spatial reasoning, infinite-dimensional algebra,acyclic colorings in graph theory, artificial intelligence,phylogenetic reconstruction in computational biology, and treedescriptions in computational linguistics.We then give an introduction to the universal-algebraic approachto infinite-domain constraint satisfaction, and discuss how cores,polymorphism clones, and pseudo-varieties can be used to study thecomputational complexity of CSPs with &omega;-categoricaltemplates. The theoretical results will be illustrated by examplesfrom the mentioned application areas. We close with a series ofopen problems and promising directions of future research.
Bijections for 2-plane trees and ternary trees
Authors: Nancy S. S. Gu, Helmut Prodinger
Venue: European Journal of Combinatorics (2009)

According to the Fibonacci number which is studied by Prodinger et al., we introduce the 2-plane tree which is a planted plane tree with each of its vertices colored with one of two colors and -free. The similarity of the enumeration between 2-plane trees and ternary trees leads us to build several bijections. Especially, we found a bijection between the set of 2-plane trees of n+1 vertices with a black root and the set of ternary trees with n internal vertices. We also give a combinatorial proof for a relation between the set of 2-plane trees of nn
On the estimators of model-based and maximal reliability
Authors: Haruhiko Ogasawara
Venue: Journal of Multivariate Analysis (2009)

Four estimators of the reliability for a composite score based on the factor analysis model and five estimators of the maximal reliability for the composite are presented. When the Wishart maximum likelihood is used for the estimation of the model parameters, it is shown that the five estimators of maximal reliability are the same. Asymptotic cumulants of the estimators and their logarithmic transformations are derived under arbitrary distributions with possible model misspecification. The theoretical results considering model misspecification when a model does not hold are shown to be closer to their simulated values than those neglecting model misspecification. Simulations of the confidence intervals using the normal approximation based on the asymptotically distribution-free theory and the asymptotic expansion by Hall's method with variable transformation are performed.
On-line user-computer interface: the effects of interface flexibility, terminal type, and experience on performance
Authors: George H. Walther, Harold F. O'Neil,  Jr.
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In less than two decades the electronic digital computer has evolved from a high-speed replacement for the abacus to a full-fledged partner in dialogue with humans. By its very nature, on-line computing thrusts the user into an entirely different environment than does conventional batch processing. The problems inherent in a person's being made a system component---in a sense an extension of the computer hardware---were largely ignored until quite recently. Since the early users of on-line systems were highly skilled professionals who were both willing and able to communicate in terms most convenient for the machine, few programmers were aware of the user-computer communications gap, and even fewer were concerned about it. However, the lowered cost of computer access and the proliferation of on-line systems produced a new breed of users, people whose expertise was in some area other than computer technology. As their initial fascination with conversational computing wore off, users reported experiencing feelings of intense frustration and of being "manipulated" by a seemingly unyielding, rigid, intolerant dialogue partner, and these users began disconnecting from time-sharing services at a rate which was very alarming to the industry.
Undo and erase events as indicators of usability problems
Authors: David Akers, Matthew Simpson, Robin Jeffries, Terry Winograd
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

One approach to reducing the costs of usability testing is to facilitate the automatic detection of critical incidents: serious breakdowns in interaction that stand out during software use. This research evaluates the use of undo and erase events as indicators of critical incidents in Google SketchUp (a 3D-modeling application), measuring an indicator's usefulness by the numbers and types of usability problems discovered. We compared problems identified using undo and erase events to problems identified using the user-reported critical incident technique [Hartson and Castillo 1998]. In a within-subjects experiment with 35 participants, undo and erase episodes together revealed over 90% of the problems rated as severe, several of which would not have been discovered by self-report alone. Moreover, problems found by all three methods were rated as significantly more severe than those identified by only a subset of methods. These results suggest that undo and erase events will serve as useful complements to user-reported critical incidents for low cost usability evaluation of creation-oriented applications like SketchUp.