A Simple Method for Estimating Term Mutual Information
D. Cai and T.L. McCluskey
The ability to formally analyze and automatically measure statistical dependence of terms is a core problem in many areas of science. One of the commonly used tools for this is the expected mutual information (MI) measure. However, it seems that MI methods have not achieved their potential. The main problem in using MI of terms is to obtain actual probability distributions estimated from training data, as the true distributions are invariably not known. This study focuses on the problem and proposes a novel but simple method for estimating probability distributions. Estimation functions are introduced; mathematical meaning of the functions is interpreted and the verification conditions are discussed. Examples are provided to illustrate the possibility of failure of applying the method if the verification conditions are not satisfied. An extension of the method is considered.
Keywords: Information analysis and extraction, dependence and relatedness of terms, statistical semantic analysis.
Download Full-Text
D. Cai and T.L. McCluskey
The ability to formally analyze and automatically measure statistical dependence of terms is a core problem in many areas of science. One of the commonly used tools for this is the expected mutual information (MI) measure. However, it seems that MI methods have not achieved their potential. The main problem in using MI of terms is to obtain actual probability distributions estimated from training data, as the true distributions are invariably not known. This study focuses on the problem and proposes a novel but simple method for estimating probability distributions. Estimation functions are introduced; mathematical meaning of the functions is interpreted and the verification conditions are discussed. Examples are provided to illustrate the possibility of failure of applying the method if the verification conditions are not satisfied. An extension of the method is considered.
Keywords: Information analysis and extraction, dependence and relatedness of terms, statistical semantic analysis.
Download Full-Text
A Multi Agent based Framework for Web Service Composition with Respect to QoS Attributes
Pegah Majlesi Esfahani, Jafar Habibi, and Touraj Varaee
Web services are supplying a substantial support for inter-enterprise collaborative trade process. Nevertheless, in the light of the fundamental advancements in web service technologies there is some inadequacy particularly in QoS-aware web service composition. Definitely, as the volume of web services increases, numerous functional equivalent Web services emerge with different quality of service, which can be used for the purpose of the composite Web service. Accordingly, the clients will have difficulty with creating composition plans among numerous options that fulfill their quality requirements. Software agents have been renowned as a promising technology for managing web services. Hence, using FIPA compliant Multi Agents, a Multi Agents based framework is introduced in the current paper for QoS-aware web service Composition. In addition, the present research outlines an approach for efficient Web services selection with (near) optimal quality for composite service in timely manner based on social harmony search algorithm. In order to demonstrate the capabilities of the applied algorithm in the quality optimization of composite service it is compared to a similar optimization problem with a genetic algorithm approach and the corresponding results revealed that the presented algorithm consumes less time finding the optimum combination and therefore is more efficient.
Keywords: Multi agent system, Quality of service, Social harmony search algorithm, Web service composition
Download Full-Text
Pegah Majlesi Esfahani, Jafar Habibi, and Touraj Varaee
Web services are supplying a substantial support for inter-enterprise collaborative trade process. Nevertheless, in the light of the fundamental advancements in web service technologies there is some inadequacy particularly in QoS-aware web service composition. Definitely, as the volume of web services increases, numerous functional equivalent Web services emerge with different quality of service, which can be used for the purpose of the composite Web service. Accordingly, the clients will have difficulty with creating composition plans among numerous options that fulfill their quality requirements. Software agents have been renowned as a promising technology for managing web services. Hence, using FIPA compliant Multi Agents, a Multi Agents based framework is introduced in the current paper for QoS-aware web service Composition. In addition, the present research outlines an approach for efficient Web services selection with (near) optimal quality for composite service in timely manner based on social harmony search algorithm. In order to demonstrate the capabilities of the applied algorithm in the quality optimization of composite service it is compared to a similar optimization problem with a genetic algorithm approach and the corresponding results revealed that the presented algorithm consumes less time finding the optimum combination and therefore is more efficient.
Keywords: Multi agent system, Quality of service, Social harmony search algorithm, Web service composition
Download Full-Text
A New Approach for Ranking Micro-blogs Content
Ahmed Sulaiman M Alharbi
Recently, there is a service which associated with Web2.0; this service is micro-blog. They have their features that make them different from traditional blogs. They allow their users to write and read short massages and share these messages with other users. The most popular example of micro-blogs is Twitter. This paper will investigate that whether or not using the Twitter’s features will improve the returned result. Indeed, these features are extracted from tweet’s content. The features that will be covered in this paper are hashtag feature, URL feature, user name tag feature, tweet length feature and user tweet number feature. In order to find answers to the research question, an experiment was conducted. The main goal of the experiment is to examine each feature individually in order to investigate their impact on the returned results. Using the traditional ranking approaches alone with micro-blogs might not be the ideal option. Therefore, one of this paper aims is to help the researchers who concern about ranking results based on a given query or flirting and clustering data on micro-blogs environment to think about creating new ranking strategies.
Keywords: Search Process, Information Retrieval, Context Analysis, Micro-blogging
Download Full-Text
Ahmed Sulaiman M Alharbi
Recently, there is a service which associated with Web2.0; this service is micro-blog. They have their features that make them different from traditional blogs. They allow their users to write and read short massages and share these messages with other users. The most popular example of micro-blogs is Twitter. This paper will investigate that whether or not using the Twitter’s features will improve the returned result. Indeed, these features are extracted from tweet’s content. The features that will be covered in this paper are hashtag feature, URL feature, user name tag feature, tweet length feature and user tweet number feature. In order to find answers to the research question, an experiment was conducted. The main goal of the experiment is to examine each feature individually in order to investigate their impact on the returned results. Using the traditional ranking approaches alone with micro-blogs might not be the ideal option. Therefore, one of this paper aims is to help the researchers who concern about ranking results based on a given query or flirting and clustering data on micro-blogs environment to think about creating new ranking strategies.
Keywords: Search Process, Information Retrieval, Context Analysis, Micro-blogging
Download Full-Text
An Efficient Iris Segmentation Approach to Develop an Iris Recognition System
Md. Selim Al Mamun, S.M. Tareeq and Md. Hasanuzzaman
Iris recognition is regarded as the most stable and accurate biometric identification system. An iris recognition system basically consists of four steps- segmentation, normalization, encoding and matching. This paper proposes an efficient approach for iris segmentation. This segmentation approach uses a modified canny edge detection algorithm by considering gradient finding, non- maximum suppression and hysteresis thresholding for the best results. This paper also present an automated iris recognition system based on proposed segmentation approach. This approach is proved to be very successful and about 95% images of dataset [CASIA database version 1.0] are segmented successfully. The iris recognition system resulted in False Reject Rates (FRR) and False Accept Rates (FAR) of 5.222 and 1.932 respectively.
Keywords: Iris Segmentation, Irish Recognition, Hough Transformation, False Reject Ratio, False Accept Ratio
Download Full-Text
Md. Selim Al Mamun, S.M. Tareeq and Md. Hasanuzzaman
Iris recognition is regarded as the most stable and accurate biometric identification system. An iris recognition system basically consists of four steps- segmentation, normalization, encoding and matching. This paper proposes an efficient approach for iris segmentation. This segmentation approach uses a modified canny edge detection algorithm by considering gradient finding, non- maximum suppression and hysteresis thresholding for the best results. This paper also present an automated iris recognition system based on proposed segmentation approach. This approach is proved to be very successful and about 95% images of dataset [CASIA database version 1.0] are segmented successfully. The iris recognition system resulted in False Reject Rates (FRR) and False Accept Rates (FAR) of 5.222 and 1.932 respectively.
Keywords: Iris Segmentation, Irish Recognition, Hough Transformation, False Reject Ratio, False Accept Ratio
Download Full-Text
Characterization of Optimum Throughput in a Wireless Channel Using Various Schemes
Fazlay Rabby Reza, Md. Shoaibur Rahman
In wireless communication, a channel refers either to a physical transmission medium such as a wire, or to a logical connection over a multiplexed medium such as a radio channel which is used to convey an information signal, for example a digital bit stream, from one or several senders (or transmitters) to one or several receivers. This research represents a mathematical and graphical frame work for maximizing throughput in a wireless fading Channel using packet length, transmission rate, signal to noise ratio for various modulation scheme. Binary PSK, Differential PSK, Coherent FSK and Non-coherent FSK are the modulation schemes for this research. The throughput is defined as the number of bits per second correctly received. Trade-offs between the packet length and the transmission rate are observed, and equations are derived for the optimal choice of these variables. For a wireless channel, choosing Rayleigh fading channel for this research because there be many scatters present means that Rayleigh fading can be a useful model in heavily built-up city centers(or barriers) where there is no line of sight between the transmitter and receiver and many buildings and other objects attenuate, reflect, refract, and diffract the signal.
Keywords: Wireless Channel, Optimization, Throughput, Rayleigh Fading channel, Packet length, Transmission rate, Signal-to- Noise Ratio (SNR).
Download Full-Text
Fazlay Rabby Reza, Md. Shoaibur Rahman
In wireless communication, a channel refers either to a physical transmission medium such as a wire, or to a logical connection over a multiplexed medium such as a radio channel which is used to convey an information signal, for example a digital bit stream, from one or several senders (or transmitters) to one or several receivers. This research represents a mathematical and graphical frame work for maximizing throughput in a wireless fading Channel using packet length, transmission rate, signal to noise ratio for various modulation scheme. Binary PSK, Differential PSK, Coherent FSK and Non-coherent FSK are the modulation schemes for this research. The throughput is defined as the number of bits per second correctly received. Trade-offs between the packet length and the transmission rate are observed, and equations are derived for the optimal choice of these variables. For a wireless channel, choosing Rayleigh fading channel for this research because there be many scatters present means that Rayleigh fading can be a useful model in heavily built-up city centers(or barriers) where there is no line of sight between the transmitter and receiver and many buildings and other objects attenuate, reflect, refract, and diffract the signal.
Keywords: Wireless Channel, Optimization, Throughput, Rayleigh Fading channel, Packet length, Transmission rate, Signal-to- Noise Ratio (SNR).
Download Full-Text
Performance Comparison of Mobile Ad hoc Network Routing Protocols in Terms of Mobility Model Patterns
Muhammad Adil, Huma Javed, Muhammad Arshad, Muhammad Saqib, Muhammad Shahzad
A Mobile Ad hoc Network (MANET) is a wireless network in which nodes can at liberty move and dynamically selfforming in terms of topological variations. Mobile nodes can communicate with each other deprived of any need of predefined setup. But Mobile nodes are provided with limited bandwidth and limited battery power. Owing to these features, the MANETs are finest matched for military operations, Ruin relief and Salvage procedures.Mobility model selection is critical for specific zones, because the moving style of a mobile node should be natural. Shifting the mobility model, permits changes in routing performance of a routing protocol. This research paper evaluates performance of routing protocols for MANETs i.e GPSR, FSR and AODV in terms of Mobility Models. For investigational purposes, this research considers three scenarios using Random Waypoint Mobility Model and Modified Random Direction Mobility Model. Experimental outcomes demonstrate the performance of the routing protocols. Different parameters like number of nodes; number of sources and metrics are utilized.
Keywords: Mobile Ad hoc Network, Greedy Perimeter Stateless Routing, Fisheye State Routing, Ad hoc On-demand Vector Routing
Download Full-Text
Muhammad Adil, Huma Javed, Muhammad Arshad, Muhammad Saqib, Muhammad Shahzad
A Mobile Ad hoc Network (MANET) is a wireless network in which nodes can at liberty move and dynamically selfforming in terms of topological variations. Mobile nodes can communicate with each other deprived of any need of predefined setup. But Mobile nodes are provided with limited bandwidth and limited battery power. Owing to these features, the MANETs are finest matched for military operations, Ruin relief and Salvage procedures.Mobility model selection is critical for specific zones, because the moving style of a mobile node should be natural. Shifting the mobility model, permits changes in routing performance of a routing protocol. This research paper evaluates performance of routing protocols for MANETs i.e GPSR, FSR and AODV in terms of Mobility Models. For investigational purposes, this research considers three scenarios using Random Waypoint Mobility Model and Modified Random Direction Mobility Model. Experimental outcomes demonstrate the performance of the routing protocols. Different parameters like number of nodes; number of sources and metrics are utilized.
Keywords: Mobile Ad hoc Network, Greedy Perimeter Stateless Routing, Fisheye State Routing, Ad hoc On-demand Vector Routing
Download Full-Text
Building models to compute the sediment transport in Ca Mau coastal zone
Duong Thi Thuy Nga, Nguyen Ky Phung
To predict the sediment transport in a coastal zone, we use the current model based on a 2D finite-difference grid and the sediment transport model. The first model gives the velocity distribution on the surface of water body and in the case of transient analysis, the velocity distribution is computed at each computational time step. This velocity distribution will be taken as the input for the last one. We have an improvement in the sediment transport model: applying the coefficient K to a general case. The computational results in the study area are agreement to our experimental results. It shows that those models are reliable.
Keywords: current model; sediment transport model; velocity
Download Full-Text
Duong Thi Thuy Nga, Nguyen Ky Phung
To predict the sediment transport in a coastal zone, we use the current model based on a 2D finite-difference grid and the sediment transport model. The first model gives the velocity distribution on the surface of water body and in the case of transient analysis, the velocity distribution is computed at each computational time step. This velocity distribution will be taken as the input for the last one. We have an improvement in the sediment transport model: applying the coefficient K to a general case. The computational results in the study area are agreement to our experimental results. It shows that those models are reliable.
Keywords: current model; sediment transport model; velocity
Download Full-Text
Fixed 2-Watchman Routes under the MinMax criterion in Staircases
Elham Faraji and Alireza Bagheri
The m-watchman routes problem asks for a set of m watchman routes such that any point of the polygon can be seen from some point along a route with the goal to minimize the sum of route lengths (MinSum) or the length of the longest route (MinMax) . The problem, already m=2 is NP-hard with MinMax criterion. In fixed version of the problem, i.e. fixed m-watchman routes problem , each route passes through a given point. In this paper, we propose the first linear-time algorithm to compute the optimum fixed 2-watchman routes under the MinMax criterion.
Keywords: Computational geometry, Multiple fixed watchman routes, Visibility polygon, Staircases
Download Full-Text
Elham Faraji and Alireza Bagheri
The m-watchman routes problem asks for a set of m watchman routes such that any point of the polygon can be seen from some point along a route with the goal to minimize the sum of route lengths (MinSum) or the length of the longest route (MinMax) . The problem, already m=2 is NP-hard with MinMax criterion. In fixed version of the problem, i.e. fixed m-watchman routes problem , each route passes through a given point. In this paper, we propose the first linear-time algorithm to compute the optimum fixed 2-watchman routes under the MinMax criterion.
Keywords: Computational geometry, Multiple fixed watchman routes, Visibility polygon, Staircases
Download Full-Text
Accurate Biometrics Authentication Technique based on Fast, Robust Iris Recognition System using Enhanced Quality Image
Zoama Afaq, Bushra Sikander, and Malik Sikander Hayat Khiyal
The main aim of this research is to develop biometrics authentication system with high accuracy based on human iris recognition using enhanced quality image. An iris recognition system has been developed using pattern recognition techniques based on templates i.e. the images have been captured from the live video generated from high resolution camera and has been stored as the Dataset. Additionally a collection of different eye images have been stored in separate database that have been used for comparison and matching for accurate identification and verification phenomenon. Iris identification and authentication is thus based on individual’s eye. Authentication has been done with low error rate i.e. False Acceptance Rate (FAR) and False Rejection Rate (FRR). 1D Log Gabor Filters have been used for feature extraction and hamming distance has been used for template matching that also provides low FAR. In this way a fast and robust personal identification and verification system has been developed which gives the precise and accurate results. Thus the proposed system provides the secure, efficient and user friendly interface to the person.
Keywords: Biometrics Authentication, Iris Recognition, False Acceptance Rate, False Rejection Rate, Iris Identification
Download Full-Text
Zoama Afaq, Bushra Sikander, and Malik Sikander Hayat Khiyal
The main aim of this research is to develop biometrics authentication system with high accuracy based on human iris recognition using enhanced quality image. An iris recognition system has been developed using pattern recognition techniques based on templates i.e. the images have been captured from the live video generated from high resolution camera and has been stored as the Dataset. Additionally a collection of different eye images have been stored in separate database that have been used for comparison and matching for accurate identification and verification phenomenon. Iris identification and authentication is thus based on individual’s eye. Authentication has been done with low error rate i.e. False Acceptance Rate (FAR) and False Rejection Rate (FRR). 1D Log Gabor Filters have been used for feature extraction and hamming distance has been used for template matching that also provides low FAR. In this way a fast and robust personal identification and verification system has been developed which gives the precise and accurate results. Thus the proposed system provides the secure, efficient and user friendly interface to the person.
Keywords: Biometrics Authentication, Iris Recognition, False Acceptance Rate, False Rejection Rate, Iris Identification
Download Full-Text
Development of a Web-based System to Estimate the Cost of Distance Learning: A Case Study at the Jordanian Universities
Mohamed Ababneh, Mohammed Al Weshah, Abdel Karim Baareh
Distance learning has become one of the most important and familiar education learning programs now a days. Many universities and educational centers started establishing online courses that facilitates, encourages and increase the numbers of participants, due to the time and distance saving. In this type of learning students do their work at home or office and be in touch with faculty members at the university and other class mates via e-mail, electronic forums, videoconferencing and other forms of computer communication. When establishing a distance learning education program, one of the first items needs to be considered is the cost of developing such a program. In this paper, we develop a web based cost analysis tool, which will considerably help universities; institutes and funding organization to estimate the required budget that initially allow a distance education system to be implemented. The developed web based system considered will compute the initial fixed cost and variable cost, the growth rate and analyzes the expected benefit for the organization over upcoming years.
Keywords: Distance learning, Cost Estimation, Web-Based System, On Line Education, Network Connections
Download Full-Text
Mohamed Ababneh, Mohammed Al Weshah, Abdel Karim Baareh
Distance learning has become one of the most important and familiar education learning programs now a days. Many universities and educational centers started establishing online courses that facilitates, encourages and increase the numbers of participants, due to the time and distance saving. In this type of learning students do their work at home or office and be in touch with faculty members at the university and other class mates via e-mail, electronic forums, videoconferencing and other forms of computer communication. When establishing a distance learning education program, one of the first items needs to be considered is the cost of developing such a program. In this paper, we develop a web based cost analysis tool, which will considerably help universities; institutes and funding organization to estimate the required budget that initially allow a distance education system to be implemented. The developed web based system considered will compute the initial fixed cost and variable cost, the growth rate and analyzes the expected benefit for the organization over upcoming years.
Keywords: Distance learning, Cost Estimation, Web-Based System, On Line Education, Network Connections
Download Full-Text
Facebook in Education: Students, Teachers, and Library Perspectives
Manar I. Hosny, Shameem Fatima
This paper explores the use and application of Facebook in academia. The study tries to give an insight into how Facebook and similar social networking sites can be used as a medium of communication to help students, teachers as well as the institution’s library. The aim is to encourage the use of Facebook to complement and enhance classroom teaching. We investigate the benefits of using such medium from the perspectives of the student, the teacher and the librarian. We then review some case studies where Facebook was used to promote the learning experience. In this paper, we try to derive conclusions about best recommendations and practices that academics can follow to improve teaching and learning through using Facebook and other similar social networking sites.
Keywords: E-learning, Facebook, Social Networking Sites, Web 2.0
Download Full-Text
Manar I. Hosny, Shameem Fatima
This paper explores the use and application of Facebook in academia. The study tries to give an insight into how Facebook and similar social networking sites can be used as a medium of communication to help students, teachers as well as the institution’s library. The aim is to encourage the use of Facebook to complement and enhance classroom teaching. We investigate the benefits of using such medium from the perspectives of the student, the teacher and the librarian. We then review some case studies where Facebook was used to promote the learning experience. In this paper, we try to derive conclusions about best recommendations and practices that academics can follow to improve teaching and learning through using Facebook and other similar social networking sites.
Keywords: E-learning, Facebook, Social Networking Sites, Web 2.0
Download Full-Text
Optimal Guard Node Placement Using SGLD and Energy Factor
Junaid Gul, Sammee Mushtaq, Rabia Riaz
Execution of distributed denial-of-service (DDoS) attacks requires little effort on the attacker’s side, since a vast number of insecure machines provide fertile ground for attack zombies. These attacks can easily be downloaded and deployed. On the other hand, prevention of the attack or the response and trace back of agents is extremely difficult due to a large number of attacking machines, the use of source-address spoofing and the similarity between legitimate and attack traffic. Many defense systems have been designed to counter DDoS attacks, yet the problem remains largely unsolved. The objective of this work is to develop algorithm that will help optimal placement of guard node (GN) in different network topologies. If we use all nodes in the networks as Guarding nodes (GN), then the overall efficiency of the network as well as the energy of nodes will decrease rapidly. We study how to optimize the placement of these nodes so that they can detect DDoS attack on earliest, while using minimum number of GN, and keep the cost factor and overhead as low as possible with minimal energy utilization. Simulation results prove that as compared to previous schemes our scheme requires less number of GN’s and provide higher level of security for data traffic using minimum energy
Keywords: Set guard node with link down (SGLD), Guard nodes (GN), Distributed denial of service (DDoS)
Download Full-Text
Junaid Gul, Sammee Mushtaq, Rabia Riaz
Execution of distributed denial-of-service (DDoS) attacks requires little effort on the attacker’s side, since a vast number of insecure machines provide fertile ground for attack zombies. These attacks can easily be downloaded and deployed. On the other hand, prevention of the attack or the response and trace back of agents is extremely difficult due to a large number of attacking machines, the use of source-address spoofing and the similarity between legitimate and attack traffic. Many defense systems have been designed to counter DDoS attacks, yet the problem remains largely unsolved. The objective of this work is to develop algorithm that will help optimal placement of guard node (GN) in different network topologies. If we use all nodes in the networks as Guarding nodes (GN), then the overall efficiency of the network as well as the energy of nodes will decrease rapidly. We study how to optimize the placement of these nodes so that they can detect DDoS attack on earliest, while using minimum number of GN, and keep the cost factor and overhead as low as possible with minimal energy utilization. Simulation results prove that as compared to previous schemes our scheme requires less number of GN’s and provide higher level of security for data traffic using minimum energy
Keywords: Set guard node with link down (SGLD), Guard nodes (GN), Distributed denial of service (DDoS)
Download Full-Text
An Integrated Framework for Co-creating Government e-Service Value
Imran A. Adeleke and Azizah AbdulRahman
In Contemporary times, many governmental agencies are using information and communication technology (ICT) to modernize service delivery to citizens, which affords them to put a lot of information online for citizens’ use. Despite this, there is greater demand for service value by citizens that meet their needs in all facet of life. Therefore; government should co-create value and share service experience with customer in order to understand their needs as well as improving the lives of their citizens. However, there is limited study on the mechanism of exploring the government e-service applications between service provider and customer value-in-use experience from co-creation of value perspective. Co-creation of value is a process in which service provider and customer interact to share ideas and service experience to give way for a new world of continuous improvement and mutual benefit. In this paper, conceptual framework referred to as e-service value and experience co-creation (ESVEC) framework was proposed. An integrated framework comprising soft systems methodology (SSM) and DART model was created for the assessment of government e-service from co-creation of value context.
Keywords: Co-creation of Value, e-Service, DART model, Soft System Methodology
Download Full-Text
Imran A. Adeleke and Azizah AbdulRahman
In Contemporary times, many governmental agencies are using information and communication technology (ICT) to modernize service delivery to citizens, which affords them to put a lot of information online for citizens’ use. Despite this, there is greater demand for service value by citizens that meet their needs in all facet of life. Therefore; government should co-create value and share service experience with customer in order to understand their needs as well as improving the lives of their citizens. However, there is limited study on the mechanism of exploring the government e-service applications between service provider and customer value-in-use experience from co-creation of value perspective. Co-creation of value is a process in which service provider and customer interact to share ideas and service experience to give way for a new world of continuous improvement and mutual benefit. In this paper, conceptual framework referred to as e-service value and experience co-creation (ESVEC) framework was proposed. An integrated framework comprising soft systems methodology (SSM) and DART model was created for the assessment of government e-service from co-creation of value context.
Keywords: Co-creation of Value, e-Service, DART model, Soft System Methodology
Download Full-Text
Novel TEA Algorithm for IP Telephony System
Samah Osama M. Kamel, M. Saad El Sherif , Adly S. Tag El Dein, Sahr Abd El Rahman
IP telephony that transmit voice calls over an IP network such as the Internet, IP telephony are growing very fast replace the traditional circuit switched infrastructure for telephony services. So we must protect all data that are transmitted from all attacks. To implement this process, the voice is encrypted, authenticated and decrypted to get the original data. The paper examines and evaluates the six encryption algorithm to minimize delay time to achieve minimum encryption time. A Novel TEA encryption Algorithm is examined for the minimum processing time to be suitable for IP Telephony which takes minimum time.
Keywords: Key derivation, SRTP session salting key, SRTP session authentication key, Authentication, AES, Blowfish, IDEA, RC5, CAST-128, TEA, Encryption algorithm, Decryption algorithm, PRF:pseudo random function, ||: Concatenation
Download Full-Text
Samah Osama M. Kamel, M. Saad El Sherif , Adly S. Tag El Dein, Sahr Abd El Rahman
IP telephony that transmit voice calls over an IP network such as the Internet, IP telephony are growing very fast replace the traditional circuit switched infrastructure for telephony services. So we must protect all data that are transmitted from all attacks. To implement this process, the voice is encrypted, authenticated and decrypted to get the original data. The paper examines and evaluates the six encryption algorithm to minimize delay time to achieve minimum encryption time. A Novel TEA encryption Algorithm is examined for the minimum processing time to be suitable for IP Telephony which takes minimum time.
Keywords: Key derivation, SRTP session salting key, SRTP session authentication key, Authentication, AES, Blowfish, IDEA, RC5, CAST-128, TEA, Encryption algorithm, Decryption algorithm, PRF:pseudo random function, ||: Concatenation
Download Full-Text
Vector Quantization by Improved Kohonen Algorithm
Mohamed Ettaouil, Mohamed Lazaar and Youssef Ghanou
Nowadays, neural networks are largely used in signal processing and images. In particular, Kohonen networks or Self Organizing Maps are unsupervised learning models. This method performs a vector quantization (VQ) on the values obtained after processing. The vector quantization has a potential to give more data compression maintaining the same quality. In this paper we propose a new scheme to image compression using Kohonen networks. The main innovation in this work is to use the optimal Kohonen topological map to determine the optimal codebook, which can reduce the storage space, simplify data transfer and accelerate the process of data compression, unlike in classical Kohonen approach. To test our approach, we use two types of images; the medical images and the Lena image. The results demonstrated the effectiveness of the proposed approach.
Keywords: Kohonen Networks, Vector Quantization, Image Compression, Codebook
Download Full-Text
Mohamed Ettaouil, Mohamed Lazaar and Youssef Ghanou
Nowadays, neural networks are largely used in signal processing and images. In particular, Kohonen networks or Self Organizing Maps are unsupervised learning models. This method performs a vector quantization (VQ) on the values obtained after processing. The vector quantization has a potential to give more data compression maintaining the same quality. In this paper we propose a new scheme to image compression using Kohonen networks. The main innovation in this work is to use the optimal Kohonen topological map to determine the optimal codebook, which can reduce the storage space, simplify data transfer and accelerate the process of data compression, unlike in classical Kohonen approach. To test our approach, we use two types of images; the medical images and the Lena image. The results demonstrated the effectiveness of the proposed approach.
Keywords: Kohonen Networks, Vector Quantization, Image Compression, Codebook
Download Full-Text
Singer and Instrument Recognition from video song using Supporting Vector Machine
B.Srinivas, D.Sudheer Babu, K.Santosh Jhansi
Singer and Instrument identification from videosong (SIIV) is an interesting research topic in the fast growing music era and it has wide range of applications in the field of Human Computer Interaction (HCI).The objective of automatic singer and instrument recognition is to extract, characterize and recognize the information about singer and instrumental identity. Initially the song is extracted from the video then the singer features such as, Mel Frequency cepstrum coefficients (MFCC) and Mel Energy Spectrum Dynamic Coefficients (MEDC) are extracted from the audio file. The Support Vector Machine (SVM) is used as classifier to classify the verities of instruments used in music such as Harmonium, Sitar, Sarod, Tanpura, Santoor, Veena, Tabla etc,.The SVM is used to train and classify the system with singer voice and instruments. It gives 98.75% classification accuracy for Gender independent case 96.73% for male and 100% for female singers. It also gives 95.46% accuracy for instrument classification.
Keywords: Feature Extraction, Feature Selection, SVM, Singer Classification, instrumental classification
Download Full-Text
B.Srinivas, D.Sudheer Babu, K.Santosh Jhansi
Singer and Instrument identification from videosong (SIIV) is an interesting research topic in the fast growing music era and it has wide range of applications in the field of Human Computer Interaction (HCI).The objective of automatic singer and instrument recognition is to extract, characterize and recognize the information about singer and instrumental identity. Initially the song is extracted from the video then the singer features such as, Mel Frequency cepstrum coefficients (MFCC) and Mel Energy Spectrum Dynamic Coefficients (MEDC) are extracted from the audio file. The Support Vector Machine (SVM) is used as classifier to classify the verities of instruments used in music such as Harmonium, Sitar, Sarod, Tanpura, Santoor, Veena, Tabla etc,.The SVM is used to train and classify the system with singer voice and instruments. It gives 98.75% classification accuracy for Gender independent case 96.73% for male and 100% for female singers. It also gives 95.46% accuracy for instrument classification.
Keywords: Feature Extraction, Feature Selection, SVM, Singer Classification, instrumental classification
Download Full-Text
Survey on Survivability Issue against Single-Link Failures in Optical WDM networks
Asima Nisar
Survivability can be achieved through a sequence of system partitioning, subsystem design, and system-wide integration [1]. In this survey paper Survivability issue against Single-link failures in Optical WDM networks is discussed. Salient features of the proposed schemes are highlighted in tabular format.
Keywords: Protection, Restoration, Survivability, WDM (Wavelength Division Multiplexing)
Download Full-Text
Asima Nisar
Survivability can be achieved through a sequence of system partitioning, subsystem design, and system-wide integration [1]. In this survey paper Survivability issue against Single-link failures in Optical WDM networks is discussed. Salient features of the proposed schemes are highlighted in tabular format.
Keywords: Protection, Restoration, Survivability, WDM (Wavelength Division Multiplexing)
Download Full-Text
Smart Card Technology: Awareness and Satisfaction
Hamed Taherdoost, Shamsul Sahibuddin and Neda Jalaliyoon
Smart cards are becoming an important part in the daily life around the world. One of the important concerns of the smart card service/product suppliers are their customers’ satisfaction. Previous studies have proposed that awareness is one of the main components to gain the customer satisfaction. New technology should be clearly introduced to people and they have to be aware of its characteristics, features, and benefits. The main goal of this research is to assess the influence of user awareness on smart card technology satisfaction and consequently on its usage. In order to achieve the purpose of this study, a survey was conducted among the 688 university students who have more knowledge regarding the smart card or similar technologies compared to others. Research findings prove that user awareness have an effect on user satisfaction of smart card technology both significantly and directly.
Keywords: Smart card, satisfaction, awareness, technology acceptance, adoption, information technology
Download Full-Text
Hamed Taherdoost, Shamsul Sahibuddin and Neda Jalaliyoon
Smart cards are becoming an important part in the daily life around the world. One of the important concerns of the smart card service/product suppliers are their customers’ satisfaction. Previous studies have proposed that awareness is one of the main components to gain the customer satisfaction. New technology should be clearly introduced to people and they have to be aware of its characteristics, features, and benefits. The main goal of this research is to assess the influence of user awareness on smart card technology satisfaction and consequently on its usage. In order to achieve the purpose of this study, a survey was conducted among the 688 university students who have more knowledge regarding the smart card or similar technologies compared to others. Research findings prove that user awareness have an effect on user satisfaction of smart card technology both significantly and directly.
Keywords: Smart card, satisfaction, awareness, technology acceptance, adoption, information technology
Download Full-Text
Simulation Spidergon-NOC a scalable Architectures Using Ns-2
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Spidergon NoC is a regular and point-to-point topology for on-chip interconnections. The Spidergon network connects a generic even number of nodes as a bi-directional ring in both clockwise, and anti-clockwise directions with in addition a cross connection for each couple of nodes.We simulate proposed architecture with Network Simulator-2 (NS2). The simulation results reveal the applicability of the proposed architecture. The focus of this paper is to show that the universal property of the Spidergon NoC applies to distributed networks. We also carry out the high-level simulation of on chip network using NS2 to verify the analytical analysis.
Keywords: Network on Chip (NOC), NS2, Spidergon-NOC
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Spidergon NoC is a regular and point-to-point topology for on-chip interconnections. The Spidergon network connects a generic even number of nodes as a bi-directional ring in both clockwise, and anti-clockwise directions with in addition a cross connection for each couple of nodes.We simulate proposed architecture with Network Simulator-2 (NS2). The simulation results reveal the applicability of the proposed architecture. The focus of this paper is to show that the universal property of the Spidergon NoC applies to distributed networks. We also carry out the high-level simulation of on chip network using NS2 to verify the analytical analysis.
Keywords: Network on Chip (NOC), NS2, Spidergon-NOC
Download Full-Text
The TorusNX in Network-on-chips: New Structure for interconnection networks
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The overall performance of modern computing systems is increasingly determined by the characteristics of the interconnection network used to provide communication links between on-chip cores and off-chip memory. Photonic technology has been proposed as an alternative to traditional electronic interconnects because of its advantages in bandwidth density, latency, and power efficiency. Circuit-switched photonic interconnect topologies take advantage of the optical spectrumto create high-bandwidth transmission links through the transmission of data channels on multiple parallel Wavelengths. The silicon microring resonator electro-optic modulator is a ubiquitous device within many proposed photonic NoCs. One such network leverages the TorusNX topology. It is designed to mimic the connectivity of a folded torus for transmitting wavelength-parallel messages. Each wavelength channel of the wavelength-parallel message can be independently generated by a uniquely-tuned modulator.
Keywords: Network on Chip (NOC), TorusNX, NS-2
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The overall performance of modern computing systems is increasingly determined by the characteristics of the interconnection network used to provide communication links between on-chip cores and off-chip memory. Photonic technology has been proposed as an alternative to traditional electronic interconnects because of its advantages in bandwidth density, latency, and power efficiency. Circuit-switched photonic interconnect topologies take advantage of the optical spectrumto create high-bandwidth transmission links through the transmission of data channels on multiple parallel Wavelengths. The silicon microring resonator electro-optic modulator is a ubiquitous device within many proposed photonic NoCs. One such network leverages the TorusNX topology. It is designed to mimic the connectivity of a folded torus for transmitting wavelength-parallel messages. Each wavelength channel of the wavelength-parallel message can be independently generated by a uniquely-tuned modulator.
Keywords: Network on Chip (NOC), TorusNX, NS-2
Download Full-Text
The Square-Root-NOC: New Architecture for Network on chip
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Modern chip-scale computing system performance is increasingly becoming determined by the characteristics of the interconnection network. Photonic technology has been proposed as an alternative to traditional electronic interconnects for its advantages in bandwidth density, latency, and power efficiency Circuit-switched photonic network architectures take advantage of the optical spectrum to create high-bandwidth transmission links through the transmission of data channels on multiple parallel wavelengths. The square-root principle is known to achieve low search time for peer-to-peer search techniques that do not utilize query routing indices (e.g., query flooding or random walk searches).
Keywords: Square-Root-NOC, chip multiprocessor(CMP), high-performance computing (HPC)
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Modern chip-scale computing system performance is increasingly becoming determined by the characteristics of the interconnection network. Photonic technology has been proposed as an alternative to traditional electronic interconnects for its advantages in bandwidth density, latency, and power efficiency Circuit-switched photonic network architectures take advantage of the optical spectrum to create high-bandwidth transmission links through the transmission of data channels on multiple parallel wavelengths. The square-root principle is known to achieve low search time for peer-to-peer search techniques that do not utilize query routing indices (e.g., query flooding or random walk searches).
Keywords: Square-Root-NOC, chip multiprocessor(CMP), high-performance computing (HPC)
Download Full-Text
Simulation the Concentrated-NOC: CMesh-NOC and CTorus-NOC
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The Concentrated Mesh (CMesh) is a mesh whose nodes are grouped in sets of 4 and the links on the borders are connected with mode distant set of nodes in a way similar to Torus. By concentrating a set of four nodes together, the size of the mesh can be reduced to 4*4 thereby reducing the average hop count each message must incur but increasing the radix of each router to accommodate the four node connections. We explore the use of a concentrated mesh and concentrated torus. We simulated our NoC architecture using the widely used network simulator ns-2 and have obtained good performance.
Keywords: CMesh-NOC (Concentrated-Mesh-Network-On-Chip), CTorus-NOC (Concentrated-Torus-Network-On-Chip)
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The Concentrated Mesh (CMesh) is a mesh whose nodes are grouped in sets of 4 and the links on the borders are connected with mode distant set of nodes in a way similar to Torus. By concentrating a set of four nodes together, the size of the mesh can be reduced to 4*4 thereby reducing the average hop count each message must incur but increasing the radix of each router to accommodate the four node connections. We explore the use of a concentrated mesh and concentrated torus. We simulated our NoC architecture using the widely used network simulator ns-2 and have obtained good performance.
Keywords: CMesh-NOC (Concentrated-Mesh-Network-On-Chip), CTorus-NOC (Concentrated-Torus-Network-On-Chip)
Download Full-Text
NOC-torus-Folded: New distributed networks Architecture
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The Folded Torus interconnection topology is widely used in massively parallel machines. Defect in manufacturing of integrated circuits is almost inevitable, and fast scaling in technology has caused the components of a Network-on-Chip (NoC) to be more susceptible to faults. Therefore, it is crucial to sustain chip production yield and reliable operation in the presence of defects.
Keywords: Network on Chip (NOC), NOC-torus-Folded, NS-2, simulation
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
The Folded Torus interconnection topology is widely used in massively parallel machines. Defect in manufacturing of integrated circuits is almost inevitable, and fast scaling in technology has caused the components of a Network-on-Chip (NoC) to be more susceptible to faults. Therefore, it is crucial to sustain chip production yield and reliable operation in the presence of defects.
Keywords: Network on Chip (NOC), NOC-torus-Folded, NS-2, simulation
Download Full-Text
Extended Hypercube-NOC: New Hierarchical Interconnection Structure
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
A new interconnection topology-the Extended Hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same time has some additional advantages like reduced diameter and constant degree of a node. The Extended Hypercube is a hierarchical, expansive recursive structure with hypercube as the basic building blocks. It has reduced diameter and average distance. With the use of Network controllers it has better routing properties than the hypercube.
Keywords: System-on-Chip (SoC), Network on Chip (NOC), Extended Hypercube-NOC, Hierarchical
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
A new interconnection topology-the Extended Hypercube-consisting of an interconnection network of k-cubes is discussed. The extended hypercube is a hierarchical, expansive, recursive structure with a constant predefined building block. The extended hypercube retains the positive features of the k-cube at different levels of hierarchy and at the same time has some additional advantages like reduced diameter and constant degree of a node. The Extended Hypercube is a hierarchical, expansive recursive structure with hypercube as the basic building blocks. It has reduced diameter and average distance. With the use of Network controllers it has better routing properties than the hypercube.
Keywords: System-on-Chip (SoC), Network on Chip (NOC), Extended Hypercube-NOC, Hierarchical
Download Full-Text
3D-FolH-NOC: A New structure for parallel processing and distributed systems
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Network on Chip (NoC) has been proposed as a new paradigm for designing System on Chip which supports high degree of scalability and reusability. NoC, specific parameters such as hardware architecture, topology, switching methods have a huge impact on performance and the cost of the NoCs. Since the ability of the network to efficiently disseminate information depends largely on the topology, we especially focus on simulation of the 3D-FolH-NOC(3-dimensional-Folded-Heawood- Network-on-chip) topology for NoC in different Sizes and dimensions for NoC. We simulate this topology for general-purpose parallel processing applications. This paper shows that a novel network called the 3D-FolH-NOC(3-dimensional-Folded- Heawood-Network-on-chip) is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers.
Keywords: interconnection network (IN), 3-dimensional-Folded-Heawood-Network-on-chip, Network on Chip (NoC)
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Network on Chip (NoC) has been proposed as a new paradigm for designing System on Chip which supports high degree of scalability and reusability. NoC, specific parameters such as hardware architecture, topology, switching methods have a huge impact on performance and the cost of the NoCs. Since the ability of the network to efficiently disseminate information depends largely on the topology, we especially focus on simulation of the 3D-FolH-NOC(3-dimensional-Folded-Heawood- Network-on-chip) topology for NoC in different Sizes and dimensions for NoC. We simulate this topology for general-purpose parallel processing applications. This paper shows that a novel network called the 3D-FolH-NOC(3-dimensional-Folded- Heawood-Network-on-chip) is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers.
Keywords: interconnection network (IN), 3-dimensional-Folded-Heawood-Network-on-chip, Network on Chip (NoC)
Download Full-Text
Modular Simulation of FQ4-NOC: 4-dimensional-Folded-Heawood-NOC
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Recently, several variations of the hypercube have been proposed to enhance its performance and reliability. The folded hypercube is one of these variations, in which an extra link is added to each node providing a direct connection to the node located farthest from it. In this paper, we propose a new operation mode of the folded hypercube to enhance its performance and fault-tolerance. We simulate this topology for general-purpose parallel processing applications. This paper shows that a novel network called the 4D-FolH-NOC(FQ4 or 4-dimensional-Folded-Heawood-Network-on-chip) is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers.
Keywords: interconnection network (IN), 4-dimensional-Folded-Heawood-Network-on-chip, Network on Chip (NoC)
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Recently, several variations of the hypercube have been proposed to enhance its performance and reliability. The folded hypercube is one of these variations, in which an extra link is added to each node providing a direct connection to the node located farthest from it. In this paper, we propose a new operation mode of the folded hypercube to enhance its performance and fault-tolerance. We simulate this topology for general-purpose parallel processing applications. This paper shows that a novel network called the 4D-FolH-NOC(FQ4 or 4-dimensional-Folded-Heawood-Network-on-chip) is universally efficient when adequate capacity distribution is provided and is suitable for use as an interconnection network in parallel computers.
Keywords: interconnection network (IN), 4-dimensional-Folded-Heawood-Network-on-chip, Network on Chip (NoC)
Download Full-Text
Improvement the Network-on-Chip Quality-of-Service through MPLS
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Networks on chips (NoCs) have been introduced as a remedy for the growing problems of current interconnection VLSI chips. Being a relatively new domain in research, simulation tools for NoCs are scarce. To fill the gap, we use network simulator NS-2 for simulating multi protocol label switching in NoCs, especially at high level chip design. in this paper, we discuss the difficulties Mechanisms for networks-on-chip by MPLS packet-forwarding technology.
Keywords: Network-on-Chip, Quality-of-service,mpls, Systems-on-chip (SoC)
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Networks on chips (NoCs) have been introduced as a remedy for the growing problems of current interconnection VLSI chips. Being a relatively new domain in research, simulation tools for NoCs are scarce. To fill the gap, we use network simulator NS-2 for simulating multi protocol label switching in NoCs, especially at high level chip design. in this paper, we discuss the difficulties Mechanisms for networks-on-chip by MPLS packet-forwarding technology.
Keywords: Network-on-Chip, Quality-of-service,mpls, Systems-on-chip (SoC)
Download Full-Text
Survey the QOS of Fat-Tree-NOC through MPLS
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Providing Quality-of-Service (QoS) in networks-on-chip (NoCs) will be an important consideration for the complex multiprocessor chips of the future. In this paper, we compare the Reserved Bandwidth Mechanisms in Network-On-Chip that is based on applying the well-known MPLS technology of large-scale computer networks to the on-chip environment. A network simulator is used to evaluate the concept for a typical communications scenario that must support several classes of traffic having a range of QoS requirements.
Keywords: Systems-on-chip (SOC), MPSoC, Network on Chip (NOC), MPLS, fault tolerance
Download Full-Text
Teamour Esmaeili, Ghazal Lak and Akram Noori Rad
Providing Quality-of-Service (QoS) in networks-on-chip (NoCs) will be an important consideration for the complex multiprocessor chips of the future. In this paper, we compare the Reserved Bandwidth Mechanisms in Network-On-Chip that is based on applying the well-known MPLS technology of large-scale computer networks to the on-chip environment. A network simulator is used to evaluate the concept for a typical communications scenario that must support several classes of traffic having a range of QoS requirements.
Keywords: Systems-on-chip (SOC), MPSoC, Network on Chip (NOC), MPLS, fault tolerance
Download Full-Text
Effect of Delayed ACK with Retransmission of TCP Tahoe in Mesh NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with delayed acknowledgment and retransmission that cannot get three duplicate Acknowledgments(ACKs), and wait for the retransmission timeout when a packet lost, and we show the effect of Slow start and retransmission algorithm for increase the reliability of network on chip (NoC).We simulate 3D mesh 2*2 NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Retransmission, mesh NoC
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with delayed acknowledgment and retransmission that cannot get three duplicate Acknowledgments(ACKs), and wait for the retransmission timeout when a packet lost, and we show the effect of Slow start and retransmission algorithm for increase the reliability of network on chip (NoC).We simulate 3D mesh 2*2 NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Retransmission, mesh NoC
Download Full-Text
Effect of Delayed ACK and Multiple Packet Drop of TCP Tahoe in 3D Mesh NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with Delayed acknowledgment and retransmission with multiple packet drop, for increase the reliability of network on chip (NoC).We simulate 3D Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with Delayed acknowledgment and retransmission with multiple packet drop, for increase the reliability of network on chip (NoC).We simulate 3D Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Effect of Different Propagation Delay of TCP Tahoe in Hexagon NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with phase effects and different propagation delay in network on chip (NoC). We simulate Hexagon (6-gon) NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, propagation delay
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with phase effects and different propagation delay in network on chip (NoC). We simulate Hexagon (6-gon) NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, propagation delay
Download Full-Text
Effect of Different Queue Size and Different Propagation Delay of TCP Tahoe in Hexagon NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with different queue size and different propagation delay in network on chip (NoC). We simulate Hexagon (6-gon) NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, queue size, propagation delay
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with different queue size and different propagation delay in network on chip (NoC). We simulate Hexagon (6-gon) NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, queue size, propagation delay
Download Full-Text
Effect of Multiple Fast Retransmission of TCP Tahoe in Decagon NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with multiple fast retransmissions, that resulting from losses in one window of data for increase the performance of network on chip (NoC).We simulate decagon NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Retransmissions, Ring NoC
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Tahoe with multiple fast retransmissions, that resulting from losses in one window of data for increase the performance of network on chip (NoC).We simulate decagon NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Retransmissions, Ring NoC
Download Full-Text
Effect of Maximum Congestion of TCP Reno in Decagon NoC
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with one packet drop and maximum congestion window limitation for increase the performance of network on chip (NoC).We simulate Decagon NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Reno protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Packet Drop, Fast recovery
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with one packet drop and maximum congestion window limitation for increase the performance of network on chip (NoC).We simulate Decagon NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Reno protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe, Packet Drop, Fast recovery
Download Full-Text
Analysis of TCP Reno with two Packet Drop and Maximum Congestion Window in Network on Chip
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with two packet drop and maximum congestion window limitation for increase the performance of network on chip (NoC).We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with two packet drop and maximum congestion window limitation for increase the performance of network on chip (NoC).We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Analysis of Fast Recovery TCP Reno with Multiple packet drops in Network on Chip
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with multiple packet drops for increase the reliability of network on chip (NoC).We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm with multiple packet drops for increase the reliability of network on chip (NoC).We simulate Mesh NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Analysis of TCP Reno with Fast recovery and multiple packet drops in Network on Chip
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm and multiple packet drops, for increase the performance of network on chip (NoC).We simulate 2D Mesh 8*8 NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, multiple packet drops, TCP Tahoe
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno Fast recovery algorithm and multiple packet drops, for increase the performance of network on chip (NoC).We simulate 2D Mesh 8*8 NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, multiple packet drops, TCP Tahoe
Download Full-Text
Analysis of TCP Reno with two packet drops without maximum congestion window in Network on Chip
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno with two packet drops without maximum congestion window for increase the reliability of network on chip (NoC).We simulate Ring NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
Teamour Esmaeili, Akram Noori Rad and Ghazal Lak
This paper shows the behavior of TCP Reno with two packet drops without maximum congestion window for increase the reliability of network on chip (NoC).We simulate Ring NoC architecture with Network Simulator 2 (NS2). The simulation results reveal the applicability of TCP Tahoe protocol in Congestion Control in proposed architecture.
Keywords: Network-on-Chip, TCP Tahoe
Download Full-Text
A Priority based Scheduling Algorithm to Improve Quality of Service from Safety perspective in VANET
Esmaeili Teamour, Mahmood Fathy and Hossein Ghaffarian
In this paper a new scheduling algorithm is proposed to satisfy quality of service levels for different classes of applications based on their necessities. Currently, there are lots of applications with different levels of safety. However, safety applications must served in a short time; because they are critical for safety in driving. Therefore we classified applications of VANET into four different classes from safety perspective. Then, a greedy scheduler is proposed to serve traffics with higher level of priority sooner than other traffics. Simulation results of NS2 shows that the proposed approach could prepare a better performance than the standard approach with respect to safety levels.
Keywords: VANET, scheduling, safety, priority
Download Full-Text
Esmaeili Teamour, Mahmood Fathy and Hossein Ghaffarian
In this paper a new scheduling algorithm is proposed to satisfy quality of service levels for different classes of applications based on their necessities. Currently, there are lots of applications with different levels of safety. However, safety applications must served in a short time; because they are critical for safety in driving. Therefore we classified applications of VANET into four different classes from safety perspective. Then, a greedy scheduler is proposed to serve traffics with higher level of priority sooner than other traffics. Simulation results of NS2 shows that the proposed approach could prepare a better performance than the standard approach with respect to safety levels.
Keywords: VANET, scheduling, safety, priority
Download Full-Text
Stock Prediction Using Web Sentiments, Financial News and Quotes
Sulana Maria Rebelo and Kavita Asnani
In this paper, we present a model that predicts stock market closing value for Dow Jones Industrial Average (DJI) index for a giving trading day. This is done using unstructured data like financial message board messages and news articles. We also use financial stock quotes data. We derive the sentiment for each message from the message board using SentiWordNet and from this we derive the sentiment for every company of DJI for each trading day. News articles are replaced by key phrases using Key Phrase Extraction Algorithm (KEA). The processed message board messages, news articles and stock quotes data will be used to train a Neural Network using Back propagation Algorithm. The trained network will predict closing value for DJI for a particular trading day.
Keywords: Back Propagation Algorithm, Dow Jones Industrial Average (DJI), Key Phrase Extraction Algorithm (KEA), Neural Network, SentiWordNet
Download Full-Text
Sulana Maria Rebelo and Kavita Asnani
In this paper, we present a model that predicts stock market closing value for Dow Jones Industrial Average (DJI) index for a giving trading day. This is done using unstructured data like financial message board messages and news articles. We also use financial stock quotes data. We derive the sentiment for each message from the message board using SentiWordNet and from this we derive the sentiment for every company of DJI for each trading day. News articles are replaced by key phrases using Key Phrase Extraction Algorithm (KEA). The processed message board messages, news articles and stock quotes data will be used to train a Neural Network using Back propagation Algorithm. The trained network will predict closing value for DJI for a particular trading day.
Keywords: Back Propagation Algorithm, Dow Jones Industrial Average (DJI), Key Phrase Extraction Algorithm (KEA), Neural Network, SentiWordNet
Download Full-Text