@article{ author = {Pezhmanpour, Mansoureh and Sheikhan, Mansour and Moin, Mohammad Shahram}, title = {Blind Color Image Steganalysis Based on Multi-Transform Combined Features Selected by a Hybrid of ANOVA and BPSO}, abstract ={Steganalysis techniques have been classified into two major categories: blind steganalysis which is independent of the steganography method and specific steganalysis which attempts to detect specific steganographic media. Feature extraction is an important functional block in the steganalysis systems. The features are commonly in spatial domain or extracted from transform domains such as discrete wavelet transform (DWT), discrete cosine transform (DCT) or contourlet transform (CT). In this paper, a blind color image steganalysis method based on a hybrid set of features (statistical moments, entropy, and co-occurrence matrix features) extracted from a combination of DWT, DCT, and CT is proposed. The hybrid of "analysis of variation (ANOVA)" as an open-loop feature selection method, and "binary particle swarm optimization (BPSO)" as a closed-loop one, is used in this work to improve the detection rate in tandem with significant reduction in the size of feature set. Jsteg, OutGuess, JPHS and model-based steganography methods are attacked in this work. By using the hybrid of "ANOVA+BPSO", the number of features is reduced to 13. Empirical results show that the most discriminative features in clean/stego image classification are statistical moments of co-occurrence matrix of contourlet transform. The most discriminative selected features are fed into a nonlinear support vector machine (SVM) classifier to distinguish the cover and stego images. Average detection accuracy of the proposed model is above 81 percent for the embedding-rate ranges of 5% to 25%.}, Keywords = {Steganalysis, entropy, statistical moments, DCT, DWT, contourlet, co-occurrence matrix }, volume = {2}, Number = {4}, pages = {1-8}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-245-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-245-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Niknafs, Arash and MoghaddamCharkari, Nasrollah and Niknafs, Ali Akbar}, title = {Towards Faster Performance of PROMETHEE II in a Lower Class of Complexity}, abstract ={PROMETHEE II is one of the most popular members of the well-known family of multi-criteria decision making methods. One of the main concerns in developing PROMETHEE-based systems is the rapid growth of the response time as the number of alternatives (n) and criteria (k) grow. PROMETHEE II belongs to the computational complexity class of O(n توان 2). In this paper, a simplified version of PROMETHEE II is proposed and a novel estimation of the simplified PROMETHEE II is introduced. This simplified version reproduces the results of the original method and requires fewer operations. The estimation belongs to the complexity class of O(n log n) and consequently has a shorter response time than that of the simplified version. The proposed simplification and estimation are tested and evaluated with real-world data. When compared to the original PROMETHEE II and even other similar MCDM methods, such as AHP, ELECTRA, and TOPSIS, the experiments reveal the satisfactory results with a considerably reduced computational complexity and response time.}, Keywords = {multi criteria decision making, PROMETHEE II, decision support systems, recommender systems }, volume = {2}, Number = {4}, pages = {9-18}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-246-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-246-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Farshchi, Seyyed Mohammad Reza and NaghibiSistani, Mohammad Bagher}, title = {Document Classification Using Novel Competitive Neural Text Classifier}, abstract ={Text categorization is one of the well studied problems in data mining and information retrieval. Given a large quantity of documents in a data set where each document is associated with its corresponding category. This research proposes a novel approach for English and Persian documents classification with using novel method that combined competitive neural text categorizer with new vectors that we called, string vectors. Traditional approaches to text categorization require encoding documents into numerical vectors which leads to the two main problems: huge dimensionality and sparse distribution. Although many various feature selection methods are developed to address the first problem, the reduced dimension remains still large. If the dimension is reduced excessively by a feature selection method, robustness of document categorization is degraded. The idea of this research as the solution to the problems is to encode the documents into string vectors and apply it to the novel competitive neural text categorizer as a string vector. Extensive experiments based on several benchmarks are conducted. The results indicated that this method can significantly improve the performance of documents classification up to 13.8% in comparison to best traditional algorithm on standard Reuter 21578 dataset.}, Keywords = { Data mining, text categorization, vector based model, competitive neural text categorizer }, volume = {2}, Number = {4}, pages = {19-31}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-247-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-247-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {FarmahiniFarahani, Masoumeh and Ghasemi, Abdorasoul and Razavizadeh, Seyyed Mohamm}, title = {Sequential Interference-Aware Admission Control in Underlay Cognitive Radio Networks}, abstract ={In this paper, a new joint admission and power control scheme is introduced for wireless cognitive radio networks. It is assumed that the Cognitive Users (CUs) arrive sequentially in time and exploit the spectrum simultaneous to the licensed primary users. The objective is to minimize the blocking probability of the new arriving CUs while the interference limit constraint of primary users is not violated and the quality of service (QoS) requirements of the current admitted CUs is satisfied. To these aims, an algorithm is developed for CUs admission in which the power of the new arriving CU gradually increases according to two predefined parameters, Primary Interference Margin (PIM) and Secondary Interference Margin (SIM). In addition to protect the QoS of the current CUs, their powers are boosted by a particular parameter, which is calculated based on PIM and their maximum allowable power. Moreover, the PIM guarantees the protection of the primary users during the admission phase of the new arriving CU. Two admission control algorithms have been proposed, a safe admission which tightly admits a new CU and a moderate one which loosely accepts a new CU. Simulation results are provided to evaluate the performance of the proposed algorithms in terms of the blocking and outage probability and compared with recent proposed schemes. These results show that the proposed algorithms outperform the similar schemes while they are more suitable for a practical scenario.}, Keywords = { Cognitive Radio Network, Underlay Transmission, Admission Control, Power Control }, volume = {2}, Number = {4}, pages = {33-40}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-248-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-248-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Khoshkbarforoushha, Alireza and Aghdasi, Mohammad and Shamsfard, Mehrnoush}, title = {VE Architect-Driven Service-Oriented Business Network Process Realization}, abstract ={Business opportunities are not permanent. Enterprises to instantly meet them collaborate with each other through realizing business network processes (BNP) in which their activities are done with various partners within a network. Recently, these business network processes are enabled with Service-Oriented technologies, that we call them Service-Oriented Business Network Process (SOBNP). In today's dynamic and changing environment Virtual Enterprise (VE) architects require a flexible framework through which they could design and realize SOBNP instantly. In this theme, there exist a number of frameworks that constitute the SOBNP, but they almost neglect two salient issues: a) Covering and incorporating high-level (i.e. business level) and low-level (i.e. technical level) requirement in business process creation; b) Adjusting to the VE architect without deep knowledge of computer science. Thus, the main objective of this paper is to propose a framework and related tools and techniques to constitute SOBNP, as a main building block of Instant Virtual Enterprise (IVE), which address two above-mentioned issues. The framework namely SOBNP Realization consists of three phases including requirements specification, ontology-based partner search and selection, and BPEL (Business Process Execution Language) process synthesis. A prototype system is implemented to demonstrate the concept of VE architect-driven SOBNP realization in IVE.}, Keywords = { Semi-automatic realization of business network process, Service-oriented Business Network Process, Ontology-based partner selection, Instant virtual enterprise, BPEL process }, volume = {2}, Number = {4}, pages = {41-53}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-249-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-249-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Hajimani, Elmira and Nazemi, Eslam}, title = {Improving the Performance of Proposed Multi-Agent Domain Specific Search Engine Using Query Refinement Component}, abstract ={The web size is increasing continuously. The more the Internet is growing; the more tendencies the people have to use the search engines. Moreover, since most of the commercial search engines are based on keyword indexing, there are many records in their result lists that are irrelevant to the user's information needs. It is shown that for retrieving more relevant and precise results, the following two points should be concerned: First of all, the query (either it is generated by a human or an intelligent agent) should be expressed in an accurate and exact manner. Second, we should empower search engines with the ability to capture the semantic relation between the words and the query context. Hence, different search engine architectures, each of which containing query refinement or semantic understanding components, have been proposed. Each architectural model has its own specific properties; but, most of them focus on only one of the two points mentioned above to improve the overall system efficiency. Moreover, in existing architectures, query refinement components have direct interaction with users which may either take their time or threat their privacy while gathering basic information. In this paper, we proposed an improved architectural model for agent and ontology based search engine which uses domain ontology for semantic understanding and a query refinement subsystem based on fuzzy ontology. This subsystem helps Search Agents to refine their queries, express them in a more precise way and get more relevant results. The simulation result shows that using this query refinement subsystem by Search Agents can improve the system efficiency up to 5.2%.}, Keywords = { Search engines, Domain ontology, Fuzzy ontology, intelligent agents, query refinement }, volume = {2}, Number = {4}, pages = {69-78}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-250-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-250-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Basiri, Javad and Shakery, Azadeh and Moshiri, Behzad and Zihayat, Mortez}, title = {Addressing the New User Cold-Start Problem in Recommender Systems Using Ordered Weighted Averaging Operator}, abstract ={Recommender systems have become significant tools in electronic commerce, proposing effectively those items that best meet the preferences of users. A variety of techniques have been proposed for the recommender systems such as, collaborative filtering and content-based filtering. This study proposes a new hybrid recommender system that focuses on improving the performance under the "new user cold-start" condition where existence of users with no ratings or with only a small number of ratings is probable. In this method, the optimistic exponential type of ordered weighted averaging (OWA) operator is applied to fuse the output of five recommender system strategies. Experiments using MovieLens dataset show the superiority of the proposed hybrid approach in the cold-start conditions.}, Keywords = { OWA, hybrid approach, demographic- information, content-based filtering, collaborative filtering, recommender system }, volume = {2}, Number = {4}, pages = {79-87}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-251-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-251-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Gholamzadeh, Nayereh and Taghiyareh, Fattaneh and Shakery, Azadeh}, title = {Fuzzy Clustering for Semantic Web Services Discovery based on Ontology}, abstract ={Web services as the most important event in distributed computing, have achieved great popularity among software developers today. A critical step in the process of developing service-oriented applications is web service discovery, i.e., the identification of existing relevant web services that can potentially be used in the context of a new web application. In this paper, we have proposed a novel method based on data mining techniques to assist and improve the web service discovery process as well as the development of service-oriented applications. Our assistant discovery approach is based on automatic finding of semantic similarity between web services through the application of clustering methods. We have introduced a new fuzzy semantic clustering algorithm which assists web service consumers in discovering a group of similar web services through an individual query. This objective is attained by way of a search space reduction mechanism which adds to the efficiency of the approach. Our proposed approach provides dynamic and flexible clusters which can be changed at discovery process. We have conducted an experimental study on a data set of tagged web services with ontology. The ontology supports the semantic analysis. Preliminary results from clustering indicate the possibility of retrieving web services at the discovery process with reasonable precision by applying the proposed similarity model. From these promising results, we conclude that web service discovery process could be performing in a reasonable time because of reduced search space.}, Keywords = { Fuzzy Clustering, Ontology, Data Mining, Semantic, Web Service Discovery }, volume = {2}, Number = {3}, pages = {1-8}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-252-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-252-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Paydar, Samad and Kahani, Mohsen and Behkamal, Behshid and Dadkhah, Mahboobeh}, title = {Publishing Persian Linked Data; Challenges and Lessons Learned}, abstract ={Linked Data as an important and novel subject has attracted great attention in the realm of the Semantic Web. Many works deal with publishing existing datasets as Linked Data. This paper discusses the challenges of publishing Persian linked data, and their potential solutions, based on the experiences and lessons learned from a project focused on publishing some academic data of the Ferdowsi University of Mashhad as Linked Data.}, Keywords = { Linked Data, Persian Dataset, LOD cloud, RDF, challenges and Solutions }, volume = {2}, Number = {3}, pages = {9-19}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-253-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-253-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Seyedhossein, Leila and Hashemi, Mahmoud Rez}, title = {A Timelier Credit Card Fraud Detection by Mining Transaction Time Series}, abstract ={As e-commerce sales continue to grow, the associated online fraud remains an attractive source of revenue for fraudsters. These fraudulent activities impose a considerable financial loss to merchants, making online fraud detection a necessity. The problem of fraud detection is concerned with not only capturing the fraudulent activities, but also capturing them as quickly as possible. This timeliness is crucial to decrease financial losses. In this research, a profiling method has been proposed for credit card fraud detection. The focus is on fraud cases which cannot be detected at the transaction level. Based on the fact that there are strong periodic patterns in cardholders' behavior, the time series of aggregated daily amounts spent on an individual credit card has been considered in the proposed method. In this method, the inherent periodic and seasonal patterns are extracted from the time series to construct a cardholder's profile. These patterns have been used to shorten the time between when a fraud occurs and when it is finally detected. Simulation results indicate that the new approach has resulted in a timelier fraud detection, improved detection rate and consequently less financial loss in the cases where a cardholder follows a regular or semi regular periodic behavior. The proposed method is equally applicable to other e-payment methods with minor application-specific modifications.}, Keywords = { Fraud detection, aggregatioal profile, time series }, volume = {2}, Number = {3}, pages = {21-28}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-254-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-254-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {S.Mirian, Maryam and Beig, Leila and Kharrat, Mahmoo}, title = {A Multi-Aspect Architecture with Co-alignment between Layers for Intra-Organizational Knowledge Networking Purposes}, abstract ={In this paper, architecture is proposed for the new emerging concept of knowledge networks. This architecture is based on a multi-aspect view to the problem of starting such a network in an organization. By integrating infrastructure, knowledge and business layers mounted on two aspects of human-based and organizational supportive conditions in a layered architecture, we proposed a novel architecture that contains intra-layer built-in assessment mechanisms as well. These assessment mechanisms ensure the gradual refinement of the network as the structure of each layer becomes fixed. In this paper, it has been discussed that how a multi-layer architecture with minimum amount of dependency among layers (that has the ability of interaction in business and knowledge layers) may facilitate knowledge management processes. The architecture can also give some guidelines on how to start such networks in inter-organizational level .One of the main applications of this architecture is to propose appropriate guidelines for the development of required sub-systems of intra­organizational knowledge networks. Therefore, at the end of this paper, the method of extracting these guidelines on the establishment of one of the key sub-systems for managing explicit organizational knowledge (e.g. Document Management system) is explained in details. These recommendations are based on a well-known standard of this domain. As the proposed extraction method is originated from the layers independency and self-assessment mechanism between layers, it can purposefully be re-used for collaboration/experience/process management systems as well.}, Keywords = {Architecture, Knowledge Network, Knowledge Management, Business Strategies }, volume = {2}, Number = {3}, pages = {29-37}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-255-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-255-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Pourjavaheri, Leili and Asoshesh, Abbas}, title = {A New Mathematical Method to Estimate Resources for E-commerce Application}, abstract ={Considering convergence of vast and different technologies in new generation networ . the required quality of service is the key success factor. The site implementation according to special benchmarkinJ(TPC-W), to achieve the acceptable service performance may be offered in a cost effective manner, is very complicated. In this paper a mathematical method will be introduced to help providers to make informed eel ions with respect of right level of resources (number and server capacity, number and power of CPUs, and amo nl of permanent and temporary memory). The numerical results show that the new formulation confirms the re uJt e-commerce site emulation in an acceptable level.}, Keywords = { e-commerce, QoS, resource, TPC-W, emulation, mathematical method }, volume = {2}, Number = {3}, pages = {39-47}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-256-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-256-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Zamani, Mohammad Ali and SharifiKolarijani, Mohammad Amin and Fereidunian, Alireza and Lesani, Hamid and Lucas, Caro}, title = {Adaptive Autonomy Expert System in Smart Grid based on Deterministic Timed Petri Nets}, abstract ={Interaction of humans and computer agents should be harmonized by adapting the utomation level of IT systems, to maintain a high performance for the system, in the changing environmental condition . This research presents an expert system for realization of adaptive autonomy (AA), using deterministic time Petri nets (DTPNs), referred to as AAPNES. The design is based on the practical list of environmental conditions nd superior expert`s judgments. As revealed by the results, the presented AAPNES can effectively determine the proper level of automation for the changing performance shaping factors of human-automation interaction systems in the smart grid.}, Keywords = { adaptive autonomy, expert system, human-computer interaction (HCI), human-automation interaction (HAI), level of automation (LOA), smart grid, power distribution automation }, volume = {2}, Number = {3}, pages = {49-57}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-257-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-257-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {ZiHayat, Morteza and Basiri, Javad and Seyedhossein, Leila and Shakery, Azadeh}, title = {Content-Based Approach for Trfcking Concept Drift in Email Spam Filtering}, abstract ={The continued growth of Email usage, which is naturally followed by an increase i unsolicited emails so called spams, motivates research in spam filtering area. In the context of spam filtering systems, addressing th evolving nature of spams, which leads to obsolete the related models, has been always a challenge. In this paper an adaptive spam filtering system based on language model is proposed which can detect concept drift based on computing the deviation in email contents distribution. The proposed method can be used a ong with any existing classifier; particularly in this paper we use Naive Bayes method as classifier. The proposed method has been evaluated with Enron data set. The results indicate the efficiency of the method in detectin concept drift and its superiority over Naive Bayes classifier in terms of accuracy.}, Keywords = { component, spam.filtering, concept drift, KL divergence, language model }, volume = {2}, Number = {3}, pages = {59-65}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-258-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-258-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Armanfard, Narges and Komeili, Majid and Kabir, Ehsanollah}, title = {A Novel Descriptor for Pedestrian Detection in Video Sequences}, abstract ={This paper presents a novel Texture-Edge Descriptor, TED, for background modeling and pedestrian detection in video sequences which models texture and edge information of each image block simultaneously. Each block is modeled as a group of adaptive TED histograms that are calculated for pixels of the block over a rectangular neighborhood. TED is an 8-bit binary code which is independent of the neighborhood size. Experimental results over real-world sequences from PETS database clearly show that TED outperforms LBP.}, Keywords = { pedestrian detection, texture, edge, block-based approach, background subtraction, surveillance systems }, volume = {2}, Number = {2}, pages = {1-8}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-259-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-259-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Moattar, Mohammad Hossein and Homayounpour, Mohammad Mehdi}, title = {A Robust Voice Activity Detection Based on Short Time Features of Audio Frames and Spectral Pattern of Vowel Sounds}, abstract ={This paper presents a set of voice activity detection (V AD) methods, that are easy to implement, robust against noise, and appropriate for real-time applications. The common characteristic is the use of a voting paradigm in all the proposed methods. In these methods, the decision on the voice activity of a given frame is based on comparing the features obtained from that frame with some thresholds. In the first method, a set of three features, namely frame energy, spectral flatness, and the most dominant frequency component is applied. In the second approach however, the spectral pattern of the frames of vowel sounds is used. To use the strengths of each of the above methods, the combination of these two decision approaches is also put forth in this paper. The performance of the proposed approaches is evaluated on different speech datasets with different noise characteristics and SNR levels. The approaches are compared with some conventional V AD algorithm such as ITU G. 729, AMR and AFE from different points of view. The evaluations show considerable performance improvement of the proposed approaches.}, Keywords = { voice activity detection, spectral flatness, vowel spectral pattern, noise robustness, vowel sounds }, volume = {2}, Number = {2}, pages = {9-19}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-260-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-260-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Hedayati, Alireza and Fesharaki, Mehdi}, title = {Peris: A Novel Dynamic Bandwidth Allocation (DBA) Method with Second-Price Auction in Next Generation Military Networks Based on EPON Technology}, abstract ={In the foreseeable future, networks of access devices that can cooperate and effectively communicate with military backbone infrastructure will significantly influence and simplify military operations. As one of the promising solutions for developing next generation military networks, Ethernet Passive Optical Network (EPON) has received great attention from both industry and academia in recent years. Based on the EPON technology, bandwidth constraint is a critical issue in military communication. In this paper we propose Peris, a novel dynamic bandwidth allocation method with second price auction in next generation military networks based on EPON technology. In this new method, the OL T (similar to the leaders) is responsible for the auction management which effectively and fairly responds to the bandwidth requests of the users through their own ONUs and allocates the winners the amount of requested available bandwidth. Simulation results show that comparing Peris with IPACT, regarding QoS parameters such as packet loss ratio, line utilization and throughput, it has better performance.}, Keywords = { Next Generation Military Network, Ethernet Passive Optical Network (EPON), Bandwidth Allocation, Second­ Price Auction }, volume = {2}, Number = {2}, pages = {21-28}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-261-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-261-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {NaderiDehkordi, Mohammad and Badie, Kambiz and Khademzadeh, Ahm}, title = {A New GA Approach Based on Pareto Ranking Strategy for Privacy Preserving of Association Rule Mining}, abstract ={With fast progress of the networks, data mining and information sharing techniques, the security of the privacy of sensitive information in a database becomes a vital issue to be resolved. The mission of association rule mining is discovering hidden relationships between items in database and revealing frequent itemsets and strong association rules. Some rules or frequent itemsets called sensitive which contains some critical information that is vital or private for its owner. In this paper, we investigate the problem of hiding sensitive knowledge. We decide to hide sensitive knowledge both in frequent patterns and association rule extraction steps. In order to conceal association rules and save the utility of transactions in dataset, we select Genetic Algorithm to find optimum state of modification. In our approach various hiding styles are applied in different multi-objective fitness functions. First objective of these functions is hiding sensitive rules and the second one is keeping the accuracy of transactions in dataset. After sanitization process we test the sanitization performance by evaluation of various criterions. Indeed our novel framework consists of dataset preprocessing, Genetic Algorithm-based core approach and different sanitizing measurements. Finally we establish some experiments and test our approach by larger datasets and compare the performance with well-known existing ones.}, Keywords = { Association Rule Mining, Privacy Preserving, Sensitive Association Rule, Multi-objective Optimization, Genetic Algorithms }, volume = {2}, Number = {2}, pages = {29-41}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-262-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-262-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Saadat, Parinaz and MinaeiBidgoli, Behrouz}, title = {Scaling Up Performance of Web Services by Pre-Serialization Response Analysis}, abstract ={Web services are the inseparable part of many scientific applications. Consider communication between two partial differential equation (PDE) solvers on different domains, such applications work by exchanging large arrays containing floating point data with high accuracy. The reliance of web services on SOAP leads to performance degradation in similar scenarios as the serialization of outgoing messages containing large arrays of doubles is a primary SOAP performance bottleneck. Various aspects of this problem are examined from the point of views including alternative formats, XML coding compression, differential serialization, differential de-serialization, etc. This paper proposes an approach which combines the idea behind differential serialization and differential de-serialization with a completely different implementation.}, Keywords = { web services, serialization, performance, SOAP }, volume = {2}, Number = {2}, pages = {43-49}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-263-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-263-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Faili, Heshaam and Azadnia, Mohamm}, title = {The First Persian Context Sensitive Spell Checker}, abstract ={In this article an attempt to introduce the first Persian context sensitive spell checker, which tries to detect and correct the :eat-word spelling error of Persian text is presented. The proposed method is a statistical approach which uses Bayesian framework as its probabilistic model and also uses mutual information metric as a semantic relatedness measure between different Persian words. Our experiments on sample test data, shows that accuracy of correction method is about 80% with respect to Fl-measure.}, Keywords = { Persian language, real-word error, Bayesian framework, mutual information }, volume = {2}, Number = {2}, pages = {51-59}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-264-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-264-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {ShamsEsfandAbadi, Mohammad and Palangi, Hami}, title = {The Unified Approach to Set-Membership and Selective Partial Update Adaptive Filtering Algorithms}, abstract ={In this paper we show how the classical and modern adaptive filter algorithms can be introduced in a unified way. The Max normalized least mean squares (MAX-NLMS), N-Max NLMS, the family of SPU-NLMS, SPU transform domain adaptive filter (SPU-TDAF), and SPU subband adaptive filter (SPU-SAF) are particular algorithms are established in a unified way. Following this, the concept of set-membership (SM) adaptive filtering is extended to this framework, and a unified approach to derivation of SM and SM-SPU adaptive filters is presented. The SM-NLMS, SM-TDAF, SM-SAF, SM-SPU-NLMS, and SM-SPUSAF are presented based on this approach. Also, this concept is extended to the SPU affine projection (SPU-AP) and SPUTDAF algorithms and two new algorithms which are called SM-SPU-AP and SM-SPU-TDAF algorithms, are established. These novel algorithms are computationally efficient. The good performance of the presented algorithms is demonstrated in system identification application.}, Keywords = { Adaptive filter, selective partial update, set-membership }, volume = {2}, Number = {2}, pages = {61-70}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-265-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-265-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Mowlaee, Pejman and Sayadiyan, Abolghasem and SheikhzadehNadjar, Hami}, title = {VQ-based Approach to Single-Channel Audio Separation for Music and Speech Mixtures}, abstract ={In this paper, we propose a low-complexity model-based single-channel audio separation approach. The proposed method presents three certain advantages over previous methods: I) replacing commonly used linear masks like Wiener filtering by a proposed non-linear one, we show that it is possible to lower the crosstalk of the interfering source often occurring in a mask-based method while recovering the underlying signals from the observed mixture. Using nonlinear masks establishes a tradeoff between acceptable level of interference and low speech distortion, 2) as a post-processing stage, we use phase synchronization technique to enhance the perceptual quality of the re­synthesized signals, and 3) the proposed method is based on vector quantization {VQ) codebooks. Hence, the complexity is lower than previous GMM-based methods. Through extensive experiments, it is demonstrated that the proposed method can achieve a lower signal-to-distortion ratio (SDR). According to our listening experiments and according to the Mean Opinion Score (MOS) results, it is confirmed that the proposed method is able to recover separated outputs with a higher perceived signal quality.}, Keywords = { vector quantization, nonlinear mask, audio source separation, model-based method, signal-to-distortion ratio }, volume = {2}, Number = {1}, pages = {1-10}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-266-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-266-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Nezamfar, Hooman and Kahaei, Mohammad Hossei}, title = {A Maximum Likehood Frequency Offset Estimation with Improved Range ad Performance in OFDM Systems}, abstract ={Maximum Likelihood (ML) estimation of the frequency offset between the transmitter and the receiver from known transmitted preambles is the dominant technique for the estimation of Carrier Frequency Offset (CFO) in OFDM systems. A general formulation of ML detection problem for OFDM systems is provided in this paper and it is described how different ML techniques can be treated as special cases. In addition, major newly proposed ML techniques are compared in a unified simulation framework in the presence of A WGN and their performance in terms of estimation range and complexity is compared. Furthermore, we proposed two new preamble structures which have comparable complexity to the simplest available methods while their estimation ranges are fairly large, comparable to the largest achieved ranges.}, Keywords = { Orthogonal frequency division multiplexing (OFDM), Carrier Frequency, Offset, Maximum Likelihood }, volume = {2}, Number = {1}, pages = {11-19}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-267-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-267-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Rezaee, Morteza and Nourinia, Javad and Ghobadi, Changiz}, title = {Multiband Hybrid Loop/Monopole Slot/Planar Monopole Antenna for Mobile Phone Application}, abstract ={In this paper, a novel planar hybrid multiband antenna formed by a loop-type antenna, a monopole slot antenna, and a coupled planar monopole antenna for the mobile phone is proposed. The loop-type antenna comprises a driven monopole and a coupled strip that printed on the other side of the substrate and short-circuited to the ground. The 0.51 and 1.01 mode of the loop-type antenna are excited. Therefor,e, the 0.51 mode of the loop-type antenna forms a wide bandwidth of 326 MHz to cover the GSM850/900 operation and the 0.251 mode of the monopole slot antenna, the 1.01 mode of the loop-type antenna, and the 0.25A mode of the coupled monopole antenna provide a wide bandwidth of 1181 MHz to cover the GPS/DCS/PCS/UMTS/WLAN2.4/WiMAX operation. Finally, the 0.51 mode of the coupled monopole antenna forms a wide bandwidth to cover the WLAN5.2 operation. Moreover, the hybrid antenna occupies a compact area of 16.5 x 45 mm2 and it has good radiation characteristics over the operating bands.}, Keywords = { mobile phone antennas, multiband antennas, planar monopole antennas, loop-type antennas, monopole slot antennas, hybrid antennas }, volume = {2}, Number = {1}, pages = {21-27}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-268-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-268-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Hajian, Sara and Hendessi, Faramarz and Berenjkoub, Mehdi}, title = {A Taxonomy for Network Vulnerabilities}, abstract ={The number of reported vulnerabilities is dramatically rising every year. In addition, the combination of different kinds of network devices, services and applications in a complex manner lead to increase the complexity of vulnerabilities. Increasing the number of vulnerabilities and their complications show the importance of vulnerability taxonomies which could provide a common language for defining vulnerabilities and help analyze and assess them. Both the advantages of using vulnerability taxonomies and the features of the taxonomies that have ever been suggested encouraged us to offer the new network vulnerability taxonomy. Our proposed taxonomy is a multi­dimensional and hierarchical taxonomy which classifies network vulnerabilities based on their location, cause and impact. These are three dimensions of our taxonomy. We use ITU-T X-805 security architecture to provide a comprehensive layered classification for the location dimension and also use common weakness enumeration (CWE) project to provide a complete layered classification for the cause dimension of the proposed taxonomy. Finally, we evaluate our taxonomy based on taxonomy requirements. In addition, to demonstrate the usefulness of our taxonomy, a case study applies the taxonomy to a number of network vulnerabilities. We also use this taxonomy to analyze network vulnerabilities. The result of our analysis is a matrix that demonstrates the distribution of network vulnerabilities based on their causes, locations and impacts. In addition to offering a taxonomy that is specific to network vulnerabilities and is beneficial for analyzing network vulnerabilities by covering almost all possible combinations of causes, locations, and impacts, we also introduce and consider network activities in the classification of location dimension for the first time.}, Keywords = { network vulnerabilities, ITU-T X-805 security architecture, common weakness enumeration, (CWE), network vulnerability analysis }, volume = {2}, Number = {1}, pages = {29-44}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-269-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-269-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {RaiyatAliabadi, Maryam and Khademzadeh, Ahmad and RaiyatAliabadi, Mohamm}, title = {A Novel Scheme for Fault-Tolerant And Higher Capacity Network on Chip}, abstract ={As CMOS technology scales down, NoC (Network on Chip) gradually becomes the mainstream of on­chip communication. In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. Consequently, this work examines fault tolerant communication algorithms for use in the Communication Networks including NoC domain. Before two different flooding algorithms, a random walk algorithm and an Intermediate Node Algorithm have been investigated. The first three algorithms have an exceedingly high communication overhead and cause huge congestion in usual traffics. The fourth one which is Intermediate Node algorithm is a static fault-tolerant algorithm which focuses on the faults knowing in advance where they are located. We have developed a new dynamic algorithm based on intermediate node concept and stress value concept to overcome all of blind sides of mentioned algorithms. We have designed a switch/router base on this algorithm and simulated by MAX PLUS II tool and verified it on a mesh NoC in Xilinx environment.}, Keywords = { CMOS technology, Network on Chip, Communication Networks, MAX PLUS II, mesh NoC in Xilinx, flooding algorithms }, volume = {2}, Number = {1}, pages = {45-51}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-270-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-270-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Aminian, Amir Masoud and Molavi-kakhki, Mohamm}, title = {A Hammerstein Diversity Combining Technique}, abstract ={In wireless communication channels fading phenomenon imposes serious limitations upon the system performance. Diversity combining is a well known fading compensation technique. In this paper we propose a diversity combining technique based on a nonlinear Hammerstein type filter to mitigate the destructive fading effect. In the present work, frequency selective Rayleigh fading channels in presence of additive white gaussian noise are considered and m-ary PAM modulation is employed. We first present a theoretical analysis to justify our proposed system. Then the system performance for different power delay profiles and different m-ary PAM modulations are investigated. Comparison of simulation results based on our proposed technique with the results obtained when linear equalizing filters are employed, shows that our technique leads to a considerably higher BER performance at higher SNRs. We also show that our method has a lower complexity than the linear structure. Also, a relative reliability factor for the system is defined and investigated.}, Keywords = { nonlinear diversity combining, Hammerstein filter, nonlinear equalizer, frequency selective fading channel }, volume = {2}, Number = {1}, pages = {53-63}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-271-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-271-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} } @article{ author = {Homayounpour, Mohammad Mehdi and SoltaniPanah, Arezou}, title = {Speech Acts Classification of Persian Language Texts Using Three Machine Leaming Methods}, abstract ={The objective of this paper is to design a system to classify Persian speech acts. The driving vision for this work is to provide inteUigent systems such as text to speech, machine translation, text summarization, etc. that are sensitive to the speech acts of the input texts and can pronounce the corresponding intonation correctly. Seven speech acts were considered and 3 classification methods including (1) Naive Bayes, (2) K-Nearest Neighbors (KNN), and (3) Tree learner were used. The performance of speech act classification was evaluated using these methods including 10- Fold Cross-Validation, 70-30 Random Sampling and Area under ROC. KNN with an accuracy of 72% was shown to be the best classifier for the classification of Persian speech acts. It was observed that the amount of labeled training data had an important role in the classification performance.}, Keywords = {Speech act, Persian language,, text processing, Text To Speech, Naive Bayes, K-Nearest Neighbors, Tree learner }, volume = {2}, Number = {1}, pages = {65-71}, publisher = {ICT Research Institute(ITRC)}, url = {http://ijict.itrc.ac.ir/article-1-272-en.html}, eprint = {http://ijict.itrc.ac.ir/article-1-272-en.pdf}, journal = {International Journal of Information and Communication Technology Research}, issn = {2251-6107}, eissn = {2783-4425}, year = {2010} }