@article{ author = {Eslami, Ali and Keshavarz, Hengameh}, title = {User Capacity Scaling Laws for Fading Broadcast Channels Affected by Channel Estimation}, abstract ={It has already been shown that in rate-constrained broadcast channels, under the assumption of independent Rayleigh, Rician and Nakagami fading channels for different receivers, the user capacity (i.e. the maximum number of users that can be activated simultaneously) scales double logarithmically with the total number of users. However, to achieve the aforementioned result, it is assumed that channel state information (CSI) is perfectly known to the receivers. In practical situations, the receivers do not have access to the true CSI and they only know estimated channels. In this paper, the effects of channel estimation is analyzed on the user capacity of rate-constrained broadcast channels. In particular, the Minimum Mean Square Error (MMSE) channel estimation scheme is considered and the effects of this estimation method on the user capacity is investigated. Under the assumption of commonly used fading channels for different receivers, it is shown that the user capacity still scales double logarithmically; however, there is a gap depending on channel estimators accuracy between the upper and lower bound of the user capacity. The bound will be asymptotically tight if the variance of the channel estimator remains constant.}, Keywords = {User capacity, channel estimation, scaling laws, broadcast channels, fading channels, minimum-rate constraint, power allocation }, volume = {5}, Number = {4}, pages = {1-7}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-140-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-140-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Shojaee, Reza and Faragardi, Hamid Reza and Yazdani, Nasser}, title = {From Reliable Distributed System Toward Reliable Cloud by Cat Swarm Optimization}, abstract ={Distributed Systems (DS) are usually complex systems composed of various components and cloud is a common type of DSs. Reliability is a major challenge for the design of cloud systems and DSs in general. In this paper an analytical model to analyze reliability in DSs with regards to task allocation was presented. Subsequently, this model was modified and a new model to analyze reliability in cloud systems with regards to Virtual Machine(VM) allocation was suggested. On the other hand, optimal task allocation in DSs is an NP-hard problem, thus finding exact solutions are limited to small-scale problems. This paper presents a new swarm intelligence technique based on Cat Swarm Optimization (CSO) algorithm to find near optimal solution. For evaluating the algorithm, CSO is compared with Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The experimental results show that in contrast to PSO and GA, CSO acquires acceptable reliability in reasonable execution time.}, Keywords = {distributed system, reliability, cat swarm optimization, cloud computing, task allocation, analytical model }, volume = {5}, Number = {4}, pages = {9-18}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-141-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-141-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Kazeminia, Mahdi and Mehrjoo, Mehri}, title = {A Two-Dimensional Maximum Likelihood Parameter Estimation of Г-Г Distribution for Free Space Optical Channels with Weak Turbulence Conditions}, abstract ={We present an approach for maximum likelihood (ML) parameter estimation of the Gamma-Gamma (Г-Г) distribution in the weak turbulence conditions of the free space optical (FSO) channels. A two-dimensional ML (2DML) estimation approach is deployed to extend our one-dimensional Г-Г parameter estimation (1DML) method proposed in [1]. To achieve the 2D estimation, an explicit closed form expression between the Г-Г parameters is extracted, where the constant factors of the expression are obtained using genetic algorithm (GA). The proposed 2DML estimation is compared with the modified method of moments based on a convex optimization (modified MOM/CVX). The numerical results demonstrate that 2DML outperforms modified MOM/CVX in terms of the mean square error of the estimation and the variance of the estimators. Moreover, the convergence rate of the 2DML method is high and not sensitive to the starting points.}, Keywords = { Maximum Likelihood Estimation, Free Space Optical (FSO), Gamma-Gamma Distribution, Genetic Algorithm }, volume = {5}, Number = {4}, pages = {19-26}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-142-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-142-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Mandegar, Amir Hossein and Akbari, Behz}, title = {A New Method for Evaluating Video Quality of Experience on Content-Aware Packet Loss Effect Analysis}, abstract ={According to the popularity of variant video streaming applications over the Internet, video quality assessment is essential for video solutions and network operators in order to evaluate video stream quality and measure the end-user Quality of Experience. Packet loss affects both the decoder performance and the user’s perception of video quality due to several network issues. The main goal of this paper is to estimate the perceived video quality at the receiver’s side by passive measurement in the network and also evaluate how errors propagate through temporal prediction. Our proposed method is based on the network level parameters by considering the video codec and frame information. Our experimental analysis shows the accuracy and efficiency of the proposed method.}, Keywords = { Video Quality Estimation, Passive Traffic Measurement, Packet Lost Evaluation }, volume = {5}, Number = {4}, pages = {27-35}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-143-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-143-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Amidi, Yalda and Sadeghi, Mohammad Taghi}, title = {Face Verification Using Local Binary Patterns and Sparse Representation Techniques}, abstract ={We present a novel method of face verification which is based on the concept and principles of sparse representation of signals. The sparse representation techniques are used in both feature extraction and classification steps. The proposed method is relatively invariant to changes in imaging conditions such as illumination variations. This is due to the characteristics of the sparse sampling method. In order to improve the invariance properties of the system, the feature extraction algorithm is motivated by using the Local Binary Pattern (LBP) features. Our experimental studies on the XM2VTS and XM2VTS-DARK datasets demonstrate that the proposed method improves the performance of the verification system.}, Keywords = { Face Verification, Sparse Representation, Sparsity Preserving Projection (SPP), Sparse Representation Classifier (SRC), Local Binary Pattern(LBP) }, volume = {5}, Number = {4}, pages = {37-45}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-144-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-144-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Mansouri, Amin and Fadaei, Hakimeh and Faili, Heshaam and Arabsorkhi, Mohse}, title = {Using Synchronous TAG for Source-Side Reordering in SMT}, abstract ={Recent efforts in machine translation try to enrich statistical methods by syntactic information of source and target languages. In this paper we present a hybrid machine translator, which combines rule-based and statistical models in a serial manner. This system uses synchronous tree adjoining grammar (STAG) to benefit the context sensitivity of this formalism. In this system, a set of reordering rules in STAG formalism is automatically extracted from a parallel corpus. These rules are used to change the word orders of the source sentence to match the word ordersin the target language. The restructured sentences are then translated to target language using a statistical approach. Experiments are carried out on three different datasets for English-Persian translation. Experimental results show that the presented reordering method combined with conventional or monotone phrase-based SMT, improves the translation quality respectively by 1.8 and 0.55 points regarding BLEU score.}, Keywords = { Statistical Machine Translation, Reordering Rules, Tree Adjoining Grammar }, volume = {5}, Number = {4}, pages = {47-58}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-145-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-145-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Kianpishe, Tayebe and Akbari, Mohammad Kazem}, title = {Increasing the Total Efficiently Executed Work on Volunteer Computing Environment Based on Work Send Policy}, abstract ={Volunteer computing is a type of parallel computing systems that is defined by a large number of nodes and autonomous changeable resources. Task scheduling is one of the most crucial issues on volunteer computing. A welldefined scheduling attracts the versatile guest applications to submit their jobs to this environment and motivates internet-users to contribute more. Hence, optimization of the server-side policies will stimulate volunteers’ eagerness to contribute more of their resources. The existent methods cannot use the capacity of the host system efficiently. In this paper, we propose a new scheduling mechanism, which tries to decrease the idleness factor of the host system and keeps down its waste factor. In our method, we schedule some of the jobs in one RPC round earlier than usual. The experimental results show that the total efficiently executed work increases up to 70% and the average increases by 35%.}, Keywords = { volunteer computing, scheduling mechanism, remote procedure call, EDF algorithm }, volume = {5}, Number = {4}, pages = {59-69}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-146-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-146-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Ahmadi, Mohammad Rez}, title = {A Dynamic Resource Allocation Method for Virtual Datacenter Resources Using CoCo-VM Approach}, abstract ={A dynamic resource allocation method for virtual resources in virtualized data centers has been proposed in this paper. Since resource allocation with constraint in virtual environment is NP-hard, the solution has been focused on approximate methods based on immune system mechanism using agent based model and Cooperative Coevolutionary Algorithm (CoCo-VM) that appears to perform well in finding a plausible answer [1]. The novelty of our approach lies in integrating an agent based greedy algorithm based on immune system functionality together with the cooperative co-evolutionary concept as an intelligent solution for virtual resource allocation in a large scale and distributed virtualized datacenters. Here, some mathematical analyses have been done to identify the parameters essential to assign a suggested allocation approach. Results of different evaluations in pure immune system (PIS)0F 1 and CoCo-VM methods demonstrate that, for the scenarios under consideration, the proposed resource allocation approach can significantly reduce resource consumption, increase number of successful services, and achieve higher performance.}, Keywords = { Virtual resource allocation, cooperative co-evolutionary algorithm, immune system, agent-based greedy algorithm }, volume = {5}, Number = {3}, pages = {1-10}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-147-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-147-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Arianyan, Ehsan and Motamedi, Seyed Ahmad and Arianyan, Iman and Motamedi, Mohamm}, title = {Accelarated Optical Character Recognition on Graphics Processing Units}, abstract ={Optical Character Recognition (OCR) is a technique by the help of which the optical characters are identified automatically by a computer. There are many methods for OCR, one of which is neural network that we use. Unfortunately, the long training and testing time of these networks is disturbing, but we healed this problem by mapping our network on graphics card by using Jacket which is the product of Accelereyes group. By so doing, we achieved the speedup of up to twelve factors. Graphics Processing Units (GPUs) have parallel structure containing many cores capable of running thousands of threads in parallel. We train a multi-layer perceptron network using back propagation rule which has a degree of parallelism that is suitable for implementation on new graphics card. We examine the Persian characters that are typed on the new system of Farsi license plates to make a database of characters uses in this system and apply them as train and test data for our network.}, Keywords = { Neural network, OCR, GPU, Jacket, CUDA }, volume = {5}, Number = {3}, pages = {11-17}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-148-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-148-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Mashayekhi, Masoomeh and Analoui, Mortez}, title = {Evaluating Fidelity of Persian-English Sentence-Aligned Parallel Corpus}, abstract ={Bilingual corpus is one of the most important resources for Natural Language Processing applications and researches. The quality of bilingual corpora can influence the result of researches that used it as a resource. When translation machine is used to verify corpus quality, the quality of translation machine can affect the evaluation of corpus. One way for evaluating software or resources in ISO is verifying its own features. The expectation of finding translation for each word in each sentence by using a bilingual dictionary is verified in this paper as a factor for evaluating fidelity of corpus. Computing this expectation needed a pre-processing step that is designed with considering the differences between English and Persian languages. This method is a combination of a rule-based method with the information of a dictionary.}, Keywords = { Evaluation, Bilingual Corpora, Aligned Corpora, Parallel Corpora, Bilingual dictionary }, volume = {5}, Number = {3}, pages = {19-24}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-149-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-149-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Salehi, Mojtaba and NakhaiKamalabadi, Isa and GhaznaviGhoushchi, Mohammad Bagher}, title = {A New Adaptive Hybrid Recommender Framework for Learning Material Recommendation}, abstract ={Recommender system is a promising technology in online learning environments to present personalized offers for supporting activity of users. According to difficulty of locating appropriate learning materials to learners, this paper proposes an adaptive hybrid recommender framework that considers dynamic interests of learners and multi-attribute of materials in the unified model. Since learners express their preference based on some specific attributes of materials, learner preference matrix (LPM) is introduced that can model the interest of learners based on attributes of materials using historical rating of accessed materials by learners. Then, the approach uses collaborative filtering and content based filtering to generate hybrid recommendation. In addition, a new adaptive strategy is used to model dynamic preference of learners. The experiments show that our proposed method outperforms the previous algorithms on precision, recall and intra-list similarity measure and also can alleviate the sparsity problem.}, Keywords = { Personalized Recommendation, Collaborative Filtering, Learning Material, E-learning, Adaptive Recommender, Dynamic Interests }, volume = {5}, Number = {3}, pages = {25-33}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-150-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-150-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Nazemian, Ali and Taghiyareh, Fattaneh}, title = {A Mutual Independent Cascade Model for Customer Behavior Propagation}, abstract ={Model of spreading behaviors, influences, new trends and innovations through social networks has been studied in a number of domains. These may include the diffusion of medical and technological innovations, the sudden and widespread adoption of strategies in game-theoretic settings, and the effects of word of mouth in the promotion of new products. One of the most important facts that is neglected in previous spread models is “considering cascading negative opinions”. This important fact shows that negative opinions may originate and propagate in populations as much as positive opinions and even they are stronger and more dominant. In this paper we propose a new model of influence cascade called Independent Cascade with Positive and Negative WOM (ICPN). ICPN models some important facts that people may encounter in a social environment. These facts include negativity bias, the asymmetric behavior of negative and positive WOM, and different types of consumer complaints behaviors. Moreover, the influence maximization problem is formulated in this model and also, we show that ICPN maintains submodularity in this problem.}, Keywords = { independent cascade model, influence maximization, customer behavior propagation, negative word of mouth, positive word of mouth, consumer complaining behavior }, volume = {5}, Number = {3}, pages = {35-44}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-151-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-151-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Farhoodi, Mojgan and ShiryGhidary, Saeed and Yari, Alirez}, title = {Quality Improvement of Information Retrieval System Results by Document Classification}, abstract ={In traditional search engines, the most common way to show results for a query is to list documents in order of their computed relevance to the query. However, the ranking is independent of the topic of the document;so the results of different topics are not grouped together. In this situation, the user must scroll though many irrelevant results until his desired information need is found. One solution is to organize search results via classification. Many researchers have shown that classifying web pages can improve a search engine's ranking of results. Intuitively results should be more relevant when they match the class of a query. In this paper, we present a simple framework for classification-enhanced ranking that uses query class in combination with the classification of web pages to derive a class distribution for the query. In this regard, we propose a hybrid IR search strategy that begins with a 3-gram classification-based strategy and reverts to a ranked-list strategy if the user doesn’t find the target document in selected class.The experiment results on Hamshahri corpus show satisfactory results.}, Keywords = { Information Retrieval, Hamshahri, Ranking, Classification, SVM, KNN, N-gram language modeling, Smoothing methods }, volume = {5}, Number = {3}, pages = {45-54}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-152-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-152-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Tajpour, Atefeh and brahim, Suhaimi I}, title = {A Framework for Evaluation of SQL Injection Detection and Prevention Tools}, abstract ={SQLIA is a hacking technique by which the attacker adds Structured Query Language code (SQL statements) through a web application's input fields or hidden parameters to access the resources. By SQL injection an attacker gains access to underlying web application's database and destroys functionality and/or confidentiality. Researchers have proposed different techniques to detect and prevent this vulnerability. In this paper we present SQL injection attack types and also current security tools which detect or prevent this attack and compare them with each other. Finally, we propose a framework for evaluating SQL injection detection or prevention tools in common criteria. In fact, this paper provides information about current tools for researchers and also helps security officers to choose suitable SQL injection detection tools for their web application security.}, Keywords = { web application security, web application vulnerability, SQL Injection attack, framework, tool, evaluation, comparison }, volume = {5}, Number = {3}, pages = {55-62}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-153-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-153-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Fazeli, Ali and Omidi, Mohammad Javad and SaeediSourck, Hami}, title = {Superposition Network Coding for Wireless Cooperative Communication}, abstract ={Spatial diversity can be exploited by the use of cooperative communication technology. However, most of the well known cooperative protocols have some practical challenges. In this paper we introduce two disadvantages of several important cooperative diversity protocols including low spectral efficiency and requirement for perfect time and frequency synchronization of relay nodes. Then, a cooperative strategy is proposed that improves overall communication performance in comparison with non-cooperative protocols with high spectral efficiency and non synchronization problems. In this technique, we use a combination of superposition coding and network coding to achieve cooperative diversity in asymmetric wireless networks; hence the name superposition network coded cooperation (SNCC). The SNCC scheme is applied to a special but generalizable case of three users. In this case the receiver structure and error performance analysis of SNCC are presented. The results demonstrate performance improvement of wireless communication.}, Keywords = { Cooperative diversity, Symbol Error Rate Selection Combining (SER-SC), Interference Ignorant Detector(IID), Network coding, Superposition coding }, volume = {5}, Number = {2}, pages = {1-9}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-154-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-154-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Mohammadkhani, Saeideh and Kahaei, Mohammad Hossein and Razavizadeh, Seyed Mohamm}, title = {Cooperative Filter-and-Forward Beamforming in Cognitive Radio Relay Networks}, abstract ={In this paper, the Filter-and-Forward strategy is developed for cooperative relays in Cognitive Radio networks with underlay structure and frequency selective fading channels. A cost function is defined to minimize the required transmitting power of the relay networks and the secondary user. This is performed subject to keeping the power of noise and interferences at the primary receiver less than a predefined limit and an SINR above a given threshold. In this structure, a power control is also carried out on the secondary transmitter. Simulation results show that the proposed algorithm converges to an optimal solution based on the interior point method. The results show that compared to the Amplify-and-Forward strategy, we achieve a higher SINR threshold in the secondary receiver and need a lower transmitting power at the relays and secondary transmitter.}, Keywords = { cognitive radio, cooperative beamforming, Filter-and-Forward, power control, convex optimization, frequency selective channel }, volume = {5}, Number = {2}, pages = {11-17}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-155-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-155-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Aliasgari, Mohammad and Fakhraie, Sied Mehdi}, title = {Deep Out-of-Band Radiation Reduction By Using Joint Filterbank and Cancellation Carriers in Cognitive Radios}, abstract ={A deep spectrum sculpting is necessary to enable coexistence between a cognitive radio (CR) user and a licensed user which has low dynamic range and is susceptible to interferences. In this paper, we propose to use joint filter-bank based multicarrier system and cancellation carriers to guarantee an almost free out-of-band interference transmission and keep the quality of services of licensed adjacent bands unchanged. We investigate the performance of the proposed method with different well-known existing methods from viewpoints of the average level of out-ofband power, spectral efficiency, and computational complexity.}, Keywords = { Filter-bank, cancellation carrier, deep spectral mask, out-of-band radiation, cognitive radio }, volume = {5}, Number = {2}, pages = {19-26}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-156-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-156-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Talepour, Zeinab and AhmadiShokouh, Javad and Tavakoli, Saee}, title = {Optimum Indoor Signal Coverage of Dense Distributed Receivers via Ray Tracing Coupled with Genetic Algorithm}, abstract ={In this paper, we propose an optimization method to suitable locating minimum number of transmitter antennas to provide adequately signal coverage in a given indoor environment. This method is based on an integrated realized Ray-Tracing (RT) technique, so-called Ray-Tracing Engine (RTE), and Genetic Algorithm (GA). This integration provides an intelligent system in optimization process. To provide freedom in furniture placement each corner of every room contains a receiver. Therefore, we have a dense map of RSS distribution in propagation environment. According to Simulation results a full coverage using integrated RTE and GA is achieved through suitably locating three transmitters. Furthermore, GA avoids the time consuming process of antenna location finding in an exhaustive search method.}, Keywords = { ray tracing, genetic algorithm, received signal strenght, wireless communication network }, volume = {5}, Number = {2}, pages = {27-33}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-157-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-157-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Hosseinbeig, Ahmad and Kamyab, Manoochehr and SoleimanMeiguni, Jav}, title = {Analysis Method for Spherical Dipole Antenna Array}, abstract ={Rigorous mathematical Method of Moments (MoM) for analyzing various radiating spherical structures is presented in this paper by using Dyadic Green's Functions (DGF) in conjunction with Mixed Potential Integral Equation (MPIE) formulation. With the aid of linear Rao-Wilton-Glisson (RWG) triangular basis functions and by converting spherical DGF to Cartesian DGF, a conformal dipole antenna over a Perfect Electric Conductor (PEC) sphere is analyzed. Mutual couplings between elements of a conformal dipole antenna array in an unbounded free space and over a conducting sphere are also investigated. Good agreement between the results obtained from the proposed method and asymptotic approximation as well as those of commercial simulator packages shows accuracy and high convergence speed of the presented method.}, Keywords = { DGFs transformation, dyadic Green’s function, method of moment, spherical antennas }, volume = {5}, Number = {2}, pages = {35-40}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-158-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-158-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Doost, Roghayeh and Sayadian, Abolghasem}, title = {Speaker-Dependent Speech Enhancement Using Codebook-based Synthesis for Low SNR Applications}, abstract ={In this paper, a speaker-dependent speech enhancement is performed by using the codebooks. For this purpose, making use of the STFT parameters, two codebooks are designed for speech and noise separately. In order to design the speech codebook, an adequate number of sentences of particular speakers are used. Utilizing an estimator based on a perceptually weighted distance function, we start searching within the codebooks to find the true indexes for each noisy frame. After finding the true indexes, we synthesize the enhanced speech by using the selected indexes of the speech codebook. As a modification, we suggest two methods to reduce the search time as follows: firstly, a new method for reduction of the codebook size is described. Secondly, by utilizing the relation between the spectral center-of-gravities of the speech, noise and noisy speech, the search area within the codebooks is effectively reduced. Simulation results show that the proposed method can enhance a noisy speech with low SNR. Moreover, since the proposed method is performed frame by frame and it does not use the previous frames of the noisy speech, therefore this method can enhance the noisy speech contaminated by a highly non-stationary noise.}, Keywords = { Short time Fourier transform (STFT), speech enhancement, codebook }, volume = {5}, Number = {2}, pages = {41-54}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-159-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-159-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Mohajerzadeh, Amir Hossein and Yaghmaee, Mohammad Hossein and Fakoor, Vahi}, title = {Optimized Task Scheduling for Estimation in Wireless Sensor Networks}, abstract ={In this paper, the distributed estimation in Wireless Sensor Network (WSN) using optimal task scheduling is looked upon. The main goal is to prolong network lifetime while the target parameter is estimated with desirable precision. The lifetime is defined as the number of rounds accomplished before network becomes nonfunctional. In order to prolong network lifetime, we determine the optimal number of active sensor nodes and the number of samples provided by each of them based on the degree of certainty (utilizing linear programming). Sensor observations from environment are quantized into messages and then directly forwarded to a fusion center where a final estimation is performed. Simulation results confirm that our optimal proposed algorithm has achieved significant efficiency when compared with other heuristic methods.}, Keywords = { Degree of Certainty, Estimation, Task scheduling, Wireless sensor networks, Network lifetime }, volume = {5}, Number = {2}, pages = {55-62}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-160-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-160-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Ghasemi, Abdorasoul and Fahimi, Mi}, title = {A Mobility Based Cooperative MAC Protocol for Wireless Networks}, abstract ={In this paper, we propose a cooperative MAC protocol based on IEEE 802.11 standard for wireless ad hoc networks. In this protocol, a low data rate direct transmission link is replaced by two faster transmission links using an appropriate relay node. We investigate the challenges and issues of this problem by designing an efficient MAC scheme to improve the network throughput by finding the best relay node. Assuming that the relay node is fixed for a given interval time, the effect of nodes’ mobility in finding the best relay node is investigated. The proposed scheme introduces a solution to improve the throughput and preserve the cooperation stability in the mobile ad hoc networks. To validate the protocol, we compare the results with CoopMAC protocol. Simulation results show that the proposed protocol outperforms the CoopMAC protocol in terms of throughput.}, Keywords = { Cooperative, Diversity, Relay, Helper selection, Throughput, MAC }, volume = {5}, Number = {1}, pages = {1-9}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-161-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-161-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Saadat, Reza and Saadat, Mahmoo}, title = {Non-Homogeneous Cluster Head Selection for Energy-Aware Hierarchical Routing Protocols in Wireless Sensor Networks}, abstract ={In Wireless Sensor Networks (WSNs), sensor nodes are equipped with a limited energy battery. Energy consumption is a very challenging field in WSN. In this paper, we modify the Low Energy Aware Clustering Hierarchy (LEACH) and the Extended LEACH (XLEACH) protocols to increase the lifetime of the network. The main difference of our protocol is based on non-homogenous probability of Cluster Head (CH) selection. We consider a virtual reference node in the protocol. Each node chooses its probability of CH selection properly so that its energy consumption would be close to the energy consumption of the reference node. Our simulation illustrate that the lifetime of the network increases considerably without increasing the complexity of the protocols. According to the simulations, this method makes energy consumption more efficient than the LEACH or XLEACH, and consequently prolongs the network lifetime. Moreover, the modification does not affect the delay in the protocols. }, Keywords = { Wireless Sensor Network (WSN), Routing, Energy efficiency, Network Lifetime, Cluster Head Selection }, volume = {5}, Number = {1}, pages = {11-18}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-162-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-162-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Karimian, Mahmood and Tavassolipour, Mostafa and Kasaei, Shohreh}, title = {A Semi-Supervised Method for Multimodal Classification of Consumer Videos}, abstract ={In large databases, lack of labeled training data leads to major difficulties in classification process. Semi-supervised algorithms are employed to suppress this problem. Video databases are the epitome for such a scenario. Fortunately, graph-based methods have shown to form promising platforms for semi-supervised video classification. Based on multimodal characteristics of video data, different features (SIFT, STIP, and MFCC) have been utilized to build the graph. In this paper, we have proposed a new classification method which fuses the results of manifold regularization over different graphs. Our method acts like a co-training method that tries to find the correct label for unlabeled data during its iterations. But, unlike other co-training methods, it takes into account the unlabeled data in the classification process. After manifold regularization, data fusion is doneby a ranking method which improves the algorithm to become competitive with supervised methods. Our experimental results, run on the CCV database, show the efficiency of the proposed classification method.}, Keywords = { Semi-supervised learning, co-training, video classification, multimodal features }, volume = {5}, Number = {1}, pages = {19-26}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-163-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-163-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {A.Kardan, Ahmad and Modaberi, Somayeh and Noorani, Seyede Fatemeh}, title = {Evaluating the Effect of Learner’s Knowledge, Background, and Attention’s on Trust Using Open Learner Model}, abstract ={The learner model is a distinctive characteristic of any Adaptive Educational Systems (AES) and Intelligent Tutoring Systems (ITS). The learner model not only is the base of adaptation in AES and ITS systems, but also in some way is used for assessment of learners. Hence, the accuracy of learner model is an important issue. In Open Learner Model (OLM), the learner’s belief can change the learner model. Regarding this problem, it should be determined that how much a system can trust in learner’s belief about his/her model and which characteristics of a learner affect on correctness of learner belief. In this paper we investigate if learner knowledge, background and attention have effect on system trust in Open Learner Modeling. We choose these parameters according to their importance in the learning system. To obtain learner’s knowledge and background multiple choice questions are utilized. The value of attention is estimated by Toulouse-Pieron Test. To evaluate the effect of mentioned characteristics of learner the chi-square distribution is used. The obtained results indicate that the value of learner’s knowledge, background and attention affect on trust value.}, Keywords = { learner model, Open learner Model, Learner Model Parameters, Trust value }, volume = {5}, Number = {1}, pages = {27-37}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-164-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-164-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Namdar, Saman and Faili, Hesham and Khadivi, Shahram}, title = {Statistical Machine Translation (SMT) for Highly-Inflectional Scarce-Resource Language}, abstract ={Statistical Machine Translation (SMT) is a machine translation paradigm, in which translations are generated on the base of statistical models. In this system, parameters are derived from an analysis of a parallel corpus, and SMT quality depends on the ability of learning word translations. Enriching the SMT by a suitable morphology analyser decreases out of vocabulary words and dictionary size dramatically. This could be more considerable when it deals with a highly-inflectional, low-resource, language like Persian. Defining a suitable granularity for word segment may improve the alignment quality in the parallel corpus. In this paper different schemes and word’s combinations segments in a SMT’s experiment from Persian to English language are prospected and the best one-to-one alignment, which is called En-like scheme, is proposed. By using the mentioned scheme the translation’s quality from Persian to English is improved about 3 points with respect to BLEU measure over the phrase-based SMT.}, Keywords = { Statistical Machine Translation, Segmentation Schemes, Lexical Granularities, Morpheme, Persian Language }, volume = {5}, Number = {1}, pages = {39-52}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-165-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-165-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Haghollahi, Zohre and ZarehBidoki, Ali Mohammad and Yari, Alirez}, title = {Persian to English Personal Name Transliteration Based On the Persian Web Contents}, abstract ={Personal names are out of dictionary words which are usually primary keys in the web queries. Converting a personal name from source language to target language is transliteration. In this paper, we propose a novel algorithm for transliterating a Persian personal name to an English name. This method consists of two stages. At first, in the offline stage, a graph is made by processing Persian web contents. In this graph, names are related based on their neighboring in the web pages. Afterwards, in online stage, each name is transliterated using this graph and name frequencies. Experimental results show that the algorithm is effective in personal name transliteration.}, Keywords = { Transliteration, Cross Language Information Retrieval, Machine Translation, Personal names, Graph }, volume = {5}, Number = {1}, pages = {53-60}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-166-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-166-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} } @article{ author = {Zaghian, Ali and Mansouri, Mohse}, title = {A New Blind Signature Scheme Based on Improved ElGamal Signature Scheme}, abstract ={Blind signature scheme, an important cryptographic primitive, is applicable in protocols that guarantee the anonymity of the participants. This scheme is increasingly used in untraceable payment and electronic voting systems. In this paper we improve ElGamal signature scheme and then we propose a new blind signature based on that. ElGamal signature scheme has an important advantage into RSA signature scheme which is non-deterministic and means that there are many valid signatures for any given message. This property also exists in our new blind signature scheme. Having low computational complexity for signature requester and the signer is one of the advantages of the newly developed scheme and as a result makes it very efficient.}, Keywords = { digital signature, blind signature, ElGamal digital signature, RSA, electronic payment system, electronic voting system }, volume = {5}, Number = {1}, pages = {61-65}, publisher = {ICT Research Institute(ITRC)}, title_fa = {}, abstract_fa ={}, keywords_fa = {}, url = {http://ijict.itrc.ac.ir/article-1-167-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-167-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2013} }