New data on jumping spiders (Salticidae) and tangle-web spiders (Theridiidae) of Armenia are provided on the basis of recently collected specimens in various regions of Armenia. One species, Ballus rufipes (Simon, 1868) is recorded as new to the Caucasus Region, in addition to the following species: Neon reticulatus (Blackwall, 1853), Pellenes brevis (Simon, 1868), Salticus scenicus (Clerck, 1757) and Synageles dalmaticus (Keyserling, 1863) that belong to a family Salticidae, are recorded in Armenia for the first time.
A further 7 species of Theridiidae are recorded in Armenia for the first time Kochiura aulica (C. L. Koch, 1838), Steatoda albomaculata (De Geer, 1778), Steatoda bipunctata (Linnaeus, 1758), Steatoda castanea Clerk, 175

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

In this paper, the concept of fully stable Banach Algebra modules relative to an ideal has been introduced. Let A be an algebra, X is called fully stable Banach A-module relative to ideal K of A, if for every submodule Y of X and for each multiplier ?:Y?X such that ?(Y)?Y+KX. Their properties and other characterizations for this concept have been studied.

Soils that cause effective damages to engineer structures (such as pavement and foundation) are called problematic or difficult soils (include collapsible soil, expansive soil, etc.). These damages occur due to poor or unfavorited engineering properties, such as low shear strength, high compressibility, high volume changes, etc. In the case of expansive soil, the problem of the shrink-swell phenomenon, when the soil reacts with water, is more pronounced. To overcome such problems, soils can be treated or stabilized with many stabilization ways (mechanical, chemical, etc.). Such ways can amend the unfavorited soil properties. In this review, the pozzolanic materials have been selected to be presented and discussed as chem

An experimental study on a KIA pride (SAIPA 131) car model with scale of 1:14 in the wind tunnel was made beside the real car tests. Some of the modifications to passive flow control which are (vortex generator, spoiler and slice diffuser) were added to the car to reduce the drag force which its undesirable characteristic that increase fuel consumption and exhaust toxic gases. Two types of calculations were used to determine the drag force acting on the car body. Firstly, is by the integrating the values of pressure recorded along the pressure taps (for the wind tunnel and the real car testing), secondly, is by using one component balance device (wind tunnel testing) to measure the force. The results show that, the avera

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B

Localization is an essential demand in wireless sensor networks (WSNs). It relies on several types of measurements. This paper focuses on positioning in 3-D space using time-of-arrival- (TOA-) based distance measurements between the target node and a number of anchor nodes. Central localization is assumed and either RF, acoustic or UWB signals are used for distance measurements. This problem is treated by using iterative gradient descent (GD), and an iterative GD-based algorithm for localization of moving sensors in a WSN has been proposed. To localize a node in 3-D space, at least four anchors are needed. In this work, however, five anchors are used to get better accuracy. In GD localization of a moving sensor, the algo

Fractal geometry is receiving increase attention as a quantitative and qualitative model for natural phenomena description, which can establish an active classification technique when applied on satellite images. In this paper, a satellite image is used which was taken by Quick Bird that contains different visible classes. After pre-processing, this image passes through two stages: segmentation and classification. The segmentation carried out by hybrid two methods used to produce effective results; the two methods are Quadtree method that operated inside Horizontal-Vertical method. The hybrid method is segmented the image into two rectangular blocks, either horizontally or vertically depending on spectral uniformity crit

<p>Generally, The sending process of secret information via the transmission channel or any carrier medium is not secured. For this reason, the techniques of information hiding are needed. Therefore, steganography must take place before transmission. To embed a secret message at optimal positions of the cover image under spatial domain, using the developed particle swarm optimization algorithm (Dev.-PSO) to do that purpose in this paper based on Least Significant Bits (LSB) using LSB substitution. The main aim of (Dev. -PSO) algorithm is determining an optimal paths to reach a required goals in the specified search space based on disposal of them, using (Dev.-PSO) algorithm produces the paths of a required goals with most effi