New chelating ligand derived from triazole and its complexes with metal ions Rhodium, Platinum and Gold were synthesized. Through a copper (I)-catalyzed click reaction, the ligand produced 1,3-dipolar cycloaddition between 2,6-bis((prop-2-yn-1-yloxy) methyl) pyridine and 1-azidododecane. All structures of these new compounds were rigorously characterized in the solid state using spectroscopic techniques like: ¹HNMR, ¹³CNMR, Uv-Vis, FTIR, metal and elemental analyses, magnetic susceptibility and conductivity measurements at room temperature, it was found that the ligand acts as a penta and tetradentate chelate through N₃O₂, N₂O₂, and the geometry of the new complex

In this paper, we have extracted Silica from rice husk ash (RHA) by sodium hydroxide to produce sodium silicate. 3-(chloropropyl)triethoxysilane (CPTES) functionalized with sodium silicate via a sol-gel method in one pot synthesis to prepare RHACCl. Chloro group in compound RHACCl replacement in iodo group to prepere RHACI. The FT-IR clearly showed absorption band of C-I at 580 cm^-1. Functionalized silica RHACI has high surface area (410 m²/g) and average pore diameter (3.8 nm) within mesoporous range. X-ray diffraction pattern showed that functionalized silica RHACI has amorphous phase .Thermogravemitric analysis (TGA) showed two decomposition stages and SEM morphology of RHACI showed that the particles have irregu

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

The purpose of this resesrh know (the effectiveness of cooperative lerarning implementation of floral material for calligraphy and ornamentation) To achieve the aim of the research scholar put the two zeros hypotheses: in light of the findings of the present research the researcher concluded a number of conclusions, including: -
1 - Sum strategy helps the learner to be positive in all the information and regulations, monitoring and evaluation during the learning process.
2 - This strategy helps the learner to use information and knowledge and their use in various educational positions, and to achieve better education to increase its ability to develop thinking skills and positive trends towards the article.
In light of this, the

Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.

In this paper, we introduce and study the notion of the maximal ideal graph of a commutative ring with identity. Let R be a commutative ring with identity. The maximal ideal graph of R, denoted by MG(R), is the undirected graph with vertex set, the set of non-trivial ideals of R, where two vertices I₁ and I₂ are adjacent if I₁ I₂ and I₁+I₂ is a maximal ideal of R. We explore some of the properties and characterizations of the graph.

In real world, almost all networks evolve over time. For example, in networks of friendships and acquaintances, people continually create and delete friendship relationship connections over time, thereby add and draw friends, and some people become part of new social networks or leave their networks, changing the nodes in the network. Recently, tracking communities encountering topological shifting drawn significant attentions and many successive algorithms have been proposed to model the problem. In general, evolutionary clustering can be defined as clustering data over time wherein two concepts: snapshot quality and temporal smoothness should be considered. Snapshot quality means that the clusters should be as precise as possible durin

     Organizations must interact with the environment around them, so the environment must be suitable for that interaction. These companies are now trying to become Learning Organizations because it try to face that challenges may rise from its environments. The Learning Organization is a concept that is becoming an increasingly widespread philosophy in modern companies, from the largest multinationals to the smallest ventures. What is achieved by this philosophy depends considerably on one's interpretation of it and commitment to it. This study gives a definition that we felt was the true ideology behind the Learning Organization and Group Working. A Learning Organization is one in which people at all levels

In this paper, we propose a new approach of regularization for the left censored data (Tobit). Specifically, we propose a new Bayesian group Bridge for left-censored regression ( BGBRLC). We developed a new Bayesian hierarchical model and we suggest a new Gibbs sampler for posterior sampling. The results show that the new approach performs very well compared to some existing approaches.