ppxscal/embedding_network huggingface dataset:
Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems
Authors: Jiahai Wang, Zhanghui Kuang, Xinshun Xu, Yalan Zhou
Venue: Expert Systems with Applications: An International Journal (2009)

The polygonal approximation is an important topic in the area of pattern recognition, computer graphics and computer vision. This paper presents a novel discrete particle swarm optimization algorithm based on estimation of distribution (DPSO-EDA), for two types of polygonal approximation problems. Estimation of distribution algorithms sample new solutions from a probability model which characterizes the distribution of promising solutions in the search space at each generation. The DPSO-EDA incorporates the global statistical information collected from local best solution of all particles into the particle swarm optimization and therefore each particle has comprehensive learning and search ability. Further, constraint handling methods based on the split-and-merge local search is introduced to satisfy the constraints of the two types of problems. Simulation results on several benchmark problems show that the DPSO-EDA is better than previous methods such as genetic algorithm, tabu search, particle swarm optimization, and ant colony optimization.
Using Dempster-Shafer Evidence Theory and Choquet Integral for Image Segmentation in Gas-Liquid Two-Phase Flow
Authors: Shihong Yue, Jin Wang, Beibei Li, Huaxiang Wang
Venue: International Journal of Distributed Sensor Networks (2009)

Data fusion technique, essentially the Dempster-Shafer evidence theory, has widely been applied in image processing and significantly improving the image segmentation quality. The mass function determination in Dempster-Shafer evidence theory plays a crucial role in data fusion process. The purpose of this paper is to propose a method of automatically determining mass functions by Choquet integral and its identification algorithm. Different from the existing versions of determining the mass function values, the obtained mass function values in fact are the fuzzy measures in Choquet integral, which can be globally and accurately determined by the parameter identification algorithm of Choquet integral. Thus our proposed method is a very general and accurate one to handle the ambiguity connected with pixel classification in image segmentation, reducing the subjectivity of the existing methods. Results on real images from the two-phase flow are presented in order to verify the usefulness of our proposed method. Within this framework, we essentially investigate the possibility of determining mass functions using the concept of fuzzy clustering algorithm and the fuzzy measure in Choquet integral. Besides, in the calculation of mass functions, we have also introduced fuzzy measure information in order to fully utilize a feasible and efficient determination method that has widely succeeded in the Choquet integral application. The obtained results show the efficient and robust characters of our proposed method. The comparison research has also illustrated that the performances in image segmentation were significantly improved when using several images representing the same object. We have presented a data fusion approach to two-phase flow image segmentation based on the Dempster-Shafer evidence theory and Choquet integral tool. The electrical CT (Computed Tomography) techniques applied in the two-phase flow measurement have been becoming more and more popular, and ECT (Electrical Capacitance Tomography) and ERT (Electrical Resistivity Tomography) both are the most useful CT techniques. Comparing the real images with the reconstructed images in our experiments the fused image based on our proposed method clearly provides a better approximation than the singleton of ECT or ERT. The experimental results show that the Choquet integral tool helps improve the image segmentation quality of flow regimes greatly.
Microwave large-signal PHEMT model for SPICE-based simulators
Authors: J. M. Zamanillo, H. Ingelmo, B. Cobo, C. Perez-Vega, A. Mediavilla
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

A comprehensive large-signal HEMT model that provides a realistic description of measured characteristics over all operating regions for different PHEMTs is presented. The model was previously tested in harmonic-balance based simulators [1] and for the first time it has been implemented inside the time domain SPICE simulator. In order to do that, a new set of routines and libraries has been developed. The procedure introduced here can be extended to model other kind of devices described in terms of equivalent circuit. DC and scattering simulation results show very good agreement with the experimental measurements.
Metadata and Semantics, 1st edition
Authors: Miguel-Angel Sicilia, Miltiadis D. Lytras
Venue:  (2008)

Metadata and Semantics is an edited volume based on the 2007 Conference on Metadata and Semantics Research (MTSR), now in its second meeting. Metadata research is a pluri-disciplinary field that encompasses all aspects of the definition, creation, assessment, management and use of metadata. This edited volume brings together world class leaders to contribute their research and up-to-date information on metadata and semantics applied to library management, e-commerce, e-business, information science and librarianship, to name a few. Metadata and Semantics is designed for a professional audience composed of researchers and practitioners in industry. This book is also suitable for advanced-level students in computer science, information systems and information science and librarianship.
Code decomposition and recomposition for enhancing embedded software performance
Authors: Youngchul Cho, Kiyoung Choi
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Multitasking of concurrent processes implements the concurrency inherited from applications, increasing the utilization of limited resources. It requires an operating system and imposes significant runtime overhead. Serializing multitasking codes removes the need of operating system and the overhead as well. In this paper, we propose a software synthesis method to transform multitasking codes into a single process code. For this, we decompose multitasking codes into a set of code fractions and then recompose the code fractions into a single process code, preserving the functionality of the original codes. We present two different techniques for the transformation - code partitioning and code covering - and propose a hybrid technique that combines the two techniques.
Real-valued feature indexing for music databases
Authors: Yu-lung Lo, Ling-yi Tsai
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The management of large collections of music data in a multimedia database has received much attention in the past few years. In the most of current works, the researchers extract the features, such as melodies, rhythms and chords, from the music data and develop indices that will help to retrieve the relevant music quickly. Several reports have pointed out that these features of music data can be transformed and represented in the forms of music feature strings or numeric values such that string indexing or numeric indexing is created, respectively, for music retrieval. For string indexing, there is only limited index structure (ex. suffix tree) suitable for music retrieval and it is lack of scalability. Moreover, for numeric indexing, there is only few research emphasized on this issue. The existing approaches all transform a specific length of music segments (features) into integers such that various numeric index structures can be applied (ex. R-tree, B-tree). In this approach, however, the length of query (query by example) is required to match the specific length of transformation of music data otherwise it will harm the efficiency of query processing. To address these problems, in this paper, we will present a real value transformation function for without specific length of music segment and for more flexible of query length. Our experimental results also show that the new approach outperforms existing index schemes.
When a data processing department inherits software
Authors: Joan R. Zak
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper discusses some of the problems that occur in dealing with inherited software and some of the basic procedures necessary to manage successfully a data processing department or group that is converting and/or maintaining software that has been imposed on them and that they neither designed nor implemented. A significant constraint is the impossibility of contacting the author(s) for guidance and help. The two situations described are very different, yet they share some problems. The first involves an engineering company with a relatively scientific, real-time application---the design of a security system for a nuclear power plant. The second is a real estate management company with fairly typical business applications. This paper does not hope to provide all the answers, but instead to help raise some of the questions that arise when dealing with inherited software.
Speaker Clustering Aided by Visual Dialogue Analysis
Authors: Shuang Zhang, Wei Hu, Tao Wang, Jia Liu, Yimin Zhang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Speaker clustering aims to automatically cluster speech segments for each speaker. By speaker clustering, we can discover main cast list from long videos and retrieve their relevant video clips for efficient browsing. In this paper, we propose a dialogue supervised speaker clustering method, which makes use of the visual dialogue analysis results to improve the performance of speaker clustering. Compared with the traditional approach based only on acoustic features, the dialogue supervised speaker clustering approach can get significant improvement on the clustering result for movie and TV series.
Parallelisation of the CFD Code of a CFD-NWP Coupled System for the Simulation of Atmospheric Flows over Complex Terrain
Authors: Fernando A. Castro, Castro M. Silva Santos, José M. Palma
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

The sequential simulation of atmospheric flows over complex terrain using Computational Fluid Dynamics tools (CFD) leads normally to very large time-consuming runs. With the present day processors only the power available using parallel computers is enough to produce a true prediction using CFD tools, i.e. running the code faster than the evolution of the real weather. In the present work, the parallelisation strategy used to produce the parallel version of the VENTOS® CFD code is shown. A sample of the results included in the present abstract is enough to show the code behaviour as a function of the number of sub-domains, both number and direction along which the domain splitting occurs, and their implications on both the iteration number and code parallel efficiency.
Genetic Block Matching Algorithm for Video Coding
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Genetic algorithms (GAs) recently have been successfully applied to perform block-based motion estimation. It is shown that the performance of the GA-based motion estimation algorithms nearly approaches that of the full search algorithm (FSA). However, the computational complexity of the existing GA-based algorithms is too high to be used in practice. In this paper, a lightweight genetic search algorithm (LGSA) is proposed. It can be seen from the simulation results that the performance of the proposed LGSA is not only as good as that of the FSA, but the computational complexity is also much lower than that of the FSA and the other existing genetic motion estimation algorithms. Keywords: genetic algorithm, motion estimation, full search algorithm, video coding 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
Measuring capacity bandwidth of targeted path segments
Authors: Khaled Harfoush, Azer Bestavros, John Byers
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Accurate measurement of network bandwidth is important for network management applications as well as flexible Internet applications and protocols which actively manage and dynamically adapt to changing utilization of network resources. Extensive work has focused on two approaches to measuring bandwidth: measuring it hop-by-hop, and measuring it end-to-end along a path. Unfortunately, best-practice techniques for the former are inefficient and techniques for the latter are only able to observe bottlenecks visible at end-to-end scope. In this paper, we develop end-to-end probing methods which can measure bottleneck capacity bandwidth along arbitrary, targeted subpaths of a path in the network, including subpaths shared by a set of flows. We evaluate our technique through ns simulations, then provide a comparative Internet performance evaluation against hop-by-hop and end-to-end techniques. We also describe a number of applications which we foresee as standing to benefit from solutions to this problem, ranging from network troubleshooting and capacity provisioning to optimizing the layout of application-level overlay networks, to optimized replica placement.
A Fast H.261 Software Codec for High Quality Videoconferencing on PCs
Authors: Alessandro Bellini, Marco Guarducci, Alberto Del Lungo, Fabio Gori, Roberto Grossi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We describe a new software system for video conferencing in standard H.261. Its main features are high quality picture transmission and low cost hardware as it runs on a standard personal computer equipped with a regular video capture card to get the picture frames in CIF format.
Plenary lecture II: challenges for wireless sensor networks deployment
Authors: Zoran S. Bojkovic, Bojan M. Bakmaz
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

In the recent years extensive research has opened challenging issues for wireless sensor networks (WSNs) deployment. Many of ad hoc networks are sensor networks designed to collect data and revert to a centre unit connected to the Internet or monitored. WSNs are formed by a large number of resource-constrained and inexpensive nodes, which has an impact on protocol design and network scalability. Sensor networks have enabled a range of applications where the objective is to observe an environment and collect information about the observed phenomena or events. This has lead to the emergence of a new generation sensor networks called sensor actuator networks. Sensors gather information about the physical world, while actuators make decisions and perform actions that affect the environment. To enable next-generation sensor actuator systems, new customizable architectures are needed. The collected information and sensor nodes must be localized in space to identify the location of an event. This positioning is accomplished using localization systems. They not only locate events, but can also be used as the base for routing, density control, tracing and a number of other protocols. Due to their key role in WSNs, localization systems can be a target of an attack. In order to be fully autonomous and self-capable, it is essential for the nodes to be aware of their environment, and will not be able to configure itself to respond to internal/external events. The first part of this lecture deals with sensor actuator networks and localization systems. We continue with self configurability, situation awareness, and information detection system. The next part treats the problem of wireless sensor network for distributed detection. Model proposal for wireless sensor network concludes the presentation.
Delusions of Intelligence: Enigma, Ultra, and the End of Secure Ciphers, 1 edition
Authors: R. A. Ratcliff
Venue:  (2008)

In 1974, the British government admitted that its WWII secret intelligence organization had read Germany's ciphers on a massive scale. The intelligence from these decrypts influenced the Atlantic, the Eastern Front and Normandy. Why did the Germans never realize the Allies had so thoroughly penetrated their communications? As German intelligence experts conducted numerous internal investigations that all certified their ciphers' security, the Allies continued to break more ciphers and plugged their own communication leaks. How were the Allies able to so thoroughly exploit Germany's secret messages? How did they keep their tremendous success a secret? What flaws in Germany's organization allowed this counterintelligence failure and how can today's organizations learn to avoid similar disasters? This book, the first comparative study of WWII SIGINT (Signals Intelligence), analyzes the characteristics that allowed the Allies SIGINT success and that fostered the German blindness to Enigma's compromise.
A parallel algorithm for the minimum flow problem in bipartite networks
Authors: Laura Ciupala, Eleonor Ciurea
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we develop a parallel implementation of the deficit scaling algorithm for minimum flow in bipartite networks. This algorithm performs a pull from an active node with a large deficit and with the smallest distance label from N1 at a time followed by pulls from several nodes in N2 in parallel. It runs in O(n12 log C log p) time using p = ⌈m/n1⌉ processors.
Application of Bloom's taxonomy in software engineering assessments
Authors: Nurul Naslia Khairuddin, Khairuddin Hashim
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Bloom's Taxonomy has been utilized in many fields of studies. It has also been used in computer science education but research on the application of Bloom's Taxonomy into software engineering curricula has not been done much. This paper outlines software engineering assessment using Bloom's Taxonomy. Sample questions are given and categorized according to the relevant Bloom's Taxonomy levels. This paper aims to assist software engineering teaching and learning; and improve the quality of software engineering education.
Technical Section: Circular, linear, and curvilinear vection in a large-screen virtual environment with floor projection
Authors: Laura C. Trutoiu, Betty J. Mohler, Jörg Schulte-Pelkum, Heinrich H. Bülthoff
Venue: Computers and Graphics (2009)

Vection is defined as the compelling sensation of illusory self-motion elicited by a moving sensory, usually visual, stimulus. This paper presents collected introspective data, user discomfort and perceived speed data for the experience of linear, circular, and curvilinear vection in a large-screen, immersive, virtual environment. As a first step we evaluated the effectiveness of a floor projection on the perception of vection for four trajectories: linear forward, linear backward, circular left, and circular right. The floor projection, which considerably extended the field of view, was found to significantly improve the introspective measures of linear, but not circular, vection experienced in a photo-realistic three-dimensional town. In a second study we investigated the differences between 12 different motion trajectories on the illusion of self-motion. In this study we found that linear translations to the left and right are perceived as the least convincing, while linear down is perceived as the most convincing of the linear trajectories. Second, we found that while linear forward vection is not perceived to be very convincing, curvilinear forward vection is reported to be as convincing as circular vection. In a third and final experiment we investigated the perceived speed for all different trajectories and acquired data based on simulator sickness questionnaires to compute a discomfort factor associated with each type of trajectory. Considering our experimental results, we offer suggestions for increasing the sense of self-motion in simulators and VE applications, specifically to increase the number of curvilinear trajectories (as opposed to linear ones) and, if possible, add floor projection in order to improve the illusory sense of self-motion.
PEDACTICE: Educational Multimedia in School - An Evaluation Study
Authors: Katja Van den Brink, Reinhold S. Jager, Sabine Tost
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The European project PEDACTICE is supported by the European Commission and aims at introducing educational multimedia into schools under consideration of lifelong learning. Within this project several evaluation studies are conducted. This paper argues for a form of evaluation which is based on the theoretical perspective of constructivism and instructional design. As an example, a questionnaire for evaluating educational multimedia from the teacher perspective is described.
Application of Ant Colony Optimization Algorithm to Multi-Join Query Optimization
Authors: Nana Li, Yujuan Liu, Yongfeng Dong, Junhua Gu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Multi-join query optimization (MJQO) is an important technique for designing and implementing database manage system. It is a crucial factor that affects the capability of database. This paper proposes a new algorithm to solve the problem of MJQO based on ant colony optimization (ACO). In this paper, details of the algorithm used to solve MJQO problem have been interpreted, including how to define heuristic information, how to implement local pheromone update and global pheromone update and how to design state transition rule. After repeated iteration, a reasonable solution is obtained. Compared with genetic algorithm, the simulation result indicates that ACO is more effective and efficient.
Multipartite Secret Sharing by Bivariate Interpolation
Authors: Tamir Tassa, Nira Dyn
Venue: Journal of Cryptology (2009)

Given a set of participants that is partitioned into distinct compartments, a multipartite access structure is an access structure that does not distinguish between participants belonging to the same compartment. We examine here three types of such access structures: two that were studied before, compartmented access structures and hierarchical threshold access structures, and a new type of compartmented access structures that we present herein. We design ideal perfect secret sharing schemes for these types of access structures that are based on bivariate interpolation. The secret sharing schemes for the two types of compartmented access structures are based on bivariate Lagrange interpolation with data on parallel lines. The secret sharing scheme for the hierarchical threshold access structures is based on bivariate Lagrange interpolation with data on lines in general position. The main novelty of this paper is the introduction of bivariate Lagrange interpolation and its potential power in designing schemes for multipartite settings, as different compartments may be associated with different lines or curves in the plane. In particular, we show that the introduction of a second dimension may create the same hierarchical effect as polynomial derivatives and Birkhoff interpolation were shown to do in Tassa (J. Cryptol. 20:237&#x2013;264,&#x00a0;2007).