Formulation of sage essential oil (Salvia officinalis,L.) monoterpenes into chitosan hydrogels and permeation study with GC-MS analysis

This study deals with the formulation of natural drugs into hydrogels. For the first time, compounds from the sage essential oil were formulated into chitosan hydrogels. A sample preparation procedure for hydrophobic volatile analytes present in a hydrophilic water matrix along with an analytical method based on the gas chromatography coupled with the mass spectrometry (GC-MS) was developed and applied for the evaluation of the identity and quantity of essential oil components in the hydrogels and saline samples. The experimental results revealed that the chitosan hydrogels are suitable for the formulation of sage essential oil. The monoterpene release can be effectively controlled by both chitosan and caffeine concentration in the hydrogels. Permeation experiment, based on a hydrogel with the optimized composition [3.5% (w/w) sage essential oil, 2.0% (w/w) caffeine, 2.5% (w/w) chitosan and 0.1% (w/w) Tween-80] in donor compartment, saline solution in acceptor compartment, and semi-permeable cellophane membrane, demonstrated the useful permeation selectivity. Here, (according to lipophilicity) an enhanced permeation of the bicyclic monoterpenes with antiflogistic and antiseptic properties (eucalyptol, camphor and borneol) and, at the same time, suppressed permeation of toxic thujone (not exceeding its permitted applicable concentration) was observed. These properties highlight the pharmaceutical importance of the developed chitosan hydrogel formulating sage essential oil in the dermal applications.     

Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages

Heat exchanger network synthesis (HENS) has progressed by using mathematical programming-based simultaneous methodology. Although various considerations such as non-isothermal mixing and bypass streams are applied to consider real world alternatives in modeling phase, many challenges are faced because of its properties within non-convex mixed-integer nonlinear programming (MINLP). We propose a modified superstructure, which contains a utility substage for use in considering multiple utilities in a simultaneous MINLP model. To improve model size and convergence, fixed utility locations according to temperature and series connections between utilities are suggested. The numbers of constraints, discrete, and continuous variables show that overall model size decreases compared with previous research. Thus, it is possible to expand the feasible search area for reaching the nearest global solution. The model's effectiveness and applications are exemplified by several literature problems, where it is used to deduce a network superior to that of any other reported methodology.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Mechanical damage characterization of glass fiber-reinforced polymer laminates by ultrasonic maps

A method for simultaneous measurement of the thickness and density for Glass Fiber-Reinforced Polymer (GFRP) laminate plates with ultrasonic waves in C-Scan mode is presented in the form of maps. The method uses three different signals in immersion pulse-echo C-Scan mode. The maps obtained based on the density show the heterogeneity of the material at high resolution at the pixel level (1 × 1 mm²) and therefore they represent an efficient tool to assess and evaluate the damage of the composite structures after manufacturing and after an applied mechanical loading.     

Behavior of 316L stainless steel containing corrosion pits under cyclic loading

The environmental performance of 316L grade stainless steel, in the form of tensile specimens containing a single corrosion pit with various aspect ratios, under cyclic loading in aerated chloride solutions is investigated in this study. Results from environmental tests were compared and contrasted with those obtained using finite element analysis (FEA). Fractography of the failed specimens obtained from experiments revealed that fatigue crack initiation took place at the base of the shallow pit. The crack initiation shifted towards the shoulder and the mouth of the pit for pits of increasing depth. This process is well predicted by FEA, as the strain contour maps show that strain is the highest around the centric strip of the pit. However, for shallow pits, local strain is uniformly distributed around that strip but begins to concentrate more towards the shoulder and the mouth region for increasingly deep pits.     

Sensor network design based on system-wide reliability criteria. Part I: Objectives

Reliability based criteria are quite popular for optimal sensor network design. We present a modified definition of system reliability for sensor network design for two applications: reliable estimation of variables in a steady state linear flow process, and reliable fault detection and diagnosis for any process. Unlike the weakest-link based definition of system reliability in the literature, the proposed definition considers the entire system and is consistent with the reliability concept used in classical reliability literature. For each application, dual approaches for defining system reliability are proposed, and their analogy with the reliability problem in the classical reliability literature is established. Using examples and stochastic simulations, the advantage of using the proposed system reliability in contrast to the existing definition is illustrated. Part II of this series of articles presents methods for efficient generation of the system reliability function and its use in optimization-based approaches for designing optimal sensor networks.     

Fault handling in large water networks with online dictionary learning

Fault detection and isolation in water distribution networks is an active topic due to the nonlinearities of flow propagation and recent increases in data availability due to sensor deployment. Here, we propose an efficient two-step data driven alternative: first, we perform sensor placement taking the network topology into account; second, we use incoming sensor data to build a network model through online dictionary learning. Online learning is fast and allows tackling large networks as it processes small batches of signals at a time. This brings the benefit of continuous integration of new data into the existing network model, either in the beginning for training or in production when new data samples are gathered. The proposed algorithms show good performance in our simulations on both small and large-scale networks.     

共享交通的时空轨迹检索与群体发现

为解决共享交通下的共乘用户群体发现效率低、准确率不高问题，依据R-树原理建立GeoOD-Tree索引，并在此基础上提出以最大化共乘率为目标的群体发现策略。首先，对原始时空轨迹数据进行特征提取与标定处理，挖掘有效出行起讫点（OD）轨迹；其次，针对用户起讫点轨迹的特征，建立GeoOD-Tree索引进行有效的存储管理；最后，给出以最大化共乘行程为目标的群体发现模型，并运用K最近邻（KNN）查询对搜索空间剪枝压缩，提高群体发现效率。采用西安市近12000辆出租车营运轨迹数据，选取动态时间规整（DTW）等典型算法与所提算法在查询效率与准确率上进行性能对比分析。与DTW算法相比，所提算法的准确率提高了10.12%，查询效率提高了约15倍。实验结果表明提出的群体发现策略能有效提高共乘用户群体发现的准确率和效率，可有效提升共乘出行方式的出行率。     

An adaptive image steganographic scheme based on Noise Visibility Function and an optimal chaotic based encryption method

Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.