Approximate VB-MO schemes for excitation gaps in Hubbard models

The excitation gaps in the singlet and triplet manifolds for finite Hubbard models in one, two and three dimensions have been obtained using different approximate configuration interaction (CI) schemes, as a function of the correlation strength, by using valence bond (VB) functions constructed over the molecular orbital (MO) basis. These are compared with numerically exact results and it is found that the scheme in which all particle hole excitations below a given threshold are included is the method of choice. The excitation energies are well reproduced, in trend as well as magnitude, particularly when the threshold equals the bandwidth of the corresponding noninteracting system.

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.

PVU and wave-particle splitting schemes for Euler equations of gas dynamics

A new way of flux-splitting, termed as the wave-particle splitting is presented for developing upwind methods for solving Euler equations of gas dynamics. Based on this splitting, two new upwind methods termed as Acoustic Flux Vector Splitting (AFVS) and Acoustic Flux Difference Splitting (AFDS) methods are developed. A new Boltzmann scheme, which closely resembles the wave-particle splitting, is developed using the kinetic theory of gases. This method, termed as Peculiar Velocity based Upwind (PVU) method, uses the concept of peculiar velocity for upwinding. A special feature of all these methods that the unidirectional and multidirectional parts of the flux vector are treated separately. Extensive computations done using these schemes demonstrate the soundness of the ideas.

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.

On approximately universal schemes for two-hop networks

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

Variable-speed wind power generation using doubly fed wound rotor induction machine - A comparison with alternative schemes

In this paper, a wind energy conversion system (WECS) using grid-connected wound rotor induction machine controlled from the rotor side is compared with both fixed speed and variable speed systems using cage rotor induction machine. The comparison is done on the basis of (I) major hardware components required, (II) operating region, and (III) energy output due to a defined wind function using the characteristics of a practical wind turbine. Although a fixed speed system is more simple and reliable, it severely limits the energy output of a wind turbine. In case of variable speed systems, comparison shows that using a wound rotor induction machine of similar rating can significantly enhance energy capture. This comes about due to the ability to operate with rated torque even at supersynchronous speeds; power is then generated out of the rotor as well as the stator. Moreover, with rotor side control, the voltage rating of the power devices and dc bus capacitor bank is reduced. The size of the line side inductor also decreasesd. Results are presented to show the substantial advantages of the doubly fed system.

Analysis of link-layer backoff schemes on point-to-point Markov fading links

Backoff algorithms are typically employed in multiple-access networks (e.g., Ethernet) to recover from packet collisions. In this letter, we propose and carry out the analysis for three types of link-layer backoff schemes, namely, linear backoff, exponential backoff, and geometric backoff, on point-to-point wireless fading links where packet errors occur nonindependently. In such a scenario, the backoff schemes are shown to achieve better energy efficiency without compromising much on the link layer throughput performance.

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