An asymptotic Gilbert-Varshamov bound for -nets.
An automatic segmentation method for scanned images of wheat root systems with dark discolourations
The analysis of plant root system images plays an important role in the diagnosis of plant health state, the detection of possible diseases and growth distortions. This paper describes an initial stage of automatic analysis-the segmentation method for scanned images of Ni-treated wheat roots from hydroponic culture. The main roots of a wheat fibrous system are placed separately in the scanner view area on a high chroma background (blue or red). The first stage of the method includes the transformation...
An axiomatic characterization of generalized directed-divergence
An efficient algorithm for adaptive total variation based image decomposition and restoration
With the aim to better preserve sharp edges and important structure features in the recovered image, this article researches an improved adaptive total variation regularization and H −1 norm fidelity based strategy for image decomposition and restoration. Computationally, for minimizing the proposed energy functional, we investigate an efficient numerical algorithm-the split Bregman method, and briefly prove its convergence. In addition, comparisons are also made with the classical OSV (Osher-Sole-Vese)...
An efficient connected dominating set algorithm in wsns based on the induced tree of the crossed cube
The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of...
An efficient VLSI linear array for DCT/IDCT using subband decomposition algorithm.
An entropy power inequality for the binomial family.
An Enumerative Problem in Threshold Logic
An extension theorem.
An extremal doubly even self-dual code of length 112.
An Improvement to the Achievement of the Griesmer Bound
We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper...
An intelligent packet loss control heuristic for connectionless real-time voice communication.
An Intrusion Prevention System As a Proactive Security Mechanism in Network Infrastructure
An Observation about Variations of the Diffie-Hellman Assumption
We generalize the Strong Boneh-Boyen (SBB) signature scheme to sign vectors; we call this scheme GSBB. We show that if a particular (but most natural) average case reduction from SBB to GSBB exists, then the Strong Diffie-Hellman (SDH) and the Computational Diffie-Hellman (CDH) have the same worst-case complexity.
An overview of the topological gradient approach in image processing: advantages and inconveniences.
An unscented Kalman filter in designing dynamic GMDH neural networks for robust fault detection
This paper presents an identification method of dynamic systems based on a group method of data handling approach. In particular, a new structure of the dynamic multi-input multi-output neuron in a state-space representation is proposed. Moreover, a new training algorithm of the neural network based on the unscented Kalman filter is presented. The final part of the work contains an illustrative example regarding the application of the proposed approach to robust fault detection of a tunnel furnace....
An ε-insensitive approach to fuzzy clustering
Fuzzy clustering can be helpful in finding natural vague boundaries in data. The fuzzy c-means method is one of the most popular clustering methods based on minimization of a criterion function. However, one of the greatest disadvantages of this method is its sensitivity to the presence of noise and outliers in the data. The present paper introduces a new ε-insensitive Fuzzy C-Means (εFCM) clustering algorithm. As a special case, this algorithm includes the well-known Fuzzy C-Medians method (FCMED)....
Analýsa elektrických obvodů v ustáleném stavu pomocí samočinného číslicového počítače
Analyses multi-résolutions non orthogonales, commutation entre projecteurs et derivation et ondelettes vecteurs à divergence nulle.
The notion of non-orthogonal multi-resolution analysis and its compatibility with differentiation (as expressed by the commutation formula) lead us to the construction of a multi-resolution analysis of L2(Rn)n which is well adapted to the approximation of divergence-free vector functions. Thus, we obtain unconditional bases of compactly supported divergence-free vector wavelets.
Analysis of a measurement information