Unsupervised classification of multilook polarimetric SAR data using spatially variant wishart mixture model with double constraints

This paper addresses the unsupervised classification problems for multilook Polarimetric synthetic aperture radar (PolSAR) images by proposing a patch-level spatially variant Wishart mixture model (SVWMM) with double constraints. We construct this model by jointly modeling the pixels in a patch (rather than an individual pixel) so as to effectively capture the local correlation in the PolSAR images. More importantly, a responsibility parameter is introduced to the proposed model, providing not only the possibility to represent the importance of different pixels within a patch but also the additional flexibility for incorporating the spatial information. As such, double constraints are further imposed by simultaneously utilizing the similarities of the neighboring pixels, respectively, defined on two different parameter spaces (i.e., the hyperparameter in the posterior distribution of mixing coefficients and the responsibility parameter). Furthermore, the variational inference algorithm is developed to achieve effective learning of the proposed SVWMM with the closed-form updates, facilitating the automatic determination of the cluster number. Experimental results on several PolSAR data sets from both airborne and spaceborne sensors demonstrate that the proposed method is effective and it enables better performances on unsupervised classification than the conventional methods

Implicit Density Functional Theory

A fermion ground state energy functional is set up in terms of particle density, relative pair density, and kinetic energy tensor density. It satisfies a minimum principle if constrained by a complete set of compatibility conditions. A partial set, which thereby results in a lower bound energy under minimization, is obtained from the solution of model systems, as well as a small number of exact sum rules. Prototypical application is made to several one-dimensional spinless non-interacting models. The effectiveness of "atomic" constraints on model "molecules" is observed, as well as the structure of systems with only finitely many bound states.Comment: 9 pages, 4 figure

Making hierarchical modulation more flexible

In a broadcast system using the hierarchical modulation, the system delivers several streams with different waveforms and required Signal-to-Noise Ratio (SNR), typically SD- TV and HD-TV. At the application layer, each stream is delivered with a particular rate. The physical layer must be defined in order to optimize the protection of each stream with respect to the double constraints of both the data rates and the SNR thresholds. We show in this paper that a standard like DVB-SH is not always well adapted to meet these system constraints in operational typical cases. After exposing the current limitations of a classical hierarchical modulation approach, we present two possible adaptations to address these operational requirements and offer more flexibility in hierarchical modulation design

Improvement of the robustness on geographical networks by adding shortcuts

In a topological structure affected by geographical constraints on liking, the connectivity is weakened by constructing local stubs with small cycles, a something of randomness to bridge them is crucial for the robust network design. In this paper, we numerically investigate the effects of adding shortcuts on the robustness in geographical scale-free network models under a similar degree distribution to the original one. We show that a small fraction of shortcuts is highly contribute to improve the tolerance of connectivity especially for the intentional attacks on hubs. The improvement is equivalent to the effect by fully rewirings without geographical constraints on linking. Even in the realistic Internet topologies, these effects are virtually examined.Comment: 14 pages, 10 figures, 1 tabl

Semantic-driven matchmaking of web services using case-based reasoning

With the rapid proliferation of Web services as the medium of choice to securely publish application services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web service discovery and matchmaking. Our framework considers Web services execution experiences in the decision making process and is highly adaptable to the service requester constraints. The framework also utilises OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web services

Constraint of B_{d,s}-bar{B}_{d,s} mixing on warped extra-dimension model

Recent CDF measurement of the Bs-Bs oscillation frequency, at the Tevatron imposes significant constraint on various models for new physics. A warped extra-dimension model with custodial isospin symmetry accommodates the Bd-Bd mixing at tree level mainly through the Kaluza-Klein gluons. This is due to the misalignment between the bulk gauge eigenstates and the localized Yukawa eigenstates of the bulk fermions. We adopt the universal 5D Yukawa coupling model where all Yukawa couplings are of order one. The SM fermion mass spectra and mixings are controlled by the bulk Dirac mass parameters. With two versions of the hadronic parameter values, we investigate the implication of the observed BB mixings on this model. The CP-violating effects on the Bd system is shown to provide very strong constraint: The first Kaluza-Klein mass of a gluon has its lower bound about 3.7 TeV with 1 sigma uncertainty.Comment: published version in JHEP, CP-violating effects include

Analysis of Subscription Demand for Pay-TV

In this paper, we will conduct an analysis from an empirical perspective concerning broadcasting demand behavior and characteristics. More concretely, we will assume three options (subscription patterns), namely, nonsubscription, cable TV subscription, and subscription to broadcasting services via communications satellites (CS), and we will conduct an analysis of broadcasting service demand behavior using a discrete choice model. According to our result, price elasticity is low for cable TV and CS subscribers, which is a contrast to the United States, where price elasticity for paid broadcasting is high. It shows that factors other than price continue to have a strong influence on demand behavior (subscription choices) in the Japanese market for regular and paid broadcasting (the multichannel market) and that the market has not yet entered the phase of price competition between cable TV and CS broadcasting. With regard to channel number elasticity, the figures are high for basic channel service and low for special channel services. This indicates that basic services are an important concern for viewers. This suggests that, in line with reports that the spread of cable TV in the United States was promoted by difficulty in receiving terrestrial broadcasts, basic channel services may be more important than special channels as keys to the spread of paid broadcasting in Japan.Subscription demand, Broadcasting service, Pay-TV, Discrete choice model, Price/Channel elasticity