In this work, the switching dynamics of a Fabry-Perot etalon were analyzed in term of effective time constant, which changes dramatically near the switching points. The switch-ON and switch-OFF have been analyzed numerically using a modified Debye dynamic equation. The method used to determine the solution of the Debye relaxation equations solved numerically to predict the behavior of the etalon for modulated input power.

      In this paper, we  introduce new concepts that relates to soft space based on   work that was previously presented by researchers in this regard. First we give  the definition of Soft Contraction Operator and some examples. After that we introduce the concepts of soft Picard iteration and soft Mann iteration processes. We also give  some examples to illustrate them.

    Many concepts in normed spaces have been generalized in soft normed spaces. One of the important concepts is the concept of stability of soft iteration in soft normed spaces. We discuss this concept by giving some lemmas that  are  used to prove some theorems about stability of soft i

     Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem.  In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a

Let Y be a"uniformly convex n-Banach space, M be a nonempty closed convex subset of Y, and S:M→M be adnonexpansive mapping. The purpose of this paper is to study some properties of uniform convex set that help us to develop iteration techniques for1approximationjof"fixed point of nonlinear mapping by using the Mann iteration processes in n-Banachlspace.

this paper give a proof of known conditions for the existence of peridic conincidence points of continuius maps using lindemann theotem on transcendental numbers

The research deals with one of the urban problems facing cities, namely the existence of neglected urban spaces that need to be activated , These spaces give a negative image of the city, is not conducive to life and social interactions or the city has a one distinctive urban experience, leading to a reduction peoples' confidence in revisiting of those areas, hinder the rest of the activities in that region . Because these spaces are of the basic components of the city and give it its identity through the elements and entities that constitute it  , The idea of research emerged in the reclaiming of these spaces within contemporary urban trends and the activation of  flexible  , short-term and inovation for that purpose with

Based on the needs of the scientific community, researchers tended to find new iterative schemes or develop previous iterative schemes that would help researchers reach the fixed point with fewer steps and with stability, will be define in this paper the multi_implicit four-step iterative (MIFSI) which is development to four-step implicit fixed point iterative, to develop the aforementioned iterative scheme, we will use a finite set of projective functions ,nonexpansive function and finite set from a new functions called generalized quasi like contractive which is an amalgamation of quasi contractive function and contractive like function , by the last function and a set of sequential organized steps, we will be able to prove the existen

    One of ciphering systems depends on transposition of letters in plain text to generate cipher text. The programming of transposition depends mainly on 2-dimension matrix in either methods but the difference is in columnar .We print columns in the matrix according to their numbers in key but in the fixed, the cipher text will be obtained by printing matrix by rows.

Optic Disc (OD) localization is a basic step for the screening, identification and appreciation of the risk of diverse ophthalmic pathologies such as glaucoma and diabetic retinopathy.In fact, the fundamental step towards an exact OD segmentation process is the success of OD localization. This paper proposes a fully automatic procedure for OD localization based on two of the OD most relevant features  of high-intensity value and vasculature convergence. Merging ofthese two features renders the proposed method capable of localizing the OD within the variously complicated environments such as the faint disc boundary, unbalanced shading, and the existence of retinal pathologies like cotton wall and exudates,which usually share the same