ppxscal/embedding_network huggingface dataset:
Multiple objects tracking by color-based methods
Authors: Chun-Hung Chen, Cheng-Yan Kao
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

Motion object tracking in real-time environment and video is a popular topic in multimedia processing. Various related researches proposed to handle particular cases in recent years. We proposed several modified methods about background modeling, foreground detection, moving object modeling and matching to achieve the goal of tracking multiple objects in indoor and outdoor scenarios. In our experimental settings, we can discriminate and track objects accurately as well as detect and deal with occlusions in all videos.
A Coalgebraic Theory of Reactive Systems
Authors: Filippo Bonchi, Ugo Montanari
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In this paper we investigate the connection between two well known models for interactive systems. Reactive Systems a la Leifer and Milner allow to derive an interactive semantics from a reduction semantics guaranteeing, under rather restrictive conditions, the compositionality of the abstract semantics (bisimilarity). Universal Coalgebra provides a categorical framework where bisimilarity can be characterized as final semantics, i.e., as the unique morphism to the final coalgebra. Moreover, if lifting a coalgebra to a structured setting is possible, then bisimilarity is compositional with respect to the lifted structure. Here we show that for every reactive system we can build a coalgebra. Furthermore, if bisimilarity is compositional in the reactive system, then we can lift this coalgebra to a structured coalgebra.
An operator formula for the number of halved monotone triangles with prescribed bottom row
Authors: Ilse Fischer
Venue: Journal of Combinatorial Theory Series A (2009)

Monotone triangles are certain triangular arrays of integers, which correspond to nxn alternating sign matrices when prescribing (1,2,...,n) as bottom row of the monotone triangle. In this article we define halved monotone triangles, a specialization of which correspond to vertically symmetric alternating sign matrices. We derive an operator formula for the number of halved monotone triangles with prescribed bottom row which is analogous to our operator formula for the number of ordinary monotone triangles [I. Fischer, The number of monotone triangles with prescribed bottom row, Adv. in Appl. Math. 37 (2) (2006) 249-267].
Flexible Framework for Time-Series Pattern Matching over Multi-dimension Data Stream
Authors: Takuya Kida, Tomoya Saito, Hiroki Arimura
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

In this paper, we study a complex time-series pattern matching problem over a multi-dimension continuous data stream. For each data stream, a pattern is given as a sequence of predicates, which specify a sequence of element sets on the stream. The pattern matching problem over such a multi-dimension data stream, is to find all occurrences where all predicates in the patterns are satisfied. We propose a flexible and extensible framework to solve the problem, which is based on bit-parallel pattern matching method that simulates NFAs for the pattern matching efficiently by a few logical bit operations. We consider four types of data streams especially: textual, categorical, ordered, and numeric, that is, those are a sequence of strings, concepts with taxonomic information, small integers, and real numbers (or large integers), respectively. We also present the time complexities to do pattern matching for those data types.
Annotating Sanskrit Texts Based on Śābdabodha Systems
Authors: K. V. Ramkrishnamacharyulu
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

Though Sanskrit has a huge repository of texts as well as well discussed grammar formalism, we still neither have a full fledged parser for Sanskrit based on this formalism nor do we have any annotated text. 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
Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times
Authors: T. C. E. Cheng, B. M. T. Lin, Y. Tian
Venue: Computers and Operations Research (2009)

This paper considers the problem of scheduling a two-stage flowshop that consists of a common critical machine in stage one and two independent dedicated machines in stage two. All the jobs require processing first on the common critical machine. Each job after completing its critical operation in stage one will proceed to the dedicated machine of its type for further processing in stage two. The objective is to minimize the weighted sum of stage-two machine completion times. We show that the problem is strongly NP-hard, and develop an O(n^3) polynomial time algorithm to solve the special case where the sequences of both types of jobs are given. We also design an approximation algorithm with a tight performance ratio of 43 for the general case.
Entanglement in GaAs and CdSe quantum dots: Exact calculations and DFT approximations
Authors: J. P. Coe, A. Sudbery, I. D'Amico
Venue: Microelectronics Journal (2009)

We consider two electrons confined in spherical GaAs and CdSe quantum dots and calculate their ground-state spatial entanglement exactly within a parabolic confinement model. We propose a perturbative scheme to approximate the above entanglement within density-functional theory and show that it reproduces the exact results quite accurately for GaAs dots of diameter up to 25nm and CdSe dots of diameter up to 15nm.
Model-Based Testing Using Scenarios and Event-B Refinements
Authors: Qaisar A. Malik, Johan Lilius, Linas Laibinis
Venue: Methods, Models and Tools for Fault Tolerance (2009)

In this paper, we present a model-based testing approach based on user provided testing scenarios. In this approach, when a software model is refined to add or modify features, the corresponding testing scenarios are automatically refined to incorporate these changes. The test cases, to be applied on the system under test, are generated from these scenarios. We use the Event-B formalism for software models, while user scenarios are represented as Communicating Sequential Process (CSP) expressions. The presented case study demonstrates how our approach can be used to test different features of a system such as incorporated fault-tolerance mechanisms.
Congestion Control and Adaptive Retransmission for Multimedia Streaming over Wireless Networks
Authors: Kamal Deep Singh, Árpád Huszák, David Ros, César Viho, Gábor Jeney
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In wireless networks, congestion control, alone, may not be enough to ensure good quality of multimedia streaming and efficient utilization of the network. Packet losses due to the high bit error rate not only degrade the multimedia quality, but render the current congestion control algorithms as inefficient: these algorithms back-off on every packet loss even when there is no congestion. In this paper we study the case of pre-recorded multimedia streaming over wireless networks. We integrate the congestion control schemes with an adaptive retransmission scheme in order to selectively retransmit some lost multimedia packets. Moreover, we integrate a wireless loss estimation scheme to improve the efficiency of congestion control. Our results show that the integrated scheme improves the multimedia quality due to the retransmission and recovery of some of the lost multimedia data. Moreover, the congestion control schemes, and hence the integrated retransmission scheme, show improved performance because of the wireless loss estimation.
Spatial-temporal sink-proxy of the intelligent-sink for on-demand information retrieval in sensor network
Authors: Rui Teng, Bing Zhang
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

This paper introduces the usage and selection of spatial-temporal sink proxy for on-demand information retrieval in sensor networks. A sink proxy is a sensor node selected among sensor nodes by the sink node for local query distribution and data collection. Such a sink node, termed the intelligent sink, utilizes the correlation of query content and individual sensor nodes to specify the corresponding sensor nodes of user interest, and then selects the sink proxy according to the locations of sensor nodes. The proposed scheme achieves highly distributed and low energy consumption among sensor nodes. The evaluation results reveal that the proposed sink-proxy scheme reduces the energy consumption of information retrieval in the network and obtains balanced energy consumption among sensor nodes.
Literature mining method RaJoLink for uncovering relations between biomedical concepts
Authors: Ingrid Petrič, Tanja Urbančič, Bojan Cestnik, Marta Macedoni-Lukšič
Venue: Journal of Biomedical Informatics (2009)

To support biomedical experts in their knowledge discovery process, we have developed a literature mining method called RaJoLink for identification of relations between biomedical concepts in disconnected sets of articles. The method implements Swanson's ABC model approach for generating hypotheses in a new way. The main novelty is a semi-automated suggestion of candidates for agents a that might be logically connected with a given phenomenon c under investigation. The choice of candidates for a is based on rare terms identified in the literature on c. As rare terms are not part of the typical range of information, which describe the phenomenon under investigation, such information might be considered as unusual observations about the phenomenon c. If literatures on these rare terms have an interesting term in common, this joint term is declared as a candidate for a. Linking terms b between literature on a and literature on c are then searched for in the closed discovery to provide additional supportive evidence for uncovered connections. We have applied the method to the literature on autism and have used MEDLINE as a source of data. Expert evaluation has confirmed that the discovered relations might contribute to a better understanding of autism.
Some designs and codes invariant under the groups S9 and A8
Authors: M. R. Darafsheh, A. Iranmanesh, R. Kahkeshani
Venue: Designs, Codes and Cryptography (2009)

We examine some designs and binary codes constructed from the primitive permutation representations of the groups PSL 2(8) and PSL 2(9). For PSL 2(8) of degree 36, we construct a design and its code with the automorphism groups PSL 2(8) and S 9, respectively. For PSL 2(8) of degree 36 and PSL 2(9) of degree 15, we construct some designs and its codes invariant under the groups S 9 and A 8, respectively. The weight distribution and the dual of these codes are determined. By considering the action of automorphism groups on some of these codes, we obtain the structure of the stabilizer for every codeword and construct some designs such that S 9 or A 8 act primitively on them.
Multilevel minimum cross entropy threshold selection based on honey bee mating optimization
Authors: Ming-Huwi Horng
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

Image entropy thresholding approach has drawn the attentions in image segmatation. The endeavor of this paper is focused onmultilevel thresholding using the minimumcross enrtop criterion. In the literature, the particle swarm optimization (PSO) had been applied to conducting the thresold selection. The adopted algorithm used in this paper is the honey bee mating optimization (HBMO). In experimnats, the two different methods are implemented for comparison with the results of segmantation. Compared to the results of PSO, the threshold selection of HBMO is more close to the optimal ones examined by the exhaustive search method. Furthermore, the segmentation result of HBMO is superior to PSO method, but it still slower than ones of PSO.
Replay
Authors: Zakaria Boumediane, Anthony Voisin, Fabien Félicité-Zulma, Camille Delmeule
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

In a dry world without oxygen, humans have to live underground. Lana, a young woman, has to take care of her little brother Theo. But one day he disobeys ...
Automated diagnostic systems: arterial disorders detection
Authors: Elif Derya Übeyli
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

The paper includes illustrative and detailed information about implementation of automated diagnostic systems and feature extraction/selection from signals recorded from arteries. The major objective of the paper is to be a guide for the readers, who want to develop an automated diagnostic systems for detection of arterial disorders. Toward achieving this objective, this paper present the techniques which should be considered in developing automated diagnostic systems. The author suggest that the content of the paper will assist to the people in gaining a better understanding of the techniques in the detection of arterial disorders.
On the Approximation of Fuzzy System
Authors: Shihong Yue, Wei Chen, Jin Wang, Huaxiang Wang
Venue: International Journal of Distributed Sensor Networks (2009)

The choice of fuzzy set function affects how well the fuzzy systems approximate an unknown function. We first examine several popular fuzzy systems, based on which we generalize the error of the fuzzy system by the mathematical functional. Two classes of extended fuzzy systems with special set function are proposed respectively in one-dimensional and two-dimensional reproducing kernel spaces, and they are in fact the best interpolation operators in the sense of classical mathematical approximation. The extended fuzzy system can be used as easily as any typical fuzzy system but has better characters. Our major contributions are as follows. We prove that the existing fuzzy system with a triangle-shaped set function is by no means the best choice for an uncertain system. On the contrary, the reproducing kernel-shaped set function can give the best approximation in the sense of mathematical functional. According to the result, overlapped symmetric triangles or trapezoid set functions reduce fuzzy systems to piecewise linear systems. Universal Gaussian bell-curve set functions can work well but its learning cost is too expensive to apply under online condition. We explain what our proposed extended fuzzy system is useful for a given uncertain system. This solution is associated with another problem: Is the reproducing kernel condition too specific to limit its applications? We must stress that the reproducing kernel function is easily found in any continuous function space. Consequently, the extended fuzzy system can approximate any continuous function with arbitrary accuracy. Furthermore one may question why we do not directly use an optimal approximation functional instead of the extended fuzzy system. Here we answer this problem by the following point of views: The two methods face different applicable conditions. The optimal approximation functional is used to interpolate those accurate data. These data are needed under certain conditions such as distributions and quantity, etc. When little information is available, an optimal approximation functional will do nothing. But the extended fuzzy system gives a good approximation to an uncertain system and can work efficiently under the condition of vague or poor information. Consequently, the two methods have different optimal criteria and different input and output descriptions. Furthermore, the extended fuzzy systems can be created flexibly by artificial experiences or other ways. Two experiments are used to verify the effectiveness and efficiency of our proposed extended fuzzy systems.
Accelerating cosmological data analysis with graphics processors
Authors: Dylan W. Roeh, Volodymyr V. Kindratenko, Robert J. Brunner
Venue: Proceedings of 2nd Workshop on General Purpose Processing on Graphics Processing Units (2009)

In this paper we describe a successful effort to accelerate the two-point angular correlation function---a basic statistics tool used in the field of cosmology to characterize the distribution of the matter and energy in the Universe---by using an NVIDIA GPU-based system. We demonstrate the use of GPUs to accelerate the calculation of histograms of angular separations for large datasets as we achieve over two orders of magnitude performance improvement over conventional microprocessors. We discuss the specific implementation details of GPU kernels for computing bin assignments and updating histogram bins. We also describe an MPI-based GPU-accelerated two-point correlation application that runs on a compute cluster with multiple GPUs. Finally, we discuss specific lessons we learned in using GPUs to implement this class of algorithms.
Game-theoretic timing analysis
Authors: Sanjit A. Seshia, Alexander Rakhlin
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Estimating the worst-case execution time (WCET) of tasks is a key step in the design of reliable real-time software and systems. In this paper, we present a new, game-theoretic approach to estimating WCET based on performing directed measurements on the target platform. We model the estimation problem as a game between our algorithm (player) and the environment of the program (adversary), where the player seeks to find the longest path through the program while the adversary sets environment parameters to thwart the player. We present both theoretical and experimental results demonstrating the utility of our approach. On the theoretical side, we prove that our algorithm can converge to find the longest path with high probability. Experimental results indicate that our approach is competitive with an existing technique based on static analysis and integer programming. Moreover, the approach can be easily applied to even complex hardware/software platforms.
The spectra of the local graphs of the twisted Grassmann graphs
Authors: Sejeong Bang, Tatsuya Fujisaki, J. H. Koolen
Venue: European Journal of Combinatorics (2009)

In this paper we will determine the spectra of the local graphs of the twisted Grassmann graphs and look at its consequences for the associated Terwilliger algebras. In particular, we show that the Terwilliger algebra for the twisted Grassmann graphs does depend on the base point. More specifically, we show that for the twisted Grassmann graphs there are two vertices x and y such that for the Terwilliger algebra with base point x all the irreducible modules are thin and for the Terwilliger algebra with base point y there exist non-thin irreducible modules.
Q3M --- QoS Architecture for Multi-user Mobile Multimedia Sessions in 4G systems
Authors: Eduardo Cerqueira, Luis Veloso, Augusto Neto, Marília Curado, Paulo Mendes, Edmundo Monteiro
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

Fourth generation systems (4G) will provide multimedia group communication sessions to multiple mobile users with distinct requirements. This way, it is expected the control of the quality level, connectivity and ubiquitous access for multi-user multimedia sessions across heterogeneous and mobile networks with seamless capability. This paper analyses the requirements of a control architecture to provide Quality of Service (QoS), connectivity and seamless handover management for multi-user sessions in 4G systems, and introduces the QoS Architecture for Multi-user Mobile Multimedia (Q3M) proposal. In addition, simulation results present the efficiency of this approach concerning the session setup time and packet losses during handover.
GPMIP: a proxy mobile IPv6 based global mobility management architecture and protocol
Authors: Huachun Zhou, Hongke Zhang, Yajuan Qin, Hwang-Cheng Wang, Han-Chieh Chao
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper specifies a Proxy Mobile IPv6 based global mobility management architecture and protocol procedure, named GPMIP. In GPMIP, the mobility management is performed by network entity other than mobile node itself. The benefit is the elimination of the wireless link data delivery tunnel overhead between the mobile node and the access router. To compare with well known Hierarchical Mobile IPv6 mobility management protocol, the location update, packet delivery, and total cost functions generated by a mobile node during its average domain residence time in each protocol are formulated based on fluid flow mobility model. Then, the impacts of various system parameters on the cost functions are analyzed, respectively. The analysis results indicate that the proposed Proxy Mobile IPv6 based global mobility management protocol can guarantee lower total costs.
The integration of multimedia communications
Authors: B. P. Donohue,  III
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Effective integration of multimedia communications requires a unified electronic work station. The unified work capabilities that must be provided are information access translation, information processing, information storage, and information movement. This paper describes the current issues involved in providing these unified capabilities. Examples of current multimedia communications systems are also given.
Relationships Between Game Attributes and Learning Outcomes
Authors: Katherine A. Wilson, Wendy L. Bedwell, Elizabeth H. Lazzara, Eduardo Salas, C. Shawn Burke, Jamie L. Estock, Kara L. Orvis, Curtis Conkey
Venue: Simulation and Gaming (2009)

Games are an effective and cost-saving method in education and training. Although much is known about games and learning in general, little is known about what components of these games (i.e., game attributes) influence learning outcomes. The purpose of this article is threefold. First, we review the literature to understand the "state of play" in the literature in regards to learning outcomes and game attributes - what is being studied. Second, we seek out what specific game attributes have an impact on learning outcomes. Finally, where gaps in the research exist, we develop a number of theoretically based proposals to guide further research in this area.
Multiplicative Mixture Models for Overlapping Clustering
Authors: Qiang Fu, Arindam Banerjee
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

The problem of overlapping clustering, where a point is allowed to belong to multiple clusters, is becoming increasingly important in a variety of applications. In this paper, we present an overlapping clustering algorithm based on multiplicative mixture models. We analyze a general setting where each component of the multiplicative mixture is from an exponential family, and present an efficient alternating maximization algorithm to learn the model and infer overlapping clusters. We also show that when each component is assumed to be a Gaussian, we can apply the kernel trick leading to non-linear cluster separators and obtain better clustering quality. The efficacy of the proposed algorithms is demonstrated usingexperiments on both UCI benchmark datasets and a microarray gene expression dataset.