Laminar flow of a suspension in a curved pipe with varying curvature

The laminar flow of a fairly concentrated suspension (in which the volume fraction Z of the solid particles < 0.4) in a spatially varying periodically curved pipe has been examined numerically. Unlike the case of interacting suspension flows, the particles are found to flow in a well-mixed fashion, altering both the axial and circumferential velocities and consequently the fluid flux in the tube, depending on their diffusivity and inertia. The magnitude of shear stress at the wall is enhanced, suggesting that, if applied to vascular system, the vascular wall could be prone to ulceration during pathological situations like polycythemia. The delay in adaptation of the deviation in Poiseuille flow velocity to the curvature changes is also discussed in detail.

Toiminta ja tarkoite : Tutkimus suomen pronominista

The study describes the use and meaning of the Finnish demonstrative pronouns, focus being on the pronoun "tämä" (roughly 'this'). The Finnish demonstrative system is a three way one, the other two demonstratives are "tuo" ('that') and "se" ('it'). The data consisted of 12 half hours of video- and tape-recorded face-to-face and telephone conversations. The method for the study was ethnomethodological conversation analysis (CA); in addition to CA, the theoretical framework consisted of functional linguistics and linguistic anthropology. First, the study dealt with the syntactic distribution of the three demonstratives. The pronouns were analysed according to whether they are before or after the verb, and whether they compose an NP on their own or are determinants of a lexical NP. The study suggested that the form and the placement of the NP presents the referent as continuous/discontinuous or given/new. Givenness of a referent was defined as "identified adequately for the purposes of the on-going action". The so-called dislocated utterances were considered separately. It was found that left-dislocations are used for inserting referents in a particular relation to the on-going activity. Right-dislocations offer a solution for the sometimes competing motivations of newness and continuity: they are used for securing the identifiability of a referent that is implied to be continuous. Second, the study focussed on analysing the meaning of the pronouns according to three dimensions of reference: referential, indexical and relational. It was found that the demonstratives can organize interactional or spatial context. When organizing interactional context, the demonstrative pronouns express the role of identifying the referent in relation to the on-going activity. The pronoun "tämä" expresses that the referent is referentially open and the characterization of the referent is given in the on-going turn. Furthermore, it expresses asymmetry of the indexical ground: it expresses that the participants of a conversation do not share a mutual understanding of the activity at that particular time. In addition, the referent of the pronoun "tämä" is central for understanding the on-going action. Centrality could be understood as the relational feature of the pronoun. However, it is a consequence of the referential and indexical features of "tämä". The pronoun "tuo" also expresses referential openness, but it implies indexical symmetry. The pronoun "se" implies that the referent is known enough, and implies indexical symmetry. When used spatially, the pronouns may refer to a physical space or to a situation. They express or imply that the speaker is inside or outside the referent. The pronoun "tämä" implies inclusion, and the pronoun "tuo" expresses exclusion.

Comprehensive Path-sensitive Data-flow Analysis

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. W initially perform data-flow analysis to determine those control-flow merges which cause the loss in data-flow analysis precision. The control-flow graph of the program is then restructured such that performing data-flow analysis on the resulting restructured graph gives more precise results. The proposed framework is both simple, involving the familiar notion of product automata, and also general, since it is applicable to any forward data-flow analysis. Apart from proving that our restructuring process is correct, we also show that restructuring is effective in that it necessarily leads to more optimization opportunities. Furthermore, the framework handles the trade-off between the increase in data-flow precision and the code size increase inherent in the restructuring. We show that determining an optimal restructuring is NP-hard, and propose and evaluate a greedy strategy. The framework has been implemented in the Scale research compiler, and instantiated for the specific problem of Constant Propagation. On the SPECINT 2000 benchmark suite we observe an average speedup of 4% in the running times over Wegman-Zadeck conditional constant propagation algorithm and 2% over a purely path profile guided approach.

Unsteady flow of a dilute suspension in a semi-infinite contracting or expanding pipe

In the present paper an exact similar solution of the Navier-Stokes equation for unsteady flow of a dilute suspension in a semi-infinite contracting or expanding circular pipe is presented. The effects of the Schmidt number (Sc), Reynolds number (|ε|), the volume fraction (α) and the relaxation time (τ) of the particulate phase on the flow characteristics are examined. The presence of the solid particles has been observed to influence the flow behaviour significantly. These solutions are valid down to the state of a completely collapsed pipe, since the nonlinearity is retained fully. The results may help understanding the flow near the heart and certain forced contractions or expansions of valved veins.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Approximation algorithm for maximum independent set in planar traingle-free graphs

The maximum independent set problem is NP-complete even when restricted to planar graphs, cubic planar graphs or triangle free graphs. The problem of finding an absolute approximation still remains NP-complete. Various polynomial time approximation algorithms, that guarantee a fixed worst case ratio between the independent set size obtained to the maximum independent set size, in planar graphs have been proposed. We present in this paper a simple and efficient, O(|V|) algorithm that guarantees a ratio 1/2, for planar triangle free graphs. The algorithm differs completely from other approaches, in that, it collects groups of independent vertices at a time. Certain bounds we obtain in this paper relate to some interesting questions in the theory of extremal graphs.

On the unsteady flow of a fairly concentrated suspension due to contracting or expanding walls of a tube

Consummating our earlier work [1], the unsteady flow of a fairly concentrated suspension due to a single contraction or expansion of the walls of a tube is studied. A comparison of the results obtained by using two different formulae for the additional drag terms in the governing equations has been made. A region of circulation in the flow field is observed when the volume fraction Z greater-or-equal, slanted 0.3, the Schmidt number Sc < 1 and the density ratio (density of the particulate phase/density of the fluid phase) > 1.

Pulsatile blood flow in a rigid pulmonary alveolar sheet with porous walls

This paper deals with the pulsatile blood flow in the lung alveolar sheets by idealizing each of them as a channel covered by porous media. As the blood flow in the lung is of low Reynolds number, a creeping flow is assumed in the channel. The analytical and numerical results for the velocity and pressure distribution in the porous medium are presented. The effect of an imposed slip condition is also studied. Comparisons with the corresponding results for the steady-state case are made at the end.

Ant colony optimization for reporting cell planning in mobile computing using selective paging strategy

Location management problem that arise in mobile computing networks is addressed. One method used in location management is to designate sonic of the cells in the network as "reporting cells". The other cells in the network are "non-reporting cells". Finding an optimal set of reporting cells (or reporting cell configuration) for a given network. is a difficult combinatorial optimization problem. In fact this is shown to be an NP-complete problem. in an earlier study. In this paper, we use the selective paging strategy and use an ant colony optimization method to obtain the best/optimal set of reporting cells for a given a network.

Luokan P loogisesta karakterisoinnista

Deskriptiivisessä vaativuusteoriassa tutkitaan laskennan vaativuuteen liittyviä kysymyksiä logiikan työkalujen avulla. Tällöin käsitellään tilannetta, jossa laskennan syötteenä toimivat äärelliset mallit. Tässä kehyksessä erinäisiä vaativuusluokkia voidaan karakterisoida etsimällä logiikoita, joilla on kyseistä vaativuusluokkaa vastaava ilmaisuvoima. Klassiset esimerkit tällaisista tuloksista ovat Faginin esittämä epädeterministisen polynomiaalisen ajan karakterisaatio logiikan Σ_1^1 avulla ja Immermanin, Livchakin ja Vardin esittämä deterministisen polynomiaalisen ajan karakterisaatio ensimmäisen kertaluvun inflatorisen kiintopistelogiikan avulla. Tässä opinnäytetyössä tarkastellaan Gurevichin esittämää kysymystä polynomiaalisessa ajassa ratkeavien kielten luokan P vahvasta loogisesta karakterisaatiosta. Kyseinen kysymys on yksi äärellisen malliteorian haastavimpia ongelmia. Kysymyksen esittelyyn tarvittavan peruskoneiston läpikäynnin lisäksi tässä käsi- tellään myös sen yhteyksiä laskennan vaativuusteoriassa keskeiseen P-NP-ongelmaan. Gurevichin kysymyksestä voidaan esittää myös rajoitetumpia versioita, mikäli käsitellään tilannetta, jossa laskennan syötteenä voi olla vain kiinnitetyn malliluokan K malleja. Tällöin luokan P karakterisointi helpottuu, ainakin jos luokka K on riittävän suppea. Tässä opinnäytetyössä käydään läpi Grohen esittämä tulos siitä, että mikäli luokaksi K valitaan 3-yhtenäisten tasoverkkojen luokka, niin ensimmäisen kertaluvun inflatorinen kiintopistelogiikka karakterisoi polynomiaalisessa ajassa laskettavat kielet.

Problems and Algorithms for Sequence Segmentations

The analysis of sequential data is required in many diverse areas such as telecommunications, stock market analysis, and bioinformatics. A basic problem related to the analysis of sequential data is the sequence segmentation problem. A sequence segmentation is a partition of the sequence into a number of non-overlapping segments that cover all data points, such that each segment is as homogeneous as possible. This problem can be solved optimally using a standard dynamic programming algorithm. In the first part of the thesis, we present a new approximation algorithm for the sequence segmentation problem. This algorithm has smaller running time than the optimal dynamic programming algorithm, while it has bounded approximation ratio. The basic idea is to divide the input sequence into subsequences, solve the problem optimally in each subsequence, and then appropriately combine the solutions to the subproblems into one final solution. In the second part of the thesis, we study alternative segmentation models that are devised to better fit the data. More specifically, we focus on clustered segmentations and segmentations with rearrangements. While in the standard segmentation of a multidimensional sequence all dimensions share the same segment boundaries, in a clustered segmentation the multidimensional sequence is segmented in such a way that dimensions are allowed to form clusters. Each cluster of dimensions is then segmented separately. We formally define the problem of clustered segmentations and we experimentally show that segmenting sequences using this segmentation model, leads to solutions with smaller error for the same model cost. Segmentation with rearrangements is a novel variation to the segmentation problem: in addition to partitioning the sequence we also seek to apply a limited amount of reordering, so that the overall representation error is minimized. We formulate the problem of segmentation with rearrangements and we show that it is an NP-hard problem to solve or even to approximate. We devise effective algorithms for the proposed problem, combining ideas from dynamic programming and outlier detection algorithms in sequences. In the final part of the thesis, we discuss the problem of aggregating results of segmentation algorithms on the same set of data points. In this case, we are interested in producing a partitioning of the data that agrees as much as possible with the input partitions. We show that this problem can be solved optimally in polynomial time using dynamic programming. Furthermore, we show that not all data points are candidates for segment boundaries in the optimal solution.

Role of Capping Ligands on the Nanoparticles in the Modulation of Properties of a Hybrid Matrix of Nanoparticles in a 2D Film and in a Supramolecular Organogel

We incorporate various gold nanoparticles (AuNPs) capped with different ligands in two-dimensional films and three-dimensional aggregates derived from N-stearoyl-L-alanine and N-lauroyl-L-alanine, respectively. The assemblies of N-stearoyl-L-alanine afforded stable films at the air-water interface. More compact assemblies were formed upon incorporation of AuNPs in the air-water interface of N-stearoyl-L-alanine. We then examined the effects of incorporation of various AuNPs functionalized with different capping ligands in three-dimensional assemblies of N-lauroyl-L-alanine, a compound that formed a gel in hydrocarbons. The profound influence of nanoparticle incorporation into physical gels was evident from evaluation of various microscopic and bulk properties. The interaction of AuNPs with the gelator assembly was found to depend critically on the capping ligands protecting the Au surface of the gold nanoparticles. Transmission electron microscopy (TEM) showed a long-range directional assembly of certain AuNPs along the gel fibers. Scanning electron microscopy (SEM) images of the freeze-dried gels and nanocomposites indicate that the morphological transformation in the composite microstructures depends significantly on the capping agent of the nanoparticles. Differential scanning calorimetry (DSC) showed that gel formation from sol occurred at a lower temperature upon incorporation of AuNPs having capping ligands that were able to align and noncovalently interact with the gel fibers. Rheological studies indicate that the gel-nanoparticle composites exhibit significantly greater viscoelasticity compared to the native gel alone when the capping ligands are able to interact through interdigitation into the gelator assembly. Thus, it was possible to define a clear relationship between the materials and the molecular-level properties by means of manipulation of the information inscribed on the NP surface.

An operational-level multi-stage mine production timetabling model for optimally synchronising drilling, blasting and excavating operations

This paper proposes a new multi-stage mine production timetabling (MMPT) model to optimise open-pit mine production operations including drilling, blasting and excavating under real-time mining constraints. The MMPT problem is formulated as a mixed integer programming model and can be optimally solved for small-size MMPT instances by IBM ILOG-CPLEX. Due to NP-hardness, an improved shifting-bottleneck-procedure algorithm based on the extended disjunctive graph is developed to solve large-size MMPT instances in an effective and efficient way. Extensive computational experiments are presented to validate the proposed algorithm that is able to efficiently obtain the near-optimal operational timetable of mining equipment units. The advantages are indicated by sensitivity analysis under various real-life scenarios. The proposed MMPT methodology is promising to be implemented as a tool for mining industry because it is straightforwardly modelled as a standard scheduling model, efficiently solved by the heuristic algorithm, and flexibly expanded by adopting additional industrial constraints.