Sterols,methyl sterols,triterpene alcohols and fatty acids of the kernel fat of different malagasy mango(Mangifera indica) varieties

The kernel fat content of 16 different mango varieties collected from the Northwestern part of Madagascar island were examined. The fat content (22–54%) was determined by chloroform/methanol extraction. Investigation by gas liquid chromatography (GLC) revealed 15 fatty acids, mainly palmitic (7–12%), stearic (22–40%), oleic (41–48%) and linoleic (7–17%). Significant correlations were observed among the main fatty acids. Testing for the sterol fraction in 15 mango varieties allowed us to separate and quantitatively analyze 7 sterols by GLC. The main sterols wereβ-sitosterol (47–76%), stigmasterol (12–23%) and campesterol (7–12%). The stigmasterol/campesterol ratio (1.2:2.3) was lower in mango kernel fat than in cocoa butter. Among the 4-methyl sterol fractions, gramisterol, lophenol, obtusifoliol and citrostadienol were tentatively identified by GLC. Lupeol, cycloartenol,α- andβ-amyrins and friedelinol were tentatively identified by GLC in the triterpene alcohols fractions.     

Application of the percolation model to gelation of an epoxy resin

The percolation model has been applied to the study of gelation of the TGDDM-DDS system (tetraglycidyldiaminodiphenylmethane–diaminodiphenylsulfone) at a mass concentration of 100–30. For each temperature the experimental viscosity curves are satisfactorily described by a percolation law. Using the degree of chemical reactions, X, as a variable, a very clear change in the reaction mechanism with temperature can be shown. Then a rate of advancement of effective reactions, Y, is defined. This value only takes intermolecular-type reactions into account, and is probably the only variable on which viscosity depends in a percolation law: η = B(1 ? Y/Y_c)^?p. We obtain Y_c= 0.45 and p= 2.0. Comparing X_c and Y_c at the gel point, we obtain information on the proportion of intramolecular reactions with temperature. It is also demonstrated that the critical percolation threshold agrees closely with the gel point determined experimentally on log G″= f(t) curves.     

Team cognition in a cyber defense context: focus on social support behaviors

In the face of increasingly prominent cyber security issues, the organization of cyber team analysts has become crucial to thwart cyber threats. Few studies have examined the functioning of the team and the interaction between individuals in a cyber defense context and how the context influences team adaptation. The present study investigates team cognition in a cyber defense context and in particular the nature of task- or team-centered communication among analysts during a cyber defense simulation exercise. Results indicate that markers of situation assessment and shared mental models are both strategically present and linked. Nevertheless, the frequency of these markers varies depending on the quantity and quality of problems encountered; in particular, variations in social support behaviors are observed. Decreasing social support behaviors during high level activities suggests the adaptation of social behaviors depending on the threats and attacks on the system. Theoretical and practical implications are discussed in terms of theories and potential consequences for strategic adaptation and team resilience.

     

Generalized Post Embedding Problems

The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions. It is also shown that combining directness and codirectness in Post Embedding problems leads to undecidability.     

A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function

This short note considers and resolves the apparent contradiction between known worst-case complexity results for first- and second-order methods for solving unconstrained smooth nonconvex optimization problems and a recent note by Jarre [On Nesterov's smooth Chebyshev–Rosenbrock function, Optim. Methods Softw. (2011)] implying a very large lower bound on the number of iterations required to reach the solution's neighbourhood for a specific problem with variable dimension.     

Large-scale linked data integration using probabilistic reasoning and crowdsourcing

We tackle the problems of semiautomatically matching linked data sets and of linking large collections of Web pages to linked data. Our system, ZenCrowd, (1) uses a three-stage blocking technique in order to obtain the best possible instance matches while minimizing both computational complexity and latency, and (2) identifies entities from natural language text using state-of-the-art techniques and automatically connects them to the linked open data cloud. First, we use structured inverted indices to quickly find potential candidate results from entities that have been indexed in our system. Our system then analyzes the candidate matches and refines them whenever deemed necessary using computationally more expensive queries on a graph database. Finally, we resort to human computation by dynamically generating crowdsourcing tasks in case the algorithmic components fail to come up with convincing results. We integrate all results from the inverted indices, from the graph database and from the crowd using a probabilistic framework in order to make sensible decisions about candidate matches and to identify unreliable human workers. In the following, we give an overview of the architecture of our system and describe in detail our novel three-stage blocking technique and our probabilistic decision framework. We also report on a series of experimental results on a standard data set, showing that our system can achieve a 95 % average accuracy on instance matching (as compared to the initial 88 % average accuracy of the purely automatic baseline) while drastically limiting the amount of work performed by the crowd. The experimental evaluation of our system on the entity linking task shows an average relative improvement of 14 % over our best automatic approach.     

An efficient algorithm for positive realizations

We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of [L. Benvenuti, L. Farina, An example of how positivity may force realizations of ‘large’ dimensions, Systems Control Lett. 36 (1999) 261–266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782–784] to indicate that the algorithm is indeed efficient in general.     

Energy Efficient Hardware Loop Based Optimization for CGRAs

Journal of Signal Processing Systems - Research interest and industry investment in edge computing solutions have increased dramatically in recent years. Consequent quest for balanced performance,...     

Growth and optical properties of In x Ga1−x P nanowires synthesized by selective-area epitaxy

Ternary Ⅲ-Ⅴ nanowires (NWs) cover a wide range of wavelengths in the solar spectrum and would greatly benefit from being synthesized as position-controlled arrays for improved vertical yield,reprodudbility,and tunable optical absorption.Here,we report on successful selective-area epitaxy of metal-particle-free vertical InxGa1-xP NW arrays using metal-organic vapor phase epitaxy and detail their optical properties.A systematic growth study establishes the range of suitable growth parameters to obtain uniform NW growth over a large array.The optical properties of the NWs were characterized by room-temperature cathodoluminescence spectroscopy.Tunability of the emission wavelength from 870 nm to approximately 800 nm was achieved.Transmission electron microscopy and energy dispersive X-ray measurements performed on crosssection samples revealed a pure wurtzite crystal structure with very few stacking faults and a slight composition gradient along the NW growth axis.     

Monitoring the Ratio of Two Normal Variables Using EWMA Type Control Charts

In many fields, there is the need to monitor quality characteristics defined as the ratio of two random variables. The design and implementation of control charts directly monitoring the ratio stability is required for the continuous surveillance of these quality characteristics. In this paper, we propose two one‐sided exponentially weighted moving average (EWMA) charts with subgroups having sample size n > 1 to monitor the ratio of two normal random variables. The optimal EWMA smoothing constants, control limits, and ARLs have been computed for different values of the in‐control ratio and correlation between the variables and are shown in several figures and tables to discuss the statistical performance of the proposed one‐sided EWMA charts. Both deterministic and random shift sizes have been considered to test the two one‐sided EWMA charts' sensitivity. The obtained results show that the proposed one‐sided EWMA control charts are more sensitive to process shifts than other charts already proposed in the literature. The practical application of the proposed control schemes is discussed with an illustrative example. Copyright © 2015 John Wiley & Sons, Ltd.