Influence of pores arrangement on stability of photonic structures during sintering

Discrete Element Method (DEM) has been used for numerical investigation of sintering-induced structural deformations occurring in inverse opal photonic structures. The influence of the initial arrangement of template particles on the stability of highly porous inverse opal α-Al₂O₃ structures has been analyzed. The material transport, densification, as well as formation of defects and cracks have been compared for various case studies. Three different stages of defects formation have been distinguished starting with local defects ending with intrapore cracks. The results show that the packing of the template particles defined during the template self-assembly process play a crucial role in the later structural deformation upon thermal exposure. The simulation results are in very good agreement with experimental data obtained from SEM images and previous studies by ptychographic X-ray tomography.     

A general class of simple majority decision rules based on linguistic opinions

In this paper we have introduced a class of decision rules related to simple majority, by considering individual intensities of preference. These intensities will be shown by means of linguistic labels. In order to compare the amount of opinion obtained by each alternative, we have considered the total ordered monoid generated by the sums of the original labels, according to an addition and an ordering. In this general framework different sets of linguistic labels can be employed and these sets can be represented by means of diverse mathematical objects. Moreover, on these mathematical representations of linguistic labels several orderings can be considered. Thus, flexibility is an important feature of this new class of group decision making procedures. Some examples of putting in practice the simple majority decision rules based on linguistic labels are provided, and the main properties of these voting systems are analyzed. It is worth emphasizing that these properties are satisfied for any total ordered monoid, regardless of the mathematical representation of linguistic labels or the ordering used to compare collective opinions.     

Choosing OWA operator weights in the field of Social Choice

One of the most important issues in the theory of OWA operators is the determination of associated weights. This matter is essential in order to use the best-suited OWA operator in each aggregation process. Given that some aggregation processes can be seen as extensions of majority rules to the field of gradual preferences, it is possible to determine the OWA operator weights by taking into account the class of majority rule that we want to obtain when individuals do not grade their pairwise preferences. However, a difficulty with this approach is that the same majority rule can be obtained through a wide variety of OWA operators. For this reason, a model for selecting the best-suited OWA operators is proposed in this paper.     

酶促合成生物柴油反应动力学

以Candidasp.99-125脂肪酶为催化剂,甘油三油酸酯和甲醇为底物,采用有序机制模型对酶促合成生物柴油的酯交换反应动力学进行了研究,并与经典乒乓机制模型进行了比较。研究结果表明,反应初速率的实验值与有序机制模型方程的计算值吻合很好。对于固定化Candidasp.99-125脂肪酶催化合成生物柴油的酯交换反应机理进行研究,采用有序机制模型比经典乒乓机制模型更为精确。反应过程中,醇抑制为竞争性抑制,在甘油三油酸酯浓度较小的范围内,醇抑制作用较为显著,醇浓度越低反应初速率越快。该有序机制模型可用来预测生物柴油的生产批次或连续反应器中酯交换反应的速率,确定最佳底物油脂和醇的浓度。     

Synthesis of ordered polymers by direct polycondensation

A series of ordered polymers can be prepared by direct polycondensation of nonsymmetric monomers using diphenyl(2,3-dihydro-2-oxo-3-benzothiazolyl)phosphonate (1) as a condensing agent. The methodology and requirements for the preparation of ordered polymer are first presented. Then, the following ordered polymer syntheses are described: (1) ordered polyamides (head-to-head or tail-to-tail) from a symmetric monomer and a nonsymmetric monomer. (2) the ordered polyamide (head-to-tail) from a symmetric monomer and a nonsymmetric monomer. (3) the ordered (-abcd-) polymer from a pair of two symmetric monomers and a nonsymmetric monomer. (4) the ordered (-abcdef-) polymer from nonsymmetric monomers, XabX, YcdY, and ZefZ.     

Comparison of different flowability tests for powders for inhalation

A series of placebo powders for inhalation was characterized regarding bulk density and powder flowability using different techniques. The powders were of the ordered mixture type and were prepared by mixing a pharmaceutical carrier grade of lactose with different fractions of intermediate sized and fine (i.e., micronized) lactose. A modified Hausner Ratio was obtained by measurement of the poured and the compressed bulk densities. Other tests investigated were the angle of repose, the avalanching behaviour using the AeroFlow, and the yield strength using the Uniaxial tester. Furthermore, the relation between ordered mixture composition and flowability was examined.Of the methods investigated, the modified Hausner Ratio discriminates well between the investigated powders and seems to have the widest measuring range. It was also found that the poured and compressed bulk densities provide information about the packing of the particles in the powders. A good correlation was obtained between the modified Hausner Ratio and the angle of repose. The AeroFlow was suitable for powders with a low percentage of fine particles, but could not discriminate between the more cohesive powders. The Uniaxial tester, on the other hand, seems to be better suited for more cohesive powders.Regarding the powder composition, addition of micronized particles has a strong influence on the flowability of ordered mixtures, while intermediate sized particles have little impact on the powder flow.     

Greedy algorithms for generalized k-rankings of paths

A k-ranking of a graph is a labeling of the vertices with positive integers 1,2,…,k so that every path connecting two vertices with the same label contains a vertex of larger label. An optimal ranking is one in which k is minimized. Let Pn be a path with n vertices. A greedy algorithm can be used to successively label each vertex with the smallest possible label that preserves the ranking property. We seek to show that when a greedy algorithm is used to label the vertices successively from left to right, we obtain an optimal ranking. A greedy algorithm of this type was given by Bodlaender et al. in 1998 [1] which generates an optimal k-ranking of Pn. In this paper we investigate two generalizations of rankings. We first consider bounded (k,s)-rankings in which the number of times a label can be used is bounded by a predetermined integer s. We then consider kt-rankings where any path connecting two vertices with the same label contains t vertices with larger labels. We show for both generalizations that when G is a path, the analogous greedy algorithms generate optimal k-rankings. We then proceed to quantify the minimum number of labels that can be used in these rankings. We define the bounded rank number to be the smallest number of labels that can be used in a (k,s)-ranking and show for n?2, where i=⌊log₂(s)⌋+1. We define the kt-rank number, to be the smallest number of labels that can be used in a kt-ranking. We present a recursive formula that gives the kt-rank numbers for paths, showing for all an−1<j?an where {an} is defined as follows: a₁=1 and an=⌊((t+1)/t)an−1⌋+1.     

Single-allocation ordered median hub location problems

The discrete ordered median location model is a powerful tool in modeling classic and alternative location problems that have been applied with success to a large variety of discrete location problems. Nevertheless, although hub location models have been analyzed from the sum, maximum and coverage point of views, as far as we know, they have never been considered under an alternative unifying point of view. In this paper we consider new formulations, based on the ordered median objective function, for hub location problems with new distribution patterns induced by the different users’ roles within the supply chain network. This approach introduces some penalty factors associated with the position of an allocation cost with respect to the sorted sequence of these costs. First we present basic formulations for this problem, and then develop stronger formulations by exploiting properties of the model. The performance of all these formulations is compared by means of a computational analysis.     

Succinct representation of dynamic trees

We study the problem of maintaining a dynamic ordered tree succinctly under updates of the following form: insertion or deletion of a leaf, insertion of a node on an edge (edge subdivision) or deletion of a node with only one child (the child becomes a child of its former grandparent). We allow satellite data of a fixed size to be associated to the nodes of the tree.We support update operations in constant amortized time and support access to satellite data and basic navigation operations in worst-case constant time; the basic navigation operations include parent, first/last-child, previous/next-child. These operations are moving from a node to its parent, leftmost/rightmost child, and its previous and next child respectively.We demonstrate that to efficiently support more extended operations, such as determining the i-th child of a node, rank of a child among its siblings, or size of the subtree rooted at a node, one requires a restrictive pattern for update strategy, for which we propose the finger-update model. In this model, updates are performed at the location of a finger that is only allowed to crawl on the tree between a child and a parent or between consecutive siblings. Under this model, we describe how the named extended operations are performed in worst-case constant time.Previous work on dynamic succinct trees (Munro et al., 2001 [17]; Raman and Rao, 2003 [19]) is mainly restricted to binary trees and achieves poly-logarithmic (Munro et al., 2001 [17]) or “poly-log-log” (Raman and Rao, 2003 [19]) update time under a more restricted model, where updates are performed in traversals starting at the root and ending at the root and queries can be answered when the traversal is completed. A previous result on ordinal trees achieves only sublinear amortized update time and “poly-log-log” query time (Gupta et al., 2007 [11]). More recently, the update time has been improved to O(logn/loglogn) while queries can be performed in O(logn/loglogn) time (Sadakane and Navarro, 2010 [20]).     

Building ensemble classifiers using belief functions and OWA operators

A pervasive task in many forms of human activity is classification. Recent interest in the classification process has focused on ensemble classifier systems. These types of systems are based on a paradigm of combining the outputs of a number of individual classifiers. In this paper we propose a new approach for obtaining the final output of ensemble classifiers. The method presented here uses the Dempster–Shafer concept of belief functions to represent the confidence in the outputs of the individual classifiers. The combing of the outputs of the individual classifiers is based on an aggregation process which can be seen as a fusion of the Dempster rule of combination with a generalized form of OWA operator. The use of the OWA operator provides an added degree of flexibility in expressing the way the aggregation of the individual classifiers is performed.