An efficient method for computing unsteady transonic aerodynamics of swept wings with control surfaces

A transonic equivalent strip (TES) method was further developed for unsteady flow computations of arbitrary wing planforms. The TES method consists of two consecutive correction steps to a given nonlinear code such as LTRAN2; namely, the chordwise mean flow correction and the spanwise phase correction. The computation procedure requires direct pressure input from other computed or measured data. Otherwise, it does not require airfoil shape or grid generation for given planforms. To validate the computed results, four swept wings of various aspect ratios, including those with control surfaces, are selected as computational examples. Overall trends in unsteady pressures are established with those obtained by XTRAN3S codes, Isogai's full potential code and measured data by NLR and RAE. In comparison with these methods, the TES has achieved considerable saving in computer time and reasonable accuracy which suggests immediate industrial applications

Parallel Exhaustive Search without Coordination

We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of "boxes", with a "treasure" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., crashes of processors), and overcoming this issue seems to require a large amount of communication. We therefore address the question of designing parallel search algorithms maximizing their speed-up and maintaining high levels of robustness, while minimizing the amount of resources for coordination. Based on the observation that algorithms that avoid communication are inherently robust, we analyze the best running time performance of non-coordinating algorithms. Specifically, we devise non-coordinating algorithms that achieve a speed-up of $9/8$ for two searchers, a speed-up of $4/3$ for three searchers, and in general, a speed-up of $\frac{k}{4}(1+1/k)^2$ for any $k\geq 1$ searchers. Thus, asymptotically, the speed-up is only four times worse compared to the case of full-coordination, and our algorithms are surprisingly simple and hence applicable. Moreover, these bounds are tight in a strong sense as no non-coordinating search algorithm can achieve better speed-ups. Overall, we highlight that, in faulty contexts in which coordination between the searchers is technically difficult to implement, intrusive with respect to privacy, and/or costly in term of resources, it might well be worth giving up on coordination, and simply run our non-coordinating exhaustive search algorithms

SACOC: A spectral-based ACO clustering algorithm

The application of ACO-based algorithms in data mining is growing over the last few years and several supervised and unsupervised learning algorithms have been developed using this bio-inspired approach. Most recent works concerning unsupervised learning have been focused on clustering, where ACO-based techniques have showed a great potential. At the same time, new clustering techniques that seek the continuity of data, specially focused on spectral-based approaches in opposition to classical centroid-based approaches, have attracted an increasing research interest–an area still under study by ACO clustering techniques. This work presents a hybrid spectral-based ACO clustering algorithm inspired by the ACO Clustering (ACOC) algorithm. The proposed approach combines ACOC with the spectral Laplacian to generate a new search space for the algorithm in order to obtain more promising solutions. The new algorithm, called SACOC, has been compared against well-known algorithms (K-means and Spectral Clustering) and with ACOC. The experiments measure the accuracy of the algorithm for both synthetic datasets and real-world datasets extracted from the UCI Machine Learning Repository

Translation of the first upstream ORF in the hepatitis B virus pregenomic RNA modulates translation at the core and polymerase initiation codons

The human hepatitis B virus (HBV) has a compact genome encoding four major overlapping coding regions: the core, polymerase, surface and X. The polymerase initiation codon is preceded by the partially overlapping core and four or more upstream initiation codons. There is evidence that several mechanisms are used to enable the synthesis of the polymerase protein, including leaky scanning and ribosome reinitiation. We have examined the first AUG in the pregenomic RNA, it precedes that of the core. It initiates an uncharacterized short upstream open reading frame (uORF), highly conserved in all HBV subtypes, we designated the C0 ORF. This arrangement suggested that expression of the core and polymerase may be affected by this uORF. Initiation at the C0 ORF was confirmed in reporter constructs in transfected cells. The C0 ORF had an inhibitory role in downstream expression from the core initiation site in HepG2 cells and in vitro, but also stimulated reinitiation at the polymerase start when in an optimal context. Our results indicate that the C0 ORF is a determinant in balancing the synthesis of the core and polymerase proteins

The Chern-Simons Coefficient in Supersymmetric Non-abelian Chern-Simons Higgs Theories

By taking into account the effect of the would be Chern-Simons term, we calculate the quantum correction to the Chern-Simons coefficient in supersymmetric Chern-Simons Higgs theories with matter fields in the fundamental representation of SU(n). Because of supersymmetry, the corrections in the symmetric and Higgs phases are identical. In particular, the correction is vanishing for N=3 supersymmetric Chern-Simons Higgs theories. The result should be quite general, and have important implication for the more interesting case when the Higgs is in the adjoint representation.Comment: more references and explanation about rgularization dpendence are included, 13 pages, 1 figure, latex with revte

MACOC: a medoid-based ACO clustering algorithm

The application of ACO-based algorithms in data mining is growing over the last few years and several supervised and unsupervised learning algorithms have been developed using this bio-inspired approach. Most recent works concerning unsupervised learning have been focused on clustering, showing great potential of ACO-based techniques. This work presents an ACO-based clustering algorithm inspired by the ACO Clustering (ACOC) algorithm. The proposed approach restructures ACOC from a centroid-based technique to a medoid-based technique, where the properties of the search space are not necessarily known. Instead, it only relies on the information about the distances amongst data. The new algorithm, called MACOC, has been compared against well-known algorithms (K-means and Partition Around Medoids) and with ACOC. The experiments measure the accuracy of the algorithm for both synthetic datasets and real-world datasets extracted from the UCI Machine Learning Repository

Nonmagnetic impurity perturbation to the quasi-two-dimensional quantum helimagnet LiCu2O2

A complete phase diagram of Zn substituted quantum quasi-two-dimensional helimagnet LiCu2O2 has been presented. Helical ordering transition temperature (T_h) of the original LiCu2O2 follows finite size scaling for less than ~ 5.5% Zn substitution, which implies the existence of finite helimagnetic domains with domain boundaries formed with nearly isolated spins. Higher Zn substitution > 5.5% quenches the long-range helical ordering and introduces an intriguing Zn level dependent magnetic phase transition with slight thermal hysteresis and a universal quadratic field dependence for T_c (Zn > 0.055,H). The magnetic coupling constants of nearest-neighbor (nn) J1 and next-nearest-neighbor (nnn) J2 (alpha=J2/J1) are extracted from high temperature series expansion (HTSE) fitting and N=16 finite chain exact diagonalization simulation. We have also provided evidence of direct correlation between long-range helical spin ordering and the magnitude of electric polarization in this spin driven multiferroic material

The ideal gas as an urn model: derivation of the entropy formula

The approach of an ideal gas to equilibrium is simulated through a generalization of the Ehrenfest ball-and-box model. In the present model, the interior of each box is discretized, {\it i.e.}, balls/particles live in cells whose occupation can be either multiple or single. Moreover, particles occasionally undergo random, but elastic, collisions between each other and against the container walls. I show, both analitically and numerically, that the number and energy of particles in a given box eventually evolve to an equilibrium distribution $W$ which, depending on cell occupations, is binomial or hypergeometric in the particle number and beta-like in the energy. Furthermore, the long-run probability density of particle velocities is Maxwellian, whereas the Boltzmann entropy $\ln W$ exactly reproduces the ideal-gas entropy. Besides its own interest, this exercise is also relevant for pedagogical purposes since it provides, although in a simple case, an explicit probabilistic foundation for the ergodic hypothesis and for the maximum-entropy principle of thermodynamics. For this reason, its discussion can profitably be included in a graduate course on statistical mechanics.Comment: 17 pages, 3 figure

Optimization of quasi-normal eigenvalues for Krein-Nudelman strings

The paper is devoted to optimization of resonances for Krein strings with total mass and statical moment constraints. The problem is to design for a given $\alpha \in \R$ a string that has a resonance on the line \alpha + \i \R with a minimal possible modulus of the imaginary part. We find optimal resonances and strings explicitly.Comment: 9 pages, these results were extracted in a slightly modified form from the earlier e-print arXiv:1103.4117 [math.SP] following an advise of a journal's refere