Positive solutions of a Neumann problem with competing critical nonlinearities

We present existence results for a Neumann problem involving critical Sobolev nonlinearities both on the right hand side of the equation and at the boundary condition.. Positive solutions are obtained through constrained minimization on the Nehari manifold. Our approach is based on the concentration 'compactness principle of P. L. Lions and M. Struwe.

Solving Maximum Clique Problem for Protein Structure Similarity

Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum weighted clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper we present both a new integer programming formulation for solving such clique problems and a dedicated branch and bound algorithm for solving the maximum cardinality clique problem. Both approaches have been integrated in VAST, a software for aligning protein 3D structures largely used in the National Center for Biotechnology Information, an original clique solver which uses the well known Bron and Kerbosch algorithm (BK). Our computational results on real protein alignment instances show that our branch and bound algorithm is up to 116 times faster than BK.

Monte Carlo Study of Particle Transport Problem in Air Pollution

2002 Mathematics Subject Classification: 65C05.

Host and network optimizations for performance enhancement and energy efficiency in data center networks

Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center. The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.

Deployment of a Hybrid Multicast Switch in Energy-Aware Data Center Network: A Case of Fat-Tree Topology

Recently, energy efficiency or green IT has become a hot issue for many IT infrastructures as they attempt to utilize energy-efficient strategies in their enterprise IT systems in order to minimize operational costs. Networking devices are shared resources connecting important IT infrastructures, especially in a data center network they are always operated 24/7 which consume a huge amount of energy, and it has been obviously shown that this energy consumption is largely independent of the traffic through the devices. As a result, power consumption in networking devices is becoming more and more a critical problem, which is of interest for both research community and general public. Multicast benefits group communications in saving link bandwidth and improving application throughput, both of which are important for green data center. In this paper, we study the deployment strategy of multicast switches in hybrid mode in energy-aware data center network: a case of famous fat-tree topology. The objective is to find the best location to deploy multicast switch not only to achieve optimal bandwidth utilization but also to minimize power consumption. We show that it is possible to easily achieve nearly 50% of energy consumption after applying our proposed algorithm.

Recurrent varicose veins of the legs. Analysis of a social problem

The present study was aimed at assessing the experience of a single referral center with recurrent varicose veins of the legs (RVL) over the period 1993-2008. Among a total of 846 procedures for Leg Varices (LV), 74 procedures were for RVL (8.7%). The causes of recurrence were classified as classic: insufficient crossectomy (13); incompetent perforating veins (13); reticular phlebectasia (22); small saphenous vein insufficiency (9); accessory saphenous veins (4); and particular: post-hemodynamic treatment (5); incomplete stripping (1); Sapheno-Femoral Junction (SFJ) vascularization (5); post-thermal ablation (2). For the “classic” RVL the treatment consisted essentially of completing the previous treatment, both if the problem was linked to an insufficient earlier treatment and if it was due to a later onset. The most common cause in our series was reticular phlebectasia; when the simple sclerosing injections are not sufficient, this was treated by phlebectomy according to Mueller. The “particular” cases classified as 1, 2 and 4 were also treated by completing the traditional stripping procedure (+ crossectomy if this had not been done previously), considered to be the gold standard. In the presence of a SFJ neo-vascularization, with or without cavernoma, approximately 5 cm of femoral vein were explored, the afferent vessels ligated and, if cavernoma was present, it was removed. Although inguinal neo-angiogenesis is a possible mechanism, some doubt can be raised as to its importance as a primary factor in causing recurrent varicose veins, rather than their being due to a preexisting vein left in situ because it was ignored, regarded as insignificant, or poorly evident. In conclusion, we stress that LV is a progressive disease, so the treatment is unlikely to be confined to a single procedure. It is important to plan adequate monitoring during follow-up, and to be ready to reoperate when new problems present that, if left, could lead the patient to doubt the validity and efficacy of the original treatment.

Host and Network Optimizations for Performance Enhancement and Energy Efficiency in Data Center Networks

Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center. The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.

Tuning the valence of the cerium center in (Na)phthalocyaninato and porphyrinato cerium double-deckers by changing the nature of the tetrapyrrole ligands

A series of 7 cerium double-decker complexes with various tetrapyrrole ligands including porphyrinates, phthalocyaninates, and 2,3-naphthalocyaninates have been prepared by previously described methodologies and characterized with elemental analysis and a range of spectroscopic methods. The molecular structures of two heteroleptic \[(na)phthalocyaninato](porphyrinato) complexes have also been determined by X-ray diffraction analysis which exhibit a slightly distorted square antiprismatic geometry with two domed ligands. Having a range of tetrapyrrole ligands with very different electronic properties, these compounds have been systematically investigated for the effects of ligands on the valence of the cerium center. On the basis of the spectroscopic (UV−vis, near-IR, IR, and Raman), electrochemical, and structural data of these compounds and compared with those of the other rare earth(III) counterparts reported earlier, it has been found that the cerium center adopts an intermediate valence in these complexes. It assumes a virtually trivalent state in cerium bis(tetra-tert-butylnaphthalocyaninate) as a result of the two electron rich naphthalocyaninato ligands, which facilitate the delocalization of electron from the ligands to the metal center. For the rest of the cerium double-deckers, the cerium center is predominantly tetravalent. The valences (3.59−3.68) have been quantified according to their LIII-edge X-ray absorption near-edge structure (XANES) profiles.

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.