IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 27  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
SS 2023-03-14
16:55
Okinawa
(Primary: On-site, Secondary: Online)
Automatic Dataset Collection and Formatting Techniques for Machine Learning Systems
Takako Kawaguchi, Toshiyuki Kurabayashi, Haruto Tanno (former NTT) SS2022-57
In recent years, as machine learning models have become larger and larger, the scale of data required for training has a... [more] SS2022-57
pp.61-66
ICM 2022-03-04
09:00
Online Online Proposal and Evaluation of a Query Representation and Retrieval Method for Operation Logs
Hidetaka Koya, Akira Kataoka, Haruo Oishi (NTT) ICM2021-47
In recent years, various studies have been conducted using detailed operation histories (operation logs) for software GU... [more] ICM2021-47
pp.29-34
LOIS, ICM 2022-01-28
10:00
Online Online An Objective Article Search Method from Printed Japanese Contract Document Using Optical Character Recognition
Shixi Chen, Masaki Sakagami, Nobuo Funabiki (Okayama Univ.), Takashi Toshida, Kohei Suga (Astrolab) ICM2021-39 LOIS2021-37
A contract is essential for the involved companies to have successful businesses among them. Then, the contract document... [more] ICM2021-39 LOIS2021-37
pp.34-39
LOIS 2021-03-04
13:25
Online Online A Study of Product Identification System Using Optical Character Recognition
Shixi Chen, Nobuo Funabiki, Masaki Sakagami (Okayama Univ.), Takashi Toshida, Kohei Suga (Astrolab) LOIS2020-48
Recently, the optical character recognition (OCR) technology has been remarkably progressed due to the advancements of d... [more] LOIS2020-48
pp.6-11
ICM 2018-03-09
11:50
Okinawa   [Encouragement Talk] Evaluation of the improvement method on the regular expressions generator for the log monitoring
Shinichiro Goto, Toyonori Fujiura, Masafumi Higuchi (NTT) ICM2017-72
We proposed the efficient generating method of whitelists for log monitoring, and showed its effectiveness. However, in... [more] ICM2017-72
pp.97-101
IPSJ-ARC, VLD, CPSY, RECONF, IPSJ-SLDM [detail] 2018-01-19
10:05
Kanagawa Raiosha, Hiyoshi Campus, Keio University Automatic Conversion from Snort PCRE to Verilog HDL
Masahiro Fukuda, Yasushi Inoguchi (JAIST) VLD2017-78 CPSY2017-122 RECONF2017-66
In this paper, we present how to automatically convert Snort's PCRE (Perl Compatible Regular Expressions) into Verilog H... [more] VLD2017-78 CPSY2017-122 RECONF2017-66
pp.95-100
VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC
(Joint) [detail]
2017-11-06
13:00
Kumamoto Kumamoto-Kenminkouryukan Parea FPGA Implementation of Pattern Matching of PCRE for NIDS and its Acceleration and Memory Saving
Masahiro Fukuda, Yasushi Inoguchi (JAIST) RECONF2017-37
In this paper, we explain about a development of a tool to automatically generate a circuit for pattern matching of Perl... [more] RECONF2017-37
pp.1-6
ET 2017-06-10
16:20
Shizuoka Shizuoka Univ. (Hamamatsu) Retrieving Mathematical Expressions Using Regular Expressions and Its Application to Extracting Mathematical Learning Items
Yoshinori Miyazaki, Yoshiya Kayukawa (Shizuoka Univ.), Shosaku Tanaka (Ritsumeikan Univ.) ET2017-19
In this study, we propose a web-based application for retrieving MathML-formatted math expressions which have two-dimens... [more] ET2017-19
pp.41-44
VLD 2017-03-02
09:00
Okinawa Okinawa Seinen Kaikan Generation of Optimum Screening Patterns for a Screening Circuit to Detect Network Intrusion
Tomoaki Hashimoto, Shinobu Nagayama, Masato Inagi, Shin'ichi Wakabayashi (Hiroshima City Univ.) VLD2016-108
In our previous study, we proposed a dedicated circuit, called a screening circuit, that screens packes on a network at ... [more] VLD2016-108
pp.37-42
MSS, SS 2017-01-26
15:20
Kyoto Kyoto Institute of Technology An Improvement of Naming Rule Testing Tool for Java Programming Learning
Shinpei Matsumoto, Nobuo Funabiki, Minoru Kuribayashi, Nobuya Ishihara (Okayama Univ.) MSS2016-64 SS2016-43
Java has been educated in many universities and professional schools due to the portability,safety,and easy learning. Th... [more] MSS2016-64 SS2016-43
pp.41-46
ICM, LOIS 2017-01-20
11:10
Nagasaki The Nagasaki Chamber of Commerce & Industry A Study on Improving the Operationality and the Performance of the Whitelist Generator
Shinichiro Goto, Hiroki Miura, Tetsuaki Kamata, Toyonori Fujiura, Masayoshi Nose (NTT) ICM2016-51 LOIS2016-60
We have proposed a log filtering method using whitelists with numeric character regular expression, and validated it thr... [more] ICM2016-51 LOIS2016-60
pp.69-74
COMP 2012-09-03
10:05
Tokyo Hosei University Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression
Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.) COMP2012-27
This paper is concerned with the following regular expression searching
problem which, given a regular expression $r$ ... [more]
COMP2012-27
pp.9-16
VLD 2012-03-07
11:10
Oita B-con Plaza Implmentation of Look-ahead Assertion for Pattern-independent Regular Expression Matching Engine
Yoichi Wakaba, Shinobu Nagayama, Masato Inagi, Shin'ichi Wakabayashi (Hiroshima City Univ.) VLD2011-136
In this paper, we propose a look-ahead assertion matching method for regular expression matching hardware engine. In net... [more] VLD2011-136
pp.97-102
TL 2012-02-04
13:35
Tokyo Kikai-Shinko-Kaikan Bldg (Room No. 2, B3 ) [Invited Talk] A corpus-based study of English expressions and constructions
Naohiro Takizawa (Nagoya Univ.) TL2011-58
Corpus-based research has gained a strong impetus during the past decade or so from the technological development of com... [more] TL2011-58
pp.23-28
COMP 2011-12-16
09:30
Aichi Nagoya Univ. A compact DFA representation using dual position automata
Hiroaki Yamamoto, Shogo Nakamura (Shinshu Univ.) COMP2011-36
This paper introduces an automaton model called {\em a dual position automaton}
(a dual PA), and then gives a bit-paral... [more]
COMP2011-36
pp.1-7
RECONF, VLD, CPSY, IPSJ-SLDM [detail] 2011-01-18
09:00
Kanagawa Keio Univ (Hiyoshi Campus) A Regular Expression Matching Circuit Based on Decomposed Automaton
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura (KIT) VLD2010-98 CPSY2010-53 RECONF2010-67
In this paper, we propose a regular expression matching circuit based on
a decomposed automaton.
To implement regular... [more]
VLD2010-98 CPSY2010-53 RECONF2010-67
pp.105-110
RECONF 2010-09-16
13:00
Shizuoka Shizuoka University (Faculty of Eng., Hall 2) A Regular Expression Matching Circuit Based on an NFA with Multi-Character Consuming
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura (KIT) RECONF2010-20
This paper shows an implementation of a regular expression circuit based on an NFA~(Non-deterministic finite automaton).... [more] RECONF2010-20
pp.13-18
COMP, IPSJ-AL 2010-05-19
14:30
Ishikawa Japan Advanced Institute of Science and Technology Efficient Pattern Matching for Acyclic Regular Expressions
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura (Hokkaido Univ.) COMP2010-11
A regular expression is \name{acyclic} if it is over the basis in $\Sigma$, dot ``$\cdot$'', and union ``$|$''. In this ... [more] COMP2010-11
pp.23-29
IPSJ-SLDM, VLD, CPSY, RECONF [detail] 2010-01-27
12:40
Kanagawa Keio Univ (Hiyoshi Campus) An efficient hardware-oriented algorithm for regular expression matching based on parallel bit-distribution
Yusaku Kaneta, Shingo Yoshizawa, Shin-ichi Minato, Hiroki Arimura, Yoshikazu Miyanaga (Hokkaido Univ.) VLD2009-90 CPSY2009-72 RECONF2009-75
In this paper, we study the regular expression matching problem for fast data stream processing. We present an efficient... [more] VLD2009-90 CPSY2009-72 RECONF2009-75
pp.131-136
IPSJ-SLDM, VLD, CPSY, RECONF [detail] 2010-01-27
13:05
Kanagawa Keio Univ (Hiyoshi Campus) Regular Expression Pattern Matching Hardware for Realizing Iteration of Strings Using Quantifiers
Yoichi Wakaba, Shin'ichi Wakabayashi, Shinobu Nagayama, Masato Inagi (Hiroshima City Univ) VLD2009-91 CPSY2009-73 RECONF2009-76
Regular expression pattern matching is a problem to find substrings in a given text,which match with a pattern represent... [more] VLD2009-91 CPSY2009-73 RECONF2009-76
pp.137-142
 Results 1 - 20 of 27  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan