Tendency toward crossover of the effective susceptibility exponent from its doubled Ising value to its doubled mean-field value near a double critical point

The critical behavior of osmotic susceptibility in an aqueous electrolyte mixture 1-propanol (1P)+water (W)+potassium chloride is reported. This mixture exhibits re-entrant phase transitions and has a nearly parabolic critical line with its apex representing a double critical point (DCP). The behavior of the susceptibility exponent is deduced from static light-scattering measurements, on approaching the lower critical solution temperatures (TL’s) along different experimental paths (by varying t) in the one-phase region. The light-scattering data analysis substantiates the existence of a nonmonotonic crossover behavior of the susceptibility exponent in this mixture. For the TL far away from the DCP, the effective susceptibility exponent γeff as a function of t displays a nonmonotonic crossover from its single limit three-dimensional (3D)-Ising value ( ∼ 1.24) toward its mean-field value with increase in t. While for that closest to the DCP, γeff displays a sharp, nonmonotonic crossover from its nearly doubled 3D-Ising value toward its nearly doubled mean-field value with increase in t. The renormalized Ising regime extends over a relatively larger t range for the TL closest to the DCP, and a trend toward shrinkage in the renormalized Ising regime is observed as TL shifts away from the DCP. Nevertheless, the crossover to the mean-field limit extends well beyond t>10−2 for the TL’s studied. The observed crossover behavior is attributed to the presence of strong ion-induced clustering in this mixture, as revealed by various structure probing techniques. As far as the critical behavior in complex or associating mixtures with special critical points (like the DCP) is concerned, our results indicate that the influence of the DCP on the critical behavior must be taken into account not only on the renormalization of the critical exponent but also on the range of the Ising regime, which can shrink with decrease in the influence of the DCP and with the extent of structuring in the system. The utility of the field variable tUL in analyzing re-entrant phase transitions is demonstrated. The effective susceptibility exponent as a function of tUL displays a nonmonotonic crossover from its asymptotic 3D-Ising value toward a value slightly lower than its nonasymptotic mean-field value of 1. This behavior in the nonasymptotic, high tUL region is interpreted in terms of the possibility of a nonmonotonic crossover to the mean-field value from lower values, as foreseen earlier in micellar systems.

Development of protein-catalyzed capture (PCC) agents with application to the specific targeting of the E17K Point mutation of Akt1

This thesis describes the expansion and improvement of the iterative in situ click chemistry OBOC peptide library screening technology. Previous work provided a proof-of-concept demonstration that this technique was advantageous for the production of protein-catalyzed capture (PCC) agents that could be used as drop-in replacements for antibodies in a variety of applications. Chapter 2 describes the technology development that was undertaken to optimize this screening process and make it readily available for a wide variety of targets. This optimization is what has allowed for the explosive growth of the PCC agent project over the past few years.

These technology improvements were applied to the discovery of PCC agents specific for single amino acid point mutations in proteins, which have many applications in cancer detection and treatment. Chapter 3 describes the use of a general all-chemical epitope-targeting strategy that can focus PCC agent development directly to a site of interest on a protein surface. This technique utilizes a chemically-synthesized chunk of the protein, called an epitope, substituted with a click handle in combination with the OBOC in situ click chemistry libraries in order to focus ligand development at a site of interest. Specifically, Chapter 3 discusses the use of this technique in developing a PCC agent specific for the E17K mutation of Akt1. Chapter 4 details the expansion of this ligand into a mutation-specific inhibitor, with applications in therapeutics.

Properties of convergence of a class of iterative processes generated by sequences of self-mappings with applications to switched dynamic systems

This article investigates the convergence properties of iterative processes involving sequences of self-mappings of metric or Banach spaces. Such sequences are built from a set of primary self-mappings which are either expansive or non-expansive self-mappings and some of the non-expansive ones can be contractive including the case of strict contractions. The sequences are built subject to switching laws which select each active self-mapping on a certain activation interval in such a way that essential properties of boundedness and convergence of distances and iterated sequences are guaranteed. Applications to the important problem of stability of dynamic switched systems are also given.

Mass chains with passive interconnection: Complex iterative maps and scalability

This paper introduces the problem of passive control of a chain of N identical masses in which there is an identical passive connection between neighbouring masses and a similar connection to a movable point. The problem arises in the design of multi-storey buildings which are subjected to earthquake disturbances, but applies in other situations, for example vehicle platoons. The paper will study the scalar transfer functions from the disturbance to a given intermass displacement. It will be shown that these transfer functions can be conveniently represented in the form of complex iterative maps and that these maps provide a method to establish boundedness in N of the H ∞-norm of these transfer functions for certain choices of interconnection impedance. © 2013 IEEE.

A novel image restoration approach based on point location in high-dimensional space geometry

The goal of image restoration is to restore the original clear image from the existing blurred image without distortion as possible. A novel approach based on point location in high-dimensional space geometry method is proposed, which is quite different from the thought ways of existing traditional image restoration approaches. It is based on the high-dimensional space geometry method, which derives from the fact of the Principle of Homology-Continuity (PHC). Begin with the original blurred image, we get two further blurred images. Through the regressive deducing curve fitted by these three images, the first iterative deblured image could be obtained. This iterative "blurring-debluring-blurring" process is performed till reach the deblured image. Experiments have proved the availability of the proposed approach and achieved not only common image restoration but also blind image restoration which represents the majority of real problems.

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

Parallel decoding of turbo codes using multi-point trellis termination and collision-free interleavers

The UMTS turbo encoder is composed of parallel concatenation of two Recursive Systematic Convolutional (RSC) encoders which start and end at a known state. This trellis termination directly affects the performance of turbo codes. This paper presents performance analysis of multi-point trellis termination of turbo codes which is to terminate RSC encoders at more than one point of the current frame while keeping the interleaver length the same. For long interleaver lengths, this approach provides dividing a data frame into sub-frames which can be treated as independent blocks. A novel decoding architecture using multi-point trellis termination and collision-free interleavers is presented. Collision-free interleavers are used to solve memory collision problems encountered by parallel decoding of turbo codes. The proposed parallel decoding architecture reduces the decoding delay caused by the iterative nature and forward-backward metric computations of turbo decoding algorithms. Our simulations verified that this turbo encoding and decoding scheme shows Bit Error Rate (BER) performance very close to that of the UMTS turbo coding while providing almost %50 time saving for the 2-point termination and %80 time saving for the 5-point termination.

The great asymmetry : America's closest allies in times of war

This dissertation focuses on military cooperation between the United States and its special allies. It argues that alliance expectations determine the level of military cooperation, while two intervening variables - the level of government cohesion and military capabilities - determine its implementation. This study also shows how secondary states deploy strategies to overcome power asymmetries through bilateral concessions, international organizations and by appealing to principle. The focus of the research is on special allies, as they have the most to gain or lose by going along with American plans. My contention is that secondary allies can rarely influence the dominant ally decisively, but they can act autonomously and resist to pressures exerted by the stronger alliance partner. The argument builds on three central claims. First, power asymmetries between allies translate into different assessments of international threats. Second, when disagreements over threats arise, the outcome of intra-alliance bargaining is not necessarily dictated by the preferences of the stronger power. Third, secondary states, as opposed to the dominant partner, face unique constraints when facing major foreign policy decisions, i.e. they face a trade-off between establishing a credible reputation as an alliance partner in a politically feasible way while minimizing domestic audience costs. To examine the theoretical puzzle presented by asymmetric military cooperation, I introduce a causal explanation that builds on neoclassical realism, to zone in on the interaction between systemic and domestic variables. My research makes a contribution to alliance theory and foreign policy decision-making by studying how special allies respond to American decisions in times of threat and how systemic constraints are channeled through state-level variables. To investigate the causal link between threat perception, alliance expectations and domestic constraints, this study relies on the method of structured focused comparison with three detailed case studies. The focus is on the initial decision made by special allies regarding whether or not to participle in joint mobilization with the United States. The decision-making process is presented from the perspective of secondary allied states and measures the explanatory factors that motivated the decision on military cooperation. The case studies are the UK, Canada and Australia’s response to the war in Afghanistan and the war in Iraq during the period of 2001 to 2003.

Fixed Point Decimal Multiplication Using RPS Algorithm

Decimal multiplication is an integral part of financial, commercial, and internet-based computations. A novel design for single digit decimal multiplication that reduces the critical path delay and area for an iterative multiplier is proposed in this research. The partial products are generated using single digit multipliers, and are accumulated based on a novel RPS algorithm. This design uses n single digit multipliers for an n × n multiplication. The latency for the multiplication of two n-digit Binary Coded Decimal (BCD) operands is (n + 1) cycles and a new multiplication can begin every n cycle. The accumulation of final partial products and the first iteration of partial product generation for next set of inputs are done simultaneously. This iterative decimal multiplier offers low latency and high throughput, and can be extended for decimal floating-point multiplication.

Case study: object and ground point separation on a river bank using airborne based LIDAR data

In the past decade, airborne based LIght Detection And Ranging (LIDAR) has been recognised by both the commercial and public sectors as a reliable and accurate source for land surveying in environmental, engineering and civil applications. Commonly, the first task to investigate LIDAR point clouds is to separate ground and object points. Skewness Balancing has been proven to be an efficient non-parametric unsupervised classification algorithm to address this challenge. Initially developed for moderate terrain, this algorithm needs to be adapted to handle sloped terrain. This paper addresses the difficulty of object and ground point separation in LIDAR data in hilly terrain. A case study on a diverse LIDAR data set in terms of data provider, resolution and LIDAR echo has been carried out. Several sites in urban and rural areas with man-made structure and vegetation in moderate and hilly terrain have been investigated and three categories have been identified. A deeper investigation on an urban scene with a river bank has been selected to extend the existing algorithm. The results show that an iterative use of Skewness Balancing is suitable for sloped terrain.

Finding the point on Bezier Curves with the normal vector passing an external point

Two algorithms for finding the point on non-rational/rational Bezier curves of which the normal vector passes through a given external point are presented. The algorithms are based on Bezier curves generation algorithms of de Casteljau's algorithm for non-rational Bezier curve or Farin's recursion for rational Bezier curve, respectively. Orthogonal projections from the external point are used to guide the directional search used in the proposed iterative algorithms. Using Lyapunov's method, it is shown that each algorithm is able to converge to a local minimum for each case of non-rational/rational Bezier curves. It is also shown that on convergence the distance between the point on curves to the external point reaches a local minimum for both approaches. Illustrative examples are included to demonstrate the effectiveness of the proposed approaches.

An iterative contractive framework for probe methods: LASSO

We present a new iterative approach called Line Adaptation for the Singular Sources Objective (LASSO) to object or shape reconstruction based on the singular sources method (or probe method) for the reconstruction of scatterers from the far-field pattern of scattered acoustic or electromagnetic waves. The scheme is based on the construction of an indicator function given by the scattered field for incident point sources in its source point from the given far-field patterns for plane waves. The indicator function is then used to drive the contraction of a surface which surrounds the unknown scatterers. A stopping criterion for those parts of the surfaces that touch the unknown scatterers is formulated. A splitting approach for the contracting surfaces is formulated, such that scatterers consisting of several separate components can be reconstructed. Convergence of the scheme is shown, and its feasibility is demonstrated using a numerical study with several examples.

An iterative allocation mechanism in the edgeworth box

This paper considers an iterative allocation mechanism which resolves the problem of multiplicity of allocations given by a mechanism in commodity space. At each stage, the average of the extreme allocations is taken and used as the starting point of the next stage. As long as the mechanism is individually rational and Pareto optimal, this iterative procedure yields a unique final allocation which is also individually rational and Pareto optimal. (JEL C63, C71)

Switch point finding using polynomial regression for fuzzy type reduction algorithms

Karnik-Mendel (KM) algorithm is the most widely used type reduction (TR) method in literature for the design of interval type-2 fuzzy logic systems (IT2FLS). Its iterative nature for finding left and right switch points is its Achilles heel. Despite a decade of research, none of the alternative TR methods offer uncertainty measures equivalent to KM algorithm. This paper takes a data-driven approach to tackle the computational burden of this algorithm while keeping its key features. We propose a regression method to approximate left and right switch points found by KM algorithm. Approximator only uses the firing intervals, rnles centroids, and FLS strnctural features as inputs. Once training is done, it can precisely approximate the left and right switch points through basic vector multiplications. Comprehensive simulation results demonstrate that the approximation accuracy for a wide variety of FLSs is 100%. Flexibility, ease of implementation, and speed are other features of the proposed method.

Predictor-Corrector Primal-Dual Interior Point Method for Solving Economic Dispatch Problems: A Postoptimization Analysis

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