In this work, we provide the first practical secure email filtering scheme based on homomorphic encryption. Specifically, we construct a secure naïve Bayesian filter (SNBF) using the Paillier scheme, a partially homomorphic encryption (PHE) scheme. We first show that SNBF can be implemented with only the additive homomorphism, thus eliminating the need to employ expensive fully homomorphic schemes. In addition, the design space for specialized hardware architecture realizing SNBF is explored. We utilize a recursive Karatsuba Montgomery structure to accelerate the homomorphic operations, where multiplication of 2048-bit integers are carried out. Through the experiment, both software and hardware versions of the SNBF are implemented. On software, 104-105x runtime and 103x storage reduction are achieved by SNBF, when compared to existing fully homomorphic approaches. By instantiating the designed hardware for SNBF, a further 33x runtime and 1919x power reduction are achieved. The proposed hardware implementation classifies an average-length email in under 0.5s, which is much more practical than existing solutions.

This paper proposes a Petri net based mathematical programming approach to combinatorial optimization, in which we generate integer linear programming problems from Petri net models instead of the direct mathematical formulation. We treat two types of combinatorial optimization problems, ordinary problems and time-dependent problems. Firstly, we present autonomous Petri net modeling for ordinary optimization problems, where we obtain fundamental constraints derived from Petri net properties and additional problem-specific ones. Secondly, we propose a colored timed Petri net modeling approach to time-dependent problems, where we generate variables and constraints for time management and for resolving conflicts. Our Petri net approach can drastically reduce the difficulty of the mathematical formulation in a sense that (1) the Petri net modeling does not require deep knowledge of mathematical programming and technique of integer linear model formulations, (2) our automatic formulation allows us to generate large size of integer linear programming problems, and (3) the Petri net modeling approach is flexible for input parameter changes of the original problem.

This paper proposes a new design criterion of adaptively scaled belief (ASB) in Gaussian belief propagation (GaBP) for large multi-user multi-input multi-output (MU-MIMO) detection. In practical MU detection (MUD) scenarios, the most vital issue for improving the convergence property of GaBP iterative detection is how to deal with belief outliers in each iteration. Such outliers are caused by modeling errors due to the fact that the law of large number does not work well when it is difficult to satisfy the large system limit. One of the simplest ways to mitigate the harmful impact of outliers is belief scaling. A typical approach for determining the scaling parameter for the belief is to create a look-up table (LUT) based on the received signal-to-noise ratio (SNR) through computer simulations. However, the instantaneous SNR differs among beliefs because the MIMO channels in the MUD problem are random; hence, the creation of LUT is infeasible. To stabilize the dynamics of the random MIMO channels, we propose a new transmission block based criterion that adapts belief scaling to the instantaneous channel state. Finally, we verify the validity of ASB in terms of the suppression of the bit error rate (BER) floor.

Coil-shaped structures are proposed to enhance sensitivity and spatial resolution for EMI near-field probe. This design yields a high sensitivity and a good spatial resolution to find the EMI source in near-field region. Both characteristics are crucial to diagnosis of emissions from electrical and electronic devices. The new design yields a superior sensitivity, which is in general 15 dB greater than conventional probes. This new probe helps practitioners to quickly and correctly locate noise emission source areas on printed circuit boards and devices. Two prototypes of different sizes were fabricated. The larger one provides a high sensitivity while the smaller one can pinpoint emission source locations. The new probe design also has an orientation invariance feature. Its noise response levels are similar for all probe directions. This characteristic can help reduced the probability at miss-detection since sensitivity is largely invariant to its orientation. Extensive measurements were performed to verify the operation mechanism and to assess probe characteristics. It suits well to the electromagnetic interference problem diagnosis.

This paper proposes a consensus-based subgradient method under a common constraint set with switching undirected graphs. In the proposed method, each agent has a state and an auxiliary variable as the estimates of an optimal solution and accumulated information of past gradients of neighbor agents. We show that the states of all agents asymptotically converge to one of the optimal solutions of the convex optimization problem. The simulation results show that the proposed consensus-based algorithm with accumulated subgradient information achieves faster convergence than the standard subgradient algorithm.

This paper proposes a novel distributed proximal minimization algorithm for constrained optimization problems over fixed strongly connected networks. At each iteration, each agent updates its own state by evaluating a proximal operator of its objective function under a constraint set and compensating the unbalancing due to unidirectional communications. We show that the states of all agents asymptotically converge to one of the optimal solutions. Numerical results are shown to confirm the validity of the proposed method.

In this paper, based on the policy of model predictive control, a new method of predictive pinning control is proposed for the consensus problem of multi-agent systems. Pinning control is a method that the external control input is added to some agents (pinning nodes), e.g., leaders. By the external control input, consensus to a certain target value (not the average of the initial states) and faster consensus are achieved. In the proposed method, the external control input is calculated by the controller node connected to only pinning nodes. Since the states of all agents are required in calculation of the external control input, communication delays must be considered. The proposed algorithm includes not only calculation of the external control input but also delay compensation. The effectiveness of the proposed method is presented by a numerical example.

Electrophoretic deposition (EPD) usingpolydimethylsiloxane(PDMS)-based organic-inorganic hybrid materials as binders can be used to prepare alumina-binder composites on metal substrates. Herein, we investigated the deposition mechanism of PDMS-based polymers. The composition and porosity of EPD composites can be controlled by adjusting the EPD condition, and shape of alumina particles.

We have developed the flexible dual-gate OFET based pressure sensor using a thin polyethylene naphthalate (PEN, 25 µm) film as a substrate. The performance was equivalent to that fabricated on the glass substrate, and it could also be used on the curved surface. Drain current in the flexible pressure sensor was increased according to the pressure load without application of gate voltage. The magnitude of the change in drain current with respect to pressure application was about 2.5 times larger than that for the device on the glass substrate.

The k-edge-connectivity augmentation problem for a specified set of vertices (kECA-SV for short) is defined by “Given a graph G=(V, E) and a subset Γ ⊆ V, find a minimum set E' of edges such that G'=(V, E ∪ E') has at least k edge-disjoint paths between any pair of vertices in Γ.” Let σ be the edge-connectivity of Γ (that is, G has at least σ edge-disjoint paths between any pair of vertices in Γ). We propose an algorithm for (σ+1)ECA-SV which is done in O(|Γ|) maximum flow operations. Then the time complexity is O(σ2|Γ||V|+|E|) if a given graph is sparse, or O(|Γ||V||BG|log(|V|2/|BG|)+|E|) if dense, where |BG| is the number of pairs of adjacent vertices in G. Also mentioned is an O(|V||E|+|V|2 log |V|) time algorithm for a special case where σ is equal to the edge-connectivity of G and an O(|V|+|E|) time one for σ ≤ 2.

Large-scale distributed antenna systems (LS-DASs) are gaining increasing interest and emerging as highly promising candidates for future wireless communications. To improve the user's quality of service (QoS) in these systems, this study proposes a user cooperation aided clustering approach based on device-centric architectures; it enables multi-user multiple-input multiple-output transmissions with non-reciprocal setups. We actively use device-to-device communication techniques to achieve the sharing of user information and try to form clusters on user side instead of the traditional way that performs clustering on base station (BS) side in data offloading. We further adopt a device-centric architecture to break the limits of the classical BS-centric cellular structure. Moreover, we derive an approximate expression to calculate the user rate for LS-DASs with employment of zero-forcing precoding and consideration of inter-cluster interference. Numerical results indicate that the approximate expression predicts the user rate with a lower computational cost than is indicated by computer simulation, and the proposed approach provides better user experience for, in particular, the users who have unacceptable QoS.

When time difference of arrival (TDOA)-based bearing measurements are used in passive triangulation, the accuracy of localization depends on the geometric relationship between the emitter and the sensors. In particular, the localization accuracy varies with the geometric conditions in TDOA-based direction finding (DF) for bearing measurement and lines of bearing (LOBs) crossing for triangulation. To obtain an accurate estimate in passive triangulation using TDOA-based bearing measurements, we shall use these bearings selectively by considering geometric dilution of precision (GDOP) between the emitter and the sensors. To achieve this goal, we first define two GDOPs related to TDOA-based DF and LOBs crossing geometries, and then propose a new hybrid GDOP by combining these GDOPs for a better selection of bearings. Subsequently, two bearings with the lowest hybrid GDOP condition are chosen as the inputs to a triangulation localization algorithm. In simulations, the proposed method shows its enhancement to the localization accuracy.

The gap states of tetratetracontane (C44H90; TTC), which is a model oligomer of polyethylene, was examined by using high-sensitivity UV photoemission spectroscopy (HS-UPS). The high sensitivity enabled us to directly observe the weak gap states distributed in the HOMO-LUMO gap from the valence band top to 3.0 eV below the vacuum level. On the basis of the density-of-states derived from UPS results, the tribocharging nature of polyethylene was discussed in comparison with our previous result for nylon-6,6 film.

This letter proposes a new face sketch recognition method. Given a query sketch and face photos in a database, the proposed method first synthesizes pseudo sketches by computing the locality sensitive histogram and dense illumination invariant features from the resized face photos, then extracts discriminative features by computing histogram of averaged oriented gradients on the query sketch and pseudo sketches, and finally find a match with the shortest cosine distance in the feature space. It achieves accuracy comparable to the state-of-the-art while showing much more robustness than the existing face sketch recognition methods.

On surfaces of tris-(8-hydroxyquinolate) aluminum (Alq) and tris(7-propyl-8-hydroxyquinolinato) aluminum (Al7p) thin-films, positive and negative polarization charges appear, respectively, owing to spontaneous orientation of these polar molecules. Alq is a typical electron transport material where electrons are injected from cathode. Because the polarization charge exists at the Alq/cathode interface, it is likely that it affects the electron injection process because of Coulomb interaction. In order to evaluate an impact of polarization charge on electron injection from cathode, electron only devices (EODs) composed of Alq or Al7p were prepared and evaluated by displacement current measurement. We found that Alq-EOD has lower resistance than Al7p-EOD, indicating that the positive polarization charge at Alq/cathode interface enhances the electron injection due to Coulomb attraction, while the electron injection is suppressed by the negative polarization charge at the Al7p/Al interface. These results clearly suggest that it is necessary to design organic semiconductor devices by taking polarization charge into account.

Saliency detection is widely used in many vision tasks like image retrieval, compression and person re-identification. The deep-learning methods have got great results but most of them focused more on the performance ignored the efficiency of models, which were hard to transplant into other applications. So how to design a efficient model has became the main problem. In this letter, we propose parallel feature network, a saliency model which is built on convolution neural network (CNN) by a parallel method. Parallel dilation blocks are first used to extract features from different layers of CNN, then a parallel upsampling structure is adopted to upsample feature maps. Finally saliency maps are obtained by fusing summations and concatenations of feature maps. Our final model built on VGG-16 is much smaller and faster than existing saliency models and also achieves state-of-the-art performance.

In this letter, a construction of asymmetric Gaussian integer zero correlation zone (ZCZ) sequence sets is presented based on interleaving and filtering. The proposed approach can provide optimal or almost optimal single Gaussian integer ZCZ sequence sets. In addition, arbitrary two sequences from different sets have inter-set zero cross-correlation zone (ZCCZ). The resultant sequence sets can be used in the multi-cell QS-CDMA system to reduce the inter-cell interference and increase the transmission data.

Modern file systems, such as ext4, btrfs, and XFS, are evolving and enable the introduction of new features to meet ever-changing demands and improve reliability. File system developers are struggling to eliminate all software bugs, but the operating system community points out that file systems are a hotbed of critical software bugs. This paper analyzes the code coverage of xfstests, a widely used suite of file system tests, on three major file systems (ext4, btrfs, and XFS). The coverage is 72.34%, and the uncovered code runs into 23,232 lines of code. To understand why the code coverage is low, the uncovered code is manually examined line by line. We identified three major causes, peculiar to file systems, that hinder higher coverage. First, covering all the features is difficult because each file system provides a wide variety of file-system specific features, and some features can be tested only on special storage devices. Second, covering all the execution paths is difficult because they depend on file system configurations and internal on-disk states. Finally, the code for maintaining backward-compatibility is executed only when a file system encounters old formats. Our findings will help file system developers improve the coverage of test suites and provide insights into fostering the development of new methodologies for testing file systems.

In this paper, a surveillance system by multiple agents, which is called a multi-agent surveillance system, is studied. A surveillance area is given by an undirected connected graph. Then, the optimal control problem for multi-agent surveillance systems (the optimal surveillance problem) is to find trajectories of multiple agents that travel each node as evenly as possible. In our previous work, this problem is reduced to a mixed integer linear programming problem. However, the computation time for solving it exponentially grows with the number of agents. To overcome this technical issue, a new model predictive control method for multi-agent surveillance systems is proposed. First, a procedure of individual optimization, which is a kind of approximate solution methods, is proposed. Next, a method to improve the control performance is proposed. In addition, an event-triggering condition is also proposed. The effectiveness of the proposed method is presented by a numerical example.

This paper presents a simple method for comparing the impedance of an artificial mains network (AMN) with the International Special Committee on Radio Interference (CISPR) 16-1-2 standard. The circuit of a vector network analyzer, which is an impedance measurement instrument, is not ideal, and the measured impedances include measurement uncertainties. However, complete uncertainty analysis is not required in the proposed method. By comparing the relative relationship between the measured impedance of an AMN under test and the measured impedance of the original transfer standards whose impedance is modeled by the regulated impedance in the CISPR 16-1-2 standard, conformity to the standard can be determined. The magnitude and phase of the impedance of an AMN can be independently analyzed. To demonstrate the method, we apply it to a commercially available AMN. The comparison result is found to be equivalent to the result based on a complete uncertainty analysis, which confirms that the proposed comparison method is feasible.