ppxscal/embedding_network huggingface dataset:
Aircraft Target Recognition Based on Recursive Inference of Fuzzy Discrete DBNs
Authors: Huange Wang, Xiaoguang Gao, Chris P. Thompson
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Nowadays dynamic Bayesian network (DBN) has been well known for its marvelous capabilities in modeling and analyzing a wide range of sequential systems. The notable advantage of DBN lies in it provides a good solution to the inference problems caused by uncertainty and complexity. Usually the main reason for uncertainty is randomicity; however, sometimes it could also be caused by vagueness. Since fuzzy logic is an effective tool to solve the latter problem, this paper presents the idea of merging fuzzy classification with discrete DBN, which improves the representing as well as reasoning abilities of discrete DBN and enables it to deal with the inference problems concerning continuous observational data. Finally, the validity of fuzzy discrete DBNs combined with a recursive inference algorithm has been demonstrated by an aircraft target recognition example.
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Authors: Asaf Efrima, David Peleg
Venue: Theoretical Computer Science (2009)

A number of recent studies address systems of mobile autonomous robots from a distributed computing point of view. Although such systems employ robots that are relatively weak and simple (i.e., dimensionless, oblivious and anonymous), they are nevertheless expected to have strong fault tolerance capabilities as a group. This paper studies the partitioning problem, where n robots must divide themselves into k size-balanced groups, and examines the impact of common orientation on the solvability of this problem. First, deterministic crash-fault-tolerant algorithms are given for the problem in the asynchronous full-compass and semi-synchronous half-compass models, and a randomized algorithm is given for the semi-synchronous no-compass model. Next, the role of common orientation shared by the robots is examined. Necessary and sufficient conditions for the partitioning problem to be solvable are given in the different timing models. Finally, the problem is proved to be unsolvable in the no-compass synchronous model.
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
Authors: Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

In symmetric secure function evaluation (SSFE), Alice has an input x, Bob has an input y, and both parties wish to securely compute f(x,y). We show several new results classifying the feasibility of securely implementing these functions in several security settings. Namely, we give new alternate characterizations of the functions that have (statistically) secure protocols against passive and active (standalone), computationally unbounded adversaries. We also show a strict, infinite hierarchy of complexity for SSFE functions with respect to universally composable security against unbounded adversaries. That is, there exists a sequence of functions f 1, f 2, ... such that there exists a UC-secure protocol for f i in the f j -hybrid world if and only if i ≤ j.The main new technical tool that unifies our unrealizability results is a powerful protocol simulation theorem, which may be of independent interest. Essentially, in any adversarial setting (UC, standalone, or passive), f is securely realizable if and only if a very simple (deterministic) "canonical" protocol for f achieves the desired security. Thus, to show that f is unrealizable, one need simply demonstrate a single attack on a single simple protocol.
FPGA Based Design and Applications, 1 edition
Authors: Arifur Rahman
Venue:  (2008)

FPGA Based Design and Applications presents recent advances in field programmable gate array (FPGA) technologies, focusing primarily on applications, design methodology, and technology evolution. This book serves as a reference for FPGA based design and applications in networking and communication, digital signal processing, high-performance computation, and reconfigurable computing. Materials presented here are based on the most recent advances in FPGA technologies and system-level design tools. Leading researchers and industry experts provide insights into the capabilities of state-of-the-art FPGAs and technology trends. FPGAs are at the forefront of technology innovation. An effective implementation of FPGA based design requires a thorough understanding of technological capabilities, design tools, and application requirements. This book provides a unified treatment of these topics for FPGA-centric design. The FPGA architecture, its use model, and its application have transformed drastically over the last 10-15 years. FPGAs are no longer uses as simple glue logic. They are being deployed as system building components in applications such as digital signal processing, networking and communications, embedded designs, etc. Since end users of FPGAs are primarily interested in their use models, applications, and design infrastructure, a book focusing on these areas is highly useful.
Empirical Research of the Relationship between Characteristics of Supervisory Board and Earnings Quality
Authors: Bin Xia, Cang Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In recent years, financial statement fraud of listed companies is a deleterious cancer of security market, the quality of accounting information has become focus of the whole society. Based on the empirical analysis of the annual report of China's 160 listed companies in 2006, this paper makes an empirical study on the relationship of characteristics of supervisory board and earnings quality. The results indicate that there is no significant correlation between characteristics of supervisory board and earnings quality, as the independent supervisory organ in company's administration structure of our country, the board of supervisor has defects on system design and which has not played its due role in practice. We believe that, to some extent, it is the advantageous status of the management that has put supervisory board at a disadvantage. With the rise of professional managers and the expansion and growth of institutional investors, however, the “disadvantageous status” of supervisory board will be greatly improved. Therefore, during the course of improvement of the market economy in china, supervisor board system must be improved for a real effective supervision.
Double patterning layout decomposition for simultaneous conflict and stitch minimization
Authors: Kun Yuan, Jae-Seok Yang, David Pan
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

Double patterning lithography (DPL) is considered as a most likely solution for 32nm/22nm technology. In DPL, the layout patterns are decomposed into two masks (colors). Two features (polygons) have to be assigned opposite colors if their spacing is less than certain minimum coloring distance. However, a proper coloring is not always feasible because two neighboring patterns within the minimum distance may be in the same mask due to complex pattern configurations. In that case, a feature may be split into two parts to resolve the conflict but the resulting stitch causes yield loss due to overlay error and increases manufacturing cost. While previous layout decomposition approaches perform coloring and splitting separately, in this paper, we propose an algorithm to minimize the number of conflicts and stitches simultaneously. Our algorithm is based on grid layout model and integer linear programming. Two techniques, independent component computation and layout partition, are proposed to reduce runtime of the algorithm. The experimental results show that, compared with the two phase decomposition flow, the proposed algorithm reduces the conflicts significantly using less stitches under reasonable runtime.
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
Authors: Vladimir P. Korzhik, Bojan Mohar
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by no more than one other edge. A non-1-planar graph G is minimal if the graph G e is 1-planar for every edge e of G. We construct two infinite families of minimal non-1-planar graphs and show that for every integer n e 63, there are at least $2^{\frac{n}{4}-\frac{54}{4}}$ non-isomorphic minimal non-1-planar graphs of order n. It is also proved that testing 1-planarity is NP-complete. As an interesting consequence we obtain a new, geometric proof of NP-completeness of the crossing number problem, even when restricted to cubic graphs. This resolves a question of Hlinn&yacute;.
A JOVIAL programming support environment
Authors: Edith M. McMahon
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

Programming support environments are developed to provide facilities to be used in addition to, or in absence of, host operating systems. This paper describes a system that incorporates Stoneman principles and provides a transportable Programming Support Environment for the Air Force standard language JOVIAL. The tools provided by this Jovial Programming Support Environment facilitate both software management and development throughout the life cycle.
103-configurations and projective realizability of multiplied configurations
Authors: Krzysztof Petelczyc, MaBgorzata Prażmowska
Venue: Designs, Codes and Cryptography (2009)

Some remarks on 103-configurations which contain the complete graph K 4 are given, on their representations, and on projective realizability. Results are applied to show a class of configurations that cannot be realized in any Pappian projective space.
Extracting hidden image using histogram, DFT and SVM
Authors: T. H. Manjula Devi, Pooja P. Shenoy, Swathi Saigali, Harsha Mathew, K. B. Raja, K. R. Venugopal, L. M. Patnaik
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

In covert communication, Information hiding is rapidly gaining momentum. There are many sophisticated techniques being developed in steganography. There is a need of universal method to detect hidden image. We have proposed a Universal method to detect hidden message using Histogram, Discrete Fourier Transform and SVM (UDHDS). When compared to cover image stego image has irregular statistical characteristics. one class SVM is trained by these statistical features which are generated Using Histogram and DFT to discriminate the cover and stego image. The number of statistical features is less in UDHDS Algorithm when compared to the existing algorithm and found to be more efficient.
A New Algorithm for 3D Reconstruction from Support Functions
Authors: Richard j. Gardner, Markus Kiderlen
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We introduce a new algorithm for reconstructing an unknown shape from a finite number of noisy measurements of its support function. The algorithm, based on a least squares procedure, is very easy to program in standard software such as Matlab, and it works for both 2D and 3D reconstructions (in fact, in principle, in any dimension). Reconstructions may be obtained without any pre- or post-processing steps and with no restriction on the sets of measurement directions except their number, a limitation dictated only by computing time. An algorithm due to Prince and Willsky was implemented earlier for 2D reconstructions, and we compare the performance of their algorithm and ours. But our algorithm is the first that works for 3D reconstructions with the freedom stated in the previous paragraph. Moreover, under mild conditions, theory guarantees that outputs of the new algorithm will converge to the input shape as the number of measurements increases. In addition we offer a linear program version of the new algorithm that is much faster and better, or at least comparable, in performance at low levels of noise and reasonably small numbers of measurements. Another modification of the algorithm, suitable for use in a "focus of attention" scheme, is also described.
The Politics of Judgment: Aesthetics, Identity, and Political Theory
Authors: Kennan Ferguson
Venue:  (2007)

Drawing on recent contributions to philosophy, economics, cultural studies, feminism, psychology, and anthropology, The Politics of Judgment demonstrates how modern political identities depend upon and are formed by aesthetic judgment.
An Adaptive and Efficient Selective Multiple Reference Frames Motion Estimation for H.264 Video Coding
Authors: Yu-Ming Lee, Yong-Fu Wang, Jia-Ren Wang, Yinyi Lin
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In the popular video coding standard H.264/AVC, many advanced techniques are employed. One important technique is the use of multiple reference frames motion estimation. However, the computational load increases with the number of references frames. In this paper, we suggest a selective multiple reference frames motion estimation (SMRFME) architecture which takes use of the information of the 1st reference frame to determine whether it is necessary to search remaining reference frames. In addition, three early termination schemes are applied to the remaining reference frames of the candidate modes. The simulation results demonstrate that the proposed algorithm can achieve up to 77% of time saving compared to the multiple reference frames full search algorithm, while maintaining a high coding performance.
Letters: Adaptive neural control for a class of output feedback time delay nonlinear systems
Authors: Qing Zhu, Tianping Zhang, Shumin Fei, Kanjian Zhang, Tao Li
Venue: Neurocomputing (2009)

An output feedback control scheme combined with backstepping, radial basis function (RBF) neural networks, and adaptive control is proposed for the stabilization of nonlinear system with input delay and disturbances. A filter and a virtual observer are constructed to substitute the immeasurable system state. By using state transformation, the original system is converted to the system without input delay. Neural networks are employed to estimate the unknown continuous functions. The control scheme ensures that the closed-loop system is semi-globally uniformly ultimately bounded (SGUUB).
Intelligent Content Filtering Model for Network Security Audit System
Authors: Junliang Zhang, Dingyi Fang, Li LIiu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper presents a model of intelligent content filtering model to resolve the current network security audit system in filtering the information deficiency. First of all, in accordance with the characteristics of network security audit system, as well as the advantages and disadvantages of content filtering methods commonly, this paper choose suitable filter method, and then, optimize the filter method on the model used in order to effectively reduce the algorithm complexity, and improve Algorithm performance.
Dynamic population variation in genetic programming
Authors: Peyman Kouchakpour, Anthony Zaknich, Thomas Bräunl
Venue: Information Sciences: an International Journal (2009)

Three innovations are proposed for dynamically varying the population size during the run of the genetic programming (GP) system. These are related to what is called Dynamic Population Variation (DPV), where the size of the population is dynamically varied using a heuristic feedback mechanism during the execution of the GP with the aim of reducing the computational effort compared with Standard Genetic Programming (SGP). Firstly, previously developed population variation pivot functions are controlled by four newly proposed characteristic measures. Secondly, a new gradient based pivot function is added to this dynamic population variation method in conjunction with the four proposed measures. Thirdly, a formula for population variations that is independent of special constants is introduced and evaluated. The efficacy of these innovations is examined using a comprehensive range of standard representative problems. It is shown that the new ideas do have the capacity to provide solutions at a lower computational cost compared with standard genetic programming and previously reported algorithms such as the plague operator and the static population variation schemes previously introduced by the authors.
Investigation of luminescence properties of ZnO nanowires at room temperature
Authors: He Yong-ning, Shang Shi-guang, Cui Wuyuan, Li Xin, Zhu Chang-chun, Hou Xun
Venue: Microelectronics Journal (2009)

The controllable growth processes of ZnO nanowires by evaporation of metal zinc with high purity and its luminescence properties have been investigated in detail. Firstly, the power of ZnO nanowires with high yield and homogeneous dimension was synthesized using the special quartz boat at 600°C. Then, the oriented ZnO nanowires with about 20nm diameter were synthesized by using a 90nm-thick layer of ZnO nanocrystals on the Si substrate as the seed layer. Both fabrication processes are repeatable and no catalysts are necessary. Finally, photoluminescence (PL) spectroscopy for ZnO nanowires using an He-Cd laser line of 325nm as the excitation source were measured at room temperature and both samples showed a sharp strong ultraviolet (UV) near-band edge emission. However, different UV peak positions (385nm for ZnO nanowire powder, 377nm for ZnO nanowire array) can be observed. The size confinement effect for excitons and carriers is proposed to explain the blue shift of the near-band edge emission with decreasing size and the native defects are responsible for the green emission.
Integrated SIP and HCoP-B architecture for nested network mobility
Authors: Ing-Chau Chang, Yang-Yu Chang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

As the mobility management protocol evolves from supporting a single mobile node into a mobile network, it is more and more important to build a fully-integrated environment to provide efficient mobility management for the nested mobile network. In this paper, we propose a SIP+HCoP-B architecture, which has the following merits as compared to traditional SIP over NBS and SIP over HCoP-B architectures. First, it reduces network deployment costs by only equipping an integrated SIP mobile server, instead of both SIP home registrar and Mobile IP home agent, for each mobile router. Second, it achieves the smallest signaling overhead and the shortest session initialization and handoff latencies. Finally, it provides detailed flows for supporting both SIP-based and non-SIP-based applications, which is rare in the literature.
The Integrated Multimedia Project
Authors: Hannu Flinck, Juha Saarnio, Angela Scheller
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The Integrated Multimedia Project (IMMP) studies interactive multimedia services and network technologies addressing both residential and business users, focusing on the overlaps and synergy between the two. For this purpose, IMMP has set up and conducted a considerable number of trials with varying user profiles, network technologies, middleware components and applications. The trial net-work utilises multiple existing access networks such as Cable-TV and ISDN and connects to European ATM networks through the National Hosts. The IMMP consortium covers the complete interactive multimedia value chain by including network operators, service providers, equipment vendors, application developers and content providers. This paper presents project results with regard to market potentials of interactive multimedia services, evaluation of different middleware technologies and end user feedback on the applications developed by IMMP.
Fuzzy aesthetic semantics description and extraction for art image retrieval
Authors: Qingyong Li, Siwei Luo, Zhongzhi Shi
Venue: Computers Mathematics with Applications (2009)

More and more digitized art images are accumulated and expanded in our daily life and techniques are needed to be established on how to organize and retrieve them. Though content-based image retrieval (CBIR) made great progress, current low-level visual information based retrieval technology in CBIR does not allow users to search images by high-level semantics for art image retrieval. We propose a fuzzy approach to describe and to extract the fuzzy aesthetic semantic feature of art images. Aiming to deal with the subjectivity and vagueness of human aesthetic perception, we utilize the linguistic variable to describe the image aesthetic semantics, so it becomes possible to depict images in linguistic expression such as 'very action'. Furthermore, we apply neural network approach to model the process of human aesthetic perception and to extract the fuzzy aesthetic semantic feature vector. The art image retrieval system based on fuzzy aesthetic semantic feature makes users more naturally search desired images by linguistic expression. We report extensive empirical studies based on a 5000-image set, and experimental results demonstrate that the proposed approach achieves excellent performance in terms of retrieval accuracy.
Two-step generalised empirical likelihood inference for semiparametric models
Authors: Francesco Bravo
Venue: Journal of Multivariate Analysis (2009)

This paper shows how the generalised empirical likelihood method can be used to obtain valid asymptotic inference for the finite dimensional component of semiparametric models defined by a set of moment conditions. The results of the paper are illustrated using three well-known semiparametric regression models: partially linear single index, linear transformation with random censoring, and quantile regression with random censoring. Monte Carlo simulations suggest that some of the proposed test statistics have competitive finite sample properties. The results of the paper are applied to test for functional misspecification in a hedonic price model of a housing market.
Interval-valued fuzzy relation-based clustering with its application to performance evaluation
Authors: Yuh-Yuan Guh, Miin-Shen Yang, Rung-Wei Po, E. Stanley Lee
Venue: Computers Mathematics with Applications (2009)

A similarity relation with its partition tree has been applied in the performance evaluation area for obtaining an agglomerative hierarchical clustering. These fuzzy relation-based methods require a decision maker to perform pair-wise comparisons for the similarity among criteria as forming a fuzzy relation matrix. The approach is developed based on real membership values of fuzzy relations. However, interval-valued memberships may be better than real membership values to represent higher-order imprecision and vagueness for human perception. Thus, in this paper we would like to extend fuzzy relations to interval-valued fuzzy relations and then construct interval-valued similarity relations for performance evaluation. We first give some definitions for these interval-valued types of fuzzy relation, similarity relation and resolution form. We then construct an interval-valued fuzzy similarity relation into a hierarchical structure schema. It is shown that both of procedures and results for the partition tree derived from interval-valued and crisp-valued similarity relation matrices have some corresponding relationships and different merits. To demonstrate the usefulness of the proposed approach, performance evaluations for academic departments of higher education are considered by using actual engineering school data in Taiwan.