A Scrutiny on the Cognisance of Indian and Foreign Wine Tourists on the Furtherance of Oenology Tourism in Bangalore

Tourism is lively and dynamic. A continual search seems to happen over the new frontiers in technologies, and fresh destinations. This paper attempts to investigate Bangalore as a prospective destination for wine tourism, alongside benchmarking its evolution and management. Bangalore, given its resource rich status, is profoundly suitable to grow vines, most of which produce wine that meets international expectations and standards. The global benchmarking standards for wine tourism include dimensions such as infrastructure facilities for wine tourists, packages for the promotion of wine tourism, development plan related to wine tourism and goals for wine tourism Scale Testing of significant difference - independent sample test and ANOVA – constructs by demographics. The findings say that the perception of both Indian and foreign respondents regarding the rating of each dimension of the promotion of wine tourism does not differ from each other

Peran Kepemimpinan Otentik terhadap Work Engagement Dosen dengan Efikasi Diri sebagai Mediator

Penelitian ini bertujuan untuk mengetahui peran kepemimpinan otentik daripersepsi dosen kepada pimpinannya terhadap work engagement dengan efikasi diri dalammelaksanakan tridharma perguruan tinggi sebagai mediatornya. Metode pengambilan datayang dilakukan dalam penelitian ini adalah metode survei dengan menyebarkan skala yangterdiri atas skala efikasi diri spesifik, kepemimpinan otentik serta skala work engagement.Partisipan adalah dosen Fakultas X Universitas Y dengan masa kerja minimal dua tahun(N=40). Analisis data dilakukan dengan menggunakan regresi. Hasil penelitian mendukungJDR-Model yang menjelaskan bahwa personal resources dalam hal ini efikasi diri berperansebagai prediktor terhadap work engagement. Hasil penelitian juga memperlihatkan bahwapersepsi kepemimpinan otentik tidak berkorelasi dengan work engagement sehingga efikasidiri tidak berfungsi sebagai mediator pada hubungan antara persepsi kepemimpinan otentikdengan work engagement. Walaupun demikian, efikasi diri mampu menjadi prediktor denganberkorelasi secara positif dan memiliki sumbangan efektif sebesar 11,6% terhadap workengagement. Hal ini berarti work engagement pada partisipan penelitian ini tidak dipengaruhioleh kepemimpinan otentik atasannya dan hanya dipengaruhi secara internal. Kebanggaansebagai pengajar menjadi sebuah dorongan internal sehingga work engagement tidakdipengaruhi oleh faktor luar

Braess's Paradox in Wireless Networks: The Danger of Improved Technology

When comparing new wireless technologies, it is common to consider the effect that they have on the capacity of the network (defined as the maximum number of simultaneously satisfiable links). For example, it has been shown that giving receivers the ability to do interference cancellation, or allowing transmitters to use power control, never decreases the capacity and can in certain cases increase it by $\Omega(\log (\Delta \cdot P_{\max}))$, where $\Delta$ is the ratio of the longest link length to the smallest transmitter-receiver distance and $P_{\max}$ is the maximum transmission power. But there is no reason to expect the optimal capacity to be realized in practice, particularly since maximizing the capacity is known to be NP-hard. In reality, we would expect links to behave as self-interested agents, and thus when introducing a new technology it makes more sense to compare the values reached at game-theoretic equilibria than the optimum values. In this paper we initiate this line of work by comparing various notions of equilibria (particularly Nash equilibria and no-regret behavior) when using a supposedly "better" technology. We show a version of Braess's Paradox for all of them: in certain networks, upgrading technology can actually make the equilibria \emph{worse}, despite an increase in the capacity. We construct instances where this decrease is a constant factor for power control, interference cancellation, and improvements in the SINR threshold ($\beta$), and is $\Omega(\log \Delta)$ when power control is combined with interference cancellation. However, we show that these examples are basically tight: the decrease is at most O(1) for power control, interference cancellation, and improved $\beta$, and is at most $O(\log \Delta)$ when power control is combined with interference cancellation

Faktor-faktor Penyebab Perilaku Merokok Pada Remaja

The purpose of this study was to determine which were predictors of smoking behavior on adolescents. The subjects of this study were 75 male, aged 15-18 years, and smokers. This study were done toward Scale of Parent\u27s Permissiveness Attitude to smoking behavior, Scale of peer influence, Scale of Psychological Satisfaction, and Scale of Smoking Behavior. The hypothesis was that parent\u27s permissiveness attitude to smoking behavior; influence of peer, psychological satisfaction was predictors toward smoking behavior on adolescents. There was co-linearity phenomenon between psychological satisfaction and others predictor so that psychological satisfaction out of regression analysis. The result of regression analysis showed that F value = 22,468 (p < 0,05) and R = (R = 0,620 ate R2 = 0,384). This meant that parent\u27s permissiveness attitude to smoking behavior and influence of peer was predictors toward smoking behavior on adolescents. It could be concluded that parent\u27s permissiveness attitude to smoking behavior and influence of peer were effectively contribution 38,4%. Keywords: Smoking behavior, adolescen

Distributed Symmetry Breaking in Hypergraphs

Fundamental local symmetry breaking problems such as Maximal Independent Set (MIS) and coloring have been recognized as important by the community, and studied extensively in (standard) graphs. In particular, fast (i.e., logarithmic run time) randomized algorithms are well-established for MIS and $\Delta +1$-coloring in both the LOCAL and CONGEST distributed computing models. On the other hand, comparatively much less is known on the complexity of distributed symmetry breaking in {\em hypergraphs}. In particular, a key question is whether a fast (randomized) algorithm for MIS exists for hypergraphs. In this paper, we study the distributed complexity of symmetry breaking in hypergraphs by presenting distributed randomized algorithms for a variety of fundamental problems under a natural distributed computing model for hypergraphs. We first show that MIS in hypergraphs (of arbitrary dimension) can be solved in $O(\log^2 n)$ rounds ($n$ is the number of nodes of the hypergraph) in the LOCAL model. We then present a key result of this paper --- an $O(\Delta^{\epsilon}\text{polylog}(n))$-round hypergraph MIS algorithm in the CONGEST model where $\Delta$ is the maximum node degree of the hypergraph and $\epsilon > 0$ is any arbitrarily small constant. To demonstrate the usefulness of hypergraph MIS, we present applications of our hypergraph algorithm to solving problems in (standard) graphs. In particular, the hypergraph MIS yields fast distributed algorithms for the {\em balanced minimal dominating set} problem (left open in Harris et al. [ICALP 2013]) and the {\em minimal connected dominating set problem}. We also present distributed algorithms for coloring, maximal matching, and maximal clique in hypergraphs.Comment: Changes from the previous version: More references adde

Trapping in complex networks

We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show using theory and simulations that in ER networks, while for short times $\rho(t) \propto \exp(-Act)$, for longer times $\rho(t)$ exhibits a more complex behavior, with explicit dependence on both the number of traps and the size of the network. In SF networks we reveal the significant impact of the trap's location: $\rho(t)$ is drastically different when a trap is placed on a random node compared to the case of the trap being on the node with the maximum connectivity. For the latter case we find \rho(t)\propto\exp\left[-At/N^\frac{\gamma-2}{\gamma-1}\av{k}\right] for all $\gamma>2$, where $\gamma$ is the exponent of the degree distribution $P(k)\propto k^{-\gamma}$.Comment: Appendix adde

A quantum Bose-Hubbard model with evolving graph as toy model for emergent spacetime

We present a toy model for interacting matter and geometry that explores quantum dynamics in a spin system as a precursor to a quantum theory of gravity. The model has no a priori geometric properties, instead, locality is inferred from the more fundamental notion of interaction between the matter degrees of freedom. The interaction terms are themselves quantum degrees of freedom so that the structure of interactions and hence the resulting local and causal structures are dynamical. The system is a Hubbard model where the graph of the interactions is a set of quantum evolving variables. We show entanglement between spatial and matter degrees of freedom. We study numerically the quantum system and analyze its entanglement dynamics. We analyze the asymptotic behavior of the classical model. Finally, we discuss analogues of trapped surfaces and gravitational attraction in this simple model.Comment: 23 pages, 6 figures; updated to published versio

Fast multipole networks

Two prerequisites for robotic multiagent systems are mobility and communication. Fast multipole networks (FMNs) enable both ends within a unified framework. FMNs can be organized very efficiently in a distributed way from local information and are ideally suited for motion planning using artificial potentials. We compare FMNs to conventional communication topologies, and find that FMNs offer competitive communication performance (including higher network efficiency per edge at marginal energy cost) in addition to advantages for mobility

Priority diffusion model in lattices and complex networks

We introduce a model for diffusion of two classes of particles ($A$ and $B$) with priority: where both species are present in the same site the motion of $A$'s takes precedence over that of $B$'s. This describes realistic situations in wireless and communication networks. In regular lattices the diffusion of the two species is normal but the $B$ particles are significantly slower, due to the presence of the $A$ particles. From the fraction of sites where the $B$ particles can move freely, which we compute analytically, we derive the diffusion coefficients of the two species. In heterogeneous networks the fraction of sites where $B$ is free decreases exponentially with the degree of the sites. This, coupled with accumulation of particles in high-degree nodes leads to trapping of the low priority particles in scale-free networks.Comment: 5 pages, 3 figure