Information Sharing in Banking: A Collusive Device?

We show that information sharing among banks may serve as a collusive device. An informational sharing agreement is an a-priori commitment to reduce informational asymmetries between banks in future lending. Hence, information sharing tends to increase the intensity of competition in future periods and, thus, reduces the value of informational rents in current competition. We contribute to the existing literature by emphasizing that a reduction in informational rents will also reduce the intensity of competition in the current period, thereby reducing competitive pressure in current credit markets. We provide a large class of economic environments, where a ban on information sharing would be strictly welfare-enhancing.

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.

Decentralized Parallel Operation of Inverters Sharing Unbalanced and Nonlinear Loads

In this paper, a wireless control strategy for parallel operation of three-phase four-wire inverters is proposed. A generalized situation is considered where the inverters are of unequal power ratings and the loads are nonlinear and unbalanced in nature. The proposed control algorithm exploits the potential of sinusoidal domain proportional+multiresonant controller ( in the inner voltage regulation loop) to make the system suitable for nonlinear and unbalanced loads with a simple and generalized structure of virtual output-impedance loop. The decentralized operation is achieved by using three-phase P/Q droop characteristics. The overall control algorithm helps to limit the harmonic contents and the degree of unbalance in the output-voltage waveform and to achieve excellent power-sharing accuracy in spite of mismatch in the inverter output impedances. Moreover, a synchronized turn on with consequent change over to the droop mode is applied for the new incoming unit in order to limit the circulating current completely. The simulation and experimental results from-1 kVA and -0.5 kVA paralleled units validate the effectiveness of the scheme.

META-NORD: Towards Sharing of Language Resources in Nordic and Baltic Countries

This paper introduces the META-NORD project which develops Nordic and Baltic part of the European open language resource infrastructure. META-NORD works on assembling, linking across languages, and making widely available the basic language resources used by developers, professionals and researchers to build specific products and applications. The goals of the project, overall approach and specific focus lines on wordnets, terminology resources and treebanks are described. Moreover, results achieved in first five months of the project, i.e. language whitepapers, metadata specification and IPR, are presented.

Edge-sharing bioctahedral diruthenium(III) complexes containing methoxy and carboxylate bridges:x-ray structures, redox behavior, and core stability

Edge-sharing bioctahedral (ESBO) complexes [Ru-2(OMe)(O2CC6H4-p-X)3(1-MeIm)(4)](ClO4)2 (X = OMe (1a), Me (1b)) and [Ru-2(O2CC6H4-P-X)(4)(1-MeIm)(4)](ClO4)(2) (X = OMe (2a), Me (2b)) are prepared by reacting Ru2Cl(O(2)CR)(4) with 1-methylimidazole (1-MeIm) in methanol followed by treatment with NaClO4. Complex 2a and the PF6- salt (1a') of 1a have been structurally characterized. Crystal data for 1a.1.5MeCN. 0.5Et(2)O: triclinic, P (1) over bar, a = 13.125(2) Angstrom, b = 15.529(3) Angstrom, c 17.314(5) Angstrom, a; 67.03(2)degrees, beta 68.05(2)degrees, gamma = 81.38(1)degrees, V 3014(1) Angstrom(3), Z = 2. Crystal data for 2a: triclinic, P (1) over bar, a 8.950(1) Angstrom, b = 12.089(3) Angstrom, c = 13.735(3) Angstrom, alpha 81.09(2)degrees, beta = 72.27(1)degrees, gamma = 83.15(2)degrees, V = 1394(1) Angstrom(3), Z = 1. The complexes consist of a diruthenium(III) unit held by two monoatomic and two three-atom bridging ligands. The 1-MeIm ligands are at the terminal sites of the [Ru-2(mu-L)(eta(1):mu-O(2)CR)(eta(1):eta(1):mu-O(2)CR)(2)](2+) core having a Ru-Ru single bond (L = OMe or eta(1)-O(2)CR). The Ru-Ru distance and the Ru-O-Ru angle in the core of 1a' and 2a are 2.49 Angstrom and similar to 76 degrees. The complexes undergo one-electron oxidation and reduction processes in MeCN-0.1 M TBAP to form mixed-valence diruthenium species with Ru-Ru bonds of orders 1.5 and 0.5, respectively.

Lazy structure sharing for query optimization

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Cooperative Profit Sharing in Coalition-Based Resource Allocation in Wireless Networks

We consider a network in which several service providers offer wireless access to their respective subscribed customers through potentially multihop routes. If providers cooperate by jointly deploying and pooling their resources, such as spectrum and infrastructure (e.g., base stations) and agree to serve each others' customers, their aggregate payoffs, and individual shares, may substantially increase through opportunistic utilization of resources. The potential of such cooperation can, however, be realized only if each provider intelligently determines with whom it would cooperate, when it would cooperate, and how it would deploy and share its resources during such cooperation. Also, developing a rational basis for sharing the aggregate payoffs is imperative for the stability of the coalitions. We model such cooperation using the theory of transferable payoff coalitional games. We show that the optimum cooperation strategy, which involves the acquisition, deployment, and allocation of the channels and base stations (to customers), can be computed as the solution of a concave or an integer optimization. We next show that the grand coalition is stable in many different settings, i.e., if all providers cooperate, there is always an operating point that maximizes the providers' aggregate payoff, while offering each a share that removes any incentive to split from the coalition. The optimal cooperation strategy and the stabilizing payoff shares can be obtained in polynomial time by respectively solving the primals and the duals of the above optimizations, using distributed computations and limited exchange of confidential information among the providers. Numerical evaluations reveal that cooperation substantially enhances individual providers' payoffs under the optimal cooperation strategy and several different payoff sharing rules.

Mutual inhibition and capacity sharing during parallel preparation of serial eye movements

Many common activities, like reading, scanning scenes, or searching for an inconspicuous item in a cluttered environment, entail serial movements of the eyes that shift the gaze from one object to another. Previous studies have shown that the primate brain is capable of programming sequential saccadic eye movements in parallel. Given that the onset of saccades directed to a target are unpredictable in individual trials, what prevents a saccade during parallel programming from being executed in the direction of the second target before execution of another saccade in the direction of the first target remains unclear. Using a computational model, here we demonstrate that sequential saccades inhibit each other and share the brain's limited processing resources (capacity) so that the planning of a saccade in the direction of the first target always finishes first. In this framework, the latency of a saccade increases linearly with the fraction of capacity allocated to the other saccade in the sequence, and exponentially with the duration of capacity sharing. Our study establishes a link between the dual-task paradigm and the ramp-to-threshold model of response time to identify a physiologically viable mechanism that preserves the serial order of saccades without compromising the speed of performance.

Sensitivity enhancement in slice-selective NMR experiments through polarization sharing

The polarization sharing technique is utilized in gradient based slice selective experiments to transfer polarization from unutilized protons to selectively excited protons. This facilitates rapid data acquisition without any customary inter-scan relaxation delay, resulting in an average of 2-fold sensitivity enhancement per unit time.