| 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 # | |
| COMP | 2024-03-14 10:30 |
Tokyo | The University of Electro-Communications | Number of Solutions of Pentahex and Heptiamond Puzzles Toshihiro Shirakawa  COMP2023-28 |
Packing puzzles, also known as plastic puzzles, have been considered difficult to calculate the total number of solution... [more] | COMP2023-28 pp.1-5 |
| COMP, IPSJ-AL | 2023-05-10 14:30 |
Hokkaido | Hokkaido University | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| LOIS | 2023-03-13 10:00 |
Okinawa | (Primary: On-site, Secondary: Online) |
Productivity analysis of packaging operations Daiki Fukusa, Toshimasa Aso (Tokyo Univ. of Marine Science and Technology) LOIS2022-44 |
This paper uses the warehouse work probe system and examines packing workers. First, the autohrs analyse when to cut car... [more] | LOIS2022-44 pp.1-4 |
| CAS, NLP | 2021-10-15 13:00 |
Online | Online | Search Algorithms for Stowage Planning with Loading and Unloading Using Sequence-Triple Taiki Suzuki, Toshihiko Takahashi (Niigata Univ.) CAS2021-34 NLP2021-32 |
Stowage Planning is the problem determining an arrangement of given loads in a container of a desired size. In this rep... [more] |
CAS2021-34 NLP2021-32 pp.95-100 |
| BioX, ISEC, SITE, ICSS, EMM, HWS, IPSJ-CSEC, IPSJ-SPT [detail] | 2021-07-19 16:55 |
Online | Online | Evaluation on Biometric Template Protection System Based on Somewhat Homomorphic Encryption Hiroto Tamiya, Toshiyuki Isshiki, Kengo Mori (NEC), Satoshi Obana (Hosei Univ.), Tetsushi Ohki (Shizuoka Univ.) ISEC2021-21 SITE2021-15 BioX2021-22 HWS2021-21 ICSS2021-26 EMM2021-26 |
Many biometric template protection systems have been proposed to perform biometric authentication while keeping the biom... [more] | ISEC2021-21 SITE2021-15 BioX2021-22 HWS2021-21 ICSS2021-26 EMM2021-26 pp.68-73 |
| COMP | 2018-03-05 11:00 |
Osaka | Osaka Prefecture Univ. | [Invited Talk]
Stochastic Packing Integer Programs with Few Queries Takanori Maehara (RIKEN), Yutaro Yamaguchi (Osaka Univ./RIKEN) COMP2017-47 |
We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables... [more] | COMP2017-47 p.17 |
| ICD, CPSY, CAS | 2017-12-15 12:00 |
Okinawa | Art Hotel Ishigakijima | A faster searching method for polyhedral packing problem Yutaka Matsushita, Kunihiro Fujiyoshi (TUAT) CAS2017-108 ICD2017-96 CPSY2017-105 |
Polyhedral packing problem is to pack given polyhedrons consisting of only planes perpendicular to one of x, y or z in a... [more] | CAS2017-108 ICD2017-96 CPSY2017-105 pp.181-186 |
| ISEC, WBS, IT | 2017-03-09 14:00 |
Tokyo | TOKAI University | Sphere packing bound and Gilbert-Varshamov bound for b-symbol read channels Seunghoan Song, Toru Fujiwara (Osaka Univ.) IT2016-107 ISEC2016-97 WBS2016-83 |
b-symbol read channel is a channel model proposed by Yaakobi et al. that b consecutive symbols are read at once. This ch... [more] | IT2016-107 ISEC2016-97 WBS2016-83 pp.55-60 |
| NS, IN (Joint) |
2016-03-03 11:40 |
Miyazaki | Phoenix Seagaia Resort | An energy-efficient transmission mechanism with considerations of QoS required by real-time applications in wireless LANs Keisuke Miyamoto, Masafumi Hashimoto, Naoki Wakamiya (Osaka Univ.) IN2015-119 |
Energy saving is one of main concerns in wireless LAN communications. As wireless LAN technologies become popular, many ... [more] | IN2015-119 pp.65-70 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-10 09:50 |
Hokkaido | Hokkaido University | Near-lossless image coding considering the influence of re-encoding Hiroyuki Kobayashi (Tokyo Metro. Coll. of Ind. of Tech.), Masahiro Iwahashi (Nagaoka Univ. of Tech.), Hitoshi Kiya (Tokyo Metro. Univ.) CAS2014-22 VLD2014-31 SIP2014-43 MSS2014-22 SIS2014-22 |
This report proposes a new quantization method, called zero-skip quantization and a near-lossless coding method based on... [more] | CAS2014-22 VLD2014-31 SIP2014-43 MSS2014-22 SIS2014-22 pp.111-116 |
| OFT, OCS (Joint) |
2013-08-23 11:15 |
Hokkaido | Proposal of few-mode multi-core fiber with air hole assisted double cladding structure Tatsuhiko Watanabe, Yasuo Kokubun (Yokohama National Univ.) OCS2013-43 |
We have proposed hole assisted double cladding multi-core fiber which can drastically suppress the crosstalk between cor... [more] | OCS2013-43 pp.39-42 |
|
| SIP, CAS, MSS, VLD | 2013-07-11 11:20 |
Kumamoto | Kumamoto Univ. | A near lossless coding method based on histogram packing and quantization in the spatial domain Hiroyuki Kobayashi (Tokyo Metro. Coll. of Ind. of Tech.), Masahiro Iwahashi (Nagaoka Univ. of Tech.), Hitoshi Kiya (Tokyo Metro. Univ.) CAS2013-8 VLD2013-18 SIP2013-38 MSS2013-8 |
This paper proposes a near lossless coding method based on histogram packing and quantization in the spatial domain. B... [more] |
CAS2013-8 VLD2013-18 SIP2013-38 MSS2013-8 pp.43-48 |
| COMP, IPSJ-AL | 2013-05-17 09:55 |
Hokkaido | Otaru University of Commerce | Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Five Terminals Daiki Hoshika, Eiji Miyano (Kyushu Inst. of Tech.) COMP2013-9 |
In this paper we study the maximum packing element-disjoint Steiner tree problem(element-disjoint MaxPST problem, for s... [more] |
COMP2013-9 pp.7-12 |
| PN | 2012-11-06 10:00 |
Tokyo | Japan Women's University | Analytical Models for L2 versus L3 QoS Provisioning Marat Zhanikeev (Tokyo Univ. of Science), Yoshiaki Tanaka (Waseda Univ.) PN2012-24 |
Layer 3 QoS is the default choice for large-scale QoS provisioning today. Layer 2 technologies like VLAN also exist but... [more] | PN2012-24 pp.1-6 |
| COMP | 2012-06-21 17:10 |
Hokkaido | Hokkaido University | Notes on weighted Delaunay triangulations and discrete Ricci flow
-- Relation between weighted Delaunay triangulations and circle packing metrics -- Toshihiro Tanuma, Hiroshi Imai (Univ. of Tokyo) COMP2012-25 |
This research is related to weighted Delaunay triangulations and a discrete Ricci flow. Specifically, we consider the fo... [more] | COMP2012-25 pp.103-109 |
| KBSE | 2012-03-15 15:05 |
Aichi | Nagoya Univ. | Qualitative Spatial Reasoning on Rectangle Superposition by Embedding Takako Konishi, Kazuko Takahashi (Kwansei Gakuin Univ.) KBSE2011-71 |
This paper discusses a superposition of qualitative rectangles whose size and edge rations are not fixed, and some parts... [more] | KBSE2011-71 pp.13-18 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2011-11-30 10:30 |
Miyazaki | NewWelCity Miyazaki | An Improved Simulated Annealing for 3D Packing with Sequence Triple and Quintuple Representations Yiqiang Sheng (Tokyo Inst. of Tech.), Atsushi Takahashi (Osaka Univ.), Shuichi Ueno (Tokyo Inst. of Tech.) VLD2011-88 DC2011-64 |
The 3D packing for VLSI physical design is facing big challenges to get better solution quality with less computational ... [more] | VLD2011-88 DC2011-64 pp.209-214 |
| ICSS | 2011-03-25 15:10 |
Tokyo | Suspended | Automatic Unpacking Based on Entropy of Memory-Access Values Eitaro Shioji, Yuhei Kawakoya, Makoto Iwamura, Mitsutaka Itoh (NTT Corp.) ICSS2010-63 |
Malware executables are often obfuscated with encryption or compression using a technique known as packing, thus perform... [more] | ICSS2010-63 pp.41-46 |
| IA, ICSS | 2010-06-17 14:20 |
Kyoto | Academic Center for Computing and Media Studies, Kyoto University | How to Identify Code Region after Detecting Entry Point of Malware Makoto Iwamura, Mitsutaka Itoh (NTT/Waseda Univ.), Yoichi Muraoka (Waseda Univ.) IA2010-4 ICSS2010-4 |
The goal of many existing methods for unpacking was finding OEP (Original Entry Point), not identifying where the origin... [more] | IA2010-4 ICSS2010-4 pp.19-24 |
| COMP | 2010-04-22 15:55 |
Shiga | Ritusmeikan University, Biwako-Kusatsu Campus | Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings Takuro Fukunaga (Kyoto Univ.) COMP2010-8 |
Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hype... [more] | COMP2010-8 pp.55-62 |
[Return to Top Page]