A typical river-connected lake, Jinshan Lake, was selected as the study area. By the combination of field experiment, laboratory experiment and mathematical model, we plotted the relationship between the concentration of DCu-SCu and FDI, and constructed the mathematical model of the migration and transformation of HMCu in Jinshan Lake. We choose a typical diurnal tide to simulate and revealed the vertical migration characteristics of HMCu in Jinshan Lake during a diurnal tide. The results show that: (1) The release rate of DCu was proportional to FDI and background content, respectively. (2) Due to the nearby industrial enterprises and terrain characteristics, SA loads the most HMCu, the average concentration is 70.07mg/kg. According to the characteristics and geographical location of LC, the concentration of copper in the two states fluctuates greatly (DCu: 43.20~74.77 mg/kg, SCu: 53.63~74.67mg/kg). The fluctuation trend of SCu in ZA is significantly different from that in other areas, which mainly due to the complex hydraulic distribution and the sorption-desorption process of HMs in sediment particles. The hydraulic disturbance of JG is the least and relatively stable, which is the farthest from the inlet of the lake and is the least affected by the Yangtze river. (3) The FDI in a diurnal tide reaches the suspension condition of fine sediment particles in each region. FDI and sediment concentration on the vertical exchange of two - state Cu is significant.

Plants are such important keys of biological part of our environment, supply the human life and creatures. Understanding how the plant’s functions react with our surroundings, helps us better to make plant growth and development of food products. It means the plant phenotyping gives us bio information which needs some tools to reach the plant knowledge. Imaging tools is one of the phenotyping solutions which consists of imaging hardware such as the camera and image analysis software analyses the plant images changings such as plant growth rates. In this paper, we proposed a preprocessing algorithm to eliminate the noise and separate foreground from the background which results the plant image to help the plant image segmentation. The preprocessing is one of important levels has effect on better image segmentation and finally better plant’s image labeling and analysis. Our proposed algorithm is focused on removing noise such as converting the color space, applying the filters and local adaptive binarization step such as Niblack. Finally, we evaluate our algorithm with other algorithms by testing a variety of binarization methods.

Smart grid software interconnects multiple Engineering disciplines (power systems, communication, software and hardware technology, instrumentation, big data, etc.). The software architecture is an evolving concept in smart grid systems in which systematic architecture development is a challenging process. The architecture has to realize the complex legacy power grid systems and cope up with current Information and Communication Technologies (ICT). The distributed generation in smart grid environment expects the software architecture to be distributed and to enable local control. Smart grid architecture should also be modular, flexible and adaptable to technology upgrades. In this paper, the authors have made a comprehensive review on architecture for smart grids. An in depth analysis of layered and agent based architectures is presented and compared under various domains.

A Pogorelov polytope is a combinatorial simple 3-polytope realizable in the Lobachevsky (hyperbolic) space as a bounded right-angled polytope. It has no 3- and 4-gons and may have any prescribed numbers of k-gons, k ≥ 7. Any polytope with only 5-, 6- and at most one 7-gon is Pogorelov. For any other prescribed numbers of k-gons, k ≥ 7, we give an explicit construction of a Pogorelov and a non-Pogorelov polytopes. Any Pogorelov polytope different from Löbel polytopes can be constructed from the 5- or the 6-barrel by cuttings off pairs of adjacent edges and connected sums with the 5-barrel along a 5-gon with the intermediate polytopes being Pogorelov. For fullerenes there is a stronger result. Any fullerene different from the 5-barrel and the (5, 0)-nanotubes can be constructed by only cuttings off adjacent edges from the 6-barrel with all the intermediate polytopes having 5-, 6- and at most one additional 7-gon adjacent to a 5-gon. This result can not be literally extended to the latter class of polytopes. We prove that it becomes valid if we additionally allow connected sums with the 5-barrel and 3 new operations, which are compositions of cuttings off adjacent edges. We generalize this result to the case when the 7-gon may be isolated from 5-gons.

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

Autonomous and cooperative vehicle systems represent a key priority in the automotive realm. Networked driving simulation can be utilized as a safe, cost-effective experimental replica of real traffic environments in order to support and accelerate the development of such systems. In networked driving simulation, different independent systems collaborate to achieve a common task: multi-driver traffic scenario simulation. Yet distinct system complexity levels are necessary to fulfill the requirements of various application scenarios, such as development of vehicle systems, analysis of driving behavior, and training of drivers. With myriad alternatives of available systems and components, developers of networked driving simulation are typically confronted with high design complexity. There are no systematic approaches to date for the design of networked driving simulation in accordance with the specific requirements of the concerned application scenarios. This paper presents a novel design method for networked driving simulation. The method consists mainly of a procedure model that is accompanied by a configuration software. The procedure model includes the necessary phases for the systematic design of application-oriented platforms for networked driving simulation. The configuration software embeds supportive decision-making processes that enable developers to apply the design method and easily create different system models. The design method was validated by generating system models and developing platforms of networked driving simulation for three different application scenarios.

Proteins are the workhorses of the cell that perform biological functions by interacting with other proteins. Many statistical methods for protein-protein interaction (PPI) have been studied without considering time-dependent changes in networks and the functionalities. I introduced a novel method that models PPI networks as being dynamic in nature and evolving time-varying multivariate distribution with Conditional Random Fields (CRF). This research is directed towards implementing this new combinatorial algorithm on massively parallel architectures such as Graphics Processing Units (GPUs) for efficient computations for large scale bioinformatics datasets. I compared Conditional Random Fields (CRF) and the proposed novel method using CRF combined with the Block Coordinate Descent algorithm for human protein-protein interaction data set. Both are implemented on GPU-Accelerated Computing Architecture and the proposed novel method showed the advantages in predicting protein-protein interaction sites. I also show that the proposed approach is more efficient in 6.13% than standalone CRF++ in predicting protein-protein interaction sites.

Penetration of grid connected inverters (GCI) has arisen in power systems due to increasing integration of renewable sources. However, restrictive grid codes require that renewable sources connected to the grid with power electronic systems must be properly connected and appropriate currents must be injected to support stability of the grid under grid faults. Simultaneous injection of symmetrical positive and negative sequence currents is mandatory to support stabilization of grid at the instant of grid faults. Conventional synchronously rotating frame dq current controllers are insufficient under grid faults due to low bandwidth of PI controllers. This paper proposes a new grid current control strategy for grid connected voltage source inverters under unbalanced grid voltage conditions. A proportional current controller with a first order low pass filter disturbance observer (DOb) is proposed which establishes positive sequence power requirements and independently control negative sequence current components under unbalanced voltage conditions. The method does not need any parameter, since it estimates nonlinear terms with low pass filter DOb. Simulations are implemented in Matlab/Simulink platform demonstrating the effectiveness of proposed method.

Frequency, amplitude and phase information of the grid voltage are of great importance in constructing a robust controller structure for grid connected inverter systems. This paper presents a simple and robust approach for the instantaneous estimation of positive and negative sequence voltage components under distorted voltage conditions. A second order generalized integrator (SOGI) is used to filter the distorted voltage and to generate orthogonal voltage components for each of the three phases. These filtered and orthogonal components are used for instantaneous calculation of symmetrical components. The implemented method is frequency adaptive; the method is demonstrated and compared to a conventional phase locked loop (PLL) technique with both MATLAB/Simulink simulations and experiments utilizing the dSPACE ds1103 digital controller.

To eliminate the influence of the inconsistency on the cycle life and the available capacity of the battery pack, and improve the balancing speed, a novel inductor-based layered bidirectional equalizer (IBLBE) is proposed. The equalizer is composed of the bottom balancing circuits and the upper balancing circuits, and the two layer circuits both consist of a plurality of balancing sub-circuits, which allow the dynamic adjustment of equalization path and equalization threshold. The battery string is modularized by layered balancing circuits to realize fast active equalization, especially for long battery strings. By controlling the bottom balancing circuits, the individual cells can be balanced in each module. At the same time, the equalization between battery modules can be realized by controlling the upper balancing circuits. Simulation and experimental results demonstrate that the proposed equalizer can achieve fast active equalization for a long battery string, and has the characteristics of multi balancing path, large balancing current and high accuracy. The advantages of the proposed equalizer are further verified by a comparison with existing active equalizer.

With the development of higher voltage power grid, the high and low voltage parallel loops are emerging, which lead to energy losses, even threaten the security and stability of power system. The multi-infeed HVDC configurations widely appearing in AC/DC interconnected power system make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating condition with high and low voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN algorithm. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP). And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

Many fundamental molecular techniques (PCR, Microarray, Southern and northern hybridization, siRNA, CRISPR/Cas9 etc.) developed so far shows errors. I wish to highlight these molecular techniques are developed on basis of Watson-Crick DNA model, ignoring the concept of parallel stranded DNA. Through this opinion article, I wish to highlight specificity and accuracy of these molecular techniques can be enhanced by considering both parallel and anti parallel hybridization of DNA. Hopefully my views will also solve issue of irreproducibility in life science research.