Learn More
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for(More)
In survival analysis, it is often of interest to test whether or not two survival time distributions are equal, specically in the prescence of censored data. One very popular test statistic utilized in this testing procedure is the weighted logrank statistic. Much attention has been focused on nding exible weight functions to use within the weighted logrank(More)
We utilized a discrete dynamic Bayesian network (dDBN) approach (Burge, J., Lane, T., Link, H., Qiu, S., Clark, V.P., 2007. Discrete dynamic Bayesian network analysis of fMRI data. Hum Brain Mapp.) to determine differences in brain regions between patients with schizophrenia and healthy controls on a measure of effective connectivity, termed the approximate(More)
We study the traffic flow on a highway with ramps through numerical simulations of a hydrodynamic traffic flow model. It is found that the presence of the external vehicle flux through ramps generates a new state of " recurring humps " (RH). This novel dynamic state is characterized by temporal oscillations of the vehicle density and velocity which are(More)
In this transcultural study of schizophrenic delusions among patients in Seoul, Shanghai and Taipei, we discovered that both the frequency and content of delusions differed among the three groups; and that these differences could perhaps be explained by varying sociocultural and political situations. Delusional themes that are sensitive to sociocultural or(More)
Avalanche dynamics is an indispensable feature of complex systems. Here, we study the self-organized critical dynamics of avalanches on scale-free networks with degree exponent through the Bak–Tang–Wiesenfeld (BTW) sandpile model. The threshold height of a node i is set as k 1−Á i with 0 6 Á ¡ 1, where ki is the degree of node i. Using the branching process(More)
—Community detection has been one of the major topics in complex network research. Recently, several greedy algorithms for networks of millions of nodes have been proposed, but one of their limitations is inconsistency of outcomes [1]. Kwak et al. propose an iterative reinforcing approach to eliminate inconsistency in detected communities. In this paper we(More)