Norio Shiratori

Norio Shiratori

Auto-generated profile, based on publicly available information

Norio Shiratori

Chuo University

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 November 2002
Verified
Conference Paper
Closed access
JSJ. Sekiba
J. Sekiba
GKG. Kitagata
G. Kitagata
TSTakuo Suganuma
Takuo Suganuma
Tetsuo KinoshitaTetsuo Kinoshita
Tetsuo Kinoshita
KOK. Okada
K. Okada
NSN. Shiratori
N. Shiratori
Asynchronous messaging systems like e-mail systems need some advanced characteristics, such as intelligence, controllability and scalability, to accomplish more effective and sophisticated message handling. We propose a framework of next generation messaging systems, Flexible Asynchronous Messaging System (FAMES), which consists of autonomous and collaborative software agents. In FAMES, various messaging functions composing of agents can be utilized to integrate heterogeneous user environment. Moreover, FAMES operates message flow in an intelligent manner, considering the receiver's own convenience and that flexible message delivery can be achieved. We designed and implemented the proposed system based on multi agent technology, and we show its effectiveness through experimental studies using a prototype system.

1 November 2021
Verified
Conference Paper
Closed access
YHYojiro Harie
Yojiro Harie
SNSangam Babu Neupane
Sangam Babu Neupane
BGBishnu Prasad Gautam
Bishnu Prasad Gautam
SNShiratori Norio
Shiratori Norio
Wild Deer’s grazing in farmers and villager’s field has caused serious troubles for the residents and concerned authorities here in Northern Hokkaido of Japan. Furthermore, the number of deer in northern Japan is increasing rapidly leading to increment in road accidents which is also becoming a serious problem that needs to be handled. Several procedures have been followed to avoid or at least minimize the destruction caused by the white-tailed deer, but a solid solution is yet to be found. To this context, we are proposing a highly effective solutions to identify the individual wild deer and pinpoint the most trouble causing group of deer’s using augmented triplet network, a novel technique of computer vision. Initially the deer are recognized and classified individually which will help us track the deer and know the behavior of the deer in depth. Our research method identifies individual deer using several steps where we initially take video feed which is further divided into several frames. The extracted frames are then cleaned and processed for the training efficiency. The cleaned frames are then sent to the Convolution Network where the Nested triplet loss is calculated for the maximum accuracy.

1 January 2003
Verified
Conference Paper
Closed access
ACA. Chayabejara
A. Chayabejara
SZS.M.S. Zabir
S.M.S. Zabir
NSN. Shiratori
N. Shiratori
The IEEE 802.11 protocol solves hidden terminal problem using a four way handshaking mechanism. In this protocol, channel probing and reservation are made by using a small request-to-send (RTS) frame at the beginning of a transmission. This effectively detects and avoids collisions. However, the protocol lacks the ability to release or reallocate a channel that was reserved but not used. For multihops, like mobile ad hoc networks (MANET), this often keeps the channel unnecessarily inaccessible resulting in inefficient channel utilization. In this paper, we therefore propose a new mechanism to improve performance of IEEE 802.11 in MANET. Our mechanism utilizes channel capacity that is otherwise wasted. This leads to a higher yield in throughput by up to 10%. In addition, our proposed mechanism is free from compatibility problems with standard IEEE 802.11. Results from extensive simulations verify the effectiveness of our scheme.

1 January 2000
Verified
Book Chapter
Closed access
PDF file
TKTakashi Katoh
Takashi Katoh
Tetsuo KinoshitaTetsuo Kinoshita
Tetsuo Kinoshita
NSNorio Shiratori
Norio Shiratori

1 January 2025 in Nonlinear Theory and Its Applications, IEICE
Verified
Journal Article
Open access
PDF file
HMHirofumi Miyajima
Hirofumi Miyajima
NSNoritaka Shigei
Noritaka Shigei
NSNorio Shiratori
Norio Shiratori
This paper proposes an autonomous and secure distributed Neural Gas (NG) method using decomposed data on multiple servers uniformly distributed in a ring shape and connected only to neighboring servers. The advantages of the proposed method are that learning can be performed with decomposed data and parameters, thus ensuring the confidentiality of the data and parameters; the distributed processing system is easy to connect; and servers can be easily added or removed because of the uniform structure where all servers perform the same operations. There are two types of learning targeted by the secure distributed processing: supervised and unsupervised learning. In the previous paper, we proposed the Back Propatation (BP) method as an example of the former. Here, we propose the NG and k-means methods as examples of the latter. The advantage of unsupervised learning is that it can discover trends and segments found in given data without labels (correct answers) for machine learning. Since there is no need to obtain correct answer data in advance, this learning method can be used for a wider range of tasks. The effectiveness of the proposed NG and k-means methods of secure distributed processing is demonstrated by comparing it with conventional methods through numerical simulations of clustering.

1 January 2023 in Nonlinear Theory and Its Applications, IEICE
Verified
Journal Article
Open access
PDF file
HMHirofumi Miyajima
Hirofumi Miyajima
NSNoritaka Shigei
Noritaka Shigei
HMHiromi Miyajima
Hiromi Miyajima
NSNorio Shiratori
Norio Shiratori
Much research on secure and safe AI analysis methods for users has been conducted. They are 1) secure multiparty computation (SMC), 2) quasi-homomorphic encryption, 3) federated learning (FL), and so on. It is known that both utility and confidentiality are essential for machine learning using confidential data. However, there is a trade-off between them. In the previous paper, we proposed a learning method for secure distributed processing using decomposition data and parameters. The characteristic feature of this method is to achieve high confidentiality through distributed processing with decomposed data and parameters. On the other hand, the realization of machine learning through the distribution and integration of decomposition data leads to an increase in computational complexity and a deterioration of computational accuracy. In particular, while increasing the number of servers improves confidentiality, this problem becomes more pronounced. In this paper, we propose scalability improvement of simplified, secure distributed processing methods of BP and NG methods to suppress the computational complexity associated with an increase in the number of servers and demonstrate its effectiveness through a numerical simulation.