Factors Affecting Knowledge Sharing in Strategic Alliances: The Role of Knowledge Sharing as Strategic Control Behavior among Multinational Enterprises

International strategic alliances (ISAs) have become increasingly important for the stability, growth, and long-term viability of modern business organizations. Alliance partnerships as inter-firm cooperative ventures represent an influential mechanism for asserting corporate strategic control among autonomous multinational enterprises. These different cooperative arrangements are made of equity investments or contractually-based partnerships. Different alliance forms represent different approaches that partner firms adopt to control their mutual dependence on the alliance and on other partners. Earlier research shows that the partner characteristics could provide an explanation for alliance strategic behavior and see alliances as alternative forms to markets or hierarchies for addressing specific strategic needs linked to partners’ characteristics and their subsequent strategic motives. These characteristics of the partners’ and subsequent strategic motives are analyzed as knowledge sharing factors and how these influence inter-firm control in alliances within the context of the focal-firm STMicroelectronics and its alliance partners Nokia, Ericsson and IBM. This study underline that as contracts are incomplete, they are therefore required to maintain mutual dependence based control mechanisms in addition to a contract. For example, mutual dependence based control mechanisms could be joint financial investments and the building of an ownership structure between the parties (e.g., JVs). However, the present study clarifies that subsequent inter-firm control is also exercised through inter-firm knowledge sharing. The present study contributes by presenting a dynamic interplay between competitive and cooperative rent seeking behavior. Such coopetition behavior describes the firm's strategic orientation to achieve a dynamic balance between competitive and cooperative strategies. This balance is seen in knowledge sharing based cooperation and competition behavior. Thus this study clarifies coopetition strategies by introducing the role of inter-firm cooperation and the competitive nature of knowledge sharing. Simultaneous cooperative and competitive behavior is also seen as synergetic rent-seeking behavior. Therefore, this study extends the perspective of previous studies on competitive and cooperative seeking behavior.

Paradox between democracy and security- case study on Pakistan

Pro gradu-tutkielma tutkii demokratian ja turvallisuuden paradoksia Pakistanissa esitellen kuusi tekijää, jotka vaikuttavat kyseiseen paradoksiin. Näitä tekijöitä ovat historiallinen kehitys; eliittihallinto; taloudellinen kehitys; Pakistanin poliittisten tekijöiden demokratian eri määritelmät; opetuksen puuttuminen; ja valtataistelu hallituksen, armeijan, tiedustelupalvelun, oikeusjärjestelmän, poliittisten puolueiden sekä eri heimojen, uskonnollisten ja etnisten ryhmien välillä. Tutkimus tarkastelee myös sitä miten nämä tekijät vaikuttavat demokratian kehitykseen Pakistanissa. Keskeinen argumentti on, että länsimainen demokratia ei esiinny eikä toimi Pakistanissa vallitsevissa oloissa, etenkin historiallisen kehityksen ja ulkoisen turvallisuuden takia. Pro gradu-tutkielma käyttää sekundäärisiä lähteitä, kuten kirjoja, artikkeleita, maaraportteja, kommentaareja sekä omiin kokemuksiin perustuvia havaintoja Pakistanin matkalta 2010-2011. Keskeiset teoriat gradussa ovat Guillermo O’ Donnelin delegaattidemokratia sekä Duncan McCargon eliittihallintoteoria, jotka yhdessä selittävät historiallista kehitystä ja eliittihallinnon dynamiikkaa, mitkä johtavat paradoksiin. Kautta historian armeija on hallinnut Pakistania, ja siviilihallinto on ainoastaan neljä kertaa onnistunut olemaan vallassa, mutta silloinkin siviilihallinto päättyi korruptioväitteisiin tai armeijan vallankaappaukseen. Armeijahallinnoille on luonteenomaista hyvät suhteet USA:n, positiivinen taloudellinen kehitys ja vakaus, kun taas siviilihallinnot ovat epävakaita ja korruptoituneita. Tämä kehitys on paradoksin tausta, joka rakentuu turvallisuuspoliittisen tilanteen pohjalle eli hallitusten ja muiden tekijöiden yritykseen löytää vastapaino Intian uhalle. Tämä on ollut keskeinen huoli kelle tahansa poliittiselle päättäjälle itsenäisyydestä lähtien. Loputon valtataistelu eri poliittisten tekijöiden kesken sekä eliittihallinto pitävät yllä paradoksia, koska eliitit ovat kiinnostuneempia oman valtansa säilyttämisestä kuin kansan tahdon huomioonottamisesta. Koska valtaosa ihmisistä ei ole koulutettuja, he ovat paljolti kiinnostuneita omasta selviytymisestään, ja tämän takia sekä kansa että eliitit suosivat armeijahallintoa, koska se tuo vakautta ja taloudellista kehitystä. Sen vuoksi vallitsevissa oloissa demokratian tulevaisuus Pakistanissa näyttää huonolta, koska liberaalidemokratian vaatimukset eivät täyty puoliksi vapaan oikeussysteemin, puoliksi vapaan lehdistön, valtavan korruption ja monien ihmisoikeusloukkauksien takia unohtamatta armeijan ja tiedustelupalvelun sekaantumista siviilihallintoon.

Grinding abrasive wear and associated particle size effect

The type of abrasion that the grinding medium experiences inside a ball mill is classified as high stress or grinding abrasion, because the stress levels at the surface of the medium exceed the yield stress of the metal when hard abrasives are crushed. During dry grinding of ores the medium undergoes not only abrasion but also erosion and impact. As all three mechanisms of wear occur simultaneously, it is difficult to follow the individual components of wear. However, it is possible to show that the overall kinetics of wear follows a simple power law of the type w = at(b), where w is the weight loss of the grinding medium for a specified grinding time t and a and b are constants. Experimental data, obtained from dry grinding of quartz for a wide range of times using AISI 52100 steel balls having various microstructures in a laboratory scale batch mill, are fitted to the proposed equation and the wear rate w is calculated from the first derivative of the equation. The mean particle sizes of the quartz charge DBAR corresponding to 50 and 80% retained size are determined by mechanical sieving of the ground product after a grinding time t and thus the relationship between wear rate and particle size of the abrasive is established. It is found that w increases rapidly with DBAR up to some critical size and then increases at a much lower rate.

Ball wear mechanisms and control in the grinding of sulfide and phosphate ores

Marked ball grinding tests were carried out in the laboratory using high carbon low alloy steel (cast and forged) and high chrome cast iron balls. Relative ball wear as a function of grinding period and milling conditions was evaluated for the different type of ball materials in the grinding of lead-zinc sulphide and phosphate ores. Results indicated that ball wear increased with time and showed a sharp increase for wet grinding over dry grinding. Ball wear under wet grinding conditions was also influenced by the gaseous atmosphere in the mill. The influence of oxygen on the corrosive wear of grinding balls was increasingly felt in case of sulphide ore grinding. The grinding ball materials could be arranged in the following order with respect to their overall wear resistance:

Laboratory studies on ball wear in the grinding of a chalcopyrite ore

Wear of high carbon low alloy (HCLA) cast steel balls during the grinding of a chalcopyrite ore was evaluated under different experimental conditions. The role of oxygen in enhancing ball wear during wet finding is brought out. The influence of pH on ball wear was also examined from the view point of acid production during grinding and reactivity of sulphides. Contributions from corrosion and abrasion towards ball wear are quantified in terms of ball wear rates as a function of time, particle size and gaseous atmosphere in the mill.

Milling maps and amorphization during mechanical alloying

The effect of various milling parameters such as, milling intensity, ball:powder weight ratio and number of balls on the glass forming ability of an elemental blend of composition Ti50Ni50 has been studied by mechanical alloying. In order to understand the results, all the milling parameters have been converted into two energy parameters, namely, impact energy of the ball and the total energy of milling. In a milling map of these two parameters, the conditions for amorphous phase formation have been isolated. A similar exercise has been carried out for Ti50Cu50 as a function of milling time at two milling intensities. The results indicate that a minimum impact energy of the ball and a minimum total energy are essential for amorphization by mechanical alloying.

Studies on grinding media wear and its effect on flotation of ferrugenous phosphate ore

Marked ball grinding rests were carried out in the laboratory with a low grade phosphate ore under different experimental conditions. Two types of balls were used, namely high carbon low alloy (HCLA) cast steel and high chrome cast iron. Results of marked ball grinding tests indicated that ball wear increased with time and showed a sharp increase for wet grinding over dry grinding. Ball wear under wet grinding conditions was also influenced by the gaseous atmosphere in the mill. The grinding ball materials could be arranged in the following order with respect to their overall wear resistance: High chrome cast iron > HCLA cast steel balls Methods to minimize ball wear through control of mill atmosphere and addition of flotation reagents are discussed. Effect of grinding media and additions of flotation reagents during grinding on phosphate ore flotation are also discussed. (C) 1999 Elsevier Science Ltd. All rights reserved.

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Some Aspects of the Kobayashi and Carath,odory Metrics on Pseudoconvex Domains

The purpose of this article is to consider two themes, both of which emanate from and involve the Kobayashi and the Carath,odory metric. First, we study the biholomorphic invariant introduced by B. Fridman on strongly pseudoconvex domains, on weakly pseudoconvex domains of finite type in C (2), and on convex finite type domains in C (n) using the scaling method. Applications include an alternate proof of the Wong-Rosay theorem, a characterization of analytic polyhedra with noncompact automorphism group when the orbit accumulates at a singular boundary point, and a description of the Kobayashi balls on weakly pseudoconvex domains of finite type in C (2) and convex finite type domains in C (n) in terms of Euclidean parameters. Second, a version of Vitushkin's theorem about the uniform extendability of a compact subgroup of automorphisms of a real analytic strongly pseudoconvex domain is proved for C (1)-isometries of the Kobayashi and Carath,odory metrics on a smoothly bounded strongly pseudoconvex domain.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

A generic variant of NIST’s KAS2 key agreement protocol

We propose a generic three-pass key agreement protocol that is based on a certain kind of trapdoor one-way function family. When specialized to the RSA setting, the generic protocol yields the so-called KAS2 scheme that has recently been standardized by NIST. On the other hand, when specialized to the discrete log setting, we obtain a new protocol which we call DH2. An interesting feature of DH2 is that parties can use different groups (e.g., different elliptic curves). The generic protocol also has a hybrid implementation, where one party has an RSA key pair and the other party has a discrete log key pair. The security of KAS2 and DH2 is analyzed in an appropriate modification of the extended Canetti-Krawczyk security model.

Identification of prospective locations for generation expansion with least augmentation of network

With ever increasing demand for electric energy, additional generation and associated transmission facilities has to be planned and executed. In order to augment existing transmission facilities, proper planning and selective decisions are to be made whereas keeping in mind the interests of several parties who are directly or indirectly involved. Common trend is to plan optimal generation expansion over the planning period in order to meet the projected demand with minimum cost capacity addition along with a pre-specified reliability margin. Generation expansion at certain locations need new transmission network which involves serious problems such as getting right of way, environmental clearance etc. In this study, an approach to the citing of additional generation facilities in a given system with minimum or no expansion in the transmission facility is attempted using the network connectivity and the concept of electrical distance for projected load demand. The proposed approach is suitable for large interconnected systems with multiple utilities. Sample illustration on real life system is presented in order to show how this approach improves the overall performance on the operation of the system with specified performance parameters.

Periodic architecture for high performance shock absorbing composites

A novel composite architecture consisting of a periodic arrangement of closely-spaced spheres of a stiff material embedded in a soft matrix is proposed for extremely high damping and shock absorption capacity. Efficacy of this architecture is demonstrated by compression loading a composite, where multiple steel balls were stacked upon each other in a polydimethylsiloxane (PDMS) matrix, at a low strain-rate of 0.05 s(-1) and a very high strain-rate of >2400 s(-1). The balls slide over each other upon loading, and revert to their original position when the load is removed. Because of imposition of additional strains into the matrix via this reversible, constrained movement of the balls, the composite absorbs significantly larger energy and endures much lesser permanent damage than the monolithic PDMS during both quasi-static and impact loadings. During the impact loading, energy absorbed per unit weight for the composite was, 8 times larger than the monolithic PDMS.

On k-stellated and k-stacked spheres

We introduce the class Sigma(k)(d) of k-stellated (combinatorial) spheres of dimension d (0 <= k <= d + 1) and compare and contrast it with the class S-k(d) (0 <= k <= d) of k-stacked homology d-spheres. We have E-1(d) = S-1(d), and Sigma(k)(d) subset of S-k(d) ford >= 2k-1. However, for each k >= 2 there are k-stacked spheres which are not k-stellated. For d <= 2k - 2, the existence of k-stellated spheres which are not k-stacked remains an open question. We also consider the class W-k(d) (and K-k(d)) of simplicial complexes all whose vertex-links belong to Sigma(k)(d - 1) (respectively, S-k(d - 1)). Thus, W-k(d) subset of K-k(d) for d >= 2k, while W-1(d) = K-1(d). Let (K) over bar (k)(d) denote the class of d-dimensional complexes all whose vertex-links are k-stacked balls. We show that for d >= 2k + 2, there is a natural bijection M -> (M) over bar from K-k(d) onto (K) over bar (k)(d + 1) which is the inverse to the boundary map partial derivative: (K) over bar (k)(d + 1) -> (K) over bar (k)(d). Finally, we complement the tightness results of our recent paper, Bagchi and Datta (2013) 5], by showing that, for any field F, an F-orientable (k + 1)-neighbourly member of W-k(2k + 1) is F-tight if and only if it is k-stacked.

Differentially private stochastic gradient descent algorithm for multiparty classification

We consider the problem of developing privacy-preserving machine learning algorithms in a dis-tributed multiparty setting. Here different parties own different parts of a data set, and the goal is to learn a classifier from the entire data set with-out any party revealing any information about the individual data points it owns. Pathak et al [7]recently proposed a solution to this problem in which each party learns a local classifier from its own data, and a third party then aggregates these classifiers in a privacy-preserving manner using a cryptographic scheme. The generaliza-tion performance of their algorithm is sensitive to the number of parties and the relative frac-tions of data owned by the different parties. In this paper, we describe a new differentially pri-vate algorithm for the multiparty setting that uses a stochastic gradient descent based procedure to directly optimize the overall multiparty ob-jective rather than combining classifiers learned from optimizing local objectives. The algorithm achieves a slightly weaker form of differential privacy than that of [7], but provides improved generalization guarantees that do not depend on the number of parties or the relative sizes of the individual data sets. Experimental results corrob-orate our theoretical findings.