﻿<?xml version="1.0" encoding="utf-8"?><ArticleSet><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Improving Image Dynamic Range For An Adaptive Quality Enhancement Using Gamma Correction</ArticleTitle><VernacularTitle>Improving Image Dynamic Range For An Adaptive Quality Enhancement Using Gamma Correction</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi" /><Language>en</Language><AuthorList><Author><FirstName>Hamid</FirstName><LastName>Hassanpour</LastName><Affiliation>Shahrood University of Technology</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2017</Year><Month>1</Month><Day>3</Day></History><Abstract>This paper proposes a new automatic image enhancement method by improving the image dynamic range. The improvement is performed via modifying the Gamma value of pixels in the image. Gamma distortion in an image is due to the technical limitations in the imaging device, and impose a nonlinear effect. The severity of distortion in an image varies  depends on the texture and depth of the objects. The proposed method locally estimates the Gamma values in an image. In this method, the image is initially segmented using a pixon-based approach. Pixels in each segment have similar characteristics in terms of the need for Gamma correction. Then the Gamma value for each segment is estimated by minimizing the homogeneity of co-occurrence matrix. This feature can represent image details. The minimum value of this feature in a segment shows maximum details of the segment. The quality of an image is improved once more details are presented in the image via Gamma correction. In this study, it is shown that the proposed method performs well in improving the quality of images. Subjective and objective image quality assessments performed in this study attest the superiority of the proposed method compared to the existing methods in image quality enhancement.</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Image Enhancement
</Param></Object><Object Type="Keyword"><Param Name="Value">Gamma Correction
</Param></Object><Object Type="Keyword"><Param Name="Value">Segmentation
</Param></Object><Object Type="Keyword"><Param Name="Value">Co-Occurrence Matrix
</Param></Object><Object Type="Keyword"><Param Name="Value">Homogeneity</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14989</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Representing a Content-based link Prediction Algorithm in Scientific Social Networks</ArticleTitle><VernacularTitle>Representing a Content-based link Prediction Algorithm in Scientific Social Networks</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.001</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Hosna</FirstName><LastName>Solaimannezhad</LastName><Affiliation>Tehran University</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>omid</FirstName><LastName>fatemi</LastName><Affiliation>Tehran University</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2017</Year><Month>4</Month><Day>23</Day></History><Abstract>Predicting collaboration between two authors, using their research interests, is one of the important issues that could
improve the group researches. One type of social networks is the co-authorship network that is one of the most widely
used data sets for studying. As a part of recent improvements of research, far much attention is devoted to the
computational analysis of these social networks. The dynamics of these networks makes them challenging to study. Link
prediction is one of the main problems in social networks analysis. If we represent a social network with a graph, link
prediction means predicting edges that will be created between nodes in the future. The output of link prediction
algorithms is using in the various areas such as recommender systems. Also, collaboration prediction between two authors
using their research interests is one of the issues that improve group researches. There are few studies on link prediction
that use content published by nodes for predicting collaboration between them. In this study, a new link prediction
algorithm is developed based on the people interests. By extracting fields that authors have worked on them via analyzing
papers published by them, this algorithm predicts their communication in future. The results of tests on SID dataset as coauthor
dataset show that developed algorithm outperforms all the structure-based link prediction algorithms. Finally, the
reasons of algorithm’s efficiency are analyzed and presented</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Link prediction
</Param></Object><Object Type="Keyword"><Param Name="Value">Social networks
</Param></Object><Object Type="Keyword"><Param Name="Value">Content-based
</Param></Object><Object Type="Keyword"><Param Name="Value">Interest </Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/15025</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Investigating the Effect of Functional and Flexible Information Systems on Supply Chain Operation: Iran Automotive Industry</ArticleTitle><VernacularTitle>Investigating the Effect of Functional and Flexible Information Systems on Supply Chain Operation: Iran Automotive Industry</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.005</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Abbas</FirstName><LastName>Zareian</LastName><Affiliation>Mazandaran University of Science and Technology,Babol,Iran.</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Iraj</FirstName><LastName>Mahdavi</LastName><Affiliation>Mazandaran University of Science and Technology,Babol,Iran.</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Hamed</FirstName><LastName>Fazlollahtabar</LastName><Affiliation>Iran University of Science and Technology,Tehran,Iran</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2016</Year><Month>11</Month><Day>16</Day></History><Abstract>This research studies the relationship between supply chain and information system strategies, their effects on supply
chain operation and functionality of an enterprise. Our research encompasses other ones because it uses a harmonic
structure between information systems and supply chain strategies in order to improve supply chain functionality. The
previous research focused on effects of information systems on modification of the relationship between supply chain
strategies and supply chain function. We decide to evaluate direct effects of information systems on supply chain
strategies. In this research, we show that information systems strategy to improve the relationship between supply chain
and supply chain strategies will be. Therefore, it can be said that creating Alignment between informational system
strategy and supply chain strategies finally result in improvement of supply chain functionality and company’s operation.</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Functional informational systems
</Param></Object><Object Type="Keyword"><Param Name="Value">flexible informational systems
</Param></Object><Object Type="Keyword"><Param Name="Value">supply chain performance</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14977</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Analysis of Business Customers’ Value Network Using Data Mining Techniques</ArticleTitle><VernacularTitle>Analysis of Business Customers’ Value Network Using Data Mining Techniques</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.003</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Forough</FirstName><LastName>Farazzmanesh (Isvand)</LastName><Affiliation>Department of Information Technology, Faculty of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Monireh</FirstName><LastName>Hosseini</LastName><Affiliation>Department of Information Technology, Faculty of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2017</Year><Month>6</Month><Day>15</Day></History><Abstract>In today's competitive environment, customers are the most important asset to any company. Therefore companies
should understand what the retention and value drivers are for each customer. An approach that can help consider
customers‘ different value dimensions is the value network. This paper aims to introduce a new approach using data
mining techniques for mapping and analyzing customers‘ value network. Besides, this approach is applied in a real case
study. This research contributes to develop and implement a methodology to identify and define network entities of a
value network in the context of B2B relationships. To conduct this work, we use a combination of methods and
techniques designed to analyze customer data-sets (e.g. RFM and customer migration) and to analyze value network. As a
result, this paper develops a new strategic network view of customers and discusses how a company can add value to its
customers. The proposed approach provides an opportunity for marketing managers to gain a deep understanding of their
business customers, the characteristics and structure of their customers‘ value network. This paper is the first contribution
of its kind to focus exclusively on large data-set analytics to analyze value network. This new approach indicates that
future research of value network can further gain the data mining tools. In this case study, we identify the value entities of
the network and its value flows in the telecommunication organization using the available data in order to show that it can
improve the value in the network by continuous monitoring.
</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Business-to-business Marketing</Param></Object><Object Type="Keyword"><Param Name="Value">
</Param></Object><Object Type="Keyword"><Param Name="Value"> Business Customers’ Value Network</Param></Object><Object Type="Keyword"><Param Name="Value">
</Param></Object><Object Type="Keyword"><Param Name="Value"> Market Segmentation</Param></Object><Object Type="Keyword"><Param Name="Value"> 
</Param></Object><Object Type="Keyword"><Param Name="Value">Data Mining</Param></Object><Object Type="Keyword"><Param Name="Value">
</Param></Object><Object Type="Keyword"><Param Name="Value"> Telecommunication Industry</Param></Object><Object Type="Keyword"><Param Name="Value">
</Param></Object><Object Type="Keyword"><Param Name="Value"> Value Network Analysis</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/15030</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>De-lurking in Online Communities Using Repost Behavior Prediction Method</ArticleTitle><VernacularTitle>De-lurking in Online Communities Using Repost Behavior Prediction Method</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.006</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Omid R.</FirstName><LastName>B. Speily</LastName><Affiliation>Urmia University of Technology</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2016</Year><Month>9</Month><Day>10</Day></History><Abstract>Nowadays, with the advent of social networks, a big change has occurred in the structure of web-based services.
Online community (OC) enable their users to access different type of Information, through the internet based structure
anywhere any time. OC services are among the strategies used for production and repost of information by users
interested in a specific area. In this respect, users become members in a particular domain at will and begin posting.
Considering the networking structure, one of the major challenges these groups face is the lack of reposting behavior.
Most users of these systems take up a lurking position toward the posts in the forum. De-lurking is a type of social media
behavior where a user breaks an "online silence" or habit of passive thread viewing to engage in a virtual conversation.
One of the proposed ways to improve De-Lurking is the selection and display of influential posts for each individual.
Influential posts are so selected as to be more likely reposted by users based on each user's interests, knowledge and
characteristics. The present article intends to introduce a new method for selecting k influential posts to ensure increased
repost of information. In terms of participation in OCs, users are divided into two groups of posters and lurkers. Some
solutions are proposed to encourage lurking users to participate in reposting the contents. Based on actual data from
Twitter and actual blogs with respect to reposts, the assessments indicate the effectiveness of the proposed method.</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">De-Lurking
</Param></Object><Object Type="Keyword"><Param Name="Value"> Post Similarity
</Param></Object><Object Type="Keyword"><Param Name="Value">Lurker
</Param></Object><Object Type="Keyword"><Param Name="Value">Online Community</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14944</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Concept Detection in Images Using SVD Features and Multi-Granularity Partitioning and Classification</ArticleTitle><VernacularTitle>Concept Detection in Images Using SVD Features and Multi-Granularity Partitioning and Classification</VernacularTitle><FirstPage>172</FirstPage><LastPage>182</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.004</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Kamran </FirstName><LastName>Farajzadeh </LastName><Affiliation>Islamic Azad University, North Tehran branch</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Esmail </FirstName><LastName>Zarezadeh </LastName><Affiliation>Amir Kabir University</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Jafar</FirstName><LastName>Mansouri</LastName><Affiliation> Ferdowsi university of Mashhad</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2016</Year><Month>10</Month><Day>24</Day></History><Abstract>New visual and static features, namely, right singular feature vector, left singular feature vector and singular value
feature vector are proposed for the semantic concept detection in images. These features are derived by applying singular
value decomposition (SVD) "directly" to the "raw" images. In SVD features edge, color and texture information is
integrated simultaneously and is sorted based on their importance for the concept detection. Feature extraction is
performed in a multi-granularity partitioning manner. In contrast to the existing systems, classification is carried out for
each grid partition of each granularity separately. This separates the effect of classifications on partitions with and without
the target concept on each other. Since SVD features have high dimensionality, classification is carried out with K-nearest
neighbor (K-NN) algorithm that utilizes a new and "stable" distance function, namely, multiplicative distance.
Experimental results on PASCAL VOC and TRECVID datasets show the effectiveness of the proposed SVD features and
multi-granularity partitioning and classification method</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">High-dimensional data
</Param></Object><Object Type="Keyword"><Param Name="Value">multi-granularity partitioning and classification
</Param></Object><Object Type="Keyword"><Param Name="Value">multiplicative distance
</Param></Object><Object Type="Keyword"><Param Name="Value">semantic concept detection
</Param></Object><Object Type="Keyword"><Param Name="Value">static visual features
</Param></Object><Object Type="Keyword"><Param Name="Value">SVD</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14972</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>Good Index Choosing for Polarized Relay Channel</ArticleTitle><VernacularTitle>Good Index Choosing for Polarized Relay Channel</VernacularTitle><FirstPage>1</FirstPage><LastPage>10</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.007</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Hassan</FirstName><LastName>Tavakoli</LastName><Affiliation>University of guilan</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Saeid</FirstName><LastName>Pakravan</LastName><Affiliation>University of guilan</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2016</Year><Month>11</Month><Day>8</Day></History><Abstract>The Polar coding is a method which have been proposed by Arikan and it is one of the first codes that achieve the capacity for vast numerous channels. This paper discusses relay channel polarization in order to achieve the capacity and it has been shown that polarization of two relay channels can be given a more achievable rate region in the general form. This method is compatible with the original vision of polarization based on the combining, splitting and polarizing of channels and it has been shown that the complexity of encoding and decoding for these codes in mentioned method are O(N log⁡〖N)〗, and also error probability for them is O(2^(〖-(N)〗^β )). Choose the best sub-channels in polarized relay channels for sending data is a big trouble in this structure. In this paper, we have been presented a new scheme for choosing a good index for sending the information bits in relay channels polarized in order to have the best performance by using sending information bits over FIF sets.</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Relay channel
</Param></Object><Object Type="Keyword"><Param Name="Value">Polar code
</Param></Object><Object Type="Keyword"><Param Name="Value">Channel polarization
</Param></Object><Object Type="Keyword"><Param Name="Value">Capacity
</Param></Object><Object Type="Keyword"><Param Name="Value">Relay channel polarization
</Param></Object><Object Type="Keyword"><Param Name="Value">Good index of relay channel</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14974</ArchiveCopySource></ARTICLE><ARTICLE><Journal><PublisherName>مرکز منطقه ای اطلاع رسانی علوم و فناوری</PublisherName><JournalTitle>Journal of Information Systems and Telecommunication (JIST) </JournalTitle><ISSN>2322-1437</ISSN><Volume>5</Volume><Issue>19</Issue><PubDate PubStatus="epublish"><Year>2017</Year><Month>11</Month><Day>12</Day></PubDate></Journal><ArticleTitle>A RFMV Model and Customer Segmentation Based on Variety of Products</ArticleTitle><VernacularTitle>A RFMV Model and Customer Segmentation Based on Variety of Products</VernacularTitle><FirstPage>155</FirstPage><LastPage>161</LastPage><ELocationID EIdType="doi">10.7508/jist.2017.19.002</ELocationID><Language>en</Language><AuthorList><Author><FirstName>Saman </FirstName><LastName>Qadaki Moghaddam</LastName><Affiliation>Department of Electrical, Computer and IT Engineering, Qazvin Azad University, Qazvin, Iran</Affiliation><Identifier Source="ORCID" /></Author><Author><FirstName>Neda</FirstName><LastName>Abdolvand</LastName><Affiliation>Alzahra University</Affiliation><Identifier Source="ORCID">0000-0003-3623-1284</Identifier></Author><Author><FirstName>Saeedeh</FirstName><LastName>Rajaee Harandi</LastName><Affiliation>Department of Social Science and Economics, Alzahra University, Tehran, Iran</Affiliation><Identifier Source="ORCID" /></Author></AuthorList><History PubStatus="received"><Year>2016</Year><Month>12</Month><Day>19</Day></History><Abstract>Today, increased competition between organizations has led them to seek a better understanding of customer behavior
through innovative ways of storing and analyzing their information. Moreover, the emergence of new computing
technologies has brought about major changes in the ability of organizations to collect, store and analyze macro-data.
Therefore, over thousands of data can be stored for each customer. Hence, customer satisfaction is one of the most
important organizational goals. Since all customers do not represent the same profitability to an organization,
understanding and identifying the valuable customers has become the most important organizational challenge. Thus,
understanding customers’ behavioral variables and categorizing customers based on these characteristics could provide
better insight that will help business owners and industries to adopt appropriate marketing strategies such as up-selling
and cross-selling. The use of these strategies is based on a fundamental variable, variety of products. Diversity in
individual consumption may lead to increased demand for variety of products; therefore, variety of products can be used,
along with other behavioral variables, to better understand and categorize customers’ behavior. Given the importance of
the variety of products as one of the main parameters of assessing customer behavior, studying this factor in the field of
business-to-business (B2B) communication represents a vital new approach. Hence, this study aims to cluster customers
based on a developed RFM model, namely RFMV, by adding a variable of variety of products (V). Therefore, CRISP-DM
and K-means algorithm was used for clustering. The results of the study indicated that the variable V, variety of products,
is effective in calculating customers’ value. Moreover, the results indicated the better customers clustering and valuation
by using the RFMV model. As a whole, the results of modeling indicate that the variety of products along with other
behavioral variables provide more accurate clustering than RFM model.</Abstract><ObjectList><Object Type="Keyword"><Param Name="Value">Clustering
</Param></Object><Object Type="Keyword"><Param Name="Value"> Data Mining
</Param></Object><Object Type="Keyword"><Param Name="Value"> Customer Relationship Management
</Param></Object><Object Type="Keyword"><Param Name="Value"> Product Variety
</Param></Object><Object Type="Keyword"><Param Name="Value"> RFM Model
</Param></Object></ObjectList><ArchiveCopySource DocType="Pdf">http://jist.ir/en/Article/Download/14983</ArchiveCopySource></ARTICLE></ArticleSet>