ppxscal/embedding_network huggingface dataset:
From Speech and Gestures to Dialogue Acts
Authors: Maciej Karpinski
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 the present paper, selected problems related to the annotation of the DiaGest corpus are discussed. A system of dialogue acts is proposed along with a conceptual framework that allows for independent labelling of the contributions provided by various modalities and channels. Both auditory and visual modalities are considered. Four channels are defined as major ways of providing quasi-independent modal contributions. A four-dimensional categorisation of dialogue acts is proposed. It includes a separate dimension for attitude-related tags. Dialogue acts are conceptualised as multidimensional entities built on the basis of modal contributions provided by respective channels.
On a Discrete Maximum Principle for Linear FE Solutions of Elliptic Problems with a Nondiagonal Coefficient Matrix
Authors: Sergey Korotov, Michal Křížek, Jakub Šolc
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

In this paper we give a sufficient condition for the validity of a discrete maximum principle (DMP) for a class of elliptic problems of the second order with a nondiagonal coefficient matrix, solved by means of linear finite elements (FEs). Numerical tests are presented.
Mining Projected Clusters in High-Dimensional Spaces
Authors: Mohamed Bouguessa, Shengrui Wang
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Clustering high-dimensional data has been a major challenge due to the inherent sparsity of the points. Most existing clustering algorithms become substantially inefficient if the required similarity measure is computed between data points in the full-dimensional space. To address this problem, a number of projected clustering algorithms have been proposed. However, most of them encounter difficulties when clusters hide in subspaces with very low dimensionality. These challenges motivate our effort to propose a robust partitional distance-based projected clustering algorithm. The algorithm consists of three phases. The first phase performs attribute relevance analysis by detecting dense and sparse regions and their location in each attribute. Starting from the results of the first phase, the goal of the second phase is to eliminate outliers, while the third phase aims to discover clusters in different subspaces. The clustering process is based on the K-means algorithm, with the computation of distance restricted to subsets of attributes where object values are dense. Our algorithm is capable of detecting projected clusters of low dimensionality embedded in a high-dimensional space and avoids the computation of the distance in the full-dimensional space. The suitability of our proposal has been demonstrated through an empirical study using synthetic and real datasets.
Combined low-level descriptors for improving the retrieval performance
Authors: Mohamed Eisa
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Most of the current visual descriptors used are calculated for full images. The local image areas of interest are easily left unnoticed as the global features do not contain enough information for local discrimination. The main contributions of this paper is enhancing the matching performance by applying different kinds of visual descriptors (color, Texture, Edge) to the sub-image areas without using any type of segmentation and compare the obtained feature descriptors separately. Three feature extraction methods, which are block-based descriptors, are presented. The first one is an advanced color feature extraction derived from the modification of Stricker's method. The second one is a texture feature extraction using the Local Binary Pattern (LBP) which is invariant, fast to calculate and its efficiency originates from the detection of different micro patterns. The third one is an edge feature extraction using the Edge Histogram Descriptor (EHD) which is time-consuming as well as computationally expensive. The experimental results demonstrate that block-based feature descriptors have good performance in terms of matching efficiency and effectiveness.
How do mediated and non-mediated power affect electronic supply chain management system adoption? The mediating effects of trust and institutional pressures
Authors: Weiling Ke, Hefu Liu, Kwok Kee Wei, Jibao Gu, Huaping Chen
Venue: Decision Support Systems (2009)

Electronic Supply Chain Management systems (eSCMS), as instances of information technologies spanning organizational boundaries, have the potential to provide operational and strategic benefits. However, the high uncertainty of adoption consequences impedes firms from adopting eSCMS. Research on how to facilitate eSCMS adoption is of significance. This study investigates how institutional and socio-political factors in a dyadic trading partner relationship affect the dependent firm's eSCMS adoption intention. In contrast to prior research, we examine the confluence of institutional pressures, the focal firm's trust and the dominant firm's power. In particular, we differentiate power of different sources, and examine the mediating effects of the focal firm's trust and perceived institutional pressures on the relationship between different types of power exercised by the dominant firm and the focal firm's eSCMS adoption. Data collected from executives in China largely support our research hypotheses. Theoretical contribution and managerial implications of this research are discussed.
SimMan-A simulation model for workforce capacity planning
Authors: Huei-Chuen Huang, Loo-Hay Lee, Haiqing Song, Brian Thomas Eck
Venue: Computers and Operations Research (2009)

Motivated by the difficulty in predicting the actual performance of workforce capacity planning solutions obtained from mathematical models, we develop a simulator, SimMan, to serve as a test bed for evaluating the effectiveness and robustness of different planning options and assignment rules. To facilitate the ease of use, the simulator is developed in C++ language with a modular structure so that different users or planners can customize the modules according to their specifications. We further develop a mathematical model for the workforce capacity planning problem, where the uncertainty of the demand is handled by the safety stock concepts. We also suggest a number of practical planning alternatives and assignment rules based on information from IBM. These rules are implemented as modules in SimMan and tested numerically to provide managerial insights.
On Automated Testing of Description Logic Reasoners
Authors: Marian Babik, Ladislav Hluchy
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

OWL and RDF/RDFS are ontological languages developed by the World Wide Web Consortium (W3), which have become a de facto standard for the ontological descriptions in various domains. The evolution of these standards was influenced by the numerous advances in the research of knowledge representation and reasoning. Although support for reasoning and standardized representation is the key benefit of these technologies, there is a lack of existing test frameworks, which would be capable of addressing many crucial aspects of the Semantic Web applications.In this paper we propose a methodology for automated testing of OWL reasoners based on the real-world ontologies. This specification covers both terminological and assertional reasoning as well as checking of the correctness of the answers. An open-source implementation of such framework is described and a study of initial results is provided. The tests cover an extensive set of reasoners and ontologies and provide a state-of-the-art insight into the field of OWL reasoning.
Representing implicit term relationship for information retrieval
Authors: Tetsuya Yoshida
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper proposes a model for representing and utilizing implicit term relationship among terms in the context of information retrieval. Various keyword based search engines have been developed to facilitate information retrieval over the Web. However, it can still be difficult to specify the appropriate keywords (terms) which are given to the engines. We hypothesize that, although it is not explicitly represented or specified from the user, there can be some (hidden) relationship among the terms, which can be useful to facilitate effective retrieval. We propose a model for representing the implicit relationship among the specified terms. Our model tries to capture it in terms of semantic aspect and represents it as a concrete tree structure. Experiments were conducted to investigate the effectiveness of the proposed model in the context of retrieval, and the results are reported.
Digital Image Watermarking: An Overview
Authors: N. Nikolaidis, I. Pitas
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Usage of digital media has witnessed a tremendous growth during the last decades, as a result of their notable benefits in efficient storage, ease of manipulation and transmission. However these features make digital media vulnerable to copyright infringement, tampering and unauthorized distribution. In the last five years the protection of digital information has received significant attention within the digital media community, and a number of techniques that try to address the problem by hiding appropriate information (e.g. copyright or authentication data) within digital media have been proposed. In this paper we will review data hiding techniques for copyright protection of still images and describe some recent research results on this field.
Surfing in the crowd: feasibility study of experience sharing in a Taiwanese night market
Authors: Chao-Lung Lee, Yun-Maw Cheng, Ching-Long Yeh, Li-Chieh Chen, Wai Yu, Kuan-Ta Chen
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

Social Proximity Applications (SPAs) have prompted a promising opportunity for mobile services that utilize the changes in daily life in the proximity of mobile users. This paper describes our research-in-progress about designing and developing a mobile SPA, which facilitates social interaction among visitors in a night market crowd. This application allows night market visitors to share their experiences in photos with nearby others via their Bluetooth-enabled mobile phones. The design was based on a two-week field observation in an attempt to investigate the motivations and attitudes towards applications of this type. After a three-night extensive trial we found the value of the application - privacy-sensitive, playful, and enjoyable, yields high consistency with results from field observation. The ultimate goal is to identify potential engaging design extensions to the current prototype.
Monte Carlo and discrete-event simulations in C and R
Authors: Barry Lawson, Lawrence Leemis
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The Monte Carlo and discrete-event simulation code associated with the Simulation 101 pre-conference workshop (offered at the 2006, 2007, and 2008 Winter Simulation Conferences) is available in both C and R. This paper begins with general instructions for downloading, compiling, and executing the software. This is followed by detailed explanations of two programs that are representative of the software suite: craps uses Monte Carlo simulation to estimate the probability of winning the dice game Craps, and ssq2 uses discrete-event simulation to estimate several measures of performance associated with a single-server queue.
Wide Range Parametric Study for the Pool Boiling of Nano-fluids with a Circular Plate Heater
Authors: B. Jo, P. S. Jeon, J. Yoo, H. J. Kim
Venue: Journal of Visualization (2009)

The characteristics of boiling and critical heat flux (CHF) behavior of nano-fluids with alumina and silver nano-particles suspended in de-ionized water (pure water) were studied with circular plate heaters in the present study. Enhancements of CHF in nano-fluids in the wide range of particle sizes and concentrations were compared with those in pure water. Also, the effects of the particle deposition on CHF enhancement were investigated. All experiments were performed at the atmospheric pressure condition. The results show that the measured boiling curves in nano-fluids were shifted to the right and CHF were significantly enhanced for different nano-particle sizes and concentrations. The CHF of nano-fluids was increased as the size of the nano-particles decreased. On the other hand, nano-particle concentration value showing the maximum CHF had a critical value. In each pool boiling experiment of nano-fluids, nano-particles were deposited on the heater surface. Assuming that this phenomenon caused the CHF enhancement, pool boiling experiments of pure water were carried out with these nano-particle deposited heaters. The results of these tests were similar to those of the test of the nano-fluids for the CHF enhancement. The main cause of CHF enhancement was found to be the change of the heater surface structure. In order to analyze boiling phenomena of pure water and Al2O3 nano-fluids, boiling process was visualized by using a high speed camera.
Joint processing of topology control and channel assignment in wireless ad hoc networks
Authors: Wei Li, Pingyi Fan, K. B. Letaief
Venue: Wireless Communications Mobile Computing (2009)

Network topology construction and its channel assignment for each node in the constructed network topology are two main problems in the initialization of topology building. Topology control is an effective way to solve the problem of topology building. To investigate the joint effect of topology control and channel assignment, we propose a joint processing scheme composed of a k-Neighbor topology control algorithm and a greedy channel assignment (GCA) algorithm in this paper. Based on this joint processing scheme, the relationships between the energy consumption, the total required channel number and the network connectivity are discussed. We also discuss the impact of some parameters on the performance of networks in terms of the path loss factor, node density, maximum node degree, etc. Our main contributions in this paper is that we find that topology control has a good effect on improving the performance of channel assignment, and the proposed joint processing scheme can reduce the required channel number effectively, compared with its theoretical upper bound. In particular, if the node degree in a network is not more than k, various simulations indicate that the required channel number is not more than 2k&thinsp;+&thinsp;1. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Image Denoising Using Edge Model-based Representation of Laplacian Subbands
Authors: Malay K. Nema, Subrata Rakshit, Subhasis Chaudhuri
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper presents a novel method of removing unstructured, spurious artifacts (more popularly called noise) from images. This method uses an edge model-based representation of Laplacian subbands and deals with noise at Laplacian subband levels to reduce it effectively. As the prominent edges are retained in their original form in the denoised images, the proposed method can be classified as an edge preserving denoising scheme. Laplacian subbands are represented using a Primitive Set (PS) consisting of 7 x 7 subimages of sharp and blurred Laplacian edge elements. The choice of edge model-based representation provides greater flexibility in removing characteristic artifacts from noise sources.
License-Aware Service Selection
Authors: G. R. Gangadharan, Marco Comerio, Hong-Linh Truong, Vincenzo D'Andrea, Flavio De Paoli, Schahram Dustdar
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)

The distribution of services spanning across organizational boundaries raises problems related to intellectual value that are less explored in current service oriented research. Being a way to manage the intellectual rights between service consumers and service providers, licenses are critical to be considered in services. A service license describes the terms and conditions for the use and access of the service in a machine interpretable way. The proliferation of services that offer similar functionalities requires the selection process to be enhanced together with consideration of licenses. In this paper, we analyze current service licensing practices and present a novel approach for service selection process based on matching the offered licensing specifications (primarily dealing with scope of rights and financial terms) by providers with the requested licensing specifications by consumers.
Using bio-electrical signals to influence the social behaviours of domesticated robots
Authors: Paul Saulnier, Ehud Sharlin, Saul Greenberg
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Several emerging computer devices read bio-electrical signals (e.g., electro-corticographic signals, skin biopotential or facial muscle tension) and translate them into computer- understandable input. We investigated how one low-cost commercially-available device could be used to control a domestic robot. First, we used the device to issue direct motion commands; while we could control the device somewhat, it proved difficult to do reliably. Second, we interpreted one class of signals as suggestive of emotional stress, and used that as an emotional parameter to influence (but not directly control) robot behaviour. In this case, the robot would react to human stress by staying out of the person's way. Our work suggests that affecting behaviour may be a reasonable way to leverage such devices.
Phase transitions in vector quantization and neural gas
Authors: Aree Witoelar, Michael Biehl
Venue: Neurocomputing (2009)

The statistical physics of off-learning is applied to winner-takes-all (WTA) and rank-based vector quantization (VQ), including the neural gas (NG). The analysis is based on the limit of high training temperatures and the annealed approximation. The typical learning behavior is evaluated for systems of two and three prototypes with data drawn from a mixture of high dimensional Gaussian clusters. The learning curves exhibit phase transitions, i.e. a critical or discontinuous dependence of performances on the training set size and training temperature. We show how the nature and properties of the transition depend on the number of prototypes and the control parameter of rank-based cost functions. The NG-based systems are demonstrated to give an advantage over WTA in terms of robustness to initial conditions.
An energy efficient clustering scheme of mobile sink node in wireless sensor networks
Authors: Cho Young-bok, Lee Sang-ho
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

The sensor network environment which is composed of a number of sensor nodes has been used for sink Node to monitor their surroundings at a fixed position. Now sensor nodes are extended to Ubiquitous applications, and sink node are giving mobility and seamless data transmission. This paper is accounting for dynamic clustering focusing on the sink node. After choosing cluster headers, which share base station and data transmission, dynamic clustering can transmit the data of the sink node. This paper defines the optimal hop counter and when a cluster is made, prolong life time of the network by reducing the whole network energy efficiency. One of the Experiments shows that clustering can be achieved within a single cluster by extending 6 hops at the maximum, and life time makes possible dynamic clustering when node remains more than 20% on average.
NaradaBrokering: a distributed middleware framework and architecture for enabling durable peer-to-peer grids
Authors: Shrideep Pallickara, Geoffrey Fox
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

A Peer-to-Peer (P2P) Grid would comprise services that include those of Grids and P2P networks and naturally support environments that have features of both limiting cases. Such a P2P grid integrates the evolving ideas of computational grids, distributed objects, web services, P2P networks and message oriented middleware. In this paper we investigate the architecture, comprising a distributed brokering system that will support such a hybrid environment. Access to services can then be mediated either by the middleware or alternatively by direct P2P interactions between machines.
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
Authors: Hasan Amjad, Richard Bornat
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved invariant (or stable) under interference from the environment. We describe a framework, and a prototype implementation, for automatically detecting and repairing instability in such proofs. The method uses a combination of model checking, abstract interpretation, SMT and flow-control refinement.
C-COMP: COPICS---communications oriented manufacturing plan: "a paper-less factory approach"
Authors: Theodore A. Bakalar, Theodore A. Bakalar, Dennis Sears
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

CONTROL of manufacturing shipping schedules and costs implies there is control over the manufacturing process. Very often production control does not have the capability to control the execution of the manufacturing plan. Lack of control is largely because of the information environment that exists. Two problems are very apparent---the vast amount of paperwork on the plant floor and the untimeliness of its information. A plant floor communication system can help solve these problems.
Nonorthogonal CSK/CDMA with Received-Power Adaptive Access Control Scheme
Authors: Nobuyoshi Komuro, Hiromasa Habuchi, Toshinori Tsuboi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

The measurements for Multiple Access Interference (MAI) problems and the improvement of the data rate are key issues on the advanced wireless networks. In this paper, the nonorthogonal Code Shift Keying Code Division Multiple Access (CSK/CDMA) with received-power adaptive access control scheme is proposed. In our system, a user who is ready to send measures the received power from other users, and then the user decides whether to transmit or refrain from transmission according to the received power and a pre-decided threshold. Not only overcoming the MAI problems, but our system also improve the throughput performance. The throughput performance of the proposed system is evaluated by theoretical analysis. Consequently, the nonorthogonal CSK/CDMA system improves by applying received-power adaptive access control. It was also found that the throughput performance of the nonorthogonal CSK/CDMA system is better than that of the orthogonal CSK/CDMA system at any Eb/N0. We conclude that the nonorthogonal CSK/CDMA system with received-power adaptive access control scheme is expected to be effective in advanced wireless networks.