Publishing type：Research paper (scientific journal)   Publisher：Institute of Electronics, Information and Communications Engineers (IEICE)  

DOI： 10.1587/transinf.2022mpl0002

researchmap

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1145/3631991.3631996

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/wsse/wsse2023.html#IrieAAYK23

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/SEAA60479.2023.00054

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/euromicro/euromicro2023.html#FushiharaAAYK23

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/SEAA56994.2022.00027

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/asew52652.2021.00036

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/sera51205.2021.9509042

researchmap

Publisher：Cold Spring Harbor Laboratory  

<title>Abstract</title>We developed a novel scotoma detection system using time required for fixation to the random targets, or the” eye-guided scotoma detection method “. In order to verify the” eye-guided scotoma detection method “, we measured 78 eyes of 40 subjects, and examined the measurement results in comparison with the results of measurement by Humphrey perimetry. The results were as follows: (1) Mariotte scotomas were detected in 100% of the eyes tested; (2) The false-negative rate (the percentage of cases where a scotoma was evaluated as a non-scotoma) was less than 10%; (3) The positive point distribution in the low-sensitivity eyes was well matched. These findings suggested that the novel scotoma detection method in the current study will pave the way for the realization of mass screening to detect pathological scotoma earlier.

<sec><title>Author summary</title>Conventional perimeters, such as the Goldmann perimeter and Humphrey perimeter, require experienced examiners and space occupying. With either perimeter, subjects’ eye movements need to be strictly fixed to the fixation target of the device. Other perimeters can monitor fixation and automatically measure the visual field. With the eye-guided scotoma detection method proposed in the current study, subjects feel less burdened since they do not have to fixate on the fixation target of the device and can move their eyes freely. Subjects simply respond to visual targets on the display; then, scotomas can be automatically detected. The novel method yields highly accurate scotoma detection through an algorithm that separates scotomas from non-scotomas.

</sec>

DOI： 10.1101/2021.06.03.21258101

researchmap

Publishing type：Part of collection (book)   Publisher：Springer International Publishing  

DOI： 10.1007/978-3-030-79474-3_9

researchmap

Publishing type：Part of collection (book)   Publisher：Springer International Publishing  

DOI： 10.1007/978-3-030-85347-1_35

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：日本ソフトウェア科学会  

DOI： 10.11309/jssst.37.4_38

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)   Publisher：Japan Society for Software Science and Technology  

Source code changes are essential for software evolution. However, a source code change also has a risk of introducing a new bug into the software. To predict such a bug by using features of the code change, researchers have studied various bug prediction models in the past. One of the most noteworthy methods is the personalized bug prediction, which builds a prediction model customized for each developer. Although the personalized bug prediction model is a promising one, it also has a challenge that we cannot make appropriate models for less experienced developers due to the lack of code change (commit) data. Toward a resolution of the challenge, this paper proposes a method for combining two or more personalized bug prediction models. The usefulness of the proposed method is proved by an empirical study with the data from five open-source software development projects.

DOI： 10.11309/jssst.37.4_50

Scopus

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/SEAA51224.2020.00023

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/euromicro/euromicro2020.html#AmanAYK20

Publishing type：Research paper (scientific journal)  

DOI： 10.1002/smr.2220

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/APSEC51365.2020.00059

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/apsec/apsec2020.html#AsatoAAYK20

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/BCD.2019.8885337

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：Springer  

DOI： 10.1007/978-3-030-24405-7_5

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/bcd/bcd2019s.html#AmanAYK19

Publishing type：Research paper (international conference proceedings)  

researchmap

Other Link： https://dblp.uni-trier.de/conf/apsec/2019quasoq

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Language：English   Publishing type：Research paper (scientific journal)  

DOI： 10.1587/transinf.2018EDL8094

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/COMPSAC.2018.00145

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/ICSTW.2018.00079

researchmap

Publishing type：Research paper (scientific journal)  

DOI： 10.2991/ijndc.2018.6.3.1

researchmap

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/APSEC.2018.00082

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/apsec/apsec2018.html#AmanAYK18

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/BCD2018.2018.00010

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/bcd/bcd2018.html#YamauchiAAYK18

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/SEAA.2018.00033

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/euromicro/euromicro2018.html#TashimaAAYK18

Language：Japanese   Publisher：Japan Society for Software Science and Technology  

<p>Toward improving readability of source code, this paper proposes a model for judging the compatibility between Java method's name and its implementation, and conducts empirical studies and a survey to examine its usefulness. The proposed method constructs decision trees with many method's data from various source programs, and judges the compatibility between method's name and its implementation. As the results, a validity of model is confirmed and the judging accuracy (F-measure) is about 80%. It is also confirmed that the judgment by the model approximately dovetails with developers' sense.</p>

DOI： 10.11309/jssst.35.115

researchmap

Language：Japanese   Publishing type：Research paper (conference, symposium, etc.)  

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/issrew.2017.37

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/ACIT-CSII-BCD.2017.20

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/ACIT-CSII-BCD.2017.44

researchmap

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/IWESEP.2017.14

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/iwesep/iwesep2017.html#AmanBAYK17

Language：English   Publisher：The Institute of Electronics, Information and Communication Engineers  

<p>This paper focuses on differences in comment densities among individual programmers, and proposes to adjust the conventional code complexity metric (the cyclomatic complexity) by using the abnormality of the comment density. An empirical study with nine popular open source Java products (including 103,246 methods) shows that the proposed metric performs better than the conventional one in predicting change-prone methods; the proposed metric improves the area under the ROC curve (AUC) by about 3.4% on average.</p>

DOI： 10.1587/transinf.2016EDL8224

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This paper focuses on the content of test cases, and categorizes test cases into clusters using the similarity between test cases; their degree of similarity is obtained through a morphological analysis. If there are two similar test cases, they would test the same or similar functionalities in similar but different conditions. Thus, when one of them is run for a regression testing, the remaining one should be run as well, in order to reduce a risk of overlooking regressions. Once a test engineer decides to run a set of test cases, the method proposed in this paper can recommend adding similar test cases to their candidate set. The proposed method also considers the priorities of recommended test cases by using the Mahalanobis-Taguchi method. This paper reports on an empirical study with an industrial software product. The results show that the proposed method is useful to prevent overlooking regressions.

DOI： 10.1109/ICSTW.2017.9

Web of Science

researchmap

Publishing type：Part of collection (book)   Publisher：Springer  

DOI： 10.1007/978-3-319-69926-4_7

Web of Science

researchmap

Publishing type：Research paper (scientific journal)   Publisher：Atlantis Press  

DOI： 10.2991/ijndc.2017.5.4.3

researchmap

Publishing type：Research paper (international conference proceedings)  

DOI： 10.1109/SEAA.2017.23

researchmap

Other Link： https://dblp.uni-trier.de/db/conf/euromicro/euromicro2017.html#AmanAYK17

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE Computer Society  

DOI： 10.1109/SEAA.2017.24

Web of Science

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

Code review is an essential activity to ensure the quality of code being developed, and there have been static code checkers for aiding an effective code review. However, such tools have not been actively utilized in the world of programmers due to a lot of coding violations (warning) produced by tools and their false-positiveness. In order to analyze the automatically pointed violations and the actual attentions which programmers paid to those violations, this paper proposes a novel metric-the Index of Programmers' Attention (IPA)-and conducts an empirical study focusing on the change patterns of violations over the releases of popular seven open source software products, under two research questions (RQs): (RQ1) What kind of coding violations are related to the parts that many programmers tend to improve? and what kind of coding violations are likely to be disregarded?; (RQ2) How can we reduce the meaningless violations for programmers by omitting disregarded coding violations?
The empirical results showed the following findings: (1) important violations (having high IPA values) may vary from project to project; (2) there are some unimportant violations common to different projects, but they are a minority of automatically detected violations (about 12%). Therefore, while many violations may be made by a code checker, most of them are likely to be worthy in improving the code quality, and it is ineffective to reduce the violations by eliminating such unimportant violations.

DOI： 10.1109/APSEC.2016.29

Web of Science

researchmap

Publishing type：Research paper (international conference proceedings)  

researchmap

Other Link： https://dblp.uni-trier.de/conf/apsec/2016quasoq

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE COMPUTER SOC  

To enhance the cost effectiveness of regression testing, this paper proposes a method for prioritizing test cases. In general, a test case can be evaluated from various different points of view, therefore whether it is worth it to re-run should be discussed using multi criteria. This paper shows that the Mahalanobis-Taguchi (MT) method is a useful way to successfully integrate different evaluations of a test case. Moreover, this paper proposes to use the 0-1 programming method together with the MT method in order to take into account not only the priority of a test case but also its cost to run. The empirical study with 300 test cases for an industrial software system shows that the combination of the MT method and the 0-1 programming method is more cost-effective than other conventional methods.

DOI： 10.1109/SEAA.2016.29

Web of Science

researchmap

DOI： 10.1587/transinf.2015EDP7107

Web of Science

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

DOI： 10.11309/jssst.32.3_111

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

This paper focuses on the local variable names and comments that are major artifacts reflecting the programmer's preference. It conducts an empirical analysis on the usefulness of those artifacts in assessing the software quality from the perspective of change-proneness in Java methods developed in six popular open source software products. The empirical results show: (1) a method having a longer named local variable is more change-prone, and (2) the presence of comments inside the method body strengthens the suspicions to be modified after the release. The above artifacts are worthy to find methods which can survive unscathed after the release.

DOI： 10.1109/ESEM.2015.7321197

Web of Science

researchmap

Language：Japanese   Publishing type：Research paper (scientific journal)  

researchmap

Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

In recent years, many open source software (OSS) products have become popular and widely used in the information technology (IT) business. To successfully run IT business, it is important to properly understand the OSS development status. Having a proper understanding of development status is necessary to evaluate and predict the product quality. However, the OSS development status is not easy to understand, because it is often concurrently developed by many distributed contributors, and its developmental structure is complicated. To aid the understanding of the development status, there is an approach that models the trend of source code change events (evolution) with a growth curve. Although an application of growth curves seems to be a promising approach, there has been a big issue that a single growth curve is often unsuitable for modeling the whole evolution because of its complex evolutionary behavior. This paper proposes a multistage model that divides the whole development period into some stages, and applies a different growth curve to a different stage. The empirical investigation in this paper shows that the switching points of stages have meaningful associations with the release dates.

DOI： 10.1109/SEAA.2014.47

Web of Science

researchmap

Publisher：ACM  

researchmap

Other Link： http://dblp.uni-trier.de/db/conf/esem/esem2014.html#conf/esem/AmanSAK14

Publisher：IEEE  

DOI： 10.1109/APSEC.2014.93

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：ELSEVIER SCIENCE BV  

This paper proposes a cache replacement scheme named group replica caching for optical grid networks. In optical grid networks, data files for job execution are replicated at multiple servers in order to distribute loads. Clients download these files via lightpaths and store them as necessary. File downloading is blocked when the corresponding lightpath cannot be established. The blocking probability of file downloading depends on location of files. The case where a file is stored in a client is ideal because blocking of lightpath establishments does not occur. However, the storage size of the client is limited. In order to efficiently use storage resources of clients, our proposed scheme focuses on the fact that clients can download files stored in surrounding servers with low blocking probability. The proposed scheme regards a group of storages of a client and its surrounding servers as one storage. In particular, they preferentially store different files. By doing so, the probability that a file is stored at the client or its surrounding servers increases. Through simulation experiments, we show that the proposed scheme improves the blocking probability of file downloading efficiently. (C) 2013 Elsevier B.V. All rights reserved.

DOI： 10.1016/j.osn.2013.02.006

Web of Science

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：SPRINGER  

This paper proposes a contention resolution scheme considering multicast traffic in optical burst switching (OBS) networks. In OBS networks, for unicast bursts, contention can be avoided by deflection routing. However, deflection routing cannot be applied to multicast bursts because multicast bursts are transmitted along light-trees which are fixed, tree-shaped routes. Therefore, the loss probability of multicast bursts is generally high. To resolve this problem, the proposed scheme introduces an ingenious offset time assignment strategy which completely avoids contention of multicast bursts due to transmissions of unicast bursts by strategically assigning additional offset times. Furthermore, in the proposed scheme, unicast bursts avoid contention with deflection routing. Through simulation experiments, we show that the proposed scheme improves the loss probabilities of both of unicast bursts and multicast bursts.

DOI： 10.1007/s11107-011-0346-7

Web of Science

researchmap

Publishing type：Research paper (international conference proceedings)   Publisher：IEEE  

DOI： 10.1109/nof.2011.6126669

researchmap

Language：English   Publishing type：Research paper (scientific journal)   Publisher：SPRINGER-VERLAG BERLIN  

It is very effective for search users to provide meaningful keywords which are derived by text mining algorithm. We are developing our search engine "Mondou" using weighted association rules, as the web-based intelligent database navigation system. In this paper, lye focus on the computing cost to derive appropriate keywords, we carefully determine system parameters, such as Minsup and Minconf threshold values. In order to evaluate the performance and characteristics of derived rules, we use the techniques of ROC graph. We propose the ROC analytical model of our search system, and we evaluate the performance of weighted association rules by the ROC convex hull method. Especially, we try to specify the optimal threshold values to derive effective rules from INSPEC database, which is one of the huge bibliographic databases.

Web of Science

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese  

CiNii Books

researchmap

Language：Japanese  

researchmap

Language：Japanese  

CiNii Books

researchmap

Language：Japanese  

researchmap

Language：Japanese  

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Society for Software Science and Technology  

It is ideal to test whether there is a regression in a software system or not by running all available test cases, whenever the system is modified. However, practitioners may not be able to run all test cases due to a lack of time or manpower, and then they usually prioritize the test cases and run some of them in decreasing order of priority. In order to make such regression testings more cost-effective, an application of 0&ndash;1 programming method to plan the regression testing has been studied in the past. While an empirical superiority of the 0&ndash;1 programming method-based testing over the conventional one has been reported, there is an issue of the testing completeness such that only a few functionalities might be tested. Thus, this paper utilizes a clustering technique for a more effective test case selection and proposes to formulate the regression testing as a 0&ndash;1 programming problem having constraints to cover all clusters of the test cases. The empirical work shows that the proposed method can detect regressions with about one-third (1/3) effort of the conventional method.

DOI： 10.11309/jssst.32.3_111

researchmap

Language：Japanese   Publisher：一般社団法人情報処理学会  

本稿は静的解析ツールで検出可能なコーディング規約違反に着目し,実際のオープンソース開発においてどういった規約違反が多く検出され,その中でどういった規約違反は結果的に解消されていくのか,あるいは逆に解消されずにそのまま残っていくのかを調査している.調査としては,Java 言語で開発されている 2 種類のオープンソースソフトウェアに対して,それらのリポジトリへのコミットごとに静的解析ツール Checkstyle を適用し,Sun Java コーディング規約に対する違反情報を収集している.分析の結果,二つのソフトウェアにおいて六つの違反項目が共通して多く検出されることが分かり,それらの変化 (改善) の傾向から開発の過程でプログラマがどういった点に注意を払っていたかを考察している.

CiNii Books

researchmap

Language：Japanese  

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

It is required to provide Web pages designed for considering usability which visually impaired people can lean effectively with eラ-ニング. In order to clarify the effectiveness that the Web design gives the usability, it experimented on two kinds of Web designs, witch are tabular formed design and list formed design, to stone-blind, low-vision, and visually normal people. The experiment consists of problems that measures the accomplishment time clicked looking for target links, transition records of focus, and questionnaires. By analyzing the accomplishment time, the transition records, the questionnaires, this paper discusses the consideration points of Web design for visually impaired people. As the results the effectiveness of the Web design was not seen by the stone-blind people like visually normal people. It was impossible to find out any trend in the experiment for low-vision people because the observed data varied widely.

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

This paper proposes a contention resolution scheme considering multicast traffic in optical burst switching (OBS) networks. In OBS networks, for unicast bursts, contention can be avoided by deflection routing. However, deflection routing cannot be applied to multicast bursts because multicast bursts are transmitted along light-trees which are fixed, tree-shaped routes. Therefore, the loss probability of multicast bursts is generally high. To resolve this problem, the proposed scheme introduces an ingenious offset assignment strategy which completely avoids contention of multicast bursts due to transmission of unicast bursts by using additional offset times. Furthermore, in the proposed scheme, unicast bursts avoids contention with deflection routing. Through simulation experiments, we show that the proposed scheme improves the loss probabilities of both of unicast bursts and multicast bursts.

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

In optical grid networks, data files for job execution are replicated at multiple sites in order to distribute loads. Those replicas can be downloaded in parallel in order to reduce downloading time. Furthermore, each replica can be downloaded with multiple wavelengths. Although they can reduce downloading time, they raise blocking probability of file downloading. This is because they use a lot of wavelength resources and thus often generate bottleneck links. To resolve this problem, this paper proposes a parallel and multi-wavelength downloading scheme for optical grid networks. The proposed scheme provides replica selection, path (route) selection, and wavelength selection for parallel and multi-wavelength downloading. Through simulation experiments, we show that the proposed scheme efficiently improves blocking probability of parallel and multi-wavelength downloading.

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

It is required to clarify each visual characteristics of low vision person to computer display devices and evaluate operational effectiveness on accessibility settings in order to optimize personal computer environments for low vision persons. In this paper a visual characteristics evaluation kit is developed for the above purpose. The kit consists of tools to measure visual resolution to display devices, contrast sensitivity, optimal font size for reading with contrast polarity effect, effective width and type of line, influence that state of mouse pointer gives to operation performance. And the tools are used to evaluate the effectiveness of them by persons with normal eyesight persons and low vision ones. As the results we show the capability of our kit to optimize accessibility settings for low vision PC users.

CiNii Books

researchmap

researchmap

researchmap

Language：Japanese   Publisher：The Visualization Society of Japan  

DOI： 10.3154/jvs.29.83

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Books

researchmap

Language：English   Publisher：ELSEVIER SCIENCE BV  

This paper deals with massively multiplayer online services that are used for user interaction in real time. Although it is possible to distribute the load on a server to the users' computers, the distributed services are more vulnerable to cheating such as data theft. We propose a method for concealing the data from a user who is authorized to manage the data. The method makes it possible to carry out various kinds of operations, keeping both data and program codes concealed. We show that the concealed information cannot be figured out with the knowledge of the original programs or encoding keys possessed by the other users. (C) 2007 Elsevier B.V. All rights reserved.

DOI： 10.1016/j.comcom.2007.11.002

Web of Science

researchmap

Language：Japanese  

CiNii Books

researchmap

researchmap

Language：English   Publisher：SPRINGER  

This paper deals with Massively Multiplayer Online Services, users of which communicate interactively with one another in real time. At present, this kind of services is generally provided in a Client-Server Model, in which users connect directly with a central iserver managed by a service provider. However, in this model, since a computational load and a communication load concentrate on the central server, high-performance server machines and high-speed data links are required. In this paper, we propose an architecture for distributing the loads by delegating part of the server's function to users' machines, which is based on a Peer-to-Peer Model. When we adopt a Peer-to-Peer Model, we face a security problem. In our research, we let multiple machines of users manage the same data and apply a decision by majority rule. This mechanism adds robustness against halts of users' machines and data tampering by malicious users to the service.

Web of Science

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

This paper deals with Massively Multiplayer Online Services, users of which communicate interactively with one another in real time. We propose an architecture for distributing loads by transferring part of the server's function to users' machines. We also enumerate possible attacks by malicious users, and evaluate the robustness against them. The main idea to solve security problems is "letting multiple machines manage the same data and applying a decision by majority rule." This mechanism adds robustness to the service against halts of users' machines and cheating such as data tampering by malicious users.

CiNii Books

researchmap

Other Link： http://id.nii.ac.jp/1001/00010322/

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

This paper deals with Massively Multiplayer Online Services, users of which communicate interactively with one another in real time. We propose a method for concealing data held by a user to whom authority for managing the data is delegated. With data and program codes concealed, our method enables various operations such as addition, subtraction, multiplication, and comparison. It is found difficult to decode concealed data by speculating some program codes or colluding with other users.

CiNii Books

researchmap

researchmap

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

In recent days, the University redefines its position at the regional in conjunction with the reforming as the independent corporation. The University is expected to do the development educational contents for the city residents, the interaction with elementary school and junior high school for comprehensive education, and the outreach effort. To lead these activities to success, we have to deploy the cost-effective and tailored to our needs regional network. We introduce our approach that we have build the regional IX with the convention of L2 and L3 connection.

CiNii Books

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

This paper deals with Massively Multiplayer Online Services, users of which communicate interactively with one another in real time. At present, this kind of services is generally provided in a Client-Server Model, in which users connect directly with a central server managed by a service provider. However, in this model, since a computational load and a communication load concentrate on the central server, high-performance server machines and high-speed data links are required. In this paper, we propose an architecture for distributing the loads by delegating part of the server's function to users' machines, which is based on a Peer-to-Peer Model. When we adopt a Peer-to-Peer Model, we face a security problem. In our research, we let multiple machines of users manage the same data and apply a decision by majority rule. This mechanism adds robustness against halts of users' machines and data tampering by malicious users to the service.

CiNii Books

researchmap

researchmap

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Books

researchmap

Language：Japanese   Publisher：The Visualization Society of Japan  

IDS (Intrusion Detection System) is an active research topic for the purpose of cost reduction of security maintenance of computer network. However, existing IDS technologies still have some issues, including enormous log output data, and lack of analysis technologies of complicated behavior of recent intrusions. This report proposes a technique to support understanding and exploration of such behavior of intrusions, by applying an information visualization technique. The technique constructs hierarchical data according to IP addresses of computers in a target network, and visualizes the data by Heiankyo-view, which is a new technique for hierarchical data visualization. By mapping statistics of intrusions onto the visualization display, we could observe some behavior of real intrusions.

DOI： 10.3154/jvs.24.Supplement1_459

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

P2P file sharing systems are becoming one of the most popular Internet applications, and occupy a major traffic in Internet. Recently, various searching methods have been changing from filename-based queries to contents-oriented queries. However, P2P distributed systems spend much more response time and consume the wide bandwidth of communication networks. In this paper, we propose techniques to manage routing tables by utilizing the characteristic of queries, so that we try to deal with topic-oriented query mechanisms instead of query broadcasting algorithms. We also adopt hierarchical routing tables in order to reduce the storage and management costs. Based on simulation models, we compare the performances between original query routing algorithm and our proposed algorithm.

CiNii Books

researchmap

Language：Japanese   Publisher：京都大学学術情報メディアセンター研究開発部  

CiNii Books

researchmap

Language：English   Publisher：SPRINGER-VERLAG BERLIN  

The study of the authoritative pages and community discovery from an enormous Web contents has attracted many researchers. One of the link-based analysis, the HITS algorithm, calculates authority scores as the eigenvector of a adjacency matrix created from the Web graph. Although it was considered impossible to compute the eigenvector of a very large scale of Web graph using previous techniques, due to this calculation requires enormous memory space. We make it possible using data compression and parallel computation.

Web of Science

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

In recent years, many kinds of peer to peer network applications, such as Gnutella, have been developed. However, the first generation of distributed search systems provide only simple search functions, it is difficult to retrieve appropriate contents by query results. Therefore, we propose the architecture of topic-driven distributed search systems, in order to realize advanced score functions using contents analysis, network performance and other attributes. We also develop the distributed index mechanism with classifiers and distillers. In this paper, we consider the problems of search performance which are caused by the bandwidth of networks and the instability of peer to peer network topology. From the view points of next generation internet technologies, we further discuss the architecture of advanced peer-to-peer network applications based on results of our performance studies.

CiNii Books

researchmap

researchmap

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

In a process to develop our search engine system, Mondou using data mining technology, it is difficult to show the relationship between a given query and associative keywords by the list indication. In this paper, we visualize this relationship based on ROC distance. Moreover, in order to visualize the relationship between a search result and associative keywords, we try to materialize the query process. we also evaluate the performance of our materialized query processing using semi-structured data.

CiNii Books

researchmap

Other Link： http://id.nii.ac.jp/1001/00017688/

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Many network applications over peer to peer network, such as Gnutella, has been developed drastically. However, by using distributed systems with simple search functions, it is difficult to discover suitable information resources and to guarantee practical response time. There fore, in order to realize good network performance and advanced functions with content-based search we introduce the index system showing the characteristic of each file. We propose the topic-oriented search mechanism, which selects optimal search hosts, based on heuristic functions with several indices in each host. We evaluate the performance of our proposed system on a small-scale prototype system.

CiNii Books

researchmap

Language：Japanese   Publisher：The Japanese Society for Artificial Intelligence  

DOI： 10.11517/jjsai.16.2_212

CiNii Books

researchmap

Other Link： http://id.nii.ac.jp/1004/00005184/

researchmap

researchmap

Language：English   Publisher：IEEE  

The mining association algorithm is one of the most popular data mining algorithms to derive association rules at high speed from huge databases. We have been developing navigation systems for semi-structured data like as Web data and bibliographic data. To navigate beginners, our systems give the association rules derived by the algorithm. However, the algorithm tends to derive those rules that contain noises such as stopwords then many systems use noise filters to remove such noises. In order to remove the noises automatically and derive more effective rules, we proposed an algorithm using the true positive rate and the false positive rate of derived rules in a database based on the ROC analysis. In this paper, we make corrections in the parameters to improve the extended mining association algorithm. Moreover we evaluate the performance of our proposed algorithm using a experimental database and show how our proposed algorithm can derive effective association rules. We also show that our proposed algorithms can remove stopwords automatically from raw data.

Web of Science

researchmap

Language：English   Publisher：IEEE  

The mining association algorithm is one of the most popular data mining algorithms to derive association rules at high speed from huge databases. We have been developing navigation systems for semi-structured data like as Web data and bibliographic data. To navigate beginners, our systems give the association rules derived by the algorithm. However, the algorithm tends to derive those rules that contain noises such as stopwords then many systems use noise filters to remove such noises. In order to remove the noises automatically and derive more effective rules, we proposed an algorithm using the true positive rate and the false positive rate of derived rules in a database based on the ROC analysis. In this paper, we make corrections in the parameters to improve the extended mining association algorithm. Moreover we evaluate the performance of our proposed algorithm using a experimental database and show how our proposed algorithm can derive effective association rules. We also show that our proposed algorithms can remove stopwords automatically from raw data.

Web of Science

researchmap

researchmap

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

In order to retrieve a huge volume of semi-structured data like SGML efficiently, we develop Jave applets for our information navigation systems, Mondou. The applet visualizes ROC graph and document clusters. The ROC graph shows the relationsship between a query and associative keywords derived by mining algorithm. On the other hand, the interface of document clustering is based on the extension of the VIBE system, and it presents the combination of retrieved keywords efficiently. Moreover, we evaluate the performance of our navigation system using INSPEC database.

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

In order to retrieve a huge volume of semi-structured data like SGML efficiently, we develop Java applets for our information navigation system, Mondou. The applet visualizes ROC graph and document clusters. The ROC graph shows the relationship between a query and associative keywords derived by mining algorithm. On the other hand, the interface of document clustering is based on the extension of the VIBE system, and it presents the combination of retrieved keywords efficiently. Moreover, we evaluate the performance of our navigation system using INSPEC database.

CiNii Books

researchmap

Language：Japanese  

CiNii Books

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

We have been constructing bibliographic navigators using association rules. In order to provide effective knowledge for naive users, it is very important to decide several threshold values for mining rules. In this paper, we focus on the techniques of ROC graph to evaluate the characteristics of derived rules. By using the ROC convex full method, we can estimate appropriate threshold values to derive association rules for keywords.

CiNii Books

researchmap

Other Link： http://id.nii.ac.jp/1001/00017799/

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

CiNii Books

researchmap

Language：Japanese   Publisher：Japan Society of Information and Knowledge  

Many knowledge discovery tools have been developed using data mining, the integrating technologies of machine learging, database, statistics and others. We have been constructing "mondou" search systems based on extended association rules. In this paper, we discusse the experimental results of text mining applied for web hyper texts, INSPEC database, and magazines and articles index data in the National Diet Library. First of all, we express about the efficient strategies in order to derive association rules. Next, we discuss the relation between the threshold values and association rules, and we focus on the techniques of ROC (Reciever Operating Characteristics) graph to evaluate the characteristics of derived rules. By using the ROC convex full method, we can estimate appropriate threshold values to derive association rules for keywords.

DOI： 10.2964/jsikproc.7.0_15

CiNii Books

researchmap

researchmap

researchmap

researchmap

researchmap

Language：English   Publisher：SPRINGER-VERLAG BERLIN  

Web of Science

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

We have been constructing bibliographic navigators using association rules. In order to provide effective knowledge for naive users, it is very important to decide several threshold values for mining rules. In this paper, we focus on the techniques of ROC graph to evaluate the characteristics of derived rules. By using the ROC space, we can estimate appropriate threshold values to derive association rules for keywords.

CiNii Books

researchmap

Language：Japanese  

CiNii Books

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Without background and domain knowledge, it is generally difficult for naive users to retrieve appropriate results from bibliographic databases. The one of difficulties is due to the ambiguousness of keywords in search queries. In this paper, in order to knowledge of keywords space, we extend one of the data mining algorithms which discovers association rules from the bibliographic database, and we modify search queries using derived rules. Moreover, we have to refine derived rules, and we try to apply our proposed algorithm to different databases and derive different rule sets in the other view of different domains. We also develop a prototype of mining system for bibliographic navigation based on full text database, and evaluate the effectiveness of our proposed algorithms.

CiNii Books

researchmap

Other Link： http://id.nii.ac.jp/1001/00013125/

researchmap

researchmap

researchmap

Language：Japanese   Publisher：〔日本学術会議〕  

researchmap

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

It is generally difficult for naive users to retrieve appropriate bibliographies from bibliographic databases, even if they have background and domain knowledge. One of the reason of the difficulty is that value of the attribute is not limited in certain values. In this paper, we describe about an implementation of our bibliographic navigation system with the mining association algorithm which was extended from one of the data mining algorithms by us. In order to provide more helpful knowledge, we categorize the attributes and extend the mining association algorithms which discover relevance to a keywords space. By our algorithms, interesting rules are derived from relationships between several categorized attributes in a database. We also verify the performance of our proposed algorithms on our practical bibliographic navigation system.

CiNii Books

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Without background and domain knowledge, it is generally difficult for naive search users to retrieve appropriate bibliographies from bibliographic databases. In this paper, in order to provide more helpful knowledge including associative keywords, we extend the algorithm to derive association rules, which plays very important roles in the area of data mining researches. Moreover, we develop a navigation system using textual data mining algorithms, and verify the effectiveness of our proposed algorithms. We also consider the effectiveness of data mining for bibliographic search.

CiNii Books

researchmap

Language：Japanese   Publisher：The Institute of Electronics, Information and Communication Engineers  

Without background and domain knowledge, it is generally difficult for naive users to retrieve appropriate bibliographies from a bibliographic database. One of the reason of the difficulty is that value of the attribute is not limited in certain values. In this paper, in order to provide more helpful knowledge, we categorize the attributes and extend the mining association algorithms which discover relevance to a keywords space. By our algorithms, interesting rules are derived from relationships between several categorized attributes in a database. We also propose algorithms in order to modify an initial query with keywords, which are specified by users' view. Moreover, we develop a navigator using textual data mining algorithms, and verify the effectiveness of our proposed algorithms.

CiNii Books

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Without background and domain knowledge, it is generally difficult for naive users to retrieve appropriate bibliographies from a bibliographic database. One of the reason of the difficulty is that value of the attribute is not limited in certain values. In this paper, in order to provide more helpful knowledge, we categorize the attributes and extend the mining association algorithms which discover relevance to a keywords space. By our algorithms, interesting rules are derived from relationships between several categorized attributes in a database. We also propose algorithms in order to modify an initial query with keywords, which are specified by users' view. Moreover, we develop a navigator using textual data mining algorithms, and verify the effectiveness of our proposed algorithms.

CiNii Books

researchmap

Language：Japanese   Publisher：人工知能学会  

CiNii Books

researchmap

Language：Japanese   Publisher：Information Processing Society of Japan (IPSJ)  

Without background and domain knowledge, it is generally difficult for naive users to retrieve appropriate bibliographies from bibliographic databases. In this paper, in order to provide more helpful knowledge, we extend the mining association algorithms which discover relevance to a keywords space. By our algorithms, interesting rules are derived from relationships between several attributes in heterogeneous databases. We also propose algorithms in order to modify an initial query with keywords, which are specified by users' view. Moreover, we develop a navigation system using textual data mining algorithms and agent communication, and verify the effectiveness of our proposed algorithms.

CiNii Books

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese  

CiNii Books

researchmap

researchmap

researchmap

researchmap

researchmap

Language：English   Publisher：JAPAN J APPLIED PHYSICS  

Web of Science

researchmap

researchmap