The research aims to know the availability of supra-cognitive thinking skills in the questions and activities of the computer book for the fifth grade preparatory scientific and literary branches in Iraq for the academic year 2018/2019, as the researcher has prepared a list of supra-cognitive thinking skills included two areas and (6) key skills and (27) A sub - skill, where by the questions and activities of the aforementioned authors were analyzed. The researcher followed the descriptive analytical approach "method of content analysis", and adopted the explicit and implicit unit of analysis, as was verified the validity and stability of the analysis, and the results showed unevenness and imbalance in the distribution of supra-cognitive thinking skills in the evaluation questions and activities contained in the book, where it focused on ( Concept Awareness Skill) significantly relative to other skills and omission of many skills (giving reasoning, strategic switching skill, context optimization skill, problem solving skill, re-planning skill, product modification skill, process manipulation skill, thinking organizing skill) Of relevance, then The researcher presented a number of recommendations and suggestions according to the research findings.
Different ANN architectures of MLP have been trained by BP and used to analyze Landsat TM images. Two different approaches have been applied for training: an ordinary approach (for one hidden layer M-H1-L & two hidden layers M-H1-H2-L) and one-against-all strategy (for one hidden layer (M-H1-1)xL, & two hidden layers (M-H1-H2-1)xL). Classification accuracy up to 90% has been achieved using one-against-all strategy with two hidden layers architecture. The performance of one-against-all approach is slightly better than the ordinary approach
(5)
(4)
In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la
Autonomous motion planning is important area of robotics research. This type of planning relieves human operator from tedious job of motion planning. This reduces the possibility of human error and increase efficiency of whole process.
This research presents a new algorithm to plan path for autonomous mobile robot based on image processing techniques by using wireless camera that provides the desired image for the unknown environment . The proposed algorithm is applied on this image to obtain a optimal path for the robot. It is based on the observation and analysis of the obstacles that lying in the straight path between the start and the goal point by detecting these obstacles, analyzing and studying their shapes, positions and
... Show More
(7)
(4)
Web application protection lies on two levels: the first is the responsibility of the server management, and the second is the responsibility of the programmer of the site (this is the scope of the research). This research suggests developing a secure web application site based on three-tier architecture (client, server, and database). The security of this system described as follows: using multilevel access by authorization, which means allowing access to pages depending on authorized level; password encrypted using Message Digest Five (MD5) and salt. Secure Socket Layer (SSL) protocol authentication used. Writing PHP code according to set of rules to hide source code to ensure that it cannot be stolen, verification of input before it is s
... Show More
In this paper we prove a theorem about the existence and uniqueness common fixed point for two uncommenting self-mappings which defined on orbitally complete G-metric space. Where we use a general contraction condition.
(5)
(4)