ppxscal/embedding_network huggingface dataset:
The employability of older workers as teleworkers: An appraisal of issues and an empirical study
Authors: Joseph Sharit, Sara J. Czaja, Mario A. Hernandez, Sankaran N. Nair
Venue: Human Factors in Ergonomics Manufacturing (2009)

The aging of the population and, concomitantly, of the workforce has a number of important implications for governments, businesses, and workers. In this article, we examine the prospects for the employability of older workers as home-based teleworkers. This alternative work could accommodate many of the needs and preferences of older workers and at the same time benefit organizations. However, before telework can be considered a viable work option for many older workers there are a number of issues to consider, including the ability of older workers to adapt to the technological demands that are typically associated with telework jobs and managerial attitudes about older workers and about telework. Through an integrated examination of these and other issues, our goal is to provide a comprehensive understanding of the challenges associated with employing older workers as teleworkers. We also present findings from a questionnaire study that assessed managers' perceptions of worker attributes desirable for telework and how older workers compare to younger workers on these attributes. The sample included 314 managers with varying degrees of managerial experience from a large variety of companies in the United States. The results presented a mixed picture with respect to the employability of older workers as teleworkers, and strongly suggested that less experienced managers would be more resistant to hiring older people as teleworkers. We conclude with a number of recommendations for improving the prospects for employment of older workers for this type of work arrangement. &copy; 2009 Wiley Periodicals, Inc.
Web Site Competition with Mixed Promotion Strategy - Model and Stability
Authors: Ren Yawei, Yang Deli, Diao Xinjun
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

A model to describe the competitive dynamics of web sites with mixed promotion strategy on the WWW market was presented. The stability of the model was analyzed. The analysis result shows that, only web sites with low spontaneous decay rate in a weak competitive environment can share the market together. There is also a transition from a regime in which many sites thrive simultaneously, to a "winner take all market", just as mentioned in previous works. However, the dynamics are more complicated. Different with the previous result, in our model, high spontaneous decay rate leads to all sites extinct. The results of stability analysis were verified by matlab numerical simulation.
Lazarus for cross-platform development
Authors: Mattias Gaertner
Venue: Linux Journal (2009)

Pascal. Native code. Linux, Windows and Mac, oh my! The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Thin silicon oxide films on N-type 4H-SiC prepared by scanning frequency anodization method
Authors: Kai-Chieh Chuang, Jenn-Gwo Hwu
Venue: Microelectronic Engineering (2009)

The effect of selective anodization on SiC in direct voltage superimposed with alternative voltage of scanning frequencies has been investigated. Compared with the gate oxides grown with direct voltage or alternative voltage of a constant frequency, the oxide charge and the interface state density of the sample with scanning frequencies are significantly reduced. It is suggested that the bulk traps and interface traps in the oxides can be compensated during the scanning frequency anodization process since the scanning frequencies are in close proximity to the response times of interface states.
Modeling Role-Based Privacy in Social Networking Services
Authors: Gábor György Gulyas, Róbert Schulcz, Sándor Imre
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

As social networking services are getting more and more common, the need for privacy enhancing options, sophisticated identity management and anonymity emerges. In this paper the authors propose using Role-Based Privacy as a response for these needs and introduce a novel model called Nexus-Identity Network that is capable of describing services extended with such functionality. The concerned principles of Role-Based Privacy are conferred in the paper and criteria are presented for anonymity. Conforming to the criteria the authors suggest storing the profiles of different identities in a tree hierarchy in a user-friendly manner. The analysis of anonymity shows that the network has a structure that can be easily interpreted similarly to graphs representing connections in regular social networks. The ease of profile management and network visualization are advantages of the Nexus-Identity Model which can make a social networking service privacy- and user-friendly as well.
Responses to "Software Engineering: An Idea Whose Time Has Come and Gone?"
Venue: IEEE Software (2009)

The section features excerpts of letters responding to Tom DeMarco's article "Software Engineering: An Idea Whose Time Has Come and Gone?" (July/Aug., pp. 96, 95).
Analyzing Document Retrievability in Patent Retrieval Settings
Authors: Shariq Bashir, Andreas Rauber
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in specific domains, such as patent retrieval or law, recall becomes more relevant than precision: in these cases the goal is to find all relevant documents, requiring algorithms to be tuned more towards recall at the cost of precision. This raises important questions with respect to retrievability and search engine bias: depending on how the similarity between a query and documents is measured, certain documents may be more or less retrievable in certain systems, up to some documents not being retrievable at all within common threshold settings. Biases may be oriented towards popularity of documents (increasing weight of references), towards length of documents, favour the use of rare or common words; rely on structural information such as metadata or headings, etc. Existing accessibility measurement techniques are limited as they measure retrievability with respect to all possible queries. In this paper, we improve accessibility measurement by considering sets of relevant and irrelevant queries for each document. This simulates how recall oriented users create their queries when searching for relevant information. We evaluate retrievability scores using a corpus of patents from US Patent and Trademark Office.
Design of discrete control system of flexible spacecraft maintaining robust stability of elastic oscillations
Authors: I. N. Krutova, V. M. Sukhanov
Venue: Automation and Remote Control (2009)

For the flexible spacecraft with a nonlinear orientation control system using flywheel engines, an approach to making its elastic oscillations robust stable was considered. It relies on a purposeful variation of the boundaries of the stability domains in the parameter space of the spacecraft and controller with the aim of maximizing the number of robust stable elastic modes of the flexible spacecraft. To make its control stable in the large, consideration was given to the possibility of expanding the basic algorithm by adding the sum of the components using the estimated coordinates of the remaining series of low-frequency unstable modes. Presented was an example of mathematical modeling of the proposed spacecraft orientation system which corroborated operability of the approach making the multifrequency spacecraft stable to the elastic oscillations.
On the complexity of 2D discrete fixed point problem
Authors: Xi Chen, Xiaotie Deng
Venue: Theoretical Computer Science (2009)

We study a computational complexity version of the 2D Sperner problem, which states that any three coloring of vertices of a triangulated triangle, satisfying some boundary conditions, will have a trichromatic triangle. In introducing a complexity class PPAD, Papadimitriou [C.H. Papadimitriou, On graph-theoretic lemmata and complexity classes, in: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990, 794-801] proved that its 3D analogue is PPAD-complete about fifteen years ago. The complexity of 2D-SPERNER itself has remained open since then. We settle this open problem with a PPAD-completeness proof. The result also allows us to derive the computational complexity characterization of a discrete version of the 2D Brouwer fixed point problem, improving a recent result of Daskalakis, Goldberg and Papadimitriou [C. Daskalakis, P.W. Goldberg, C.H. Papadimitriou, The complexity of computing a Nash equilibrium, in: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC), 2006]. Those hardness results for the simplest version of those problems provide very useful tools to the study of other important problems in the PPAD class.
Designing Interaction for Local Communications: An Urban Screen Study
Authors: Fiona Redhead, Margot Brereton
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

This paper discusses the ongoing design and use of a digital community noticeboard situated in a suburban hub. The design intention is to engage residents, collect and display local information and communications, and spark discussion. A key contribution is an understanding of Situated Display navigation that aids retrieval from a long-term collection created by and for suburban community, and engaging qualities of this collection.
Inverse-Consistent Surface Mapping with Laplace-Beltrami Eigen-Features
Authors: Yonggang Shi, Jonathan H. Morra, Paul M. Thompson, Arthur W. Toga
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

We propose in this work a novel variational method for computing maps between surfaces by combining informative geometric features and regularizing forces including inverse consistency and harmonic energy. To tackle the ambiguity in defining homologous points on smooth surfaces, we design feature functions in the data term based on the Reeb graph of the Laplace-Beltrami eigenfunctions to quantitatively describe the global geometry of elongated anatomical structures. For inverse consistency and robustness, our method computes simultaneously the forward and backward map by iteratively solving partial differential equations (PDEs) on the surfaces. In our experiments, we successfully mapped 890 hippocampal surfaces and report statistically significant maps of atrophy rates between normal controls and patients with mild cognitive impairment (MCI) and Alzheimer's disease (AD).
On compiling system models for faster and more scalable diagnosis
Authors: Jinbo Huang, Adnan Darwiche
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Knowledge compilation is one of the more traditional approaches to model-based diagnosis, where a compiled system model is obtained in an off-line phase, and then used to efficiently answer diagnostic queries on-line. The choice of a suitable representation for the compiled model is critical to the success of this approach, and two of the main proposals have been Decomposable Negation Normal Form (DNNF) and Ordered Binary Decision Diagram (OBDD). The contribution of this paper is twofold. First, we show that in the current state of the art, DNNF dominates OBDD in efficiency and scalability for some typical diagnostic tasks. This result is based on a step-by-step comparison of the complexities of diagnostic algorithms for DNNF and OBDD, together with a known succinctness relation between the two representations. Second, we present a tool for model-based diagnosis, which is based on a state-of-the-art DNNF compiler and our implementations of DNNF diagnostic algorithms. We demonstrate the efficiency of this tool against recent results reported on diagnosis using OBDD.
Research on Traffic Mode of Elevator Applied Fuzzy C-Mean Clustering Algorithm Based on PSO
Authors: Hai-yan Tang, Bao Ding, Wei-gui Qi
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The scheduling algorithm is applied to elevator group for the optimal scheduling with different traffic mode, which will improve the performance of elevator group control system. The fuzzy C-mean (FCM) algorithm based on particle swarm optimization (PSO) is proposed to identify the traffic mode of elevator. The iterative process based on gradient descent in FCM algorithm is replaced by PSO algorithm, which makes the global search capability become stronger. Meanwhile the sensitivity to initial value of the FCM algorithm is decreased. And the realization process of the algorithm is given. The data of elevator traffic flow are collected from some office building, which is made up of test sample. The elevator traffic flow is classified by using the algorithm proposed. Compared with the FCM clustering algorithm, the results show that FCM algorithm based on PSO have better adaptability and better effect, and the recognition of elevator traffic mode is realized.
Research of 3D Spatial Localizing System Based on PSD Sensor
Authors: Ying-gang Zhou, Yan-gen Xie, Dan Zhan, Guang-ping Yu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Abstract—PSD(Position Sensitive Detector) is the sensorwhich can provide continuous data of location, when itssurface is scanned by the laser light. The 3D Spatial Localizingtechnology is achieved by dual 2D PSD sensors. The principleand the characteristics of 2D PSD are described in detail, andthe spatial localizing algorithm of PSD array formed by twoaxis- parallel-placed 2D PSD is researched. Using thealgorithm, we design a reliable system on the targeting Spatiallocation. The measurement error of the system and the reasonare analysed. Through experiments, we know that theLocalizing resolution of the system is 1um and the error is lessthan 5um. The system has many features, such as highresolution, fast responsive time ,strong anti-interference,thecircuit to deal with simply, convenient interface. so it is anideal non-contact Spatial Localizing system.
Unsupervised and semi-supervised multi-class support vector machines
Authors: Linli Xu, Dale Schuurmans
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We present new unsupervised and semi-supervised training algorithms for multi-class support vector machines based on semidefinite programming. Although support vector machines (SVMs) have been a dominant machine learning technique for the past decade, they have generally been applied to supervised learning problems. Developing unsupervised extensions to SVMs has in fact proved to be difficult. In this paper, we present a principled approach to unsupervised SVM training by formulating convex relaxations of the natural training criterion: find a labeling that would yield an optimal SVM classifier on the resulting training data. The problem is hard, but semidefinite relaxations can approximate this objective surprisingly well. While previous work has concentrated on the two-class case, we present a general, multi-class formulation that can be applied to a wider range of natural data sets. The resulting training procedures are computationally intensive, but produce high quality generalization results.
Regression Based Non-frontal Face Synthesis for Improved Identity Verification
Authors: Yongkang Wong, Conrad Sanderson, Brian C. Lovell
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We propose a low-complexity face synthesis technique which transforms a 2D frontal view image into views at specific poses, without recourse to computationally expensive 3D analysis or iterative fitting techniques that may fail to converge. The method first divides a given image into multiple overlapping blocks, followed by synthesising a non-frontal representation through applying a multivariate linear regression model on a low-dimensional representation of each block. To demonstrate one application of the proposed technique, we augment a frontal face verification system by incorporating multi-view reference (gallery) images synthesised from the frontal view. Experiments on the pose subset of the FERET database show considerable reductions in error rates, especially for large deviations from the frontal view. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Practice Abstracts
Venue: Interfaces (2009)

The goal of “Practice Abstracts” is to present interesting, topical, and novel applications of operations research methodology to a wide range of industrial applications. “Practice Abstracts” are intended to provide Interfaces readers with short (2--4 page) descriptions of the most relevant aspects of operations research-based projects, in a form that is accessible to academics and practitioners in other organizations. Contributions should be sent for evaluation to the editor of “Practice Abstracts,” Brian T. Denton, Edward P. Fitts Department of Industrial and Systems Engineering, 376 Daniels Hall, North Carolina State University, 111 Lampe Drive, Campus Box 7906, Raleigh, North Carolina 27695-7906, bdenton@ncsu.edu.
Multilayer Anchor Alignment in AC-E Parallel Corpora of Chinese Tea Classics
Authors: Jiang Yi, Jiang Xin, Wang Dapeng
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Chinese tea literature has not made its appearance in the existing corpora. Bilingual corpus of ancient Chinese and English (AC-E) also wait to be extended for purposes such as CAT and designing educational software for Confucius Institutes all over the world. This paper aims at such a corpus by demonstrating multilayer anchor-points in improving the alignment accuracy in a bilingual parallel corpus of tea classics. An experiment is carried out with four layers of “anchor points”. Technical terms as the first layer are extracted with Term List of Winalign module in Trados. The second is register-specific words with 1:1 co-occurrence frequency in SL and TL. The third and fourth are composed respectively of proper nouns and transliterated Chinese-unique words. Statistics show that the alignment accuracy keeps increasing with the step-up of each layer. Since such anchor-points are typical in ancient Chinese classics, this method can be generalized in relevant fields.
Using GPU Shaders for Visualization
Authors: Mike Bailey
Venue: IEEE Computer Graphics and Applications (2009)

GPU shaders seem used mostly for gaming and other forms of entertainment and simulation. But they have less-obvious visualization uses, for the same reasons that interest the gaming community: improved appearance and performance. This column looks at the use of shaders and the OpenGL Shading Language (GLSL) in two common visualization applications: point clouds and contour cutting planes.
Finding Nearest Larger Neighbors
Authors: Tetsuo Asano, Sergey Bereg, David Kirkpatrick
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

Designing and analysing efficient algorithms is important in practical applications, but it is also fun and frequently instructive, even for simple problems with no immediate applications. In this self-contained paper we try to convey some of fun of algorithm design and analysis. Hopefully, the reader will find the discussion instructive as well.We focus our attention on a single problem that we call the All Nearest Larger Neighbors Problem. Part of the fun in designing algorithms for this problem is the rich variety of algorithms that arise under slightly different optimization criteria. We also illustrate several important analytic techniques, including amortization, and correctness arguments using non-trivial loop invariants.We hope, in this modest way, to reflect our deep admiration for the many contributions of Kurt Mehlhorn to the theory, practice and appreciation of algorithm design and analysis.
REPAS: Reliable Execution for Parallel ApplicationS in Tiled-CMPs
Authors: Daniel Sánchez, Juan L. Aragón, José M. García
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Reliability has become a first-class consideration issue for architects along with performance and energy-efficiency. The increasing scaling technology and subsequent supply voltage reductions, together with temperature fluctuations, augment the susceptibility of architectures to errors. Previous approaches have tried to provide fault tolerance. However, they usually present critical drawbacks concerning either hardware duplication or performance degradation, which for the majority of common users results unacceptable.RMT (Redundant Multi-Threading) is a family of techniques based on SMT processors in which two independent threads (master and slave), fed with the same inputs, redundantly execute the same instructions, in order to detect faults by checking their outputs. In this paper, we study the under-explored architectural support of RMT techniques to reliably execute shared-memory applications. We show how atomic operations induce to serialization points between master and slave threads. This bottleneck has an impact of 34% in execution time for several parallel scientific benchmarks. To address this issue, we present REPAS (Reliable execution of Parallel ApplicationS in tiled-CMPs), a novel RMT mechanism to provide reliable execution in shared-memory applications.While previous proposals achieve the same goal by using a big amount of hardware - usually, twice the number of cores in the system - REPAS architecture only needs a few extra hardware, since the redundant execution is made within 2-way SMT cores in which the majority of hardware is shared. Our evaluation shows that REPAS is able to provide full coverage against soft-errors with a lower performance slowdown in comparison to a non-redundant system than previous proposals at the same time it uses less hardware resources.
Neural Tractography Using an Unscented Kalman Filter
Authors: James G. Malcolm, Martha E. Shenton, Yogesh Rathi
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

We describe a technique to simultaneously estimate a local neural fiber model and trace out its path. Existing techniques estimate the local fiber orientation at each voxel independently so there is no running knowledge of confidence in the estimated fiber model. We formulate fiber tracking as recursive estimation: at each step of tracing the fiber, the current estimate is guided by the previous. To do this we model the signal as a mixture of Gaussian tensors and perform tractography within a filter framework. Starting from a seed point, each fiber is traced to its termination using an unscented Kalman filter to simultaneously fit the local model and propagate in the most consistent direction. Despite the presence of noise and uncertainty, this provides a causal estimate of the local structure at each point along the fiber. Synthetic experiments demonstrate that this approach reduces signal reconstruction error and significantly improves the angular resolution at crossings and branchings. In vivo experiments confirm the ability to trace out fibers in areas known to contain such crossing and branching while providing inherent path regularization.