Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences最新文献_第6页

A Small-data Solution to Data-driven Lyapunov Equations: Data Reduction from O(n2) to O(n) 数据驱动的李雅普诺夫方程的小数据解:从 o>/i>(n< 2)到O(n)

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023map0010

Keitaro TSUJI, Shun-ichi AZUMA, Ikumi BANNO, Ryo ARIIZUMI, Toru ASAI, Jun-ichi IMURA

{"title":"A Small-data Solution to Data-driven Lyapunov Equations: Data Reduction from O(n2) to O(n)","authors":"Keitaro TSUJI, Shun-ichi AZUMA, Ikumi BANNO, Ryo ARIIZUMI, Toru ASAI, Jun-ichi IMURA","doi":"10.1587/transfun.2023map0010","DOIUrl":"https://doi.org/10.1587/transfun.2023map0010","url":null,"abstract":"When a mathematical model is not available for a dynamical system, it is reasonable to use a data-driven approach for analysis and control of the system. With this motivation, the authors have recently developed a data-driven solution to Lyapunov equations, which uses not the model but the data of several state trajectories of the system. However, the number of state trajectories to uniquely determine the solution is O(n2) for the dimension n of the system. This prevents us from applying the method to a case with a large n. Thus, this paper proposes a novel class of data-driven Lyapunov equations, which requires a smaller amount of data. Although the previous method constructs one scalar equation from one state trajectory, the proposed method constructs three scalar equations from any combination of two state trajectories. Based on this idea, we derive data-driven Lyapunov equations such that the number of state trajectories to uniquely determine the solution is O(n).","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135104992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Two-Phase Approach to Finding the Most Critical Entities in Interdependent Systems 在相互依赖的系统中寻找最关键实体的两阶段方法

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023map0003

Daichi MINAMIDE, Tatsuhiro TSUCHIYA

引用次数: 0

Ising-Machine-Based Solver for Constrained Graph Coloring Problems 约束图着色问题的基于isingmachine的求解器

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023kep0003

Soma KAWAKAMI, Yosuke MUKASA, Siya BAO, Dema BA, Junya ARAI, Satoshi YAGI, Junji TERAMOTO, Nozomu TOGAWA

{"title":"Ising-Machine-Based Solver for Constrained Graph Coloring Problems","authors":"Soma KAWAKAMI, Yosuke MUKASA, Siya BAO, Dema BA, Junya ARAI, Satoshi YAGI, Junji TERAMOTO, Nozomu TOGAWA","doi":"10.1587/transfun.2023kep0003","DOIUrl":"https://doi.org/10.1587/transfun.2023kep0003","url":null,"abstract":"Ising machines can find optimum or quasi-optimum solutions of combinatorial optimization problems efficiently and effectively. The graph coloring problem, which is one of the difficult combinatorial optimization problems, is to assign a color to each vertex of a graph such that no two vertices connected by an edge have the same color. Although methods to map the graph coloring problem onto the Ising model or quadratic unconstrained binary optimization (QUBO) model are proposed, none of them considers minimizing the number of colors. In addition, there is no Ising-machine-based method considering additional constraints in order to apply to practical problems. In this paper, we propose a mapping method of the graph coloring problem including minimizing the number of colors and additional constraints to the QUBO model. As well as the constraint terms for the graph coloring problem, we firstly propose an objective function term that can minimize the number of colors so that the number of used spins cannot increase exponentially. Secondly, we propose two additional constraint terms: One is that specific vertices have to be colored with specified colors; The other is that specific colors cannot be used more than the number of times given in advance. We theoretically prove that, if the energy of the proposed QUBO mapping is minimized, all the constraints are satisfied and the objective function is minimized. The result of the experiment using an Ising machine showed that the proposed method reduces the number of used colors by up to 75.1% on average compared to the existing baseline method when additional constraints are not considered. Considering the additional constraints, the proposed method can effectively find feasible solutions satisfying all the constraints.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135358921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Adversarial Examples created by Fault Injection Attack on Image Sensor Interface 基于故障注入攻击的图像传感器接口对抗实例

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023cip0025

Tatsuya OYAMA, Kota YOSHIDA, Shunsuke OKURA, Takeshi FUJINO

{"title":"Adversarial Examples created by Fault Injection Attack on Image Sensor Interface","authors":"Tatsuya OYAMA, Kota YOSHIDA, Shunsuke OKURA, Takeshi FUJINO","doi":"10.1587/transfun.2023cip0025","DOIUrl":"https://doi.org/10.1587/transfun.2023cip0025","url":null,"abstract":"Adversarial examples (AEs), which cause misclassification by adding subtle perturbations to input images, have been proposed as an attack method on image-classification systems using deep neural networks (DNNs). Physical AEs created by attaching stickers to traffic signs have been reported, which are a threat to traffic-sign-recognition DNNs used in advanced driver assistance systems. We previously proposed an attack method for generating a noise area on images by superimposing an electrical signal on the mobile industry processor interface and showed that it can generate a single adversarial mark that triggers a backdoor attack on the input image. Therefore, we propose a misclassification attack method n DNNs by creating AEs that include small perturbations to multiple places on the image by the fault injection. The perturbation position for AEs is pre-calculated in advance against the target traffic-sign image, which will be captured on future driving. With 5.2% to 5.5% of a specific image on the simulation, the perturbation that induces misclassification to the target label was calculated. As the experimental results, we confirmed that the traffic-sign-recognition DNN on a Raspberry Pi was successfully misclassified when the target traffic sign was captured with. In addition, we created robust AEs that cause misclassification of images with varying positions and size by adding a common perturbation. We propose a method to reduce the amount of robust AEs perturbation. Our results demonstrated successful misclassification of the captured image with a high attack success rate even if the position and size of the captured image are slightly changed.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135702235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A frequency estimation algorithm for high precision monitoring of significant space targets 一种用于重要空间目标高精度监测的频率估计算法

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eal2047

Ze FU GAO, Wen GE YANG, Yi WEN JIAO

{"title":"A frequency estimation algorithm for high precision monitoring of significant space targets","authors":"Ze FU GAO, Wen GE YANG, Yi WEN JIAO","doi":"10.1587/transfun.2023eal2047","DOIUrl":"https://doi.org/10.1587/transfun.2023eal2047","url":null,"abstract":"Space is becoming increasingly congested and contested, which calls for effective means to conduct effective monitoring of high-value space assets, especially in Space Situational Awareness(SSA) missions, while there are imperfections in existing methods and corresponding algorithms. To overcome such a problem, this letter proposes an algorithm for accurate Connected Element Interferometry(CEI) in SSA based on more interpolation information and iterations. Simulation results show that:(i)after iterations, the estimated asymptotic variance of the proposed method can basically achieve uniform convergence, and the ratio of it to ACRB is 1.00235 in δ0 ∈ [-0.5, 0.5], which is closer to 1 than the current best AM algorithms; (ii)In the interval of SNR ∈ [-14dB, 0dB], the estimation error of the proposed algorithm decreases significantly, which is basically comparable to CRLB (maintains at 1.236 times). The research of this letter could play a significant role in effective monitoring and high-precision tracking and measurement with significant space targets during futuristic SSA missions.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135702444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Privacy Preserving Function Evaluation using Lookup Tables with Word-Wise FHE 使用逐字FHE查找表的隐私保护函数求值

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1114

Ruixiao LI, Hayato YAMANA

{"title":"Privacy Preserving Function Evaluation using Lookup Tables with Word-Wise FHE","authors":"Ruixiao LI, Hayato YAMANA","doi":"10.1587/transfun.2023eap1114","DOIUrl":"https://doi.org/10.1587/transfun.2023eap1114","url":null,"abstract":"Homomorphic encryption (HE) is a promising approach for privacy-preserving applications, enabling a third party to assess functions on encrypted data. However, problems persist in implementing privacy-preserving applications through HE, including 1) long function evaluation latency and 2) limited HE primitives only allowing us to perform additions and multiplications. A homomorphic lookup-table (LUT) method has emerged to solve the above problems and enhance function evaluation efficiency. By leveraging homomorphic LUTs, intricate operations can be substituted. Previously proposed LUTs use bit-wise HE, such as TFHE, to evaluate single-input functions. However, the latency increases with the bit-length of the function's input(s) and output. Additionally, an efficient implementation of multi-input functions remains an open question. This paper proposes a novel LUT-based privacy-preserving function evaluation method to handle multi-input functions while reducing the latency by adopting word-wise HE. Our optimization strategy adjusts table sizes to minimize the latency while preserving function output accuracy, especially for common machine-learning functions. Through our experimental evaluation utilizing the BFV scheme of the Microsoft SEAL library, we confirmed the runtime of arbitrary functions whose LUTs consist of all input-output combinations represented by given input bits: 1) single-input 12-bit functions in 0.14 s, 2) single-input 18-bit functions in 2.53 s, 3) two-input 6-bit functions in 0.17 s, and 4) three-input 4-bit functions in 0.20 s, employing four threads. Besides, we confirmed that our proposed table size optimization strategy worked well, achieving 1.2 times speed up with the same absolute error of order 10-4 for Swish and 1.9 times speed up for ReLU while decreasing the absolute error from order 10-2 to 10-4 compared to the baseline, i.e., polynomial approximation.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135710805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023cip0023

Keitaro HIWATASHI, Koji NUIDA

引用次数: 0

Synchronization of canards in coupled canard-generating Bonhoeffer-van der Pol oscillators subject to weak periodic perturbations 弱周期扰动下耦合鸭翼产生波霍费尔-范德波尔振荡中鸭翼的同步

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1055

Kundan LAL DAS, Munehisa SEKIKAWA, Tadashi TSUBONE, Naohiko INABA, Hideaki OKAZAKI

引用次数: 0

More Efficient Adaptively Secure Lattice-based IBE with Equality Test in the Standard Model 标准模型中具有等式检验的更有效的自适应安全栅格IBE

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023cip0021

Kyoichi ASANO, Keita EMURA, Atsushi TAKAYASU

{"title":"More Efficient Adaptively Secure Lattice-based IBE with Equality Test in the Standard Model","authors":"Kyoichi ASANO, Keita EMURA, Atsushi TAKAYASU","doi":"10.1587/transfun.2023cip0021","DOIUrl":"https://doi.org/10.1587/transfun.2023cip0021","url":null,"abstract":"Identity-based encryption with equality test (IBEET) is a variant of identity-based encryption (IBE), in which any user with trapdoors can check whether two ciphertexts are encryption of the same plaintext. Although several lattice-based IBEET schemes have been proposed, they have drawbacks in either security or efficiency. Specifically, most IBEET schemes only satisfy selective security, while public keys of adaptively secure schemes in the standard model consist of matrices whose numbers are linear in the security parameter. In other words, known lattice-based IBEET schemes perform poorly compared to the state-of-the-art lattice-based IBE schemes (without equality test). In this paper, we propose a semi-generic construction of CCA-secure lattice-based IBEET from a certain class of lattice-based IBE schemes. As a result, we obtain the first lattice-based IBEET schemes with adaptive security and CCA security in the standard model without sacrificing efficiency. This is because, our semi-generic construction can use several state-of-the-art lattice-based IBE schemes as underlying schemes, e.g. Yamada's IBE scheme (CRYPTO'17).","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135954469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Output Feedback Ultimate Boundedness Control with Decentralized Event-Triggering 具有分散事件触发的输出反馈最终有界控制

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023map0005

Koichi KITAMURA, Koichi KOBAYASHI, Yuh YAMASHITA

{"title":"Output Feedback Ultimate Boundedness Control with Decentralized Event-Triggering","authors":"Koichi KITAMURA, Koichi KOBAYASHI, Yuh YAMASHITA","doi":"10.1587/transfun.2023map0005","DOIUrl":"https://doi.org/10.1587/transfun.2023map0005","url":null,"abstract":"In cyber-physical systems (CPSs) that interact between physical and information components, there are many sensors that are connected through a communication network. In such cases, the reduction of communication costs is important. Event-triggered control that the control input is updated only when the measured value is widely changed is well known as one of the control methods of CPSs. In this paper, we propose a design method of output feedback controllers with decentralized event-triggering mechanisms, where the notion of uniformly ultimate boundedness is utilized as a control specification. Using this notion, we can guarantee that the state stays within a certain set containing the origin after a certain time, which depends on the initial state. As a result, the number of times that the event occurs can be decreased. First, the design problem is formulated. Next, this problem is reduced to a BMI (bilinear matrix inequality) optimization problem, which can be solved by solving multiple LMI (linear matrix inequality) optimization problems. Finally, the effectiveness of the proposed method is presented by a numerical example.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135561395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0