Superiority demonstration of variance-considered machines by comparing error rate with support vector machines

To improve the performance of classification algorithms, we proposed a new varianceconsidered machine (VCM) classification algorithm in a previous study. The study showed theoretically that VCMs have lower error probabilities than SVMs. The purpose of this paper is to experimentally demonstrate the superiority of VCMs. Therefore, we verified our proposal with several case experiments using data following a Gaussian distribution with different variances and prior probabilities. To estimate performance, the experiment for each case was executed 1000 times and the error rates were averaged for accuracy. The data of each experiment have different distances between means of data, and different ratios between training data and testing data. Thus, we proved that the error rate of VCMs is lower than the error rate of SVMs, although their performances were not similar in each case. Consequently, we expect that VCMs will be applied to a variety fields.     

Annular‐ring slot antenna designs with circular polarization radiation

The design of a microstrip‐fed annular‐ring slot antenna (ARSA) with circular polarization (CP) radiation is initially studied. To obtain CP radiation with broad 3‐dB axial ratio (AR) bandwidth that can cover the WiMAX 2.3 GHz (2305–2320 MHz, 2345–2360 MHz) and WLAN 2.4 GHz (2400–2480 MHz) bands, a novel technique of extending an inverted L‐shaped slot from the bottom section of the annular‐ring is proposed. To suppress the harmonic modes induced by the CP ARSA, the technique of integrating a defected ground structure into the annular‐ring slot is further introduced. From the measured results, 10‐dB impedance bandwidth and 3‐dB AR bandwidth of 44.86 and 9.68% were achieved by the proposed harmonic suppressed CP ARSA. Furthermore, average gain and radiation efficiency of ～4.7 dBic and 71%, respectively, were also exhibited across the bands of interest. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:337–345, 2015.     

On detecting faults for Boolean expressions

Fault based testing aims at detecting hypothesized faults based on specifications or program source. There are some fault based techniques for testing Boolean expressions which are commonly used to model conditions in specifications as well as logical decisions in program source. The MUMCUT strategy has been proposed to generate test cases from Boolean expressions. Moreover, it detects eight common types of hypothesized faults provided that the original expression is in irredundant disjunctive normal form, IDNF. Software practitioners are more likely to write the conditions and logical decisions in general form rather than IDNF. Hence, it is interesting to investigate the fault detecting capability of the MUMCUT strategy with respect to general form Boolean expressions. In this article, we perform empirical studies to investigate the fault detection capability of the MUMCUT strategy with respect to general form Boolean expressions as well as mutated expressions. A mutated expression can be obtained from the original given Boolean expression by making a syntactic change based on a particular type of fault.

Linear-Time Construction of Two-Dimensional Suffix Trees

The two-dimensional suffix tree of a matrix A is a compacted tree that represents all square submatrices of A. We present the first complete version of a deterministic linear-time algorithm to construct the two-dimensional suffix tree by applying a divide-and-conquer approach.     

A new smart smudge attack using CNN

International Journal of Information Security - This paper deals with a well-known problem in the area of the smudge attacks: when a user draws a pattern to unlock the pattern lock on a smartphone...     

A one-shot bargaining strategy for dealing with multifarious opponents

Bargaining is an effective paradigm to solve the problem of resource allocation. The consideration of factors such as bounded rationality of negotiators, time constraints, incomplete information, and complexity of dynamic environment make the design of optimal strategy for one-shot bargaining much tougher than the situation that all bargainers are assumed to be absolutely rational. Lots of prediction-based strategies have been explored either based on assuming a finite number of models for opponents, or focusing on the prediction of opponent’s reserve price, deadline, or the probabilities of different behaviors. Following the methods of estimating opponent’s private information, this paper gives a strategy which improves the BLGAN strategy to adapt to various possible bargaining situations and deal with multifarious opponents. In addition, this paper compares the improved BLGAN strategy with related work. Experimental results show that the improved BLGAN strategy can outperform related ones when faced with various opponents, especially the agents who frequently change their strategies for anti-learning.     

Inventive Tool Use to Comprehend Big Code

Software developers often need to understand a large body of unfamiliar code with little or no documentation, no experts to consult, and little time to do it. A post appeared in January 2008 on Slashdot, a technology news Web site, asking for tools and techniques that could help. This article analyzes 301 often passionate and sometimes articulate responses to this query, including the themes and the associated tool recommendations. The most common suggestions were to use a code navigation tool, use a design recovery tool, use a debugger to step through the code, create a runtime trace, use problem-based learning, ask people for help, study the code from top down, and print out all the code. This analysis presents an intriguing snapshot of how software developers in industry go about comprehending big code.     

Robust reweighted MAP motion estimation

This paper proposes a motion estimation algorithm that is robust to motion discontinuity and noise. The proposed algorithm is constructed by embedding the least median squares (LMedS) of robust statistics into the maximum a posteriori (MAP) estimator. Difficulties in accurate estimation of the motion field arise from the smoothness constraint and the sensitivity to noise. To cope robustly with these problems, a median operator and the concept of reweighted least squares (RLS) are applied to the MAP motion estimator, resulting in the reweighted robust MAP (RRMAP). The proposed RRMAP motion estimation algorithm is also generalized for multiple image frame cases. Computer simulation with various synthetic image sequences shows that the proposed algorithm reduces errors, compared to three existing robust motion estimation algorithms that are based on M-estimation, total least squares (TLS), and Hough transform. It is also observed that the proposed algorithm is statistically efficient and robust to additive Gaussian noise and impulse noise. Furthermore, the proposed algorithm yields reasonable performance for real image sequences