{"title":"DEVELOPMENT OF A CITY PLANNING SIMULATION SYSTEM USING LEAP MOTION IN THE AR SPACE","authors":"Naoki Hanakawa, H. Tominaga","doi":"10.17781/P002236","DOIUrl":"https://doi.org/10.17781/P002236","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"11 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":"133612377","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":"Dimensionality Reduction for State-action Pair Prediction based on Tendency of State and Action","authors":"Masashi Sugimoto","doi":"10.17781/P002307","DOIUrl":"https://doi.org/10.17781/P002307","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"127 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":"134310971","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}
Images can be represented at different levels, many approaches in the domain of image representation were developed to move from low-level to high-level image representation like Collocation patterns (moving from Visual Words to Visual Phrases), Descriptive Visual Words and Phrases (DVWs & DVPs) for Image applications and Recognition Using Visual Phrases. Moreover, many relevant articles have tackled the problem of image representation in the case of image retrieval. These articles showed advantages and disadvantages of the used methods in addressing the problem of image representation. The main purpose of this paper is to tackle these drawbacks based on the performance of image representation. What lacks in other papers is the semantic learning and not considering the spatial location of the region. In this paper, a development is proposed for a semantic coherent visual word pattern representation that considers three main points, the neighbor among visual words, frequent item set among these visual words, and the semantic learning. Keywords—BOW; Image Representation; DVW; DVP; Image Processing; Image Retrieval; Visual Words
{"title":"A New Visual Vocabulary for Object Recognition","authors":"I. Sayad","doi":"10.17781/p002449","DOIUrl":"https://doi.org/10.17781/p002449","url":null,"abstract":"Images can be represented at different levels, many approaches in the domain of image representation were developed to move from low-level to high-level image representation like Collocation patterns (moving from Visual Words to Visual Phrases), Descriptive Visual Words and Phrases (DVWs & DVPs) for Image applications and Recognition Using Visual Phrases. Moreover, many relevant articles have tackled the problem of image representation in the case of image retrieval. These articles showed advantages and disadvantages of the used methods in addressing the problem of image representation. The main purpose of this paper is to tackle these drawbacks based on the performance of image representation. What lacks in other papers is the semantic learning and not considering the spatial location of the region. In this paper, a development is proposed for a semantic coherent visual word pattern representation that considers three main points, the neighbor among visual words, frequent item set among these visual words, and the semantic learning. Keywords—BOW; Image Representation; DVW; DVP; Image Processing; Image Retrieval; Visual Words","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"29 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133139689","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 view of the DSM (Demand Side Management) under the big data environment, an improved FCM (Fuzzy C-Mean) clustering with Gauss data preprocessing is proposed, and the daily load curve of the whole study area was obtained with the electricity data. According to the formulation of the TOU (Time of Use) price, which is consistent with the characteristics of local users is given. The electricity suggestions based on the specific user load curve is provided, including the return of the DR (Demand Response). Subsequently, the sampling division is put forward to expand the improved model. Finally, the method is tested by the actual data, and the results show that it has a processing speed 10 times of the direct processing when the data is more
针对大数据环境下的需求侧管理(Demand Side Management, DSM)，提出了一种基于高斯数据预处理的改进FCM (Fuzzy C-Mean)聚类方法，利用用电数据得到整个研究区域的日负荷曲线。根据制定的TOU (Time of Use)价格，给出符合当地用户特点的价格。根据具体的用户负荷曲线给出用电建议，包括返回DR (Demand Response)。随后，提出了抽样划分，对改进模型进行了扩展。最后，通过实际数据对该方法进行了测试，结果表明，当数据量较大时，该方法的处理速度是直接处理的10倍
{"title":"CLUSTER SAMPLING FOR THE DEMAND SIDE MANAGEMENT OF POWER BIG DATA","authors":"Yongxin Zhang, Shi Shen","doi":"10.17781/P002208","DOIUrl":"https://doi.org/10.17781/P002208","url":null,"abstract":"In view of the DSM (Demand Side Management) under the big data environment, an improved FCM (Fuzzy C-Mean) clustering with Gauss data preprocessing is proposed, and the daily load curve of the whole study area was obtained with the electricity data. According to the formulation of the TOU (Time of Use) price, which is consistent with the characteristics of local users is given. The electricity suggestions based on the specific user load curve is provided, including the return of the DR (Demand Response). Subsequently, the sampling division is put forward to expand the improved model. Finally, the method is tested by the actual data, and the results show that it has a processing speed 10 times of the direct processing when the data is more","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"103 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":"133382559","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":"GPU-BASED OBJECT IDENTIFICATION IN LARGE-SCALE IMAGES FOR REAL-TIME RADAR SIGNAL ANALYSIS","authors":"I. Shioya, Takahiro Yamamoto","doi":"10.17781/P002225","DOIUrl":"https://doi.org/10.17781/P002225","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"22 14 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":"134386954","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}
Amr I. Abdelrahman, Mohamed Kholief Ali El-Bastawissy
Data integration from different data sources may result in data inconsistencies due to different representation of the same objects at the data source. Many researchers have tried to solve this problem manually or using source features. None of them took the user’s preferences to source features into account. This paper proposes using fuzzy logic with multiple constraints, in accordance with user preference, to resolve inconsistencies. This approach uses token-based cleaner, a content based inconsistency detection algorithm, to detect inconsistencies. Then, uses fuzzy logic to resolve inconsistencies. An experiment was conducted using our fuzzy algorithm on a trained dataset that reflects our designated point of view. The result indicates that multiple constraints decision making is a suitable technique for resolving inconsistencies.
{"title":"INCONSISTENCY RESOLUTION IN THE VIRTUAL DATABASE ENVIRONMENT USING FUZZY LOGIC","authors":"Amr I. Abdelrahman, Mohamed Kholief Ali El-Bastawissy","doi":"10.17781/p002037","DOIUrl":"https://doi.org/10.17781/p002037","url":null,"abstract":"Data integration from different data sources may result in data inconsistencies due to different representation of the same objects at the data source. Many researchers have tried to solve this problem manually or using source features. None of them took the user’s preferences to source features into account. This paper proposes using fuzzy logic with multiple constraints, in accordance with user preference, to resolve inconsistencies. This approach uses token-based cleaner, a content based inconsistency detection algorithm, to detect inconsistencies. Then, uses fuzzy logic to resolve inconsistencies. An experiment was conducted using our fuzzy algorithm on a trained dataset that reflects our designated point of view. The result indicates that multiple constraints decision making is a suitable technique for resolving inconsistencies.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"47 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":"133723936","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}
Idris Zakariyya, Mohd Nazri Ismail M Nordin A Rahman
Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.
{"title":"MODELLING THE PERFORMANCE OF CLASS-BASED WEIGHTED FAIR QUEUE USING OPNET","authors":"Idris Zakariyya, Mohd Nazri Ismail M Nordin A Rahman","doi":"10.17781/p001709","DOIUrl":"https://doi.org/10.17781/p001709","url":null,"abstract":"Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"25 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":"133228567","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 brain-computer interface (BCI) aim to use Electroencephalography (EEG) or other measures of brain functions can be implemented for communication with smart devices for disabled persons. For connection with different smart devices was used recorded with experimental setup electrophysiological signals for execution of five different mental tasks. The recorded brain signals were processed for their transformation into commands to different devices. This signal processing aims to extract some specific features of brain signals and transform them into algorithms for connection with smart devices. Processed signals after noise filtering, clustering and classification with Bayesian Network classifier and pair-wise classifier was estimated and put into brain-computer interface for connection with smart devices. Recent advances in emotion recognition use a combination of two intrapersonal modalities face and EEG to estimate emotion. In this research is made an attempt to combine received results on the base of record electrophysiological signals at execution of five different mental tasks with estimation of human emotion. This will help to provide a framework for reliable EEG emotional state estimation combined with facial emotion analysis in developed task-oriented BCI.
{"title":"BRAIN - COMPUTER INTERFACE FOR COMMUNICATION AND ESTIMATION OF HUMAN EMOTION FROM EEG AND VIDEO","authors":"S. Radeva, D. Radev","doi":"10.17781/P002028","DOIUrl":"https://doi.org/10.17781/P002028","url":null,"abstract":"The brain-computer interface (BCI) aim to use Electroencephalography (EEG) or other measures of brain functions can be implemented for communication with smart devices for disabled persons. For connection with different smart devices was used recorded with experimental setup electrophysiological signals for execution of five different mental tasks. The recorded brain signals were processed for their transformation into commands to different devices. This signal processing aims to extract some specific features of brain signals and transform them into algorithms for connection with smart devices. Processed signals after noise filtering, clustering and classification with Bayesian Network classifier and pair-wise classifier was estimated and put into brain-computer interface for connection with smart devices. Recent advances in emotion recognition use a combination of two intrapersonal modalities face and EEG to estimate emotion. In this research is made an attempt to combine received results on the base of record electrophysiological signals at execution of five different mental tasks with estimation of human emotion. This will help to provide a framework for reliable EEG emotional state estimation combined with facial emotion analysis in developed task-oriented BCI.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"9 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":"133670502","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}
Kengo Masumi, S. Tsuzuki, M. Sugimoto, H. Yoshimura
{"title":"A Study on Model-Based Development of Embedded System using Open Source Computational Environment","authors":"Kengo Masumi, S. Tsuzuki, M. Sugimoto, H. Yoshimura","doi":"10.17781/p002643","DOIUrl":"https://doi.org/10.17781/p002643","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"2 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":"121524305","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 wireless sensor network is set of hundreds or thousands nodes, where each node is connected to one or sometimes several sensors. A WSN integrated circuits, sensor, embedded computing, modern network, Wireless communication and distributed information processing. Wireless sensor networks, a technology acquisition and processing of information. Recent developments in the course of it, in order to miniaturization and low power design. They act as a gateway between sensor nodes and the end user as they typically forward data from the WSN on to a server. Other special components in routing based networks are routers, designed to compute, calculate and distribute the routing tables. The project dealt with the problem of routing wireless sensor networks for energy balance. To optimize the solution, genetic algorithm is proposed. Key points when choosing the cluster center is proposed for placement algorithm. In this paper, the proposed standard algorithms, simulated results based on the parameters of the number of dead nodes, the number of bits transmitted to a base station, the number of bits sent to the heads of energy consumption compared repetitions and show superiority over the network the proposed algorithm is relative.
{"title":"OPTIMIZED ENERGY CONSUMPTION IN WIRELESS SENSOR NETWORK ROUTING BY GENETIC ALGORITHM","authors":"Dadmehr Rahbari","doi":"10.17781/p001981","DOIUrl":"https://doi.org/10.17781/p001981","url":null,"abstract":"The wireless sensor network is set of hundreds or thousands nodes, where each node is connected to one or sometimes several sensors. A WSN integrated circuits, sensor, embedded computing, modern network, Wireless communication and distributed information processing. Wireless sensor networks, a technology acquisition and processing of information. Recent developments in the course of it, in order to miniaturization and low power design. They act as a gateway between sensor nodes and the end user as they typically forward data from the WSN on to a server. Other special components in routing based networks are routers, designed to compute, calculate and distribute the routing tables. The project dealt with the problem of routing wireless sensor networks for energy balance. To optimize the solution, genetic algorithm is proposed. Key points when choosing the cluster center is proposed for placement algorithm. In this paper, the proposed standard algorithms, simulated results based on the parameters of the number of dead nodes, the number of bits transmitted to a base station, the number of bits sent to the heads of energy consumption compared repetitions and show superiority over the network the proposed algorithm is relative.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"330 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":"123664108","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
扫码关注我们
求助内容：
应助结果提醒方式：