A Memetic Algorithm for the location-based continuously operating reference stations placement problem in Network Real-Time Kinematic

Network Real-Time Kinematic (NRTK) is a technology that can provide centimeter-level accuracy positioning services in real time, and it is enabled by a network of Continuously Operating Reference Stations (CORS). The location-oriented CORS placement problem is an important problem in the design of a NRTK as it will directly affect not only the installation and operational cost of the NRTK, but also the quality of positioning services provided by the NRTK. This paper presents a Memetic Algorithm (MA) for the location-oriented CORS placement problem, which hybridizes the powerful explorative search capacity of a genetic algorithm and the efficient and effective exploitative search capacity of a local optimization. Experimental results have shown that the MA has better performance than existing approaches. In this paper we also conduct an empirical study about the scalability of the MA, effectiveness of the hybridization technique and selection of crossover operator in the MA.

BOSTER : an efficient algorithm for mining frequent unordered induced subtrees

Extracting frequent subtrees from the tree structured data has important applications in Web mining. In this paper, we introduce a novel canonical form for rooted labelled unordered trees called the balanced-optimal-search canonical form (BOCF) that can handle the isomorphism problem efficiently. Using BOCF, we define a tree structure guided scheme based enumeration approach that systematically enumerates only the valid subtrees. Finally, we present the balanced optimal search tree miner (BOSTER) algorithm based on BOCF and the proposed enumeration approach, for finding frequent induced subtrees from a database of labelled rooted unordered trees. Experiments on the real datasets compare the efficiency of BOSTER over the two state-of-the-art algorithms for mining induced unordered subtrees, HybridTreeMiner and UNI3. The results are encouraging.

BEST : an efficient algorithm for mining frequent unordered embedded subtrees

This paper presents an algorithm for mining unordered embedded subtrees using the balanced-optimal-search canonical form (BOCF). A tree structure guided scheme based enumeration approach is defined using BOCF for systematically enumerating the valid subtrees only. Based on this canonical form and enumeration technique, the balanced optimal search embedded subtree mining algorithm (BEST) is introduced for mining embedded subtrees from a database of labelled rooted unordered trees. The extensive experiments on both synthetic and real datasets demonstrate the efficiency of BEST over the two state-of-the-art algorithms for mining embedded unordered subtrees, SLEUTH and U3.

Metabolic and hormonal responses to isoenergetic high-intensity interval exercise and continuous moderate-intensity exercise

This study investigated the effects of high-intensity interval training (HIIT) vs. work-matched moderate-intensity continuous exercise (MOD) on metabolism and counterregulatory stress hormones. In a randomized and counterbalanced order, 10 well-trained male cyclists and triathletes completed a HIIT session [81.6 ± 3.7% maximum oxygen consumption (V̇o2 max); 72.0 ± 3.2% peak power output; 792 ± 95 kJ] and a MOD session (66.7 ± 3.5% V̇o2 max; 48.5 ± 3.1% peak power output; 797 ± 95 kJ). Blood samples were collected before, immediately after, and 1 and 2 h postexercise. Carbohydrate oxidation was higher (P = 0.037; 20%), whereas fat oxidation was lower (P = 0.037; −47%) during HIIT vs. MOD. Immediately after exercise, plasma glucose (P = 0.024; 20%) and lactate (P < 0.01; 5.4×) were higher in HIIT vs. MOD, whereas total serum free fatty acid concentration was not significantly different (P = 0.33). Targeted gas chromatography-mass spectromtery metabolomics analysis identified and quantified 49 metabolites in plasma, among which 11 changed after both HIIT and MOD, 13 changed only after HIIT, and 5 changed only after MOD. Notable changes included substantial increases in tricarboxylic acid intermediates and monounsaturated fatty acids after HIIT and marked decreases in amino acids during recovery from both trials. Plasma adrenocorticotrophic hormone (P = 0.019), cortisol (P < 0.01), and growth hormone (P < 0.01) were all higher immediately after HIIT. Plasma norepinephrine (P = 0.11) and interleukin-6 (P = 0.20) immediately after exercise were not significantly different between trials. Plasma insulin decreased during recovery from both HIIT and MOD (P < 0.01). These data indicate distinct differences in specific metabolites and counterregulatory hormones following HIIT vs. MOD and highlight the value of targeted metabolomic analysis to provide more detailed insights into the metabolic demands of exercise.

A hybrid maximum power point tracking for partially shaded photovoltaic systems in the tropics

Partial shading and rapidly changing irradiance conditions significantly impact on the performance of photovoltaic (PV) systems. These impacts are particularly severe in tropical regions where the climatic conditions result in very large and rapid changes in irradiance. In this paper, a hybrid maximum power point (MPP) tracking (MPPT) technique for PV systems operating under partially shaded conditions witapid irradiance change is proposed. It combines a conventional MPPT and an artificial neural network (ANN)-based MPPT. A low cost method is proposed to predict the global MPP region when expensive irradiance sensors are not available or are not justifiable for cost reasons. It samples the operating point on the stairs of I–V curve and uses a combination of the measured current value at each stair to predict the global MPP region. The conventional MPPT is then used to search within the classified region to get the global MPP. The effectiveness of the proposed MPPT is demonstrated using both simulations and an experimental setup. Experimental comparisons with four existing MPPTs are performed. The results show that the proposed MPPT produces more energy than the other techniques and can effectively track the global MPP with a fast tracking speed under various shading patterns.

Lifecycle optimization and tradeoff analysis among competing objectives for a road corridor

While the philosophical motivation behind Civil Infrastructure Management Systems is to achieve optimal level of service at a minimum cost, the allocation of scarce resources among competing alternatives is still a matter of debate. It appears to be widely accepted that results from tradeoff analysis can be measured by the degree of accomplishment of the objectives. Road management systems not only deal with different asset types but also with conflicting objectives. This paper presents a case study of lifecycle optimization with tradeoff analysis for a road corridor in New Brunswick. Objectives of the study included condition of bridge and roads and road safety. A road safety index was created based on potential for improvement. Road condition was based on roughness, rutting and cracking. Initial results show lack of sustainability in bridge performance. Therefore, bridges where broken by components: deck, superstructure and substructure. Visual inspections, in addition to construction age of each bridge, were combined to generate a surrogate apparent age. Two life cycle analysis were conducted; one aimed to minimize overall cost while achieving sustainable results and another one purely for optimization. -used to identify required levels of budget. Such analyses were used to identify the minimum required budget and to demonstrate that with the same amount of money it was possible to achieve better levels of performance. Dominance and performance driven criteria were combined to identify and select an optimal result. It was found that achievement of optimally sustained results is conditioned by the availability of treatments for all asset classes at across their life spans. For the case study a disaggregated bridge condition index was introduced to the original algorithm to attempt to achieve sustainability in all bridges components, however lack of early stage treatments for substructures produce declining trends for such a component.

Pollen image classification using the classifynder system: Algorithm comparison and a case study on New Zealand honey

We describe an investigation into how Massey University’s Pollen Classifynder can accelerate the understanding of pollen and its role in nature. The Classifynder is an imaging microscopy system that can locate, image and classify slide based pollen samples. Given the laboriousness of purely manual image acquisition and identification it is vital to exploit assistive technologies like the Classifynder to enable acquisition and analysis of pollen samples. It is also vital that we understand the strengths and limitations of automated systems so that they can be used (and improved) to compliment the strengths and weaknesses of human analysts to the greatest extent possible. This article reviews some of our experiences with the Classifynder system and our exploration of alternative classifier models to enhance both accuracy and interpretability. Our experiments in the pollen analysis problem domain have been based on samples from the Australian National University’s pollen reference collection (2,890 grains, 15 species) and images bundled with the Classifynder system (400 grains, 4 species). These samples have been represented using the Classifynder image feature set.We additionally work through a real world case study where we assess the ability of the system to determine the pollen make-up of samples of New Zealand honey. In addition to the Classifynder’s native neural network classifier, we have evaluated linear discriminant, support vector machine, decision tree and random forest classifiers on these data with encouraging results. Our hope is that our findings will help enhance the performance of future releases of the Classifynder and other systems for accelerating the acquisition and analysis of pollen samples.

What patient information allows us to make accurate predictions of outcome?

Only some of the information contained in a medical record will be useful to the prediction of patient outcome. We describe a novel method for selecting those outcome predictors which allow us to reliably discriminate between adverse and benign end results. Using the area under the receiver operating characteristic as a nonparametric measure of discrimination, we show how to calculate the maximum discrimination attainable with a given set of discrete valued features. This upper limit forms the basis of our feature selection algorithm. We use the algorithm to select features (from maternity records) relevant to the prediction of failure to progress in labour. The results of this analysis motivate investigation of those predictors of failure to progress relevant to parous and nulliparous sub-populations.

Using upper bounds on attainable discrimination to select discrete valued features

Selection of features that will permit accurate pattern classification is a difficult task. However, if a particular data set is represented by discrete valued features, it becomes possible to determine empirically the contribution that each feature makes to the discrimination between classes. This paper extends the discrimination bound method so that both the maximum and average discrimination expected on unseen test data can be estimated. These estimation techniques are the basis of a backwards elimination algorithm that can be use to rank features in order of their discriminative power. Two problems are used to demonstrate this feature selection process: classification of the Mushroom Database, and a real-world, pregnancy related medical risk prediction task - assessment of risk of perinatal death.

Mechanism of kaolinite sheets curling via the intercalation and delamination process

Kaolinite naturally occurs in the plate form for the interlayer hydrogen bond and the distortion and adaption of tetrahedron and octahedron. But kaolinite sheets can be exfoliated to nanoscrolls artificially in laboratory through multiple-step displacement intercalation. The driving force for kaolinite sheet to be curled nanoscroll originates from the size discrepancy of Si–O tetrahedron and Al–O octahedron. The displacement intercalation promoted the platy kaolinite sheets spontaneously to be scrolled by eliminating the interlayer hydrogen bond and atomic interaction. Kaolinite nanoscrolls are hollow tubes with outer face of tetrahedral sheet and inner face of octahedral sheet. Based on the theoretical calculation it is firstly reported that the minimum interior diameter for a single kaolinite sheet to be scrolled is about 9.08 nm, and the optimal 24.30 nm, the maximum 100 nm, which is verified by the observation of scanning electron microscope and transmission electron microscope. The different adaption types and discrepancy degree between tetrahedron and octahedron generate various curling forces in different directions. The nanoscroll axes prefer the directions as [100], [1 �10], [110], [3 �10], and the relative curling force are as follows, [3 �10] > [100] = [1�10] > [110].

A communication model and partitioning algorithm for streaming applications for an embedded MPSoC

Energy efficient embedded computing enables new application scenarios in mobile devices like software-defined radio and video processing. The hierarchical multiprocessor considered in this work may contain dozens or hundreds of resource efficient VLIW CPUs. Programming this number of CPU cores is a complex task requiring compiler support. The stream programming paradigm provides beneficial properties that help to support automatic partitioning. This work describes a compiler for streaming applications targeting the self-build hierarchical CoreVA-MPSoC multiprocessor platform. The compiler is supported by a programming model that is tailored to fit the streaming programming paradigm. We present a novel simulated-annealing (SA) based partitioning algorithm, called Smart SA. The overall speedup of Smart SA is 12.84 for an MPSoC with 16 CPU cores compared to a single CPU implementation. Comparison with a state of the art partitioning algorithm shows an average performance improvement of 34.07%.

An efficient forward-backward algorithm to MSDEPP including batteries and voltage control devices

Electric distribution networks are now in the era of transition from passive to active distribution networks with the integration of energy storage devices. Optimal usage of batteries and voltage control devices along with other upgrades in network needs a distribution expansion planning (DEP) considering inter-temporal dependencies of stages. This paper presents an efficient approach for solving multi-stage distribution expansion planning problems (MSDEPP) based on a forward-backward approach considering energy storage devices such as batteries and voltage control devices such as voltage regulators and capacitors. The proposed algorithm is compared with three other techniques including full dynamic, forward fill-in, backward pull-out from the point of view of their precision and their computational efficiency. The simulation results for the IEEE 13 bus network show the proposed pseudo-dynamic forward-backward approach presents good efficiency in precision and time of optimization.