Snow cover, snowmelt and runoff in the Himalayan River basins

Not withstanding the seasonal vagaries of both rainfall amount and snowcover extent, the Himalayan rivers retain their basic perennial character. However, it is the component of snowmelt yield that accounts for some 60 to 70 percent of the total annual flow volumes from Hamilayan watersheds. On this large hydropotential predominantly depends the temporal performance of hydropower generation and major irrigation projects. The large scale effects of Himalayan snowcover on the hydrologic responses of a few selected catchments in western Himalayas was studied. The antecedent effects of snowcover area on long and short term meltwater yields can best be analyzed by developing appropriate hydrologic models forecasting the pattern of snowmelt as a function of variations in snowcover area. It is hoped that these models would be of practical value in the management of water resources. The predictability of meltwater for the entire snowmelt season was studied, as was the concurrent flow variation in adjacent watersheds, and their hydrologic significance. And the applicability of the Snowmelt-Runoff Model for real time forecast of daily discharges during the major part of the snowmelt season is examined

Participative Management in Post Liberalisation- A case study of Indian Jute industry

The concept of employee participation in organization’s decision making is not new. However, the idea couldn’t gain that much popularity among organizations. Studies have shown that only 3-5 percent of organizations have actually implemented this concept in their daily operations. Jute Industry is one of the oldest and high labour intensive industries particularly unskilled and semiskilled. This industry lost huge number of manly hours and productivity due to poor industrial relations. Various studies revealed that the industrial relations are improved in post liberalization in India. So, the researcher studied the importance and application of participative management in post liberalization in this industry. The researcher collected the opinions from the sample respondents through a questionnaire and analyzed with five point Likert scale and weighted average. It reveals in post liberalization employers recognized the importance of participative management which improve the operational efficiency of the employees and maintain cordial industrial relations. Keywords: Participative Management, industrial relations, liberalization, jute industry, operational efficiency, productivity, employee involvement, job enrichment

Collaborative Concealment of Spatio-Temporal Mobile Sequential Patterns

Recent advances in communication and information technology such as the increasing accuracy of GPS technology and the portability of wireless communication devices coat the way for Location Based Services LBS Based on the data collected from the location aware mobile devices data mining techniques are used to meet the quality requirements of expected services The efficient management of moving object databases has gained much interest in recent years due to the development of mobile communication and positioning technologies A typical way of representing moving objects is to use the trajectories Much work has focused on the topics of indexing query processing and data mining of moving object trajectories but little attention has been paid to the preservation of privacy in this setting The major contribution of this paper is to provide privacy to the users of Location Based Services along with capturing interesting user s behavior pattern by broaden the ideas presented in the datamining-literatur

Algorithmic Complexity of Isolate Secure Domination in Graphs

A dominating set $S$ is an Isolate Dominating Set (IDS) if the induced subgraph $G[S]$ has at least one isolated vertex. In this paper, we initiate the study of new domination parameter called, isolate secure domination. An isolate dominating set $S\subseteq V$ is an isolate secure dominating set (ISDS), if for each vertex $u \in V \setminus S$, there exists a neighboring vertex $v$ of $u$ in $S$ such that $(S \setminus \{v\}) \cup \{u\}$ is an IDS of $G$. The minimum cardinality of an ISDS of $G$ is called as an isolate secure domination number, and is denoted by $\gamma_{0s}(G)$. Given a graph $G=(V,E)$ and a positive integer $k,$ the ISDM problem is to check whether $G$ has an isolate secure dominating set of size at most $k.$ We prove that ISDM is NP-complete even when restricted to bipartite graphs and split graphs. We also show that ISDM can be solved in linear time for graphs of bounded tree-width.Comment: arXiv admin note: substantial text overlap with arXiv:2002.00002; text overlap with arXiv:2001.1125

Algorithmic Aspects of Secure Connected Domination in Graphs

Let $G = (V,E)$ be a simple, undirected and connected graph. A connected dominating set $S \subseteq V$ is a secure connected dominating set of $G$, if for each $u \in V\setminus S$, there exists $v\in S$ such that $(u,v) \in E$ and the set $(S \setminus \{ v \}) \cup \{ u \}$ is a connected dominating set of $G$. The minimum size of a secure connected dominating set of $G$ denoted by $\gamma_{sc} (G)$, is called the secure connected domination number of $G$. Given a graph $G$ and a positive integer $k,$ the Secure Connected Domination (SCDM) problem is to check whether $G$ has a secure connected dominating set of size at most $k.$ In this paper, we prove that the SCDM problem is NP-complete for doubly chordal graphs, a subclass of chordal graphs. We investigate the complexity of this problem for some subclasses of bipartite graphs namely, star convex bipartite, comb convex bipartite, chordal bipartite and chain graphs. The Minimum Secure Connected Dominating Set (MSCDS) problem is to find a secure connected dominating set of minimum size in the input graph. We propose a $(\Delta(G)+1)$ - approximation algorithm for MSCDS, where $\Delta(G)$ is the maximum degree of the input graph $G$ and prove that MSCDS cannot be approximated within $(1 -\epsilon) ln(| V |)$ for any $\epsilon > 0$ unless $NP \subseteq DTIME(| V |^{O(log log | V |)})$ even for bipartite graphs. Finally, we show that the MSCDS is APX-complete for graphs with $\Delta(G)=4$