Mitsuki ITO Fujun HE Kento YOKOUCHI Eiji OKI
This paper proposes a robust optimization model for probabilistic protection under uncertain capacity demands to minimize the total required capacity against multiple simultaneous failures of physical machines. The proposed model determines both primary and backup virtual machine allocations simultaneously under the probabilistic protection guarantee. To express the uncertainty of capacity demands, we introduce an uncertainty set that considers the upper bound of the total demand and the upper and lower bounds of each demand. The robust optimization technique is applied to the optimization model to deal with two uncertainties: failure event and capacity demand. With this technique, the model is formulated as a mixed integer linear programming (MILP) problem. To solve larger sized problems, a simulated annealing (SA) heuristic is introduced. In SA, we obtain the capacity demands by solving maximum flow problems. Numerical results show that our proposed model reduces the total required capacity compared with the conventional model by determining both primary and backup virtual machine allocations simultaneously. We also compare the results of MILP, SA, and a baseline greedy algorithm. For a larger sized problem, we obtain approximate solutions in a practical time by using SA and the greedy algorithm.
This letter proposes a novel intelligent dynamic channel assignment (DCA) scheme with small-cells to improve the system performance for uplink machine-type communications (MTC) based on OFDMA-FDD. Outdoor MTC devices (OMDs) have serious interference from indoor MTC devices (IMDs) served by small-cell access points (SAPs) with frequency reuse. Thus, in the proposed DCA scheme, the macro base station (MBS) first measures the received signal strength from both OMDs and IMDs after setting the transmission power. Then, the MBS dynamically assigns subchannels to each SAP with consideration of strong interference from IMDs to the MBS. Through simulation results, it is shown that the proposed DCA scheme outperforms other schemes in terms of the capacity of OMDs and IMDs.
Jisoo KIM Seonjoo CHOI Jaesung LIM
In time difference of arrival-based signal source location estimation, geometrical errors are caused by the location of multiple unmanned aerial vehicles (UAV). Herein, we propose a divide-and-conquer algorithm to determine the optimal location for each UAV. Simulations results confirm that multiple UAVs shifted to an optimal position and the location accuracy improved.
Iuon-Chang LIN Chin-Chen CHANG Hsiao-Chi CHIANG
The prosperous Internet communication technologies have led to e-commerce in mobile computing and made Web of Things become popular. Electronic payment is the most important part of e-commerce, so many electronic payment schemes have been proposed. However, most of proposed schemes cannot give change. Based on proxy blind signatures, an e-cash payment system is proposed in this paper to solve this problem. This system can not only provide change divisibility through Web of Things, but also provide anonymity, verifiability, unforgeability and double-spending owner track.
Kaizhan LIN Fangguo ZHANG Chang-An ZHAO
Supersingular isogeny Diffie-Hellman (SIDH) is attractive for its relatively small public key size, but it is still unsatisfactory due to its efficiency, compared to other post-quantum proposals. In this paper, we focus on the performance of SIDH when the starting curve is E6 : y2 = x3 + 6x2 + x, which is fixed in Round-3 SIKE implementation. Inspired by previous works [1], [2], we present several tricks to accelerate key generation of SIDH and each process of SIKE. Our experimental results show that the performance of this work is at least 6.09% faster than that of the SIKE implementation, and we can further improve the performance when large storage is available.
The issue of copying values or references has historically been studied for managing memory objects, especially in distributed systems. In this paper, we explore a new topic on copying values v.s. references, for memory page compaction on virtualized systems. Memory page compaction moves target physical pages to a contiguous memory region at the operating system kernel level to create huge pages. Memory virtualization provides an opportunity to perform memory page compaction by copying the references of the physical pages. That is, instead of copying pages' values, we can move guest physical pages by changing the mappings of guest-physical to machine-physical pages. The goal of this paper is a quantitative comparison between value- and reference-based memory page compaction. To do so, we developed a software mechanism that achieves memory page compaction by appropriately updating the references of guest-physical pages. We prototyped the mechanism on Linux 4.19.29 and the experimental results show that the prototype's page compaction is up to 78% faster and achieves up to 17% higher performance on the memory-intensive real-world applications as compared to the default value-copy compaction scheme.
Xiuping PENG Mingshuo SHEN Hongbin LIN Shide WANG
This letter provides a direct construction of binary even-length Z-complementary pairs. To date, the maximum zero correlation zone ratio of Type-I Z-complementary pairs has reached 6/7, but no direct construction of Z-complementary pairs can achieve the zero correlation zone ratio of 6/7. In this letter, based on Boolean function, we give a direct construction of binary even-length Z-complementary pairs with zero correlation zone ratio 6/7. The length of constructed Z-complementary pairs is 2m+3 + 2m + 2+2m+1 and the width of zero correlation zone is 2m+3 + 2m+2.
Ruihua LIU Yin LI Ling ZOU Yude NI
Testing the radio frequency compatibility between Cn-band Satellite Navigation and Microwave Landing System (MLS) has included establishing a specific interference model and reporting the effect of such interference. This paper considers two interference scenarios according to the interfered system. By calculating the Power Flux Density (PFD) values, the interference for Cn-band satellite navigation downlink signal from several visible space stations on MLS service is evaluated. Simulation analysis of the interference for MLS DPSK-data word signal and scanning signal on Cn-band satellite navigation signal is based on the Spectral Separation Coefficient (SSC) and equivalent Carrier-to-Noise Ratio methodologies. Ground tests at a particular military airfield equipped with MLS ground stations were successfully carried out, and some measured data verified the theoretical and numerical results. This study will certainly benefit the design of Cn-band satellite navigation signals and guide the interoperability and compatibility research of Cn-band satellite navigation and MLS.
Tomoki SHIMIZU Kohei ITO Kensuke IIZUKA Kazuei HIRONAKA Hideharu AMANO
The multi-FPGA system known as, the Flow-in-Cloud (FiC) system, is composed of mid-range FPGAs that are directly interconnected by high-speed serial links. FiC is currently being developed as a server for multi-access edge computing (MEC), which is one of the core technologies of 5G. Because the applications of MEC are sometimes timing-critical, a static time division multiplexing (STDM) network has been used on FiC. However, the STDM network exhibits the disadvantage of decreasing link utilization, especially under light traffic. To solve this problem, we propose a hybrid router that combines packet switching for low-priority communication and STDM for high-priority communication. In our hybrid network, the packet switching uses slots that are unused by the STDM; therefore, best-effort communication by packet switching and QoS guarantee communication by the STDM can be used simultaneously. Furthermore, to improve each link utilization under a low network traffic load, we propose a dynamic communication switching algorithm. In our algorithm, each router monitors the network load metrics, and according to the metrics, timing-critical tasks select the STDM according to the metrics only when congestion occurs. This can achieve both QoS guarantee and efficient utilization of each link with a small resource overhead. In our evaluation, the dynamic algorithm was up to 24.6% faster on the execution time with a high network load compared to the packet switching on a real multi-FPGA system with 24 boards.
It has been widely recognized that in compressed sensing, many restricted isometry property (RIP) conditions can be easily obtained by using the null space property (NSP) with its null space constant (NSC) 0<θ≤1 to construct a contradicted method for sparse signal recovery. However, the traditional NSP with θ=1 will lead to conservative RIP conditions. In this paper, we extend the NSP with 0<θ<1 to a scale NSP, which uses a factor τ to scale down all vectors belonged to the Null space of a sensing matrix. Following the popular proof procedure and using the scale NSP, we establish more relaxed RIP conditions with the scale factor τ, which guarantee the bounded approximation recovery of all sparse signals in the bounded noisy through the constrained l1 minimization. An application verifies the advantages of the scale factor in the number of measurements.
Yiqi CHEN Ping WEI Gaiyou LI Huaguo ZHANG Hongshu LIAO
This paper considers tracking of a non-cooperative emitter based on a single sensor. To this end, the direct target motion analysis (DTMA) approach, where the target state is straightforwardly achieved from the received signal, is exploited. In order to achieve observability, the sensor has to perform a maneuver relative to the emitter. By suitably building an approximated likelihood function, the unscented Kalman filter (UKF), which is able to work under high nonlinearity of the measurement model, is adopted to recursively estimate the target state. Besides, the posterior Cramér-Rao bound (PCRB) of DTMA, which can be used as performance benchmark, is also achieved. The effectiveness of proposed method is verified via simulation experiments.
Hiroaki YAMAMOTO Ryosuke ODA Yoshihiro WACHI Hiroshi FUJIWARA
A searchable symmetric encryption (SSE) scheme is a method that searches encrypted data without decrypting it. In this paper, we address the substring search problem such that for a set D of documents and a pattern p, we find all occurrences of p in D. Here, a document and a pattern are defined as a string. A directed acyclic word graph (DAWG), which is a deterministic finite automaton, is known for solving a substring search problem on a plaintext. We improve a DAWG so that all transitions of a DAWG have distinct symbols. Besides, we present a space-efficient and secure substring SSE scheme using an improved DAWG. The proposed substring SSE scheme consists of an index with a simple structure, and the size is O(n) for the total size n of documents.
Yohei WATANABE Takeshi NAKAI Kazuma OHARA Takuya NOJIMA Yexuan LIU Mitsugu IWAMOTO Kazuo OHTA
Searchable symmetric encryption (SSE) enables clients to search encrypted data. Curtmola et al. (ACM CCS 2006) formalized a model and security notions of SSE and proposed two concrete constructions called SSE-1 and SSE-2. After the seminal work by Curtmola et al., SSE becomes an active area of encrypted search. In this paper, we focus on two unnoticed problems in the seminal paper by Curtmola et al. First, we show that SSE-2 does not appropriately implement Curtmola et al.'s construction idea for dummy addition. We refine SSE-2's (and its variants') dummy-adding procedure to keep the number of dummies sufficiently many but as small as possible. We then show how to extend it to the dynamic setting while keeping the dummy-adding procedure work well and implement our scheme to show its practical efficiency. Second, we point out that the SSE-1 can cause a search error when a searched keyword is not contained in any document file stored at a server and show how to fix it.
TongWei LU ShiHai JIA Hao ZHANG
At this stage, research in the field of Few-shot image classification (FSC) has made good progress, but there are still many difficulties in the field of Few-shot object detection (FSOD). Almost all of the current FSOD methods face catastrophic forgetting problems, which are manifested in that the accuracy of base class recognition will drop seriously when acquiring the ability to recognize Novel classes. And for many methods, the accuracy of the model will fall back as the class increases. To address this problem we propose a new memory-based method called Memorable Faster R-CNN (MemFRCN), which makes the model remember the categories it has already seen. Specifically, we propose a new tow-stage object detector consisting of a memory-based classifier (MemCla), a fully connected neural network classifier (FCC) and an adaptive fusion block (AdFus). The former stores the embedding vector of each category as memory, which enables the model to have memory capabilities to avoid catastrophic forgetting events. The final part fuses the outputs of FCC and MemCla, which can automatically adjust the fusion method of the model when the number of samples increases so that the model can achieve better performance under various conditions. Our method can perform well on unseen classes while maintaining the detection accuracy of seen classes. Experimental results demonstrate that our method outperforms other current methods on multiple benchmarks.
Various types of indices for estimating functional connectivity have been developed over the years that have introduced effective approaches to discovering complex neural networks in the brain. Two significant examples are the phase lag index (PLI) and transfer entropy (TE). Both indices have specific benefits; PLI, defined using instantaneous phase dynamics, achieves high spatiotemporal resolution, whereas transfer entropy (TE), defined using information flow, reveals directed network characteristics. However, the relationship between these indices remains unclear. In this study, we hypothesize that there exists a complementary relationship between PLI and TE to discover new aspects of functional connectivity that cannot be detected using either PLI or TE. To validate this hypothesis, we evaluated the synchronization in a coupled Rössler model using PLI and TE. Consequently, we proved the existence of non-linear relationships between PLI and TE. Both indexes exhibit a specific trend that demonstrates a linear relationship in the region of small TE values. However, above a specific TE value, PLI converges to a constant irrespective of the TE value. In addition to this relational difference in synchronization, there is another characteristic difference between these indices. Moreover, by virtue of its finer temporal resolution, PLI can capture the temporal variability of the degree of synchronization, which is called dynamical functional connectivity. TE lacks this temporal characteristic because it requires a longer evaluation period in this estimation process. Therefore, combining the advantages of both indices might contribute to revealing complex spatiotemporal functional connectivity in brain activity.
Tongwei LU Hao ZHANG Feng MIN Shihai JIA
Convolutional neural network (CNN) based vehicle re-identificatioin (ReID) inevitably has many disadvantages, such as information loss caused by downsampling operation. Therefore we propose a vision transformer (Vit) based vehicle ReID method to solve this problem. To improve the feature representation of vision transformer and make full use of additional vehicle information, the following methods are presented. (I) We propose a Quadratic Split Architecture (QSA) to learn both global and local features. More precisely, we split an image into many patches as “global part” and further split them into smaller sub-patches as “local part”. Features of both global and local part will be aggregated to enhance the representation ability. (II) The Auxiliary Information Embedding (AIE) is proposed to improve the robustness of the model by plugging a learnable camera/viewpoint embedding into Vit. Experimental results on several benchmarks indicate that our method is superior to many advanced vehicle ReID methods.
Kazuhisa HARAGUCHI Kosuke SANADA Hiroyuki HATANO Kazuo MORI
In wireless sensor networks (WSNs), wireless power transfer (WPT) has been studied as an energy-harvesting technique for prolonging their network lifetime. The WPT can supply power resources to sensor nodes (SNs) wirelessly, however, the reception (harvesting) power at SNs depends on their distance from a WPT equipment (WPTE), leading to the location-dependent non-uniformity in the reception power among SNs. For the fixed-located WPTE, SNs distant from the WPTE suffer from insufficient reception power. To handle this problem, this paper proposes a novel network structure introducing multiple hybrid access points (HAPs), which equip two functions of conventional cluster head function, including data collection and relay transmission, and WPT function. Then, these HAPs take terms providing both functions. By periodically rotating the HAP providing the WPT function, the location of the WPTE can be changed, which reduces the non-uniformity in the SN reception power. Also, this paper proposes a clustering scheme based on the residual power at SNs to reduce their power depletion under the proposed network structure. The evaluation results through computer simulation show that the proposed system reduces the non-uniformity in the SN reception power and the power depletion at the SNs and then improves the data collection rate, compared with the conventional systems.
Toshihiro ITO Shoji MATSUDA Yoshiya KASAHARA
Distributed array radars consist of multiple sub-arrays separated by tens to hundreds of wavelengths and can match narrow beamwidths with large-aperture, high-gain antennas. The physical independence of the sub-arrays contributes to significant structure flexibility and is one of the advantages of such radars. However, a typical problem is the grating lobes in the digital beam forming (DBF) beam pattern. Unfortunately, the need to suppress the generation of grating lobes makes the design of acceptable sub-array arrangements very difficult. A sigma-delta beam former direction of arrival (DOA) estimation method is proposed in this study to solve this problem. The proposed method performs DOA estimation by acquiring the difference signals in addition to the sum signals of all sub-arrays. The difference signal is typically used for monopulse DOA estimation in the phased array radar. The sigma-delta beamformer simultaneously has both advantages of DOA estimations using a distributed array with a large aperture length and using a sub-array that is not affected by the grating lobe. The proposed method can improve the DOA estimation accuracy over the conventional method under grating lobe situations and help the distributed array radar achieve flexibility in the sub-array arrangement. Numerical simulations are presented to verify the effectiveness of the proposed DOA estimation method.
Device-to-device (D2D) relay enhances the capacity of a mobile network. If the channel quality of a user equipment (UE) is bad, the UE asks a neighbor to get its data from the base station and forward the data to it by using D2D communication. Since cellular and D2D communication can share spectrum resources, the spectral efficiency will rise. As UEs are owned by self-interested users, they may not provide relay services gratis. Thus, some incentive methods let UEs exchange tokens to buy and sell relay services. However, they assume that each relay service is worth one token and offers a fixed data rate, which lacks flexibility. Through the law of supply and demand, this paper proposes an economy aware token-based incentive (EAT-BI) strategy. A supplier (i.e., the service provider) charges different prices for its relay service with different rates. A consumer (i.e., the service requestor) takes different policies to choose a supplier based on its tokens and may bargain with suppliers to avoid starvation. Simulation results show that EAT-BI can efficiently promote D2D relay use and increase throughput under different mobility models of UEs.
Kazuhito MATSUDA Kouji KURIHARA Kentaro KAWAKAMI Masafumi YAMAZAKI Fuyuka YAMADA Tsuguchika TABARU Ken YOKOYAMA
Statical causal discovery is an approach to infer the causal relationship between observed variables whose causalities are not revealed. LiNGAM (Linear Non-Gaussian Acyclic Model), an algorithm for causal discovery, can calculate the causal relationship uniquely if the independent components of variables are assumed to be non-Gaussian. However, use-cases of LiNGAM are limited because of its O(d3x) computational complexity, where dx is the number of variables. This paper shows two approaches to accelerate LiNGAM causal discovery: SIMD utilization for LiNGAM's mathematical matrixes operations and MPI parallelization. We evaluate the implementation with the supercomputer Fugaku. Using 96 nodes of Fugaku, our improved version can achieve 17,531 times faster than the original OSS implementation (completed in 17.7 hours).