Design of a Planar Eleven Antenna for Optimal MIMO Performance as a Wideband Micro Base-station Antenna

A new low-profile planar Eleven antenna is designed for optimal MIMO performance as a wideband MIMO antenna for micro base-stations in future wireless communication systems. The design objective has been to optimize both the reflection coefficient at the input port of the antenna and the 1-bitstream and 2-bitstream MIMO efficiency of the antenna at the same time, in both the Rich Isotropic MultiPath (RIMP) and Random Line-of-Sight (Random-LOS) environments. The planar Eleven antenna can be operated in 2-, 4-, and 8-port modes with slight modifications. The optimization is performed using genetic algorithms. The effects of polarization deficiencies and antenna total embedded efficiency on the MIMO performance of the antenna are further studied. A prototype of the antenna has been fabricated and the design has been verified by measurements against the simulations.Comment: 7 pages, 15 figures, 15 reference

More is simpler : effectively and efficiently assessing node-pair similarities based on hyperlinks

Similarity assessment is one of the core tasks in hyperlink analysis. Recently, with the proliferation of applications, e.g., web search and collaborative filtering, SimRank has been a well-studied measure of similarity between two nodes in a graph. It recursively follows the philosophy that "two nodes are similar if they are referenced (have incoming edges) from similar nodes", which can be viewed as an aggregation of similarities based on incoming paths. Despite its popularity, SimRank has an undesirable property, i.e., "zero-similarity": It only accommodates paths with equal length from a common "center" node. Thus, a large portion of other paths are fully ignored. This paper attempts to remedy this issue. (1) We propose and rigorously justify SimRank*, a revised version of SimRank, which resolves such counter-intuitive "zero-similarity" issues while inheriting merits of the basic SimRank philosophy. (2) We show that the series form of SimRank* can be reduced to a fairly succinct and elegant closed form, which looks even simpler than SimRank, yet enriches semantics without suffering from increased computational cost. This leads to a fixed-point iterative paradigm of SimRank* in O(Knm) time on a graph of n nodes and m edges for K iterations, which is comparable to SimRank. (3) To further optimize SimRank* computation, we leverage a novel clustering strategy via edge concentration. Due to its NP-hardness, we devise an efficient and effective heuristic to speed up SimRank* computation to O(Knm) time, where m is generally much smaller than m. (4) Using real and synthetic data, we empirically verify the rich semantics of SimRank*, and demonstrate its high computation efficiency

Human Capital and Risky Asset Allocation

Much research has been done to examine the relation between investors\u27 human capital and their financial asset allocation. While some showed that the value of human capital should be taken into consideration to make financial asset allocation decisions on the composition of investing portfolios, most argued not. In this paper, we selected the monthly return of 9 industrial ETFs from June of 2007 to July 2011, used the present value of total future income as estimate of human capital, and relied on the Mean-Variance Optimal Asset Allocation framework to reexamine if human capital will impact investors optimal financial portfolios. Based on our tests, we found significant connection between human capital and risky asset allocation, which resulted in significant change to weights allocated to the risk assets to create a Mean-Variance optimal portfolio

Electron transfer at molecule-metal interfaces under Floquet engineering: Rate constant and Floquet Marcus theory

Electron transfer (ET) at molecule-metal or molecule-semiconductor interfaces is a fundamental reaction that underlies all electro-chemical and molecular electronic processes as well as substrate-mediated surface photochemistry. In this study, we show that ET rates near a metal surface can be significantly manipulated by periodic modulations of an impurity level of the molecule near a metal surface. We employ the analytical Marcus theory and two numerical Floquet surface hopping algorithms that are developed previously, to calculate the ET rates near metal surface as a function of driving amplitudes and driving frequencies. We find that ET rates become faster with increasing the driving amplitude but no turnover effect, while have a turnover effect with increasing driving frequencies.Comment: 15 pages, 5 figure

Fast incremental SimRank on link-evolving graphs

SimRank is an arresting measure of node-pair similarity based on hyperlinks. It iteratively follows the concept that 2 nodes are similar if they are referenced by similar nodes. Real graphs are often large, and links constantly evolve with small changes over time. This paper considers fast incremental computations of SimRank on link-evolving graphs. The prior approach [12] to this issue factorizes the graph via a singular value decomposition (SVD) first, and then incrementally maintains this factorization for link updates at the expense of exactness. Consequently, all node-pair similarities are estimated in O(r4n2) time on a graph of n nodes, where r is the target rank of the low-rank approximation, which is not negligibly small in practice. In this paper, we propose a novel fast incremental paradigm. (1) We characterize the SimRank update matrix ΔS, in response to every link update, via a rank-one Sylvester matrix equation. By virtue of this, we devise a fast incremental algorithm computing similarities of n2 node-pairs in O(Kn2) time for K iterations. (2) We also propose an effective pruning technique capturing the “affected areas” of ΔS to skip unnecessary computations, without loss of exactness. This can further accelerate the incremental SimRank computation to O(K(nd+|AFF|)) time, where d is the average in-degree of the old graph, and |AFF| (≤ n2) is the size of “affected areas” in ΔS, and in practice, |AFF| ≪ n2. Our empirical evaluations verify that our algorithm (a) outperforms the best known link-update algorithm [12], and (b) runs much faster than its batch counterpart when link updates are small

Quantum forgery attacks on COPA,AES-COPA and marble authenticated encryption algorithms

The classic forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms need to query about 2^(n/2) times, and their success probability is not high. To solve this problem, the corresponding quantum forgery attacks on COPA, AES-COPA and Marble authenticated encryption algorithms are presented. In the quantum forgery attacks on COPA and AES-COPA, we use Simon's algorithm to find the period of the tag generation function in COPA and AES-COPA by querying in superposition, and then generate a forged tag for a new message. In the quantum forgery attack on Marble, Simon's algorithm is used to recover the secret parameter L, and the forged tag can be computed with L. Compared with classic forgery attacks on COPA, AES-COPA and Marble, our attack can reduce the number of queries from O(2^(n/2)) to O(n) and improve success probability close to 100%.Comment: 21 pages, 11 figure