{"title":"Content Based Image Retrieval using Multimodal Data based on CCA","authors":"I. Sayad","doi":"10.17781/P002447","DOIUrl":"https://doi.org/10.17781/P002447","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133280206","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":"24 1","pages":"0"},"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":"8 1","pages":"0"},"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}
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":"1 1","pages":"0"},"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}
Muhammad Zeeshan, Rabia Nabila Rehman Nayab Nasir Saadia Anayat
This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.
{"title":"AN EASIER WAY TO UNDERSTAND THE UNDECIDABILITY OF HALTING PROBLEM OF TURING MACHINES","authors":"Muhammad Zeeshan, Rabia Nabila Rehman Nayab Nasir Saadia Anayat","doi":"10.17781/P002157","DOIUrl":"https://doi.org/10.17781/P002157","url":null,"abstract":"This paper provides us an easier way to understand the undecidability of the halting problem of Turing machines. Our way is easier because author moves forward by discussing some past concepts in an easier way. The concept of Cantor’s diagonal argument has been discussed in an easier and simpler way that then helps us in understanding the undecidability of the halting problem of Turing machines.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125346242","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 Autonomous Paddy-weeding Robot System –An experimentation for autonomously straight-running based on compass-compensation","authors":"Masashi Sugimoto","doi":"10.17781/p002540","DOIUrl":"https://doi.org/10.17781/p002540","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121655564","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":"129 1","pages":"0"},"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}
{"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":"48 1","pages":"0"},"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}
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":"66 1","pages":"0"},"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}
Drones are vastly used in many civil and military applications. However, there are many factors to be highly considered in military applications.. In order to send a military drone with the aim of acquiring images from multiple sites, the mission time should be the least possible. Therefore, the minimum route plan is required.Simulated annealing (SA) algorithm is one of the metaheuristics selected to generate a feasible solution to solve this problem.This research exploits the parallelism in the simulated annealing with the aim of accelerating the time to find a suitable solution. Parallel programming divides the problem into smaller independent tasks, and then executes the sub-tasks simultaneously. Two parallel versions are therefore developed on different environment: synchronous SA on SMP, and asynchronous SA Complete Search Space (CSS) on parallel clusters. Experiments are conducted on the parallel clusters environment of the SANAM supercomputer. This research details the CSS, and compares it with the SMP SA developed in our previous study. Comparison is made in terms of speedup, efficiency, scalability, and quality of solution.
{"title":"Comparison of Parallel Simulated Annealing on SMP and Parallel Clusters for Planning a Drone’sRoute for Military Image Acquisition","authors":"E. Alsafi","doi":"10.17781/P002376","DOIUrl":"https://doi.org/10.17781/P002376","url":null,"abstract":"Drones are vastly used in many civil and military applications. However, there are many factors to be highly considered in military applications.. In order to send a military drone with the aim of acquiring images from multiple sites, the mission time should be the least possible. Therefore, the minimum route plan is required.Simulated annealing (SA) algorithm is one of the metaheuristics selected to generate a feasible solution to solve this problem.This research exploits the parallelism in the simulated annealing with the aim of accelerating the time to find a suitable solution. Parallel programming divides the problem into smaller independent tasks, and then executes the sub-tasks simultaneously. Two parallel versions are therefore developed on different environment: synchronous SA on SMP, and asynchronous SA Complete Search Space (CSS) on parallel clusters. Experiments are conducted on the parallel clusters environment of the SANAM supercomputer. This research details the CSS, and compares it with the SMP SA developed in our previous study. Comparison is made in terms of speedup, efficiency, scalability, and quality of solution.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121427532","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
扫码关注我们
求助内容：
应助结果提醒方式：