ppxscal/embedding_network huggingface dataset:
Parallelization Strategies and Performance Analysis of Media Mining Applications on Multi-Core Processors
Authors: Wenlong Li, Xiaofeng Tong, Tao Wang, Yimin Zhang, Yen-Kuang Chen
Venue: Journal of Signal Processing Systems (2009)

This paper studies how to parallelize the emerging media mining workloads on existing small-scale multi-core processors and future large-scale platforms. Media mining is an emerging technology to extract meaningful knowledge from large amounts of multimedia data, aiming at helping end users search, browse, and manage multimedia data. Many of the media mining applications are very complicated and require a huge amount of computing power. The advent of multi-core architectures provides the acceleration opportunity for media mining. However, to efficiently utilize the multi-core processors, we must effectively execute many threads at the same time. In this paper, we present how to explore the multi-core processors to speed up the computation-intensive media mining applications. We first parallelize two media mining applications by extracting the coarse-grained parallelism and evaluate their parallel speedups on a small-scale multi-core system. Our experiment shows that the coarse-grained parallelization achieves good scaling performance, but not perfect. When examining the memory requirements, we find that these coarse-grained parallelized workloads expose high memory demand. Their working set sizes increase almost linearly with the degree of parallelism, and the instantaneous memory bandwidth usage prevents them from perfect scalability on the 8-core machine. To avoid the memory bandwidth bottleneck, we turn to exploit the fine-grained parallelism and evaluate the parallel performance on the 8-core machine and a simulated 64-core processor. Experimental data show that the fine-grained parallelization demonstrates much lower memory requirements than the coarse-grained one, but exhibits significant read-write data sharing behavior. Therefore, the expensive inter-thread communication limits the parallel speedup on the 8-core machine, while excellent speedup is observed on the large-scale processor as fast core-to-core communication is provided via a shared cache. Our study suggests that (1) extracting the coarse-grained parallelism scales well on small-scale platforms, but poorly on large-scale system; (2) exploiting the fine-grained parallelism is suitable to realize the power of large-scale platforms; (3) future many-core chips can provide shared cache and sufficient on-chip interconnect bandwidth to enable efficient inter-core communication for applications with significant amounts of shared data. In short, this work demonstrates proper parallelization techniques are critical to the performance of multi-core processors. We also demonstrate that one of the important factors in parallelization is the performance analysis. The parallelization principles, practice, and performance analysis methodology presented in this paper are also useful for everyone to exploit the thread-level parallelism in their applications.
Finite dominating sets for the multi-facility ordered median problem in networks and algorithmic applications
Authors: Huajun Tang, T. C. E. Cheng, C. T. Ng
Venue: Computers and Industrial Engineering (2009)

We identify a finite dominating set (FDS) for a special case of the multi-facility ordered median problem in networks, in which the @l-weights can take at least two different values. This FDS result not only includes the FDS research for the p-center problem, but also extends the case of a
A resource-constrained assembly job shop scheduling problem with Lot Streaming technique
Authors: T. C. Wong, Felix T. S. Chan, L. Y. Chan
Venue: Computers and Industrial Engineering (2009)

To ensure effective shop floor production, it is vital to consider the capital investment. Among most of the operational costs, resource must be one of the critical cost components. Since each operation consumes resources, the determination of resource level is surely a strategic decision. For the first time, the application of Lot Streaming (LS) technique is extended to a Resource-Constrained Assembly Job Shop Scheduling Problem (RC_AJSSP). In general, AJSSP first starts with Job Shop Scheduling Problem (JSSP) and then appends an assembly stage for final product assembly. The primary objective of the model is the minimization of total lateness cost of all final products. To enhance the model usefulness, two more experimental factors are introduced as common part ratio and workload index. Hence, an innovative approach with Genetic Algorithm (GA) is proposed. To examine its goodness, Particle Swarm Optimization (PSO) is the benchmarked method. Computational results suggest that GA can outperform PSO in terms of optimization power and computational effort for all test problems.
TMAC: Taint-Based Memory Protection via Access Control
Authors: Lei Wang, Chen Fang, Bing Mao, Li Xie
Venue: Proceedings of the 2009 Second International Conference on Dependability (2009)

Memory corruption attacks account for most parts of malicious attacks toward software security. Recently dynamic taint analysis is proposed and is gaining momentum. This proposed technique attempts to defeat attacks by checking the taintedness and integrity of pointers when accessing memory since vulnerabilities are always motivated by tainting pointers. Unfortunately, there exists some class of attacks without tainting pointers, such as array bounds violation attacks using pointers. In this paper, we propose a novel approach to defeat this kind of undetected attacks using taint-based tracking analysis. Our notion is based on the memory access control, that is, first, we will check the taintedness of the pointers when accessing memory like existing taint-based approaches, second, we will check whether or not the memory area is in the legitimate range of a pointer used to access this memory. Our implementation dose not need source code and is based on Valgrind, hence works on commodity software. To demonstrate our idea, we performed a preliminary empirical experiments, the results are quite promising: TMAC can effectively detect a wide range of attacks, and the average runtime overhead is close to Memcheck, a widely memory error detector.
Supporting student engagement in simulation development
Authors: Katerina Glezou, Maria Grigoriadou
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This paper presents a small-scale study investigating the use of the MicroWorlds Pro multimedia programming environment as an authoring tool for constructing models, simulations and multimedia applications with students of Senior High School. We implemented two alternate instructional strategies: simulation development from scratch and use of a preconstructed microworld, and observed how the students collaborate and interact with the programming environment. The findings highlight the overall process and the differences in the students' levels of engagement and performance, indicating some special features of the programming environment that contribute to or cause difficulty in the creation of an effective learning environment.
A Theoretical Analysis of Immune Inspired Somatic Contiguous Hypermutations for Function Optimization
Authors: Thomas Jansen, Christine Zarges
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

Artificial immune systems can be applied to a variety of very different tasks including classical function optimization. There are even artificial immune systems tailored specifically for this task. In spite of the successful application there is little knowledge and hardly any theoretical investigation about how and why they perform well. Here a rigorous analysis for a specific type of mutation operator introduced for function optimization called somatic contiguous hypermutation is presented. While there are serious limitations to the performance of this operator even for simple optimization tasks it is proven that for some types of optimization problems it performs much better than standard bit mutations most often used in evolutionary algorithms.
An Image Mosaics Algorithm Based on Improved Phase Correlation
Authors: Zhang Jing, Wang Chang-shun, Liao Wu-ling
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

An image mosaics algorithm based on improved phase correlation is proposed in this paper. The improved phase correlation improves on the conventional phase correlation in three aspects. Firstly, the contours of images are extracted, and the phase correlation is applied to the contours of images instead of the whole original images. Secondly, when there are multiple peak values approximate to the maximum peak value in the function array, their corresponding translations can be regarded as candidate translations and calculated separately, and the best translation should be determined by the optimization of conformability of two images in the overlapping area. Thirdly, the effect of minor rotations on mosaics is taken into consideration. The running results show that the proposed algorithm can stably yield high quality mosaics, even in the cases of poor or differential lighting conditions and multiple peak values approximate to the maximum peak value, existences of minor rotations and other complicated displacements between images.
Logic Programming for Multiagent Planning with Negotiation
Authors: Tran Cao Son, Enrico Pontelli, Chiaki Sakama
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Multiagent planning deals with the problem of generating plans for multiple agents. It requires formalizing ways for the agents to interact and cooperate, in order to achieve their goals. One way for the agents to interact is through negotiations. Integration of negotiation in multiagent planning has not been extensively investigated and a systematic way for this task has yet to be found. We develop a generic model for negotiation in dynamic environments and apply it to generate joint-plans with negotiation for multiple agents. We identify the minimal requirements for such a model and propose a general scheme for one-to-one negotiations. This model of negotiation is instantiated to deal with dynamic knowledge of planning agents. We demonstrate how logic programming can be employed as a uniform platform to support both planning and negotiation, providing an ideal testbed for experimenting with multiagent planning with negotiations.
A Class of Cross-Layer Optimization Algorithms for Performance and Complexity Trade-Offs in Wireless Networks
Authors: Xiaoying Zheng, Feng Chen, Ye Xia, Yuguang (Michael) Fang
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

In this paper, we solve the problem of a joint optimal design of congestion control and wireless MAC-layer scheduling using a column generation approach with imperfect scheduling. We point out that the general subgradient algorithm has difficulty in recovering the time-share variables and experiences slower convergence. We first propose a two-timescale algorithm that can recover the optimal time-share values. Most existing algorithms have a component, called global scheduling, which is usually NP-hard. We apply imperfect scheduling and prove that if the imperfect scheduling achieves an approximation ratio \rho, then our algorithm produces a suboptimum of the overall problem with the same approximation ratio. By combining the idea of column generation and the two-timescale algorithm, we derive a family of algorithms that allows us to reduce the number of times the global scheduling is needed.
Electromyography Focused on Passiveness and Activeness in Embodied Interaction: Toward a Novel Interface for Co-creating Expressive Body Movement
Authors: Takabumi Watanabe, Norikazu Matsushima, Ryutaro Seto, Hiroko Nishi, Yoshiyuki Miwa
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

In expressive body movement created by one person and his/her partner, a sense of nonseparation, as if one's body and his/her partner's body are united, is experienced. For such a relationship between the two, a process to feel passiveness and activeness physically is important. The objective of this study is to capture passiveness and activeness in bodily interaction. We focused on myoelectric (ME) potential from which time of generation and amplitude differ in voluntary and reaction movements. A measurement system was developed using ME potential in bodily interaction. This technique was validated by our data.
Simultaneous Stabilization for a Class of Generalized Linear System
Authors: Jing Ma, Kun Ma
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The paper considers stable right inverse and stable right null space for a class of generalized linear systems via the stable fractional theory. Simultaneous stabilization problem for a class of generalized linear systems is discussed in terms of stable right inverse and stable right null space. A design approach of the simultaneously stabilizing controllers is proposed and parameterized using stable right inverse and stable right null space. A numerical example is given to illustrate the design procedure.
OSL: Optimized Bulk Synchronous Parallel Skeletons on Distributed Arrays
Authors: Noman Javed, Frédéric Loulergue
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

The existing solutions to program parallel architectures range from parallelizing compilers to distributed concurrent programming. Intermediate approaches propose a more structured parallelism: Algorithmic skeletons are higher-order functions that capture the patterns of parallel algorithms. The user of the library has just to compose some of the skeletons to write her parallel application. When one is designing a parallel program, the parallel performance is important. It is thus very interesting for the programmer to rely on a simple yet realistic parallel performance model such as the Bulk Synchronous Parallel (BSP) model. We present OSL, the Orléans Skeleton Library: it is a library of BSP algorithmic skeletons in C++. It offers data-parallel skeletons on arrays as well as communication oriented skeletons. The performance of OSL is demonstrated with two applications: heat equation and FFT.
Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation
Authors: Marzena Kryszkiewicz
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

The discovery of frequent patterns has attracted a lot of attention of the data mining community. While an extensive research has been carried out for discovering positive patterns, little has been offered for discovering patterns with negation. The main hindrance to the progress of such research is huge amount of frequent patterns with negation, which exceeds the number of frequent positive patterns by orders of magnitude. In this paper, we examine properties of derivable and non-derivable patterns, including those with negated items. In particular, we establish important relationships among patterns admitting negation that have the same canonical variant. By analogy to frequent non-derivable itemsets, which constitute a concise lossless representation NDR of frequent positive patterns, we introduce frequent non-derivable literal sets lossless representation NDRL of frequent positive patterns admitting negation. Then we use the derived properties of literal sets to offer a concise representation NDIR of frequent patterns admitting negation that is built only from positive non-derivable itemsets. The relationships between the three representations are identified. The transformation of the new representations into not less concise lossless closure representations is discussed.
The Research of Chinese Automatic Word Segmentation In Hierarchical Model Dictionary Binary Tree
Authors: Luo XianGang, Luo Jin, Xie Zhong
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

With the continuous development and growing popularity of the Internet, the amount of information on-line is in the explosive growth. How to find out the information that we need correctly and quickly from the mass data, then put in the front. Under this background, the Internet search engine grows up rapidly. This article describes the search engine on the general principle and common technology, and on this basis, combined with analyzeing the existing technology ofChinese Automatic Word Segmentation, then to achieve a "wide-based segmentation of the largest positive scan," the Chinese word segmentation algorithm. According to the full text index technology, information search engine uses the means both of by word index and words index.Then, through the set of high-speed computing, and retrieve the information of users' requriements. Finally, using hierarchical model Lexicon Binary Tree, which reserched and realized the model of information search engine.
Human-UAV Co-operation Based on Artificial Cognition
Authors: Claudia Meitinger, Axel Schulte
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

In the future, Uninhabited Aerial Vehicles (UAVs) will be part of both civil and military aviation. This includes co-operative mission accomplishment of manned and unmanned assets with little manpower being available for UAV guidance. So, UAVs need to be able to accomplish tasks with a minimum of human intervention and possibly in co-operation with other UAVs or manned aircraft. This paper presents artificial cognition as approach to co-operative capabilities of UAVs. They are guided by so-called Artificial Cognitive Units (ACUs) being capable of goal-directed behavior on the basis of understanding the current situation. Prototype evaluation results show the capability of suchlike co-operative ACUs to yield human-like rationality and the ability to act as peers in a human-ACU team.
Performance Analysis of Cognitive Radio Networks against Secondary User's Policies
Authors: Min Zhang, Shengming Jiang, Gang Wei, Hongjiang Wang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In a cognitive radio network (CRN), instead of direct leaving, an interrupted secondary user (SU) is suspended to wait for another channel. The policy for the packets generated by the SU during the suspending time can be either discarding or buffering.This paper mainly analyzes the performance of a CRN against these two policies. Here, two Markov models are proposed to derive the formulas for packet loss ratio, packet delay and spectrum utilization. Numerical results show that theoretical models are consistent with simulation results. The major observations include (i) The performance of a CRN is more sensitive to the primary users’ traffic loads than that of secondary users and (ii) adopting discarding or buffering policy for the packets of SUs does not make much difference to the CRN’s spectrum utilization.
An Optimization Strategy to Feature Models' Verification by Eliminating Verification-Irrelevant Features and Constraints
Authors: Hua Yan, Wei Zhang, Haiyan Zhao, Hong Mei
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

Feature models provide an effective approach to requirements reuse. One important problem related to feature models is the verification problem, which is NP-complete in theory. The existing approaches to feature models' verification mostly focus on how to automate the verification of feature models using third-party's tools, while these tools are usually designed to resolve general kinds of problems. However, by simply using these third-party's tools, large-sized feature models still can hardly be verified within acceptable time. We argue that, to improve the efficiency of verification, the problem itself should be at first optimized. In this paper, we propose an optimization strategy to feature models' verification, in which, verification-irrelevant features and constraints are eliminated from feature models and the problem size of verification is therefore reduced. We prove the correctness of this strategy, while experiments show the effectiveness of this strategy.
Pretty-Bad-Proxy: An Overlooked Adversary in Browsers' HTTPS Deployments
Authors: Shuo Chen, Ziqing Mao, Yi-Min Wang, Ming Zhang
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

HTTPS is designed to provide secure web communications over insecure networks. The protocol itself has been rigorously designed and evaluated by assuming the network as an adversary. This paper is motivated by our curiosity about whether such an adversary has been carefully examined when HTTPS is integrated into the browser/web systems. We focus on a specific adversary named “Pretty-Bad-Proxy” (PBP). PBP is a malicious proxy targeting browsers’ rendering modules above the HTTP/HTTPS layer. It attempts to break the end-to-end security guarantees of HTTPS without breaking any cryptographic scheme. We discovered a set of vulnerabilities exploitable by a PBP: in many realistic network environments where attackers can sniff the browser traffic, they can steal sensitive data from an HTTPS server, fake an HTTPS page and impersonate an authenticated user to access an HTTPS server. These vulnerabilities reflect the neglects in the design of modern browsers – they affect multiple major browsers and a large number of websites. We believe that the PBP adversary has not been rigorously examined in the browser/web industry. The vendors of the affected browsers have all confirmed the vulnerabilities reported in this paper. Most of them have patched or planned on patching their browsers. We believe the attack scenarios described in this paper may only be a subset of the vulnerabilities under PBP. Thus further (and more rigorous) evaluations of the HTTPS deployments in browsers appear to be necessary.
IMASC - An Intelligent MultiAgent System for Clinical Decision Support
Authors: Gabriela Czibula, Istvan Gergely Czibula, Grigoreta Sofia Cojocar, Adriana Mihaela Guran
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

Clinical decision support systems form a significant part of the field of clinical knowledge management technologies, being interactive computer programs, which are designed to assist physicians and other health professionals with decision making tasks. Nowadays, agent oriented techniques are important new means in analyzing, designing and building complex software systems. We propose in this paper an intelligent multiagent system, named IMASC, for assisting physicians in their decision making tasks. We have implemented the proposed system for assisting physicians in diagnosing the heart disease. The performance of our system and comparisons with other similar approaches are also reported.