A priori prediction of aggregation efficiency and rate constant for fluidized bed melt granulation

This paper presents a predictive aggregation rate model for spray fluidized bed melt granulation. The aggregation rate constant was derived from probability analysis of particle–droplet contact combined with time scale analysis of droplet solidification and granule–granule collision rates. The latter was obtained using the principles of kinetic theory of granular flow (KTGF). The predicted aggregation rate constants were validated by comparison with reported experimental data for a range of binder spray rate, binder droplet size and operating granulator temperature. The developed model is particularly useful for predicting particle size distributions and growth using population balance equations (PBEs).

An alternating method for Cauchy problems for Helmholtz-type operators in non-homogeneous medium

Kozlov & Maz'ya (1989, Algebra Anal., 1, 144–170) proposed an alternating iterative method for solving Cauchy problems for general strongly elliptic and formally self-adjoint systems. However, in many applied problems, operators appear that do not satisfy these requirements, e.g. Helmholtz-type operators. Therefore, in this study, an alternating procedure for solving Cauchy problems for self-adjoint non-coercive elliptic operators of second order is presented. A convergence proof of this procedure is given.

Parametric aggregation in ordered weighted averaging

Incorporating further information into the ordered weighted averaging (OWA) operator weights is investigated in this paper. We first prove that for a constant orness the minimax disparity model [13] has unique optimal solution while the modified minimax disparity model [16] has alternative optimal OWA weights. Multiple optimal solutions in modified minimax disparity model provide us opportunity to define a parametric aggregation OWA which gives flexibility to decision makers in the process of aggregation and selecting the best alternative. Finally, the usefulness of the proposed parametric aggregation method is illustrated with an application in metasearch engine. © 2011 Elsevier Inc. All rights reserved.

Aggregation and caking processes of granular materials:continuum model and simulation with application to sugar

Aggregation and caking of particles are common severe problems in many operations and processing of granular materials, where granulated sugar is an important example. Prevention of aggregation and caking of granular materials requires a good understanding of moisture migration and caking mechanisms. In this paper, the modeling of solid bridge formation between particles is introduced, based on moisture migration of atmospheric moisture into containers packed with granular materials through vapor evaporation and condensation. A model for the caking process is then developed, based on the growth of liquid bridges (during condensation), and their hardening and subsequent creation of solid bridges (during evaporation). The predicted caking strengths agree well with some available experimental data on granulated sugar under storage conditions.

Almost Separable Data Aggregation by Layers of Formal Neurons

Information extraction or knowledge discovery from large data sets should be linked to data aggregation process. Data aggregation process can result in a new data representation with decreased number of objects of a given set. A deterministic approach to separable data aggregation means a lesser number of objects without mixing of objects from different categories. A statistical approach is less restrictive and allows for almost separable data aggregation with a low level of mixing of objects from different categories. Layers of formal neurons can be designed for the purpose of data aggregation both in the case of deterministic and statistical approach. The proposed designing method is based on minimization of the of the convex and piecewise linear (CPL) criterion functions.

Indirect ties in knowledge networks:a social network analysis with ordered weighted averaging operators

This PhD thesis analyses networks of knowledge flows, focusing on the role of indirect ties in the knowledge transfer, knowledge accumulation and knowledge creation process. It extends and improves existing methods for mapping networks of knowledge flows in two different applications and contributes to two stream of research. To support the underlying idea of this thesis, which is finding an alternative method to rank indirect network ties to shed a new light on the dynamics of knowledge transfer, we apply Ordered Weighted Averaging (OWA) to two different network contexts. Knowledge flows in patent citation networks and a company supply chain network are analysed using Social Network Analysis (SNA) and the OWA operator. The OWA is used here for the first time (i) to rank indirect citations in patent networks, providing new insight into their role in transferring knowledge among network nodes; and to analyse a long chain of patent generations along 13 years; (ii) to rank indirect relations in a company supply chain network, to shed light on the role of indirectly connected individuals involved in the knowledge transfer and creation processes and to contribute to the literature on knowledge management in a supply chain. In doing so, indirect ties are measured and their role as means of knowledge transfer is shown. Thus, this thesis represents a first attempt to bridge the OWA and SNA fields and to show that the two methods can be used together to enrich the understanding of the role of indirectly connected nodes in a network. More specifically, the OWA scores enrich our understanding of knowledge evolution over time within complex networks. Future research can show the usefulness of OWA operator in different complex networks, such as the on-line social networks that consists of thousand of nodes.

The General Differential Operators Generated by a Quasi-Differential Expressions with their Interior Singular Points

The general ordinary quasi-differential expression M of n-th order with complex coefficients and its formal adjoint M + are considered over a regoin (a, b) on the real line, −∞ ≤ a < b ≤ ∞, on which the operator may have a finite number of singular points. By considering M over various subintervals on which singularities occur only at the ends, restrictions of the maximal operator generated by M in L2|w (a, b) which are regularly solvable with respect to the minimal operators T0 (M ) and T0 (M + ). In addition to direct sums of regularly solvable operators defined on the separate subintervals, there are other regularly solvable restrications of the maximal operator which involve linking the various intervals together in interface like style.

Continuity of Pseudo-differential Operators on Bessel And Besov Spaces

We study the continuity of pseudo-differential operators on Bessel potential spaces Hs|p (Rn ), and on the corresponding Besov spaces B^(s,q)p (R ^n). The modulus of continuity ω we use is assumed to satisfy j≥0, ∑ [ω(2−j )Ω(2j )]2 < ∞ where Ω is a suitable positive function.

Compactness in the First Baire Class and Baire-1 Operators

For a polish space M and a Banach space E let B1 (M, E) be the space of first Baire class functions from M to E, endowed with the pointwise weak topology. We study the compact subsets of B1 (M, E) and show that the fundamental results proved by Rosenthal, Bourgain, Fremlin, Talagrand and Godefroy, in case E = R, also hold true in the general case. For instance: a subset of B1 (M, E) is compact iff it is sequentially (resp. countably) compact, the convex hull of a compact bounded subset of B1 (M, E) is relatively compact, etc. We also show that our class includes Gulko compact. In the second part of the paper we examine under which conditions a bounded linear operator T : X ∗ → Y so that T |BX ∗ : (BX ∗ , w∗ ) → Y is a Baire-1 function, is a pointwise limit of a sequence (Tn ) of operators with T |BX ∗ : (BX ∗ , w∗ ) → (Y, · ) continuous for all n ∈ N. Our results in this case are connected with classical results of Choquet, Odell and Rosenthal.