Human Interactive Proofs (HIPs) are automatic inverse Turing tests, which are intended to differentiate between people and malicious computer programs. The mission of making good HIP system is a challenging issue, since the resultant HIP must be secure against attacks and in the same time it must be practical for humans. Text-based HIPs is one of the most popular HIPs types. It exploits the capability of humans to recite text images more than Optical Character Recognition (OCR), but the current text-based HIPs are not well-matched with rapid development of computer vision techniques, since they are either vey simply passed or very hard to resolve, thus this motivate that

The issue of increasing the range covered by a wireless sensor network with restricted sensors is addressed utilizing improved CS employing the PSO algorithm and opposition-based learning (ICS-PSO-OBL). At first, the iteration is carried out by updating the old solution dimension by dimension to achieve independent updating across the dimensions in the high-dimensional optimization problem. The PSO operator is then incorporated to lessen the preference random walk stage's imbalance between exploration and exploitation ability. Exceptional individuals are selected from the population using OBL to boost the chance of finding the optimal solution based on the fitness value. The ICS-PSO-OBL is used to maximize coverage in WSN by converting r

Recently, with the development multimedia technologies and wireless telecommunication, Voice over Internet Protocol, becomes widely used in communication between connecting people, VoIP allows people that are connected to the local network or the Internet to make voice calls using digital connection instead of based on the analog traditional telephone network. The technologies of Internet doesn’t give any security mechanism and there is no way to guarntee that the voice streams will be transmitted over Internet or network have not been intercepted in between. In this paper, VoIP is developed using stream cipher algorithm and the chaotic cryptography for key generator. It is based on the chaotic maps for generating a one-time rando

Today, problems of spatial data integration have been further complicated by the rapid development in communication technologies and the increasing amount of available data sources on the World Wide Web. Thus, web-based geospatial data sources can be managed by different communities and the data themselves can vary in respect to quality, coverage, and purpose. Integrating such multiple geospatial datasets remains a challenge for geospatial data consumers. This paper concentrates on the integration of geometric and classification schemes for official data, such as Ordnance Survey (OS) national mapping data, with volunteered geographic information (VGI) data, such as the data derived from the OpenStreetMap (OSM) project. Useful descriptions o

There are many studies dealt with handoff management in mobile communication systems and some of these studies presented handoff schemes to manage this important process in cellular network. All previous schemes used relative signal strength (RSS) measurements. In this work, a new proposed handoff scheme had been presented depending not only on the RSS measurements but also used the threshold distance and neighboring BSS power margins in order to improve the handoff management process. We submitted here a threshold RSS as a condition to make a handoff when a mobile station moves from one cell to another this at first, then we submitted also a specified margin between the current received signal and the ongoing BS's received signal must be s

 Dens itiad ns vcovadoay fnre Dec2isco0D,ia asrn2trcds4 fenve ns 6ocfo ts ida%n2notd, rasr sedno6t(a asrn2trcd fnre sc2a 2cynwnvtrnco co nrs wcd2 /nt sedno6t(a fan(er wtvrcd ﯿ)ﺔ mh         Dens r,ia cw asrn2trcds et/a laao vcosnyaday wcd asrn2trno( rea itdt2arads ﻘ cw sn2i%a %noatd da(dassnco 2cya%4 feao t idncd asrn2tra cw rea itdt2arad /t%ua )ﻘm ns t/tn%tl%a4 st, ﻘxh Dens ﻘx ets laao dawadday no srtrnsrnvt% %nradtrudas ts (uass icnor tlcur rea itdt2arad ﻘh         Dea aMidassncos wcd Snts4 Oato -9utday 8ddcd )O-8m toy .a%trn/a 8wwnvnaov, cw rea idcicsay asrn2trcds tda clrtnoayh 1u2adnvt% dasu%rs tda idc/nyay feao rea

The distribution of the intensity of the comet Ison C/2013 is studied by taking its histogram. This distribution reveals four distinct regions that related to the background, tail, coma and nucleus. One dimensional temperature distribution fitting is achieved by using two mathematical equations that related to the coordinate of the center of the comet. The quiver plot of the gradient of the comet shows very clearly that arrows headed towards the maximum intensity of the comet.