| 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 # | |
| IT | 2023-08-04 11:25 |
Kanagawa | Shonan Institute of Technology (Primary: On-site, Secondary: Online) |
Constructing Visual Cryptography Schemes for Multiple Images Using SAT Technology Tako Hiroaki (Univ. Yamanashi), Xiao-Nan Lu (Gifu Univ.), Nabeshima Hidetomo (Univ. Yamanashi)  IT2023-25 |
The visual cryptography scheme (VCS) is a type of secret sharing scheme for images.The VCS uses matrices called basis ma... [more] | IT2023-25 pp.62-67 |
| COMP, IPSJ-AL | 2021-05-08 13:30 |
Online | Online | [Invited Talk]
Overview and Prospective Reserch Activities of Grant-in-Aid for Transformative Research Areas: Algorithmic Foundations for Social Advancement (AFSA) Project Shin-ichi Minato (Kyoto Univ.) COMP2021-8 |
Algorithms, the techniques of logical procedures of information processing, perform a key part of the recent sophisticat... [more] | COMP2021-8 p.54 |
| NLP, CAS | 2019-10-22 09:15 |
Gifu | Gifu Univ. | Constraint Satisfaction Problem Solver by Hysteresis Neural Networks Takumi Genka, Kenya Jin'no (Tokyo City Univ.) CAS2019-24 NLP2019-64 |
Since solving Constraint Satisfaction Problems (CSPs) is very important, therefore, many solving methods are proposed. T... [more] | CAS2019-24 NLP2019-64 pp.7-10 |
| AI | 2018-07-02 10:25 |
Hokkaido | Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2 |
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] | AI2018-2 pp.7-10 |
|
| VLD, HWS (Joint) |
2018-02-28 11:00 |
Okinawa | Okinawa Seinen Kaikan | A fast routing method for multi-terminal nets using constraint satisfaction problem Saki Yamaguchi, Yasuhiro Takashima (Univ. of Kitakyushu) VLD2017-92 |
In this paper, we propose a fast routing method using constraint satisfaction problem (CSP) for multi-terminal nets. I... [more] |
VLD2017-92 pp.19-24 |
| CS, NS, IN, NV (Joint) |
2017-09-08 11:15 |
Miyagi | Research Institute of Electrical Communication, Tohoku Univ. | A Method for determining paths of low delay communication flows in industrial networks Makoto Kubomi, Takeshi Suehiro, Ryuma Matsushita, Yoshifumi Hotta, Ryusuke Kawate (Mitsubishi Electric) NS2017-83 |
Ethernet has been applied to industrial in-vehicle, train and factory networks due to its high capacity and cost effecti... [more] | NS2017-83 pp.73-78 |
| KBSE | 2016-05-27 10:00 |
Tokyo | Doshisha Univ. Tokyo Branch Office | Reducing the number of mutants with equivalent bug detection ability Tomohiro Ueno, Hirohide Haga (Doshisha Univ.) KBSE2016-5 |
Mutation analysis is a method to evaluate the software test cases set quality. In mutation analysis, mutant programs are... [more] | KBSE2016-5 pp.25-30 |
| KBSE | 2014-03-07 13:10 |
Okinawa | Okinawaken-Seinenkaikan | An Implementation Methodology for Business Systems Based on Unidirectional Constraint Propagation
-- A Case Study of Local Tax Processing -- Hiromasa Yano, Hiroki Kuwayama, Shigeo Kaneda (Doshisha Univ.) KBSE2013-94 |
ICT systems for business applications must accept not only basic business work-flows but also modification of the former... [more] | KBSE2013-94 pp.91-96 |
| SS, KBSE | 2013-07-25 13:30 |
Hokkaido | Fuzzy Constraint Satisfaction Applied to Class Responsibility Assignment Problems Takuto Yanagida (Shizuoka Univ.), Shinpei Hayashi, Motoshi Saeki (Tokyo Inst. of Tech.), Hidenori Mimura (Shizuoka Univ.) SS2013-15 KBSE2013-15 |
The authors formulate the class responsibility assignment (CRA) problem as the fuzzy constraint satisfaction problem (FC... [more] | SS2013-15 KBSE2013-15 pp.13-18 |
|
| ITS, IE, ITE-AIT, ITE-HI, ITE-ME [detail] | 2011-02-22 15:10 |
Hokkaido | Hokkaido University | Color Scheme Adjustment with Categorical Perception for Three Types of Color Vision Deficiency Takuto Yanagida (Shizuoka Univ.), Katsunori Okajima (Yokohama National Univ.), Hidenori Mimura (Shizuoka Univ.) ITS2010-65 IE2010-140 |
We propose an improved formulation of the problem of color scheme adjustment and its implementation, taking into account... [more] | ITS2010-65 IE2010-140 pp.275-280 |
| ICM | 2010-07-09 11:20 |
Hokkaido | Future University Hakodate | Proposal of an Unified Changing Method using Constraint Approaches in Continuity Check Configurations Hajime Nakajima, Takeshi Masuda, Yukio Akiyama (NTT Corp.) ICM2010-21 |
ETH-CC (Ethernet Continuity Check), which is standardized as one of functions in Ethernet OAM, have attracted attention ... [more] | ICM2010-21 pp.73-78 |
| COMP | 2009-05-26 09:30 |
Saitama | Saitama Univ. | * Hiromu Suzuki, Shin-ichi Minato (Hokkaido Univ.) COMP2009-9 |
Binary Decision Diagram (BDD) is a graph-based representation of Boolean function. BDDs can compactly represent and eff... [more] |
COMP2009-9 pp.1-7 |
| ICM | 2008-03-14 10:45 |
Okinawa | Scalability Improvement of the Process Model Generating Engine based on Multiple Business Aspects Takeshi Masuda, Tetsuya Yamamura (NTT) TM2007-61 |
In the business process model based on multiple business aspects, it is difficult to describe the transaction in detaile... [more] | TM2007-61 pp.49-54 |
|
| ET | 2008-01-26 10:20 |
Ibaraki | Tsukuba Univ. of Technology | A Matching Method for Dispatch of Teacher based on Task and Budget Hiroshi Date, Tokuro Matsuo (Yamagata Univ.) ET2007-71 |
We propose an efficient pairing method for tutors dispatch. College-going rate is increasing year by year. Moreover, col... [more] | ET2007-71 pp.13-18 |
| AI | 2006-12-01 09:30 |
Tokyo | MEW(Shiodome) | An implementation of the control method for consumer electronics based on earthquake early warning Takashi Kokawa, Ryota Sakamoto, Hitoshi Ogawa (Ritsumeikan Univ.) |
In Japan, earthquakes happen on a regular basis. There is an earthquake early warning system operated by the Japan Meteo... [more] | AI2006-25 pp.1-6 |
| ICM | 2006-07-14 11:40 |
Akita | Akita University | [Encouragement Talk]
Speed-up of a Network Resource Allocation Method Allowing for Variety of Operation and Network Configuration Shiro Ogasawara, Kenichi Tayama, Takeshi Masuda, Tetsuya Yamamura (NTT) TM2006-36 |
For allocating resources of optical access networks, a method which exploits constraint satisfaction problem (CSP) techn... [more] | TM2006-36 pp.89-94 |
| ICM, NS, CQ (Joint) |
2005-11-18 09:50 |
Shimane | Kunibiki-messe (Matsue city) | Improvement of A Network Resource Allocation Method Supporting Flexible Operation for Various Network Configuration Shiro Ogasawara, Kenichi Tayama, Masaya Shibaki, Tetsuya Yamamura (NTT) |
For allocating resources of optical access networks, a method which exploits constraint satisfaction problem (CSP) techn... [more] | TM2005-36 pp.47-52 |
| AI | 2004-06-21 10:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A decision-making system in consideration of one's tastes Takashi Kokawa, Hitoshi Ogawa (Ritsumei Univ.) |
In this paper, the process in which people make decisions is caught with “Achievement Weighted Constraint Satisfaction P... [more] | AI2004-1 pp.1-6 |
[Return to Top Page]