Electrochemical reduction of 1-([(4-halophenyl)imino]methyl)-2-naphthols in aprotic media.

The electrochemical reduction of 1-([(4-halophenyl)imino]methyl)-2-naphthols on graphite electrodes was studied using cyclic voltammetry, chronoamperometry, constant-potential coulometry and preparative constant-potential electrolysis techniques. The data revealed that the reduction on graphite was irreversible and followed an EC mechanism. The diffusion coefficients and the number of electrons transferred were determined using the chronoamperometric Cottrell slope and the ultramicro disc Pt-electrode steady-state current. The number of electrons was also determined by bulk electrolysis. The compounds were subjected to constant-potential preparative electrolysis and the electrolysis products were purified and identified by spectroscopic methods. Based on these findings, a mechanism for the electro-reduction process is proposed.     

Real-Time Edge Follow: A Real-Time Path Search Approach

Real-time path search is the problem of searching a path from a starting point to a goal point in real-time. In dynamic and partially observable environments, agents need to observe the environment to track changes, explore to learn unknowns, and search suitable routes to reach the goal rapidly. These tasks frequently require real-time search. In this paper, we address the problem of real-time path search for grid-type environments; we propose an effective heuristic method, namely a real-time edge follow alternative reduction method (RTEF-ARM), which makes use of perceptual information in a real-time search. We developed several heuristics powered by the proposed method. Finally, we generated various grids (random-, maze-, and U-type), and compared our proposal with real-time A*, and its extended version real-time A* with n-look-ahead depth; we obtained very significant improvements in the solution quality.     

Voltammetric and Impedimetric Detection of Interaction Between Dacarbazine and Nucleic Acids

Dacarbazine (DTIC) is a chemotherapy drug that is used for the treatment of Hodgkin's lymphoma, malignant melanoma, childhood solid tumors and soft tissue sarcoma. The surface confined interaction between DTIC and nucleic acids was investigated for the first time in this study by using both differential pulse voltammetry (DPV) and electrochemical impedance spectroscopy (EIS) in combination with disposable pencil graphite electrodes. The oxidation signals of DTIC and guanine were measured before and after interaction process using DPV technique. The interaction of DTIC with nucleic acids; poly[A], poly[G], or double stranded of poly[A]‐poly[T] and poly[G]‐poly[C] was also examined using DPV. Furthermore, EIS technique was utilized for detection of the interaction between DTIC and nucleic acids; ssDNA/dsDNA, poly[A], poly[G], or double stranded poly[A]‐poly[T] and poly[G]‐poly[C].     

A structural analysis of ultrathin barrier (In)AlN/GaN heterostructures for GaN-based high-frequency power electronics

Metal–organic chemical vapor deposition (MOCVD) is one of the best growth methods for GaN-based materials as well-known. GaN-based materials with very quality are grown the MOCVD, so we used this growth technique to grow InAlN/GaN and AlN/GaN heterostructures in this study. The structural and surface properties of ultrathin barrier AlN/GaN and InAlN/GaN heterostructures are studied by X-ray diffraction (XRD) and atomic force microscopy (AFM) measurements. Screw, edge, and total dislocation densities for the grown samples have been calculated by using XRD results. The lowest dislocation density is found to be 1.69 × 10⁸ cm⁻² for Sample B with a lattice-matched In_0.17Al_0.83N barrier. The crystal quality of the studied samples is determined using (002) symmetric and (102) asymmetric diffractions of the GaN material. In terms of the surface roughness, although reference sample has a lower value as 0.27 nm of root mean square values (RMS), Sample A with 4-nm AlN barrier layer exhibits the highest rough surface as 1.52 nm of RMS. The structural quality of the studied samples is significantly affected by the barrier layer thickness. The obtained structural properties of the samples are very important for potential applications like high-electron mobility transistors (HEMTs).     

Global existence and decay of solutions for the generalized bad Boussinesq equation

In this paper,we consider the global existence of solutions for the Cauchy problem of the generalized sixth order bad Boussinesq equation.Moreover,we show that the supremum norm of the solution decays algebraically to zero as(1+t)(1/7)when t approaches to infnity,provided the initial data are sufciently small and regular.     

Netlike partial cubes III. The median cycle property

A graph G has the Median Cycle Property (MCP) if every triple (u₀,u₁,u₂) of vertices of G admits a unique median or a unique median cycle, that is a gated cycle C of G such that for all i,j,k∈{0,1,2}, if x_i is the gate of u_i in C, then: {x_i,x_j}⊆I_G(u_i,u_j) if i≠j, and d_G(x_i,x_j)<d_G(x_i,x_k)+d_G(x_k,x_j). We prove that a netlike partial cube has the MCP if and only if it contains no triple of convex cycles pairwise having an edge in common and intersecting in a single vertex. Moreover a finite netlike partial cube G has the MCP if and only if G can be obtained from a set of even cycles and hypercubes by successive gated amalgamations, and equivalently, if and only if G can be obtained from K₁ by a sequence of special expansions. We also show that the geodesic interval space of a netlike partial cube having the MCP is a Pash-Peano space (i.e. a closed join space).     

Asymptotic behavior of a solution of the Cauchy problem for the generalized damped multidimensional Boussinesq equation

This work studies the Cauchy problem for the generalized damped multidimensional Boussinesq equation. By using a multiplier method, it is proven that the global solution of the problem decays to zero exponentially as the time approaches infinity, under a very simple and mild assumption regarding the nonlinear term.     

Multilevel graph partitioning: an evolutionary approach

The graph partitioning problem is defined as that of dividing the vertices of an undirected graph into a set of balanced parts through the removal of a set of edges, whose size is to be minimized. A number of researchers have investigated multilevel schemes, which coarsen the graph by collapsing vertices and edges, partition the smaller graph, and then uncoarsen it to construct a partitioning of the original graph. In this paper, a genetic algorithm for the coarsening phase of a multilevel scheme for graph partitioning is presented. The proposed approach has been demonstrated to improve the solution quality at the expense of running time.     

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.