Selectivity Enhancement to the Exclusive Formation of Ethyltoluenes and Hydrogen During Dehydroalkylation of Toluene with Ethane

The dehydroalkylation of toluene with ethane to the isomeric ethyltoluenes was studied on 0.4Pt/H-ZSM-5 at varying contact times (1/WHSV). At a high contact time of 1.0 h, toluene disproportionation and hydrogenolysis reactions dominate, resulting in low selectivity to the desired ethyltoluenes via the alkylation reaction. However, at a low contact time of 0.12 h side reactions are eliminated, resulting in maximum selectivities to the kinetically favored ethyltoluenes and hydrogen. Results at high selectivities to ethyltoluenes provide significant insight into reaction pathways.     

Alternating active-phase algorithm for multimaterial topology optimization problems: a 115-line MATLAB implementation

Structural and Multidisciplinary Optimization - A new algorithm for the solution of multimaterial topology optimization problems is introduced in the present study. The presented method is based on...     

Fast implementation of dense stereo vision algorithms on a highly parallel SIMD architecture

In this paper, we present faster than real-time implementation of a class of dense stereo vision algorithms on a low-power massively parallel SIMD architecture, the CSX700. With two cores, each with 96 Processing Elements, this SIMD architecture provides a peak computation power of 96 GFLOPS while consuming only 9 Watts, making it an excellent candidate for embedded computing applications. Exploiting full features of this architecture, we have developed schemes for an efficient parallel implementation with minimum of overhead. For the sum of squared differences (SSD) algorithm and for VGA (640 × 480) images with disparity ranges of 16 and 32, we achieve a performance of 179 and 94 frames per second (fps), respectively. For the HDTV (1,280 × 720) images with disparity ranges of 16 and 32, we achieve a performance of 67 and 35 fps, respectively. We have also implemented more accurate, and hence more computationally expensive variants of the SSD, and for most cases, particularly for VGA images, we have achieved faster than real-time performance. Our results clearly demonstrate that, by developing careful parallelization schemes, the CSX architecture can provide excellent performance and flexibility for various embedded vision applications.     

Agent-based time delay margin in consensus of multi-agent systems by an event-triggered control method: Concept and computation

This paper deals with defining the concept of agent-based time delay margin and computing its value in multi-agent systems controlled by event-triggered based controllers. The agent-based time delay margin specifying the time delay tolerance of each agent for ensuring consensus in event-triggered controlled multi-agent systems can be considered as complementary for the concept of (network) time delay margin, which has been previously introduced in some literature. In this paper, an event-triggered control method for achieving consensus in multi-agent systems with time delay is considered. It is shown that the Zeno behavior is excluded by applying this method. Then, in a multi-agent system controlled by the considered event-triggered method, the concept of agent-based time delay margin in the presence of a fixed network delay is defined. Moreover, an algorithm for computing the value of the time delay margin for each agent is proposed. Numerical simulation results are also provided to verify the obtained theoretical results.     

Surface characterization and biological properties of regular dentin,demineralized dentin,and deproteinized dentin

Bone autografts are often used for reconstruction of bone defects; however, due to the limitations of autografts, researchers have been in search of bone substitutes. Dentin is of particular interest for this purpose due to high similarity to bone. This in vitro study sought to assess the surface characteristics and biological properties of dentin samples prepared with different treatments. This study was conducted on regular (RD), demineralized (DemD), and deproteinized (DepD) dentin samples. X-ray diffraction and Fourier transform infrared spectroscopy were used for surface characterization. Samples were immersed in simulated body fluid, and their bioactivity was evaluated under a scanning electron microscope. The methyl thiazol tetrazolium assay, scanning electron microscope analysis and quantitative real-time polymerase chain reaction were performed, respectively to assess viability/proliferation, adhesion/morphology and osteoblast differentiation of cultured human dental pulp stem cells on dentin powders. Of the three dentin samples, DepD showed the highest and RD showed the lowest rate of formation and deposition of hydroxyapatite crystals. Although, the difference in superficial apatite was not significant among samples, functional groups on the surface, however, were more distinct on DepD. At four weeks, hydroxyapatite deposits were noted as needle-shaped accumulations on DemD sample and numerous hexagonal HA deposit masses were seen, covering the surface of DepD. The methyl thiazol tetrazolium, scanning electron microscope, and quantitative real-time polymerase chain reaction analyses during the 10-day cell culture on dentin powders showed the highest cell adhesion and viability and rapid differentiation in DepD. Based on the parameters evaluated in this in vitro study, DepD showed high rate of formation/deposition of hydroxyapatite crystals and adhesion/viability/osteogenic differentiation of human dental pulp stem cells, which may support its osteoinductive/osteoconductive potential for bone regeneration.     

A self-routing load balancing algorithm in parallel computing: comparison to the central algorithm

Load balancing is an important stage of a system using parallel computing where the aim is the balance of workload among all processors of the system. In this paper, we introduce a new load balancing algorithm with new capabilities for parallel systems, among which is the independence of a separate route-finder algorithm between the load receiver and sender nodes. In addition to simulation of the new algorithm, due to similarity in behavior to the proposed algorithm, the central algorithm is simulated. Simulation results show that, the system performance increases with the increase of the degree of neighborhood between the processors. These results also indicate the algorithm’s high compatibility with environment changes.     

Deriving operating policies for multi-objective reservoir systems: Application of Self-Learning Genetic Algorithm

Optimal multi-reservoir operation is a multi-objective problem in nature and some of its objectives are nonlinear, non-convex and multi-modal functions. There are a few areas of application of mathematical optimization models with a richer or more diverse history than in reservoir systems optimization. However, actual implementations remain limited or have not been sustained.Genetic Algorithms (GAs) are probabilistic search algorithms that are capable of solving a variety of complex multi-objective optimization problems, which may include non-linear, non-convex and multi-modal functions. GA is a population based global search method that can escape from local optima traps and find the global optima. However GAs have some drawbacks such as inaccuracy of the intensification process near the optimal set.In this paper, a new model called Self-Learning Genetic Algorithm (SLGA) is presented, which is an improved version of the SOM-Based Multi-Objective GA (SBMOGA) presented by Hakimi-Asiabar et al. (2009) [45]. The proposed model is used to derive optimal operating policies for a three-objective multi-reservoir system. SLGA is a new hybrid algorithm which uses Self-Organizing Map (SOM) and Variable Neighborhood Search (VNS) algorithms to add a memory to the GA and improve its local search accuracy. SOM is a neural network which is capable of learning and can improve the efficiency of data processing algorithms. The VNS algorithm can enhance the local search efficiency in the Evolutionary Algorithms (EAs).To evaluate the applicability and efficiency of the proposed methodology, it is used for developing optimal operating policies for the Karoon-Dez multi-reservoir system, which includes one-fifth of Iran's surface water resources. The objective functions of the problem are supplying water demands, generating hydropower energy and controlling water quality in downstream river.     

Homotopy perturbation method for motion of a spherical solid particle in plane couette fluid flow

He’s homotopy perturbation method is applied to obtain exact analytical solutions for the motion of a spherical particle in a plane couette flow. It is demonstrated that the applied analytical method is very straightforward in comparison with existing techniques. Furthermore, it is decidedly effectual in terms of accuracy and rapid convergence. The formulation of the problem is presented in the text as well as the analytical and numerical procedures. The current results can be used in different areas of particulate flows.     

An enhanced beam search algorithm for the Shortest Common Supersequence Problem

The Shortest Common Supersequence Problem asks to obtain a shortest string that is a supersequence of every member of a given set of strings. It has applications, among others, in data compression and oligonucleotide microarray production. The problem is NP-hard, and the existing exact solutions are impractical for large instances. In this paper, a new beam search algorithm is proposed for the problem, which employs a probabilistic heuristic and uses the dominance property to further prune the search space. The proposed algorithm is compared with three recent algorithms proposed for the problem on both random and biological sequences, outperforming them all by quickly providing solutions of higher average quality in all the experimental cases. The Java source and binary files of the proposed IBS_SCS algorithm and our implementation of the DR algorithm and all the random and real datasets used in this paper are freely available upon request.