Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SIP, IT, RCS |
2018-01-22 11:15 |
Kagawa |
Sunport Hall Takamatsu |
A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed
-- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- Nozomi Miya (Aoyama Gakuin Univ.), Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.) IT2017-61 SIP2017-69 RCS2017-275 |
Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extende... [more] |
IT2017-61 SIP2017-69 RCS2017-275 pp.37-42 |
CQ (2nd) |
2017-08-27 13:50 |
Saitama |
Nippon Institute of Technology |
[Poster Presentation]
Estimation of user interface pattern using features in brain activity Mami Kitabata, Yasuhiro Inazumi, Tadanobu Misawa, Yuukou Horita (Univ. of Toyama), Osamu Sugimoto, Sei Naito (KDDI Research, Inc.) |
Heretofore, a subjective evaluation was used for evaluating the usability of a user interface (UI) such as a smartphone.... [more] |
|
CQ |
2017-07-27 13:50 |
Hyogo |
Kobe University |
Estimation of user interface by feature quantity of brain activity using NIRS Mami Kitabata, Yasuhiro Inazumi, Tadanobu Misawa, Yuukou Horita (Univ. of Toyama), Osamu Sugimoto, Sei Naito (KDDI Research, Inc.) CQ2017-37 |
When a user operates a smartphone, it is important to know usability. However, usability studies have relied on subjecti... [more] |
CQ2017-37 pp.49-54 |
SP, SIP, EA |
2017-03-01 12:40 |
Okinawa |
Okinawa Industry Support Center |
[Poster Presentation]
Estimation of playing position from music and speech sources based on music database Satoshi Inui, Toru Takahashi (OSU) EA2016-105 SIP2016-160 SP2016-100 |
We describe about music information retrieval (MIR) system in real environment. In the environment, music and non-music ... [more] |
EA2016-105 SIP2016-160 SP2016-100 pp.129-134 |
PRMU |
2015-12-21 15:10 |
Nagano |
|
Local feature description for keypoint matching Mitsuru Ambai (Denso IT Laboratory, Inc.), Takahiro Hasegawa, Hironobu Fujiyoshi (Chubu University) PRMU2015-104 |
A task of finding physically the sample points among multiple images captured from different viewpoints is called as key... [more] |
PRMU2015-104 pp.53-73 |
RCC, ITS, WBS |
2015-12-17 13:30 |
Okinawa |
Okinawa Industry Support Center |
[Poster Presentation]
DS Demodulation for M-ary Transmission Using Binary Sequences Kento Hachikubo, Masanori Hamamura (Kochi Univ. of Tech.) WBS2015-57 ITS2015-29 RCC2015-59 |
We propose a new multiplexing system in which each transmitter transmits a binary signal with $M$-ary signaling using $M... [more] |
WBS2015-57 ITS2015-29 RCC2015-59 pp.103-108 |
IBISML |
2015-11-27 14:00 |
Ibaraki |
Epochal Tsukuba |
[Poster Presentation]
Energy Disaggregation Based on Weighted Semi-Binary NMF Masako Matsumoto, Yu Fujimoto, Yasuhiro Hayashi (Waseda Univ.) IBISML2015-78 |
The authors propose an application of weighted semi-binary non-negative matrix factorization for the energy disaggregati... [more] |
IBISML2015-78 pp.189-194 |
IBISML |
2015-11-27 14:00 |
Ibaraki |
Epochal Tsukuba |
[Poster Presentation]
An Efficient Accelerated Proximal Gradient Method for Unified Binary Classification Model Naoki Ito, Akiko Takeda (UTokyo), Kim-Chuan Toh (NUS) IBISML2015-93 |
In this paper, we develop an efficient general optimization algorithm for a unified formulation of various binary classi... [more] |
IBISML2015-93 pp.299-303 |
IA, ICSS |
2015-06-11 14:55 |
Fukuoka |
Kyushu Institute of Technology Univ. |
An Empirical Evaluation of Locating Cryptographic Functions on the Memory Ryoya Furukawa (Kobe Univ.), Ryoichi Isawa (NICT), Masakatu Morii (Kobe Univ.), Daisuke Inoue, Koji Nakao (NICT) IA2015-4 ICSS2015-4 |
This paper presents a simple and effective idea to locate cryptographic functions on the memory for malware analysis.
... [more] |
IA2015-4 ICSS2015-4 pp.15-20 |
WBS, SAT (Joint) |
2015-05-29 10:05 |
Tokyo |
Tokyo City Univ. (Setagaya Campus) |
Error Probability Analysis for Data fusion of End-Nodes in Tree Networks Longfei Zhou, Ikuo Oka, Shingo Ata (Osaka City Univ.) SAT2015-7 |
In the preceding works on the tree networks composed of binary symmetric channel (BSC), the error probability of majorit... [more] |
SAT2015-7 pp.37-41 |
IA, IPSJ-IOT, SITE [detail] |
2015-03-06 14:20 |
Fukushima |
|
Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion Shunsuke Kimura, Hiroyuki Inaba (KIT) SITE2014-79 IA2014-111 |
Recently, cloud storage service which store several documents on the Internet has become widespread.
This has the remar... [more] |
SITE2014-79 IA2014-111 pp.227-232 |
COMP |
2014-12-05 11:00 |
Kumamoto |
Sojo University |
On Zero-Suppressed Binary Decision Diagrams and Complexity Theory Hiroki Morizumi (Shimane Univ.) COMP2014-34 |
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most... [more] |
COMP2014-34 pp.17-19 |
WBS |
2014-10-03 14:55 |
Akita |
Akita Prefectural University |
Performance evaluation of the modified binary countdown scheme for Multi-hop Network Koichiro Hashiura (Akita Prefectural Univ.), Fumie Ono (NICT) WBS2014-36 |
In this paper, the modified binary countdown scheme is evaluated in the wireless multi-hop network system. It is importa... [more] |
WBS2014-36 pp.23-27 |
CPSY, DC (Joint) |
2014-07-30 17:25 |
Niigata |
Toki Messe, Niigata |
Implementation of Path Profiler for Enabling Analysis of Data Dependencies Between Program Execution Paths Kazuki Ohshima, Kanemitsu Ootsu, Takanobu Baba, Takeshi Ohkawa, Takashi Yokota (Utsunomiya Univ.) CPSY2014-44 |
In present day, various techniques are required for realizing effective parallel processing according to multi-core proc... [more] |
CPSY2014-44 pp.203-208 |
ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] |
2014-07-04 13:50 |
Hokkaido |
San-Refure Hakodate |
Proposal on Fast Searchable Encryption Scheme Using Bloom Filter Shunsuke Kimura, Hiroyuki Inaba (Kyoto Inst. of Tech.) ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 |
Recently, cloud storage service which store several documents on the Internet has become widespread.
This has the remar... [more] |
ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 pp.281-286 |
PRMU |
2014-03-14 15:00 |
Tokyo |
|
Feature Extraction Using Local Gradient Pattern Hiroki Terashima, Takuya Kida (Hokkaido Univ.) PRMU2013-209 |
Local Binary Pattern (LBP) is an image feature that widely used for image classification.This feature consists of a hist... [more] |
PRMU2013-209 pp.247-252 |
ISEC, LOIS |
2013-11-28 15:25 |
Miyagi |
Tohoku Univ. |
Efficient Multi-Party Private Set Intersection Protocol Tomoaki Mimoto, Atsuko Miyaji (JAIST) ISEC2013-63 LOIS2013-29 |
Private Set Intersection Protocol(PSI) is a protocol by which two or more players with each data sets can compute some i... [more] |
ISEC2013-63 LOIS2013-29 pp.29-34 |
IBISML |
2013-11-13 15:45 |
Tokyo |
Tokyo Institute of Technology, Kuramae-Kaikan |
[Poster Presentation]
Gaussian Sparse Hashing Koichiro Suzuki, Mitsuru Ambai, Ikuro Sato (Denso IT Labo) IBISML2013-56 |
Binary hashing has been widely used for Approximate Nearest Neighbor(ANN) search due to fast query
speed and less stora... [more] |
IBISML2013-56 pp.155-160 |
COMP, IPSJ-AL |
2013-05-17 15:05 |
Hokkaido |
Otaru University of Commerce |
Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] |
COMP2013-12 pp.63-70 |
COMP |
2013-03-18 13:45 |
Gifu |
Gifu University |
Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] |
COMP2012-56 pp.23-30 |