{"title":"Solving Equations Systems Using Artificial Intelligence - a Survey","authors":"Liviu Octavian Mafteiu-Scai, Roxana Mafteiu-Scai Emanuela Mafteiu","doi":"10.17781/P002446","DOIUrl":"https://doi.org/10.17781/P002446","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"51 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":"134412889","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 cloud computing is a new computer model that provide computer services in the form of services on demand, accessible from anywhere, anytime and by anyone, the cloud computing are mainly used for the treatment of loads computer work very intensive and provide very large storage of data, these two objectives are combined with the third goal of potentially reducing management costs and use. In this paper, we present an architecture based on mobile agent for cloud computing, today most applications of cloud computing use the model "client / server" where the exchange is done by sending messages across the network , this model has the disadvantage of increasing the traffic on the network and requires a permanent connection. In this paper, we propose a new approach that uses mobile agents in cloud computing, our architecture is based on mobile agents that have kept the goal of security communication in cloud computing, we are relying on the ability of security of agents.
{"title":"SECURITY METHOD: CLOUD COMPUTING APPROACH BASED ON MOBILE AGENTS","authors":"A. Alwesabi, K. Okba","doi":"10.17781/P002","DOIUrl":"https://doi.org/10.17781/P002","url":null,"abstract":"The cloud computing is a new computer model that provide computer services in the form of services on demand, accessible from anywhere, anytime and by anyone, the cloud computing are mainly used for the treatment of loads computer work very intensive and provide very large storage of data, these two objectives are combined with the third goal of potentially reducing management costs and use. In this paper, we present an architecture based on mobile agent for cloud computing, today most applications of cloud computing use the model \"client / server\" where the exchange is done by sending messages across the network , this model has the disadvantage of increasing the traffic on the network and requires a permanent connection. In this paper, we propose a new approach that uses mobile agents in cloud computing, our architecture is based on mobile agents that have kept the goal of security communication in cloud computing, we are relying on the ability of security of agents.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"39 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":"133307886","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}
During the application specific system design process, the designer has to take early decisions for selecting the optimal system components from the available huge design alternatives. To obtain the optimal design configuration from the available design alternatives, an efficient Design Space Exploration (DSE) process is required. This paper extends our previous work by integrating Bayesian Belief Network (BBN) based design space pruning methodology with the proposed heuristic algorithm for appropriate selection of memory configuration during the system design process. A complete and well structured DSE strategy has been formulated through the combination of BBN and heuristic approaches. The BBN performs design space pruning from the available huge design alternatives, resulting in near Pareto-optimal solution. The proposed heuristic algorithm performs the selection of the most optimal cache options. This paper mainly focuses on integrating the BBN with the proposed heuristic algorithm for providing efficient DSE strategy that aids the system designers during the application specific system design process. The experimental results in support of the proposed heuristic show a considerable reduction in the number of simulations required for covering the design space and also the algorithm finds the most optimal cache configurations for the given application with less number of iterations.
{"title":"Hybrid Design Space Exploration Methodology for Application Specific System Design","authors":"K. Balasubadra","doi":"10.17781/p002363","DOIUrl":"https://doi.org/10.17781/p002363","url":null,"abstract":"During the application specific system design process, the designer has to take early decisions for selecting the optimal system components from the available huge design alternatives. To obtain the optimal design configuration from the available design alternatives, an efficient Design Space Exploration (DSE) process is required. This paper extends our previous work by integrating Bayesian Belief Network (BBN) based design space pruning methodology with the proposed heuristic algorithm for appropriate selection of memory configuration during the system design process. A complete and well structured DSE strategy has been formulated through the combination of BBN and heuristic approaches. The BBN performs design space pruning from the available huge design alternatives, resulting in near Pareto-optimal solution. The proposed heuristic algorithm performs the selection of the most optimal cache options. This paper mainly focuses on integrating the BBN with the proposed heuristic algorithm for providing efficient DSE strategy that aids the system designers during the application specific system design process. The experimental results in support of the proposed heuristic show a considerable reduction in the number of simulations required for covering the design space and also the algorithm finds the most optimal cache configurations for the given application with less number of iterations.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"293 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":"133717257","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}
Redwan A. Al-dilami, Ammar Thabit Zahary Adnan Zain Al-Saqqaf
The study aimed at investigating the problem of online task scheduling of identifying job of MapReduce on cloud computing infrastructures. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging and booting a VM requires a constant setup time. The problem occurs when the VMs turning off after finishing processing a task and running it again for another. The goal is to limit the delay resulted from setting up the VMs, and to minimize the idle cost (VM does not find any task to possess) when VM is continuing in an active state without processing tasks. It was a constant number of VMs in an activation state continuity, and the cost of idle was distributed over existing tasks where the cost should be less than the cost of setting up one VM. The researchers' algorithm limited the delay resulted from setting up the VMs, the cost resulted from the continuing VMs in an active state without processing tasks was distributed to the current tasks fairly. The known cases was discussed where the duration of each task was known upon its arrival.
{"title":"An Enhanced Algorithm for Cloud Scheduling with Setup Cost","authors":"Redwan A. Al-dilami, Ammar Thabit Zahary Adnan Zain Al-Saqqaf","doi":"10.17781/P002468","DOIUrl":"https://doi.org/10.17781/P002468","url":null,"abstract":"The study aimed at investigating the problem of online task scheduling of identifying job of MapReduce on cloud computing infrastructures. It was proposed that the virtualized cloud computing setup comprised machines that host multiple identical virtual machines (VMs) under pay-as-you-go charging and booting a VM requires a constant setup time. The problem occurs when the VMs turning off after finishing processing a task and running it again for another. The goal is to limit the delay resulted from setting up the VMs, and to minimize the idle cost (VM does not find any task to possess) when VM is continuing in an active state without processing tasks. It was a constant number of VMs in an activation state continuity, and the cost of idle was distributed over existing tasks where the cost should be less than the cost of setting up one VM. The researchers' algorithm limited the delay resulted from setting up the VMs, the cost resulted from the continuing VMs in an active state without processing tasks was distributed to the current tasks fairly. The known cases was discussed where the duration of each task was known upon its arrival.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"27 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":"133870089","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. Owayjan, Hasan A. Ezzidine Fady C. Elias-Sleiman, Nourhane Haidar
The interaction between humans and robots has increased and become more personalized in this century. Robots are being used in various fields such as medicine, manufacturing, automation, etc.; however, they lack the interaction capability that is found in a human mainly because more than 60% of human communication is non-verbal, and thus, is hard to replace him. This project presents an interactive face robot which is able to mimic the six universal human facial expressions: happiness, surprise, fear, sadness, anger, and disgust. It can interact with the user using speech recognition in order to mimic a career/major adviser. The Interactive Face Robot is made out of a rubber mask to simulate the skin. Facial expressions are created by moving muscle-like structures based on a facial mass-spring model. Nine servo motors move the different action units in the face to create the different expressions. The Interactive Face Robot mimics a career/major adviser using speech recognition software, the BitVoicer, which recognizes the user’s speech and communicates with a LabVIEWTM program that evaluates the answers and calculates the best career/major choice. The LabVIEWTM program, which runs on a laptop computer, also converts the pre-defined questions that the robot asks into voice, and communicates with an Arduino Mega the expression that the face is to generate. Using pulse-width modulation, the Arduino Mega controls the needed servo motors to create the necessary facial expression. The Interactive Face Robot has proven to be user-friendly, and interacted with humans as pre-programmed. Facial expressions provide robots with more capabilities for human-like interactions, making them more adequate for applications requiring interactions with humans. This Interactive Face Robot can replace a career/major adviser, and can be programmed as a receptionist, front-desk operator, or can be used in therapeutic applications. Keywords—HCI; Facial Expressions; Interactive Robot
{"title":"Interactive Face Robot","authors":"M. Owayjan, Hasan A. Ezzidine Fady C. Elias-Sleiman, Nourhane Haidar","doi":"10.17781/P002435","DOIUrl":"https://doi.org/10.17781/P002435","url":null,"abstract":"The interaction between humans and robots has increased and become more personalized in this century. Robots are being used in various fields such as medicine, manufacturing, automation, etc.; however, they lack the interaction capability that is found in a human mainly because more than 60% of human communication is non-verbal, and thus, is hard to replace him. This project presents an interactive face robot which is able to mimic the six universal human facial expressions: happiness, surprise, fear, sadness, anger, and disgust. It can interact with the user using speech recognition in order to mimic a career/major adviser. The Interactive Face Robot is made out of a rubber mask to simulate the skin. Facial expressions are created by moving muscle-like structures based on a facial mass-spring model. Nine servo motors move the different action units in the face to create the different expressions. The Interactive Face Robot mimics a career/major adviser using speech recognition software, the BitVoicer, which recognizes the user’s speech and communicates with a LabVIEWTM program that evaluates the answers and calculates the best career/major choice. The LabVIEWTM program, which runs on a laptop computer, also converts the pre-defined questions that the robot asks into voice, and communicates with an Arduino Mega the expression that the face is to generate. Using pulse-width modulation, the Arduino Mega controls the needed servo motors to create the necessary facial expression. The Interactive Face Robot has proven to be user-friendly, and interacted with humans as pre-programmed. Facial expressions provide robots with more capabilities for human-like interactions, making them more adequate for applications requiring interactions with humans. This Interactive Face Robot can replace a career/major adviser, and can be programmed as a receptionist, front-desk operator, or can be used in therapeutic applications. Keywords—HCI; Facial Expressions; Interactive Robot","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"45 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":"123792070","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":"Hardware-based scheduling and synchronization for light-weight, fine-grained\u0000multi-threading","authors":"S. Haddad, Jeanine E. Cook","doi":"10.17781/P002649","DOIUrl":"https://doi.org/10.17781/P002649","url":null,"abstract":"","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"07 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":"127139271","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 k-means clustering algorithm is one of the popular and simplest clustering algorithms. Due to its simplicity, it is widely used in many applications. Although k-means has low computational time and space complexity, increasing the dataset size results in increasing the computational time proportionally. One of the most prominent solutions to deal with this problem is the parallel processing. In this paper, we aim to design and implement a parallel k-means clustering algorithm on shared memory multiprocessors using parallel java library. The performance of the parallel algorithm is evaluated in terms of speedup, efficiency and scalability. Accuracy and quality of clustering results are also measured. Furthermore, this paper presents analytical results for the parallel program performance metrics.
{"title":"Parallel k means Clustering Algorithm on SMP","authors":"A. Alrajhi, S. S. Zaghloul","doi":"10.17781/P002523","DOIUrl":"https://doi.org/10.17781/P002523","url":null,"abstract":"The k-means clustering algorithm is one of the popular and simplest clustering algorithms. Due to its simplicity, it is widely used in many applications. Although k-means has low computational time and space complexity, increasing the dataset size results in increasing the computational time proportionally. One of the most prominent solutions to deal with this problem is the parallel processing. In this paper, we aim to design and implement a parallel k-means clustering algorithm on shared memory multiprocessors using parallel java library. The performance of the parallel algorithm is evaluated in terms of speedup, efficiency and scalability. Accuracy and quality of clustering results are also measured. Furthermore, this paper presents analytical results for the parallel program performance metrics.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"89 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":"121481001","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}
This paper aims on the design of a reversible fused 32Point Radix-2 single precision floating point FFT unit using 3:2 compressor. The work focuses on the realization of three reversible fused floating point units: reversible floating point add-sub unit, reversible floating point multiply-add unit and reversible floating point multiply-subtract unit. The proposed work requires the design of a reversible single precision floating point adder, a reversible single precision floating point subtractor and a reversible single precision floating point multiplier. A reversible single precision floating point adder and subtractor is designed with less quantum cost, less number of reversible gates and less constant inputs. A reversible single precision floating point multiplier is implemented using 3:2 compressor as the 24x24 bit multiplier based on 3:2 compressor is highly efficient when compared with the design using 4:3 compressors. A reversible fused 32-Point Radix-2 floating point FFT Unit using 3:2 compressor consumes less number of resources, operates at a slightly greater speed and dissipates less power when compared with the reversible discrete 32-Point Radix-2 floating point FFT Unit. The proposed Fused 32-Point Radix-2 floating point FFT unit using 3:2 compressor dissipates 2.074W while the same design as a discrete implementation dissipates 2.176W.
{"title":"DESIGN OF A REVERSIBLE FUSED 32-POINT RADIX -2 FLOATING POINT FFT UNIT USING 3:2 COMPRESSOR","authors":"A. V. AnanthaLakshmi, G. Sudha","doi":"10.17781/P0020","DOIUrl":"https://doi.org/10.17781/P0020","url":null,"abstract":"This paper aims on the design of a reversible fused 32Point Radix-2 single precision floating point FFT unit using 3:2 compressor. The work focuses on the realization of three reversible fused floating point units: reversible floating point add-sub unit, reversible floating point multiply-add unit and reversible floating point multiply-subtract unit. The proposed work requires the design of a reversible single precision floating point adder, a reversible single precision floating point subtractor and a reversible single precision floating point multiplier. A reversible single precision floating point adder and subtractor is designed with less quantum cost, less number of reversible gates and less constant inputs. A reversible single precision floating point multiplier is implemented using 3:2 compressor as the 24x24 bit multiplier based on 3:2 compressor is highly efficient when compared with the design using 4:3 compressors. A reversible fused 32-Point Radix-2 floating point FFT Unit using 3:2 compressor consumes less number of resources, operates at a slightly greater speed and dissipates less power when compared with the reversible discrete 32-Point Radix-2 floating point FFT Unit. The proposed Fused 32-Point Radix-2 floating point FFT unit using 3:2 compressor dissipates 2.074W while the same design as a discrete implementation dissipates 2.176W.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"546 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":"123096156","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 IoT network is a decentralized type of network which can sense information and transmit the information to a base station. Due to small size of the sensor nodes, energy consumption and security is seen as the major challenge to the IoT network. The LEACH is the energy efficient protocol which can divide the whole network into fixed size clusters. In each cluster, the cluster heads are selected, to transmit data to base station. The cluster heads are selected in the network based on the energy of each node and distance from sensor node to base station. The energy of the sensor node is dissipated when each node receives or transmits data to the base station. The energy is also consumed when the sensor nodes aggregate data to cluster head. In this paper, we analyze existing research works in IoT system and proposed security approaches. In the literature, we have studied that many related challenges have been discovered and work on, but they are still open challenges to these different approaches and techniques. The paper highlights various security challenges of IoT and contributions from researcher.
{"title":"A Comprehensive Survey of Security Related Challenges in Internet of Things","authors":"E. Ezema, Nfm Sani A.Abdullah","doi":"10.17781/P002493","DOIUrl":"https://doi.org/10.17781/P002493","url":null,"abstract":"The IoT network is a decentralized type of network which can sense information and transmit the information to a base station. Due to small size of the sensor nodes, energy consumption and security is seen as the major challenge to the IoT network. The LEACH is the energy efficient protocol which can divide the whole network into fixed size clusters. In each cluster, the cluster heads are selected, to transmit data to base station. The cluster heads are selected in the network based on the energy of each node and distance from sensor node to base station. The energy of the sensor node is dissipated when each node receives or transmits data to the base station. The energy is also consumed when the sensor nodes aggregate data to cluster head. In this paper, we analyze existing research works in IoT system and proposed security approaches. In the literature, we have studied that many related challenges have been discovered and work on, but they are still open challenges to these different approaches and techniques. The paper highlights various security challenges of IoT and contributions from researcher.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":"34 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":"115756821","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":"Network Traffic Classification Using Ensemble Learning with Time Related Features","authors":"Muhammad Anwarul Azim, Tanvir, Mohammad Islam","doi":"10.17781/P002674","DOIUrl":"https://doi.org/10.17781/P002674","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":"128610361","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
扫码关注我们
求助内容：
应助结果提醒方式：