<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Watermarking Scheme Based on Multiple Chaotic Maps</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>9</LastPage>
			<ELocationID EIdType="pii">94</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.94</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>J.</FirstName>
					<LastName>Ayubi</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>F.</FirstName>
					<LastName>Mohanna</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Mohanna</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Rezaei</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>a watermarking scheme for Grayscale image is&lt;br /&gt;proposed based on a family of the chaotic maps and discrete&lt;br /&gt;cosine transform. Jacobian Elliptic mapis employed to encrypt of&lt;br /&gt;watermarked logo. Piecewise nonlinear chaotic map is also used&lt;br /&gt;to determine the location of DCT coefficients for the watermark&lt;br /&gt;embedding. The purpose of this algorithm is to improve the&lt;br /&gt;shortcoming of watermarking such as small key space and low&lt;br /&gt;security. Therefore the size of key space for initial conditions and&lt;br /&gt;control parameters is computed about and this key&lt;br /&gt;space is large enough to resist the attacks. Toevaluate the&lt;br /&gt;robustness and effectiveness of proposed method, several attacks&lt;br /&gt;are applied to the</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Blind Digital Image Watermarking</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Chaos</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Discrete
Cosine Transform</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multiple Chaotic Maps</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Jacobian Eliptic Map</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Piecewise nonlinear chaotic Map</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_94_956a72097dca392b5b9792a6a9b8c539.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Recursive Approximation Approach of non-iid Lognormal Random Variables Summation in Cellular Systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>10</FirstPage>
			<LastPage>14</LastPage>
			<ELocationID EIdType="pii">95</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.95</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>R.</FirstName>
					<LastName>Abaspour</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Mehrjoo</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Mohanna</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Rezaei</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Co-channel interference is a major factor in limiting the capacity and link quality in cellular communications. As the co-channel interference is modeled by lognormal distribution, sum of the co-channel interferences of neighboring cells is represented by the sum of lognormal Random Variables (RVs) which has no closed-form expression. Assuming independent, identically distributed (iid) RVs, the sum of lognormal RVs has been approximated by another log-normally distributed RV in the literature. In practice, the co-channel interference RVs have identical standard deviations (SDs) and different means. In this paper, first a new method based on curve fitting is proposed to approximate the sum of two log-normally distributed RV&#039;s with identical SDs and different means. Then a recursive method using the surface fitting is developed for approximating the sum of more than two lognormal RVs. Results show that the proposed method can approximate the first and the second moments of the resulting RV very well.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">approximation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Co-Channel Interference</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cumulative Distribution Function (CDF)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Curve Fitting</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Lognormal Distribution</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Recursive</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Surface Fitting</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_95_6805158886914e6c18d95d2996e67479.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>15</FirstPage>
			<LastPage>18</LastPage>
			<ELocationID EIdType="pii">96</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.96</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Najimi</LastName>
<Affiliation>Department of Electrical Engineering, K. N. Toosi University of Technology</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Sayad Haghighi</LastName>
<Affiliation>Department of Electrical Engineering,
K. N. Toosi University of Technology</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Many performance evaluations for IEEE 802.11&lt;br /&gt;distributed coordination function (DCF) have been previously&lt;br /&gt;reported in the literature. Some of them have clearly indicated&lt;br /&gt;that 802.11 MAC protocol has poor performance in multi-hop&lt;br /&gt;wireless ad hoc networks due to exposed and hidden node&lt;br /&gt;problems. Although RTS/CTS transmission scheme mitigates&lt;br /&gt;these phenomena, it has not been successful in thoroughly&lt;br /&gt;omitting these drawbacks. We argue that when eliminating&lt;br /&gt;hidden node effect with a given protocol is not feasible, one&lt;br /&gt;may sometimes earn more throughput by controlling or even&lt;br /&gt;wisely creating this phenomenon. In this paper we propose a&lt;br /&gt;novel solution to improve the performance of IEEE 802.11&lt;br /&gt;MAC protocol in multi-hop networks through modifying NAV&lt;br /&gt;timer. We may call this method Dynamic NAV (DNAV) since&lt;br /&gt;the NAV timer operation changes dynamically with the change&lt;br /&gt;of environment variables. Simulation results show that our&lt;br /&gt;approach noticeably increases the throughput in multi-hop&lt;br /&gt;wireless ad-hoc networks.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multi-hop ad hoc networks</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hidden node effect</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Medium Access Control Protocol</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">IEEE 802.11 standard</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_96_d68806ecafeaf38116691f6ea712a046.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Add-Drop and Channel-Drop Optical Filters Based on Photonic Crystal Ring Resonators</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>19</FirstPage>
			<LastPage>24</LastPage>
			<ELocationID EIdType="pii">97</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.97</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Tavousi</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M. A.</FirstName>
					<LastName>Mansouri-Birjandi</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Saffari</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Here, we propose an add-drop and a channel drop filter based on two-dimensional photonic crystal all circular ring resonators. These structures are made of a square lattice of silicon rods with the refractive index n1=3.464 surrounded by air (with refractive index n2=1). The broadest photonic band gap occurs at the filling ratio of r/a = 0.17. Two linear defect W1 waveguides couple to the ring. Our add-drop and channel drop filters form by the appropriate coupling distance between the ring and waveguide. The dropping efficiency of both filters in their operational window - the C (1.535-1.565μm) and L (1.565-1.625μm) bands of optical telecommunications - is almost %100 and corresponds to a deca-pole degenerated resonant mode. Normalized frequencies (a/λ), in degenerated mode equal to 0.3684 and 0.3645. Resonant modes of the all circular ring resonator with their corresponding degenerated poles and the transmission spectra are calculated using the PWE, and 2D-FDTD methods respectively.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">add-drop filter</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">channel drop filter</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">photonic crystal</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ring resonator</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_97_6c1403e353f8b98ef7b2b761bc5d5eec.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Novel Small E–Ring Shaped Monopole Antenna with Dual Band-Notch Function for UWB Wireless Communications</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>25</FirstPage>
			<LastPage>28</LastPage>
			<ELocationID EIdType="pii">98</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.98</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>N.</FirstName>
					<LastName>Ojaroudi</LastName>
<Affiliation>Islamic Azad University, Ardabil Branch</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Ojaroudi</LastName>
<Affiliation>Islamic Azad University, Ardabil Branch</Affiliation>

</Author>
<Author>
					<FirstName>S.</FirstName>
					<LastName>Amiri</LastName>
<Affiliation>Iranian Research Organization for Science and Technology (IROST)</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents an E-ring shaped printed monopole antenna for UWB applications with dual notched bands performance. In order to generate single frequency band notch function, we applied a U-ring shaped monopole antenna, and by inserting a rectangular ring in the centre of it an E-ring shaped radiating patch created and a dual band-notch function can be achieved. The measured bandwidth of the proposed antenna is from 2.75 GHz to 11.43 GHz (110%) for VSWR &lt; 2. The proposed antenna offers two notched bands, covering all the 5.2/5.8GHz of WLAN, 3.5/5.5 GHz of WiMAX and 4-GHz of C bands ranges. Good radiation behavior within the UWB frequency range has been obtained. The antenna has a small dimension of 10 *17 mm2.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">E-Ring Shaped Monopole Antenna</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Ultra Wide Band (UWB) Antenna</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Dual Band Notch Function</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_98_1d23fd92d23dfe803a7aaa5ac9212b99.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Users as the Biggest Threats to Security of Health Information Systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>29</FirstPage>
			<LastPage>33</LastPage>
			<ELocationID EIdType="pii">99</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.99</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Bakhtiyari-Shahri</LastName>
<Affiliation>Faculty of Computer Science and Information Systems Universiti Teknologi Malaysia (UTM)</Affiliation>

</Author>
<Author>
					<FirstName>Z.</FirstName>
					<LastName>Ismail</LastName>
<Affiliation>Faculty of Computer Science and Information Systems,  Universiti Teknologi Malaysia (UTM)</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>There are a lot of researches in the world about attacks on information systems (IS). Although there have been many attempts to classify threats of IS’s especially in Health Information Systems (HIS), it is still necessary for all health organization to identify new threats and their sources which threaten security of health care domain. The main aim of this paper is to present a research agenda of threats to HIS and identify issues and human factors that assist the implementation and adoption of health information security within the developing countries. In doing so, the authors try to provide a cohesive completeness identification of all threats about HIS and highlight the role of human in all of them. More than 70 threats to HIS are identified by using a large number of disparate data sources. Then they are classified in 30 subjects and finally categorized in seven areas whichuser’s activities are the biggest threat at the core of risks to HIS.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Health Information System</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Human Error</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Threats</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_99_7e15494714f4f3e95791e7854197dd23.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>University of Sistan and Baluchestan</PublisherName>
				<JournalTitle>International Journal of Communications and Information Technology</JournalTitle>
				<Issn>2322-4606</Issn>
				<Volume>1</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2011</Year>
					<Month>09</Month>
					<Day>20</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Block-Grouping Method for Image Denoising by Block Matching and 3-D Transform Filtering</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>34</FirstPage>
			<LastPage>38</LastPage>
			<ELocationID EIdType="pii">100</ELocationID>
			
<ELocationID EIdType="doi">10.22111/cit.2011.100</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Shirdel</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Rezaei</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>F.</FirstName>
					<LastName>Mohanna</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
<Author>
					<FirstName>J.</FirstName>
					<LastName>Ahmadi-Shokouh</LastName>
<Affiliation>University of Sistan and Baluchestan</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2011</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</History>
		<Abstract>Image denoising by block matching and threedimensional&lt;br /&gt;transform filtering (BM3D) is a two steps state-ofthe-&lt;br /&gt;art algorithm that uses the redundancy of similar blocks in&lt;br /&gt;noisy image for removing noise. Similar blocks which can have&lt;br /&gt;some overlap are found by a block matching method and grouped&lt;br /&gt;to make 3-D blocks for 3-D transform filtering. In this paper we&lt;br /&gt;propose a new block grouping algorithm in the first step of&lt;br /&gt;BM3D that improves the performance of denoising algorithm&lt;br /&gt;especially in heavy noise conditions. In heavy noise conditions,&lt;br /&gt;BM3D causes some artifacts in the filtered image. These artifacts&lt;br /&gt;are reduced by the proposed block grouping algorithm. In the&lt;br /&gt;proposed block grouping method, beside of a similarity measure&lt;br /&gt;used for block matching, the amount of overlap between blocks is&lt;br /&gt;considered. Experimental results show that the proposed block&lt;br /&gt;grouping method can improve the performance of BM3D in&lt;br /&gt;terms of both peak signal-to-noise ratio (PSNR) and visual&lt;br /&gt;quality.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">3-D transform</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">block matching</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">BM3D</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">denoising</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">filtering</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Image</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">overlap</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://cit.usb.ac.ir/article_100_56cecc250dace49fe5ae496193d32607.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
