A hierarchical, agent-based service oriented architecture for smart environments

Service Oriented Architectures, which allow for the integration of different subsystems and of applications running on different devices and platforms, may be very suitable to solve the problem of service personalization in large smart environments like cities, where the number of potential users and potentially available services is rapidly growing. Taking this into account, we have designed an agent-based service oriented architecture for smart spaces. Two of the greatest challenges in the design of such a solution are providing effective device, service and context federation and composition mechanisms and handling user mobility. For the first challenge, we have designed a hierarchical architecture and developed a set of inheritance, aggregation and access mechanisms for devices, services and context. To handle user mobility, we have followed three different strategies, using stationary, mobile or nomadic agents. In this paper, we describe the main aspects of our architecture and perform an experimental evaluation to determine the advantages and drawbacks of the different strategies.     

Gaussian mean-shift is an EM algorithm

The mean-shift algorithm, based on ideas proposed by Fukunaga and Hosteller, is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density estimate. Mean-shift can be used as a nonparametric clustering method and has attracted recent attention in computer vision applications such as image segmentation or tracking. We show that, when the kernel is Gaussian, mean-shift is an expectation-maximization (EM) algorithm and, when the kernel is non-Gaussian, mean-shift is a generalized EM algorithm. This implies that mean-shift converges from almost any starting point and that, in general, its convergence is of linear order. For Gaussian mean-shift, we show: 1) the rate of linear convergence approaches 0 (superlinear convergence) for very narrow or very wide kernels, but is often close to 1 (thus, extremely slow) for intermediate widths and exactly 1 (sublinear convergence) for widths at which modes merge, 2) the iterates approach the mode along the local principal component of the data points from the inside of the convex hull of the data points, and 3) the convergence domains are nonconvex and can be disconnected and show fractal behavior. We suggest ways of accelerating mean-shift based on the EM interpretation     

Arity and alternation: a proper hierarchy in higher order logics

We study the effect of simultaneously bounding the maximal-arity of the higher-order variables and the alternation of quantifiers in higher-order logics, as to their expressive power on finite structures (or relational databases). Let $\mathit{AA}^i(r,m)$ be the class of (i?+?1)-th order logic formulae where all quantifiers are grouped together at the beginning of the formulae, forming m alternating blocks of consecutive existential and universal quantifiers, and such that the maximal-arity (a generalization of the concept of arity, not just the maximal of the arities of the quantified variables) of the higher-order variables is bounded by r. Note that, the order of the quantifiers in the prefix may be mixed. We show that, for every i?≥?1, the resulting $\mathit{AA}^i(r,m)$ hierarchy of formulae of (i?+?1)-th order logic is proper. This extends a result by Makowsky and Pnueli who proved that the same hierarchy in second-order logic is proper. In both cases the strategy used to prove the results consists in considering formulae which, represented as finite structures, satisfy themselves. As the well known diagonalization argument applies here, this gives rise, for each order i and each level of the $\mathit{AA}^i(r,m)$ hierarchy of arity and alternation, to a class of formulae which is not definable in that level, but which is definable in a higher level of the same hierarchy. We then use a similar argument to prove that the classes of $\Sigma^i_m \cup \Pi^i_m$ formulae in which the higher-order variables of all orders up to i?+?1 have maximal-arity at most r, also induce a proper hierarchy in each higher-order logic of order i?≥?3. It is not known whether the correspondent hierarchy in second-order logic is proper. Using the concept of finite model truth definitions introduced by M. Mostowski, we give a sufficient condition for that to be the case.     

Protein radial distribution function (P-RDF) and Bayesian-Regularized Genetic Neural Networks for modeling protein conformational stability: chymotrypsin inhibitor 2 mutants

Development of novel computational approaches for modeling protein properties is a main goal in applied Proteomics. In this work, we reported the extension of the radial distribution function (RDF) scores formalism to proteins for encoding 3D structural information with modeling purposes. Protein-RDF (P-RDF) scores measure spherical distributions on protein 3D structure of 48 amino acids/residues properties selected from the AAindex data base. P-RDF scores were tested for building predictive models of the change of thermal unfolding Gibbs free energy change (DeltaDeltaG) of chymotrypsin inhibitor 2 upon mutations. In this sense, an ensemble of Bayesian-Regularized Genetic Neural Networks (BRGNNs) yielded an optimum nonlinear model for the conformational stability. The ensemble predictor described about 84% and 70% variance of the data in training and test sets, respectively.     

Model for small superconducting variable-thickness bridge constrictions

We present a simple model to simulate small three-dimensional superconducting constrictions of variable thickness (VTBs) for which the cross-sectional dimensions are of the same order as the length, and both are less than (T). We study the behavior of the modulus of the order parameterf and the supercurrent densityJ _s as a function of the various dimensions. We find that the extent to whichf is depressed in the banks depends on the ratio of width to length of the constriction. We show that even for very abrupt geometries,J _s is not zero andf does not reach its equilibrium value immediately outside the constriction. On the basis of our results, we propose a more general expression for the effective length valid also when all dimensions are of the same order. The calculated values ofdI _c /dT are consistent with experimental data from well-characterized VTBs. We suggest that the discrepancy between the calculated and experimental values ofI _c R _n may be due to the nonuniformity of the normal current density in the constriction.     

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.     

Influence of photoperiod on carbon dioxide and methane emissions from two pilot-scale stabilization ponds

Greenhouse gas (GHG) emissions (CO(2), CH(4)) from pilot-scale algal and duckweed-based ponds (ABP and DBP) were measured using the static chamber methodology. Daylight and nocturnal variations of GHG and wastewater characteristics (e.g. chemical oxygen demand (COD), pH) were determined via sampling campaigns during midday (12:30-15:30) and midnight (00:30-03:30) periods. The results showed that under daylight conditions in ABP median emissions were -232 mg CO(2) m(-2) d(-1) and 9.9 mg CH(4) m(-2) d(-1), and in DBP median emissions were -1,654.5 mg CO(2) m(-2) d(-1) and 71.4 mg CH(4) m(-2) d(-1), respectively. During nocturnal conditions ABP median emissions were 3,949.9 mg CO(2) m(-2) d(-1), 12.7 mg CH(4) m(-2) d(-1), and DBP median emissions were 5,116 mg CO(2) m(-2) d(-1), 195.2 mg CH(4) m(-2) d(-1), respectively. Once data measured during daylight were averaged together with nocturnal data the median emissions for ABP were 1,566.8 mg CO(2) m(-2) d(-1) and 72.1 mg CH(4) m(-2) d(-1), whilst for DBP they were 3,016.9 mg CO(2) m(-2) d(-) and 178.9 mg CH(4) m(-2) d(-1), respectively. These figures suggest that there were significant differences between CO(2) emissions measured during daylight and nocturnal periods (p < 0.05). This shows a sink-like behaviour for both ABP and DBP in the presence of solar light, which indicates the influence of photosynthesis in CO(2) emissions. On the other hand, the fluxes of CH(4) indicated that DBP and ABP behave as net sources of CH(4) during day and night, although higher emissions were observed from DBP. Overall, according to the compound average (daylight and nocturnal emissions) both ABP and DBP systems might be considered as net sources of GHG.     

Exploiting eye–hand coordination to detect grasping movements

Human beings are very skillful at reaching for and grasping objects under multiple conditions, even when faced with an object's wide variety of positions, locations, structures and orientations. This natural ability, controlled by the human brain, is called eye–hand coordination. To understand this behavior it is necessary to study both eye and hand movements simultaneously. This paper proposes a novel approach to detect grasping movements by means of computer vision techniques. This solution fuses two viewpoints, one viewpoint which is obtained from an eye-tracker capturing the user's perspective and a second viewpoint which is captured by a wearable camera attached to a user's wrist. Utilizing information from these two viewpoints it is possible to characterize multiple hand movements in conjunction with eye-gaze movements through a Hidden–Markov Model framework. This paper shows that combining these two sources makes it possible to detect hand gestures using only the objects contained in the scene even without markers on the surface of the objects. In addition, it is possible to detect which is the desired object before the user can actually grasp said object.