Showing papers in "Information Processing Letters in 2016"

TL;DR: The experiment results show that Flower Pollination Algorithm with Bee Pollinator has not only higher accuracy but also higher level of stability and the faster convergence speed can also be validated by statistical results.

TL;DR: The g-good-neighbor conditional diagnosability of the n-dimensional hypercube under the MM * model, a new measure for fault diagnosis of interconnection networks, is given.

TL;DR: The experiment shows that the proposed method is advantage in PSNR, capacity and universal image quality index (Q) than LSB-3 and Jae-Gil Yu's and 2 k correction is used to improve the visual effect of stego image.

TL;DR: A novel approach that can measure the correlation between a continuous and a discrete feature, and then an efficient filter feature selection algorithm based on correlation analysis by removing weakly relevant and irrelevant features, as well as relevant but redundant features are proposed.

TL;DR: An FPT algorithm is presented to the 3-PVCP with runtime O * ( 1.8172 s n O ( 1 ) ) on a graph with n vertices that constructs a 3-path vertex cover of size at most s in a given graph G, or reports that no such 3- path vertex cover exists in G.

TL;DR: The counter mode of operation is introduced to Compressed Sensing based encryption in order to achieve probabilistic encryption with security against chosen-plaintext attacks and addresses the case where multiple signals are encrypted under one master key.

TL;DR: A verifiable ( t, n ) threshold quantum secret sharing scheme is proposed by using the d-dimensional Bell state and the Lagrange interpolation and can give more perfect security proof.

TL;DR: A generalization of Araki's result on the existence of two completely independent spanning trees in a graph with large minimum degree is given and a balanced CIST-partition is obtained under the well-known Dirac's condition, which strengths AraKI's result.

TL;DR: In this article, a RAM algorithm was proposed to find all runs of a given string of length n over a general ordered alphabet in O( n log 2 3? n ) time and linear space.

TL;DR: A new solution representation for genetic algorithm to optimize the neural network model is presented and shows promising results when it is compared with other methods in the literature.

TL;DR: Another mechanism to improve CBF performance: the Fingerprint Counting Bloom Filter (FP-CBF), based on the use of fingerprints on the filter entries to reduce the false positive rate, which results in a simpler implementation than VI-CBFs in terms of number of hash functions and arithmetic operations.

TL;DR: Both necessary and sufficient conditions for richness in terms of run-length encodings of words are proved and a lower bound of order C n is proved on the growth function of the language of binary rich words.

TL;DR: A new data hiding scheme based on MSD (Modified Signed-Digit) is proposed to achieve secret message embedding into a cover image and the stego image quality is better than 52 ?

TL;DR: This work presents the first O ( m + n ) time algorithm to compute a WMIS directly on the given cocomparability graph, where m and n are the number of edges and vertices of the graph respectively.

TL;DR: Two perfect quantum teleportation schemes for an unknown single-particle pure state and an arbitrary two- particle pure entangled state are proposed by using four-particles cluster state in this paper.

TL;DR: In 2014, Brzozowski and Davies characterized the most complex regular languages using the so-called "atomaton" of a regular language as discussed by the authors, and gave an alternative proof of their characterization via a purely combinatorial approach.

TL;DR: A sublinear solution based on filtration for order-preserving matching, which is more efficient than earlier algorithms and has applications in analysis of time series.

TL;DR: In this paper, a parallel generator for Barabasi-Albert scalefree graphs is presented, which can be used to generate large scale-free Petaedge graphs in less than an hour.

TL;DR: A comparative study and qualitative evaluation demonstrate that the better quality results are obtained by using the proposed novel defogging parameter value selection algorithm based on genetic algorithm (GA).

TL;DR: A combined approach, which integrates LCI and GCI to extract and rank features based on feature score and frequency and shows that feature extraction can benefit from GCI.

TL;DR: A new pseudorandom bit generator based on this multi-delayed Chebyshev map is proposed; the statistics and security analysis show that the PRBG is with good randomness and highly capable to withstand attacks.

TL;DR: It is shown that the 2-approximation algorithm developed by Zhang et al. 6 can be implemented in O ( n log ? n ) time and a new exact algorithm with an improved complexity for the special case with identical job processing times is developed.

TL;DR: This work shows that the Kth largest subset problem and theKth largestm-tuple problem are in PP and hard for PP under polynomial-time Turing reductions, and provides complementary PP-upper bounds for some of them.

TL;DR: The Recursive DWR allows us to solve Temporal Knapsack Problem instances through computation of strong dual bounds, which could not be obtained by exploiting the best-known previous approach based on DWR.

TL;DR: A new priority heuristic is presented for the guillotine rectangular packing problem, which first selects one available item for a given position by a priority strategy and places it, and divides the remaining space into two rectangular bins and packs them recursively.

TL;DR: The problem of supporting two-dimensional range successor queries is revisited and a data structure with O ( n lG ? lg ? n ) words of space and O ( lg ?) query time is presented, which improves the work of Nekrich and Navarro (2012).

TL;DR: The maximum number of minimal dominating sets in a chordal graph on n vertices is shown to be at most 1.5214 n, narrowing the gap between the known upper and lower bounds.

TL;DR: In this paper, the authors studied the problem of energy efficient displacement of the sensors so that in their final placement the sensor system ensures coverage of the barrier and the energy consumed for the displacement of sensors to these final positions is minimized in expectation.

TL;DR: It is demonstrated that the former scheme is insecure against forgery attack, while the latter scheme has been totally broken in the sense that the signing key can be recovered from the valid signature easily.

TL;DR: A significant flaw of current CRC-based fuzzy vault schemes is addressed, and an integration of two novel modules into general fuzzy vault scheme, namely chaff points generator and verifier, are proposed, designed to be integrated easily into existing systems as well as simple to enhance.