IEICE Trans. Fundam. Electron. Commun. Comput. Sci.最新文献

Erratum: Concatenated Permutation Codes under Chebyshev Distance [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E106.A (2023), No. 3 pp.616-632] 勘误:切比雪夫距离下的连接排列码[IEICE电子、通信和计算机科学基础学报，Vol. E106]。A (2023)， No. 3 pp.616-632]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2023-04-01 DOI: 10.1587/transfun.2023eae0001

Motohiro Kawasumi, K. Kasai

引用次数: 0

Automorphism Shuffles for Graphs and Hypergraphs and Its Applications 图和超图的自同构洗牌及其应用

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2022-05-10 DOI: 10.1587/transfun.2022CIP0020

Kazumasa Shinagawa, K. Miyamoto

引用次数: 0

Erratum: A Compact Digital Signature Scheme Based on the Module-LWR Problem [IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E104.A (2021), No. 9 pp.1219-1234] 基于模块- lwr问题的紧凑数字签名方案[j] .电子、通信和计算机科学基础学报，Vol. E104。A (2021)， No. 9 pp.1219-1234]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2022-02-01 DOI: 10.1587/transfun.2022eae0001

Hiroki Okada, Atsushi Takayasu, Kazuhide Fukushima, S. Kiyomoto, T. Takagi

引用次数: 0

Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields 高斯马尔可夫随机场下极大极小凹惩罚稀疏图的学习

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-09-17 DOI: 10.1587/transfun.2021eap1153

Tatsuya Koyakumaru, M. Yukawa, Eduardo Pavez, Antonio Ortega

{"title":"Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov Random Fields","authors":"Tatsuya Koyakumaru, M. Yukawa, Eduardo Pavez, Antonio Ortega","doi":"10.1587/transfun.2021eap1153","DOIUrl":"https://doi.org/10.1587/transfun.2021eap1153","url":null,"abstract":"This paper presents a convex-analytic framework to learn sparse graphs from data. While our problem formulation is inspired by an extension of the graphical lasso using the so-called combinatorial graph Laplacian framework, a key difference is the use of a nonconvex alternative to the $ell_1$ norm to attain graphs with better interpretability. Specifically, we use the weakly-convex minimax concave penalty (the difference between the $ell_1$ norm and the Huber function) which is known to yield sparse solutions with lower estimation bias than $ell_1$ for regression problems. In our framework, the graph Laplacian is replaced in the optimization by a linear transform of the vector corresponding to its upper triangular part. Via a reformulation relying on Moreau's decomposition, we show that overall convexity is guaranteed by introducing a quadratic function to our cost function. The problem can be solved efficiently by the primal-dual splitting method, of which the admissible conditions for provable convergence are presented. Numerical examples show that the proposed method significantly outperforms the existing graph learning methods with reasonable CPU time.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123035911","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Ramsey Numbers of Trails Ramsey Numbers of Trails

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-09-02 DOI: 10.1587/transfun.2021DMP0003

Masatoshi Osumi

引用次数: 2

Counting Convex and Non-Convex 4-Holes in a Point Set 点集中凸和非凸4孔的计数

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-09-01 DOI: 10.1587/transfun.2020dmp0002

Young-Hun Sung, S. Bae

引用次数: 1

Minimax Design of Sparse IIR Filters Using Sparse Linear Programming 稀疏IIR滤波器的稀疏线性规划极大极小设计

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-08-01 DOI: 10.1587/TRANSFUN.2020EAP1096

M. Nakamoto, N. Aikawa

{"title":"Minimax Design of Sparse IIR Filters Using Sparse Linear Programming","authors":"M. Nakamoto, N. Aikawa","doi":"10.1587/TRANSFUN.2020EAP1096","DOIUrl":"https://doi.org/10.1587/TRANSFUN.2020EAP1096","url":null,"abstract":"Recent trends in designing filters involve development of sparse filters with coefficients that not only have real but also zero values. These sparse filters can achieve a high performance through optimizing the selection of the zero coefficients and computing the real (non-zero) coefficients. Designing an infinite impulse response (IIR) sparse filter is more challenging than designing a finite impulse response (FIR) sparse filter. Therefore, studies on the design of IIR sparse filters have been rare. In this study, we consider IIR filters whose coefficients involve zero value, called sparse IIR filter. First, we formulate the design problem as a linear programing problem without imposing any stability condition. Subsequently, we reformulate the design problem by altering the error function and prepare several possible denominator polynomials with stable poles. Finally, by incorporating these methods into successive thinning algorithms, we develop a new design algorithm for the filters. To demonstrate the effectiveness of the proposed method, its performance is compared with that of other existing methods. key words: infinite impulse response (IIR) filters, sparse filter, zero coefficients, sparse linear programming, minimax design","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Capsule Network with Shortcut Routing 具有快捷路由的胶囊网络

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-08-01 DOI: 10.1587/transfun.2020EAP1101

Thanh-Vu Dang, Hoang-Trong Vo, Gwanghyun Yu, Jin Young Kim

引用次数: 1

Extended-Domain Golomb Code and Symmetry of Relative Redundancy 扩展域Golomb码与相对冗余对称性

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-08-01 DOI: 10.1587/TRANSFUN.2020EAP1099

Ryosuke Sugiura, Y. Kamamoto, T. Moriya

引用次数: 1

Unified Likelihood Ratio Estimation for High- to Zero-frequency N-grams 高频到零频N-grams的统一似然比估计

IEICE Trans. Fundam. Electron. Commun. Comput. Sci. Pub Date : 2021-08-01 DOI: 10.1587/transfun.2020EAP1088

M. Kikuchi, Kento Kawakami, Kazuho Watanabe, Mitsuo Yoshida, Kyoji Umemura

{"title":"Unified Likelihood Ratio Estimation for High- to Zero-frequency N-grams","authors":"M. Kikuchi, Kento Kawakami, Kazuho Watanabe, Mitsuo Yoshida, Kyoji Umemura","doi":"10.1587/transfun.2020EAP1088","DOIUrl":"https://doi.org/10.1587/transfun.2020EAP1088","url":null,"abstract":"Likelihood ratios (LRs), which are commonly used for probabilistic data processing, are often estimated based on the frequency counts of individual elements obtained from samples. In natural language processing, an element can be a continuous sequence of N items, called an N -gram, in which each item is a word, letter, etc. In this paper, we attempt to estimate LRs based on N -gram frequency information. A naive estimation approach that uses only N -gram frequencies is sensitive to low-frequency (rare) N -grams and not applicable to zero-frequency (unobserved) N -grams; these are known as the lowand zero-frequency problems, respectively. To address these problems, we propose a method for decomposing N -grams into item units and then applying their frequencies along with the original N -gram frequencies. Our method can obtain the estimates of unobserved N -grams by using the unit frequencies. Although using only unit frequencies ignores dependencies between items, our method takes advantage of the fact that certain items often co-occur in practice and therefore maintains their dependencies by using the relevant N -gram frequencies. We also introduce a regularization to achieve robust estimation for rare N -grams. Our experimental results demonstrate that our method is effective at solving both problems and can effectively control dependencies. key words: Likelihood ratio, the low-frequency problem, the zero-frequency problem, uLSIF.","PeriodicalId":348826,"journal":{"name":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114950124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0