ppxscal/embedding_network huggingface dataset:
Length-Lex Bounds Consistency for Knapsack Constraints
Authors: Yuri Malitsky, Meinolf Sellmann, Willem-Jan Hoeve
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

Recently, a new domain store for set-variables has been proposed which totally orders all values in the domain of a set-variable based on cardinality and lexicography. Traditionally, knapsack constraints have been studied with respect to the required and possible set domain representation. For this domain-store efficient filtering algorithms achieving relaxed and approximated consistency are known. In this work, we study the complexity of achieving length-lex and approximated length-lex bounds consistency. We show that these strengthened levels of consistency can still be achieved in (pseudo-)polynomial time. In addition, we devise heuristic algorithms that work efficiently in practice.
Remote Sensing of Aerosols over Penang Island from Satellite Measurements
Authors: C. K. Sim, H. S. Lim, C. J. Wong, M. Z. MatJafri, K. Abdullah
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Remotely sensed can be the only data source in rural and remote areas where no ground-based measurements are taken. This image is used to detect air pollution at regional level, in coarser resolution. Remotely sensed data can be used qualitatively to provide a regional view of pollutants and to help assess the impact of events such as biomass burning or dust transport from remote sources. In this study, we explored the relationship between particulate matters of size less than 10 micron (PM10) derived from the Landsat TM using regression technique. We was developed a new algorithm that can effectively estimate the spatial distribution of atmospheric aerosols and retrieve surface reflectance from remotely sensed imagery. The algorithm was developed base on the aerosol characteristics in the atmosphere and the algorithm is modified to accommodate the visible and thermal bands of Landsat TM5 image. We were obtained the atmospheric reflectance values by subtracting surface reflectance from the amount of reflectance measured from the satellite. The satellite recorded reflectance is the sum of the surface reflectance and atmospheric reflectance. The efficiency of the developed algorithm, in comparison to other forms of algorithm, will be investigated in this study. Based on the values of the correlation coefficient and root-mean-square deviation, the proposed algorithm is considered superior. The calibrated algorithm will be used to generate the air quality maps over Penang Island, Malaysia. The finding obtained by this study indicates that the Landsat TM data can be used to retrieved air quality information for remotely sensed data.
BTRON: THE Business-oriented Operating System
Authors: Ken Sakamura
Venue: IEEE Micro (1987)

Designed for use with office workstations with bitmapped displays, this operating system offers a uniform man-macine interface and data transportability.
The Realization-Independent Testing Based on the Black Box Fault Models
Authors: Eduardas Bareiša, Vacius Jusas, Kęstutis Motiejūnas, Rimantas Šeinauskas
Venue: Informatica (2005)

The design complexity of systems on a chip drives the need to reuse legacy or intellectual property cores, whose gate-level implementation details are unavailable. In this paper we consider the realization-independent testing and the impact of circuit realization on the fault coverage. We investigated two fault models (input-output pin pair fault and input-input-output pin triplet fault) that are used by test generation for circuits described at system description level. The test generation on the system-level model is preferable if the efforts and the duration of the test supplement activities are less than the efforts and the duration of the test generation on gate-level model. The test set for the black-box model is larger as compared to the test set for the particular realization of the circuit. However, large test sets for the black-box model can be compacted by analysis not only according to the stuck-at faults, but also according to various defects for the particular realization.
Whose Name Is It, Anyway? Decentralized Identity Systems on the Web
Authors: Daniel J. Weitzner
Venue: IEEE Internet Computing (2007)

A new form of personal identity is emerging on the Web. Decentralized identification protocols depart from traditional distributed authentication approaches developed for the Internet. What distinguishes this new approach is its use of URIs as the underlying identifier.
Applying incomplete preference linguistic relations to criteria for evaluating multimedia authoring system
Authors: Tien-Chin Wang, Ying-Hsiu Chen, Yu-Chen Chiang
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

MCMD problems with fuzzy preference information on alternatives are essential problems of the importance of weighting and ranking. Xu [14] proposed a method with incomplete linguistic preference relations method that decision makers obtain a matrix by choosing a finite and fixed set of alternatives and performing a pairwise comparison based on their different preference and knowledge. The object of this paper is to apply the incomplete linguistic preference relations to a selection of multimedia authoring systems (MAS) on the case studies in [4] by Lai et al. The outcome obtained by incomplete linguistic preference relations almost coincides with that produced by the AHP method, also with the least judgments.
A WSN Coalition Formation Algorithm Based on Ant Colony with Dual-Negative Feedback
Authors: Na Xia, Jianguo Jiang, Meibin Qi, Chunhua Yu, Yue Huang, Qi Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In large-scale, complicated Wireless Sensor Networks, the cooperation among sensor nodes is a key topic, and has been receiving more and more attention. The dynamic coalition mechanism in Multi-Agent System is an important method for this topic, and then an energy-efficient coalition formation algorithm is needed since the energy resource of WSN is restricted. This paper proposes a WSN coalition formation algorithm based on Ant Colony System with dual-negative feedback characteristic. Coalition sponsor inclines to wake those sensor nodes which seldom or never joined coalitions before to form coalition, which can balance the energy consumption among sensor nodes, so as to extend the network lifetime for more tasks. The results of simulation experiment show the validity of this algorithm.
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
Authors: Bodo Manthey, Till Tantau
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. We analyze their smoothed height under additive uniform noise: An adversary chooses a sequence of n real numbers in the range [0,1], each number is individually perturbed by adding a value drawn uniformly at random from an interval of size d, and the resulting numbers are inserted into a search tree. An analysis of the smoothed tree height subject to n and d lies at the heart of our paper: We prove that the smoothed height of binary search trees is $\Theta (\sqrt{n/d} + \log n)$, where d ¿ 1/n may depend on n. Our analysis starts with the simpler problem of determining the smoothed number of left-to-right maxima in a sequence. We establish matching bounds, namely once more $\Theta (\sqrt{n/d} + \log n)$. We also apply our findings to the performance of the quicksort algorithm and prove that the smoothed number of comparisons made by quicksort is $\Theta(\frac{n}{d+1} \sqrt{n/d} + n \log n)$.
Adaptive Distributed Channel Assignment in Wireless Mesh Networks
Authors: Chien-Min Wu, Yi-Yuan Wang
Venue: Wireless Personal Communications: An International Journal (2008)

From the channel assignment schemes in time division multiple access (TDMA) slot assignment protocols developed in previous studies, we have found that these protocols do not have a convenient frame length reduction scheme after the expansion of the frame length. As the network size grows, the frame length expands rapidly, particularly when we set it as a power of two. A very long frame may result in poor channel utilization when it contains many unused slots. In this paper, we consider a wireless mesh network with a TDMA structure. We divide each code into time slots to form the channels. We propose a dynamic frame length expansion and recovery method termed adaptive distributed channel assignment (ADCA). This strategy is designed to enhance the utilization of the available channels by taking advantage of the spatial reuse concept. In ADCA, an increase in spatial reuse is achieved by adding a certain amount of control overhead. We show that the bandwidth saved due to the channel spatial reuse is larger than the additional bandwidth spent on the control overhead.
Towards a Flexible and Distributed Simulation Platform
Authors: Philippe Cerfontaine, Thomas Beer, Torsten Kuhlen, Christian Bischof
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

This work is focused on bringing forth integrated simulation as a means to understand complex processes more thoroughly. Production processes that arise in the field of engineering sciences usually require expertise and knowledge from various fields and areas to be fully understood. These processes typically range across different domains, like material science and manufacturing for instance, while they also share various technical and economic aspects. Simulation already plays an important part in conceiving such processes and its role is likely to increase in the future. As simulation technology progresses and calculations provide more accurate predictions of real phenomena, the need for more and more intuitive ways to analyze and represent the resulting information also increases. In the context of continuous process chains it is important to focus on the links between the distinct processing stages, and to demonstrate the influence and interdependencies between them. Virtual Reality (VR) provides the necessary means and technology to visualize and understand the complete process.
A Type-2 Fuzzy Set Recognition Algorithm for Artificial Immune Systems
Authors: Andrea Visconti, Hooman Tahayori
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

In this paper, we suggest a flexible type-2 fuzzy set algorithm for analysing anomalous behavior trends of some system parameters. This algorithm can be implemented in a performance-based Artificial Immune System (AIS) and used as anomalous behavior recognition engine for a biological-inspired Intrusion Detection System (IDS). The suggested algorithm is based on the idea that real-world applications have the necessity of providing a strong, reliable discrimination between normal and abnormal behaviors but such discrimination is not always well-defined. This fact introduces many degrees of uncertainties in rule-based systems and convinced us to implement a type-2 fuzzy set algorithm that can easily manipulate and minimize the effect of uncertainties in our system.
Synthesising Novel Movements through Latent Space Modulation of Scalable Control Policies
Authors: Sebastian Bitzer, Ioannis Havoutis, Sethu Vijayakumar
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

We propose a novel methodology for learning and synthesising whole classes of high dimensional movements from a limited set of demonstrated examples that satisfy some underlying 'latent' low dimensional task constraints. We employ non-linear dimensionality reduction to extract a canonical latent space that captures some of the essential topology of the unobserved task space. In this latent space, we identify suitable parametrisation of movements with control policies such that they are easily modulated to generate novel movements from the same class and are robust to perturbations. We evaluate our method on controlled simulation experiments with simple robots (reaching and periodic movement tasks) as well as on a data set of very high-dimensional human (punching) movements. We verify that we can generate a continuum of new movements from the demonstrated class from only a few examples in both robotic and human data.
Designing the simulative evaluation of an architecture for supporting QoS on a large scale
Authors: H. Tarasiuk, J. Mongay Batalla, R. Janowski, W. Burakowski, G. Stea, C. Cicconetti, J. Sá Silva, G. García-de Blas, F. J. Ramón Salguero
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

The EuQoS system is a complete QoS system, scalable to large dimensions and addressing QoS at all relevant layers, which has been developed within the framework of the IST-EuQoS project. Its design has been aided by a considerable amount of modeling and simulation work, aimed at testing the various QoS mechanisms devised and their interaction. This paper describes the modeling and simulation work done in the framework of the project. We describe the three simulation models which have been developed, based on the different timescales at which the QoS mechanisms have effect. Furthermore, as a sample case of performance evaluation, involving different simulators, we describe the performance evaluation of the EuQoS signaling subsystem.
An Improved Median Filtering System and Its Application of Calcified Lesions' Detection in Digital Mammograms
Authors: Kun Wang, Yuejian Xie, Sanli Li, Yunpeng Chai
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Median filtering is an important approach in digital image processing for noise elimination or extraction. The time cost and detection quality of the filtering system are two convention measures, depending on the sliding window size. In this paper, an improved median filter, Adaptive Sliding Window --- Simultaneous Deleting and Inserting (ASW-SDI) system, is proposed for calcified lesions' detection in digital mammograms, increasing the quality of detection and also reducing the time cost. It changes the size of sliding windows adaptively and uses the same pixels in two neighboring windows, deleting and inserting a line of pixels in a single array traverse. It is especially appropriate for images with a small quantity of large noises and a mass of salt pepper noises. In the breast cancer computer-aided diagnosis experiments, ASW-SDI works efficiently in calcified lesion extraction.
Semi---Boolean and Hyper---Archimedean BL---Algebras
Authors: Esko Turunen
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

We analyze differences between BL---algebras and MV---algebras. The study has application in mathematical fuzzy logic as the Lindenbaum algebras of Lukasiewicz logic or Hájek's BL---logics are MV---algebras or BL---algebras, respectively. We focus on possible generalizations of Boolean elements of a general BL---algebra L; we prove that an element x ¿ L is Boolean iff x ¿ x ¿ = 1. L is called semi---Boolean if, for all x ¿ L, x ¿ is Boolean. We prove that an MV---algebra L is semi---Boolean iff L is a Boolean algebra. A BL---algebra L is semi---Boolean iff L is a SBL---algebra. A BL---algebra L is called hyper---Archimedean if, for all x ¿ L, there is an n ¿ 1 such that x n is Boolean. We prove that hyper---Archimedean BL---algebras are MV---algebras. We discuss briefly the applications of our results in mathematical fuzzy logic.
An Experimental Study of Anticipation in Simple Robot Navigation
Authors: Birger Johansson, Christian Balkenius
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

This paper presents an experimental study using two robots. In the experiment, the robots navigated through an area with or without obstacles and had the goal to shift places with each other. Four different approaches (random, reactive, planning, anticipation) were used during the experiment and the times to accomplish the task were compared. The results indicate that the ability to anticipate the behavior of the other robot can be advantageous. However, the results also clearly show that anticipatory and planned behavior are not always better than a purely reactive strategy.
Robust Color Classification Using Fuzzy Rule-Based Particle Swarm Optimization
Authors: Alireza Kashanipour, Narges Shamshiri Milani, Amir Reza Kashanipour, Hadi Haji Eghrary
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

In this paper we present a novel approach for color classification in which an evolutionary algorithm optimizes a fuzzy system with least number of rules and minimum error rate by meaning of Particle Swarm Optimization (PSO) method. The aim of this work is to retrieve images according to their dominant(s) color(s) expressed through linguistic expressions, and implementation through a vision system. Fuzzy sets are defined on the H, S and L components of the HSL Color Space to provide a fuzzy logic model which aims to follow the human intuition of Color Classification. The Final system designed by this method is adaptive to continuous variable lighting according to its evolving-fuzzy nature, which is one of the challenging applications in this field.
Image retrieval model based on weighted visual features determined by relevance feedback
Authors: Woo-Cheol Kim, Ji-Young Song, Seung-Woo Kim, Sanghyun Park
Venue: Information Sciences: an International Journal (2008)

An accurate and rapid method is required to retrieve the overwhelming majority of digital images. To date, image retrieval methods include content-based retrieval and keyword-based retrieval, the former utilizing visual features such as color and brightness, and the latter utilizing keywords that describe the image. However, the effectiveness of these methods in providing the exact images the user wants has been under scrutiny. Hence, many researchers have been working on relevance feedback, a process in which responses from the user are given as feedback during the retrieval session in order to define a user's need and provide an improved result. Methods that employ relevance feedback, however, do have drawbacks because several pieces of feedback are necessary to produce an appropriate result, and the feedback information cannot be reused. In this paper, a novel retrieval model is proposed, which annotates an image with keywords and modifies the confidence level of the keywords in response to the user's feedback. In the proposed model, not only the images that have been given feedback, but also other images with visual features similar to the features used to distinguish the positive images are subjected to confidence modification. This allows for modification of a large number of images with relatively little feedback, ultimately leading to faster and more accurate retrieval results. An experiment was performed to verify the effectiveness of the proposed model, and the result demonstrated a rapid increase in recall and precision using the same amount of feedback.
Smoothing a Network of Planar Polygonal Lines Obtained with Vectorization
Authors: Alexander Gribov, Eugene Bodansky
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

A new method of smoothing polygonal lines obtained as the result of vectorization and creating the network is suggested. This method performs not only smoothing but also filtering of vectorization errors taking into account that these errors appear not only as the errors of vertices but as errors of node coordinates as well. An important part of this algorithm is a technique of building piecewise polynomial base functions for local approximation of the polylines of the network. The suggested algorithm has a linear computational complexity for exponential weight functions. The necessity of using finite weight functions is shown. Algorithms of calculating tangents and curvatures are derived. Shrinking errors and errors of parameters are analyzed. A method of compensation of the shrinking errors is suggested and how to do smoothing with variable intensity is shown.
Algorithm for PM2.5 Mapping over Penang Island, Malaysia, Using SPOT Satellite Data
Authors: H. S. Lim, M. Z. MatJafri, K. Abdullah, A. N. Alias, J. M. Rajab, N. Mohd. Saleh
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Air pollution is an important issue being monitored and regulated in industrial and developing cities. In this study, we explored the relationship between particulate matters of size less than 2.5 micron (PM2.5) derived from the SPOT using regression technique. The aim of this study was to evaluate the high spatial resolution satellite data for air quality mapping by using FLAASH software. The corresponding PM2.5 data were measured simultaneously with the acquired satellite scene and their locations were determined using a handheld Global Positioning System (GPS). Due to the fact that the current commercial aerosol retrieval method (FLAASH) was designed to work reasonably well over land, but is not accurate for water applications, adjustments had to be made to the software to optimize it for reflectance retrieval over water. In-situ reflectance spectra will be plot against spectra derived from the atmospherically corrected images. In this study, we ensure that all the atmospherically corrected spectra match reasonably with the in-situ spectra. We have developed a new algorithm that can effectively estimate the spatial distribution of atmospheric aerosols and retrieve surface reflectance from remotely sensed imagery under general atmospheric and surface conditions. The algorithm was developed base on the aerosol characteristics in the atmosphere. The efficiency of the developed algorithm, in comparison to other forms of algorithm, will be investigated in this study. Results indicate that there is a good correlation between the satellites derived PM2.5 and the measured PM2.5. This study shows the potential of using the thermal infrared data for air quality mapping. The finding obtained by this study indicates that the FLAASH can be used to retrieve air quality information for remotely sensed data.
Radio frequency convergence protocol for 4G networks
Authors: Rosli Salleh, Xichun Li, Lina Yang, Zhiyuan Li
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

CDMA Develop Group (CDG) has issued WLAN-CDMA convergence architecture for 4G Networks, which complement each other to provide ubiquitous highs-peed wireless internet connectivity to mobile users. In the merging networks, WLANs frequency is much wider than cellular network, the internet characteristics in frequency utilization that relates to request amounts to one fourth of its reply. This paper considers the disparity of both frequency and utilization, we combine the disparity frequency through developing a new protocol so that wireless mobile internet can be supply as same quality as fixed internet by 4G wireless mobile networks.