Do changes in patent policy influence firms’ technology strategy? Evidence from manufacturing in India

India made patent policy changes to comply with TRIPs agreement that increased the rights of patent owners. Considering that such policy changes influence both in-house research and development investments and technology licensing from external sources, the firms have to accordingly devise their technology strategy. This study employs a simple and fixed effects multinomial logit regression models to study the impact of policy changes on the technology strategy of 402 firms operating in Indian manufacturing sector from 1999 to 2014. The results show that changes in patent policy have a significant impact on technology strategy of firms.     

Strong minimum energy hierarchical topology in wireless sensor networks

Given a set of \(n\) sensors, the strong minimum energy topology (SMET) problem in a wireless sensor network is to assign transmit powers to all sensors such that (i) the graph induced only using the bi-directional links is connected, that is, there is a path between every pair of sensors, and (ii) the sum of the transmit powers of all the sensors is minimum. This problem is known to be NP-hard. In this paper, we study a special case of the SMET problem, namely , the \(k\)-strong minimum energy hierarchical topology (\(k\)-SMEHT) problem. Given a set of \(n\) sensors and an integer \(k\), the \(k\)-SMEHT problem is to assign transmission powers to all sensors such that (i) the graph induced using only bi-directional links is connected, (ii) at most \(k\) nodes of the graph induced using only bi-directional links have two or more neighbors, that is they are non-pendant nodes, and (iii) the sum of the transmit powers of all the sensors in \(G\) is minimum. We show that \(k\)-SMEHT problem is NP-hard for arbitrary \(k\). However, we propose a \(\frac{k+1}{2}\)-approximation algorithm for \(k\)-SMEHT problem, when \(k\) is a fixed constant. Finally, we propose a polynomial time algorithm for the \(k\)-SMEHT problem for \(k=2\).     

On group divisible response surface (GDRS) designs

In this paper some experimental situations are identified corresponding to which suitable response surface designs do not exist. A class of response surface designs is introduced to cope with these situations. Their analysis with and without blocking and methods of construction is discussed.     

Hardness results and approximation algorithm for total liar’s domination in graphs

In this paper, we initiate the study of total liar’s domination of a graph. A subset L?V of a graph G=(V,E) is called a total liar’s dominating set of G if (i) for all v∈V, |N _G (v)∩L|≥2 and (ii) for every pair u,v∈V of distinct vertices, |(N _G (u)∪N _G (v))∩L|≥3. The total liar’s domination number of a graph G is the cardinality of a minimum total liar’s dominating set of G and is denoted by γ _TLR (G). The Minimum Total Liar’s Domination Problem is to find a total liar’s dominating set of minimum cardinality of the input graph G. Given a graph G and a positive integer k, the Total Liar’s Domination Decision Problem is to check whether G has a total liar’s dominating set of cardinality at most k. In this paper, we give a necessary and sufficient condition for the existence of a total liar’s dominating set in a graph. We show that the Total Liar’s Domination Decision Problem is NP-complete for general graphs and is NP-complete even for split graphs and hence for chordal graphs. We also propose a 2(lnΔ(G)+1)-approximation algorithm for the Minimum Total Liar’s Domination Problem, where Δ(G) is the maximum degree of the input graph G. We show that Minimum Total Liar’s Domination Problem cannot be approximated within a factor of $(\frac{1}{8}-\epsilon)\ln(|V|)$ for any ?>0, unless NP?DTIME(|V|^loglog|V|). Finally, we show that Minimum Total Liar’s Domination Problem is APX-complete for graphs with bounded degree 4.     

Algorithmic aspects of <Emphasis Type="Italic">b</Emphasis>-disjunctive domination in graphs

For a fixed integer \(b>1\), a set \(D\subseteq V\) is called a b-disjunctive dominating set of the graph \(G=(V,E)\) if for every vertex \(v\in V{\setminus }D\), v is either adjacent to a vertex of D or has at least b vertices in D at distance 2 from it. The Minimum b-Disjunctive Domination Problem (MbDDP) is to find a b-disjunctive dominating set of minimum cardinality. The cardinality of a minimum b-disjunctive dominating set of G is called the b-disjunctive domination number of G, and is denoted by \(\gamma _{b}^{d}(G)\). Given a positive integer k and a graph G, the b-Disjunctive Domination Decision Problem (bDDDP) is to decide whether G has a b-disjunctive dominating set of cardinality at most k. In this paper, we first show that for a proper interval graph G, \(\gamma _{b}^{d}(G)\) is equal to \(\gamma (G)\), the domination number of G for \(b \ge 3\) and observe that \(\gamma _{b}^{d}(G)\) need not be equal to \(\gamma (G)\) for \(b=2\). We then propose a polynomial time algorithm to compute a minimum cardinality b-disjunctive dominating set of a proper interval graph for \(b=2\). Next we tighten the NP-completeness of bDDDP by showing that it remains NP-complete even in chordal graphs. We also propose a \((\ln ({\varDelta }^{2}+(b-1){\varDelta }+b)+1)\)-approximation algorithm for MbDDP, where \({\varDelta }\) is the maximum degree of input graph \(G=(V,E)\) and prove that MbDDP cannot be approximated within \((1-\epsilon ) \ln (|V|)\) for any \(\epsilon >0\) unless NP \(\subseteq \) DTIME\((|V|^{O(\log \log |V|)})\). Finally, we show that MbDDP is APX-complete for bipartite graphs with maximum degree \(\max \{b,4\}\).     

Trust,Social Capital,and Intermediation Roles in Microfinance and Microenterprise Development

This study examines the role of trust and intermediation functions in microfinance and microenterprise development. Fifteen Self-help Groups (SHGs) were selected from three different locations in India for Focus Group Discussions (FGDs) and in-depth personal discussions. The peer trust was found higher than the intermediation trust during the microfinance group formation as well as group operations. The level of intermediation trust was higher than the peer trust during microenterprise development. The entry level trust was cognitive in nature, and transformed to ‘affective peer trust’ and ‘affective intermediation trust’ at the operational level. Trust was found to be the causality of social capital in SHGs. Intermediation trust was higher for early adopters of entrepreneurship than that of the late adopters. In case of microentrepreneur, the cognitive intermediation trust was transformed to affective intermediation trust with the passage of time.     

PRODUCTIVITY GROWTH IN GOODS AND SERVICES ACROSS THE HETEROGENEOUS STATES OF AMERICA

In this study, we examine the importance of multifactor productivity (MFP) growth in goods and services for U.S. States during 1980–2007 by applying the dual growth accounting framework. We find that MFP growth was relatively high and converged in the goods sector, but was low and did not converge in services. Although low growth in MFP in services was due to declining real user cost, particularly in real estate services, the lack of convergence itself was due to variation in wage growth. We also document that while the gap between productivity and wage growth was higher in goods, the two series were more strongly correlated in services. Finally, states with higher initial human capital experienced higher growth in both sectors. (JEL O47, R11)     

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

A set D?V of a graph G=(V,E) is a dominating set of G if every vertex in V?D has at least one neighbor in D. A dominating set D of G is a paired-dominating set of G if the induced subgraph, G[D], has a perfect matching. Given a graph G=(V,E) and a positive integer k, the paired-domination problem is to decide whether G has a paired-dominating set of cardinality at most k. The paired-domination problem is known to be NP-complete for bipartite graphs. In this paper, we, first, strengthen this complexity result by showing that the paired-domination problem is NP-complete for perfect elimination bipartite graphs. We, then, propose a linear time algorithm to compute a minimum paired-dominating set of a chordal bipartite graph, a well studied subclass of bipartite graphs.     

Robustness of complete diallel crossing plans against exchange of one cross

The robustness aspects of block designs for complete diallel crossing plans against the exchange of one cross using connectedness and efficiency criteria have been investigated. The exchanged cross may have either no line in common or one line in common with the original cross. It has been found that randomized complete block (RCB) designs for complete diallel crosses and binary balanced block designs for complete diallel crosses are robust against the exchange of one cross in one observation. The RCB designs for diallel crosses have been shown to be robust against the exchange of one cross with another cross in all the blocks. The non-binary balanced block designs obtainable from Family 5 of Das et al. (1998) have also been found to be robust against the exchange of one cross.