O. Iakushkin, Lilia Tazieva, A. Eremin, M. Balabanov
{"title":"Modification of JPS+ Algorithm for Optimal Pathfinding on Uniform-Cost Grids","authors":"O. Iakushkin, Lilia Tazieva, A. Eremin, M. Balabanov","doi":"10.1145/3274856.3274883","DOIUrl":"https://doi.org/10.1145/3274856.3274883","url":null,"abstract":"Pathfinding is a widespread task in many domains, including computer games, robotics and road maps. This paper describes the work of JPS+ algorithm and puts forward its modifications allowing to reduce pathfinding time. We propose to use a visibility graph to modify the map pre-processing logic at the stage of Primary Jump Points calculation. The paper also puts forward modifications in the shortest path algorithm solved for two points: the logic of Target Jump Points work and Primary Jump Points filtering has been altered to deal with obstacles. We propose an open-source software solution that accommodates the modifications.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117123627","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On Modification of the Positional Optimization Method for a Class of Nonlinear Systems","authors":"A. S. Popkov, N. Smirnov, T. Smirnova","doi":"10.1145/3274856.3274866","DOIUrl":"https://doi.org/10.1145/3274856.3274866","url":null,"abstract":"An optimal control problem in a class of nonlinear systems is considered. A modification of the positional optimization approach to the optimal control of feedback type synthesis is suggested. The problem of nonlinear control is reduced to a problem of optimal control for an auxiliary linear approximation system at each step of algorithm, and then to a linear programming problem. If the time to solve the auxiliary linear problem does not exceed the algorithm time step, we can say that the control system realizes the positional control in real time. The proposed method is illustrated with an optimal control problem for the mathematical pendulum.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Overview and Categorization of Recent Approaches to Microblog Classification","authors":"Veranika Mikhailava, Victor Khaustov, V. Klyuev","doi":"10.1145/3274856.3274882","DOIUrl":"https://doi.org/10.1145/3274856.3274882","url":null,"abstract":"A growing popularity of microblogs requires scientists to develop methods for effective and efficient analysis of short texts in order to understand opinions of microblog users and the trustworthiness of their messages. In this review, we examine most common approaches to sentiment analysis in microblogs and explain their advantages and weaknesses. We also review approaches to assessing credibility in news headlines and political statements and discuss their applicability in microblogs. Distinct characteristics of microblog posts, such as slang, emoticons, poor grammar and spelling are in the focus of the evaluation. Such properties of microblog messages deteriorate the performance of conventional classifiers and limit their use in practical applications.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125266987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparison of Pipelined Asynchronous Circuits Designed for FPGA","authors":"Takuya Kudo, H. Saito","doi":"10.1145/3274856.3274871","DOIUrl":"https://doi.org/10.1145/3274856.3274871","url":null,"abstract":"Asynchronous circuits where circuit components are controlled by local handshake signals are low power consumption due to the absence of global signals. Various pipelined asynchronous circuits have been proposed. However, it has not been addressed which circuit is better when field programmable gate arrays (FPGAs) are used as the target device. In this paper, we design four pipelined asynchronous circuits for a commercial FPGA. We also describe the modeling method and the design flow. In the experiment, we compare them in terms of circuit area, execution time, dynamic power consumption, and energy consumption.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125288561","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Steinberg, Anton Baglij, V. Petrenko, V. Burkhovetskiy, O. Steinberg, Elena Metelica
{"title":"An Analyzer for Program Parallelization and Optimization","authors":"B. Steinberg, Anton Baglij, V. Petrenko, V. Burkhovetskiy, O. Steinberg, Elena Metelica","doi":"10.1145/3274856.3274875","DOIUrl":"https://doi.org/10.1145/3274856.3274875","url":null,"abstract":"The article describes new facilities for program optimization and parallelization, work-in-progress modifications of previously implemented program transformations and compiler libraries, and future development of Optimizing parallelizing system (OPS) including opening its source code on GitHub. These new facilities, such as dialog-based optimization and parallelization, user-friendly program dependency visualization (which is needed for high-quality analyzers), parallel code generation for accelerators (GPUs, DSPs, FPGAs, or high performance clusters), are made possible by the fact, that OPS uses high-level intermediate representation as opposed to low-level intermediate representation used in popular compilers.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Iurii Lezhenin, A. Zhuikov, Mikhail Maltsev, N. Bogach, Yasuta Takako
{"title":"Evaluation Framework for PitchKeywordExtractor","authors":"Iurii Lezhenin, A. Zhuikov, Mikhail Maltsev, N. Bogach, Yasuta Takako","doi":"10.1145/3274856.3274884","DOIUrl":"https://doi.org/10.1145/3274856.3274884","url":null,"abstract":"Evaluation framework for PitchKeywordExtractor (PKE framework) - intonation-based automatic keyword extractor for speech is presented. PKE framework is an external graphic tool for data preparing and algorithm validation.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134642623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Elliptic Curves Discrete Logarithm Problem over a Finite Prime Field Fp and p-adic Approximations","authors":"Franck Leprévost, Nicolas Bernard, P. Bouvry","doi":"10.1145/3274856.3274860","DOIUrl":"https://doi.org/10.1145/3274856.3274860","url":null,"abstract":"These notes summarize some computations conducted around the Elliptic Curves Discrete Logarithm Problem (ECDLP) over a finite prime field Fp. Instead of directly considering the problem of finding an integer m such that Q = [m]P, where Ē is an elliptic curve defined over Fp of order a prime l, and P, Q ∈ Ē (Fp), we rather consider two such problems. Using the p-adic elliptic logarithm, we mainly show that finding m amounts to finding good approximations, at orders for which we provide an explicit upper bound, of the liftings of the different points considered in some groups of the filtrations of neighborhoods of the point at infinity of the lifting of the elliptic curve over Qp. We do not claim to solve the ECDLP, but rather to provide an interpretation of the problem in a context that may turn out to be useful, if one can find an efficient method to concretely capture the approximations at the appropriate order.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132423508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Proceedings of the 3rd International Conference on Applications in Information Technology","authors":"","doi":"10.1145/3274856","DOIUrl":"https://doi.org/10.1145/3274856","url":null,"abstract":"","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cluster Analysis to Estimate the Difficulty of Programming Problems","authors":"Chowdhury Md Intisar, Y. Watanobe","doi":"10.1145/3274856.3274862","DOIUrl":"https://doi.org/10.1145/3274856.3274862","url":null,"abstract":"Programming is one of the vital skills for the next generation. Currently, there are many online platforms where programmers compete and solve programming problems. Those platforms are composed of problems with varying degree of difficulties. For expert programmers, the difficulty level is not a concern, but it is very important for novice programmers to approach programming problems based on their experience and level. Thus it is important to construct an expert system which can categorize the programming problems based on their difficulties. In our research, we have proposed an expert system which is based on fuzzy rules derivation. These fuzzy rules have been derived by performing cluster analysis on submission log data of Aizu Online judge database. Different clustering algorithms were examined based on the features of these programming problems. The performance of the expert system was compared with 3 different learning models (Decision tree, Random forest, K-nearest neighbor). A high accuracy score on the testing set proves the validity of our constructed fuzzy rules for the expert system.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116522904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"WWW-based Remote Controller for LEGO robots","authors":"Takumi Sato, Georges Meguro, A. Vazhenin","doi":"10.1145/3274856.3274878","DOIUrl":"https://doi.org/10.1145/3274856.3274878","url":null,"abstract":"Robot applications can be considered as an integration of the three parts. Firstly, it is a hardware including mechanical and electronic components from which a robot can be assembled according to its purpose and functionality. Accordingly, the second item is an internal robot program supporting the functionality and workability of the robot components as well as communicating with external host. The third element is a software system working on the host computer that can be considered as a bridge between a robot, end-user and external world. The work presented is devoted to designing the WEB-based execution environment following to topics mentioned above third item. Our attention is oriented to end-user application extending possibilities of the on-line userâĂŹs control via the WWW-based interface. This article describes the WWW-based remote EV3 controller designed with JAVA technologies focusing to exchange data between server and a robot. The controller allows emulating the robot control panel providing the ability of the EV3 remote operations via web browser.","PeriodicalId":373840,"journal":{"name":"Proceedings of the 3rd International Conference on Applications in Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133177994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}