A charge sharing–based switching scheme for SAR ADCs

This paper presents an energy-efficient switching scheme for successive approximation register (SAR) analogue-to-digital converter (ADC). The proposed scheme employs charge recycling method to keep the capacitor arrays free of transitional energy between bit generations except reset phase. In comparison with the conventional switching scheme, the proposed one achieves 100% transitional energy saving without considering reset phase. In addition, configuration of a 10-bit SAR ADC shows that the proposed switching scheme reduces the capacitor area by 25% compared with the conventional switching scheme.     

Out-of-Field Hippocampus from Partial-Body Irradiated Mice Displays Changes in Multi-Omics Profile and Defects in Neurogenesis

The brain undergoes ionizing radiation exposure in many clinical situations, particularly during radiotherapy for brain tumors. The critical role of the hippocampus in the pathogenesis of radiation-induced neurocognitive dysfunction is well recognized. The goal of this study is to test the potential contribution of non-targeted effects in the detrimental response of the hippocampus to irradiation and to elucidate the mechanisms involved. C57Bl/6 mice were whole body (WBI) or partial body (PBI) irradiated with 0.1 or 2.0 Gy of X-rays or sham irradiated. PBI consisted of the exposure of the lower third of the mouse body, whilst the upper two thirds were shielded. Hippocampi were collected 15 days or 6 months post-irradiation and a multi-omics approach was adopted to assess the molecular changes in non-coding RNAs, proteins and metabolic levels, as well as histological changes in the rate of hippocampal neurogenesis. Notably, at 2.0 Gy the pattern of early molecular and histopathological changes induced in the hippocampus at 15 days following PBI were similar in quality and quantity to the effects induced by WBI, thus providing a proof of principle of the existence of out-of-target radiation response in the hippocampus of conventional mice. We detected major alterations in DAG/IP3 and TGF-β signaling pathways as well as in the expression of proteins involved in the regulation of long-term neuronal synaptic plasticity and synapse organization, coupled with defects in neural stem cells self-renewal in the hippocampal dentate gyrus. However, compared to the persistence of the WBI effects, most of the PBI effects were only transient and tended to decrease at 6 months post-irradiation, indicating important mechanistic difference. On the contrary, at low dose we identified a progressive accumulation of molecular defects that tended to manifest at later post-irradiation times. These data, indicating that both targeted and non-targeted radiation effects might contribute to the pathogenesis of hippocampal radiation-damage, have general implications for human health.     

Hyper-Spherical Search (HSS) algorithm: a novel meta-heuristic algorithm to optimize nonlinear functions

This paper proposes a novel optimization algorithm called Hyper-Spherical Search (HSS) algorithm. Like other evolutionary algorithms, the proposed algorithm starts with an initial population. Population individuals are of two types: particles and hyper-sphere centers that all together form particle sets. Searching the hyper-sphere inner space made by the hyper-sphere center and its particle is the basis of the proposed evolutionary algorithm. The HSS algorithm hopefully converges to a state at which there exists only one hyper-sphere center, and its particles are at the same position and have the same cost function value as the hyper-sphere center. Applying the proposed algorithm to some benchmark cost functions shows its ability in dealing with different types of optimization problems. The proposed method is compared with the genetic algorithm (GA), particle swarm optimization (PSO) and harmony search algorithm (HSA). The results show that the HSS algorithm has faster convergence and results in better solutions than GA, PSO and HSA.     

Expert-driven genetic algorithms for simulating evaluation functions

In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Computer Chess Champion. This performance gain is achieved by evolving a program that mimics the behavior of a superior expert. The resulting evaluation function of the evolved program consists of a much smaller number of parameters than the expert’s. The extended experimental results provided in this paper include a report on our successful participation in the 2008 World Computer Chess Championship. In principle, our expert-driven approach could be used in a wide range of problems for which appropriate experts are available.     

Optimal shape design of functionally graded thickness inversion tubes subjected to oblique loading

This paper aims to understand and optimize the crush response of Functionally Graded Thickness (FGT) tubes with various thickness distributions subjected to oblique loading using multi-objective optimization method. Hence, finite element (FE) models are established and their results are validated by experimental tests. Two objective functions (specific energy absorption and peak load) are approximated by four different multi-objective optimization models: the weighted average, multi-design optimization (MDO) technique, constrained single-objective optimization, and geometrical average methods. The optimum design results demonstrate that the selection of appropriate inversion tube parameters such as the die radius, the coefficient of friction between the die and tube, and thickness distribution function have significant roles in the crashworthiness design. The results give new ideas to improve the crashworthiness performance of inversion tubes under oblique loading conditions.     

Implicit branching and parameterized partial cover problems

Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the universe with as few sets of the family as possible. The variations of covering problems include well-known problems like Set Cover, Vertex Cover, Dominating Set and Facility Location to name a few. Recently there has been a lot of study on partial covering problems, a natural generalization of covering problems. Here, the goal is not to cover all the elements but to cover the specified number of elements with the minimum number of sets. In this paper we study partial covering problems in graphs in the realm of parameterized complexity. Classical (non-partial) version of all these problems has been intensively studied in planar graphs and in graphs excluding a fixed graph H as a minor. However, the techniques developed for parameterized version of non-partial covering problems cannot be applied directly to their partial counterparts. The approach we use, to show that various partial covering problems are fixed parameter tractable on planar graphs, graphs of bounded local treewidth and graph excluding some graph as a minor, is quite different from previously known techniques. The main idea behind our approach is the concept of implicit branching. We find implicit branching technique to be interesting on its own and believe that it can be used for some other problems.     

Discussion of “Assessments of Impacts of Climate Change and Human Activities on Runoff with SWAT for the Huifa River Basin, Northeast China” by Aijing Zhang; Chi Zhang; Guobin Fu; Bende Wang; Zhenxin Bao; and Hongxing Zheng

Zhang et al. (Water Resour Manag doi:10.1007/s11269-012-0182-2, 2012) studied the impacts of climate change and human activities on the runoff for the Huifa River basin. They employed a soil and water assessment tool (SWAT), which was calibrated for the baseline period 1956–1964, and then used to reconstruct the natural runoff for the climate change period 1965–2000. Results showed that both climate change and human activities decrease the observed runoff. Climate change impacts on annual runoff were ?37.7, ?59.5, +36.9, and ?45.2 mm/a for 1965–1975, 1976–1985, 1986–1995, and 1996–2005 respectively, compared with the baseline period 1956–1964. Human activities decreased runoff and caused a relatively larger magnitude impact than those of climate change after 1985. Human activities decreased the annual runoff by ?32.9, ?46.8, ?67.8, and ?54.9 mm/a for 1965–1975, 1976–1985, 1986–1995, and 1996–2005 respectively. Human activities further decreased runoff in wet years due to regulation and storage of water projects.     

Algorithm for Increasing the Speed of Evolutionary Optimization and its Accuracy in Multi-objective Problems

Optimization algorithms are important tools for the solution of combinatorial management problems. Nowadays, many of those problems are addressed by using evolutionary algorithms (EAs) that move toward a near-optimal solution by repetitive simulations. Sometimes, such extensive simulations are not possible or are costly and time-consuming. Thus, in this study a method based on artificial neural networks (ANN) is proposed to reduce the number of simulations required in EAs. Specifically, an ANN simulator is used to reduce the number of simulations by the main simulator. The ANN is trained and updated only for required areas in the decision space. Performance of the proposed method is examined by integrating it with the non-dominated sorting genetic algorithm (NSGAII) in multi-objective problems. In terms of density and optimality of the Pareto front, the hybrid NSGAII-ANN is able to extract the Pareto front with much less simulation time compared to the sole use of the NSGAII algorithm. The proposed NSGAII-ANN methodology was examined using three standard test problems (FON, KUR, and ZDT1) and one real-world problem. The latter addresses the operation of a reservoir with two objectives (meeting demand and flood control). Thus, based on this study, use of the NSGAII-ANN integrative algorithm in problems with time-consuming simulators reduces the required time for optimization up to 50 times. Results of the real-world problem, despite lower computational-time requirements, show a performance similar to that achieved in the aforementioned test problems.     

Preparation and characterization of foamed polyurethane/silicone rubber/graphite nanocomposite as radio frequency wave absorbing material: The role of interfacial compatibilization

A novel method for the preparation of radio frequency (RF) wave absorber polyurethane foam (PU) has been developed by impregnation of PU foam in n-hexane solution of room temperature vulcanizing (RTV) silicone rubber (SR) hybridized with graphite nanosheets (GNs) called doping solution. Extent of the GNs dispersion was optimized by the incorporation of a specific type of bifunctional compatibilizer. Insulator to conductive transition threshold as well as electromagnetic wave absorption characteristics of the fabricated nanocomposites was shown to be dependent upon the compatibilizer functionality. All PU/SR/GN nanocomposites generated from bifunctional compatibilizer exhibited higher electrical conductivity with enhanced permittivity implying enhanced formation of conductive networks by GN platelets. Permittivity of the PU/SR/GN nanocomposite based on bifunctional compatibilizer showed to be higher than uncompatibilized counterpart. Electromagnetic reflection loss behavior of the PU/SR/GN nanocomposites exhibited a non-linear correlation with the electrical conductivity. Although all PU/SR/GN prepared nanocomposites exhibited electromagnetic wave reflection loss behavior, but this revealed to be affected by the GN level as well as the size and dispersion state of the graphite nanosheets.