Atopic dermatitis and food allergy in infancy and childhood

Food allergies are causal factors for atopic dermatitis (AD) in 50% in infancy, in 20 to 30% in childhood, and only in 10 to 15% after puberty and in adulthood. Cow's milk, egg, fish, wheat, soy, nuts and citrus-fruits are the most proven allergens. Pseudoallergens, especially food-additiva, have to be regarded too. For the proof of the clinical relevance that food allergy is causing AD a positive result of elimination and provocation has to be required. When by these diagnostic procedure a special food is found as causing the AD it has to be eliminated in the diet of this patient. In severe cases of AD semi-elementary respectively few foods diets may be necessary. However in most cases of AD the "diet of choice" is an age related normal nutrition. To delay respectively to avoid the manifestation of atopy special recommendations for the nutrition of high risk newborns and infants (especially long breast feeding, late solid feeding) should be considered.     

Liquidus temperatures for primary crystallization of cryolite in molten salt systems of interest for aluminum electrolysis

Temperatures for primary crystallization of Na₃AlF₆ in multicomponent electrolyte systems of interest for the aluminum electrolysis process were determined by thermal analysis. The results are presented as binary and quasibinary diagrams and discussed in view of the literature data. An empirical equation describing liquidus temperatures for primary crystallization of Na₃AlF₆ was derived: $$\begin{gathered} t/(^\circ C) = 1011 + 0.50[AlF_3 ] - 0.13[AIF_3 ] - \frac{{3.45[CaF_2 ]}}{{1 + 0.0173[CaF_2 ]}} \hfill \\ + 0.124[CaF_2 ] \cdot [AlF_3 ] - 0.00542([CaF_2 ] \cdot [AlF_3 ])^{1.5} \hfill \\ - \frac{{7.93[Al_2 O_3 ]}}{{1 + 0.0936[Al_2 O_3 ] - 0.0017[Al_2 O_3 ]^2 - 0.0023[AlF_3 ] \cdot [Al_2 O_3 ]}} \hfill \\ - \frac{{8.90[LiF]}}{{1 + 0.0047[LiF] + 0.0010[AlF3]^2 }} - 3.95[MgF_2 ] - 3.95 \hfill \\ \end{gathered} $$ wheret is the temperature in degree Celsius and the square brackets denote the weight percent of components in the system Na₃AlF₆-AlF₃-CaF₂-Al₂O₃-LiF-MgF₂-KF. The composition limitations are [AlF₃] ≈ [CaF₂] ≈ [LiF] < 20 wt pct, [MgF₂] ≈ [KF] < 5 wt pct, and [A1₂O₃] up to saturation.     

Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm

This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn.

We define two types of assumption/commitment specifications, namely simple and general specifications.

It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification.

We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare-logic inspired. In particular the feedback rules employ invariants in the style of a traditional while-rule.

Both sets of rules have been proved to be sound and also (semantic) relative complete.

Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed.

     

Surrogate modeling approximation using a mixture of experts based on EM joint estimation

An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems. It strongly relies on the Expectation−Maximization (EM) algorithm for Gaussian mixture models (GMM). To the end of regression, the inputs are clustered together with their output values by means of parameter estimation of the joint distribution. A local expert is then built (linear, quadratic, artificial neural network, moving least squares) on each cluster. Lastly, the local experts are combined using the Gaussian mixture model parameters found by the EM algorithm to obtain a global model. This method is tested over both mathematical test cases and an engineering optimization problem from aeronautics and is found to improve the accuracy of the approximation.     

浅议以太网基本性能测试指标及相应的测试方法

本文就目前国际上对以太网基本性能测量的指标进行整理和分析并给出了相应的测试方法。     

A survey of problems,solution techniques,and future challenges in scheduling semiconductor manufacturing operations

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems found in semiconductor manufacturing systems. We describe batch scheduling problems, parallel machine scheduling problems, job shop scheduling problems, scheduling problems with auxiliary resources, multiple orders per job scheduling problems, and scheduling problems related to cluster tools. We also present important solution techniques that are used to solve these scheduling problems by means of specific examples, and report on known implementations. Finally, we summarize some of the challenges in scheduling semiconductor manufacturing operations.     

Efficient algorithms for singleton arc consistency

In this paper, we propose two original and efficient approaches for enforcing singleton arc consistency. In the first one, the data structures used to enforce arc consistency are shared between all subproblems where a domain is reduced to a singleton. This new algorithm is not optimal but it requires far less space and is often more efficient in practice than the optimal algorithm SAC-Opt. In the second approach, we perform several runs of a greedy search (where at each step, arc consistency is maintained), possibly detecting the singleton arc consistency of several values in one run. It is an original illustration of applying inference (i.e., establishing singleton arc consistency) by search. Using a greedy search allows benefiting from the incrementality of arc consistency, learning relevant information from conflicts and, potentially finding solution(s) during the inference process. We present extensive experiments that show the benefit of our two approaches.     

From monolithic to component-based performance evaluation of software architectures

Model-based performance evaluation methods for software architectures can help architects to assess design alternatives and save costs for late life-cycle performance fixes. A recent trend is component-based performance modelling, which aims at creating reusable performance models; a number of such methods have been proposed during the last decade. Their accuracy and the needed effort for modelling are heavily influenced by human factors, which are so far hardly understood empirically. Do component-based methods allow to make performance predictions with a comparable accuracy while saving effort in a reuse scenario? We examined three monolithic methods (SPE, umlPSI, Capacity Planning (CP)) and one component-based performance evaluation method (PCM) with regard to their accuracy and effort from the viewpoint of method users. We conducted a series of three experiments (with different levels of control) involving 47 computer science students. In the first experiment, we compared the applicability of the monolithic methods in order to choose one of them for comparison. In the second experiment, we compared the accuracy and effort of this monolithic and the component-based method for the model creation case. In the third, we studied the effort reduction from reusing component-based models. Data were collected based on the resulting artefacts, questionnaires and screen recording. They were analysed using hypothesis testing, linear models, and analysis of variance. For the monolithic methods, we found that using SPE and CP resulted in accurate predictions, while umlPSI produced over-estimates. Comparing the component-based method PCM with SPE, we found that creating reusable models using PCM takes more (but not drastically more) time than using SPE and that participants can create accurate models with both techniques. Finally, we found that reusing PCM models can save time, because effort to reuse can be explained by a model that is independent of the inner complexity of a component. The tasks performed in our experiments reflect only a subset of the actual activities when applying model-based performance evaluation methods in a software development process. Our results indicate that sufficient prediction accuracy can be achieved with both monolithic and component-based methods, and that the higher effort for component-based performance modelling will indeed pay off when the component models incorporate and hide a sufficient amount of complexity.     

Complexity issues in color-preserving graph embeddings

In the context of comparative analysis of protein–protein interaction graphs, we use a graph-based formalism to detect the preservation of a given protein complex (pattern graph) in the protein–protein interaction graph (target graph) of another species with respect to (w.r.t.) orthologous proteins. We give an efficient exponential-time randomized algorithm in case the occurrence of the pattern graph in the target graph is required to be exact. For approximate occurrences, we prove a tight inapproximability result and give four approximation algorithms that deal with bounded degree graphs, small ortholog numbers, linear forests and very simple yet hard instances, respectively.