This simulation study examined the performance of the curve-of-factors model (COFM) when autocorrelation and growth processes were present in the first-level factor structure. In addition to the standard curve-of factors growth model, two new models were examined: one COFM that included a first-order autoregressive autocorrelation parameter, and a second model that included first-order autoregr...

We propose an O(min{m+n logn,m log∗n}) to find a minmax strongly connected spanning subgraph of a digraph with n nodes and m arcs. A generalization of this problem called the minmax strongly connected subgraph problem with node penalties is also considered. An O(m logn) algorithm is proposed to solve this general problem. We also discuss ways to improve the average complexity of this algorithm.

In this paper, we prove that, under full rank, every perfect public equilibrium payoff (above some Nash equilibrium in the two-player case, and above the minmax payoff with more players) can be achieved with strategies that have bounded memory. This result is then used to prove that feasible, individually rational payoffs (above some strict Nash equilibrium in the two-player case, and above the...

Cyclotomic constructions are given for several infinite families of even length binary sequences, which have optimal or near-optimal negaperiodic autocorrelation. It appears that two of the constructions have an asymptotic Merit Factor of 6.0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.

Hierarchical clustering constructs a hierarchy of clusters by either repeatedly merging two smaller clusters into a larger one or splitting a larger cluster into smaller ones. The crucial step is how to best select the next cluster(s) to split or merge. Here we provide a comprehensive analysis of selection methods and propose several new methods. We perform extensive clustering experiments to t...

I Basic Results on Normal Form Games 3 I.1 The Minmax Theorem 4 I.1.a Definitions and Notations 4 I.1.b A Basic Theorem 5 I.1.c Convexity 6 I.1.d Mixed Strategies 6 I.1.e Note on the Separation Theorem 9 Exercises 10 I.2 Complements to the Minmax Theorem 15 I.2.a The Topology on S 16 I.2.b Lack of Continuity: Regularization 16 I.2.c Lack of Compactness: Approximation 19 I.2.d Measurability: Sym...

Exploring the spatial variations and impact of social factors on commuting behavior is vital to promote cities’ sustainable development improve residents’ daily lives. Based 2015 1% Population Sample Survey data in Shanghai, this study constructs an improved accessibility index evaluate jobs–housing relationship compares duration distance at sub-district level by using autocorrelation analysis,...

Cyclotomic constructions are given for several infinite families of even length binary sequences which have low negaperiodic autocorrelation. It appears that two of the constructions have asymptotic Merit Factor 6.0 which is very high. Mappings from periodic to negaperiodic autocorrelation are also discussed.