When operating a robot in a real environment, its behavior is probabilistic because of slight transition of the robot’s state or error in the action taken at a given time. In this case, it is difficult to operate the robot using rule-based-like action decision methods. Therefore, ad-hoc-like action decision methods are needed. A method is proposed for deciding on future actions based on a robot’s present information. The state-action pair prediction method has been reported; it links the state and future actions of a robot using internal information. A statistical approach to state-action pair prediction has been introduced previously, in which the existence probability of a state and action in the future is calculated according to the normal distribution. This paper considers the situation where a command input is sent to an inverted pendulum. Based on this command input, the shape of the floor is changed from flat to undulating. The results of verification experiments confirm that the proposed method can adjust the shape of the floor autonomously.
{"title":"ADAPTABILITY TO PERIODIC VARIABLE DISTURBANCE USING PROBABILISTIC STATE-ACTION PAIR PREDICTION","authors":"Masashi Sugimoto","doi":"10.17781/P002215","DOIUrl":"https://doi.org/10.17781/P002215","url":null,"abstract":"When operating a robot in a real environment, its behavior is probabilistic because of slight transition of the robot’s state or error in the action taken at a given time. In this case, it is difficult to operate the robot using rule-based-like action decision methods. Therefore, ad-hoc-like action decision methods are needed. A method is proposed for deciding on future actions based on a robot’s present information. The state-action pair prediction method has been reported; it links the state and future actions of a robot using internal information. A statistical approach to state-action pair prediction has been introduced previously, in which the existence probability of a state and action in the future is calculated according to the normal distribution. This paper considers the situation where a command input is sent to an inverted pendulum. Based on this command input, the shape of the floor is changed from flat to undulating. The results of verification experiments confirm that the proposed method can adjust the shape of the floor autonomously.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132924373","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}
Existing video communication systems, used in business or private life, provides file data transfer function. However, these systems need many manipulation steps by using mouse and keyboard. These steps are not easy to transfer files for the PC beginners. Furthermore, it is not intuitive action from the point of view of handing of things. In order to solve these issues, we have proposed 3D video communication system by using Kinect and Head Mounted Display (HMD). This system provides users communications with realistic sensation and intuitive manipulation. In this system, users can see the other user’s body part through HMD and communicate in AR (Augmented Reality) space. In this paper, we provide a intuitive file data transfer application by handing of AR objects using this system.
{"title":"DEVELOPMENT A FILE TRANSFER APPLICATION BY HANDOVER FOR 3D VIDEO COMMUNICATION SYSTEM IN SYNCHRONIZED AR SPACE","authors":"Y. Fujibayashi, H. Imamura","doi":"10.17781/p001980","DOIUrl":"https://doi.org/10.17781/p001980","url":null,"abstract":"Existing video communication systems, used in business or private life, provides file data transfer function. However, these systems need many manipulation steps by using mouse and keyboard. These steps are not easy to transfer files for the PC beginners. Furthermore, it is not intuitive action from the point of view of handing of things. In order to solve these issues, we have proposed 3D video communication system by using Kinect and Head Mounted Display (HMD). This system provides users communications with realistic sensation and intuitive manipulation. In this system, users can see the other user’s body part through HMD and communicate in AR (Augmented Reality) space. In this paper, we provide a intuitive file data transfer application by handing of AR objects using this system.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129546632","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":"Temperature and Humidity Management of the Storage Houses of Food Using Data Logger","authors":"A. Alkandari","doi":"10.17781/P002366","DOIUrl":"https://doi.org/10.17781/P002366","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121315323","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}
Present and future multi-core computational system architecture attracts researchers to utilize this architecture as an adequate and inexpensive solution to achieve high performance computation for many problems. The multi-core architecture enables us to implement shared memory and/or message passing parallel processing paradigms. Therefore, we need appropriate standard libraries in order to utilize the resources of this architecture efficiently and effectively. In this work, we evaluate the performance of message passing using two versions of the well-known message passing interface (MPI) library: MPICH1 vs. MPICH2. Furthermore, we compared the performance of shared memory using OpenMP that supports multithreading with MPI. The results show that the performance when MPICH2 is used is better than MPICH1. The results indicate that multithreading performs better than message passing.
{"title":"PERFORMANCE EVALUATION OF MESSAGE PASSING VS. MULTITHREADING PARALLEL PROGRAMMING PARADIGMS ON MULTI-CORE SYSTEMS","authors":"Hadi Khalilieh, Rezek Mohammad Nidal Kafri","doi":"10.17781/P009","DOIUrl":"https://doi.org/10.17781/P009","url":null,"abstract":"Present and future multi-core computational system architecture attracts researchers to utilize this architecture as an adequate and inexpensive solution to achieve high performance computation for many problems. The multi-core architecture enables us to implement shared memory and/or message passing parallel processing paradigms. Therefore, we need appropriate standard libraries in order to utilize the resources of this architecture efficiently and effectively. In this work, we evaluate the performance of message passing using two versions of the well-known message passing interface (MPI) library: MPICH1 vs. MPICH2. Furthermore, we compared the performance of shared memory using OpenMP that supports multithreading with MPI. The results show that the performance when MPICH2 is used is better than MPICH1. The results indicate that multithreading performs better than message passing.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202926","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}
We propose a hybrid method based for the Optic Disc (OD) detection in the retinal image. This research consists of three main steps. First, blood vessel removal with homomorphic and median filtering. Second, edge detection using canny operator. Third, OD detection using the Hough transform. The Hough transform is used since the objective object is the curve with circle shape, i.e. optic disc region. Therefore, we can find the shape by using the Hough transform with the circle equation. In this research, the generated circles from Hough transform are matched with the edge pixels of the retinal image. The closest match (showed by the maximum value of accumulator) means that the optic disc is detected. The experiments show that the best accuracy is achieved when the distance value between the generated circles is 3. The average sensitivity, specificity, and balanced accuracy are 64.6182575%, 98.58545%, and 81.6018%, respectively.
{"title":"HYBRID METHOD BASED RETINAL OPTIC DISC DETECTION","authors":"A. Muntasa, M. Siradjuddin","doi":"10.17781/p001900","DOIUrl":"https://doi.org/10.17781/p001900","url":null,"abstract":"We propose a hybrid method based for the Optic Disc (OD) detection in the retinal image. This research consists of three main steps. First, blood vessel removal with homomorphic and median filtering. Second, edge detection using canny operator. Third, OD detection using the Hough transform. The Hough transform is used since the objective object is the curve with circle shape, i.e. optic disc region. Therefore, we can find the shape by using the Hough transform with the circle equation. In this research, the generated circles from Hough transform are matched with the edge pixels of the retinal image. The closest match (showed by the maximum value of accumulator) means that the optic disc is detected. The experiments show that the best accuracy is achieved when the distance value between the generated circles is 3. The average sensitivity, specificity, and balanced accuracy are 64.6182575%, 98.58545%, and 81.6018%, respectively.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126879548","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}
M. Hussin, Nor Azura Husin Noris Mohd. Norowi Raja Azlina Raja Mahmood
Cloud computing becomes a powerful trend in the development of ICT services. It allows dynamic resource scaling from infinite resource pool for supporting Cloud users. Such scenario leads to necessity of larger size of computing infrastructure and increases processing power. Demand on the cloud computing is continually growth that makes it changes to scope of green cloud computing. It aims to reduce energy consumption in Cloud computing while maintaining a better performance. However, there is lack of performance metric that analyzing trade-off between energy consumption and performance. Considering high volume of mixed users’ requirements and diversity of services offered; an appropriate performance model for achieving better balance between Cloud performance and energy consumption is needed. In this work, we focus on green Cloud Computing through scheduling optimization model. Specifically, we investigate a relationship between performance metrics that chosen in scheduling approaches with energy consumption for energy efficiency. Through such relationship, we develop an energy-based performance model that provides a clear picture on parameter selection in scheduling for effective energy management. We believed that better understanding on how to model the scheduling performance will lead to green Cloud computing.
{"title":"A performance optimization model of task scheduling towards green cloud computing","authors":"M. Hussin, Nor Azura Husin Noris Mohd. Norowi Raja Azlina Raja Mahmood","doi":"10.17781/P002026","DOIUrl":"https://doi.org/10.17781/P002026","url":null,"abstract":"Cloud computing becomes a powerful trend in the development of ICT services. It allows dynamic resource scaling from infinite resource pool for supporting Cloud users. Such scenario leads to necessity of larger size of computing infrastructure and increases processing power. Demand on the cloud computing is continually growth that makes it changes to scope of green cloud computing. It aims to reduce energy consumption in Cloud computing while maintaining a better performance. However, there is lack of performance metric that analyzing trade-off between energy consumption and performance. Considering high volume of mixed users’ requirements and diversity of services offered; an appropriate performance model for achieving better balance between Cloud performance and energy consumption is needed. In this work, we focus on green Cloud Computing through scheduling optimization model. Specifically, we investigate a relationship between performance metrics that chosen in scheduling approaches with energy consumption for energy efficiency. Through such relationship, we develop an energy-based performance model that provides a clear picture on parameter selection in scheduling for effective energy management. We believed that better understanding on how to model the scheduling performance will lead to green Cloud computing.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116243694","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}
Plant factories with artificial light (PFAL) are attracting worldwide attention as a technology for stably producing crops. One of the problems of PFAL is tipburn which is a physiological disorder of crops. Tipburn is a phenomenon in which plant growth point cells are necrotized. Lettuce cultivated in PFAL in particular has a high frequency of tipburn. When tipburn occurs, its identification is done by human eye observation, and tipburn leaves are trimmed by hand or tipburn lettuce is removed from products. These operations require much labor and cost. If tipburn identification can automatically be done using machine learning, the economic effect will be great and it will be a driving force for spreading PFAL. In this study, we aim to perform binary discrimination of tipburn occurrence and its non-occurrence about lettuce cultivated in PFAL using machine learning with convolutional neural networks. In particular, we aim to recognize the symptom of tipburn which means the early stages of tipburn immediately before leaf tips discolor blackly and the commercial value as the vegetables is damaged. The results of the experiments indicate that the recognition of the symptom of tipburn can be performed with high accuracy.
{"title":"Automatic Identification of Plant Physiological Disorders in Plant Factories\u0000with Artificial Light Using Convolutional Neural Networks","authors":"S. Shimamura, Seiichi Koakutsu Kenta Uehara","doi":"10.17781/p002611","DOIUrl":"https://doi.org/10.17781/p002611","url":null,"abstract":"Plant factories with artificial light (PFAL) are attracting worldwide attention as a technology for stably producing crops. One of the problems of PFAL is tipburn which is a physiological disorder of crops. Tipburn is a phenomenon in which plant growth point cells are necrotized. Lettuce cultivated in PFAL in particular has a high frequency of tipburn. When tipburn occurs, its identification is done by human eye observation, and tipburn leaves are trimmed by hand or tipburn lettuce is removed from products. These operations require much labor and cost. If tipburn identification can automatically be done using machine learning, the economic effect will be great and it will be a driving force for spreading PFAL. In this study, we aim to perform binary discrimination of tipburn occurrence and its non-occurrence about lettuce cultivated in PFAL using machine learning with convolutional neural networks. In particular, we aim to recognize the symptom of tipburn which means the early stages of tipburn immediately before leaf tips discolor blackly and the commercial value as the vegetables is damaged. The results of the experiments indicate that the recognition of the symptom of tipburn can be performed with high accuracy.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128278009","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}
The goal of the article was to examine the relationship between the content of text documents published on the Internet and the direction of movement of stock prices on the Prague Stock Exchange. The relationship was modeled by text classification. As data were used news articles and discussion posts on Czech websites and the value of the PX stock index and stock price of company CEZ. Document’s class (plus/minus/constant) was determined by the relative price change that happened between the publication date of a document and the next working day. We achieved a high accuracy of 75% for classification of discussion posts, however the classification accuracy for news articles was about 60%. We tried both binary (documents with constant class were discarded) and ternary classification – the former was in all cases more successful.
{"title":"Examining Stock Price Movements on Prague Stock Exchange Using Text Classification","authors":"Jonás Petrovský, Frantisek Darena Pavel Netolický","doi":"10.17781/P002293","DOIUrl":"https://doi.org/10.17781/P002293","url":null,"abstract":"The goal of the article was to examine the relationship between the content of text documents published on the Internet and the direction of movement of stock prices on the Prague Stock Exchange. The relationship was modeled by text classification. As data were used news articles and discussion posts on Czech websites and the value of the PX stock index and stock price of company CEZ. Document’s class (plus/minus/constant) was determined by the relative price change that happened between the publication date of a document and the next working day. We achieved a high accuracy of 75% for classification of discussion posts, however the classification accuracy for news articles was about 60%. We tried both binary (documents with constant class were discarded) and ternary classification – the former was in all cases more successful.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129621410","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}
In this paper, we investigate the effectiveness of Thread Weight Readjustment Scheduler (TWRS) for multitasking operating systems from the view point of fairness. Fairness is one of the most important criteria in designing any operating system scheduler. TWRS is a proportional share CPU scheduler designed explicitly for scheduling multithreaded processes depending on weight readjustment. We show that weight readjustment enables existing scheduler to significantly reduce, but not eliminate, the unfair in its allocations. TWRS preallocates certain amount of CPU time to each thread of the running multi-threaded processes. The scheduler was implemented and evaluated under specific hardware and software environment. We implement our scheduler in the Linux kernel and demonstrate its efficacy through an experimental evaluation. According to our evaluation results, our scheduler is promising to optimize some scheduling criteria, fairness in this context. We conclude from our results that TWRS is practical and desirable for general-purpose operating systems.
{"title":"EFFECT OF THREAD WEIGHT READJUSTMENT SCHEDULER ON FAIRNESS IN MULTITASKING OS","authors":"S. Mostafa, S. Kusakabe","doi":"10.17781/P0018","DOIUrl":"https://doi.org/10.17781/P0018","url":null,"abstract":"In this paper, we investigate the effectiveness of Thread Weight Readjustment Scheduler (TWRS) for multitasking operating systems from the view point of fairness. Fairness is one of the most important criteria in designing any operating system scheduler. TWRS is a proportional share CPU scheduler designed explicitly for scheduling multithreaded processes depending on weight readjustment. We show that weight readjustment enables existing scheduler to significantly reduce, but not eliminate, the unfair in its allocations. TWRS preallocates certain amount of CPU time to each thread of the running multi-threaded processes. The scheduler was implemented and evaluated under specific hardware and software environment. We implement our scheduler in the Linux kernel and demonstrate its efficacy through an experimental evaluation. According to our evaluation results, our scheduler is promising to optimize some scheduling criteria, fairness in this context. We conclude from our results that TWRS is practical and desirable for general-purpose operating systems.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125905430","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":"A Study for Development of Route Prediction Method for Vessel using SVR","authors":"Kotetsu Kawakami, Jumpei Matsue, Ryota Isozaki, Shunsuke Inada, Masashi Sugimoto, S. Tsuzuki, Kazuhiko Nagao","doi":"10.17781/P002648","DOIUrl":"https://doi.org/10.17781/P002648","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125961786","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：