Information technology, Part 3. The technology hierarchy

The era of the networked society--and medical care depending on networked intelligence--is dawning. Physicians need to plan for office practice information systems in common, with an eye to conveying data electronically between all the locations of care and all the providers involved in caring for defined populations of people. The shared database will become the most important asset of the collection of providers who make up the delivery system that creates it. This will be accomplished by layering technology on local and wide-area networks of group practices, hospitals, health plans, and payers and developing standards that make data accessible in the same format to all users, no matter where they are.     

Internationalization,Innovation and Institutions: The 3 I's Underpinning the Competitiveness of Emerging Market Firms

The past decade has seen an increase in the extent of research focused on and around emerging market firms (EMFs) and their rising levels of competitiveness in both their home markets and more importantly in the global market place. At the same time, the practitioner-oriented literature has been documenting a growing number of corporate success stories that originate in emerging market economies. We posit that the growing prominence of EMFs is a result of three interrelated phenomena: the fast-paced internationalization of EMFs into both developing and developed market economies; the rapidly increasing extent to which business enterprises in emerging economies are focusing on knowledge-intensive processes and innovation; and the continuous evolution of institutions in these markets, particularly in terms of economic liberalization.     

The 3-rainbow index and connected dominating sets

A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of \(G\) is called a 3-rainbow coloring if for any three vertices in \(G\), there exists a rainbow tree connecting them. The 3-rainbow index \(rx_3(G)\) of \(G\) is defined as the minimum number of colors that are needed in a 3-rainbow coloring of \(G\). This concept, introduced by Chartrand et al., can be viewed as a generalization of the rainbow connection. In this paper, we study the 3-rainbow index by using connected 3-way dominating sets and 3-dominating sets. We show that for every connected graph \(G\) on \(n\) vertices with minimum degree at least \(\delta \, (3\le \delta \le 5)\), \(rx_{3}(G)\le \frac{3n}{\delta +1}+4\), and the bound is tight up to an additive constant; whereas for every connected graph \(G\) on \(n\) vertices with minimum degree at least \(\delta \, (\delta \ge 3)\), we get that \(rx_{3}(G)\le \frac{\ln (\delta +1)}{\delta +1}(1+o_{\delta }(1))n+5\). In addition, we obtain some tight upper bounds of the 3-rainbow index for some special graph classes, including threshold graphs, chain graphs and interval graphs.     

2-Distance coloring of a planar graph without 3, 4, 7-cycles

A 2-distance coloring of a graph is a coloring of the vertices such that two vertices at distance at most two receive distinct colors. The 2-distance chromatic number \(\chi _{2}(G)\) is the smallest k such that G is k-2-distance colorable. In this paper, we prove that every planar graph without 3, 4, 7-cycles and \(\Delta (G)\ge 15\) is (\(\Delta (G)+4\))-2-distance colorable.