networking and entering into official and unofficial networks is the main way for individuals to get promoted in organizations. so entering into academic networks at universities has become a challenge for people who would like to promote their academic position. in iran despite a notable increase in the women’s presence in universities, their entrance into academic networks and promoting their...

A simple method for some class of inverse obstacle scattering problems is introduced. The observation data are given by a wave field measured on a known surface surrounding unknown obstacles over a finite time interval. The wave is generated by an initial data with compact support outside the surface. The method yields the distance from a given point outside the surface to obstacles and thus mo...

We address the optimal dynamic formation problem in mobile leader-follower networks where an optimal formation is generated to maximize a given objective function while continuously preserving connectivity. We show that in a convex mission space, the connectivity constraints can be satisfied by any feasible solution to a mixed integer nonlinear optimization problem (MINLP). For the class of opt...

this study was conducted to identify self-directed and external professional development obstacles facing primary school efl teachers in southern zone of tigray region in ethiopia. the participants of the study were 63 primary school efl teachers, 10 school principals and 2 clusters of supervisors. school teachers were selected using random sampling technique whereas school principals and clust...

Because traditional obstacle avoidance path planning methods have a lot of problems, such as large amount of calculation, low efficiency, poor optimization capability, and lack of dealing with dynamic obstacles, a new method which implements real-time path planning of mobile robot is presented. The method builds a neural network model for the robot workspace, and then it uses the model to obtai...

We study the problem of finding shortest paths in the plane among h convex obstacles, where the path is allowed to pass through (violate) up to k obstacles, for k ≤ h. Equivalently, the problem is to find shortest paths that become obstacle-free if k obstacles are removed from the input. Given a fixed source point s, we show how to construct a map, called a shortest k-path map, so that all dest...

in this paper a new method is proposed for path planning of planar manipulators amid obstacles through mathematical programming in a way that the robot’s links avoid collision with obstacles throughout their motion from an initial to a goal configuration. after inputting the workspace geometry, the shortest feasible path for the robot’s end-effector is planned toward its goal position using gen...