start-ver=1.4 cd-journal=joma no-vol=4 cd-vols= no-issue= article-no= start-page=3780 end-page=3784 dt-received= dt-revised= dt-accepted= dt-pub-year=2000 dt-pub=200012 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Modeling uncertainty of large flexible structures with unknown modal parameters en-subtitle= kn-subtitle= en-abstract= kn-abstract=A procedure for control-oriented modeling of uncertainty is proposed for large flexible structures. Techniques on quantification of errors in modal truncated nominal models are developed for the case where a finite number of upper and lower bounds of the unknown modal parameters are given. A feasible set of systems matching the conditions is introduced, and then error bounds covering the feasible set are established in the frequency domain. The bounds are easily checked using linear programming for any user-specified frequency. The feasibility of the proposed scheme is illustrated by numerical study on an ideal flexible beam example. en-copyright= kn-copyright= en-aut-name=ImaiJun en-aut-sei=Imai en-aut-mei=Jun kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=WadaKiyoshi en-aut-sei=Wada en-aut-mei=Kiyoshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil= kn-affil=Department of Electrical and Electronic Engineering Okayama University affil-num=2 en-affil= kn-affil=Department of Electrical and Electronic Systems Engineering Kyushu University en-keyword=error analysis kn-keyword=error analysis en-keyword=flexible structures kn-keyword=flexible structures en-keyword=frequency-domain analysis kn-keyword=frequency-domain analysis en-keyword=linear programming kn-keyword=linear programming en-keyword=modelling kn-keyword=modelling en-keyword=parameter estimation kn-keyword=parameter estimation en-keyword=uncertain systems kn-keyword=uncertain systems END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=282 end-page=283 dt-received= dt-revised= dt-accepted= dt-pub-year=2003 dt-pub=200310 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Evaluating object and region of concentric electrode in bio-electrical impedance measurement en-subtitle= kn-subtitle= en-abstract= kn-abstract=Concentric electrode is easy to use and used widely for measuring bio-electrical impedance. But, its evaluating region was not investigated in detail. Then, the characteristics of concentric electrode were studied from various points of view. In case of use without electrode paste, impedance is determined with the contacting condition between electrode and skin surface over all frequency range. In case of use with electrode past, impedance is composed of stratum corneum in the frequency range of 20 Hz-1 kHz and is mainly composed of subcutaneous tissue in the range of 200 kHz-1 MHz. In the high frequency range, evaluating region of concentric electrode is the area less than the radius or the gap of center electrode. en-copyright= kn-copyright= en-aut-name=YamamotoYoshitake en-aut-sei=Yamamoto en-aut-mei=Yoshitake kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=ShiraiKiyoko en-aut-sei=Shirai en-aut-mei=Kiyoko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=GodaNoriko en-aut-sei=Goda en-aut-mei=Noriko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=NakamuraTakao en-aut-sei=Nakamura en-aut-mei=Takao kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=KusuharaToshimasa en-aut-sei=Kusuhara en-aut-mei=Toshimasa kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= en-aut-name=OkudaHiroyuki en-aut-sei=Okuda en-aut-mei=Hiroyuki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=6 ORCID= affil-num=1 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School affil-num=2 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School affil-num=3 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School affil-num=4 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School affil-num=5 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School affil-num=6 en-affil= kn-affil=Faculty of Health Sciences, Okayama University Medical School en-keyword=Bio-electrieal impedance kn-keyword=Bio-electrieal impedance en-keyword=skin impedance kn-keyword=skin impedance en-keyword=concentric electrode kn-keyword=concentric electrode en-keyword=evaluating kn-keyword=evaluating en-keyword=region kn-keyword=region END start-ver=1.4 cd-journal=joma no-vol=14 cd-vols= no-issue=2 article-no= start-page=654 end-page=657 dt-received= dt-revised= dt-accepted= dt-pub-year=2004 dt-pub=20046 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=The shielding effect of HTS power cable based on E-J power law en-subtitle= kn-subtitle= en-abstract= kn-abstract=A method for analysing the current distribution in high-T/sub c/ superconducting (HTS) power cable is examined by the aid of the novel use of anisotropic conductivity and 3-D finite element method considering E-J power law characteristic. The detailed current distribution in the cable is illustrated and the shielding effect of HTS shield layer with intervals is also examined. It is shown that AC losses in shield layer with intervals are increased when the interval between wires becomes large. en-copyright= kn-copyright= en-aut-name=MiyagiDaisuke en-aut-sei=Miyagi en-aut-mei=Daisuke kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=IwataSatoru en-aut-sei=Iwata en-aut-mei=Satoru kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=WakatsukiTomohiro en-aut-sei=Wakatsuki en-aut-mei=Tomohiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=TakahashiNorio en-aut-sei=Takahashi en-aut-mei=Norio kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=ToriiShinji en-aut-sei=Torii en-aut-mei=Shinji kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= en-aut-name=UedaKiyotaka en-aut-sei=Ueda en-aut-mei=Kiyotaka kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=6 ORCID= en-aut-name=YasudaKenji en-aut-sei=Yasuda en-aut-mei=Kenji kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=7 ORCID= affil-num=1 en-affil= kn-affil=Okayama University affil-num=2 en-affil= kn-affil=Okayama University affil-num=3 en-affil= kn-affil=Okayama University affil-num=4 en-affil= kn-affil=Okayama University affil-num=5 en-affil= kn-affil=Central Research Institute of Electric Power Industry affil-num=6 en-affil= kn-affil=Central Research Institute of Electric Power Industry affil-num=7 en-affil= kn-affil=Engineering Research Association for Superconductive Generation Equipment and Materials en-keyword=E-J power law characteristic kn-keyword=E-J power law characteristic en-keyword=HTS power cable kn-keyword=HTS power cable en-keyword=HTS shield kn-keyword=HTS shield en-keyword=3-D finite element analysis kn-keyword=3-D finite element analysis END start-ver=1.4 cd-journal=joma no-vol=2008 cd-vols= no-issue= article-no= start-page=46 end-page=51 dt-received= dt-revised= dt-accepted= dt-pub-year=2008 dt-pub=2008 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Design and Evaluation of a Bayesian-filter-based Image Spam Filtering Method en-subtitle= kn-subtitle= en-abstract= kn-abstract=In recent years, with the spread of the Internet, the number of spam e-mail has become one of the most serious problems. A recent report reveals that 91% of all e-mail exchanged in 2006 was spam. Using the Bayesian filter is a popular approach to distinguish between spam and legitimate e-mails. It applies the Bayes theory to identify spam. This filter proffers high filtering precision and is capable of detecting spam as per personal preferences. However, the number of image spam, which contains the spam message as an image, has been increasing rapidly. The Bayesian filter is not capable of distinguishing between image spam and legitimate e-mails since it learns from and examines only text data. Therefore, in this study, we propose an anti- image spam technique that uses image information such as file size. This technique can be easily implemented on the existing Bayesian filter. In addition, we report the results of the evaluations of this technique. en-copyright= kn-copyright= en-aut-name=UemuraMasahiro en-aut-sei=Uemura en-aut-mei=Masahiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=TabataToshihiro en-aut-sei=Tabata en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=image spam kn-keyword=image spam en-keyword=bayesian filter kn-keyword=bayesian filter en-keyword=image information kn-keyword=image information en-keyword=token kn-keyword=token END start-ver=1.4 cd-journal=joma no-vol=2 cd-vols= no-issue= article-no= start-page=97 end-page=101 dt-received= dt-revised= dt-accepted= dt-pub-year=2010 dt-pub=20100729 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=A kinesthetic-based collaborative learning system for distributed algorithms en-subtitle= kn-subtitle= en-abstract= kn-abstract=In this paper, we present a learning support system DASE-E to help students understand fundamental concepts of distributed algorithms in computer science. DASE-E is a collaborative learning system, in which the task of students is to devise a distributed algorithm. DASE-E offers a set of small wireless terminals with accelerometers. Each student plays the role of a process with a terminal, according to the algorithm that students devised. Each terminal enables a student to take physical actions that control the behavior of a process in the simulator. After the role playing simulation is finished, students discuss their activity played back on a screen. We implemented the system for learning distributed leader election algorithms, had a trial exercise in our research group, and we confirmed that it is effective to learn the critical part of distributed systems and algorithms. en-copyright= kn-copyright= en-aut-name=NagatakiHiroyuki en-aut-sei=Nagataki en-aut-mei=Hiroyuki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=FujiiTaichi en-aut-sei=Fujii en-aut-mei=Taichi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=YamauchiYukiko en-aut-sei=Yamauchi en-aut-mei=Yukiko kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=KakugawaHirotsugu en-aut-sei=Kakugawa en-aut-mei=Hirotsugu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=MasuzawaToshimitsu en-aut-sei=Masuzawa en-aut-mei=Toshimitsu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= affil-num=1 en-affil= kn-affil=Center for Faculty Development, Okayama University affil-num=2 en-affil= kn-affil=Graduate School of Information Science and Technology, Osaka University affil-num=3 en-affil= kn-affil=Graduate School of Information Science, Nara Institute of Science and Technology affil-num=4 en-affil= kn-affil=Graduate School of Information Science and Technology, Osaka University affil-num=5 en-affil= kn-affil=Graduate School of Information Science and Technology, Osaka University en-keyword=computer science education kn-keyword=computer science education en-keyword=distributed algorithm kn-keyword=distributed algorithm en-keyword=collaborative learning kn-keyword=collaborative learning en-keyword=kinesthetic learning activity kn-keyword=kinesthetic learning activity en-keyword=algorithm visualization kn-keyword=algorithm visualization END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=1628 end-page=1633 dt-received= dt-revised= dt-accepted= dt-pub-year=2013 dt-pub=2013 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Access Control to Prevent Attacks Exploiting Vulnerabilities of WebView in Android OS en-subtitle= kn-subtitle= en-abstract= kn-abstract=Android applications that using WebView can load and display web pages. Furthermore, by using the APIs provided in WebView, Android applications can interact with web pages. The interaction allows JavaScript code within the web pages to access resources on the Android device by using the Java object, which is registered into WebView. If this WebView feature were exploited by an attacker, JavaScript code could be used to launch attacks, such as stealing from or tampering personal information in the device. To address these threats, we propose a method that performs access control on the security-sensitive APIs at the Java object level. The proposed method uses static analysis to identify these security-sensitive APIs, detects threats at runtime, and notifies the user if threats are detected, thereby preventing attacks from web pages. en-copyright= kn-copyright= en-aut-name=YuJing en-aut-sei=Yu en-aut-mei=Jing kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=Java kn-keyword=Java en-keyword=Androids kn-keyword=Androids en-keyword=Humanoid robots kn-keyword=Humanoid robots en-keyword=Web pages kn-keyword=Web pages en-keyword=Smart phones kn-keyword=Smart phones en-keyword=Assembly kn-keyword=Assembly en-keyword=Browsers kn-keyword=Browsers END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=390 end-page=395 dt-received= dt-revised= dt-accepted= dt-pub-year=2015 dt-pub=201503 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Sound collection and visualization system enabled participatory and opportunistic sensing approaches en-subtitle= kn-subtitle= en-abstract= kn-abstract=This paper presents a sound collection system to visualize environmental sounds that are collected using a crowd-sourcing approach. An analysis of physical features is generally used to analyze sound properties; however, human beings not only analyze but also emotionally connect to sounds. If we want to visualize the sounds according to the characteristics of the listener, we need to collect not only the raw sound, but also the subjective feelings associated with them. For this purpose, we developed a sound collection system using a crowdsourcing approach to collect physical sounds, their statistics, and subjective evaluations simultaneously. We then conducted a sound collection experiment using the developed system on ten participants.We collected 6,257 samples of equivalent loudness levels and their locations, and 516 samples of sounds and their locations. Subjective evaluations by the participants are also included in the data. Next, we tried to visualize the sound on a map. The loudness levels are visualized as a color map and the sounds are visualized as icons which indicate the sound type. Finally, we conducted a discrimination experiment on the sound to implement a function of automatic conversion from sounds to appropriate icons. The classifier is trained on the basis of the GMM-UBM (Gaussian Mixture Model and Universal Background Model) method. Experimental results show that the F-measure is 0.52 and the AUC is 0.79. en-copyright= kn-copyright= en-aut-name=HaraSunao en-aut-sei=Hara en-aut-mei=Sunao kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=AbeMasanobu en-aut-sei=Abe en-aut-mei=Masanobu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=SoneharaNoboru en-aut-sei=Sonehara en-aut-mei=Noboru kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil= kn-affil=Graduate School of Natural Science and Technology Okayama University affil-num=2 en-affil= kn-affil=Graduate School of Natural Science and Technology Okayama University affil-num=3 en-affil= kn-affil=National Institute of Informatics END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=635 end-page=641 dt-received= dt-revised= dt-accepted= dt-pub-year=2016 dt-pub=201611 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Memory Access Monitoring and Disguising of Process Information to Avoid Attacks to Essential Services en-subtitle= kn-subtitle= en-abstract= kn-abstract=To prevent attacks on essential software and to mitigate damage, an attack avoiding method that complicates process identification from attackers is proposed. This method complicates the identification of essential services by replacing process information with dummy information. However, this method allows attackers to identify essential processes by detecting changes in process information. To address this problems and provide more complexity to process identification, this paper proposes a memory access monitoring by using a virtual machine monitor. By manipulating the page access permission, a virtual machine monitor detects page access, which includes process information, and replaces it with dummy information. This paper presents the design, implementation, and evaluation of the proposed method. en-copyright= kn-copyright= en-aut-name=SatoMasaya en-aut-sei=Sato en-aut-mei=Masaya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=TaniguchiHideo en-aut-sei=Taniguchi en-aut-mei=Hideo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=avoidance kn-keyword=avoidance en-keyword=process information kn-keyword=process information en-keyword=virtualization kn-keyword=virtualization END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=22 end-page=26 dt-received= dt-revised= dt-accepted= dt-pub-year=2016 dt-pub=201612 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=KRGuard: Kernel Rootkits Detection Method by Monitoring Branches Using Hardware Features en-subtitle= kn-subtitle= en-abstract= kn-abstract=Attacks on an operating system kernel using kernel rootkits pose a particularly serious threat. Detecting an attack is difficult when the operating system kernel is infected with a kernel rootkit. For this reason, handling an attack will be delayed causing an increase in the amount of damage done to a computer system. In this paper, we discuss KRGuard (Kernel Rootkits Guard), which is a new method to detect kernel rootkits that monitors branch records in the kernel space. Since many kernel rootkits make branches that differ from the usual branches in the kernel space, KRGuard can detect these differences by using hardware features of commodity processors. Our evaluation shows that KRGuard can detect kernel rootkits with small overhead. en-copyright= kn-copyright= en-aut-name=AkaoYohei en-aut-sei=Akao en-aut-mei=Yohei kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=Security kn-keyword=Security en-keyword=operating system kn-keyword=operating system en-keyword=kernel rootkit kn-keyword=kernel rootkit en-keyword=last branch record kn-keyword=last branch record END start-ver=1.4 cd-journal=joma no-vol=19 cd-vols= no-issue=2 article-no= start-page=58 end-page=64 dt-received= dt-revised= dt-accepted= dt-pub-year=2017 dt-pub=201703 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Probing Software Engineering Beliefs about System Testing Defects: Analyzing Data for Future Directions en-subtitle= kn-subtitle= en-abstract= kn-abstract= Research findings are often expressed as short startling sentences or software engineering (SE) beliefs such as “about 80 percent of the defects come from 20 percent of the modules” and “peer reviews catch 60 percent of the defects” [2]. Such SE beliefs are particularly important in industry, as they are attention-getting, easily understandable, and thus practically useful. In this paper we examine the power of such SE beliefs to justify process improvement through empirical validation of selected beliefs related to the increase or decrease of defects in system testing. We explore four basic SE beliefs in data from two midsize embedded software development organizations in Japan, and based on this information, identify possible process improvement actions for each organization. Based on our study, even small and medium-sized enterprises (SMEs) can use this approach to find possible directions to improve their process, which will result in better products. en-copyright= kn-copyright= en-aut-name=MondenAkito en-aut-sei=Monden en-aut-mei=Akito kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=TsunodaMasateru en-aut-sei=Tsunoda en-aut-mei=Masateru kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=BarkerMike en-aut-sei=Barker en-aut-mei=Mike kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=MatsumotoKenichi en-aut-sei=Matsumoto en-aut-mei=Kenichi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Department of Informatics, Faculty of Science and Engineering, Kindai University kn-affil= affil-num=3 en-affil=Graduate School of Information Science, Nara Institute of Science and Technology kn-affil= affil-num=4 en-affil=Graduate School of Information Science, Nara Institute of Science and Technology kn-affil= en-keyword=D.2.19 Software Quality/SQA kn-keyword=D.2.19 Software Quality/SQA en-keyword=D.2.8.c Process metrics kn-keyword=D.2.8.c Process metrics END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=1063 end-page=1069 dt-received= dt-revised= dt-accepted= dt-pub-year=2017 dt-pub=20173 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Access Control for Plugins in Cordova-Based Hybrid Applications en-subtitle= kn-subtitle= en-abstract= kn-abstract=Hybrid application frameworks such as Cordova allow mobile application (app) developers to create platformindependent apps. The code is written in JavaScript, with special APIs to access device resources in a platform-agnostic way. In this paper, we present a novel app-repackaging attack that repackages hybrid apps with malicious code; this code can exploit Cordova’s plugin interface to tamper with device resources. We further demonstrate a defense against this attack through the use of a novel runtime access control mechanism that restricts access based on the mobile user’s judgement. Our mechanism is easy to introduce to existing Cordova apps, and allows developers to produce apps that are resistant to app-repackaging attacks. en-copyright= kn-copyright= en-aut-name=KudoNaoki en-aut-sei=Kudo en-aut-mei=Naoki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=AustinThomas H. en-aut-sei=Austin en-aut-mei=Thomas H. kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=San Jose State University kn-affil= END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=398 end-page=404 dt-received= dt-revised= dt-accepted= dt-pub-year=2018 dt-pub=201811 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Mitigating Use-after-Free Attack Using Library Considering Size and Number of Freed Memory en-subtitle= kn-subtitle= en-abstract= kn-abstract=Use-after-free (UAF) vulnerabilities, which are abused by exploiting a dangling pointer that refers to a freed memory, execute an arbitrary code. The vulnerability is caused by bug in a program. In particular, it is contained in a large scale program such as browser. HeapRevolver [1] [2], which prohibits freed memory area from being reused for a certain period, has been proposed. HeapRevolver in Windows uses the number of the freed memory areas for prohibiting as a trigger to release the freed memory area. In other words, HeapRevolver uses the number of the freed memory areas as a threshold for releasing. However, when the size of individual freed memory areas is large, the HeapRevolver on Windows increases the memory overhead. In this paper, we propose improved HeapRevolver for Windows considering the size and number of the freed memory areas. Improved HeapRevolver enables to prohibit the reuse of the certain number of the freed memory areas at any time via the size and number of the freed memory areas as a threshold. The evaluation results show that the improved HeapRevolver can prevent attacks that exploiting UAF vulnerabilities. In particular, when the size of individual freed memory areas is small in the programs, it is effective to decrease the attack success rate. en-copyright= kn-copyright= en-aut-name=BanYuya en-aut-sei=Ban en-aut-mei=Yuya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= affil-num=1 en-affil= kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=Security kn-keyword=Security en-keyword=Use-After-Free kn-keyword=Use-After-Free en-keyword=dangling pointer kn-keyword=dangling pointer en-keyword=memory allocation kn-keyword=memory allocation END start-ver=1.4 cd-journal=joma no-vol=2019 cd-vols= no-issue= article-no= start-page=143 end-page=147 dt-received= dt-revised= dt-accepted= dt-pub-year=2019 dt-pub=201911 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Speech-like Emotional Sound Generator by WaveNet en-subtitle= kn-subtitle= en-abstract= kn-abstract=In this paper, we propose a new algorithm to generate Speech-like Emotional Sound (SES). Emotional information plays an important role in human communication, and speech is one of the most useful media to express emotions. Although, in general, speech conveys emotional information as well as linguistic information, we have undertaken the challenge to generate sounds that convey emotional information without linguistic information, which results in making conversations in human-machine interactions more natural in some situations by providing non-verbal emotional vocalizations. We call the generated sounds “speech-like”, because the sounds do not contain any linguistic information. For the purpose, we propose to employ WaveNet as a sound generator conditioned by only emotional IDs. The idea is quite different from WaveNet Vocoder that synthesizes speech using spectrum information as auxiliary features. The biggest advantage of the idea is to reduce the amount of emotional speech data for the training. The proposed algorithm consists of two steps. In the first step, WaveNet is trained to obtain phonetic features using a large speech database, and in the second step, WaveNet is re-trained using a small amount of emotional speech. Subjective listening evaluations showed that the SES could convey emotional information and was judged to sound like a human voice. en-copyright= kn-copyright= en-aut-name=MatsumotoKento en-aut-sei=Matsumoto en-aut-mei=Kento kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=HaraSunao en-aut-sei=Hara en-aut-mei=Sunao kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=AbeMasanobu en-aut-sei=Abe en-aut-mei=Masanobu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil=Okayama University kn-affil= affil-num=2 en-affil=Okayama University kn-affil= affil-num=3 en-affil=Okayama University kn-affil= END start-ver=1.4 cd-journal=joma no-vol=2019 cd-vols= no-issue= article-no= start-page=138 end-page=142 dt-received= dt-revised= dt-accepted= dt-pub-year=2019 dt-pub=201911 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=DNN-based Voice Conversion with Auxiliary Phonemic Information to Improve Intelligibility of Glossectomy Patients' Speech en-subtitle= kn-subtitle= en-abstract= kn-abstract=In this paper, we propose using phonemic information in addition to acoustic features to improve the intelligibility of speech uttered by patients with articulation disorders caused by a wide glossectomy. Our previous studies showed that voice conversion algorithm improves the quality of glossectomy patients' speech. However, losses in acoustic features of glossectomy patients' speech are so large that the quality of the reconstructed speech is low. To solve this problem, we explored potentials of several additional information to improve speech intelligibility. One of the candidates is phonemic information, more specifically Phoneme Labels as Auxiliary input (PLA). To combine both acoustic features and PLA, we employed a DNN-based algorithm. PLA is represented by a kind of one-of-k vector, i.e., PLA has a weight value (<; 1.0) that gradually changes in time axis, whereas one-of-k has a binary value (0 or 1). The results showed that the proposed algorithm reduced the mel-frequency cepstral distortion for all phonemes, and almost always improved intelligibility. Notably, the intelligibility was largely improved in phonemes /s/ and /z/, mainly because the tongue is used to sustain constriction to produces these phonemes. This indicates that PLA works well to compensate the lack of a tongue. en-copyright= kn-copyright= en-aut-name=MurakamiHiroki en-aut-sei=Murakami en-aut-mei=Hiroki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= affil-num=1 en-affil=Okayama University kn-affil= END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=20489448 end-page= dt-received= dt-revised= dt-accepted= dt-pub-year=2020 dt-pub=202011 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Method of Generating a Blacklist for Mobile Devices by Searching Malicious Websites en-subtitle= kn-subtitle= en-abstract= kn-abstract=As mobile devices have become more popular, malware and attacks directed at them have significantly increased. One of the methods to attack mobile devices is redirecting a user to unwanted websites by unwanted page transition. One of the countermeasures against such attacks is to generate a blacklist of URLs and hostnames, which can prevent access to malicious websites. To generate a blacklist, first, malicious websites are collected in the web space. Then, URLs and hostnames of the malicious websites are added to the blacklist. However, URLs of the malicious websites are typically changed frequently; thus, it is necessary to keep track of the malicious websites and update the blacklist in a timely manner. In this study, we proposed a method to generate blacklists for mobile devices by searching malicious websites. The method collects many HTML files from the web space using a crawler and searches for HTML files that are highly likely to be malicious using keywords extracted from the known malicious websites to discover the new ones. Thus, new malicious websites can be added to the blacklist in a timely manner. Using the proposed method, we discovered malicious websites that were not detected by Google Safe Browsing. Moreover, the blacklist generated using the method had a high detection rate for certain malicious websites. This paper reports the design process and the results of the evaluation of the new method. en-copyright= kn-copyright= en-aut-name=IshiharaTakashi en-aut-sei=Ishihara en-aut-mei=Takashi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=SatoMasaya en-aut-sei=Sato en-aut-mei=Masaya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=Malicious Websites kn-keyword=Malicious Websites en-keyword=Blacklist kn-keyword=Blacklist en-keyword=Web-based Attack kn-keyword=Web-based Attack en-keyword=Android kn-keyword=Android END start-ver=1.4 cd-journal=joma no-vol= cd-vols= no-issue= article-no= start-page=352 end-page=358 dt-received= dt-revised= dt-accepted= dt-pub-year=2021 dt-pub=202111 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Function for Tracing Diffusion of Classified Information to Support Multiple VMs with KVM en-subtitle= kn-subtitle= en-abstract= kn-abstract=To handle information leaks caused by administrative errors or mishandling, a function for tracing the diffusion of classified information using a virtual machine monitor (VMM) was proposed. However, the proposed function has not been investigated in cases in which virtual machines (VMs) allocated by multiple virtual central processing units (vCPUs) are to be monitored. In addition, cases in which multiple VMs are monitored have not been examined. In this study, we describe the support of multiple VMs for the proposed VMM-based tracing function. We also show how to deal with VMs allocated by multiple vCPUs. Furthermore, we report the evaluation results from assessing the traceability of the improved proposed method and its overhead for classified information when a VM with multiple vCPUs is monitored. en-copyright= kn-copyright= en-aut-name=OtaniKohei en-aut-sei=Otani en-aut-mei=Kohei kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=OkazakiToshiki en-aut-sei=Okazaki en-aut-mei=Toshiki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=YamauchiToshihiro en-aut-sei=Yamauchi en-aut-mei=Toshihiro kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=MoriyamaHideaki en-aut-sei=Moriyama en-aut-mei=Hideaki kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=SatoMasaya en-aut-sei=Sato en-aut-mei=Masaya kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= en-aut-name=TaniguchiHideo en-aut-sei=Taniguchi en-aut-mei=Hideo kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=6 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=4 en-affil=Department of Creative Engineering, National Institute of Technology, Ariake College kn-affil= affil-num=5 en-affil=Faculty of Computer Science and Systems Engineering, Okayama Prefectural University kn-affil= affil-num=6 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= en-keyword=Information leak prevention kn-keyword=Information leak prevention en-keyword=Virtualization kn-keyword=Virtualization en-keyword=VMM kn-keyword=VMM END start-ver=1.4 cd-journal=joma no-vol=10 cd-vols= no-issue= article-no= start-page=21109 end-page=21119 dt-received= dt-revised= dt-accepted= dt-pub-year=2022 dt-pub=2022 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Two-Dimensional RSSI-Based Indoor Localization Using Multiple Leaky Coaxial Cables With a Probabilistic Neural Network en-subtitle= kn-subtitle= en-abstract= kn-abstract=Received signal strength indicator (RSSI) based indoor localization technology has its irreplaceable advantages for many location-aware applications. It is becoming obvious that in the development of fifth-generation (5G) and future communication technology, indoor localization technology will play a key role in location-based application scenarios including smart home systems, manufacturing automation, health care, and robotics. Compared with wireless coverage using conventional monopole antenna, leaky coaxial cables (LCX) can generate a uniform and stable wireless coverage over a long-narrow linear-cell or irregular environment such as railway station and underground shopping-mall, especially for some manufacturing factories with wireless zone areas from a large number of mental machines. This paper presents a localization method using multiple leaky coaxial cables (LCX) for an indoor multipath-rich environment. Different from conventional localization methods based on time of arrival (TOA) or time difference of arrival (TDOA), we consider improving the localization accuracy by machine learning RSSI from LCX. We will present a probabilistic neural network (PNN) approach by utilizing RSSI from LCX. The proposal is aimed at the two-dimensional (2-D) localization in a trajectory. In addition, we also compared the performance of the RSSI-based PNN (RSSI-PNN) method and conventional TDOA method over the same environment. The results show the RSSI-PNN method is promising and more than 90% of the localization errors in the RSSI-PNN method are within 1 m. Compared with the conventional TDOA method, the RSSI-PNN method has better localization performance especially in the middle area of the wireless coverage of LCXs in the indoor environment. en-copyright= kn-copyright= en-aut-name=ZhuJunjie en-aut-sei=Zhu en-aut-mei=Junjie kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=HouPengcheng en-aut-sei=Hou en-aut-mei=Pengcheng kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=NagayamaKenta en-aut-sei=Nagayama en-aut-mei=Kenta kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=HouYafei en-aut-sei=Hou en-aut-mei=Yafei kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= en-aut-name=DennoSatoshi en-aut-sei=Denno en-aut-mei=Satoshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=5 ORCID= en-aut-name=FerdianRian en-aut-sei=Ferdian en-aut-mei=Rian kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=6 ORCID= affil-num=1 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=4 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=5 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=6 en-affil=Faculty of Information Technology, Andalas University kn-affil= en-keyword=Leaky coaxial cable(LCX) kn-keyword=Leaky coaxial cable(LCX) en-keyword=localization kn-keyword=localization en-keyword=RSSI kn-keyword=RSSI en-keyword=neural network kn-keyword=neural network END start-ver=1.4 cd-journal=joma no-vol=11 cd-vols= no-issue= article-no= start-page=4740 end-page=4751 dt-received= dt-revised= dt-accepted= dt-pub-year=2023 dt-pub=20230111 dt-online= en-article= kn-article= en-subject= kn-subject= en-title= kn-title=Reduction in Eddy Current Loss of Special Rectangular Windings in High-Torque IPMSM Used for Wind Generator en-subtitle= kn-subtitle= en-abstract= kn-abstract=A special rectangular winding structure, which has different cross-sectional shape but the same cross-sectional area for each turn, has been adopted in a high-torque IPMSM used for a wind generator to improve slot factor and heat dissipation. However, large eddy current loss occurs to the rectangular windings. According to this problem, this paper proposes three improvements to reduce the eddy current loss. Among them, removing a portion of windings and replacing a portion of windings with aluminum are discussed to realize a tradeoff between eddy current and copper losses. And adjusting the tooth-tip shape is discussed to suppress the magnetic flux passing through the windings by mitigating magnetic saturation around the tooth-tip. Additionally, manufacturing costs can also be reduced by adopting a portion of aluminum windings. Moreover, a 3-step-skewed rotor structure is discussed to reduce cogging torque and lower the start-up wind speed. And its influence on losses is also discussed. Furthermore, three models adopting round windings are made and discussed for comparison. The FEM (Finite Element Method) results show that compared with the three round windings models, the proposed model still has a better performance in the reduction of windings eddy current loss. Finally, a prototype machine is manufactured to verify the FEM results, and the experimental results show that the maximum efficiency of the prototype can exceed 97.5%. en-copyright= kn-copyright= en-aut-name=TaoXianji en-aut-sei=Tao en-aut-mei=Xianji kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=1 ORCID= en-aut-name=TakemotoMasatsugu en-aut-sei=Takemoto en-aut-mei=Masatsugu kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=2 ORCID= en-aut-name=TsunataRen en-aut-sei=Tsunata en-aut-mei=Ren kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=3 ORCID= en-aut-name=OgasawaraSatoshi en-aut-sei=Ogasawara en-aut-mei=Satoshi kn-aut-name= kn-aut-sei= kn-aut-mei= aut-affil-num=4 ORCID= affil-num=1 en-affil=Graduate School of Information and Technology, Hokkaido University kn-affil= affil-num=2 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=3 en-affil=Graduate School of Natural Science and Technology, Okayama University kn-affil= affil-num=4 en-affil=Graduate School of Information and Technology, Hokkaido University kn-affil= en-keyword=IPMSM kn-keyword=IPMSM en-keyword=IPMSG kn-keyword=IPMSG en-keyword=high-torque kn-keyword=high-torque en-keyword=concentrated windings kn-keyword=concentrated windings en-keyword=rectangular windings kn-keyword=rectangular windings en-keyword=eddy current loss kn-keyword=eddy current loss en-keyword=wind generator kn-keyword=wind generator END