A Note on the Expressiveness of BIP

We extend our previous algebraic formalisation of the notion of component-based framework in order to formally define two forms, strong and weak, of the notion of full expressiveness. Our earlier result shows that the BIP (Behaviour-Interaction-Priority) framework does not possess the strong full expressiveness. In this paper, we show that BIP has the weak form of this notion and provide results detailing weak and strong full expressiveness for classical BIP and several modifications, obtained by relaxing the constraints imposed on priority models.Comment: In Proceedings EXPRESS/SOS 2016, arXiv:1608.0269

Joint Multi-Cell Resource Allocation Using Pure Binary-Integer Programming for LTE Uplink

Due to high system capacity requirement, 3GPP Long Term Evolution (LTE) is likely to adopt frequency reuse factor 1 at the cost of suffering severe inter-cell interference (ICI). One of combating ICI strategies is network cooperation of resource allocation (RA). For LTE uplink RA, requiring all the subcarriers to be allocated adjacently complicates the RA problem greatly. This paper investigates the joint multi-cell RA problem for LTE uplink. We model the uplink RA and ICI mitigation problem using pure binary-integer programming (BIP), with integrative consideration of all users' channel state information (CSI). The advantage of the pure BIP model is that it can be solved by branch-and-bound search (BBS) algorithm or other BIP solving algorithms, rather than resorting to exhaustive search. The system-level simulation results show that it yields 14.83% and 22.13% gains over single-cell optimal RA in average spectrum efficiency and 5th percentile of user throughput, respectively.Comment: Accepted to IEEE Vehicular Technology Conference (VTC Spring), Seoul, Korea, May, 201

Relating BIP and Reo

Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic models. We show that these transformations preserve all properties expressible in a common semantics. This formal relation comprises the basis for a solid comparison and consolidation of the fundamental coordination concepts behind these two languages. Moreover, this basis offers translations that enable users of either language to benefit from the toolchains of the other.Comment: In Proceedings ICE 2015, arXiv:1508.0459

Extended Connectors: Structuring Glue Operators in BIP

Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.Comment: In Proceedings ICE 2013, arXiv:1310.401

Symbolic Implementation of Connectors in BIP

BIP is a component framework for constructing systems by superposing three layers of modeling: Behavior, Interaction, and Priority. Behavior is represented by labeled transition systems communicating through ports. Interactions are sets of ports. A synchronization between components is possible through the interactions specified by a set of connectors. When several interactions are possible, priorities allow to restrict the non-determinism by choosing an interaction, which is maximal according to some given strict partial order. The BIP component framework has been implemented in a language and a tool-set. The execution of a BIP program is driven by a dedicated engine, which has access to the set of connectors and priority model of the program. A key performance issue is the computation of the set of possible interactions of the BIP program from a given state. Currently, the choice of the interaction to be executed involves a costly exploration of enumerative representations for connectors. This leads to a considerable overhead in execution times. In this paper, we propose a symbolic implementation of the execution model of BIP, which drastically reduces this overhead. The symbolic implementation is based on computing boolean representation for components, connectors, and priorities with an existing BDD package

Improved catalytic activity of ruthenium–arene complexes in the reduction of NAD+

A series of neutral Ru-II half-sandwich complexes of the type [(eta(6)-arene)Ru(N,N')Cl] where the arene is para-cymene (p-cym), hexamethylbenzene (hmb), biphenyl (bip), or benzene (bn) and N,N' is N-(2-aminoethyl) -4-(trifluoromethyl)benzenesulfonamide (TfEn), N-(2-aminoethyl)-4-toluenesulfonamide (TsEn), or N-(2-aminoethyl)-methylenesulfonamide (MsEn) were synthesized and characterized. X-ray crystal structures of [(p-cym)Ru(MsEn)Cl] (1), [(hmb)Ru(TsEn)Cl] (5), [(hmb)Ru(TfEn)Cl] (6), [(bip)Ru(MsEn)Cl] (7), and [(bip)Ru(TsEn)Cl] (8) have been determined. The complexes can regioselectively catalyze the transfer hydrogenation of NAD(+) to give 1,4-NADH in the presence of formate. The turnover frequencies (TOF) when the arene is varied decrease in the order bn > bip > p-cym > hmb for complexes with the same N,N' chelating ligand. The TOF decreased with variation in the N,N' chelating ligand in the order TfEn > TsEn > MsEn for a given arene. [(bn)Ru(TfEn)Cl] (12) was the most active, with a TOP of 10.4 h(-1). The effects of NAD(+) and formate concentration on the reaction rates were determined for [(p-cym)Ru(TsEn)Cl] (2). Isotope studies implicated the formation of [(arene)Ru(N,N')(H)] as the rate-limiting step. The coordination of formate and subsequent CO2 elimination to generate the hydride were modeled computationally by density functional theory (DFT). CO2 elimination occurs via a two-step process with the coordinated formate first twisting to present its hydrogen toward the metal center. The computed barriers for CO2 release for arene = benzene follow the order MsEn > TsEn > TfEn, and for the Ms En system the barrier followed bn < hmb, both consistent with the observed rates. The effect of methanol on transfer hydrogenation rates in aqueous solution was investigated. A study of pH dependence of the reaction in D2O gave the optimum pH* as 7.2 with a TOF of 1.58 h(-1) for 2. The series of compounds reported here show an improvement in the catalytic activity by an order of magnitude compared to the ethylenediamine analogues