Proper conformal symmetries in SD Einstein spaces

Proper conformal symmetries in self-dual (SD) Einstein spaces are considered. It is shown, that such symmetries are admitted only by the Einstein spaces of the type [N]x[N]. Spaces of the type [N]x[-] are considered in details. Existence of the proper conformal Killing vector implies existence of the isometric, covariantly constant and null Killing vector. It is shown, that there are two classes of [N]x[-]-metrics admitting proper conformal symmetry. They can be distinguished by analysis of the associated anti-self-dual (ASD) null strings. Both classes are analyzed in details. The problem is reduced to single linear PDE. Some general and special solutions of this PDE are presented

The Architecture of a Novel Weighted Network: Knowledge Network

Networked structure emerged from a wide range of fields such as biological systems, World Wide Web and technological infrastructure. A deeply insight into the topological complexity of these networks has been gained. Some works start to pay attention to the weighted network, like the world-wide airport network and the collaboration network, where links are not binary, but have intensities. Here, we construct a novel knowledge network, through which we take the first step to uncover the topological structure of the knowledge system. Furthermore, the network is extended to the weighted one by assigning weights to the edges. Thus, we also investigate the relationship between the intensity of edges and the topological structure. These results provide a novel description to understand the hierarchies and organizational principles in knowledge system, and the interaction between the intensity of edges and topological structure. This system also provides a good paradigm to study weighted networks.Comment: 5 figures 11 page

Real eigenvalue analysis in NASTRAN by the tridiagonal reduction (FEER) method

Implementation of the tridiagonal reduction method for real eigenvalue extraction in structural vibration and buckling problems is described. The basic concepts underlying the method are summarized and special features, such as the computation of error bounds and default modes of operation are discussed. In addition, the new user information and error messages and optional diagnostic output relating to the tridiagonal reduction method are presented. Some numerical results and initial experiences relating to usage in the NASTRAN environment are provided, including comparisons with other existing NASTRAN eigenvalue methods

Design of a 12-GHz multicarrier earth-terminal for satellite-CATV interconnection

The design and development of the front-end for a multi-carrier system that allows multiplex signal transmission from satellite-borne transponders is described. Detailed systems analyses provided down-converter specifications. The 12 GHz carrier down-converter uses waveguide, coaxial, and microstrip transmission line elements in its implementation. Mixing is accomplished in a single-ended coaxial mixer employing a field-replacable cartridge style diode

Mean-field solution of the small-world network model

The small-world network model is a simple model of the structure of social networks, which simultaneously possesses characteristics of both regular lattices and random graphs. The model consists of a one-dimensional lattice with a low density of shortcuts added between randomly selected pairs of points. These shortcuts greatly reduce the typical path length between any two points on the lattice. We present a mean-field solution for the average path length and for the distribution of path lengths in the model. This solution is exact in the limit of large system size and either large or small number of shortcuts.Comment: 14 pages, 2 postscript figure

Strong-coupling behaviour in discrete Kardar-Parisi-Zhang equations

We present a systematic discretization scheme for the Kardar-Parisi-Zhang (KPZ) equation, which correctly captures the strong-coupling properties of the continuum model. In particular we show that the scheme contains no finite-time singularities in contrast to conventional schemes. The implications of these results to i) previous numerical integration of the KPZ equation, and ii) the non-trivial diversity of universality classes for discrete models of `KPZ-type' are examined. The new scheme makes the strong-coupling physics of the KPZ equation more transparent than the original continuum version and allows the possibility of building new continuum models which may be easier to analyse in the strong-coupling regime.Comment: 21 pages, revtex, 2 figures, submitted to J. Phys.

The design and development of transonic multistage compressors

The development of the transonic multistage compressor is reviewed. Changing trends in design and performance parameters are noted. These changes are related to advances in compressor aerodynamics, computational fluid mechanics and other enabling technologies. The parameters normally given to the designer and those that need to be established during the design process are identified. Criteria and procedures used in the selection of these parameters are presented. The selection of tip speed, aerodynamic loading, flowpath geometry, incidence and deviation angles, blade/vane geometry, blade/vane solidity, stage reaction, aerodynamic blockage, inlet flow per unit annulus area, stage/overall velocity ratio, and aerodynamic losses are considered. Trends in these parameters both spanwise and axially through the machine are highlighted. The effects of flow mixing and methods for accounting for the mixing in the design process are discussed

Assembling thefacebook: Using heterogeneity to understand online social network assembly

Online social networks represent a popular and diverse class of social media systems. Despite this variety, each of these systems undergoes a general process of online social network assembly, which represents the complicated and heterogeneous changes that transform newly born systems into mature platforms. However, little is known about this process. For example, how much of a network's assembly is driven by simple growth? How does a network's structure change as it matures? How does network structure vary with adoption rates and user heterogeneity, and do these properties play different roles at different points in the assembly? We investigate these and other questions using a unique dataset of online connections among the roughly one million users at the first 100 colleges admitted to Facebook, captured just 20 months after its launch. We first show that different vintages and adoption rates across this population of networks reveal temporal dynamics of the assembly process, and that assembly is only loosely related to network growth. We then exploit natural experiments embedded in this dataset and complementary data obtained via Internet archaeology to show that different subnetworks matured at different rates toward similar end states. These results shed light on the processes and patterns of online social network assembly, and may facilitate more effective design for online social systems.Comment: 13 pages, 11 figures, Proceedings of the 7th Annual ACM Web Science Conference (WebSci), 201

Chaos in Small-World Networks

A nonlinear small-world network model has been presented to investigate the effect of nonlinear interaction and time delay on the dynamic properties of small-world networks. Both numerical simulations and analytical analysis for networks with time delay and nonlinear interaction show chaotic features in the system response when nonlinear interaction is strong enough or the length scale is large enough. In addition, the small-world system may behave very differently on different scales. Time-delay parameter also has a very strong effect on properties such as the critical length and response time of small-world networks