Vitaly Klyuev
University of Aizu
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Vitaly Klyuev.
International Journal of Information Technology, Communications and Convergence | 2011
Vitaly Klyuev; Vladimir A. Oleshchuk
Nowadays, the internet is the major source of information for millions of people. There are many search tools available on the net but finding appropriate text information is still difficult. The retrieval efficiency of the presently used systems cannot be significantly improved: ‘bag of words’ interpretation causes losing semantics of texts. We applied the functional approach to represent English text documents. It allows taking into account semantic relations between words when indexing documents and use ordinary English sentences as queries to a search engine. The proposed retrieval mechanisms return only highly relevant documents. They make it possible to generate content-aware summaries on-the-fly. The presented examples illustrate the advantage of the discussed approach compared to the traditional key word search.
frontiers in education conference | 2007
Maxim Mozgovoy; Sergey Karakovskiy; Vitaly Klyuev
Plagiarism and similarity detection software is well-known in universities for years. Despite the variety of methods and approaches used in plagiarism detection, the typical trade-off between the speed and the reliability of the algorithm still remains. We introduce a new two-step approach to plagiarism detection that combines high algorithmic performance and the quality of pairwise file comparison. Our system uses fast detection method to select suspicious files only, and then invokes precise (and slower) algorithms to get reliable results. We show that the proposed method does not noticeably reduce the quality of the pairwise comparison mechanism while providing better speed characteristics.
intelligent data acquisition and advanced computing systems: technology and applications | 2009
Vladimir A. Oleshchuk; Vitaly Klyuev
General purpose search engines provide users with lists of retrieved documents in response to their queries. The common structure of list elements includes the title of a document, its URL, and small snippet from the text. Snippets are evidence of occurrences of querys keywords in the document. The length of each snippet is just a couple of lines. They cannot play a role of summaries of retrieved documents: In many cases, they are not indicative and users cannot judge on the relevancy of documents. In our approach we use ontology as context description and that ontology will be used to describe users main interest with respect to wanted summary and help to select weighting of key words and other semantically related words. Using such semantically related words would make it possible to generate summaries that are more semantically focused with respect to users interests/queries.
international conference on information science and technology | 2014
Naohiro Togashi; Vitaly Klyuev
Go is a new programming language developed by Google. Although it is still young compared to other programming languages, it already has modern and powerful features inherited from existing programming languages, and some of these are similar to Java. Go is designed for quick time development. Concurrency is the one of the main its features. In this paper, we analyze the performance of Go, and compare it with Java from two aspects: compile time and concurrency. There are many studies about the performance analysis and comparison of programming languages, but only a few publications investigate Go. Some of Go performance evaluation are based on the experimental release of Go. To analyze concurrency features, we implement simple matrix multiplication programs in both Go and Java. Java implementation uses Java Thread, and Go implementation uses Gor-outine and Channel. From the experiment, Go derived better performance than Java in both compile time and concurrency. Moreover, Go code shows the ease of concurrent programming. Go is still young, but we are convinced that Go will become the mainstream.
joint conferences on pervasive computing | 2009
Satoru Satake; Satoru Ishikawa; Denis Vazhenin; Vitaly Klyuev
Nowadays, the Internet is an important source of scientific information. However, retrieval of relevant information on the Web still remains difficult. To simplify this process, we designed a semantic summarizing tool for scientific publications retrieved from the Web. In this paper, we presented the architecture of our approach and demonstrated how our solution works.
intelligent data acquisition and advanced computing systems technology and applications | 2015
Yuma Makino; Vitaly Klyuev
In recent yeas a lot of web applications have been released in the world. At the same time, cyber attacks against web application vulnerabilities have also increased. In such a situation, it is necessary to make web applications more secure. However checking all web vulnerabilities by hand is very difficult and time-consuming. Therefore, we need a web application vulnerability scanner. In this work, we evaluate two open source vulnerability scanners OWASP Zed Attack Proxy (OWASP ZAP) and Skipfish using vulnerable web applications Damn Vulnerable Web Application (DVWA) and The Web Application Vulnerability Scanner Evaluation Project (WAVSEP).
international conference on future information technology | 2010
Vitaly Klyuev; Vladimir A. Oleshchuk
General purpose search engines utilize a very simple view on text documents: They consider them as bags of words. It results that after indexing, the semantics of documents is lost. In this paper, we introduce a novel approach to improve the accuracy of Web retrieval. We utilize the WordNet and WordNet SenseRelate All Words Software as main tools to preserve the semantics of the sentences of documents and user queries. Nouns and verbs in the WordNet are organized in the tree hierarchies. The word meanings are presented by numbers that reference to the nodes on the semantic tree. The meaning of each word in the sentence is calculated when the sentence is analyzed. The goal is to put each noun and verb of the sentence on the right place on the tree. Taking this information into account, it is possible to solve the ambiguity problem for the query keywords and create the indicative summaries taking into account query words, and semantically related hypernyms and synonyms.
2010 3rd International Conference on Human-Centric Computing | 2010
Ai Yokoyama; Vitaly Klyuev
Nowadays, Internet users are familiar with the Web searching process; and searching is the most common task performed on the Web. However, the web search is especially difficult for beginners when they try to utilize a keyword query language. Subsequently, beginners usually try to find information with ambiguous queries. Users receive non-relevant information in response to queries. Our goal is to make the search process more convenient for them. We assume that top ranked returned pages are relevant to the user query. We find the most important terms on these pages. In addition to that, we get synonyms and hypernyms for the terms of the user query utilizing Japanese WordNet. We combine the aforementioned words together and this expanded query is then submitted to the search engine. These operations are done automatically by our prototype, so that the web searching process is easier for beginners. The experimental results showed that our query expansion technique can improve the search performance and has several advantages.
2009 Second International Conference on Advances in Human-Oriented and Personalized Mechanisms, Technologies, and Services | 2009
Denis Vazhenin; Satoru Ishikawa; Vitaly Klyuev
The information resources on the web become increasingly global in nature. Their amount is continuingly growing. A solution to summarize the retrieved pages on the fly and to design the simplest user interface is possible approach to improve and speed up the retrieval of the information from the web. This paper discusses the algorithms to implement the aforementioned approach and results of preliminary experiments.
dependable autonomic and secure computing | 2016
Marina Purgina; Maxim Mozgovoy; Vitaly Klyuev
The architectural and user interface patterns of mobile applications are well established for most popular software types. However, it is still challenging to design a mobile application for a use scenario beyond typical daily tasks. In this paper, we describe the challenges and design decision of mobile WordBricks software -- a virtual lab-like environment for natural language grammar acquisition. The flexibility of natural language grammar and complexity of visual representation of syntactical word relationships as well as specific pedagogical requirements required flexible system design decisions. We base the system on a combination of dynamic GUI elements creation and XML description of graphical scene contents. The system was successfully tested in a real classroom environment, and proved demonstrated high flexibility and maintainability.