ppxscal/embedding_network huggingface dataset:
Adaptive Subclass Discriminant Analysis Color Space Learning for Visual Tracking
Authors: Zhifei Xu, Pengfei Shi, Xiaoyu Xu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

A robust tracking method using subclass discriminant analysis (SDA) color space is presented. SDA color space is proposed which seeks to find the color subspace for representing pixels by maximizing the distance between the foreground pixels and background pixels even if target and background have multi-model color distributions. Further, SDA color space is adaptively updated by only using "confident" target pixels. Experimental results on several challenging videos show the effectiveness of the proposed method.
A simulation based approach for dock allocation in a food distribution center
Authors: Balagopal Gopakumar, Suvarna Sundaram, Shengyong Wang, Sumit Koli, Krishnaswami Srihari
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This research endeavor focused on the warehouse receiving process at a large food distribution center, which comprises of trucks with goods reaching the destination warehouse, unloading and finally putting away the contents to the specific aisles. Discrete event simulation was used to model the current system's functioning and to identify operational inefficiencies which were quantified through a detailed value stream mapping exercise. Inspired by 'lean' philosophy, a dock allocation algorithm was designed to take into account the relationship between the dock location and the destination aisle to 'optimally' assign the trucks to the docks. After validating the baseline, new scenarios incorporating the allocation algorithm were tested. Two of the scenarios showed an average reduction of 30% in daily travel distance for the 'put-away' personnel. The simulation model also helped visualize the benefits that would accrue through the use of lean principles to reduce the non-value added time in warehouse operations.
Implicit modeling from polygon soup using convolution
Authors: Xiaogang Jin, Chiew-Lan Tai, Hailin Zhang
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

We present a novel method for creating implicit surfaces from polygonal models. The implicit function is defined by convolving a kernel with the triangles in the polygonal model. By adopting a piecewise quartic polynomial kernel function with a finite support, we derive a convolution model that has a closed-form solution, and thus can be efficiently evaluated. The user only needs to specify an effective radius of influence to generate an implicit surface of desired closeness to the polygonal model. The resulting implicit surface is fast to evaluate, not requiring accumulating evaluation results using any hierarchical data structure, and can be efficiently ray-traced to reveal the detailed features.
Spatial model fitting for large datasets with applications to climate and microarray problems
Authors: Reinhard Furrer, Stephan R. Sain
Venue: Statistics and Computing (2009)

Many problems in the environmental and biological sciences involve the analysis of large quantities of data. Further, the data in these problems are often subject to various types of structure and, in particular, spatial dependence. Traditional model fitting often fails due to the size of the datasets since it is difficult to not only specify but also to compute with the full covariance matrix describing the spatial dependence. We propose a very general type of mixed model that has a random spatial component. Recognizing that spatial covariance matrices often exhibit a large number of zero or near-zero entries, covariance tapering is used to force near-zero entries to zero. Then, taking advantage of the sparse nature of such tapered covariance matrices, backfitting is used to estimate the fixed and random model parameters. The novelty of the paper is the combination of the two techniques, tapering and backfitting, to model and analyze spatial datasets several orders of magnitude larger than those datasets typically analyzed with conventional approaches. Results will be demonstrated with two datasets. The first consists of regional climate model output that is based on an experiment with two regional and two driver models arranged in a two-by-two layout. The second is microarray data used to build a profile of differentially expressed genes relating to cerebral vascular malformations, an important cause of hemorrhagic stroke and seizures.
Conservative discretization of Coriolis force in a finite volume framework
Authors: E. Audusse, R. Klein, A. Owinoh
Venue: Journal of Computational Physics (2009)

In this article we are interested in the problem of numerical simulations for a shallow fluid flow in a rotating system. This problem is closely related to climate or meteorological simulations. Our purpose is to introduce a new finite volume technique which allows us to guarantee conservation of linear momentum in an inertial frame of reference. Furthermore, we show that this method introduces a new discrete Coriolis term which is based on the interface mass fluxes instead of on straightforward cell-centered evaluation of the source term. Some numerical tests exhibit that this approach significantly reduces the numerical diffusion and is particularly interesting when considering nonisotropic meshes or long time simulations.
Estimation of friendship and hierarchy from conversation records
Authors: Yoko Nishihara, Wataru Sunayama
Venue: Information Sciences: an International Journal (2009)

We have developed a method for estimating the level of friendship between two people and the strength of their hierarchy. This information is important because building the relationships needed to create something new requires an understanding of current relationships. Using records of conversation among people, our method first identifies the sentence types and then uses the identified types to estimate the level of friendship and the strength of the hierarchy. Testing using records for various types of conversation demonstrated that this method can robustly estimate both values from one-person-fixed conversation records.
Guidelines for commercial off-the-shelf simulation package interoperability
Authors: Simon J. E. Taylor, Stephen J. Turner, Steffen Strassburger
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Commercial-off-the-shelf (COTS) Simulation Packages (CSPs) are widely used visual interactive modeling environments such as Arena&trade;, Anylogic&trade;, Flexsim&trade;, Simul8&trade;, Witness&trade;, etc. CSP Interoperability (or distributed simulation) is a technique that allows a simulation to be executed over several computers or for several simulations running on different computers to run together. This also relates to simulation languages such as SLX&trade; and GPSS/H&trade;. There have been various attempts to interoperate these CSPs, some with the IEEE 1516 High Level Architecture (HLA). These can be quite complex and it is easy to loose track of exactly what is occurring between interoperating CSPs and their models. This paper introduces a set of Interoperability Reference Models (IRMs), or design patters for CSP Interoperability, that can be used as guidelines to simplify the interoperability process.
Energy Management System as an Embedded Service: Saving Energy Consumption of ICT
Authors: Francisco Maciá-Pérez, Diego Marcos-Jorquera, Virgilio Gilart-Iglesias
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

In this paper we present a service approach based on the use of embedded network devices for the energy management of Information and Communication Technology (ICT) infrastructures. The service is completely compatible with other strategies in order to achieve an efficient management for saving energy. These devices are very small, with low consumption and specially designed to operate with minimum maintenance, and also they are presented under Services Oriented Architecture open standards, more specifically, as Web Services. In addition, these embedded services can work individually or in collaboration with other ICT enterprise services, either through conventional systems or by means of other embedded devices. To validate the proposal we have implemented a prototype and we have designed a test scenario based in the ICT replicated infrastructure in order to support web applications of the Polytechnic University College at the University of Alicante.
Liveness of a mutex algorithm in a fair process algebra
Authors: Flavio Corradini, Maria Rita Di Berardini, Walter Vogler
Venue: Acta Informatica (2009)

In earlier work, we have shown that two variants of weak fairness can be expressed comparatively easily in the timed process algebra PAFAS. To demonstrate the usefulness of these results, we complement work by Walker (Form Asp Comput 1:273&#x2013;292, 1989) and study the liveness property of Dekker&#x2019;s mutual exclusion algorithm within our process algebraic setting. We also present some results that allow to reduce the state space of the PAFAS process representing Dekker&#x2019;s algorithm, and give some insight into the representation of fair behaviour in PAFAS.
Image-Based Techniques for Shredded Document Reconstruction
Authors: Huei-Yung Lin, Wen-Cheng Fan-Chiang
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper proposes an image-based technique for shredded document reconstruction. The problem is different from solving jigsaw puzzles since curved boundaries and color information are not available. Currently most research on document recovery focuses on image feature exaction and analysis. In this work, we present a complete procedure which is capable of reconstructing a full page of shredded document. Similarity measure based on shred boundary correlation is defined for pattern matching. A weighted digraph is then used to derive the final shred sorting result. Experiments are presented for both the synthetic and real datasets.
Explicit TE/TM scheme for particle beam simulations
Authors: Martin Dohlus, Igor Zagorodnov
Venue: Journal of Computational Physics (2009)

In this paper we propose an explicit two-level conservative scheme based on a TE/TM like splitting of the field components in time. Its dispersion properties are adjusted to accelerator problems. It is simpler and faster than the implicit version [I. Zagorodnov, T. Weiland, TE/TM scheme for computation of electromagnetic fields in accelerators, J. Comput. Phys. 207 (2005) 69]. It does not have dispersion in the longitudinal direction and the dispersion properties in the transverse plane are improved. The explicit character of the new scheme allows a uniformly stable conformal method without iterations and the scheme can be parallelized easily. It assures energy and charge conservation. A version of this explicit scheme for rotationally symmetric structures is free from the progressive time step reducing for higher order azimuthal modes as it takes place for Yee's explicit method used in the most popular electrodynamics codes.
An Attention-Based Network-Aware Adaptive Intra Refresh Method for Wireless Video Communications
Authors: Hanjie Ma, Xujiong Meng, Yaowu Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A novel adaptive intra refresh method for the wireless video communication is proposed, which considers the characteristic of the human visual system and the state information of the time-varying wireless channel jointly. An attention model is used to compute the perceptual weight map of the video content. The dynamic feedback channel state information (CSI) of the wireless channel, such as bit error rates and packet lost rates, is utilized to predict the channel distortion. Experimental results indicate that the proposed method significantly outperforms other methods without considering the CSI.
Experimental e-Health Applications in Wireless Sensor Networks
Authors: Hairong Yan, Youzhi Xu, Mikael Gidlund
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we will describe the implementation and experimental analysis of a wireless sensor network application for e-Health. The main idea of the application is to use simple distributed sensor nodes in a home environment, to provide home assistants, nurses, healthcare centers and relatives with a degree of "understanding" and information about the actual persons health and activity status in order to fast determine what kind of help is needed. Another feature of the with the sensor application is the application of localization and tracking within the home environment. We propose a simple localization algorithm based on special sensor data and received signal strength indicator (RSSI) which has a low complexity suitable for small sensor networks. The experimental results show that the proposed algorithm works fine in a home environment.
Improved bounds on the average length of longest common subsequences
Authors: George S. Lueker
Venue: Journal of the ACM (JACM) (2009)

It has long been known &lsqb;Chv&aacute;tal and Sankoff 1975&rsqb; that the average length of the longest common subsequence of two random strings of length n over an alphabet of size k is asymptotic to &gamma;kn for some constant &gamma;k depending on k. The value of these constants remains unknown, and a number of papers have proved upper and lower bounds on them. We discuss techniques, involving numerical calculations with recurrences on many variables, for determining lower and upper bounds on these constants. To our knowledge, the previous best-known lower and upper bounds for &gamma;2 were those of Dan&ccaron;&iacute;k and Paterson, approximately 0.773911 and 0.837623 &lsqb;Dan&ccaron;&iacute;k 1994; Dan&ccaron;&iacute;k and Paterson 1995&rsqb;. We improve these to 0.788071 and 0.826280. This upper bound is less than the &gamma;2 given by Steele's old conjecture (see Steele &lsqb;1997, page 3&rsqb;) that &gamma;2 &equals; 2/(1 + &sqrt;2)&approx; 0.828427. (As Steele points out, experimental evidence had already suggested that this conjectured value was too high.) Finally, we show that the upper bound technique described here could be used to produce, for any k, a sequence of upper bounds converging to &gamma;k, though the computation time grows very quickly as better bounds are guaranteed.
Decision Rule Based Data Models Using NetTRS System Overview
Authors: Marcin Michalak, Marek Sikora
Venue: Transactions on Rough Sets IX (2008)

The NetTRS system is a web service that makes induction, evaluation and postprocessing of decision rules possible. The TRS library is the kernel of the system. It allows to induce rules by means of the tolerance rough sets model. The NetTRS makes user interface of the TRS library available in the Internet. The main emphasis of the NetTRS system is placed on induction and postprocessing of decision rules. This article shows the architecture and the functionality of the system. This paper describes also the parameterization of algorithms that are implemented in the TRS library.
Dynamic Component Extension: a Strategy for Performance Improvement in Multicomponent Applications
Authors: Sundari M. Sivagama, Sathish S. Vadhiyar, Ravi S. Nanjundiah
Venue: International Journal of High Performance Computing Applications (2009)

Multicomponent application paradigms have gained prominence in many significant multidisciplinary scientific applications. In this work, we propose a software strategy called dynamic component extension for multicomponent applications to improve application performance by minimizing processor idling. In this strategy, the processor space of a component is dynamically extended to include the processors of other components during certain computationally intensive phases of the component. We demonstrate its use in improving the performance of one of the most prominent multicomponent applications, the community climate system model (CCSM). In this application, we dynamically extend the atmosphere component to minimize the idling in other components caused by large periodic temporal load imbalances in the atmosphere component. By means of experiments on different parallel platforms with different numbers of processors, we show that using our strategy can lead to about 15% reduction and savings of several days in execution times of CCSM for 1000-year simulation runs.
Automatic Generation of Distributed Team Formation Algorithms from Organizational Models
Authors: Michael Köhler-Bußmeier, Matthias Wester-Ebbinghaus
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an expressive and abstract real-world reference presents a promising starting point. Organizational concepts have particularly been studied within the multi-agent systems community. However, there exists a conceptual gap between organizational specifications and their multi-agent implementation. We address this problem by presenting an integrated approach to formalize organizational models with Petri nets and to directly deploy these specifications in a multi-agent system. The operational semantics of Petri nets establishes a close link between organizational specification and deployment that eases system development and maintenance. As an important example, we are able to describe the formation of multi-agent teams in an organizational scenario in terms of Petri net dynamics.
Learning styles testing in Moodle
Authors: Daniela Dureva, Georgi Tuparov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The paper presents a module for studying of learning styles integrated in Moodle. The module is based on the Kolb's Learning Styles Inventory, Felder-Silverman Learning Styles Model, Gardner's Multiple Intelligence Inventory, Reid model. Also some results of pilot study with the module are performed.
Nonparametric classification based on local mean and class statistics
Authors: Yong Zeng, Yupu Yang, Liang Zhao
Venue: Expert Systems with Applications: An International Journal (2009)

The k-nearest neighbor classification rule (k-NNR) is a very simple, yet powerful nonparametric classification method. As a variant of the k-NNR, a nonparametric classification method based on the local mean vector has achieved good classification performance. In pattern classification, the sample mean and sample covariance are the most important statistics related to class discriminatory information. In this paper, a new variant of the k-NNR, a nonparametric classification method based on the local mean vector and class statistics has been proposed. Not only the local information of the k nearest neighbors of the unclassified pattern in each individual class but also the global knowledge of samples in each individual class are taken into account in this new classification method. The proposed classification method is compared with the k-NNR, and the local mean-based nonparametric classification in terms of the classification error rate on the unknown patterns. Experimental results confirm the validity of this new classification approach.
Regular bipartite graphs are antimagic
Authors: Daniel W. Cranston
Venue: Journal of Graph Theory (2009)

A labeling of a graph G is a bijection from E(G) to the set {1, 2,&hellip; |E(G)|}. A labeling is antimagic if for any distinct vertices u and v, the sum of the labels on edges incident to u is different from the sum of the labels on edges incident to v. We say a graph is antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that every connected graph other than K2 is antimagic. In this article, we show that every regular bipartite graph (with degree at least 2) is antimagic. Our technique relies heavily on the Marriage Theorem. &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 60: 173182, 2009
Designing viable business models for context-aware mobile services
Authors: Mark de Reuver, Timber Haaker
Venue: Telematics and Informatics (2009)

Technologies of 3G and beyond open up new opportunities to develop and commercialize context-aware services that utilize information like user location and social context. Although initial expectations were high, the adoption and diffusion of context-aware services have thus far been limited. Existing literature points to failing business models to explain part of the disappointing uptake. However, most authors focus on the factors that explain failing business models rather than providing practical design issues to improve business model viability. This paper fills this gap by specifying generic mobile business model design issues for the domain of context-aware services. As such, we provide a well-grounded, holistic overview of design issues that are the most critical in developing viable business models for context-aware services, based on interviews with eighteen esteemed practitioners and academics in the mobile services domain, at CEO and Professor level. Our findings indicate key challenges in the service domain (i.e. defining value adding elements, specifying target groups and generating trust of consumers in the service), the technology domain (i.e. integrating emerging technology platforms and safeguarding privacy and security), the organizational domain (i.e. division of existing and new roles in complex value networks, openness of the value network towards new service providers and governing the activities in the value network) and the financial domain (i.e. pricing; dividing costs and revenues and combining multiple revenue models). Our research has scientific implications, because it applies generic mobile business model theory to the context-aware services domain. In addition, we provide practical clues to practitioners with regard to the design issues on which they should focus while developing more viable context-aware business models.
A continuation-based noninterruptible multithreading processor architecture
Authors: Satoshi Amamiya, Makoto Amamiya, Ryuzo Hasegawa, Hiroshi Fujita
Venue: The Journal of Supercomputing (2009)

Current trend of research on multithreading processors is toward the chip multithreading (CMT), which exploits thread level parallelism (TLP) and improves performance of softwares built on traditional threading components, e.g., Pthread. There exist commercially available processors that support simultaneous multithreading (SMT) on multicore processors. But they are basically based on the conventional sequential execution model, and execute multiple threads in parallel under the control of OS that handles interruptions. Moreover, there exist few languages or programming techniques to utilize the multicore processors effectively.We are taking another approach to develop a multithreading processor, which is dedicated to TLP. Our processor, named Fuce, is based on the continuation-based multithreading. A thread is defined as a block of sequentially ordered instructions which are executed without interruption. Every thread execution is triggered only by the event called continuation.This paper first introduces the continuation-based multithread execution model and its processor architecture then gives multithreaded programming techniques and the continuation-based multithreading language system CML. Last, the performance of the Fuce processor is evaluated by means of the clock-level software simulation.