| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| CQ (2nd) |
2016-10-06 13:20 |
Nagano | Naganoken Nokyo Building | [Poster Presentation]
A Study on Network Failure Detection with Reflective Network Tomography Naoya Kiyofuji (Osaka Univ.), Takahiro Matsuda (Osaka Univ./NICT), Shinsuke Hara (Osaka City Univ.), Kenichi Takizawa, Fumie Ono, Ryu Miura (NICT) |
Network tomography is a technique to estimate network internal characteristics by end-to-end measurements. An adaptive B... [more] | |
| RCS, RCC, ASN, NS, SR (Joint) |
2016-07-21 10:50 |
Aichi | [Poster Presentation]
Cardinality Estimation of Positive Items for Boolean Compressed Sensing Based Adaptive Group Testing Yujia Lu, Kazunori Hayashi (Kyoto Univ.)  RCC2016-22 NS2016-56 RCS2016-109 SR2016-39 ASN2016-30 |
Adaptive group testing using boolean compressed sensing requires information on the number of positive items for effecti... [more] | RCC2016-22 NS2016-56 RCS2016-109 SR2016-39 ASN2016-30 pp.51-56(RCC), pp.33-38(NS), pp.81-86(RCS), pp.51-56(SR), pp.33-38(ASN) |
|
| VLD, CAS, MSS, SIP | 2016-06-16 15:50 |
Aomori | Hirosaki Shiritsu Kanko-kan | Controllability Analysis of Boolean Networks Focusing on Attractors Koichi Kobayashi (Hokkaido Univ.) CAS2016-12 VLD2016-18 SIP2016-46 MSS2016-12 |
In this paper, based on a singleton attractor, the controllability problem of a gene regulatory network modeled by a Boo... [more] | CAS2016-12 VLD2016-18 SIP2016-46 MSS2016-12 pp.61-66 |
| PRMU, IE, MI, SIP | 2016-05-20 14:40 |
Aichi | Sequential Pool-Design for Adaptive Boolean Compressive Sensing Yohei Kawaguchi, Masahito Togami (Hitachi) SIP2016-27 IE2016-27 PRMU2016-27 MI2016-27 |
A new method for solving adaptive Boolean compressive sensing is proposed. A conventional method determining a pool for... [more] |
SIP2016-27 IE2016-27 PRMU2016-27 MI2016-27 pp.141-145 |
|
| ICSS, IPSJ-SPT | 2016-03-04 15:40 |
Kyoto | Academic Center for Computing and Media Studies, Kyoto University | Higher-order differential attack on the round-reduced variants of the block cipher Yusuke Takahashi, Yasutaka Igarashi, Toshinobu Kaneko (TUS) ICSS2015-73 |
Midori64 proposed by Banik et al. in 2015 is an SPN-type block cipher with 128-bit secret key. The designers have evalua... [more] | ICSS2015-73 pp.159-164 |
| SS, MSS | 2016-01-25 17:10 |
Ishikawa | Shiinoki-Geihin-Kan | A method for making proof graph finite on disjunctive parameterised Boolean equation systems Yutaro Nagae, Masahiko Sakai, Hiroyuki Seki (Nagoya Univ.) MSS2015-49 SS2015-58 |
A parameterised Boolean equation system (PBES) is a set of equations that defines sets as the least and/or greatest fixe... [more] | MSS2015-49 SS2015-58 pp.81-85 |
| MSS, CAS, SIP, VLD | 2015-06-17 09:20 |
Hokkaido | Otaru University of Commerce | Design of Probabilistic Boolean Networks Based on Network Structure and Steady-state Probabilities Koichi Kobayashi (Hokkaido Univ.), Kunihiko Hiraishi (JAIST) CAS2015-1 VLD2015-8 SIP2015-32 MSS2015-1 |
In this paper, we consider the problem of finding a probabilistic Boolean network (PBN) based on network structure and d... [more] | CAS2015-1 VLD2015-8 SIP2015-32 MSS2015-1 pp.1-6 |
| CQ, CS (Joint) |
2015-04-21 10:30 |
Fukuoka | Fukuoka Institute of Technology | Network Failure Detection with Mobility-Assisted Boolean Network Tomography Masaki Mukamoto, Takahiro Matsuda (Osaka Univ), Shinsuke Hara (Osaka City Univ), Kenichi Takizawa, Fumie Ono, Ryu Miura (NICT) CQ2015-3 |
Boolean network tomography can identify failure links/nodes in a network by solving a system of Boolean equations to rep... [more] | CQ2015-3 pp.11-14 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 13:40 |
Hokkaido | Hokkaido University | Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 |
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] | CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 pp.45-48 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-11 13:00 |
Hokkaido | Hokkaido University | Accelerating Boolean Matching of LUT-based Circuits using CEGAR method Yusuke Matsunaga (Kyushu Univ.) CAS2014-38 VLD2014-47 SIP2014-59 MSS2014-38 SIS2014-38 |
This paper describes an accelerating technique for Boolean matching of LUT-based circuits, which is based on CEGAR (coun... [more] | CAS2014-38 VLD2014-47 SIP2014-59 MSS2014-38 SIS2014-38 pp.201-206 |
| IBISML | 2013-11-12 15:45 |
Tokyo | Tokyo Institute of Technology, Kuramae-Kaikan | [Poster Presentation]
The Method to Extract Latent Skills from Time Series Examination Results with Matrix Factorization Shinichi Oeda, Eriko Amano (KNCT), Kenji Yamanishi (Univ. of Tokyo) IBISML2013-52 |
Examination results are used to judge whether an student possesses desired latent skills. In order to grasp the skills, ... [more] | IBISML2013-52 pp.123-130 |
| COMP | 2013-06-24 15:10 |
Nara | Nara Women's University | On a parametic integer programming algorithm using dualization of monotone Boolean function Norie Fu (NII), Takafumi Shibuta (Kyushu Univ.) COMP2013-23 |
The {it parametric integer programing} is the integer programming with a vector of parameters as its right-hand-side vec... [more] | COMP2013-23 pp.23-30 |
| COMP, IPSJ-AL | 2013-05-18 09:55 |
Hokkaido | Otaru University of Commerce | Complexity of Counting Output Patterns of Logic Circuits Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.) COMP2013-14 |
Let $C$ be a logic circuit consisting of $s$ gates $g_1, g_2, dots , g_s$, then the output pattern of $C$ for an input... [more] |
COMP2013-14 pp.97-102 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-27 13:00 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | Effective Orderings of Instances and Variable Assignments in SAT-based ATPG with Solution Reuse Kenji Ueda, Tsuyoshi Iwagaki, Hideyuki Ichihara, Tomoo Inoue (Hiroshima City Univ.) VLD2012-83 DC2012-49 |
This report discusses the efficiency of iteratively solving various instances with solution reuse in test generation ba... [more] |
VLD2012-83 DC2012-49 pp.141-146 |
| COMP | 2012-06-21 13:45 |
Hokkaido | Hokkaido University | Candidate Boolean Functions towards Super-Quadratic Formula Size Kenya Ueno (Kyoto Univ.) COMP2012-18 |
In this paper, we explore possibilities and difficulties to prove super-quadratic formula size lower bounds from the fol... [more] | COMP2012-18 pp.49-55 |
| COMP | 2011-12-16 14:45 |
Aichi | Nagoya Univ. | Minimizing the Number of Heald Frames under the Constraint of Uniform Tension Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.) COMP2011-43 |
A dobby loom is a weaving machine prevailing in the textile industry. The more heald frames a dobby loom is equipped wit... [more] | COMP2011-43 pp.53-60 |
| QIT (2nd) |
2011-11-21 10:40 |
Osaka | Osaka Univ. Engr. Sci. Sigma Hall (Toyonaka) | Improved Output-Sensitive Quantum Algorithms for Boolean Matrix Multiplication Francois Le Gall (Tokyo Univ.) |
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity... [more] | |
| COMP, IPSJ-AL | 2011-09-06 15:40 |
Hokkaido | Hakodate City Central Library | Lower Bounds for Linear Decision Trees via An Energy Complexity Argument Kei Uchizawa (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.) COMP2011-26 |
A linear decision tree is a binary decision tree in which a classification rule at each internal node is defined by a ... [more] |
COMP2011-26 pp.67-73 |
| MVE, ITE-HI, HI-SIG-VR | 2011-06-29 16:15 |
Tokyo | Sanjo Conference Hall | An Interpretation of "the Mechanism of Meaning" by ARAKAWA+GINS(3)
-- In Order to Detect and Debug Logical Errors in Human Civilization -- Kimiaki Tokumaru (System Engineer) MVE2011-30 |
Last year, the author discussed on “What is Virtual Reality?” differentiating cases of “seeing inexistence” and those “b... [more] | MVE2011-30 pp.85-90 |
| AI | 2011-05-26 10:30 |
Tokyo | Kwansei Gakuin Univ. Tokyo Marunouchi Campus | Several Remarks on the Acquisition of Web-Information
-- Co-existence of Bit and Linguistic Information, and Corporal Intelligence -- Kimiaki Tokumaru (System Engineer) AI2011-1 |
The author has been investigating on the origin and mechanism of language through interdisciplinary researches. He reali... [more] | AI2011-1 pp.1-6 |
[Return to Top Page]