Integer codes are defined by error-correcting codes over integers modulo a fixed positive integer. In this paper, we show that the construction of integer codes can be reduced into the cases of prime-power moduli. We can efficiently search integer codes with small prime-power moduli and can construct target integer codes with a large composite-number modulus. Moreover, we also show that this prime-factorization reduction is useful for the construction of self-orthogonal and self-dual integer codes, i.e., these properties in the prime-power moduli are preserved in the composite-number modulus. Numerical examples of integer codes and generator matrices demonstrate these facts and processes.

Compressed sensing theory provides a new approach to acquire data as a sampling technique and makes sure that a sparse signal can be reconstructed from few measurements. The construction of compressed sensing matrices is a main problem in compressed sensing theory (CS). In this paper, the deterministic constructions of compressed sensing matrices based on affine singular linear space over finite fields are presented and a comparison is made with the compressed sensing matrices constructed by DeVore based on polynomials over finite fields. By choosing appropriate parameters, our sparse compressed sensing matrices are superior to the DeVore's matrices. Then we use a new formulation of support recovery to recover the support sets of signals with sparsity no more than k on account of binary compressed sensing matrices satisfying disjunct and inclusive properties.

This letter studies physical-layer security in a cognitive radio (CR) network, where a primary user (PU) is eavesdropped by multiple collusive eavesdroppers. Under the PU secrecy outage constraint to protect the PU, the secondary users (SUs) are assumed to be allowed to transmit. The problem of joint SU scheduling and power control to maximize the SU ergodic transmission rate is investigated for both the scenarios of perfect and imperfect channel state information (CSI). It is shown that, although collusive eavesdroppers degrade the PU performance compared to non-collusive eavesdroppers, the SU performance is actually improved when the number of eavesdroppers is large. It is also shown that our proposed scheme with imperfect CSI can guarantee that the PU performance is unaffected by imperfect CSI.

This letter proposes a novel dynamic channel assignment (DCA) scheme with consideration of interference and fairness for the downlink of dense small-cell networks based on orthogonal frequency division multiple access-frequency division duplex. In the proposed scheme, a small-cell gateway fairly assigns subchannels to the small-cell user equipment (SUE) according to the co-tier interference from neighboring small-cell access points. From the simulation results, it is shown that the proposed DCA scheme outperforms other DCA schemes in terms of the fairness of each SUE capacity.

In this letter, we propose a supervised bimodal emotion recognition approach based on two important human emotion modalities including facial expression and body gesture. A effectively supervised feature fusion algorithms named supervised multiset canonical correlation analysis (SMCCA) is presented to established the linear connection between three sets of matrices, which contain the feature matrix of two modalities and their concurrent category matrix. The test results in the bimodal emotion recognition of the FABO database show that the SMCCA algorithm can get better or considerable efficiency than unsupervised feature fusion algorithm covering canonical correlation analysis (CCA), sparse canonical correlation analysis (SCCA), multiset canonical correlation analysis (MCCA) and so on.

When trying to estimate time-varying multipath channels by applying a basis expansion model (BEM) in orthogonal frequency division multiplexing (OFDM) systems, pilot clusters are contaminated by inter-carrier interference (ICI). The pilot cluster ICI (PC-ICI) degrades the estimation accuracy of BEM coefficients, which degrades system performance. In this paper, a PC-ICI suppression scheme is proposed, in which two coded symbols defined as weighted sums of data symbols are inserted on both sides of each pilot cluster. Under the assumption that the channel has Flat Doppler spectrum, the optimized weight coefficients are obtained by an alternating iterative optimization algorithm, so that the sum of the PC-ICI generated by the encoded symbols and the data symbols is minimized. By approximating the optimized weight coefficients, they are independent of the channel tap power. Furthermore, it is verified that the proposed scheme is robust to the estimation error of the normalized Doppler frequency offset and can be applied to channels with other types of Doppler spectra. Numerical simulation results show that, compared with the conventional schemes, the proposed scheme achieves significant improvements in the performance of PC-ICI suppression, channel estimation and system bit-error-ratio (BER).

Wireless information and power transfer technology is a promising means of supplying power for remote terminals in future communication systems. This paper investigates time-splitting (TS) recource allocation schemes for multi-cell massive MIMO systems with downlink (DL) wireless power transfer and uplink (UL) user information transmission under a harvest-then-transmit protocol. In order to jointly optimize the power and time allocation, two power minimization problems are formulated under different constraints on the minimal quality-of-service (QoS) requirement. Then, these original non-convex problems are transformed into their convex approximated ones which can be solved iteratively by successive convex approximation. Simulation results show that by exploiting the diversity effect of large-scale antenna arrays, the complexity-reduced asymptotic recourse allocation scheme almost match the power efficiency of the nonasymptotic scheme.

In this paper, we devise low-complexity uplink detection algorithms for Massive MIMO systems. We treat the uplink detection as an ill-posed problem and adopt the Landweber Method to solve it. In order to reduce the computational complexity and increase the convergence rate, we propose improved Landweber Method with optimal relax factor (ILM-O) algorithm. In addition, to reduce the order of Landweber Method by introducing a set of coefficients, we propose reduced order Landweber Method (ROLM) algorithm. An analysis on the convergence and the complexity is provided. Numerical results demonstrate that the proposed algorithms outperform the existing algorithm.

In this paper, we propose a novel primary user detection scheme for spectrum sensing in cognitive radio. Inspired by the conventional signal classification approach, the spectrum sensing is translated into a classification problem. On the basis of feature-based classification, the spectral correlation of a second-order cyclostationary analysis is applied as the feature extraction method, whereas a stacked denoising autoencoders network is applied as the classifier. Two training methods for signal detection, interception-based detection and simulation-based detection, are considered, for different prior information and implementation conditions. In an interception-based detection method, inspired by the two-step sensing, we obtain training data from the interception of actual signals after a sophisticated sensing procedure, to achieve detection without priori information. In addition, benefiting from practical training data, this interception-based detection is superior under actual transmission environment conditions. The alternative, a simulation-based detection method utilizes some undisguised parameters of the primary user in the spectrum of interest. Owing to the diversified predetermined training data, simulation-based detection exhibits transcendental robustness against harsh noise environments, although it demands a more complicated classifier network structure. Additionally, for the above-described training methods, we discuss the classifier complexity over implementation conditions and the trade-off between robustness and detection performance. The simulation results show the advantages of the proposed method over conventional spectrum-sensing schemes.

In this paper, a proof-of-concept sensor platform for an all-in-one wireless bio sensor chip was developed and evaluated. An on-chip battery, an on-chip electrochromic display (ECD), a micro processor, a voltage converter and analog switches were implemented on a printed circuit board. Instead of bio-sensor, a temperature sensor was used to evaluate the functionality of the platform. The platform successfully worked in an electrolyte and the encoded measurement result was displayed on the ECD. The displayed data was captured by a CMOS digital camera and the measured data could be successfully decoded by a computer program.

In this paper, we examined the transfer method of fluororesin as the novel formation method of polymer wall in order to realize the lattice-shaped polymer walls without patterned light irradiation using photomask. We clarified that the transfer method was effective for formation of polymer wall structure on flexible substrate.

Security researchers/vendors detect malicious websites based on several website features extracted by honeyclient analysis. However, web-based attacks continue to be more sophisticated along with the development of countermeasure techniques. Attackers detect the honeyclient and evade analysis using sophisticated JavaScript code. The evasive code indirectly identifies vulnerable clients by abusing the differences among JavaScript implementations. Attackers deliver malware only to targeted clients on the basis of the evasion results while avoiding honeyclient analysis. Therefore, we are faced with a problem in that honeyclients cannot analyze malicious websites. Nevertheless, we can observe the evasion nature, i.e., the results in accessing malicious websites by using targeted clients are different from those by using honeyclients. In this paper, we propose a method of extracting evasive code by leveraging the above differences to investigate current evasion techniques. Our method analyzes HTTP transactions of the same website obtained using two types of clients, a real browser as a targeted client and a browser emulator as a honeyclient. As a result of evaluating our method with 8,467 JavaScript samples executed in 20,272 malicious websites, we discovered previously unknown evasion techniques that abuse the differences among JavaScript implementations. These findings will contribute to improving the analysis capabilities of conventional honeyclients.

Bitcoin is the leading cryptocurrency in the world with a total marketcap of nearly USD 33 billion, [1] with 370,000 transactions recorded daily[2]. Pseudo-anonymous, decentralized peer-to-peer electronic cash systems such as Bitcoin have caused a paradigm shift in the way that people conduct financial transactions and purchase goods. Although cryptocurrencies enable users to securely and anonymously exchange money, they can also facilitate illegal criminal activities. Therefore, it is imperative that law enforcement agencies develop appropriate analytical processes that will allow them to identify and investigate criminal activities in the Blockchain (a distributed ledger). In this paper, INTERPOL, through the INTERPOL Global Complex for Innovation, proposes a Bitcoin analytical framework and a software system that will assist law enforcement agencies in the real-time analysis of the Blockchain while providing digital crime analysts with tracing and visualization capabilities. By doing so, it is feasible to render transactions decipherable and comprehensible for law enforcement investigators and prosecutors. The proposed solution is evaluated against three criminal case studies linked to Darknet markets, ransomware and DDoS extortion.

Efficiency and flexibility of collections have a significant impact on the overall performance of applications. The current approaches to implement collections have two main drawbacks: (i) they limit the efficiency of collections and (ii) they have not adequate support for collection composition. So, when the efficiency and flexibility of collections is important, the programmer needs to implement them himself, which leads to the loss of reusability. This article presents neoCollection, a novel approach to encapsulate collections. neoCollection has several distinguishing features: (i) it can be applied on data elements efficiently and flexibly (ii) composition of collections can be made efficiently and flexibly, a feature that does not exist in the current approaches. In order to demonstrate its effectiveness, neoCollection is implemented as an extension to Java and C++.

This paper presents an efficient acceleration algorithm for Lloyd-type k-means clustering, which is suitable to a large-scale and high-dimensional data set with potentially numerous classes. The algorithm employs a novel projection-based filter (PRJ) to avoid unnecessary distance calculations, resulting in high-speed performance keeping the same results as a standard Lloyd's algorithm. The PRJ exploits a summable lower bound on a squared distance defined in a lower-dimensional space to which data points are projected. The summable lower bound can make the bound tighter dynamically by incremental addition of components in the lower-dimensional space within each iteration although the existing lower bounds used in other acceleration algorithms work only once as a fixed filter. Experimental results on large-scale and high-dimensional real image data sets demonstrate that the proposed algorithm works at high speed and with low memory consumption when large k values are given, compared with the state-of-the-art algorithms.

With the rapid growth on data scale and complexity, single disk failure recovery becomes very important for erasure coded storage systems. In this paper, we propose a new strip-switched deployment method, which utilizes the feature that strips of each stripe of erasure codes could be switched, and uses simulated annealing algorithm to search for the proper strip-deployment on the stack level to balance the read accesses, in order to improve the recovery performance. The analysis and experiments results show that SSDM could effectively improve the single failure recovery performance.

The changes of temperature, salinity and ocean current in underwater environment, have adverse effects on the communication range of sensors, and make them become temporary failure. These temporarily misbehaving sensors are called dumb nodes. In this paper, an energy-efficient connectivity re-establishment (EECR) scheme is proposed. It can reconstruct the topology of underwater acoustic sensor networks (UASNs) with the existing of dumb nodes. Due to the dynamic of underwater environment, the generation and recovery of dumb nodes also change dynamically, resulting in intermittent interruption of network topology. Therefore, a multi-band transmission mode for dumb nodes is designed firstly. It ensures that the current stored data of dumb nodes can be sent out in time. Subsequently, a connectivity re-establishment scheme of sub-nodes is designed. The topology reconstruction is adaptively implemented by changing the current transmission path. This scheme does't need to arrange the sleep nodes in advance. So it can reduce the message expenses and energy consumption greatly. Simulation results show that the proposed method has better network performance under the same conditions than the classical algorithms named LETC and A1. What's more, our method has a higher network throughput rate when the nodes' dumb behavior has a shorter duration.

Recently, the demand for the digitization of manga is increased. Then, in the case of an old manga where the original pictures have been lost, we have to digitize it from comics. However, the show-through phenomenon would be caused by scanning of the comics since it is represented as the double sided images. This letter proposes the manga show-through cancellation method based on the deep convolutional neural network (CNN). Numerical results show that the effectiveness of the proposed method.

This paper proposes a novel pseudo multi-exposure image fusion method based on a single image. Multi-exposure image fusion is used to produce images without saturation regions, by using photos with different exposures. However, it is difficult to take photos suited for the multi-exposure image fusion when we take a photo of dynamic scenes or record a video. In addition, the multi-exposure image fusion cannot be applied to existing images with a single exposure or videos. The proposed method enables us to produce pseudo multi-exposure images from a single image. To produce multi-exposure images, the proposed method utilizes the relationship between the exposure values and pixel values, which is obtained by assuming that a digital camera has a linear response function. Moreover, it is shown that the use of a local contrast enhancement method allows us to produce pseudo multi-exposure images with higher quality. Most of conventional multi-exposure image fusion methods are also applicable to the proposed multi-exposure images. Experimental results show the effectiveness of the proposed method by comparing the proposed one with conventional ones.

As real-time embedded systems are required to accommodate various tasks with different levels of criticality, scheduling algorithms for MC (Mixed-Criticality) systems have been widely studied in the real-time systems community. Most studies have focused on MC uniprocessor systems whereas there have been only a few studies to support MC multiprocessor systems. In particular, although the ZL (Zero-Laxity) policy has been known to an effective technique in improving the schedulability performance of base scheduling algorithms on SC (Single-Criticality) multiprocessor systems, the effectiveness of the ZL policy on MC multiprocessor systems has not been revealed to date. In this paper, we focus on realizing the potential of the ZL policy for MC multiprocessor systems, which is the first attempt. To this end, we design the ZL policy for MC multiprocessor systems, and apply the policy to EDF (Earliest Deadline First), yielding EDZL (Earliest Deadline first until Zero-Laxity) tailored for MC multiprocessor systems. Then, we develop a schedulability analysis for EDZL (as well as its base algorithm EDF) to support its timing guarantee. Our simulation results show a significant schedulability improvement of EDZL over EDF, demonstrating the effectiveness of the ZL policy for MC multiprocessor systems.