Mohammed BALAL SIDDIQUI Mirza TARIQ BEG Syed NASEEM AHMAD
Binary Decision Diagrams (BDDs) are an important data structure for the design of digital circuits using VLSI CAD tools. The ordering of variables affects the total number of nodes and path length in the BDDs. Finding a good variable ordering is an optimization problem and previously many optimization approaches have been implemented for BDDs in a number of research works. In this paper, an optimization approach based on Spider Monkey Optimization (SMO) algorithm is proposed for the BDD variable ordering problem targeting number of nodes and longest path length. SMO is a well-known swarm intelligence-based optimization approach based on spider monkeys foraging behavior. The proposed work has been compared with other latest BDD reordering approaches using Particle Swarm Optimization (PSO) algorithm. The results obtained show significant improvement over the Particle Swarm Optimization method. The proposed SMO-based method is applied to different benchmark digital circuits having different levels of complexities. The node count and longest path length for the maximum number of tested circuits are found to be better in SMO than PSO.
Quanxin MA Xiaolin DU Jianbo LI Yang JING Yuqing CHANG
The estimation problem of structured clutter covariance matrix (CCM) in space-time adaptive processing (STAP) for airborne radar systems is studied in this letter. By employing the prior knowledge and the persymmetric covariance structure, a new estimation algorithm is proposed based on the whitening ability of the covariance matrix. The proposed algorithm is robust to prior knowledge of different accuracy, and can whiten the observed interference data to obtain the optimal solution. In addition, the extended factored approach (EFA) is used in the optimization for dimensionality reduction, which reduces the computational burden. Simulation results show that the proposed algorithm can effectively improve STAP performance even under the condition of some errors in prior knowledge.
Zixiao ZHANG Fujun HE Eiji OKI
This paper introduces a deep reinforcement learning approach to solve the virtual network function scheduling problem in dynamic scenarios. We formulate an integer linear programming model for the problem in static scenarios. In dynamic scenarios, we define the state, action, and reward to form the learning approach. The learning agents are applied with the asynchronous advantage actor-critic algorithm. We assign a master agent and several worker agents to each network function virtualization node in the problem. The worker agents work in parallel to help the master agent make decision. We compare the introduced approach with existing approaches by applying them in simulated environments. The existing approaches include three greedy approaches, a simulated annealing approach, and an integer linear programming approach. The numerical results show that the introduced deep reinforcement learning approach improves the performance by 6-27% in our examined cases.
Takeshi MIYAMAE Fumihiko KOZAKURA Makoto NAKAMURA Masanobu MORINAGA
The total number of solar power-producing facilities whose Feed-in Tariff (FIT) Program-based ten-year contracts will expire by 2023 is expected to reach approximately 1.65 million in Japan. If the facilities that produce or consume renewable energy would increase to reach a large number, e.g., two million, blockchain would not be capable of processing all the transactions. In this work, we propose a blockchain-based electricity-tracking platform for renewable energy, called ‘ZGridBC,’ which consists of mutually cooperative two novel decentralized schemes to solve scalability, storage cost, and privacy issues at the same time. One is the electricity production resource management, which is an efficient data management scheme that manages electricity production resources (EPRs) on the blockchain by using UTXO tokens extended to two-dimension (period and electricity amount) to prevent double-spending. The other is the electricity-tracking proof, which is a massive data aggregation scheme that significantly reduces the amount of data managed on the blockchain by using zero-knowledge proof (ZKP). Thereafter, we illustrate the architecture of ZGridBC, consider its scalability, security, and privacy, and illustrate the implementation of ZGridBC. Finally, we evaluate the scalability of ZGridBC, which handles two million electricity facilities with far less cost per environmental value compared with the price of the environmental value proposed by METI (=0.3 yen/kWh).
For dichromats to receive the information represented in color images, it is important to study contrast improvement methods and quantitative evaluation indices of color conversion results. There is an index to evaluate the degree of contrast improvement and in this index, the contrast for dichromacy caused by the lightness component is given importance. In addition, random sampling was introduced in the computation of this index. Although the validity of the index has been shown through comparison with a subjective evaluation, it is considered that the following two points should be examined. First, should contrast for normal trichromacy caused by the lightness component also be attached importance. Second, the influence of random sampling should be examined in detail. In this paper, a new index is proposed and the above-mentioned points are examined. For the first point, the following is revealed through experiment. Consideration of the contrast for normal trichromacy caused by a lightness component that is the same as that for dichromacy may or may not result in a good outcome. The evaluation performance of the proposed index is equivalent to that of the previous index overall. It can be said that the proposed index is superior to the previous one in terms of the unity of evaluating contrast. For the second point, the computation time and the evaluation of significant digits are shown. In this paper, a sampling number such that the number of significant digits can be considered as three is used. In this case, the variation caused by random sampling is negligible compared with the range of the proposed index, whereas the computation time is about one-seventh that when the sampling is not adopted.
Soma YASUI Fujio OHISHI Hiroaki USUI
Thin films of Teflon AF 1600 were prepared by an electron-assisted (e-assist) deposition method. IR analysis revealed that the e-assist deposition generates small amount of polar groups such as carboxylic acid in the molecular structure of the deposited films. The polar groups contributed to increase intermolecular interaction and led to remarkable improvement in the adhesion strength and robustness of the films especially when a bias voltage was applied to the substrate in the course of e-assist deposition. The vapor-deposited Teflon AF films had refractive indices of 1.35 to 1.38, and were effective for antireflection coatings. The use of e-assist deposition slightly increased the refractive index as a trade-off for the improvement of film robustness.
Shohei SAKURAI Mayu IIDA Kosei OKUNUKI Masahito KUSHIDA
In this study, vertically aligned carbon nanotubes (VA-CNTs) were grown from filler-added LB films with accumulated AlFe2O4 nanoparticles and palmitic acid (C16) as the filler molecule after different hydrogen reduction temperatures of 500°C and 750°C, and the grown VA-CNTs were compared and evaluated. As a result, VA-CNTs were approximately doubled in length after 500°C hydrogen reduction compared to 750°C hydrogen reduction when AlFe2O4 NPs were used. On the other hand, when the catalyst area ratio was decreased by using palmitic acid, i.e., the distance between CNTs was increased, VA-CNTs rapidly shortened after 500°C hydrogen reduction, and VA-CNTs were no longer obtained even in the range where VA-CNTs were obtained in 750°C hydrogen reduction. The inner and outer diameters of VA-CNTs decreased with decreasing catalyst area ratio at 750°C hydrogen reduction and tended to increase at 500°C hydrogen reduction. The morphology of the catalyst nanoparticles after CVD was observed to change significantly depending on the hydrogen reduction temperature and catalyst area ratio. These observations indicate that the state of the catalyst nanoparticles immediately before the CNT growth process greatly affects the physical properties of the CNTs.
Daichi WATARI Ittetsu TANIGUCHI Francky CATTHOOR Charalampos MARANTOS Kostas SIOZIOS Elham SHIRAZI Dimitrios SOUDRIS Takao ONOYE
Energy management in buildings is vital for reducing electricity costs and maximizing the comfort of occupants. Excess solar generation can be used by combining a battery storage system and a heating, ventilation, and air-conditioning (HVAC) system so that occupants feel comfortable. Despite several studies on the scheduling of appliances, batteries, and HVAC, comprehensive and time scalable approaches are required that integrate such predictive information as renewable generation and thermal comfort. In this paper, we propose an thermal-comfort aware online co-scheduling framework that incorporates optimal energy scheduling and a prediction model of PV generation and thermal comfort with the model predictive control (MPC) approach. We introduce a photovoltaic (PV) energy nowcasting and thermal-comfort-estimation model that provides useful information for optimization. The energy management problem is formulated as three coordinated optimization problems that cover fast and slow time-scales by considering predicted information. This approach reduces the time complexity without a significant negative impact on the result's global nature and its quality. Experimental results show that our proposed framework achieves optimal energy management that takes into account the trade-off between electricity expenses and thermal comfort. Our sensitivity analysis indicates that introducing a battery significantly improves the trade-off relationship.
Shuntaro TAKEKUMA Shun-ichi AZUMA Ryo ARIIZUMI Toru ASAI
A hopping rover is a robot that can move in low gravity planets by the characteristic motion called the hopping motion. For its autonomous explorations, the so-called SLAM (Simultaneous Localization and Mapping) is a basic function. SLAM is the combination of estimating the position of a robot and creating a map of an unknown environment. Most conventional methods of SLAM are based on odometry to estimate the position of the robot. However, in the case of the hopping rover, the error of odometry becomes considerably large because its hopping motion involves unpredictable bounce on the rough ground on an unexplored planet. Motivated by the above discussion, this paper addresses a problem of finding an optimal movement of the hopping rover for the estimation performance of the SLAM. For the problem, we first set the model of the SLAM system for the hopping rover. The problem is formulated as minimizing the expectation of the estimation error at a pre-specified time with respect to the sequence of control inputs. We show that the optimal input sequence tends to force the final position to be not at the landmark but in front of the landmark, and furthermore, the optimal input sequence is constant on the time interval for optimization.
Jeyoen KIM Takumi SOMA Tetsuya MANABE Aya KOJIMA
This paper attempts to identify which side of the road a bicycle is currently riding on using a common camera for realizing an advanced bicycle navigation system and bicycle riding safety support system. To identify the roadway area, the proposed method performs semantic segmentation on a front camera image captured by a bicycle drive recorder or smartphone. If the roadway area extends from the center of the image to the right, the bicyclist is riding on the left side of the roadway (i.e., the correct riding position in Japan). In contrast, if the roadway area extends to the left, the bicyclist is on the right side of the roadway (i.e., the incorrect riding position in Japan). We evaluated the accuracy of the proposed method on various road widths with different traffic volumes using video captured by riding bicycles in Tsuruoka City, Yamagata Prefecture, and Saitama City, Saitama Prefecture, Japan. High accuracy (>80%) was achieved for any combination of the segmentation model, riding side identification method, and experimental conditions. Given these results, we believe that we have realized an effective image segmentation-based method to identify which side of the roadway a bicycle riding is on.
Fengde JIA Jihong TAN Xiaochen LU Junhui QIAN
Short-range ambiguous clutter can seriously affect the performance of airborne radar target detection when detecting long-range targets. In this letter, a multiple-input-multiple-output (MIMO) array structure elevation filter (EF) is designed to suppress short-range clutter (SRC). The sidelobe level value in the short-range clutter region is taken as the objective function to construct the optimization problem and the optimal EF weight vector can be obtained by using the convex optimization tool. The simulation results show that the MIMO system can achieve better range ambiguous clutter suppression than the traditional phased array (PA) system.
Yuri KANAZAWA Prasoon AMBALATHANKANDY Masayuki IKEBE
We have developed a Si-CMOS terahertz image sensor to address the paucity of low-cost terahertz detectors. Our imaging pixel directly connects to a VCO-based ADC and achieves pixel parallel ADC architecture for high-speed global shutter THz imaging. In this paper, we propose a digital calibration technique for offset and gain variation of each pixel using global shutter operation. The calibration technique gives reference signal to all pixels simultaneously and takes reference frames as a part of the high-speed image captures. Using this technique, we achieve offset/non-linear gain variation suppression of 85.7% compared to without correction.
Masaki AIDA Takumi SAKIYAMA Ayako HASHIZUME Chisa TAKANO
The problem caused by fake news continues to worsen in today's online social networks. Intuitively, it seems effective to issue corrections as a countermeasure. However, corrections can, ironically, strengthen attention to fake news, which worsens the situation. This paper proposes a model for describing the interaction between fake news and the corrections as a reaction-diffusion system; this yields the mechanism by which corrections increase attention to fake news. In this model, the emergence of groups of users who believe in fake news is understood as a Turing pattern that appears in the activator-inhibitor model. Numerical calculations show that even if the network structure has no spatial bias, the interaction between fake news and the corrections creates groups that are strongly interested in discussing fake news. Also, we propose and evaluate a basic strategy to counter fake news.
Ryusuke IGARASHI Ryo NAKAGAWA Dan OKOCHI Yukio OGAWA Mianxiong DONG Kaoru OTA
Vehicles on the road are expected to connect continuously to the Internet at sufficiently high speeds, e.g., several Mbps or higher, to support multimedia applications. However, even when passing through a well-facilitated city area, Internet access can be unreliable and even disconnected if the travel speed is high. We therefore propose a network path selection technique to meet network throughput requirements. The proposed technique is based on the attractor selection model and enables vehicles to switch the path from a route connecting directly to a cellular network to a relay type through neighboring vehicles for Internet access. We also develop a mechanism that prevents frequent path switching when the performance of all available paths does not meet the requirements. We conduct field evaluations by platooning two vehicles in a real-world driving environment and confirm that the proposed technique maintains the required throughput of up to 7Mbps on average. We also evaluated our proposed technique by extensive computer simulations of up to 6 vehicles in a platoon. The results show that increasing platoon length yields a greater improvement in throughput, and the mechanism we developed decreases the rate of path switching by up to 25%.
Sachiko KANAMORI Hirotsune SATO Naoya TABATA Ryo NOJIMA
To protect user privacy and establish self-information control rights, service providers must notify users of their privacy policies and obtain their consent in advance. The frameworks that impose these requirements are mandatory. Although originally designed to protect user privacy, obtaining user consent in advance has become a mere formality. These problems are induced by the gap between service providers' privacy policies, which prioritize the observance of laws and guidelines, and user expectations which are to easily understand how their data will be handled. To reduce this gap, we construct a tool supporting users in reading privacy policies in Japanese. We designed the tool to present users with separate unique expressions containing relevant information to improve the display format of the privacy policy and render it more comprehensive for Japanese users. To accurately extract the unique expressions from privacy policies, we created training data for machine learning for the constructed tool. The constructed tool provides a summary of privacy policies for users to help them understand the policies of interest. Subsequently, we assess the effectiveness of the constructed tool in experiments and follow-up questionnaires. Our findings reveal that the constructed tool enhances the users' subjective understanding of the services they read about and their awareness of the related risks. We expect that the developed tool will help users better understand the privacy policy content and and make educated decisions based on their understanding of how service providers intend to use their personal data.
Tomoaki MIMOTO Hiroyuki YOKOYAMA Toru NAKAMURA Takamasa ISOHARA Masayuki HASHIMOTO Ryosuke KOJIMA Aki HASEGAWA Yasushi OKUNO
Differential privacy is a confidentiality metric and quantitatively guarantees the confidentiality of individuals. A noise criterion, called sensitivity, must be calculated when constructing a probabilistic disturbance mechanism that satisfies differential privacy. Depending on the statistical process, the sensitivity may be very large or even impossible to compute. As a result, the usefulness of the constructed mechanism may be significantly low; it might even be impossible to directly construct it. In this paper, we first discuss situations in which sensitivity is difficult to calculate, and then propose a differential privacy with additional dummy data as a countermeasure. When the sensitivity in the conventional differential privacy is calculable, a mechanism that satisfies the proposed metric satisfies the conventional differential privacy at the same time, and it is possible to evaluate the relationship between the respective privacy parameters. Next, we derive sensitivity by focusing on correlation coefficients as a case study of a statistical process for which sensitivity is difficult to calculate, and propose a probabilistic disturbing mechanism that satisfies the proposed metric. Finally, we experimentally evaluate the effect of noise on the sensitivity of the proposed and direct methods. Experiments show that privacy-preserving correlation coefficients can be derived with less noise compared to using direct methods.
Shun TAKAGI Yang CAO Yasuhito ASANO Masatoshi YOSHIKAWA
In recent years, concerns about location privacy are increasing with the spread of location-based services (LBSs). Many methods to protect location privacy have been proposed in the past decades. Especially, perturbation methods based on Geo-Indistinguishability (GeoI), which randomly perturb a true location to a pseudolocation, are getting attention due to its strong privacy guarantee inherited from differential privacy. However, GeoI is based on the Euclidean plane even though many LBSs are based on road networks (e.g. ride-sharing services). This causes unnecessary noise and thus an insufficient tradeoff between utility and privacy for LBSs on road networks. To address this issue, we propose a new privacy notion, Geo-Graph-Indistinguishability (GeoGI), for locations on a road network to achieve a better tradeoff. We propose Graph-Exponential Mechanism (GEM), which satisfies GeoGI. Moreover, we formalize the optimization problem to find the optimal GEM in terms of the tradeoff. However, the computational complexity of a naive method to find the optimal solution is prohibitive, so we propose a greedy algorithm to find an approximate solution in an acceptable amount of time. Finally, our experiments show that our proposed mechanism outperforms GeoI mechanisms, including optimal GeoI mechanism, with respect to the tradeoff.
Longjiao ZHAO Yu WANG Jien KATO Yoshiharu ISHIKAWA
Convolutional Neural Networks (CNNs) have recently demonstrated outstanding performance in image retrieval tasks. Local convolutional features extracted by CNNs, in particular, show exceptional capability in discrimination. Recent research in this field has concentrated on pooling methods that incorporate local features into global features and assess the global similarity of two images. However, the pooling methods sacrifice the image's local region information and spatial relationships, which are precisely known as the keys to the robustness against occlusion and viewpoint changes. In this paper, instead of pooling methods, we propose an alternative method based on local similarity, determined by directly using local convolutional features. Specifically, we first define three forms of local similarity tensors (LSTs), which take into account information about local regions as well as spatial relationships between them. We then construct a similarity CNN model (SCNN) based on LSTs to assess the similarity between the query and gallery images. The ideal configuration of our method is sought through thorough experiments from three perspectives: local region size, local region content, and spatial relationships between local regions. The experimental results on a modified open dataset (where query images are limited to occluded ones) confirm that the proposed method outperforms the pooling methods because of robustness enhancement. Furthermore, testing on three public retrieval datasets shows that combining LSTs with conventional pooling methods achieves the best results.
Meng ZHAO Junfeng WU Hong YU Haiqing LI Jingwen XU Siqi CHENG Lishuai GU Juan MENG
Accurate fish detection is of great significance in aquaculture. However, the non-uniform strong reflection in aquaculture ponds will affect the precision of fish detection. This paper combines YOLOv4 and CVAE to accurately detect fishes in the image with non-uniform strong reflection, in which the reflection in the image is removed at first and then the reflection-removed image is provided for fish detecting. Firstly, the improved YOLOv4 is applied to detect and mask the strong reflective region, to locate and label the reflective region for the subsequent reflection removal. Then, CVAE is combined with the improved YOLOv4 for inferring the priori distribution of the Reflection region and restoring the Reflection region by the distribution so that the reflection can be removed. For further improving the quality of the reflection-removed images, the adversarial learning is appended to CVAE. Finally, YOLOV4 is used to detect fishes in the high quality image. In addition, a new image dataset of pond cultured takifugu rubripes is constructed,, which includes 1000 images with fishes annotated manually, also a synthetic dataset including 2000 images with strong reflection is created and merged with the generated dataset for training and verifying the robustness of the proposed method. Comprehensive experiments are performed to compare the proposed method with the state-of-the-art fish detecting methods without reflection removal on the generated dataset. The results show that the fish detecting precision and recall of the proposed method are improved by 2.7% and 2.4% respectively.
Qingjuan ZHANG Shanqi PANG Yuan LI
Variable strength orthogonal array, as a special form of variable strength covering array, plays an important role in computer software testing and cryptography. In this paper, we study the construction of variable strength orthogonal arrays with strength two containing strength greater than two by Galois field and construct some variable strength orthogonal arrays with strength l containing strength greater than l by Fan-construction.