Sparse Support Vector Machine with <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> Penalty for Feature Selection

We study the strategies in feature selection with sparse support vector machine (SVM). Recently, the socalled L _p -SVM (0 < p < 1) has attracted much attention because it can encourage better sparsity than the widely used L ₁-SVM. However, L _p -SVM is a non-convex and non-Lipschitz optimization problem. Solving this problem numerically is challenging. In this paper, we reformulate the L _p -SVM into an optimization model with linear objective function and smooth constraints (LOSC-SVM) so that it can be solved by numerical methods for smooth constrained optimization. Our numerical experiments on artificial datasets show that LOSC-SVM (0 < p < 1) can improve the classification performance in both feature selection and classification by choosing a suitable parameter p. We also apply it to some real-life datasets and experimental results show that it is superior to L ₁-SVM.     

Symmetric Masks for In-fill Pixel Interpolation on Discrete <Emphasis Type="Italic">p</Emphasis>:<Emphasis Type="Italic">q</Emphasis> Lattices

A 2D p:q lattice contains image intensity entries at pixels located at regular, staggered intervals that are spaced p rows and q columns apart. Zero values appear at all other intermediate grid locations. We consider here the construction, for any given p:q, of convolution masks to smoothly and uniformly interpolate values across all of the intermediate grid positions. The conventional pixel-filling approach is to allocate intensities proportional to the fractional area that each grid pixel occupies inside the boundaries formed by the p:q lines. However, these area-based masks have asymmetric boundaries, flat interior values and may be odd or even in size. Where edges, lines or points are in-filled, area-based p:q masks imprint intensity patterns that recall p:q because the shape of those masks is asymmetric and depends on p:q. We aim to remove these “memory” artefacts by building symmetric p:q masks. We show here that smoother, symmetric versions of such convolution masks exist. The coefficients of the masks constructed here have simple integer values whose distribution is derived purely from symmetry considerations. We have application for these symmetric interpolation masks as part of a precise image rotation algorithm which disguises the rotation angle, as well as to smooth back-projected values when performing discrete tomographic image reconstruction.     

Parallel <Emphasis Type="Italic">LL</Emphasis> parsing

A deterministic parallel LL parsing algorithm is presented. The algorithm is based on a transformation from a parsing problem to parallel reduction. First, a nondeterministic version of a parallel LL parser is introduced. Then, it is transformed into the deterministic version—the LLP parser. The deterministic LLP(q,k) parser uses two kinds of information to select the next operation — a lookahead string of length up to k symbols and a lookback string of length up to q symbols. Deterministic parsing is available for LLP grammars, a subclass of LL grammars. Since the presented deterministic and nondeterministic parallel parsers are both based on parallel reduction, they are suitable for most parallel architectures.     

<Emphasis Type="Italic">I</Emphasis><Subscript>DDT</Subscript>: Fundamentals and test generation

It is the time to explore the fundamentals ofI _DDT testing when extensive work has been done forI _DDT testing since it was proposed. This paper precisely defines the concept of average transient current (I _DDT) of CMOS digital ICs, and experimentally analyzes the feasibility ofI _DDT test generation at gate level. Based on the SPICE simulation results, the paper suggests a formula to calculateI _DDT by means of counting only logical up-transitions, which enablesI _DDT test generation at logic level. The Bayesian optimization algorithm is utilized forI _DDT test generation. Experimental results show that about 25% stuck-open faults are withI _DDT test generation. 2.5, and likely to beI _DDT testable. It is also found that mostI _DDT testable faults are located near the primary inputs of a circuit under test.I _DDT test generation does not require fault sensitization procedure compared with stuck-at fault test generation. Furthermore, some redundant stuck-at faults can be detected by usingI _DDT testing.     

Emergence of anti-<Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">R</Emphasis>) gravity in type-IV bouncing cosmology as due to <Emphasis Type="Italic">M</Emphasis><Subscript>0</Subscript>-brane

Recently, some authors considered the origin of a type-IV singular bounce in modified gravity and obtained the explicit form of F(R) which can produce this type of cosmology. In this paper, we show that during the contracting branch of type-IV bouncing cosmology, the sign of gravity changes, and antigravity emerges. In our model, M0 branes get together and shape a universe, an anti-universe, and a wormhole which connects them. As time passes, this wormhole is dissolved in the universes, F(R) gravity emerges, and the universe expands. When the brane universes become close to each other, the squared energy of their system becomes negative, and some tachyonic states are produced. To remove these states, universes are assumed to be compact, the sign of compacted gravity changes, and anti-F(R) gravity arises, which causes getting away of the universes from each other. In this theory, a Type-IV singularity occurs at t = t _s , which is the time of producing tachyons between expansion and contraction branches.     

On the <Emphasis Type="Italic">k</Emphasis>-accessibility of cores of <Emphasis Type="Italic">TU</Emphasis>-cooperative games

This paper proposes a strengthening of the author’s core-accessibility theorem for balanced TU-cooperative games. The obtained strengthening relaxes the influence of the nontransitivity of classical domination αv on the quality of the sequential improvement of dominated imputations in a game v. More specifically, we establish the k-accessibility of the core C(α _v ) of any balanced TU-cooperative game v for all natural numbers k: for each dominated imputation x, there exists a converging sequence of imputations x₀, x₁,..., such that x₀ = x, lim x _r ∈ C(α _v ) and x_r?m is dominated by any successive imputation x _r with m ∈ [1, k] and r ≥ m. For showing that the TU-property is essential to provide the k-accessibility of the core, we give an example of an NTU-cooperative game G with a ”black hole” representing a nonempty closed subset B ? G(N) of dominated imputations that contains all the α _G -monotonic sequential improvement trajectories originating at any point x ∈ B.     

On <Emphasis Type="Italic">m</Emphasis>-Near-Resolvable Block Designs and <Emphasis Type="Italic">q</Emphasis>-ary Constant-Weight Codes

We introduce m-near-resolvable block designs. We establish a correspondence between such block designs and a subclass of (optimal equidistant) q-ary constant-weight codes meeting the Johnson bound. We present constructions of m-near-resolvable block designs, in particular based on Steiner systems and super-simple t-designs.     

Novel steganographic method based on generalized <Emphasis Type="Italic">K</Emphasis>-distance <Emphasis Type="Italic">N</Emphasis>-dimensional pixel matching

In this paper, a steganographic scheme adopting the concept of the generalized K _d -distance N-dimensional pixel matching is proposed. The generalized pixel matching embeds a B-ary digit (B is a function of K and N) into a cover vector of length N, where the order-d Minkowski distance-measured embedding distortion is no larger than K. In contrast to other pixel matching-based schemes, a N-dimensional reference table is used. By choosing d, K, and N adaptively, an embedding strategy which is suitable for arbitrary relative capacity can be developed. Additionally, an optimization algorithm, namely successive iteration algorithm (SIA), is proposed to optimize the codeword assignment in the reference table. Benefited from the high dimensional embedding and the optimization algorithm, nearly maximal embedding efficiency is achieved. Compared with other content-free steganographic schemes, the proposed scheme provides better image quality and statistical security. Moreover, the proposed scheme performs comparable to state-of-the-art content-based approaches after combining with image models.     

Pseudo-Randomness of Certain Sequences of <Emphasis Type="Italic">k</Emphasis> Symbols with Length <Emphasis Type="Italic">pq</Emphasis>

The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sárközy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.     

(<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-Distance Antimagic Labeling of Some Types of Graphs

We analyze the necessary existence conditions for (a, d)-distance antimagic labeling of a graph G = (V, E) of order n. We obtain theorems that expand the family of not (a, d) -distance antimagic graphs. In particular, we prove that the crown P _n ○ P ₁ does not admit an (a, 1)-distance antimagic labeling for n ≥ 2 if a ≥ 2. We determine the values of a at which path P _n can be an (a, 1)-distance antimagic graph. Among regular graphs, we investigate the case of a circulant graph.     

Inertial motion tracking using sensor saturation compensation with <Emphasis Type="Italic">l</Emphasis><Subscript>1</Subscript> norm regularization

A smoother is proposed for inertial sensor-based motion tracking, where the sensor saturation is compensated. The sensor saturation estimation term is added using l ₁ norm regularization techniques to the standard smoothing problem. The proposed algorithm is in the form of a quadratic optimization problem. Three slightly different methods are proposed, where the geometric models on sensor saturation are slightly different. Through simulation and experiments, it is shown that the proposed method effectively compensates the sensor saturation.     

Some high-rate linear codes over <Emphasis Type="Italic">GF</Emphasis>(5) and <Emphasis Type="Italic">GF</Emphasis>(7)

Let an [n, k, d] _q code be a linear code of length n, dimension k, and with minimum Hamming distance d over GF(q). The ratio R = k/n is called the rate of a code. In this paper, [62, 53, 6]₅, [62, 48, 8]₅, [71, 56, 8]₅, [124, 113, 6]₅, [43, 36, 6]₇, [33, 23, 7]₇, and [27, 18, 7]₇ high-rate codes and new codes with parameters [42, 14, 19]₅, [42, 15, 18]₅, [48, 13, 24]₅, [52, 12, 28]₅, [71, 15, 38]₅, [71, 16, 36]₅, [72, 12, 41]₅, [78, 10, 50]₅, [88, 11, 54]₅, [88, 13, 51]₅, [124, 14, 77]₅, [32, 12, 15]₇, [32, 10, 17]₇, [36, 10, 20]₇, and [48, 10, 29]₇ are constructed. The codes with parameters [62, 53, 6]₅ and [43, 36, 6]₇ are optimal.     

Multiple <Emphasis Type="Italic">k</Emphasis> nearest neighbor search

The problem of kNN (k Nearest Neighbor) queries has received considerable attention in the database and information retrieval communities. Given a dataset D and a kNN query q, the k nearest neighbor algorithm finds the closest k data points to q. The applications of kNN queries are board, not only in spatio-temporal databases but also in many areas. For example, they can be used in multimedia databases, data mining, scientific databases and video retrieval. The past studies of kNN query processing did not consider the case that the server may receive multiple kNN queries at one time. Their algorithms process queries independently. Thus, the server will be busy with continuously reaccessing the database to obtain the data that have already been acquired. This results in wasting I/O costs and degrading the performance of the whole system. In this paper, we focus on this problem and propose an algorithm named COrrelated kNN query Evaluation (COKE). The main idea of COKE is an “information sharing” strategy whereby the server reuses the query results of previously executed queries for efficiently processing subsequent queries. We conduct a comprehensive set of experiments to analyze the performance of COKE and compare it with the Best-First Search (BFS) algorithm. Empirical studies indicate that COKE outperforms BFS, and achieves lower I/O costs and less running time.     

Upper bound on the minimum distance of LDPC codes over <Emphasis Type="Italic">GF</Emphasis>(<Emphasis Type="Italic">q</Emphasis>) based on counting the number of syndromes

In [1] a syndrome counting based upper bound on the minimum distance of regular binary LDPC codes is given. In this paper we extend the bound to the case of irregular and generalized LDPC codes over GF(q). A comparison with the lower bound for LDPC codes over GF(q), upper bound for the codes over GF(q), and the shortening upper bound for LDPC codes is made. The new bound is shown to lie under the Gilbert–Varshamov bound at high rates.     

Motion of spin-half particles in the axially symmetric field of naked singularities of the static <Emphasis Type="Italic">q</Emphasis>-metric

Quantum-mechanical motion of a spin-half particle is examined in the axially symmetric fields of static naked singularities formed by a mass distribution with a quadrupole moment (q-metric). The analysis is performed by means of the method of effective potentials of the Dirac equation generalized to the case where radial and angular variables are not separated. If ?1 < q < qlim, |qlim| ? 1, where q is the quadrupolemoment in proper units, the naked singularities do not exclude the existence of stationary bound states of Dirac particles for a prolate mass distribution in the q-metric along the axial axis. For an oblate mass distribution, the naked singularities of the q-metric are separated from a Dirac particle by infinitely large repulsive barriers followed by a potential well which deepens while moving apart from the equator (from θ = θ _min or θ = π ? θ _min) toward the poles. The poles make an exception, and at 0 < q < q*, there are some points θ _i for particle states with j ≥ 3/2.     

On (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis> )-Distance Anti-Magic and 1-Vertex Bimagic Vertex Labelings of Certain Types of Graphs

The results for the corona P _n ?°?P₁ are generalized, which make it possible to state that P _n ?°?P₁ is not an ( a, d)-distance antimagic graph for arbitrary values of a and d. A condition for the existence of an ( a, d)-distance antimagic labeling of a hypercube Q _n is obtained. Functional dependencies are found that generate this type of labeling for Q _n . It is proved by the method of mathematical induction that Q _n is a (2 ⁿ ?+?n???1,?n???2) -distance antimagic graph. Three types of graphs are defined that do not allow a 1-vertex bimagic vertex labeling. A relation between a distance magic labeling of a regular graph G and a 1-vertex bimagic vertex labeling of G?∪?G is established.     

On Interval Systems [<Emphasis Type="Italic">x</Emphasis>] = [<Emphasis Type="Italic">A</Emphasis>][<Emphasis Type="Italic">x</Emphasis>] + [<Emphasis Type="Italic">b</Emphasis>] and the Powers of Interval Matrices in Complex Interval Arithmetics

For the interval system of equations defined by [x] = [A][x] + [b] we derive necessary and sufficient criteria for the existence of solutions [x]. Furthermore we give necessary and sufficient criteria for the convergence of powers of [A]. In contrast to former results we treat complex interval arithmetics.     

Adaptive (<Emphasis Type="Italic">k</Emphasis>, <Emphasis Type="Italic">F</Emphasis><Subscript>1</Subscript>) interpolation-based hiding scheme

In 2012, Lee et al. proposed an interpolation technique with neighboring pixels (INP) as the base to conceal secret information in predicted pixels. Their method can effectively predict the pixel between two neighboring pixels. However, the different lengths of secret messages caused great distortion when a large secret message was concealed in the predicted value. Therefore, the proposed scheme applies the center folding strategy to fold the secret message for reducing image distortion. Furthermore, the proposed scheme references the variance of the neighboring pixel to determine the length of the secret message for controlling image quality. The parameter pair (k, F ₁) is used to categorize the variance and determine the size of the secret message hidden in each category. k is the total number of thresholds which computed based on the characteristics of each image for balancing hiding payload and image quality. F ₁ is the length of the secret message for the smoothest area. The experimental results show that the embedding capacity of the proposed method is 1.5 bpp higher than that of existing methods. For the same hiding payload, the image quality of the proposed method is 1.6 dB higher than that of existing methods.     

Heidegger on technology and <Emphasis Type="Italic">Gelassenheit</Emphasis>: <Emphasis Type="Italic">wabi</Emphasis>-<Emphasis Type="Italic">sabi</Emphasis> and the art of <Emphasis Type="Italic">Verfallenheit</Emphasis>

The question of the contemporary relevance of Heidegger’s reflections on technology to today’s advanced technology is here explored with reference to the notion of “entanglement” towards a review of Heidegger’s understanding of technology and media, including the entertainment industry and modern digital life. Heidegger’s reflections on Gelassenheit have been connected with the aesthetics of the tea ceremony, disputing the material aesthetics of porcelain versus plastic. Here by approaching the art of wabi-sabi as the art of Verfallenheit, I argue that Gelassenheit may be understood in these terms.     

<Emphasis Type="Italic">D</Emphasis>-decomposition technique state-of-the-art

It is a survey of recent extensions and new applications for the classical D-decomposition technique. We investigate the structure of the parameter space decomposition into root invariant regions for single-input single-output systems linear depending on the parameters. The D-decomposition for uncertain polynomials is considered as well as the problem of describing all stabilizing controllers of the certain structure (for instance, PID-controllers) that satisfy given H _∞-criterion. It is shown that the D-decomposition technique can be naturally linked with M-Δ framework (a general scheme for analysis of uncertain systems) and it is applicable for describing feasible sets for linear matrix inequalities. The problem of robust synthesis for linear systems can be also treated via D-decomposition technique.