Modelling personal thermal sensations using C-Support Vector Classification (C-SVC) algorithm

The personalised conditioning system (PCS) is widely studied. Potentially, it is able to reduce energy consumption while securing occupants’ thermal comfort requirements. It has been suggested that automatic optimised operation schemes for PCS should be introduced to avoid energy wastage and discomfort caused by inappropriate operation. In certain automatic operation schemes, personalised thermal sensation models are applied as key components to help in setting targets for PCS operation. In this research, a novel personal thermal sensation modelling method based on the C-Support Vector Classification (C-SVC) algorithm has been developed for PCS control. The personal thermal sensation modelling has been regarded as a classification problem. During the modelling process, the method ‘learns’ an occupant’s thermal preferences from his/her feedback, environmental parameters and personal physiological and behavioural factors. The modelling method has been verified by comparing the actual thermal sensation vote (TSV) with the modelled one based on 20 individual cases. Furthermore, the accuracy of each individual thermal sensation model has been compared with the outcomes of the PMV model. The results indicate that the modelling method presented in this paper is an effective tool to model personal thermal sensations and could be integrated within the PCS for optimised system operation and control.

Bio-inspired ant colony optimization based clustering algorithm with mobile sinks for applications in consumer home automation networks

With the fast development of wireless communications, ZigBee and semiconductor devices, home automation networks have recently become very popular. Since typical consumer products deployed in home automation networks are often powered by tiny and limited batteries, one of the most challenging research issues is concerning energy reduction and the balancing of energy consumption across the network in order to prolong the home network lifetime for consumer devices. The introduction of clustering and sink mobility techniques into home automation networks have been shown to be an efficient way to improve the network performance and have received significant research attention. Taking inspiration from nature, this paper proposes an Ant Colony Optimization (ACO) based clustering algorithm specifically with mobile sink support for home automation networks. In this work, the network is divided into several clusters and cluster heads are selected within each cluster. Then, a mobile sink communicates with each cluster head to collect data directly through short range communications. The ACO algorithm has been utilized in this work in order to find the optimal mobility trajectory for the mobile sink. Extensive simulation results from this research show that the proposed algorithm significantly improves home network performance when using mobile sinks in terms of energy consumption and network lifetime as compared to other routing algorithms currently deployed for home automation networks.

Rejection thresholds (RjT) of sweet likers and dislikers

Sweetness is generally a desirable taste, however consumers can be grouped into sweet likers and dislikers according to optimally preferred sucrose concentrations. Understanding the levels of sweetness in products that are acceptable and unacceptable to both consumer groups is important to product development and for influencing dietary habits. The concentrations at which sucrose decreases liking (the rejection threshold; RjT) in liquid and semi-solid matrices were investigated in this study. Thirty six consumers rated their liking of 5 sucrose aqueous solutions; this identified 36% sweet likers (SL) whose liking ratings increased with increasing sucrose and 64% sweet dislikers (SD) whose liking ratings decreased above 6% (w/v) sucrose. We hypothesized that SL and SD would have different RjT for sucrose in products. This was tested by preparing 8 levels of sucrose in orange juice and orange jelly and presenting each against the lowest level in forced choice preference tests. In orange juice, as sucrose increased from 33g/L to 75g/L the proportion of people preferring the sweeter sample increased in both groups. However, at higher sucrose levels, the proportion of consumers preferring the sweet sample decreased. For SD, a RjT was reached at 380 g/L, whereas a significant RjT for SL was not reached. RjT in jelly were not reached as the sweetness in orange jelly was significantly lower than for orange juice (p<0.001). Despite statistically significant differences in rated sweetness between SL and SD (p=0.019), the extent of difference between the two groups was minor. The results implied that sweet liker status was not substantially related to differences in sweetness perception. Self-reported dietary intake of carbohydrate, sugars and sucrose were not significantly affected by sweet liker status. However the failure to find an effect may be due to the small sample size and future studies within a larger, more representative population sample are justifiable from the results of this study.

A constrained recursive least squares algorithm for adaptive combination of multiple models

In this paper, we develop a novel constrained recursive least squares algorithm for adaptively combining a set of given multiple models. With data available in an online fashion, the linear combination coefficients of submodels are adapted via the proposed algorithm.We propose to minimize the mean square error with a forgetting factor, and apply the sum to one constraint to the combination parameters. Moreover an l1-norm constraint to the combination parameters is also applied with the aim to achieve sparsity of multiple models so that only a subset of models may be selected into the final model. Then a weighted l2-norm is applied as an approximation to the l1-norm term. As such at each time step, a closed solution of the model combination parameters is available. The contribution of this paper is to derive the proposed constrained recursive least squares algorithm that is computational efficient by exploiting matrix theory. The effectiveness of the approach has been demonstrated using both simulated and real time series examples.

A generalised background correction algorithm for a Halo Doppler lidar and its application to data from Finland

Current commercially available Doppler lidars provide an economical and robust solution for measuring vertical and horizontal wind velocities, together with the ability to provide co- and cross-polarised backscatter profiles. The high temporal resolution of these instruments allows turbulent properties to be obtained from studying the variation in radial velocities. However, the instrument specifications mean that certain characteristics, especially the background noise behaviour, become a limiting factor for the instrument sensitivity in regions where the aerosol load is low. Turbulent calculations require an accurate estimate of the contribution from velocity uncertainty estimates, which are directly related to the signal-to-noise ratio. Any bias in the signal-to-noise ratio will propagate through as a bias in turbulent properties. In this paper we present a method to correct for artefacts in the background noise behaviour of commercially available Doppler lidars and reduce the signal-to-noise ratio threshold used to discriminate between noise, and cloud or aerosol signals. We show that, for Doppler lidars operating continuously at a number of locations in Finland, the data availability can be increased by as much as 50 % after performing this background correction and subsequent reduction in the threshold. The reduction in bias also greatly improves subsequent calculations of turbulent properties in weak signal regimes.

Gaze stabilization testing: The efficiency and test-retest reliability of user operated control versus the parameter estimation (PEST) algorithm

The primary objective of this research study is to determine which form of testing, the PEST algorithm or an operator-controlled condition is most accurate and time efficient for administration of the gaze stabilization test

The SARS algorithm: detrending CoRoT light curves with Sysrem using simultaneous external parameters

Surveys for exoplanetary transits are usually limited not by photon noise but rather by the amount of red noise in their data. In particular, although the CoRoT space-based survey data are being carefully scrutinized, significant new sources of systematic noises are still being discovered. Recently, a magnitude-dependant systematic effect was discovered in the CoRoT data by Mazeh et al. and a phenomenological correction was proposed. Here we tie the observed effect to a particular type of effect, and in the process generalize the popular Sysrem algorithm to include external parameters in a simultaneous solution with the unknown effects. We show that a post-processing scheme based on this algorithm performs well and indeed allows for the detection of new transit-like signals that were not previously detected.

Genetic algorithm inversion of the average 1D crustal structure using local and regional earthquakes

Knowing the best 1D model of the crustal and upper mantle structure is useful not only for routine hypocenter determination, but also for linearized joint inversions of hypocenters and 3D crustal structure, where a good choice of the initial model can be very important. Here, we tested the combination of a simple GA inversion with the widely used HYPO71 program to find the best three-layer model (upper crust, lower crust, and upper mantle) by minimizing the overall P- and S-arrival residuals, using local and regional earthquakes in two areas of the Brazilian shield. Results from the Tocantins Province (Central Brazil) and the southern border of the Sao Francisco craton (SE Brazil) indicated an average crustal thickness of 38 and 43 km, respectively, consistent with previous estimates from receiver functions and seismic refraction lines. The GA + HYPO71 inversion produced correct Vp/Vs ratios (1.73 and 1.71, respectively), as expected from Wadati diagrams. Tests with synthetic data showed that the method is robust for the crustal thickness, Pn velocity, and Vp/Vs ratio when using events with distance up to about 400 km, despite the small number of events available (7 and 22, respectively). The velocities of the upper and lower crusts, however, are less well constrained. Interestingly, in the Tocantins Province, the GA + HYPO71 inversion showed a secondary solution (local minimum) for the average crustal thickness, besides the global minimum solution, which was caused by the existence of two distinct domains in the Central Brazil with very different crustal thicknesses. (C) 2010 Elsevier Ltd. All rights reserved.

Donor bone marrow cells play a role in the prevention of accelerated graft rejection induced by semi-allogeneic spleen cells in transplantation

Spleen or spleen plus bone marrow cells from (BALB/c x C57Bl/6)F1 donors were transferred into BALB/c recipients 21 days before skin or cardiac transplantation. Prolonged graft survival was observed on recipients treated with the mixture of donor-derived cells as compared to those treated with spleen cells alone. We evaluated the expression of CD45RB and CD44 by splenic CD4(+) and CD8(+) T cells 7 and 21 days after donor cell transfer. The populations of CD8(+)CD45RB(low) and CD8(+)CD44(high) cells were significantly decreased in mice pre-treated with donor spleen and bone marrow cells as compared to animals treated with spleen cells only, although these cells expanded in both groups when compared to an earlier time-point. No differences were observed regarding CD4+ T cell population when recipients of donor-derived cells were compared. An enhanced production of IL-10 was observed seven days after transplantation in the supernatants of spleen cell cultures of mice treated with spleen and bone marrow cells. Taken together these data suggest that donor-derived bone marrow cells modulate the sensitization of the recipient by semi-allogeneic spleen cells in part by delaying the generation of activated/memory CD8(+) T cells leading to enhanced graft survival. (c) 2007 Elsevier B.V. All rights reserved.

Detection of the Tim-3 ligand, galectin-9, inside the allograft during a rejection episode

Introduction: Tim-3 is a Th1 lymphocytes membrane protein with inhibitory function. Its ligand, galectin-9, was recently identified and it is expressed in some lymphocyte subpopulation. In addition, endothelial cells and fibroblasts can also express galectin-9 according to the local cytokine milieu. Both molecules can act as important regulatory tools in the immune system. Aim: Evaluate the expression of these immunoregulatory molecules inside kidney allografts during acute rejection episodes. Methods: By using a quantitative polymerase chain reaction assay, we measured the levels of messenger RNA (mRNA) for galectin-9 and Tim-3 in 21 samples obtained at allograft nephrectomy. Five samples received the histological diagnosis of acute non-vascular rejection (ANVR), twelve of acute vascular rejection (AVR), and five of loss of non-immune cause (LNIC; as control). As cytolytic response markers we measured mRNA levels of granzyme B, interferon-gamma and perforin. The statistic analysis was performed using one way analysis of variance (ANOVA) and Pearson correlation. Results: The mean levels of Tim-3 mRNA expression were 13.99 +/- 6.99 for LNIC, 48.13 +/- 54.47 for RACNV and 238.63 +/- 333.14 for RAV (p = 0.004). For galectin-9, the mean values were 0.57 +/- 0.49 for LNIC, 0.66 +/- 0.36 for RACNV and 2.34 +/- 1.62 for RAV (p = 0.006). Furthermore, there was a positive correlation between both molecules (r = 0.526, p = 0.016). Also. granzyme B, perforin and interferon-gamma mRNA expression were different among the three groups. Conclusion: Messenger RNA level expressions of all the studied molecules were higher inside allografts with more severe rejection. Moreover, there was a positive correlation between galectin-9 and Tim-3 mRNA levels. The simultaneous expression of galectin-9 and Tim-3 may indicate an immunoregulatory function, during the ongoing cytotoxic response. (C) 2008 Elsevier B.V. All rights reserved.

Toll-like receptors-related genes in kidney transplant patients with chronic allograft nephropathy and acute rejection

Introduction: Toll-like receptors (TLR) comprehend an emerging family of receptors that recognize pathogen-associated molecular patterns and promote the activation of leukocytes. Surgical trauma and ischemia-reperfusion injury are likely to provide exposure to endogenous ligands for TLR in virtually all kidney transplant recipients. Methods: Macroarray (GEArray OHS-018.2 Series-Superarray) analyses of 128 genes involved in TLR signaling pathway were performed in nephrectomy samples of patients with chronic allograft nephropathy (CAN) and acute rejection (AR, vascular and non vascular). The analysis of each membrane was performed by GEArray Expression Analysis Suite 2.0. Results: Macroarray profile identified a gene expression signature that could discriminate CAN and AR. Three genes were significantly expressed between CAN and vascular AR: Pellino 2; IL 8 and UBE2V1. In relation to vascular and non-vascular AR, there were only two genes with statistical significance: IL-6 and IRAK-3. Conclusion: Vascular and non-vascular AR and CAN showed different expression of a few genes in TLR pathway. The analysis of nephrectomy showed that activation of TLR pathway is present in AR and CAN. (C) 2008 Elsevier B.V. All rights reserved.

Investigation of a new GRASP-based clustering algorithm applied to biological data

A large amount of biological data has been produced in the last years. Important knowledge can be extracted from these data by the use of data analysis techniques. Clustering plays an important role in data analysis, by organizing similar objects from a dataset into meaningful groups. Several clustering algorithms have been proposed in the literature. However, each algorithm has its bias, being more adequate for particular datasets. This paper presents a mathematical formulation to support the creation of consistent clusters for biological data. Moreover. it shows a clustering algorithm to solve this formulation that uses GRASP (Greedy Randomized Adaptive Search Procedure). We compared the proposed algorithm with three known other algorithms. The proposed algorithm presented the best clustering results confirmed statistically. (C) 2009 Elsevier Ltd. All rights reserved.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

A Mass-Conserving Algorithm for Dynamical Lubrication Problems With Cavitation

A numerical algorithm for fully dynamical lubrication problems based on the Elrod-Adams formulation of the Reynolds equation with mass-conserving boundary conditions is described. A simple but effective relaxation scheme is used to update the solution maintaining the complementarity conditions on the variables that represent the pressure and fluid fraction. The equations of motion are discretized in time using Newmark`s scheme, and the dynamical variables are updated within the same relaxation process just mentioned. The good behavior of the proposed algorithm is illustrated in two examples: an oscillatory squeeze flow (for which the exact solution is available) and a dynamically loaded journal bearing. This article is accompanied by the ready-to-compile source code with the implementation of the proposed algorithm. [DOI: 10.1115/1.3142903]

Improvements on the Porter`s Stemming Algorithm for Portuguese

The amount of textual information digitally stored is growing every day. However, our capability of processing and analyzing that information is not growing at the same pace. To overcome this limitation, it is important to develop semiautomatic processes to extract relevant knowledge from textual information, such as the text mining process. One of the main and most expensive stages of the text mining process is the text pre-processing stage, where the unstructured text should be transformed to structured format such as an attribute-value table. The stemming process, i.e. linguistics normalization, is usually used to find the attributes of this table. However, the stemming process is strongly dependent on the language in which the original textual information is given. Furthermore, for most languages, the stemming algorithms proposed in the literature are computationally expensive. In this work, several improvements of the well know Porter stemming algorithm for the Portuguese language, which explore the characteristics of this language, are proposed. Experimental results show that the proposed algorithm executes in far less time without affecting the quality of the generated stems.