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.     

Extracting Optimal Policies of Hydropower Multi-Reservoir Systems Utilizing Enhanced Differential Evolution Algorithm

Deriving the optimal policies of hydropower multi-reservoir systems is a nonlinear and high-dimensional problem which makes it difficult to achieve the global or near global optimal solution. In order to optimally solve the problem effectively, development of optimization methods with the purpose of optimizing reservoir operation is indispensable as well as inevitable. This paper introduces an enhanced differential evolution (EDE) algorithm to enhance the exploration and exploitation abilities of the original differential evolution (DE) algorithm. The EDE algorithm is first applied to minimize two benchmark functions (Ackley and Shifted Schwefel). In addition, a real world two-reservoir hydropower optimization problem and a large scale benchmark problem, namely ten-reservoir problem, were considered to indicate the effectiveness of the EDE. The performance of the EDE was compared with the original DE to solve the three optimization problems. The results demonstrate that the EDE would have a powerful global ability and faster convergence than the original DE to solve the two benchmark functions. In the 10-reservoir optimization problem, the EDE proved to be much more functional to reach optimal or near optimal solution and to be effective in terms of convergence rate, standard deviation, the best, average and worst values of objective function than the original DE. Also, In the case of two-reservoir system, the best values of the objective function obtained 93.86 and 101.09 for EDE and DE respectively. Based on the results, it can be stated that the most important reason to improve the performance of the EDE algorithm is the promotion of local and global search abilities of the DE algorithm using the number of novel operators. Also, the results of these three problems corroborated the superior performance, the high efficiency and robustness of the EDE to optimize complex and large scale multi-reservoir operation problems.     

A novel triple notch‐bands ultra wide‐band band‐pass filters using parallel multi‐mode resonators and CSRRs

This article discusses a technique based on combination of multimode resonators (MMR) and complementary split ring resonators (CSRR) to design multi notch‐bands ultra wide‐band (UWB) band‐pass filters (BPF). The proposed structure consists of two parallel multimode resonators, resulting in a dual notch‐band UWB BPF, integrated with a single cell of CSRR to realize the third notch‐band. The mechanism of realizing the notch‐bands is mathematically presented and a triple notch‐bands UWB BPF is designed, simulated and fabricated. The overall size of the proposed filter is reported to be around 36 × 7.7 mm² where a size reduction of around 35% is demonstrated in comparison to the conventional filter. © 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:375–381, 2014.     

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.     

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.     

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.