著者

Haruhiko Okumura

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.22, no.4, pp.566-573, 2014 (Released:2014-10-15)

参考文献数

55

被引用文献数

2

---

“3.11”—the worst disaster in postwar Japanese history, consisting of the Great East Japan Earthquake (March 11, 2011), the subsequent tsunami and the nuclear accident at the Fukushima Daiichi power plant—taught us many valuable lessons. This paper reviews the disaster from a computer scientist's perspective, paying special attention to the problem of presenting data to the public, and discusses what we could do and can still do.

著者

Songpon Teerakanok Tetsutaro Uehara Atsuo Inomata

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.29, pp.381-391, 2021 (Released:2021-05-15)

参考文献数

12

被引用文献数

1

---

In this paper, a generic framework for IoT device registration is proposed. Unlike existing approaches, the proposed method is designed to provide a high level of compatibility, allowing it to work well with devices from different manufacturers. Furthermore, this framework requires only some commonly available technologies (like Bluetooth or BLE) to perform, making it highly applicable to most of the current generation of smart devices available in the market. With security and user-friendliness in mind, the developed registration protocol requires less user interaction while maintaining a considerable high level of security against various types of attacks, i.e., eavesdropping, replay attacks, modification, and man-in-the-middle attack.

著者

Masami Hagiya

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.23, no.4, pp.525-530, 2015 (Released:2015-07-15)

参考文献数

16

被引用文献数

11

---

The Science Council of Japan's Committee on Informatics is currently creating a reference standard in informatics. This activity includes defining informatics for university education and for the future academic development of informatics. The most characteristic feature of the chosen definition of informatics is the desire to cover all branches of informatics across bun-kei (social sciences and humanities) and ri-kei (natural science and engineering), with the intention of unifying the field. In the present paper, the background of the activity, and the motivation and implications of the definition of informatics are presented. In particular, we discuss the importance of covering bun-kei and ri-kei for the future development of informatics and the implications of the definition on liberal arts education in universities and primary and secondary education in elementary, middle and high schools.

著者

Naoki Kobayakawa Mitsuyoshi Imamura Kei Nakagawa Kenichi Yoshida

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.28, pp.650-657, 2020 (Released:2020-09-15)

参考文献数

28

---

Open source software (OSS) has become indispensable to our society. The success of OSS depends on the participation of a large number of developers or maintainers (contributors). Shedding light on the mechanisms of their participation has been an important academic and practical matter. One aspect to decide participation is the future prospects of a project. However, the causal mechanism behind participation has yet to be studied exhaustively and remains unclear. In this study, we used cryptocurrency projects, many of them were developed on GitHub, to better understand this mechanism. Both GitHub and cryptocurrencies are highly transparent, i.e., information is fully disclosed; we can analyze relevant information on a project, such as the contributors' activities, financial information, and development status. We adopted market capitalization as the substitution index of future prospects and the number of contributors and analyzed the relationship using time series analysis techniques, such as the Granger causality test and regression. We found that the number of contributors increases two months after market capitalization increases. This quantifies the impact of the future prospects of the project, i.e., of the market capitalization of a cryptocurrency, on the participation of contributors.

著者

Yuta Sawabe Daiki Chiba Mitsuaki Akiyama Shigeki Goto

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.27, pp.536-544, 2019 (Released:2019-09-15)

参考文献数

29

被引用文献数

2

---

Currently, many attacks are targeting legitimate domain names. In homograph attacks, attackers exploit human visual misrecognition, thereby leading users to visit different (fake) sites. These attacks involve the generation of new domain names that appear similar to an existing legitimate domain name by replacing several characters in the legitimate name with others that are visually similar. Specifically, internationalized domain names (IDNs), which may contain non-ASCII characters, can be used to generate/register many similar IDNs (homograph IDNs) for their application as phishing sites. A conventional method of detecting such homograph IDNs uses a predefined mapping between ASCII and similar non-ASCII characters. However, this approach has two major limitations: (1) it cannot detect homograph IDNs comprising characters that are not defined in the mapping and (2) the mapping must be manually updated. Herein, we propose a new method for detecting homograph IDNs using optical character recognition (OCR). By focusing on the idea that homograph IDNs are visually similar to legitimate domain names, we leverage OCR techniques to recognize such similarities automatically. Further, we compare our approach with a conventional method in evaluations employing 3.19 million real (registered) and 10, 000 malicious IDNs. Results reveal that our method can automatically detect homograph IDNs that cannot be detected when using the conventional approach.

著者

Tomoya Kitani

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.28, pp.3-15, 2020 (Released:2020-01-15)

参考文献数

41

被引用文献数

1

---

In this paper, we describe the current situation of the motorcycle industry, the world's markets, and the trend of motorcycle researches. The purpose is to promote researches and developments of motorcycles so that motorcycles become safer and more convenient, and people will obtain good user-experiences (UX) with their motorcycle in their life. We summarize the current research issues and the current social issues about motorcycles, and then we introduce a solution for them with informatics and its related science and engineering. To make a motorcycle safer and to enhance its mobility, it is essential to investigate the motorcycle dynamics. The motion of a rider is also essential, and it affects the motorcycle motion, whereas the motion of a car driver seldom affects the car motion. It is because the weight of a rider is large enough, comparing to the weight of a motorcycle, and a rider usually moves widely to operate the motorcycle. In order to investigate the dynamics of the motorcycle system, which consists of a motorcycle itself and a rider, it is required to obtain appropriate sensing data of both the motorcycle and the rider to improve the knowledge of the dynamics by the data. Such data and knowledge can be applied to other applications and services such as sensing road traffic conditions. In this paper, we introduce the concept of the research project, Bikeinformatics, and the capability of GNSS precise positioning to append adequate labels to measured data with low-cost sensors.

著者

Tom Altman Yoshihide Igarashi

出版者

一般社団法人情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.12, no.2, pp.154-158, 1989-08-25

---

We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l a_2 . . . a_n) is k-sorted if for all 1&les;i j&les;n i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k) respectively. Finally parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k) where f(t) is the computing time of an algorithm used for finding the median among t elements.We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l, a_2, . . . , a_n) is k-sorted if for all 1&les;i,j&les;n,i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next, we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k), respectively. Finally, parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k), where f(t) is the computing time of an algorithm used for finding the median among t elements.

著者

Xuping Huang Nobutaka Ono Akira Nishimura Isao Echizen

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.25, pp.469-476, 2017 (Released:2017-07-15)

参考文献数

28

被引用文献数

4

---

Reversible audio information hiding and sample-scanning methods are proposed for digital audio content to achieve detailed detection and localization of tampered positions in each frame. The method proposed in this study allows detecting multiple tampering and reusing reliable content as well as avoiding false detection which were impossible for other methods to simultaneously achieve. In the proposed method, the original signal is partitioned into fixed-length frames and then transformed into discrete cosine transform (DCT) coefficients by the integer modified DCT (intDCT). Expansion of the DCT coefficients is applied to embed a content-based hash as a payload. The integer DCT algorithm ensures the reversibility of the transform so that the original data and embedded payload can be perfectly restored to enable blind verification of the data integrity. The perceptual evaluation of speech quality (PESQ) with the listening quality objective mean opinion (MOSLQO), the segmental signal to noise ratio (segSNR), and subjective evaluation results show that the proposed algorithm provides good sound quality (MOSLQO and segSNR are respectively 4.41 and 23.31dB on average for a capacity of 8, 000bps). Detection and localization are accurate in terms of correctly localizing tampered frames in case of insertion or deletion.

著者

Yoshihiro Oyama Yudai Kawasaki Kazushi Takahashi

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.23, no.2, pp.132-141, 2015 (Released:2015-03-15)

参考文献数

30

---

Many dynamic malware analysis systems based on hypervisors have been proposed. Although they support malware analysis effectively, many of them have a shortcoming that permits the malware to easily recognize the virtualized hardware and change its execution to prevent analysis. We contend that this drawback can be mitigated using a hypervisor that virtualizes the minimum number of hardware accesses. This paper proposes a hypervisor-based mechanism that can function as a building block for dynamic malware analysis systems. The mechanism provides the facility for checkpointing and restoring a guest OS. It is designed for a parapass-through hypervisor, that is, a hypervisor that runs directly on the hardware and does not execute a host OS or an administrative guest OS. The advantage of using a parapass-through hypervisor is that it provides a virtual machine whose hardware configuration and behavior is similar to the underlying physical machine, and hence, it can be stealthier than other hypervisors. We extend the parapass-through hypervisor BitVisor with the proposed mechanism, and demonstrate that the resulting system can successfully checkpoint and restore the states of Linux and Windows OSes. We confirm that hypervisor detectors running on the system cannot identify the virtualized hardware, and determine that they are executing on a physical machine. We also confirm that the system imposes minimal overhead on the execution times of the benchmark programs.

著者

Yu Suzuki

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.23, no.1, pp.22-30, 2015 (Released:2015-01-15)

参考文献数

30

被引用文献数

1 18

---

In this paper, we propose a method for assessing quality values of Wikipedia articles from edit history using h-index. One of the major methods for assessing Wikipedia article quality is a peer-review based method. In this method, we assume that if an editor's texts are left by the other editors, the texts are approved by the editors, then the editor is decided as a good editor. However, if an editor edits multiple articles, and the editor is approved at a small number of articles, the quality value of the editor deeply depends on the quality of the texts. In this paper, we apply h-index, which is a simple but resistant to excessive values, to the peer-review based Wikipedia article assessment method. Although h-index can identify whether an editor is a good quality editor or not, h-index cannot identify whether the editor is a vandal or an inactive editor. To solve this problem, we propose p-ratio for identifying which editors are vandals or inactive editors. From our experiments, we confirmed that by integrating h-index with p-ratio, the accuracy of article quality assessment in our method outperforms the existing peer-review based method.

著者

Takayuki Miyazaki Yasuhiko Minamide

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.27, pp.422-430, 2019 (Released:2019-06-15)

参考文献数

22

被引用文献数

6

---

Lookahead is an extension of regular expressions that has been adopted in many implementations and is widely used. Lookahead represents what is allowed as the rest of input. Morihata developed a conversion from regular expressions with lookahead (REwLA) to deterministic finite automata by extending Thompson's construction. In this paper, we develop a conversion from REwLA to deterministic finite automata by extending derivatives of regular expressions. First, we formalize the semantics of REwLA. An REwLA has information about the rest of the input, so the definition of the semantics of REwLA is not languages but structures different from those of regular expressions. Thus, we introduce languages with lookahead as sets of pairs of strings with several operations and define the semantics of REwLA as languages with lookahead. Next, we define two kinds of left quotient for languages with lookahead and give corresponding derivatives. Then, we show that the types of expressions obtained by repeatedly applying derivatives are finite under some equivalence relation and give a conversion to deterministic finite automata. We also show that the semantics of REwLA is a finite union of sets of the form A × B, where A and B are regular languages.

著者

Bektur Ryskeldiev Michael Cohen Jens Herder

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.26, pp.177-185, 2018 (Released:2018-02-15)

参考文献数

34

被引用文献数

8

---

We present a system that exploits mobile rotational tracking and photospherical imagery to allow users to share their environment with remotely connected peers “on the go.” We surveyed related interfaces and developed a unique groupware application that shares a mixed reality space with spatially-oriented live video feeds. Users can collaborate through realtime audio, video, and drawings in a virtual space. The developed system was tested in a preliminary user study, which confirmed an increase in spatial and situational awareness among viewers as well as reduction in cognitive workload. Believing that our system provides a novel style of collaboration in mixed reality environments, we discuss future applications and extensions of our prototype.

著者

Neda Gholami Mohammad Mahdi Dehshibi Andrew Adamatzky Antonio Rueda-Toicen Hector Zenil Mahmood Fazlali David Masip

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.28, pp.161-168, 2020 (Released:2020-02-15)

参考文献数

21

被引用文献数

4

---

For reconstructing CT images in the clinical setting, ‘effective energy’ is usually used instead of the total X-ray spectrum. This approximation causes an accuracy decline. We proposed to quantize the total X-ray spectrum into irregular intervals to preserve accuracy. A phantom consisting of the skull, rib bone, and lung tissues was irradiated with CT configuration in GATE/GEANT4. We applied inverse Radon transform to the obtained Sinogram to construct a Pixel-based Attenuation Matrix (PAM). PAM was then used to weight the calculated Hounsfield unit scale (HU) of each interval's representative energy. Finally, we multiplied the associated normalized photon flux of each interval to the calculated HUs. The performance of the proposed method was evaluated in the course of Complexity and Visual analysis. Entropy measurements, Kolmogorov complexity, and morphological richness were calculated to evaluate the complexity. Quantitative visual criteria (i.e., PSNR, FSIM, SSIM, and MSE) were reported to show the effectiveness of the fuzzy C-means approach in the segmenting task.

著者

Akitoshi Okumura Takamichi Hoshino Susumu Handa Yugo Nishiyama Masahiro Tabuchi

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.25, pp.448-458, 2017 (Released:2017-06-15)

参考文献数

30

被引用文献数

3 4

---

This paper proposes a system of verifying the identity of ticket holders at large-scale events using face recognition, which is called Ticket ID System. Such a system has been required to prevent illegal resale such as ticket scalping. Since illegal resale is a critical problem for popular events in Japan, strict steps are followed for verifying individuals holding tickets at event venues by human visual inspection with ID cards. This task is time consuming for venue attendants. It is also stressful because ticket holders feel uncomfortable when being kept waiting. The problem in verifying ticket holders is how to simultaneously verify identities efficiently and prevent individuals from impersonating others at a large-scale event in which tens of thousands of people participate. Ticket ID system makes it possible to secure the identity of the purchaser and holder of a ticket by using a face-recognition system developed for tablet terminals. Ticket ID System was proven effective for preventing illegal resale by verifying 50, 324 attendees at a large concert of a popular music group. The average accuracy of face recognition was 90%. The average time for identity verification was 7 seconds per person including guidance to ticket holders, which decreased identity-verification time by 30% compared to using only human visual inspection as well as reducing the psychological workload of venue attendants. Survey results obtained from the attendees showed that 94.6% felt it provided more equity in ticket purchasing than methods used before, 83% felt it provided added convenience in verification, and 93.8% felt it would effectively prevent illegal resale.

著者

Toshihiro Ohigashi Shuya Kawaguchi Kai Kobayashi Hayato Kimura Tatsuya Suzuki Daichi Okabe Takuya Ishibashi Hiroshi Yamamoto Maki Inui Ryo Miyamoto Kazuyoshi Furukawa Tetsuya Izu

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.29, pp.548-558, 2021 (Released:2021-09-15)

参考文献数

19

---

In 2018, Takita et al. proposed a construction method of a fake QR code by adding stains to a target QR code, that probabilistically leads users to a malicious website. The construction abused the error-correction of error-correcting code used in the QR code, namely, the added stains induce decoding errors in black and white detection by a camera, so that the decoded URL leads to the malicious website. Also, the same authors proposed a detection method against such fake QR codes by comparing decoded URLs among multiple QR code readings since the decoded URLs may differ because of its probabilistic property. However, the detection method cannot work well over a few readings. Moreover, the proposed detection method does not consider the environmental or accidental changes such as sudden sunshine or reflection, nor recognizes the fake QR code as non-fake when the probability is low. This paper proposes new detection methods for such fake QR codes by analyzing information obtained from the error-correcting process. This paper also reports results from implementing the new detection methods on an Android smartphone. Results show that a combination of these detection methods works very well compared to when using only a single detection method.

著者

Yusuke Fukazawa Naoki Yamamoto Takashi Hamatani Keiichi Ochiai Akira Uchiyama Ken Ohta

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.28, pp.16-30, 2020 (Released:2020-01-15)

参考文献数

114

被引用文献数

6

---

Monitoring mental health has received considerable attention as a countermeasure against the increasing occurrence of mental illness worldwide. However, current monitoring services incur costs because users are required to attach wearable devices or answer questions. To reduce such costs, many studies have used smartphone-based passive sensing technology to capture a user's mental state. This paper reviews those studies from the perspective of machine learning and statistical analysis. Forty-four studies published since 2011 have been reviewed and summarized from three perspectives: designed features, machine learning algorithm, and evaluation method. The features considered include location and mobility, activity, speech, sleep, phone usage, and context features. Tasks are classified as correlation analysis, regression tasks, and classification tasks. The machine learning algorithm used for each task is summarized. Evaluation metrics and cross validation methods are also summarized. For those who are not necessarily machine learning experts, we aim to provide information on typical machine learning framework for smartphone-based mental state estimation. For experts in the field, we hope this review will be a helpful tool to check for potential omissions.

著者

Stephen J.H. Yang Owen H.T. Lu Anna Y.Q. Huang Jeff C.H. Huang Hiroaki Ogata Albert J.Q. Lin

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.26, pp.170-176, 2018 (Released:2018-02-15)

参考文献数

29

被引用文献数

34

---

With the rise of big data analytics, learning analytics has become a major trend for improving the quality of education. Learning analytics is a methodology for helping students to succeed in the classroom; the principle is to predict student's academic performance at an early stage and thus provide them with timely assistance. Accordingly, this study used multiple linear regression (MLR), a popular method of predicting students' academic performance, to establish a prediction model. Moreover, we combined MLR with principal component analysis (PCA) to improve the predictive accuracy of the model. Traditional MLR has certain drawbacks; specifically, the coefficient of determination (R2) and mean square error (MSE) measures and the quantile-quantile plot (Q-Q plot) technique cannot evaluate the predictive performance and accuracy of MLR. Therefore, we propose predictive MSE (pMSE) and predictive mean absolute percentage correction (pMAPC) measures for determining the predictive performance and accuracy of the regression model, respectively. Analysis results revealed that the proposed model for predicting students' academic performance could obtain optimal pMSE and pMAPC values by using six components obtained from PCA.

著者

Akira Tanaka Reynald Affeldt Jacques Garrigue

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.26, pp.54-72, 2018 (Released:2018-01-15)

参考文献数

30

被引用文献数

4

---

Our goal is the production of formally-verified pieces of low-level code. Low-level code is typically written in C, so as to enable efficient manipulation of data at the bit-level and easy access to built-in features of CPUs. Proof-assistants arguably provide the most rigorous approach to formal verification of computer programs. Unfortunately, they only allow for extraction of runnable code in high-level languages such as ML. Of course it is possible to embed C snippets into ML programs, but this results in a complicated extraction process and the performance of the output program becomes difficult to anticipate. In this paper, we propose a new code generation scheme for the Coq proof-assistant that directly generates provably-safe C code. It is implemented in the form of plugins. The generation of C source code is done by a plugin performing beforehand monomorphization of Coq programs. The correctness of monomorphization can be proved within Coq. Code generation allows for user-guided changes of data structures. It is therefore possible to do formal verification using proof-friendly data structures, while enjoying optimized C representations in the output code. In order to ensure the safety of this transformation, we propose a new customizable monadification algorithm in the form of another plugin. Using monadification, one can ensure by the insertion of the right monads the preservation of critical invariants, such as the absence of overflows or complexity properties. We provide several examples to illustrate our approach, including a realistic use-case: the rank algorithm from succinct data structures.

著者

Jin Akiyama Hyunwoo Seong

出版者

一般社団法人 情報処理学会

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.23, no.3, pp.246-251, 2015 (Released:2015-05-15)

参考文献数

8

被引用文献数

1

---

A parallelohedron is a convex polyhedron which fills the space by translations only. There are five families of parallelohedra. A pentadron is a pentahedron whose copies compose at least one member of every family of parallelohedra. A pentadral complex is a convex polyhedron which is constructed by combining copies of pentadra in a face-to-face gluing manner. In this paper, reversibilities and tessellabilities of pentadral complices and their related topics are studied.

著者

Takanori Isobe Ryoma Ito Kazuhiko Minematsu

出版者

Information Processing Society of Japan

雑誌

Journal of Information Processing (ISSN:18826652)

巻号頁・発行日

vol.31, pp.523-536, 2023 (Released:2023-09-15)

参考文献数

55

---

This paper summarizes our cryptanalysis results on real-world End-to-End Encryption (E2EE) schemes published in recent years. Our targets are LINE (a major messaging application), SFrame (an E2EE protocol adopted by major video/audio applications), and Zoom (a major video communication application). For LINE, we show several attacks against the message integrity of Letter Sealing, the E2EE protocol of LINE, that allow forgery and impersonation. For SFrame, we reveal a critical issue that leads to an impersonation (forgery) attack by a malicious group member with a practical complexity. For Zoom, we discover several attacks more powerful than those expected by Zoom according to their whitepaper. Specifically, if insiders collude with meeting participants, they can impersonate any Zoom user in target meetings, whereas Zoom indicates that they can impersonate only the current meeting participants. We also describe several important works in the area of E2EE security research.