(m+k,m)-functions with good cryptographic properties when 1≤k

Action recognition using skeleton data (3D coordinates of human joints) is an attractive topic due to its robustness to the actor's appearance, camera's viewpoint, illumination, and other environmental conditions. However, skeleton data must be measured by a depth sensor or extracted from video data using an estimation algorithm, and doing so risks extraction errors and noise. In this work, for robust skeleton-based action recognition, we propose a deep state-space model (DSSM). The DSSM is a deep generative model of the underlying dynamics of an observable sequence. We applied the proposed DSSM to skeleton data, and the results demonstrate that it improves the classification performance of a baseline method. Moreover, we confirm that feature extraction with the proposed DSSM renders subsequent classifications robust to noise and missing values. In such experimental settings, the proposed DSSM outperforms a state-of-the-art method.

Rapid development of modern communications has initiated essential requirements for providing efficient algorithms that can solve the routing and wavelength assignment (RWA) problem in satellite optical networks. In this paper, the bee colony algorithm optimization based on link cost for RWA (BCO-LCRWA) is tailored for satellite networks composed of intersatellite laser links. In BCO-LCRWA, a cost model of intersatellite laser links is established based on metrics of network transmission performance namely delay and wavelengths utilization, with constraints of Doppler wavelength drift, transmission delay, wavelength consistency and continuity. Specifically, the fitness function of bee colony exploited in the proposed algorithm takes wavelength resources utilization and communication hops into account to implement effective utilization of wavelengths, to avoid unnecessary over-detouring and ensure bit error rate (BER) performance of the system. The simulation results corroborate the improved performance of the proposed algorithm compared with the existing alternatives.

In partial label data, the ground-truth label of a training example is concealed in a set of candidate labels associated with the instance. As the ground-truth label is inaccessible, it is difficult to train the classifier via the label information. Consequently, manifold structure information is adopted, which is under the assumption that neighbor/similar instances in the feature space have similar labels in the label space. However, the real-world data may not fully satisfy this assumption. In this paper, a partial label metric learning method based on likelihood-ratio test is proposed to make partial label data satisfy the manifold assumption. Moreover, the proposed method needs no objective function and treats the data pairs asymmetrically. The experimental results on several real-world PLL datasets indicate that the proposed method outperforms the existing partial label metric learning methods in terms of classification accuracy and disambiguation accuracy while costs less time.

Simultaneous multithreading (SMT) technology improves CPU throughput, but also causes unpredictable performance fluctuations for co-running workloads. Although recent major SMT processors have adopted some techniques to promote hardware support for quality-of-service (QoS), achieving both precise performance guarantees and high throughput on SMT architectures is still a challenging open problem. In this paper, we demonstrate through some comprehensive investigations on a cycle-accurate simulator that not only almost all in-core resources suffer from severe contention as workloads vary but also there is a non-linear relationship between performance and available quotas of resources. We consider these observations as the fundamental reason leading to the challenging problem above. Thus, we introduce QoSMT, a novel hardware scheme that leverages a closed-loop controlling mechanism consisting of detection, prediction and adjustment to enforce precise performance guarantees for specific targets, e.g. achieving 85%, 90% or 95% of the performance of a workload running alone respectively. We implement a prototype on GEM5 simulator. Experimental results show that the average control error is only 1.4%, 0.5% and 3.6%.

In this letter, an efficient hybrid direction-of-arrival (DOA) estimation scheme is devised for massive uniform rectangular array. In this scheme, the DOA estimator based on a two-dimensional (2D) discrete Fourier transform is first applied to acquire coarse initial DOA estimates for single data snapshot. Then, the fine DOA is accurately estimated through using the iterative search estimator within a very small region. Meanwhile, a Nyström-based method is utilized to correctly compute the required noise-subspace projection matrix, avoiding the direct computation of full-dimensional sample correlation matrix and its eigenvalue decomposition. Therefore, the proposed scheme not only can estimate DOA, but also save computational cost, especially in massive antenna arrays scenarios. Simulation results are included to demonstrate the effectiveness of the proposed hybrid estimate scheme.

In this paper, the influence of high-temperature sputtering on the nitrogen-doped (N-doped) LaB6 thin film formation utilizing RF sputtering was investigated. The N-doped LaB6/SiO2/p-Si(100) MOS diode and N-doped LaB6/p-Si(100) of Schottky diode were fabricated. A 30 nm thick N-doped LaB6 thin film was deposited from room temperature (RT) to 150°C. It was found that the resistivity was decreased from 1.5 mΩcm to 0.8 mΩcm by increasing deposition temperature from RT to 150°C. The variation of work function was significantly decreased in case that N-doped LaB6 thin film deposited at 150°C. Furthermore, Schottky characteristic was observed by increasing deposition temperature to 150°C. In addition, the crystallinity of N-doped LaB6 thin film was improved by increasing deposition temperature.

Goal modeling is a method that describes requirements structurally. Goal modeling mainly consists of two tasks: extraction of goals and organization of the extracted goals. Generally, the process of the goal modeling requires intensive manual intervention and higher modeling skills than the process of the usual requirements description. In order to mitigate this problem, we propose a method that provides systematic supports for constructing goal models. In the method, the requirement analyst answers questions and a goal model is semi-automatically constructed based on the answers made. We develop a prototype tool that implements the proposed method and apply it to two systems. The results demonstrate the feasibility of the method.

Embedded SQL inserts SQL statements into the host programming language and executes them at program run time. SQL injection is a known attack technique; however, detection techniques are not introduced in embedded SQL. This paper introduces a technique based on candidate code generation that can detect SQL injection vulnerability in the C/C++ host programming language.

In this letter, we simulate GNSS/LEO measurements and propose a process strategy for LEO-augmented GNSS medium length baseline RTK. Experiments show that, the performance of GNSS medium length baseline RTK can be significantly improved by introducing LEO satellites. The convergence speed of LEO-augmented GPS or BDS float solution maybe better than GPS/BDS combined under the conditions of similar satellite geometry. Besides, the RMS error of fixed solutions are improved to better than 4cm from sub-decimeter level.

When people learn a handicraft with instructional contents such as books, videos, and web pages, many of them often give up halfway because the contents do not always assure how to make it. This study aims to provide origami learners, especially beginners, with feedbacks on their folding operations. An approach for recognizing the state of the learner by using a single top-view camera, and pointing out the mistakes made during the origami folding operation is proposed. First, an instruction model that stores easy-to-follow folding operations is defined. Second, a method for recognizing the state of the learner's origami paper sheet is proposed. Third, a method for detecting mistakes made by the learner by means of anomaly detection using a one-class support vector machine (one-class SVM) classifier (using the folding progress and the difference between the learner's origami shape and the correct shape) is proposed. Because noises exist in the camera images due to shadows and occlusions caused by the learner's hands, the shapes of the origami sheet are not always extracted accurately. To train the one-class SVM classifier with high accuracy, a data cleansing method that automatically sifts out video frames with noises is proposed. Moreover, using the statistics of features extracted from the frames in a sliding window makes it possible to reduce the influence by the noises. The proposed method was experimentally demonstrated to be sufficiently accurate and robust against noises, and its false alarm rate (false positive rate) can be reduced to zero. Requiring only a single camera and common origami paper, the proposed method makes it possible to monitor mistakes made by origami learners and support their self-learning.

The aim of this paper is to show an upper bound for finding defective samples in a group testing framework. To this end, we exploit minimization of Hamming weights in coding theory and define probability of error for our decoding scheme. We derive a new upper bound on the probability of error. We show that both upper and lower bounds coincide with each other at an optimal density ratio of a group matrix. We conclude that as defective rate increases, a group matrix should be sparser to find defective samples with only a small number of tests.

This paper presents non-destructive millimeter-wave (MMW) imaging of sub-millimeter-wide cracks on a concrete surface covered with paper. We measured the near-field scattering of 76.5 GHz-MMW signals at concrete surface cracks for detection of the sub-millimeter-wide cracks. A decrease in the received signal magnitude by near-field scattering at the fine concrete surface crack was slight, which yielded an unclear MMW image contrast of fine cracks at the concrete surface. We have found that the received signal magnitude at concrete surface crack is larger than that at the surface without a crack, when the paper thickness is almost equal to n/4 of the effective wavelength of the MMW signal in the paper (n=1, 3, 5 ...), thus, making MMW image contrast at the surface crack reversed. By calculating the difference of two MMW images obtained from different paper thickness, we were able to improve the MMW image contrast at the surface crack by up to 3.3 dB.

Superconducting detectors have been shown to be superior to other techniques in some applications. However, superconducting devices have not been used for detecting neutrons often in the past decades. We have been developing various superconducting neutron detectors. In this paper, we review our attempts to measure neutrons using superconducting stripline detectors with DC bias currents. These include attempts with a MgB2-based detector and a Nb-based detector with a 10B converter.

Massive open online course (MOOC) is an online course aimed at unlimited participation and open access via the web. Although there are many MOOC providers, they typically focus on the online course providing and typically do not link with traditional education and business sector requirements. This paper presents a MOOC service framework that focuses on adopting MOOC to provide additional services to support students in traditional education and to provide credit bank consisting of student academic credentials for business sector demand. Particularly, it extends typical MOOC to support academic/ credential record and transcript issuance. The MOOC service framework consists of five layers: authentication, resources, learning, assessment and credential layers. We discuss the adoption of the framework in Thai MOOC, the national MOOC system for Thai universities. Several main issues related to the framework adoption are discussed, including the service strategy and model as well as infrastructure design for large-scale MOOC service.

This paper proposes a low complexity soft input decoding in an iterative linear receiver for overloaded MIMO. The proposed soft input decoding applies two types of lattice reduction-aided linear filters to estimate log-likelihood ratio (LLR) in order to reduce the computational complexity. A lattice reduction-aided linear with whitening filter is introduced for the LLR estimation in the proposed decoding. The equivalent noise caused by the linear filter is mitigated with the decoder output stream and the LLR is re-estimated after the equivalent noise mitigation. Furthermore, LLR clipping is introduced in the proposed decoding to avoid the performance degradation due to the incorrect LLRs. The performance of the proposed decoding is evaluated by computer simulation. The proposed decoding achieves about 2dB better BER performance than soft decoding with the exhaustive search algorithm, so called the MLD, at the BER of 10-4, even though the complexity of the proposed decoding is 1/10 as small as that of soft decoding with the exhaustive search.

In this paper, we design and develop a sensor-embedded office chair that can measure the posture of the office worker continuously without disturbing their job. In our system, eight accelerometers, that are attached at the back side of the fabric surface of the chair, are used for recognizing the posture. We propose three sitting posture recognition algorithms by considering the initial position of the chair and the difference of physique. Through the experiment with 28 participants, we confirm that our proposed chair can recognize the sitting posture by 75.4% (algorithm 1), 83.7% (algorithm 2), and 85.6% (algorithm 3) respectively.

Biometric template protection techniques have been proposed to address security and privacy issues inherent to biometric-based authentication systems. However, it has been shown that the robustness of most of such techniques against reversibility and linkability attacks are overestimated. Thus, a thorough security analysis of recently proposed template protection schemes has to be carried out. Negative iris recognition is an interesting iris template protection scheme based on the concept of negative databases. In this paper, we present a comprehensive security analysis of this scheme in order to validate its practical usefulness. Although the authors of negative iris recognition claim that their scheme possesses both irreversibility and unlinkability, we demonstrate that more than 75% of the original iris-code bits can be recovered using a single protected template. Moreover, we show that the negative iris recognition scheme is vulnerable to attacks via record multiplicity where an adversary can combine several transformed templates to recover more proportion of the original iris-code. Finally, we demonstrate that the scheme does not possess unlinkability. The experimental results, on the CASIA-IrisV3 Interval public database, support our theory and confirm that the negative iris recognition scheme is susceptible to reversibility, linkability, and record multiplicity attacks.

The packet error rate (PER) performance of multi-hop STBC based cooperative and diversity relaying systems are studied. These systems consist of a source, a destination, and two relay stations in each hop. From in-lab experiments, it is confirmed that the cooperative relaying system has better PER performance than the diversity relaying system with highly correlated channels.

To solve the problem of the self-deployment of heterogeneous directional wireless sensor networks in 3D space, this paper proposes a weighted Voronoi diagram-based self-deployment algorithm (3DV-HDDA) in 3D space. To improve the network coverage ratio of the monitoring area, the 3DV-HDDA algorithm uses the weighted Voronoi diagram to move the sensor nodes and introduces virtual boundary torque to rotate the sensor nodes, so that the sensor nodes can reach the optimal position. This work also includes an improvement algorithm (3DV-HDDA-I) based on the positions of the centralized sensor nodes. The difference between the 3DV-HDDA and the 3DV-HDDA-I algorithms is that in the latter the movement of the node is determined by both the weighted Voronoi graph and virtual force. Simulations show that compared to the virtual force algorithm and the unweighted Voronoi graph-based algorithm, the 3DV-HDDA and 3DV-HDDA-I algorithms effectively improve the network coverage ratio of the monitoring area. Compared to the virtual force algorithm, the 3DV-HDDA algorithm increases the coverage from 75.93% to 91.46% while the 3DV-HDDA-I algorithm increases coverage from 76.27% to 91.31%. When compared to the unweighted Voronoi graph-based algorithm, the 3DV-HDDA algorithm improves the coverage from 80.19% to 91.46% while the 3DV-HDDA-I algorithm improves the coverage from 72.25% to 91.31%. Further, the energy consumption of the proposed algorithms after 60 iterations is smaller than the energy consumption using a virtual force algorithm. Experimental results demonstrate the accuracy and effectiveness of the 3DV-HDDA and the 3DV-HDDA-I algorithms.