Reading is one of the essential components of the English language. Countries that use English as a second language (ESL) sometimes have difficulties in reading and comprehension. According to many researches, mother tongue has proved some interferences with learning a second language. This study investigated the results of reading difficulties of young second language learners in terms of accuracy, comprehension, and rate using the Neale Analysis of Reading Ability test. The study was carried out in one of the High Schools for Boys in Hyderabad, India and included Grade five, aged 10-12 years. In order to understand the reading difficulties of English as a second language, a qualitative approach was employed. Interview, reading tes

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of cove

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of

In this paper we use Bernstein polynomials for deriving the modified Simpson's 3/8 , and the composite modified Simpson's 3/8 to solve one dimensional linear Volterra integral equations of the second kind , and we find that the solution computed by this procedure is very close to exact solution.

Given the importance of increasing economic openness transport companies’ face various issues arising at present time, this required importing different types of goods with different means of transport. Therefore, these companies pay great attention to reducing total costs of transporting commodities by using numbers means of transport methods from their sources to the destinations. The majority of private companies do not acquire the knowledge of using operations research methods, especially transport models, through which the total costs can be reduced, resulting in the importance and need to solve such a problem. This research presents a proposed method for the sum of Total Costs (Tc) of rows and columns, in order to arrive at the init

Shadow removal is crucial for robot and machine vision as the accuracy of object detection is greatly influenced by the uncertainty and ambiguity of the visual scene. In this paper, we introduce a new algorithm for shadow detection and removal based on different shapes, orientations, and spatial extents of Gaussian equations. Here, the contrast information of the visual scene is utilized for shadow detection and removal through five consecutive processing stages. In the first stage, contrast filtering is performed to obtain the contrast information of the image. The second stage involves a normalization process that suppresses noise and generates a balanced intensity at a specific position compared to the neighboring intensit

<p>The directing of a wheeled robot in an unknown moving environment with physical barriers is a difficult proposition. In particular, having an optimal or near-optimal path that avoids obstacles is a major challenge. In this paper, a modified neuro-controller mechanism is proposed for controlling the movement of an indoor mobile robot. The proposed mechanism is based on the design of a modified Elman neural network (MENN) with an effective element aware gate (MEEG) as the neuro-controller. This controller is updated to overcome the rigid and dynamic barriers in the indoor area. The proposed controller is implemented with a mobile robot known as Khepera IV in a practical manner. The practical results demonstrate that the propo

Abstract 

This paper presents mechanical and electrical design, and implementation  process of industrial robot, 3-DoF type SCARA (selective compliment assembly robot arm),with two rotations and one translation used for welding applications.The design process also included the controller design which was based on PLC(programmable logic controller) as well as selection of mechanical and electrical components.The challenge was to use the available components in Iraq with reasonable costs. The robot mentioned is fully automated using programmable logic controller PLC(Zelio type SR3-B261BD),with 16inputs and 10 outputs. The PLC was implemented in FBD logic to obtain three different automatic motions with hi

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord