We have studied some types of ideals in a KU-semigroup by using the concept of a bipolar fuzzy set. Bipolar fuzzy S-ideals and bipolar fuzzy k-ideals are introduced, and some properties are investigated. Also, some relations between a bipolar fuzzy k-ideal and k-ideal are discussed. Moreover, a bipolar fuzzy k-ideal under homomorphism and the product of two bipolar fuzzy k-ideals are studied.

Image compression plays an important role in reducing the size and storage of data while increasing the speed of its transmission through the Internet significantly. Image compression is an important research topic for several decades and recently, with the great successes achieved by deep learning in many areas of image processing, especially image compression, and its use is increasing Gradually in the field of image compression. The deep learning neural network has also achieved great success in the field of processing and compressing various images of different sizes. In this paper, we present a structure for image compression based on the use of a Convolutional AutoEncoder (CAE) for deep learning, inspired by the diversity of human eye

The notion of interval value fuzzy k-ideal of KU-semigroup was studied as a generalization of afuzzy k-ideal of KU-semigroup. Some results of this idea under homomorphism are discussed. Also, we presented some properties about the image (pre-image) for interval~ valued fuzzy~k-ideals of a KU-semigroup. Finally, the~ product of~ interval valued fuzzyk-ideals is established.

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

Background: Calcaneus is a spongy cancellous bone with rich blood supply , its fracture heals more rapidly providing no occurrence of infection and soft tissue injury around ,no gross malposition of fragments. The associated pain leads to a major impairment in life quality. The aim of treatment for calcaneal fractures is the decrease of pain and rebuilding of walking ability for patients with normal foot shape and the ability to wear normal foot wear. To reduce complications, a minimally invasive technique for the treatment of displaced intra-articular fractures of the calcaneus was preferred to use.

The purpose of this study was to determine whether the closed reduction and percutaneous K. wire fixation of displ

  In this work, we construct and classify the projectively distinct (k,3)-arcs in PG(2,9), where k ≥ 5, and prove that the complete (k,3)-arcs do not exist, where 5 ≤ k ≤ 13. We found that the maximum complete (k,3)-arc in PG(2,q) is the (16,3)-arc and the minimum complete (k,3)-arc in PG(2,q) is the (14,3)-arc. Moreover, we found the complete (k,3)-arcs between them.

  The purpose of this work is to study the classification and construction of (k,3)-arcs in the projective plane PG(2,7). We found that there are two (5,3)-arcs, four (6,3)-arcs, six (7,3)arcs, six (8,3)-arcs, seven (9,3)-arcs, six (10,3)-arcs and six (11,3)-arcs.         All of these arcs are incomplete.         The number of distinct (12,3)-arcs are six, two of them are complete.         There are four distinct (13,3)-arcs, two of them are complete and one (14,3)-arc which is incomplete.         There exists one complete (15,3)-arc.
 

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.