H. Momeni; N. Mabhoot
Abstract
Interest in cloud computing has grown considerably over recent years, primarily due to scalable virtualized resources. So, cloud computing has contributed to the advancement of real-time applications such as signal processing, environment surveillance and weather forecast where time and energy considerations ...
Read More
Interest in cloud computing has grown considerably over recent years, primarily due to scalable virtualized resources. So, cloud computing has contributed to the advancement of real-time applications such as signal processing, environment surveillance and weather forecast where time and energy considerations to perform the tasks are critical. In real-time applications, missing the deadlines for the tasks will cause catastrophic consequences; thus, real-time task scheduling in cloud computing environment is an important and essential issue. Furthermore, energy-saving in cloud data center, regarding the benefits such as reduction of system operating costs and environmental protection is an important concern that is considered during recent years and is reducible with appropriate task scheduling. In this paper, we present an energy-aware task scheduling approach, namely EaRTs for real-time applications. We employ the virtualization and consolidation technique subject to minimizing the energy consumptions, improve resource utilization and meeting the deadlines of tasks. In the consolidation technique, scale up and scale down of virtualized resources could improve the performance of task execution. The proposed approach comprises four algorithms, namely Energy-aware Task Scheduling in Cloud Computing(ETC), Vertical VM Scale Up(V2S), Horizontal VM Scale up(HVS) and Physical Machine Scale Down(PSD). We present the formal model of the proposed approach using Timed Automata to prove precisely the schedulability feature and correctness of EaRTs. We show that our proposed approach is more efficient in terms of deadline hit ratio, resource utilization and energy consumption compared to other energy-aware real-time tasks scheduling algorithms.
Amin Rahmati; Foad Ghaderi
Abstract
Every facial expression involves one or more facial action units appearing on the face. Therefore, action unit recognition is commonly used to enhance facial expression detection performance. It is important to identify subtle changes in face when particular action units occur. In this paper, we propose ...
Read More
Every facial expression involves one or more facial action units appearing on the face. Therefore, action unit recognition is commonly used to enhance facial expression detection performance. It is important to identify subtle changes in face when particular action units occur. In this paper, we propose an architecture that employs local features extracted from specific regions of face while using global features taken from the whole face. To this end, we combine the SPPNet and FPN modules to architect an end-to-end network for facial action unit recognition. First, different predefined regions of face are detected. Next, the SPPNet module captures deformations in the detected regions. The SPPNet module focuses on each region separately and can not take into account possible changes in the other areas of the face. In parallel, the FPN module finds global features related to each of the facial regions. By combining the two modules, the proposed architecture is able to capture both local and global facial features and enhance the performance of action unit recognition task. Experimental results on DISFA dataset demonstrate the effectiveness of our method.
V. Torkzadeh; S. Toosizadeh
Abstract
In this study, an automatic system based on image processing methods using features based on convolutional neural networks is proposed to detect the degree of possible dipping and buckling on the sandwich panel surface by a colour camera. The proposed method, by receiving an image of the sandwich panel, ...
Read More
In this study, an automatic system based on image processing methods using features based on convolutional neural networks is proposed to detect the degree of possible dipping and buckling on the sandwich panel surface by a colour camera. The proposed method, by receiving an image of the sandwich panel, can detect the dipping and buckling of its surface with acceptable accuracy. After a panel is fully processed by the system, an image output is generated to observe the surface status of the sandwich panel so that the supervisor of the production line can better detect any potential defects at the surface of the produced panels. An accurate solution is also provided to measure the amount of available distortion (depth or height of dipping and buckling) on the sandwich panels without needing expensive and complex equipment and hardware.
Mohammad Nazari; Hossein Rahmani; Dadfar Momeni; Motahare Nasiri
Abstract
Graph representation of data can better define relationships among data components and thus provide better and richer analysis. So far, movies have been represented in graphs many times using different features for clustering, genre prediction, and even for use in recommender systems. In constructing ...
Read More
Graph representation of data can better define relationships among data components and thus provide better and richer analysis. So far, movies have been represented in graphs many times using different features for clustering, genre prediction, and even for use in recommender systems. In constructing movie graphs, little attention has been paid to their textual features such as subtitles, while they contain the entire content of the movie and there is a lot of hidden information in them. So, in this paper, we propose a method called MoGaL to construct movie graph using LDA on subtitles. In this method, each node is a movie and each edge represents the novel relationship discovered by MoGaL among two associated movies. First, we extracted the important topics of the movies using LDA on their subtitles. Then, we visualized the relationship between the movies in a graph, using the cosine similarity. Finally, we evaluated the proposed method with respect to measures genre homophily and genre entropy. MoGaL succeeded to outperforms the baseline method significantly in these measures. Accordingly, our empirical results indicate that movie subtitles could be considered a rich source of informative information for various movie analysis tasks.
M. Mohammadzadeh; H. Khosravi
Abstract
Today, video games have a special place among entertainment. In this article, we have developed an interactive video game for mobile devices. In this game, the user can control the game’s character by his face and hand gestures. Cascading classifiers along with Haar-like features and local binary ...
Read More
Today, video games have a special place among entertainment. In this article, we have developed an interactive video game for mobile devices. In this game, the user can control the game’s character by his face and hand gestures. Cascading classifiers along with Haar-like features and local binary patterns are used for hand gesture recognition and face detection. The game’s character moves according to the current hand and face state received from the frontal camera. Various ideas are used to achieve the appropriate accuracy and speed. Unity 3D and OpenCV for Unity are employed to design and implement the video game. The programming language is C#. This game is written in C# and developed for both Windows and Android operating systems. Experiments show an accuracy of 86.4% in the detection of five gestures. It also has an acceptable frame rate and can run at 11 fps and 8 fps in Windows and Android respectively.
Fatemeh Alinezhad; Kourosh Kiani; Razieh Rastgoo
Abstract
Gender recognition is an attractive research area in recent years. To make a user-friendly application for gender recognition, having an accurate, fast, and lightweight model applicable in a mobile device is necessary. Although successful results have been obtained using the Convolutional Neural Network ...
Read More
Gender recognition is an attractive research area in recent years. To make a user-friendly application for gender recognition, having an accurate, fast, and lightweight model applicable in a mobile device is necessary. Although successful results have been obtained using the Convolutional Neural Network (CNN), this model needs high computational resources that are not appropriate for mobile and embedded applications. To overcome this challenge and considering the recent advances in Deep Learning, in this paper, we propose a deep learning-based model for gender recognition in mobile devices using the lightweight CNN models. In this way, a pretrained CNN model, entitled Multi-Task Convolutional Neural Network (MTCNN), is used for face detection. Furthermore, the MobileFaceNet model is modified and trained using the Margin Distillation cost function. To boost the model performance, the Dense Block and Depthwise separable convolutions are used in the model. Results on six datasets confirm that the proposed model outperforms the MobileFaceNet model on six datasets with the relative accuracy improvements of 0.02%, 1.39%, 2.18%, 1.34%, 7.51%, 7.93% on the LFW, CPLFW, CFP-FP, VGG2-FP, UTKFace, and own data, respectively. In addition, we collected a dataset, including a total of 100’000 face images from both male and female in different age categories. Images of the women are with and without headgear.
A. Torkaman; K. Badie; A. Salajegheh; M. H. Bokaei; Seyed F. Fatemi
Abstract
Recently, network representation has attracted many research works mostly concentrating on representing of nodes in a dense low-dimensional vector. There exist some network embedding methods focusing only on the node structure and some others considering the content information within the nodes. In this ...
Read More
Recently, network representation has attracted many research works mostly concentrating on representing of nodes in a dense low-dimensional vector. There exist some network embedding methods focusing only on the node structure and some others considering the content information within the nodes. In this paper, we propose HDNR; a hybrid deep network representation model, which uses a triplet deep neural network architecture that considers both the node structure and content information for network representation. In addition, the author's writing style is also considered as a significant feature in the node content information. Inspired by the application of deep learning in natural language processing, our model utilizes a deep random walk method to exploit inter-node structures and two deep sequence prediction methods to extract nodes' content information. The embedding vectors generated in this manner were shown to have the ability of boosting each other for learning optimal node representation, detecting more informative features and ultimately a better community detection. The experimental results confirm the effectiveness of this model for network representation compared to other baseline methods.
S. Mavaddati; S. Mavaddati
Abstract
Development of an automatic system to classify the type of rice grains is an interesting research area in the scientific fields associated with modern agriculture. In recent years, different techniques are employed to identify the types of various agricultural products. Also, different color-based and ...
Read More
Development of an automatic system to classify the type of rice grains is an interesting research area in the scientific fields associated with modern agriculture. In recent years, different techniques are employed to identify the types of various agricultural products. Also, different color-based and texture-based features are used to yield the desired results in the classification procedure. This paper proposes a classification algorithm to detect different rice types by extracting features from the bulk samples. The feature space in this algorithm includes the fractal-based features of the extracted coefficients from the wavelet packet transform analysis. This feature vector is combined with other texture-based features and used to learn a model related to each rice type using the Gaussian mixture model classifier. Also, a sparse structured principal component analysis algorithm is applied to reduce the dimension of the feature vector and lead to the precise classification rate with less computational time. The results of the proposed classifier are compared with the results obtained from the other presented classification procedures in this context. The simulation results, along with a meaningful statistical test, show that the proposed algorithm based on the combinational features is able to detect precisely the type of rice grains with more than 99% accuracy. Also, the proposed algorithm can detect the rice quality for different percentages of combination with other rice grains with 99.75% average accuracy.
Maryam Khazaei; Nosratali Ashrafi-Payaman
Abstract
Nowadays, whereas the use of social networks and computer networks is increasing, the amount of associated complex data with graph structure and their applications, such as classification, clustering, link prediction, and recommender systems, has risen significantly. Because of security problems and ...
Read More
Nowadays, whereas the use of social networks and computer networks is increasing, the amount of associated complex data with graph structure and their applications, such as classification, clustering, link prediction, and recommender systems, has risen significantly. Because of security problems and societal concerns, anomaly detection is becoming a vital problem in most fields. Applications that use a heterogeneous graph, are confronted with many issues, such as different kinds of neighbors, different feature types, and differences in type and number of links. So, in this research, we employ the HetGNN model with some changes in loss functions and parameters for heterogeneous graph embedding to capture the whole graph features (structure and content) for anomaly detection, then pass it to a VAE to discover anomalous nodes based on reconstruction error. Our experiments on AMiner data set with many base-lines illustrate that our model outperforms state-of-the-arts methods in heterogeneous graphs while considering all types of attributes.
F. Jafarinejad; R. Farzbood
Abstract
Image retrieval is a basic task in many content-based image systems. Achieving high precision, while maintaining computation time is very important in relevance feedback-based image retrieval systems. This paper establishes an analogy between this and the task of image classification. Therefore, in the ...
Read More
Image retrieval is a basic task in many content-based image systems. Achieving high precision, while maintaining computation time is very important in relevance feedback-based image retrieval systems. This paper establishes an analogy between this and the task of image classification. Therefore, in the image retrieval problem, we will obtain an optimized decision surface that separates dataset images into two categories of relevant/irrelevant images corresponding to the query image. This problem will be viewed and solved as an optimization problem using particle optimization algorithm. Although the particle swarm optimization (PSO) algorithm is widely used in the field of image retrieval, no one use it for directly feature weighting. Information extracted from user feedbacks will guide particles in order to find the optimal weights of various features of images (Color-, shape- or texture-based features). Fusion of these very non-homogenous features need a feature weighting algorithm that will take place by the help of PSO algorithm. Accordingly, an innovative fitness function is proposed to evaluate each particle’s position. Experimental results on Wang dataset and Corel-10k indicate that average precision of the proposed method is higher than other semi-automatic and automatic approaches. Moreover, the proposed method suggest a reduction in the computational complexity in comparison to other PSO-based image retrieval methods.
R. Serajeh; A. Mousavinia; F. Safaei
Abstract
Classical SFM (Structure From Motion) algorithms are widely used to estimate the three-dimensional structure of a stationary scene with a moving camera. However, when there are moving objects in the scene, if the equation of the moving object is unknown, the approach fails. This paper first demonstrates ...
Read More
Classical SFM (Structure From Motion) algorithms are widely used to estimate the three-dimensional structure of a stationary scene with a moving camera. However, when there are moving objects in the scene, if the equation of the moving object is unknown, the approach fails. This paper first demonstrates that when the frame rate is high enough and the object movement is continuous in time, meaning that acceleration is limited, a simple linear model can be effectively used to estimate the motion. This theory is first mathematically proven in a closed-form expression and then optimized by a nonlinear function applicable for our problem. The algorithm is evaluated both on synthesized and real data from Hopkins dataset.
H. Aghabarar; K. Kiani; P. Keshavarzi
Abstract
Nowadays, given the rapid progress in pattern recognition, new ideas such as theoretical mathematics can be exploited to improve the efficiency of these tasks. In this paper, the Discrete Wavelet Transform (DWT) is used as a mathematical framework to demonstrate handwritten digit recognition in spiking ...
Read More
Nowadays, given the rapid progress in pattern recognition, new ideas such as theoretical mathematics can be exploited to improve the efficiency of these tasks. In this paper, the Discrete Wavelet Transform (DWT) is used as a mathematical framework to demonstrate handwritten digit recognition in spiking neural networks (SNNs). The motivation behind this method is that the wavelet transform can divide the spike information and noise into separate frequency subbands and also store the time information. The simulation results show that DWT is an effective and worthy choice and brings the network to an efficiency comparable to previous networks in the spiking field. Initially, DWT is applied to MNIST images in the network input. Subsequently, a type of time encoding called constant-current-Leaky Integrate and Fire (LIF) encoding is applied to the transformed data. Following this, the encoded images are input to the multilayer convolutional spiking network. In this architecture, various wavelets have been investigated, and the highest classification accuracy of 99.25% is achieved.
M. Rezaei; H. Nezamabadi-pour
Abstract
The present study aims to overcome some defects of the K-nearest neighbor (K-NN) rule. Two important data preprocessing methods to elevate the K-NN rule are prototype selection (PS) and prototype generation (PG) techniques. Often the advantage of these techniques is investigated separately. In this paper, ...
Read More
The present study aims to overcome some defects of the K-nearest neighbor (K-NN) rule. Two important data preprocessing methods to elevate the K-NN rule are prototype selection (PS) and prototype generation (PG) techniques. Often the advantage of these techniques is investigated separately. In this paper, using the gravitational search algorithm (GSA), two hybrid schemes have been proposed in which PG and PS problems have been considered together. To evaluate the classification performance of these hybrid models, we have performed a comparative experimental study including a comparison between our proposals and some approaches previously studied in the literature using several benchmark datasets. The experimental results demonstrate that our hybrid approaches outperform most of the competitive methods.
M. R. Fallahzadeh; F. Farokhi; A. Harimi; R. Sabbaghi-Nadooshan
Abstract
Facial Expression Recognition (FER) is one of the basic ways of interacting with machines and has been getting more attention in recent years. In this paper, a novel FER system based on a deep convolutional neural network (DCNN) is presented. Motivated by the powerful ability of DCNN to learn features ...
Read More
Facial Expression Recognition (FER) is one of the basic ways of interacting with machines and has been getting more attention in recent years. In this paper, a novel FER system based on a deep convolutional neural network (DCNN) is presented. Motivated by the powerful ability of DCNN to learn features and image classification, the goal of this research is to design a compatible and discriminative input for pre-trained AlexNet-DCNN. The proposed method consists of 4 steps: first, extracting three channels of the image including the original gray-level image, in addition to horizontal and vertical gradients of the image similar to the red, green, and blue color channels of an RGB image as the DCNN input. Second, data augmentation including scale, rotation, width shift, height shift, zoom, horizontal flip, and vertical flip of the images are prepared in addition to the original images for training the DCNN. Then, the AlexNet-DCNN model is applied to learn high-level features corresponding to different emotion classes. Finally, transfer learning is implemented on the proposed model and the presented model is fine-tuned on target datasets. The average recognition accuracy of 92.41% and 93.66% were achieved for JAFEE and CK+ datasets, respectively. Experimental results on two benchmark emotional datasets show promising performance of the proposed model that can improve the performance of current FER systems.
H.3. Artificial Intelligence
Mohammad Hossein Shayesteh; Behrooz Shahrokhzadeh; Behrooz Masoumi
Abstract
This paper provides a comprehensive review of the potential of game theory as a solution for sensor-based human activity recognition (HAR) challenges. Game theory is a mathematical framework that models interactions between multiple entities in various fields, including economics, political science, ...
Read More
This paper provides a comprehensive review of the potential of game theory as a solution for sensor-based human activity recognition (HAR) challenges. Game theory is a mathematical framework that models interactions between multiple entities in various fields, including economics, political science, and computer science. In recent years, game theory has been increasingly applied to machine learning challenges, including HAR, as a potential solution to improve recognition performance and efficiency of recognition algorithms. The review covers the shared challenges between HAR and machine learning, compares previous work on traditional approaches to HAR, and discusses the potential advantages of using game theory. It discusses different game theory approaches, including non-cooperative and cooperative games, and provides insights into how they can improve the HAR systems. The authors propose new game theory-based approaches and evaluate their effectiveness compared to traditional approaches. Overall, this review paper contributes to expanding the scope of research in HAR by introducing game-theoretic concepts and solutions to the field and provides valuable insights for researchers interested in applying game-theoretic approaches to HAR.
E. Kalhor; B. Bakhtiari
Abstract
Feature selection is the one of the most important steps in designing speech emotion recognition systems. Because there is uncertainty as to which speech feature is related to which emotion, many features must be taken into account and, for this purpose, identifying the most discriminative features is ...
Read More
Feature selection is the one of the most important steps in designing speech emotion recognition systems. Because there is uncertainty as to which speech feature is related to which emotion, many features must be taken into account and, for this purpose, identifying the most discriminative features is necessary. In the interest of selecting appropriate emotion-related speech features, the current paper focuses on a multi-task approach. For this reason, the study considers each speaker as a task and proposes a multi-task objective function to select features. As a result, the proposed method chooses one set of speaker-independent features of which the selected features are discriminative in all emotion classes. Correspondingly, multi-class classifiers are utilized directly or binary classifications simply perform multi-class classifications. In addition, the present work employs two well-known datasets, the Berlin and Enterface. The experiments also applied the openSmile toolkit to extract more than 6500 features. After feature selection phase, the results illustrated that the proposed method selects the features which is common in the different runs. Also, the runtime of proposed method is the lowest in comparison to other methods. Finally, 7 classifiers are employed and the best achieved performance is 73.76% for the Berlin dataset and 72.17% for the Enterface dataset, in the faced of a new speaker .These experimental results then show that the proposed method is superior to existing state-of-the-art methods.
Z. Teimoori; M. Salehi; V. Ranjbar; Saeed R. Shehnepoor; Sh. Najari
Abstract
Nowadays, some e-advice websites and social media like e-commerce businesses, provide not only their goods but a new way that their customers can give their opinions about products. Meanwhile, there are some review spammers who try to promote or demote some specific products by writing fraud reviews. ...
Read More
Nowadays, some e-advice websites and social media like e-commerce businesses, provide not only their goods but a new way that their customers can give their opinions about products. Meanwhile, there are some review spammers who try to promote or demote some specific products by writing fraud reviews. There have been several types of researches and studies toward detecting these review spammers, but most studies are based on individual review spammers and few of them studied group review spammers, nevertheless it should be mentioned that review spammers can increase their effects by cooperating and working together. More words, there have been many features introduced in order to detect review spammers and it is better to use the efficient ones. In this paper we propose a novel framework, named Network Based Group Review Spammers which tries to identify and classify group review spammers with the usage of the heterogeneous information network. In addition to eight basic features for detecting group review spammers, three efficient new features from previous studies were modified and added in order to improve detecting group review spammers. Then with the definition of Meta-path, features are ranked. Results showed that by using the importance of features and adding three new features in the suggested framework, group review spammers detection is improved on Amazon dataset.
N. Taghvaei; B. Masoumi; M. R. Keyvanpour
Abstract
In general, humans are very complex organisms, and therefore, research into their various dimensions and aspects, including personality, has become an attractive subject of research. With the advent of technology, the emergence of a new kind of communication in the context of social networks has also ...
Read More
In general, humans are very complex organisms, and therefore, research into their various dimensions and aspects, including personality, has become an attractive subject of research. With the advent of technology, the emergence of a new kind of communication in the context of social networks has also given a new form of social communication to humans, and the recognition and categorization of people in this new space have become a hot topic of research that has been challenged by many researchers. In this paper, considering the Big Five personality characteristics of individuals, first, categorization of related work is proposed, and then a hybrid framework based on Fuzzy Neural Networks (FNN), along with, Deep Neural Networks (DNN) has been proposed that improves the accuracy of personality recognition by combining different FNN-classifiers with DNN-classifier in a proposed two-stage decision fusion scheme. Finally, a simulation of the proposed approach is carried out. The proposed approach is using the structural features of Social Networks Analysis (SNA), along with a linguistic analysis (LA) feature extracted from the description of the activities of individuals and comparison with the previous similar researches. The results, well-illustrated the performance improvement of the proposed framework up to 83.2 % of average accuracy on myPersonality dataset.
F. Salimian Najafabadi; M. T. Sadeghi
Abstract
An important sector that has a significant impact on the economies of countries is the agricultural sector. Researchers are trying to improve this sector by using the latest technologies. One of the problems facing farmers in the agricultural activities is plant diseases. If a plant problem is diagnosed ...
Read More
An important sector that has a significant impact on the economies of countries is the agricultural sector. Researchers are trying to improve this sector by using the latest technologies. One of the problems facing farmers in the agricultural activities is plant diseases. If a plant problem is diagnosed soon, the farmer can treat the disease more effectively. This study introduces a new deep artificial neural network called AgriNet which is suitable for recognizing some types of agricultural diseases in a plant using images from the plant leaves. The proposed network makes use of the channel shuffling technique of ShuffleNet and the channel dependencies modeling technique of SENet. One of the factors influencing the effectiveness of the proposed network architecture is how to increase the flow of information in the channels after explicitly modelling interdependencies between channels. This is in fact, an important novelty of this research work. The dataset used in this study is PlantVillage, which contains 14 types of plants in 24 groups of healthy and diseased. Our experimental results show that the proposed method outperforms the other methods in this area. AgriNet leads to accuracy and loss of 98% and 7%, respectively on the experimental data. This method increases the recognition accuracy by about 2% and reduces the loss by 8% compared to the ShuffleNetV2 method.
Document and Text Processing
A.R. Mazochi; S. Bourbour; M. R. Ghofrani; S. Momtazi
Abstract
Converting a postal address to a coordinate, geocoding, is a helpful tool in many applications. Developing a geocoder tool is a difficult task if this tool relates to a developing country that does not follow a standard addressing format. The lack of complete reference data and non-persistency of names ...
Read More
Converting a postal address to a coordinate, geocoding, is a helpful tool in many applications. Developing a geocoder tool is a difficult task if this tool relates to a developing country that does not follow a standard addressing format. The lack of complete reference data and non-persistency of names are the main challenges besides the common natural language process challenges. In this paper, we propose a geocoder for Persian addresses. To the best of our knowledge, our system, TehranGeocode, is the first geocoder for this language. Considering the non-standard structure of Persian addresses, we need to split the address into small segments, find each segment in the reference dataset, and connect them to find the target of the address. We develop our system based on address parsing and dynamic programming for this aim. We specify the contribution of our work compared to similar studies. We discuss the main components of the program, its data, and its results and show that the proposed framework achieves promising results in the field by finding 83\% of addresses with less than 300 meters error.
H. Kamali Ardakani; Seyed A. Mousavinia; F. Safaei
Abstract
Stereo machine vision can be used as a Space Sampling technique and the cameras parameters and configuration can effectively change the number of Samples in each Volume of space called Space Sampling Density (SSD). Using the concept of Voxels, this paper presents a method to optimize the geometric configuration ...
Read More
Stereo machine vision can be used as a Space Sampling technique and the cameras parameters and configuration can effectively change the number of Samples in each Volume of space called Space Sampling Density (SSD). Using the concept of Voxels, this paper presents a method to optimize the geometric configuration of the cameras to maximize the SSD which means minimizing the Voxel volume and reducing the uncertainty in localizing an object in 3D space. Each pixel’s field of view (FOV) is considered as a skew pyramid. The uncertainty region will be created from the intersection of two pyramids associated with any of the cameras. Then, the mathematical equation of the uncertainty region is developed based on the correspondence field as a criterion for the localization error, including depth error as well as X and Y axes error. This field is completely dependent on the internal and external parameters of the cameras. Given the mathematical equation of localization error, the camera’s configuration optimization is addressed in a stereo vision system. Finally, the validity of the proposed method is examined by simulation and empirical results. These results show that the localization error will be significantly decreased in the optimized camera configuration.
M. R. Okhovvat; M. T. Kheirabadi; A. Nodehi; M. Okhovvat
Abstract
Minimizing make-span and maximizing remaining energy are usually of chief importance in the applications of wireless sensor actor networks (WSANs). Current task assignment approaches are typically concerned with one of the timing or energy constraints. These approaches do not consider the types and various ...
Read More
Minimizing make-span and maximizing remaining energy are usually of chief importance in the applications of wireless sensor actor networks (WSANs). Current task assignment approaches are typically concerned with one of the timing or energy constraints. These approaches do not consider the types and various features of tasks WSANs may need to perform and thus may not be applicable to some types of real applications such as search and rescue missions. To this end, an optimized and type aware task assignment approach called TATA is proposed that considers the energy consumption as well as the make-span. TATA is an optimized task assignment approach and aware of the distribution necessities of WSANs with hybrid architecture. TATA comprises of two protocols, namely a Make-span Calculation Protocol (MaSC) and an Energy Consumption Calculation Protocol (ECal). Through considering both time and energy, TATA makes a tradeoff between minimizing make-span and maximizing the residual energies of actors. A series of extensive simulation results on typical scenarios show shorter make-span and larger remaining energy in comparison to when stochastic task assignment (STA), opportunistic load balancing (OLB), and task assignment algorithm based on quasi-Newton interior point (TA-QNIP) approaches is applied.
F.4.18. Time series analysis
Ali Ghorbanian; Hamideh Razavi
Abstract
In time series clustering, features are typically extracted from the time series data and used for clustering instead of directly clustering the data. However, using the same set of features for all data sets may not be effective. To overcome this limitation, this study proposes a five-step algorithm ...
Read More
In time series clustering, features are typically extracted from the time series data and used for clustering instead of directly clustering the data. However, using the same set of features for all data sets may not be effective. To overcome this limitation, this study proposes a five-step algorithm that extracts a complete set of features for each data set, including both direct and indirect features. The algorithm then selects essential features for clustering using a genetic algorithm and internal clustering criteria. The final clustering is performed using a hierarchical clustering algorithm and the selected features. Results from applying the algorithm to 81 data sets indicate an average Rand index of 72.16%, with 38 of the 78 extracted features, on average, being selected for clustering. Statistical tests comparing this algorithm to four others in the literature confirm its effectiveness.
A. H Safari-Bavil; S. Jabbehdari; M. Ghobaei-Arani
Abstract
Generally, the issue of quality assurance is a specific assurance in computer networks. The conventional computer networks with hierarchical structures that are used in organizations are formed using some nodes of Ethernet switches within a tree structure. Open Flow is one of the main fundamental protocols ...
Read More
Generally, the issue of quality assurance is a specific assurance in computer networks. The conventional computer networks with hierarchical structures that are used in organizations are formed using some nodes of Ethernet switches within a tree structure. Open Flow is one of the main fundamental protocols of Software-defined networks (SDNs) and provides the direct access to and change in program of sending network equipment such as switches and routers, physically and virtually. Lack of an open interface in data sending program has led to advent of integrated and close equipment that are similar to CPU in current networks. This study proposes a solution to reduce traffic using a correct placement of virtual machines while their security is maintained. The proposed solution is based on the moth-flame optimization, which has been evaluated. The obtained results indicate the priority of the proposed method.
A.R. Tajary; H. Morshedlou
Abstract
With the advent of having many processor cores on a single chip in many-core processors, the demand for exploiting these on-chip resources to boost the performance of applications has been increased. Task mapping is the problem of mapping the application tasks on these processor cores to achieve lower ...
Read More
With the advent of having many processor cores on a single chip in many-core processors, the demand for exploiting these on-chip resources to boost the performance of applications has been increased. Task mapping is the problem of mapping the application tasks on these processor cores to achieve lower latency and better performance. Many researches are focused on minimizing the path between the tasks that demand high bandwidth for communication. Although using these methods can result in lower latency, but at the same time, it is possible to create congestion in the network which lowers the network throughput. In this paper, a throughput-aware method is proposed that uses simulated annealing for task mapping. The method is checked on several real-world applications and simulations are conducted on a cycle-accurate network on chip simulator. The results illustrate that the proposed method can achieve higher throughput while maintaining the delay in the NoC.
