560,378 research outputs found
Rain rate and modeled fade distributions at 20 GHz and 30 GHz derived from five years of network rain gauge measurements
Five years of rain rate and modeled slant path attenuation distributions at 20 GHz and 30 GHz derived from a network of 10 tipping bucket rain gages was examined. The rain gage network is located within a grid 70 km north-south and 47 km east-west in the Mid-Atlantic coast of the United States in the vicinity of Wallops Island, Virginia. Distributions were derived from the variable integration time data and from one minute averages. It was demonstrated that for realistic fade margins, the variable integration time results are adequate to estimate slant path attenuations at frequencies above 20 GHz using models which require one minute averages. An accurate empirical formula was developed to convert the variable integration time rain rates to one minute averages. Fade distributions at 20 GHz and 30 GHz were derived employing Crane's Global model because it was demonstrated to exhibit excellent accuracy with measured COMSTAR fades at 28.56 GHz
Path optimization method for the sign problem
We propose a path optimization method (POM) to evade the sign problem in the
Monte-Carlo calculations for complex actions. Among many approaches to the sign
problem, the Lefschetz-thimble path-integral method and the complex Langevin
method are promising and extensively discussed. In these methods, real field
variables are complexified and the integration manifold is determined by the
flow equations or stochastically sampled. When we have singular points of the
action or multiple critical points near the original integral surface, however,
we have a risk to encounter the residual and global sign problems or the
singular drift term problem. One of the ways to avoid the singular points is to
optimize the integration path which is designed not to hit the singular points
of the Boltzmann weight. By specifying the one-dimensional integration-path as
and by optimizing to enhance the average
phase factor, we demonstrate that we can avoid the sign problem in a
one-variable toy model for which the complex Langevin method is found to fail.
In this proceedings, we propose POM and discuss how we can avoid the sign
problem in a toy model. We also discuss the possibility to utilize the neural
network to optimize the path.Comment: Talk given at the 35th International Symposium on Lattice Field
Theory, 18-24 June 2017, Granada, Spain. 8 pages, 4 figures (references are
updated in v2
Learning accurate path integration in a ring attractor model of the head direction system
Ring attractor models for angular path integration have recently received strong experimental support. To function as integrators, head-direction (HD) circuits require precisely tuned connectivity, but it is currently unknown how such tuning could be achieved. Here, we propose a network model in which a local, biologically plausible learning rule adjusts synaptic efficacies during development, guided by supervisory allothetic cues. Applied to the Drosophila HD system, the model learns to path-integrate accurately and develops a connectivity strikingly similar to the one reported in experiments. The mature network is a quasi-continuous attractor and reproduces key experiments in which optogenetic stimulation controls the internal representation of heading, and where the network remaps to integrate with different gains. Our model predicts that path integration requires supervised learning during a developmental phase. The model setting is general and also applies to architectures that lack the physical topography of a ring, like the mammalian HD system
Integration Cluster and Path Analysis Based on Science Data in Revealing Stunting Incidents
The purpose of this research is to utilize big data to explore the factors that influence the prevalence of stunting in Wajak Regency, model these factors using integrated cluster analysis and` path analysis model, and develop an information system for stunting incidence modeling. This study uses a descriptive and explanative approach, namely using Discourse Network Analysis, cluster analysis, path analysis, and integration of cluster and path analysis. The sample of this research is children under five in Wajak District who were selected using stratified random sampling. The distance measure that has the highest model goodness value in modeling using the integration of cluster analysis with path analysis is the Mahalanobis distance measure. The cluster analysis with Mahalanobis distance produces 3 clusters where cluster one is a toddler who has a low stunting category, cluster two is a group of toddlers who has a moderate stunting category, and cluster three is a group of toddlers who has a high stunting category. The originality of this study is the application of Discourse Network Analysis analysis to obtain new variables followed by a comparison of three distances namely euclidean, manhattan, and mahalanobis in modeling using cluster integration and parametric paths
Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Path
Relation classification is an important research arena in the field of
natural language processing (NLP). In this paper, we present SDP-LSTM, a novel
neural network to classify the relation of two entities in a sentence. Our
neural architecture leverages the shortest dependency path (SDP) between two
entities; multichannel recurrent neural networks, with long short term memory
(LSTM) units, pick up heterogeneous information along the SDP. Our proposed
model has several distinct features: (1) The shortest dependency paths retain
most relevant information (to relation classification), while eliminating
irrelevant words in the sentence. (2) The multichannel LSTM networks allow
effective information integration from heterogeneous sources over the
dependency paths. (3) A customized dropout strategy regularizes the neural
network to alleviate overfitting. We test our model on the SemEval 2010
relation classification task, and achieve an -score of 83.7\%, higher than
competing methods in the literature.Comment: EMNLP '1
Accurate path integration in continuous attractor network models of grid cells
Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal's position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat's velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of ~10–100 meters and ~1–10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other
- …