ppxscal/embedding_network huggingface dataset:
A Model for CEO Strategic Leadership Evaluation Based on Information Entropy and Unascertained Measure
Authors: Xing Gang, Ren RongRong
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Considering the complexity of CEO Strategic leadership and some shortcomings of the current evaluation methods this paper designs an evaluation index system which includes five Abilities: strategy vision capability, strategy decision capability, and strategy implementation capability, strategy driving capability and relation capability, and set up a new model for CEO strategic leadership evaluation based on information entropy and unascertained measure. At last, a case study is provided to verify the model. The research findings offer a workable approach in evaluating strategic leadership. It can serve as a basis in the selection, assessment and cultivation of CEO in China.
BiHEA: A Hybrid Evolutionary Approach for Microarray Biclustering
Authors: Cristian Andrés Gallo, Jessica Andrea Carballido, Ignacio Ponzoni
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

In this paper a new hybrid approach that integrates an evolutionary algorithm with local search for microarray biclustering is presented. The novelty of this proposal is constituted by the incorporation of two mechanisms: the first one avoids loss of good solutions through generations and overcomes the high degree of overlap in the final population; and the other one preserves an adequate level of genotypic diversity. The performance of the memetic strategy was compared with the results of several salient biclustering algorithms over synthetic data with different overlap degrees and noise levels. In this regard, our proposal achieves results that outperform the ones obtained by the referential methods. Finally, a study on real data was performed in order to demonstrate the biological relevance of the results of our approach.
A Quantitative Evaluation of Texture Feature Robustness and Interpolation Behaviour
Authors: Stefan Thumfart, Wolfgang Heidl, Josef Scharinger, Christian Eitzinger
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Whenever an image database has to be organised according to higher level human perceptual properties, a transformation model is needed to bridge the semantic gap between features and the perceptual space. To guide the feature selection process for a transformation model, we investigate the behaviour of 5 texture feature categories.Using a novel mixed synthesis algorithm we generate textures with a gradual transition between two existing ones, to investigate the feature interpolation behaviour. In addition the features' robustness to minor textural changes is evaluated in a kNN query-by-example experiment.We compare robustness and interpolation behaviour, showing that Gabor energy map features are outperforming gray level co-occurrence matrix features in terms of linear interpolation quality. 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
A Pen-Based Teaching System for Children and Its Usability Evaluation
Authors: Danli Wang, Tingting Ying, Jinquan Xiong, Hongan Wang, Guozhong Dai
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

The computer has become more and more important in children' life and learning. Various issues exist in the application of multimedia edutainment software and courseware. Therefore, we analyze the current situation and requirement of preschool education software, and present the development of pen-based teaching system for children. Lecturing courseware, annotation, adding contents have been provided, which make targeted classroom teaching convenient, and children interactive courseware function has also been provided to arouse their learning initiative and enthusiasm. After analyzing the feedback, we design and develop the improved version of the system, and evaluate the two versions through experiments. Finally, we propose some suggestions for its modification.
The interaction between motion and form in expression recognition
Authors: Douglas W. Cunningham, Christian Wallraven
Venue: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization (2009)

Faces are a powerful and versatile communication channel. Physically, facial expressions contain a considerable amount of information, yet it is clear from stylized representations such as cartoons that not all of this information needs to be present for efficient processing of communicative intent. Here, we use a high-fidelity facial animation system to investigate the importance of two forms of spatial information (connectivity and the number of vertices) for the perception of intensity and the recognition of facial expressions. The simplest form of connectivity is point light faces. Since they show only the vertices, the motion and configuration of features can be seen but the higher-frequency spatial deformations cannot. In wireframe faces, additional information about spatial configuration and deformation is available. Finally, full-surface faces have the highest degree of static information. The results of two experiments are presented. In the first, the presence of motion was manipulated. In the second, the size of the images was varied. Overall, dynamic expressions performed better than static expressions and were largely impervious to the elimination of shape or connectivity information. Decreasing the size of the image had little effect until a critical size was reached. These results add to a growing body of evidence that shows the critical importance of dynamic information for processing of facial expressions: As long as motion information is present, very little spatial information is required.
Fast BCH Syndrome Coding for Steganography
Authors: Rongyue Zhang, Vasiliy Sachnev, Hyoung Joong Kim
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

This paper presents an improved data hiding technique based on BCH (n,k,t) syndrome coding. The proposed data hiding method embeds data to a block of input data (for example, image pixels, wavelet or DCT coefficients, etc.) by modifying some coefficients in a block in order to null the syndrome of the BCH coding. The proposed data hiding method can hide the same amount of data with less computational time compared to the existed methods. Contributions of this paper include the reduction of both time complexity and storage complexity as well. Storage complexity is linear while that of other methods are exponential. Time complexity of our method is almost negligible and constant for any n. On the other hand, time complexity of the existing methods is exponential. Since the time complexity is constant and storage complexity is linear, it is easy to extend this method to a large n which allows us to hide data with small embedding capacity. Note that small capacities are highly recommended for steganography to survive steganalysis. The proposed scheme shows that BCH syndrome coding for data hiding is now practical ascribed to the reduced complexity.
Automatic Mapping of Social Networks of Actors from Text Corpora: Time Series Analysis
Authors: James A. Danowski, Noah T. Cepela
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

To illustrate the WORDij approach to automatic social network identification from large volumes of text, this research mined the social networks among President Clinton’s cabinet members (n=24)and also President G.W. Bush’s cabinet members (n=45) over each of their two terms based on the members co-occurrence in news stories. The software used a time-slice interval of 30 days for Clinton stories because the average days between Gallup presidential job approval poll ratings was 30 days, resulting in 97 time slices. For Bush the average number of days between polls was 22 days, resulting in a 132-point time series. This synchronized the social networks with presidential job approval ratings. Clinton and Bush had nearly opposite relationships between network centrality and job approval.Automatic network analysis of social actors from textual corpora is feasible and enables testing hypotheses over time.
Who Are the Web Composers?
Authors: Evandro Manara Miletto, Marcelo Soares Pimenta, Aurelio Faustino Hoppe, Luciano Vargas Flores
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Web 2.0 with RIA (Rich Internet Applications) becomes a wide field for social networks and new distributed collective practices. In this paper we explain why and how CODES, a novice-oriented Web-based environment for cooperative music prototyping, provides support to a new practice in which novices in music may produce (not only consume) music cooperatively. CODES stimulates the emergence of new user roles --- these users not only create and edit cooperatively their own music but also may participate in discussions and exchange ideas about their contributions. The implications of this Web-based group music making and shared authorship --- some of them identified through actual experiments --- are also presented.
Semantic-Based Remote Sensing Images Intelligent Service on Grid Environment
Authors: Mou Naixia, Liu Bing, Lu Xiushan, Zhang Lingxian, Liu Wenbao
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In this work, we studied how to rapidly match remote sensing images by the semantic information of geographical objects in Grid architecture and how to slice, index, and assemble each tiled image in every grid node. We first designed the grid architecture of remote sensing images sharing and gave a new idea that searching corresponding images by semantic information of geographical objects. To each grid node, we put forward a new method to partition, index, organize and assemble remote sensing images by rectangle cell. Then, a prototype system was set up: five grid node machines and a grid Server were employed to establish the remote sensing images service grid environment. Massive remote sensing images were treated with new methods above in grid node and vector data managed in grid server to supply semantic information. The tested results proved that goal remote sensing images were searched with higher speed and more accuracy in grid environment and each grid node had faster response compared with traditional remote sensing images sharing mode. And more intelligent services of remote sensing images were given for the multi-resolution, multi-temporal tiled images can be dynamically assembled and analyzed. Experiments proved it was a promising solution to provide remote sensing images services using Grid architecture in light of actual circumstances.
Master Data Management: Rapid Deployment Package for Mdm
Venue:  (2009)

IBM InfoSphere Rapid Deployment Package (RDP) for MDM provides a rapid deployment approach to implementing MDM solutions that provide immediate return on investment. It provides a seamless upgrade path to IBM InfoSphere MDM Server which provides the complete range of MDM functionally in the market today. In this IBM Redbooks publication, we use a simple financial services MDM scenario to describe in detail the RDP for MDM offering and show how it can deliver a return on investment in a short timeframe using a phased approach that ensures minimal risk. 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
Design for usability on supply chain management systems implementation
Authors: Chao-Hsien Lin, Sheue-Ling Hwang, Eric Min-yang Wang, Shu-Ling Peng
Venue: Human Factors in Ergonomics Manufacturing (2009)

Supply chain management (SCM) systems implementation has become a fashion due to advances in information technology and pressures of market competition. Unfortunately, successful implementation was rare. In this article, the concept of usability was extended in an explorative case study to crystallize design for usability (DFU) principles in a large-scale SCM systems implementation project at a leading semiconductor manufacturing company in Taiwan. Proposed was a holistic usability framework to guide the analysis of DFU as well as the compilation of an evidence database composed of design documentation, post hoc evaluation, semistructured interviews, and participant observation. This research revealed a set of usability needs and coping strategies found throughout a series of systems design and redesign processes at the case company. As a result, an emergent usability framework in the form of ICOM (Input, Control, Output, and Mechanism) dimensions was proposed to guide the implementation of SCM systems. &copy; 2009 Wiley Periodicals, Inc.
Spatial Navigation with Consistency Maintenance System
Authors: Toshiyuki Maeda
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

This paper presents a consistency maintenance system for spatial navigation with integration of fuzzy and two-valued logics on spatial reasoning. We introduce a simple semantics of natural language which can treat fuzzy and two-valued logics, both of which are essential in natural language sentences, especially on spatial depiction. For realizing the reasoning system, we propose a fuzzy assumption-based truth management system (FATMS) and apply image synthesis system with natural language input data.
MAC Precomputation with Applications to Secure Memory
Authors: Juan Garay, Vladimir Kolesnikov, Rae Mclellan
Venue: Proceedings of the 12th International Conference on Information Security (2009)

We present ShMAC (Shallow MAC), a fixed input length message authentication code that performs most of the computation prior to the availability of the message. Specifically, ShMAC's message-dependent computation is much faster and smaller in hardware than the evaluation of a pseudorandom permutation (PRP), and can be implemented by a small shallow circuit, while its precomputation consists of one PRP evaluation.A main building block for ShMAC is the notion of strong differential uniformity (SDU), which we introduce, and which may be of independent interest. We present an efficient SDU construction built from previously considered differentially uniform functions.Our motivating application is a system where a hardware-secured processor uses memory controlled by an adversary. We present in technical detail a novel, more efficient approach to encrypting and authenticating memory and discuss the associated trade-offs, while paying special attention to minimizing hardware costs and the reduction of DRAM latency.
Triple positive solutions for p-Laplacian m-point boundary value problem on time scales
Authors: Hong-Rui Sun
Venue: Computers Mathematics with Applications (2009)

In this paper we discuss the following p-Laplacian m-point boundary value problem on time scales T: (@f"p(u^@D(t)))^@?+h(t)f(t,u(t),u^@D(t))=0,t@?(0,T)"T,u(0)=0,@f"p(u^@D(T))=@?i=1m-2a"i@f"p(u^@D(@x"i)), where @f"p(u)=|u|^p^-^2u for p>1. Some new existence criteria for at least three positive solutions are established by using a generalization of the Leggett-Williams fixed point theorem due to Bai and Ge. An example is also given to demonstrate the main result.
Happy-Sad Expression Recognition Using Emotion Geometry Feature and Support Vector Machine
Authors: Linlu Wang, Xiaodong Gu, Yuanyuan Wang, Liming Zhang
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Currently human-computer interaction, especially emotional interaction, still lacks intuition. In health care, it is very important for the medical robot, who assumes the responsibility of taking care of patients, to understand the patient's feeling, such as happiness and sadness. We propose an approach to facial expression recognition for estimating patients' emotion. Two expressions (happiness and sadness) are classified in this paper. Our method uses a novel geometric feature parameter, which we call the Emotion Geometry Feature (EGF). The active shape model (ASM), which can be categorized mainly for non-rigid shapes, is used to locate Emotion Geometry Feature (EGF) points. Meanwhile, the Support Vector Machine (SVM) is used to do classification. Our method was tested on a Japanese Female Facial Expression (JAFFE) database. Experimental results, with the average recognition rate of 97.3%, show the efficiency of our method.
Initialization Dependence of Clustering Algorithms
Authors: Wim Mulder, Stefan Schliebs, René Boel, Martin Kuiper
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

It is well known that the clusters produced by a clustering algorithm depend on the chosen initial centers. In this paper we present a measure for the degree to which a given clustering algorithm depends on the choice of initial centers, for a given data set. This measure is calculated for four well-known offline clustering algorithms (k-means Forgy, k-means Hartigan, k-means Lloyd and fuzzy c-means), for five benchmark data sets. The measure is also calculated for ECM, an online algorithm that does not require the number of initial centers as input, but for which the resulting clusters can depend on the order that the input arrives. Our main finding is that this initialization dependence measure can also be used to determine the optimal number of clusters.
Building Theorem Provers
Authors: Mark E. Stickel
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

This talk discusses some of the challenges of building a usable theorem prover. These include the chasm between theory and code, conflicting requirements, feature interaction, and competitive performance. The talk draws on the speaker's experiences with devising extensions of resolution and building theorem provers that have been used as embedded reasoners in various systems.
Optimal virtual cluster-based multiprocessor scheduling
Authors: Arvind Easwaran, Insik Shin, Insup Lee
Venue: Real-Time Systems (2009)

Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m¿1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.
A measurement study of zigbee-based indoor localization systems under RF interference
Authors: Seng-Yong Lau, Tsung-Han Lin, Te-Yuan Huang, I-Hei Ng, Polly Huang
Venue: Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization (2009)

With an expected market value of 2.71 billion in 2016, supporting daily use of real-time location systems in households and commercial buildings is an increasingly important subject of study. A growing problem in providing robust indoor location estimations in real time is the use of wireless transmissions in RF frequencies. Having implemented a simple RSSI-signature-based location system on a 24-node IEEE 802.15.4-based sensor network testbed, we are able to analyze the effect of background IEEE 802.11 traffic on localization error. The measurement results demonstrate that the 80th-percentile of the localization error may increase by 141% at worst in an office building with active use of IEEE 802.11 for data. Such performance degradation results from RSSI reading loss as the beacon messages collide with background traffic.
The Research and Design of the Tax Self-Service System
Authors: Hua Ji
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

At present the queuing phenomenon always appears in the tax service hall, since the tax service window has a heavier load to manage the tax. The implementation of the tax self-service system can provide convenient and efficient self-service for the taxpayer; also can improve and optimize the quality of the tax service; so can reduce the queuing time. The tax self-service system plays the role of cutting off the apex and filling up the valley. On the one hand, it distributes the quantity of the business operation in the peak time when managing the tax, to reduce the pressure to manage the tax in peak time, and decrease the queuing phenomena effectively, thus the system play the role of cutting off the apex. In this paper, the architecture, the software and hardware design methods of the tax self-service system are proposed.
Situated actions and cognition
Authors: Jacques Penders, Peter J. Braspenning
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

The paper addresses the concept of cognition starting from the role of a sensor basis in the design of robots. The field of robotics forces the discussion to be pragmatic which is considered to be advantageous. In addition, we introduce the notion of cognitive basis in order to discuss the cognitive abilities of an artificial creature. As cognition cannot be fully separated from action and acting, we present finally the notion of motor-schema basis. This basis involves actions and acting as integral parts of cognition.