Efficient solutions to robust, semi-implicit discretizations of the immersed boundary method

The immersed boundary method is a versatile tool for the investigation of flow-structure interaction. In a large number of applications, the immersed boundaries or structures are very stiff and strong tangential forces on these interfaces induce a well-known, severe time-step restriction for explicit discretizations. This excessive stability constraint can be removed with fully implicit or suitable semi-implicit schemes but at a seemingly prohibitive computational cost. While economical alternatives have been proposed recently for some special cases, there is a practical need for a computationally efficient approach that can be applied more broadly. In this context, we revisit a robust semi-implicit discretization introduced by Peskin in the late 1970s which has received renewed attention recently. This discretization, in which the spreading and interpolation operators are lagged. leads to a linear system of equations for the inter-face configuration at the future time, when the interfacial force is linear. However, this linear system is large and dense and thus it is challenging to streamline its solution. Moreover, while the same linear system or one of similar structure could potentially be used in Newton-type iterations, nonlinear and highly stiff immersed structures pose additional challenges to iterative methods. In this work, we address these problems and propose cost-effective computational strategies for solving Peskin`s lagged-operators type of discretization. We do this by first constructing a sufficiently accurate approximation to the system`s matrix and we obtain a rigorous estimate for this approximation. This matrix is expeditiously computed by using a combination of pre-calculated values and interpolation. The availability of a matrix allows for more efficient matrix-vector products and facilitates the design of effective iterative schemes. We propose efficient iterative approaches to deal with both linear and nonlinear interfacial forces and simple or complex immersed structures with tethered or untethered points. One of these iterative approaches employs a splitting in which we first solve a linear problem for the interfacial force and then we use a nonlinear iteration to find the interface configuration corresponding to this force. We demonstrate that the proposed approach is several orders of magnitude more efficient than the standard explicit method. In addition to considering the standard elliptical drop test case, we show both the robustness and efficacy of the proposed methodology with a 2D model of a heart valve. (C) 2009 Elsevier Inc. All rights reserved.

Towards a maximal extension of Pelczynski`s decomposition method in Banach spaces

l Suppose that X, Y. A and B are Banach spaces such that X is isomorphic to Y E) A and Y is isomorphic to X circle plus B. Are X and Y necessarily isomorphic? In this generality. the answer is no, as proved by W.T. Cowers in 1996. In the present paper, we provide a very simple necessary and sufficient condition on the 10-tuples (k, l, m, n. p, q, r, s, u, v) in N with p+q+u >= 3, r+s+v >= 3, uv >= 1, (p,q)$(0,0), (r,s)not equal(0,0) and u=1 or v=1 or (p. q) = (1, 0) or (r, s) = (0, 1), which guarantees that X is isomorphic to Y whenever these Banach spaces satisfy X(u) similar to X(p)circle plus Y(q), Y(u) similar to X(r)circle plus Y(s), and A(k) circle plus B(l) similar to A(m) circle plus B(n). Namely, delta = +/- 1 or lozenge not equal 0, gcd(lozenge, delta (p + q - u)) divides p + q - u and gcd(lozenge, delta(r + s - v)) divides r + s - v, where 3 = k - I - in + n is the characteristic number of the 4-tuple (k, l, m, n) and lozenge = (p - u)(s - v) - rq is the discriminant of the 6-tuple (p, q, r, s, U, v). We conjecture that this result is in some sense a maximal extension of the classical Pelczynski`s decomposition method in Banach spaces: the case (1, 0. 1, 0, 2. 0, 0, 2. 1. 1). (C) 2009 Elsevier Inc. All rights reserved.

A criterion for unitary similarity of upper triangular matrices in general position

Each square complex matrix is unitarily similar to an upper triangular matrix with diagonal entries in any prescribed order. Let A = [a(ij)] and B = [b(ij)] be upper triangular n x n matrices that are not similar to direct sums of square matrices of smaller sizes, or are in general position and have the same main diagonal. We prove that A and B are unitarily similar if and only if parallel to h(A(k))parallel to = parallel to h(B(k))parallel to for all h is an element of C vertical bar x vertical bar and k = 1, ..., n, where A(k) := [a(ij)](i.j=1)(k) and B(k) := [b(ij)](i.j=1)(k) are the leading principal k x k submatrices of A and B, and parallel to . parallel to is the Frobenius norm. (C) 2011 Elsevier Inc. All rights reserved.

An indecomposable Banach space of continuous functions which has small density

Using the method of forcing we construct a model for ZFC where CH does not hold and where there exists a connected compact topological space K of weight omega(1) < 2(omega) such that every operator on the Banach space of continuous functions on K is multiplication by a continuous function plus a weakly compact operator. In particular, the Banach space of continuous functions on K is indecomposable.

Examples of Self-Iterating Lie Algebras, 2

We study properties of self-iterating Lie algebras in positive characteristic. Let R = K[t(i)vertical bar i is an element of N]/(t(i)(p)vertical bar i is an element of N) be the truncated polynomial ring. Let partial derivative(i) = partial derivative/partial derivative t(i), i is an element of N, denote the respective derivations. Consider the operators v(1) = partial derivative(1) + t(0)(partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...))))); v(2) = partial derivative(2) + t(1)(partial derivative(3) + t(2)(partial derivative(4) + t(3)(partial derivative(5) + t(4)(partial derivative(6) + ...)))). Let L = Lie(p)(v(1), v(2)) subset of Der R be the restricted Lie algebra generated by these derivations. We establish the following properties of this algebra in case p = 2, 3. a) L has a polynomial growth with Gelfand-Kirillov dimension lnp/ln((1+root 5)/2). b) the associative envelope A = Alg(v(1), v(2)) of L has Gelfand-Kirillov dimension 2 lnp/ln((1+root 5)/2). c) L has a nil-p-mapping. d) L, A and the augmentation ideal of the restricted enveloping algebra u = u(0)(L) are direct sums of two locally nilpotent subalgebras. The question whether u is a nil-algebra remains open. e) the restricted enveloping algebra u(L) is of intermediate growth. These properties resemble those of Grigorchuk and Gupta-Sidki groups.

On a product formula for the Conley-Zelmder index of symplectic paths and its applications

Using invariance by fixed-endpoints homotopies and a generalized notion of symplectic Cayley transform, we prove a product formula for the Conley-Zehnder index of continuous paths with arbitrary endpoints in the symplectic group. We discuss two applications of the formula, to the metaplectic group and to periodic solutions of Hamiltonian systems.

Theoretical Characterization of Hydrogen Polyoxides: HOOH, HOOOH, HOOOOH, and HOOO

We have investigated the polyoxides HOOH, HOOOH, HOOOOH, and HOOO employing the CCSD(T) methodology, and the correlation consistent basis sets. For all molecules, we have computed fundamental vibrational frequencies, structural parameters, rotational constants, and rotation-vibration corrections. For HOOOH, we have obtained a good agreement between our results and microwave and infrared spectra measurements, although for the symmetric OO stretch some important differences were found. Heats of formation were computed using atomization energies, and our recommendation is as follows: Delta H degrees(f,298)(HOOOH) = -21.50 kcal/mol and Delta H degrees(f,298)(HOOOOH) = -10.61 kcal/mol. In the case of HOOO, to estimate the heat of formation, we have constructed three isodesmic reactions to cancel high order correlation effects. The results obtained confirmed that the latter effects are very important for HOOO. The new Delta H degrees(f,298)(HOOO) obtained is 5.5 kcal/mol. We have also calculated the zero-point energies of DO and DOOO to correct the experimental lower limit determined for the Delta H degrees(f,298)(HOOO). The Delta(Delta ZPE) decreases the binding energy of HOOO by 0.56 kcal/mol. Employing the latter value, the new experimental lower limit for Delta H degrees(f,298)(HOOO) is 3.07 kcal/mol, just 2.4 kcal/mol lower than our determination. We expect that the fundamental vibrational frequencies and rotational constants determined for HOOOOH and DOOOOD contribute to its identification in the gas phase. The vibrational spectrum of HOOOOH shows some overlapping with that of HOOOH thus indicating that one may encounter some difficulties in its characterization. We discuss the consequences of the thermochemical properties determined in this work, and suggest that the amount of HOOO present in the atmosphere is smaller than that proposed recently in this journal (J. Phys. Chem A 2007, 111, 4727).

Dynamic Fuzzy Logic Control of GeneticAlgorithm Probabilities

Genetic algorithms are commonly used to solve combinatorial optimizationproblems. The implementation evolves using genetic operators (crossover, mutation,selection, etc.). Anyway, genetic algorithms like some other methods have parameters(population size, probabilities of crossover and mutation) which need to be tune orchosen.In this paper, our project is based on an existing hybrid genetic algorithmworking on the multiprocessor scheduling problem. We propose a hybrid Fuzzy-Genetic Algorithm (FLGA) approach to solve the multiprocessor scheduling problem.The algorithm consists in adding a fuzzy logic controller to control and tunedynamically different parameters (probabilities of crossover and mutation), in anattempt to improve the algorithm performance. For this purpose, we will design afuzzy logic controller based on fuzzy rules to control the probabilities of crossoverand mutation. Compared with the Standard Genetic Algorithm (SGA), the resultsclearly demonstrate that the FLGA method performs significantly better.

QoS evaluation of bandwidth schedulersin IPTV networks offered SRD fluidvideo traffic: a simulation study

IPTV is now offered by several operators in Europe, US and Asia using broadcast video over private IP networks that are isolated from Internet. IPTV services rely ontransmission of live (real-time) video and/or stored video. Video on Demand (VoD)and Time-shifted TV are implemented by IP unicast and Broadcast TV (BTV) and Near video on demand are implemented by IP multicast. IPTV services require QoS guarantees and can tolerate no more than 10-6 packet loss probability, 200 ms delay, and 50 ms jitter. Low delay is essential for satisfactory trick mode performance(pause, resume,fast forward) for VoD, and fast channel change time for BTV. Internet Traffic Engineering (TE) is defined in RFC 3272 and involves both capacity management and traffic management. Capacity management includes capacityplanning, routing control, and resource management. Traffic management includes (1)nodal traffic control functions such as traffic conditioning, queue management, scheduling, and (2) other functions that regulate traffic flow through the network orthat arbitrate access to network resources. An IPTV network architecture includes multiple networks (core network, metronetwork, access network and home network) that connects devices (super head-end, video hub office, video serving office, home gateway, set-top box). Each IP router in the core and metro networks implements some queueing and packet scheduling mechanism at the output link controller. Popular schedulers in IP networks include Priority Queueing (PQ), Class-Based Weighted Fair Queueing (CBWFQ), and Low Latency Queueing (LLQ) which combines PQ and CBWFQ.The thesis analyzes several Packet Scheduling algorithms that can optimize the tradeoff between system capacity and end user performance for the traffic classes. Before in the simulator FIFO,PQ,GPS queueing methods were implemented inside. This thesis aims to implement the LLQ scheduler inside the simulator and to evaluate the performance of these packet schedulers. The simulator is provided by ErnstNordström and Simulator was built in Visual C++ 2008 environmentand tested and analyzed in MatLab 7.0 under windows VISTA.

Analysis of EnterpriseVoIP Traffic from aWire line IMS System

With the rapid development of telecommunication industry, the IP multimedia Subsystem (IMS) could very well be the panacea for most telecom operators. It is originally defined as the core network for 3G mobile systems by the 3rd Generation Partnership Project (3GPP), the more recent development is merging between fixed line network and wireless networkd This report researchs the characteristic of the IMS data and proposes an IMS characterization analysis. We captured the IMS traffic data with 10 tousands users for about 41 hours. By analyzing the characteristics of the IMS, we know that the most important application in the IMS is VoIP call. Then we use the tool designed by Tsinghua University & Ericsson Company to recognize the data, and the results we got can be used to build the traffic models. From the results of the traffic models, I will get some reasons and conclusion. The traffic model gives out the types of session and types of VoIP call. I bring into a concept—busy hour. This concept is very important because it can help us to know which period is the peak of the VoIP call. The busy hour is from 10:00 to 11:00 in the morning. I also bring into another concept—connection ratio. This concept is significant because it can evaluate whether the VoIP call is good when it use IMS network. By comparing the traffic model with other one’s models, we found the different results from them, both the accuracy and the busy hour. From the contract, we got the advantages of our traffic models.

Monitoring and Explanation of Contract Execution: A Case Study in the Aerospace Domain

In the domain of aerospace aftermarkets, which often has long supply chains that feed into the maintenance of aircraft, contracts are used to establish agreements between aircraft operators and maintenance suppliers. However, violations at the bottom of the supply chain (part suppliers) can easily cascade to the top (aircraft operators), making it difficult to determine the source of the violation, and seek to address it. In this context, we have developed a global monitoring architecture that ensures the detection of norm violations and generates explanations for the origin of violations. In this paper, we describe the implementation and deployment of a global monitor in the aerospace domain of [8] and show how it generates explanations for violations within the maintenance supply chain. We show how these explanations can be used not only to detect violations at runtime, but also to uncover potential problems in contracts before their deployment, thus improving them.

Voice over IP 2.0: an analysis of limits and potential of IP2IP telecommunication

Internet Telephony (VoIP) is changing the telecommunication industry. Oftentimes free, VoIP is becoming more and more popular amongst users. Large software companies have entered the market and heavily invest into it. In 2011, for instance, Microsoft bought Skype for 8.5bn USD. This trend increasingly impacts the incumbent telecommunication operators. They see their main source of revenue – classic telephony – under siege and disappear. The thesis at hand develops a most-likely scenario in order to determine how VoIP is evolving further and it predicts, based on a ten-year forecast, the impact it will have on the players in the telecommunication industry.The paper presents a model combining Rogers’ diffusion and Christensen’s innovation research. The model has the goal of explaining the past evolution of VoIP and to isolate the factors that determine the further diffusion of the innovation. Interviews with industry experts serve to assess how the identified factors are evolving.Two propositions are offered. First, VoIP operators are becoming more important in international, corporate, and mobile telephony. End-to-end VoIP (IP2IP) will exhibit strong growth rates and increasingly cannibalize the telephony revenues of the classic operators. Second, fix-net telephony in SMEs and at home will continue to be dominated by the incumbents. Yet, as prices for telephony fall towards zero also they will implement IP2IP in order to save costs. By 2022, up to 90% of the calls will be IP2IP. The author recommends the incumbents and VoIP operators to proactively face the change, to rethink their business strategies, and to even be open for cooperation.

On the iteration of Katsuno and Mendelzon update

In this dissertation we present a model for iteration of Katsuno and Mendelzon’s Update, inspired in the developments for iteration in AGM belief revision. We adapt Darwiche and Pearls’ postulates of iterated belief revision to update (as well as the independence postulate proposed in [BM06, JT07]) and show two families of such operators, based in natural [Bou96] and lexicographic revision [Nay94a, NPP03]. In all cases, we provide a possible worlds semantics of the models.

Sparse 1D discrete Dirac operators I: Quantum transport

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Sparse one-dimensional discrete Dirac operators II: Spectral properties

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)