Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
NLC 
20170908 10:00 
Tokyo 
Seikei University 
An attempt to extract bill lists for collecting bills of local councils Takuma Tanaka (TUT), Hiroki Sakaji (The Univ of Tokyo), Akio Kobayashi (AIP), Yasutomo Kimura (Otaru Univ of Commerce), Shigeru Masuyama (TUT) NLC201723 
Abstract In councils of local governments (local council for short), bills are submitted by its head, committees,and mem... [more] 
NLC201723 pp.4146 
NLC, TL 
20160604 16:00 
Hokkaido 
Otaru University of Commerce 
Brand Identity Extraction from Customers' Viewpoint for Agricultural Products. Akio Kobayashi, Shun Tanaka, Shigeru Masuyama (TUT) TL20165 NLC20165 
(Advance abstract in Japanese is available) [more] 
TL20165 NLC20165 pp.1922 
NLC 
20150910 14:00 
Tokyo 
Convention Room AP ShibuyaDogenzaka (Tokyo) 
An analysis of articles for software licence agreement Takuji Sakurai, Akio Kobayashi, Shigeru Masuyama (Toyohashi Tech) NLC201521 
Software licence agreement(SLA) is a contract that permits users to use software.
It describes rights, prohibition, and... [more] 
NLC201521 pp.2529 
NLC 
20140912 10:20 
Tokyo 
Yahoo Japan Inc., 11F Seminar Room 
Extraction of the useful reviews from Kakaku.com(Price.com) Yudai Abe, Akio Kobayashi, Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC201423 
"Kakaku.com" (Price.com) is one of a review site on the Web. Consumers can read a product's review that are written by o... [more] 
NLC201423 pp.2730 
NLC 
20140912 13:00 
Tokyo 
Yahoo Japan Inc., 11F Seminar Room 
Structuring thread contents of Kakaku.com's review bulletin board Yuta Arai, Akio Kobayashi, Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC201425 
Nowadays, there are vast information in the Internet. When troubles of consumer electronics happen, customers often find... [more] 
NLC201425 pp.3740 
NLC 
20140912 13:50 
Tokyo 
Yahoo Japan Inc., 11F Seminar Room 
Classification of comments on Nico Nico Douga for annotation based on referred contents Akihito Ikeda, Akio Kobayashi (Toyohashi Univ. of Tech.), Hiroki Sakaji (Seikei Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech.) NLC201427 
For Nico Nico Douga, a video sharing website in Japan, one of the largest feature is posted comments. The comments are o... [more] 
NLC201427 pp.4752 
COMP 
20140902 10:30 
Aichi 
Toyohashi University of Technology 
A linear time algorithm for finding a spanning tree with nonterminal set $V_{NT}$ on cographs Shinichi Nakayama (Univ. of Tokushima), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP201416 
[more] 
COMP201416 pp.916 
COMP 
20140902 11:00 
Aichi 
Toyohashi University of Technology 
An Algorithm for Feedback Vertex Set Problem on a Nondegenerate Circulararc Graph Hirotoshi Honma, Yoko Nakajima (Kushiro NCT), Shigeru Masuyama (Toyohashi Univ. Tech.) COMP201417 
[more] 
COMP201417 pp.1722 
COMP 
20140902 13:30 
Aichi 
Toyohashi University of Technology 
[Invited Talk]
Modeling and Algorithm/Complexity Theory
 Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples  Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP201419 
This paper discuss and suggest how knowledge on algorithm design theory and computational complexity theory help to mo... [more] 
COMP201419 pp.2934 
NLC 
20110707 13:35 
Tokyo 
IBM Japan, Ltd. 
An Extraction Method of Causal Knowledge from Newspaper Corpus Hiroki Sakaji, Shigeru Masuyama (TUT) NLC20112 
This paper proposes a method that extracts causal knowledge from news paper articles via clue expressions.
Our method d... [more] 
NLC20112 pp.710 
NLC, IPSJNL 
20100723 11:30 
Miyagi 
Tohoku Univeristy 
Determining Causal Relation at Sentences in Newspaper Articles Hiroki Sakaji, Shigeru Masuyama, Hiroyuki Sakai (Toyohashi Univ. of Tech.) NLC20104 
We propose a method for determining causal relation in newspaper sentences with clue expressions.
Clue expressions in... [more] 
NLC20104 pp.4750 
SS 
20090302 15:15 
Saga 
Saga University 
An Application development using the object oriented language based on an improvement taint model Kiyotaka Atsumi (Suzuka National Coll. of Tech.), Shigeru Masuyama (Toyohashi Univ. of Tech.) SS200850 
Although the taint model and sandbox model are proposed as a security
model of a programming language, we have proposed... [more] 
SS200850 pp.1316 
COMP 
20080911 09:30 
Aichi 
Nagoya Inst. of Tech. 
Counting Connected Spanning Subgraphs with at Most p+q+1 Edges in a Complete Bipartite Graph Kp,q Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Technology) COMP200824 
Let $N_{i}(G)$ denote the number of connected spanning $i$edge subgraphs
in an $n$vertex $m$edge undirected graph $... [more] 
COMP200824 pp.916 
COMP 
20080616 15:35 
Ishikawa 
JAIST 
Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}e$, $K_{n}\cdot e$ Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) COMP200821 
Let $N_{i}(G)$ denote the number of connected spanning $i$edge subgraphs
in an $n$vertex $m$edge undirected graph $... [more] 
COMP200821 pp.4348 
COMP 
20071214 16:15 
Hiroshima 
Hiroshima University 
Formulas on the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyahashi Univ. of Tech.) COMP200753 
Let $N_{i}$ be the number of all connected spanning subgraphs
with $i(n1\leq i\leq m)$ edges in an $n$vertex $m$edg... [more] 
COMP200753 pp.3542 
COMP 
20070920 11:10 
Aichi 

Techniques to Accelerate Request Processing for Byzantine Fault Tolerance Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP200734 
[more] 
COMP200734 pp.1320 
COMP 
20070920 16:25 
Aichi 

A Proof of Unimodality on the Numbers of Connected Spanning Subgraphs in an $n$Vertex Graph with at Least $\bigl\lceil(32\sqrt{2})n^2+n\frac{72\sqrt{2}}{2\sqrt{2}}\bigr\rceil$ Edges Peng Cheng (Nagoya Gakuin Univ), Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP200740 
Consider an undirected simple graph $G=(V,E)$ with $n$ vertices and $m$ edges, and let $N_{i}$ be the number of connecte... [more] 
COMP200740 pp.5966 
COMP 
20061017 11:35 
Miyagi 
Tohoku University 
Byzantine Agreement on the Order of Processing Received Requests is Solvable Deterministically in Asynchronous Systems Junya Nakamura (Toyohashi Univ. of Tech.), Tadashi Araragi (NTT), Shigeru Masuyama (Toyohashi Univ. of Tech.) 
In an asynchronous distributed system, a faulttolerant method based on system replication has been introduced.
Replica... [more] 
COMP200635 pp.3340 
NLC 
20060202 16:15 
Shiga 
Laforet Biwako 
Similar Part Detection for Term Papers Takahisa Ota, Shigeru Masuyama (TUT) 
[more] 
NLC2005112 pp.3742 
NLC 
20060203 10:30 
Shiga 
Laforet Biwako 
Estimating Sentiment Score of Links in Weblog
 For Improvement of Finding Web Communities  Koji Matsuda, Yuji Yamamoto, Hiroyuki Sakai, Shigeru Masuyama (TUT) 
[more] 
NLC2005116 pp.1318 