Novel anti-bacterials against MRSA:Synthesis of focussed combinatorial libraries of tri-substituted 2(5H)-furanones

Mucobromic and mucochloric acid were used as building blocks for the construction of a chemical combinatorial library of 3,4,5-trisubstituted 2(5H)-furanones. With these 2 butenolide building blocks, and eight alcohols a sublibrary of 16 dihalogenated 5-alkoxy-2(5H)-furanones was prepared. This sublibrary of 5-alkoxylated furanones was reacted with 16 amines generating a full size focussed combinatorial library of 256 individual compounds. This three dimensional combinatorial library of 3-halogen-4-amino-5-alkoxy-2(5H)-furanones was prepared around the benzimidazolyl furanone lead structure by applying a solution phase combinatorial chemistry concept. Typical representatives of the library were purified and fully characterized and one x-ray structures was recorded, additionally. The 3-bromo-4-benzimizazolyl-5-methoxy-2(5H)furanone, Br-A-l, showed an MIC of 8 μg/ml against the multiresistant Staphylococcus aureus ( MRSA). © 2006 Bentham Science Publishers Ltd.

Trade marks, registered designs and the monopolisation of functional shapes:a consideration of Lego and Dyson

Legislation: Regulation 6/2002 on Community designs art.3(3)(e) Directive 98/71 on the legal protection of designs art.7(1) Cases: Dyson Ltd v Vax Ltd [2010] EWHC 1923 (Pat); [2011] Bus. L.R. 232 (Ch D (Patents Ct)) Lego Juris A/S v Office for Harmonisation in the Internal Market (Trade Marks and Designs) (OHIM) (C-48/09 P) Unreported September 14, 2010 (ECJ) *E.I.P.R. 60 In Lego, the Court of Justice of the European Union denied registration for an exclusively functional shape mark despite the availability of other shapes capable of fulfilling the same function and in Dyson v Vax Mr Justice Arnold established that a design can not be registered for a purely functional shape even though another shape could fulfil the same required function.

Vector Combinatorial Problems in a Space of Combinations with Linear Fractional Functions of Criteria

The paper considers vector discrete optimization problem with linear fractional functions of criteria on a feasible set that has combinatorial properties of combinations. Structural properties of a feasible solution domain and of Pareto–optimal (efficient), weakly efficient, strictly efficient solution sets are examined. A relation between vector optimization problems on a combinatorial set of combinations and on a continuous feasible set is determined. One possible approach is proposed in order to solve a multicriteria combinatorial problem with linear- fractional functions of criteria on a set of combinations.

New Symmetric (61,16,4) Designs Invariant Under the Dihedral Group of Order 10

∗ This work has been partially supported by the Bulgarian NSF under Contract No. I-506/1995.

Randomized Parallelization – a New Method for Solving Hard Combinatorial Problems

A new method for solving some hard combinatorial optimization problems is suggested, admitting a certain reformulation. Considering such a problem, several different similar problems are prepared which have the same set of solutions. They are solved on computer in parallel until one of them will be solved, and that solution is accepted. Notwithstanding the evident overhead, the whole run-time could be significantly reduced due to dispersion of velocities of combinatorial search in regarded cases. The efficiency of this approach is investigated on the concrete problem of finding short solutions of non-deterministic system of linear logical equations.

Lagrangean Approximation for Combinatorial Inverse Problems

Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.

Recursive Methods for Construction of Balanced N-ary Block Designs

2000 Mathematics Subject Classification: Primary 05B05; secondary 62K10.

Orthogonal Resolutions and Latin Squares

Resolutions which are orthogonal to at least one other resolution (RORs) and sets of m mutually orthogonal resolutions (m-MORs) of 2-(v, k, λ) designs are considered. A dependence of the number of nonisomorphic RORs and m-MORs of multiple designs on the number of inequivalent sets of v/k − 1 mutually orthogonal latin squares (MOLS) of size m is obtained. ACM Computing Classification System (1998): G.2.1.

Representing Equivalence Problems for Combinatorial Objects

Methods for representing equivalence problems of various combinatorial objects as graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension). ACM Computing Classification System (1998): F.2.1, G.4.

Solar stills:a comprehensive review of designs, performance and material advances

The demand for fresh water production is growing day by day with the increase in world population and with industrial growth. Use of desalination technology is increasing to meet this demand. Among desalination technologies, solar stills require low maintenance and are readily affordable; however their productivity is limited. This paper aims to give a detailed review about the various types of solar stills, covering passive and active designs, single- and multi-effect types, and the various modifications for improved productivity including reflectors, heat storage, fins, collectors, condensers, and mechanisms for enhancing heat and mass transfer. Photovoltaic-thermal and greenhouse type solar stills are also covered. Material advances in the area of phase change materials and nanocomposites are very promising to enhance further performance; future research should be carried out in these and other areas for the greater uptake of solar still technology.

A framework for transforming, analyzing, and realizing software designs in unified modeling language

Unified Modeling Language (UML) is the most comprehensive and widely accepted object-oriented modeling language due to its multi-paradigm modeling capabilities and easy to use graphical notations, with strong international organizational support and industrial production quality tool support. However, there is a lack of precise definition of the semantics of individual UML notations as well as the relationships among multiple UML models, which often introduces incomplete and inconsistent problems for software designs in UML, especially for complex systems. Furthermore, there is a lack of methodologies to ensure a correct implementation from a given UML design. The purpose of this investigation is to verify and validate software designs in UML, and to provide dependability assurance for the realization of a UML design.^ In my research, an approach is proposed to transform UML diagrams into a semantic domain, which is a formal component-based framework. The framework I proposed consists of components and interactions through message passing, which are modeled by two-layer algebraic high-level nets and transformation rules respectively. In the transformation approach, class diagrams, state machine diagrams and activity diagrams are transformed into component models, and transformation rules are extracted from interaction diagrams. By applying transformation rules to component models, a (sub)system model of one or more scenarios can be constructed. Various techniques such as model checking, Petri net analysis techniques can be adopted to check if UML designs are complete or consistent. A new component called property parser was developed and merged into the tool SAM Parser, which realize (sub)system models automatically. The property parser generates and weaves runtime monitoring code into system implementations automatically for dependability assurance. The framework in the investigation is creative and flexible since it not only can be explored to verify and validate UML designs, but also provides an approach to build models for various scenarios. As a result of my research, several kinds of previous ignored behavioral inconsistencies can be detected.^

Effective reconfigurable antenna designs to enhance performance and enable wireless powering

With the increase in traffic on the internet, there is a greater demand for wireless mobile and ubiquitous applications. These applications need antennas that are not only broadband, but can also work in different frequency spectrums. Even though there is a greater demand for such applications, it is still imperative to conserve power. Thus, there is a need to design multi-broadband antennas that do not use a lot of power. Reconfigurable antennas can work in different frequency spectrums as well as conserve power. The current designs of reconfigurable antennas work only in one band. There is a need to design reconfigurable antennas that work in different frequency spectrums. In this current era of high power consumption there is also a greater demand for wireless powering. This dissertation explores ideal designs of reconfigurable antennas that can improve performance and enable wireless powering. This dissertation also presents lab results of the multi-broadband reconfigurable antenna that was created. A detailed mathematical analyses, as well as extensive simulation results are also presented. The novel reconfigurable antenna designs can be extended to Multiple Input Multiple Output (MIMO) environments and military applications.^

Effective Reconfigurable Antenna Designs to Enhance Performance and Enable Wireless Powering

With the increase in traffic on the internet, there is a greater demand for wireless mobile and ubiquitous applications. These applications need antennas that are not only broadband, but can also work in different frequency spectrums. Even though there is a greater demand for such applications, it is still imperative to conserve power. Thus, there is a need to design multi-broadband antennas that do not use a lot of power. Reconfigurable antennas can work in different frequency spectrums as well as conserve power. The current designs of reconfigurable antennas work only in one band. There is a need to design reconfigurable antennas that work in different frequency spectrums. In this current era of high power consumption there is also a greater demand for wireless powering. This dissertation explores ideal designs of reconfigurable antennas that can improve performance and enable wireless powering. This dissertation also presents lab results of the multi-broadband reconfigurable antenna that was created. A detailed mathematical analyses, as well as extensive simulation results are also presented. The novel reconfigurable antenna designs can be extended to Multiple Input Multiple Output (MIMO) environments and military applications.

Equitably coloured balanced incomplete block designs

In this thesis we determine necessary and sufficient conditions for the existence of an equitably ℓ-colourable balanced incomplete block design for any positive integer ℓ > 2. In particular, we present a method for constructing non-trivial equitably ℓ-colourable BIBDs and prove that these designs are the only non-trivial equitably ℓ-colourable BIBDs that exist. We also observe that every equitable ℓ-colouring of a BIBD yields both an equalised ℓ-colouring and a proper 2-colouring of the same BIBD. We also discuss generalisations of these concepts including open questions for further research. The main results presented in this thesis also appear in [7].