The best proximity point is a generalization of a fixed point that is beneficial when the contraction map is not a self-map. On other hand, best approximation theorems offer an approximate solution to the fixed point equation . It is used to solve the problem in order to come up with a good approximation. This paper's main purpose is to introduce new types of proximal contraction for nonself mappings in fuzzy normed space and then proved the best proximity point theorem for these mappings. At first, the definition of fuzzy normed space is given. Then the notions of the best proximity point and - proximal admissible in the context of fuzzy normed space are presented. The notion of α ̃–ψ ̃- proximal contractive mapping is introduced. After that, the best proximity point theorem for such type of mapping in a fuzzy normed space is state and prove. In addition, the idea of α ̃–ϕ ̃-proximal contractive mapping is presented in a fuzzy normed space and under specific conditions, the best proximity point theorem for such type of mappings is proved. Furthermore, some examples are offered to show the results' usefulness.
In this paper, a design of the broadband thin metamaterial absorber (MMA) is presented. Compared with the previously reported metamaterial absorbers, the proposed structure provides a wide bandwidth with a compatible overall size. The designed absorber consists of a combination of octagon disk and split octagon resonator to provide a wide bandwidth over the Ku and K bands' frequency range. Cheap FR-4 material is chosen to be a substate of the proposed absorber with 1.6 thicknesses and 6.5×6.5 overall unit cell size. CST Studio Suite was used for the simulation of the proposed absorber. The proposed absorber provides a wide absorption bandwidth of 14.4 GHz over a frequency range of 12.8-27.5 GHz with more than %90 absorp
... Show MoreThe aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).
<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In
... Show MoreDue to the importance of egg parasitoids inthe natural and biological control of economically important insects, including egg parasitoid Pseudoligositaba bylonica Viggiani on dubas bug, the spread of the parasitoid and population distribution of parasitoid, In order to estimate the role of parasitoid as one of the biological factors in decreasing population density of dubas bug on date palm. Some aspects of the life of parasitoids were also studied, including the role of insect parasitoids in organizing the population of their families, geographical distribution and hosts range of genus Pseudoligosita, seasonal presence of parasitoid Pseudoligositaba bylonica Viggiani (Hymenoptera: Trichogrammatidae) , life studies and percentages
... Show MoreCyber-attacks keep growing. Because of that, we need stronger ways to protect pictures. This paper talks about DGEN, a Dynamic Generative Encryption Network. It mixes Generative Adversarial Networks with a key system that can change with context. The method may potentially mean it can adjust itself when new threats appear, instead of a fixed lock like AES. It tries to block brute‑force, statistical tricks, or quantum attacks. The design adds randomness, uses learning, and makes keys that depend on each image. That should give very good security, some flexibility, and keep compute cost low. Tests still ran on several public image sets. Results show DGEN beats AES, chaos tricks, and other GAN ideas. Entropy reached 7.99 bits per pix
... Show MoreIn this work, a deep computational study has been conducted to assign several qualities for the graph . Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.
This research aims at calculating the optimum cutting condition for various types of machining methods, assisted by computers, (the computer program in this research is designed to solve linear programs; the program is written in v. basic language). The program obtains the results automatically, this occur through entering the preliminary information about the work piece and the operating condition, the program makes the calculation actually by solving a group of experimental relations, depending on the type of machining method (turning, milling, drilling). The program was transferred to package and group of windows to facilitate the use; it will automatically print the initial input and optimal solution, and thus reduce the effort and t
... Show More