Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

          General propositions have dealt with various indicators and features that frame and describe basic architectural concepts, and from those concepts, the concept of identity will be presented here, which represents the nerve of intellectual vision of the state of architecture development, transformation and change. Due to its deep intellectual basis, it was necessary to study multiple features, especially the achievement feature that was considered a major stage describing the nature of change and shift related to the achievement of concept and its role in the development of the architectural field .              &nb

The conception and experimental assessment of a removable friction-based shear connector (FBSC) for precast steel-concrete composite bridges is presented. The FBSC uses pre-tensioned high-strength steel bolts that pass through countersunk holes drilled on the top flange of the steel beam. Pre-tensioning of the bolts provides the FBSC with significant frictional resistance that essentially prevents relative slip displacement of the concrete slab with respect to the steel beam under service loading. The countersunk holes are grouted to prevent sudden slip of the FBSC when friction resistance is exceeded. Moreover, the FBSC promotes accelerated bridge construction by fully exploiting prefabrication, does not raise issues relevant to precast co

The subject of this research involves studying adsorption to remove hexavalent chromium Cr(VI) from aqueous solutions. Adsorption process on bentonite clay as adsorbent was used in the Cr(VI) concentration range (10-100) ppm at different temperatures (298, 303, 308 and 313)K, for different periods of time. The adsorption isotherms were obtained by obeying Langmuir and Freundlich adsorption isotherm with R2 (0.9921-0.9060) and (0.994-0.9998), respectively. The thermodynamic parameters were calculated by using the adsorption process at four different temperatures the values of ?H, ?G and ?S was [(+6.582 ? +6.547) kJ.mol-1, (-284.560 ? -343.070) kJ.mol-1 and (+0.977 ? +1.117) kJ.K-1.mol-1] respectively. This data indicates the spontaneous sorp

One of the significant stages in computer vision is image segmentation which is fundamental for different applications, for example, robot control and military target recognition, as well as image analysis of remote sensing applications. Studies have dealt with the process of improving the classification of all types of data, whether text or audio or images, one of the latest studies in which researchers have worked to build a simple, effective, and high-accuracy model capable of classifying emotions from speech data, while several studies dealt with improving textual grouping. In this study, we seek to improve the classification of image division using a novel approach depending on two methods used to segment the images. The first

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN