Relative Compactness for Hyperspaces

The present paper contains results characterizing relatively compact subsets of the space of the closed subsets of a metrizable space, equipped with various hypertopologies. We investigate the hyperspace topologies that admit a representation as weak topologies generated by families of gap functionals defined on closed sets, as well as hit-and-miss topologies and proximal-hit and-miss topologies.

A new family of multi-output DC-DC converter topologies to supply an asymmetrical four-level diode-clamped inverter

Purpose Multi-level diode-clamped inverters have the challenge of capacitor voltage balancing when the number of DC-link capacitors is three or more. On the other hand, asymmetrical DC-link voltage sources have been applied to increase the number of voltage levels without increasing the number of switches. The purpose of this paper is to show that an appropriate multi-output DC-DC converter can resolve the problem of capacitor voltage balancing and utilize the asymmetrical DC-link voltages advantages. Design/methodology/approach A family of multi-output DC-DC converters is presented in this paper. The application of these converters is to convert the output voltage of a photovoltaic (PV) panel to regulate DC-link voltages of an asymmetrical four-level diode-clamped inverter utilized for domestic applications. To verify the versatility of the presented topology, simulations have been directed for different situations and results are presented. Some related experiments have been developed to examine the capabilities of the proposed converters. Findings The three-output voltage-sharing converters presented in this paper have been mathematically analysed and proven to be appropriate to improve the quality of the residential application of PV by means of four-level asymmetrical diode-clamped inverter supplying highly resistive loads. Originality/value This paper shows that an appropriate multi-output DC-DC converter can resolve the problem of capacitor voltage balancing and utilize the asymmetrical DC-link voltages advantages and that there is a possibility of operation at high-modulation index despite reference voltage magnitude and power factor variations.

Photovoltaic DC-DC module integrated converter for novel cascaded and bypass grid connection topologies - design and optimisation

Grid connected photovoltaic (PV) inverters fall into three broad categories - central, string and module integrated converters (MICs). MICs offer many advantages in performance and flexibility, but are at a cost disadvantage. Two alternative novel approaches proposed by the author - cascaded dc-dc MICs and bypass dc-dc MICs - integrate a simple non-isolated intelligent dc-dc converter with each PV module to provide the advantages of dc-ac MICs at a lower cost. A suitable universal 150 W 5 A dc-dc converter design is presented based on two interleaved MOSFET half bridges. Testing shows zero voltage switching (ZVS) keeps losses under 1 W for bi-directional power flows up to 15 W between two adjacent 12 V PV modules for the bypass application, and efficiencies over 94% for most of the operational power range for the cascaded converter application. Based on the experimental results, potential optimizations to further reduce losses are discussed.

Evaluating MPPT converter topologies using a Matlab PV model

An accurate PV module electrical model is presented based on the Shockley diode equation. The simple model has a photo-current current source, a single diode junction and a series resistance, and includes temperature dependences. The method of parameter extraction and model evaluation in Matlab is demonstrated for a typical 60W solar panel. This model is used to investigate the variation of maximum power point with temperature and isolation levels. A comparison of buck versus boost maximum power point tracker (MPPT) topologies is made, and compared with a direct connection to a constant voltage (battery) load. The boost converter is shown to have a slight advantage over the buck, since it can always track the maximum power point.

Evaluating MPPT converter topologies using a MATLAB PV model

An accurate PV module electrical model is presented based on the Shockley diode equation. The simple model has a photo-current current source, a single diode junction and a series resistance, and includes temperature dependences. The method of parameter extraction and model evaluation in Matlab is demonstrated for a typical 60W solar panel. This model is used to investigate the variation of maximumpower point with temperature and insolation levels. A comparison of buck versus boostmaximum power point tracker (MPPT) topologies is made, and compared with a direct connection to a constant voltage (battery) load. The boost converter is shown to have a slight advantage over the buck, since it can always track the maximum power point.

Becoming-topologies of education: Deformations, networks and the database effect

This article uses topological approaches to suggest that education is becoming-topological. Analyses presented in a recent double-issue of Theory, Culture & Society are used to demonstrate the utility of topology for education. In particular, the article explains education's topological character through examining the global convergence of education policy, testing and the discursive ranking of systems, schools and individuals in the promise of reforming education through the proliferation of regimes of testing at local and global levels that constitute a new form of governance through data. In this conceptualisation of global education policy changes in the form and nature of testing combine with it the emergence of global policy network to change the nature of the local (national, regional, school and classroom) forces that operate through the ‘system’. While these forces change, they work through a discursivity that produces disciplinary effects, but in a different way. This new–old disciplinarity, or ‘database effect’, is here represented through a topological approach because of its utility for conceiving education in an increasingly networked world.

Isostructural co-crystals derived from molecules with different supramolecular topologies

In this article, we report the crystal structures of five halogen bonded co-crystals comprising quaternary ammonium cations, halide anions (Cl– and Br–), and one of either 1,2-, 1,3-, or 1,4-diiodotetrafluorobenzene (DITFB). Three of the co-crystals are chemical isomers: 1,4-DITFB[TEA-CH2Cl]Cl, 1,2-DITFB[TEA-CH2Cl]Cl, and 1,3-DITFB[TEA-CH2Cl]Cl (where TEA-CH2Cl is chloromethyltriethylammonium ion). In each structure, the chloride anions link DITFB molecules through halogen bonds to produce 1D chains propagating with (a) linear topology in the structure containing 1,4-DITFB, (b) zigzag topology with 60° angle of propagation in that containing 1,2-DITFB, and (c) 120° angle of propagation with 1,3-DITFB. While the individual chains have highly distinctive and different topologies, they combine through π-stacking of the DITFB molecules to produce remarkably similar overall arrangements of molecules. Structures of 1,4-DITFB[TEA-CH2Br]Br and 1,3-DITFB[TEA-CH2Br]Br are also reported and are isomorphous with their chloro/chloride analogues, further illustrating the robustness of the overall supramolecular architecture. The usual approach to crystal engineering is to make structural changes to molecular components to effect specific changes to the resulting crystal structure. The results reported herein encourage pursuit of a somewhat different approach to crystal engineering. That is, to investigate the possibilities for engineering the same overall arrangement of molecules in crystals while employing molecular components that aggregate with entirely different supramolecular connectivity.

Fluorite and Mixed-Metal Kagome-Related Topologies in Metal-Organic Framework Compounds: Synthesis, Structure, and Properties

Two new three-dimensional metal-organic frameworks (MOFs) [Mn-2(mu(3)-OH)(H2O)(2)(BTC)]-2 H2O, I, and [NaMn(BTC)], II (BTC=1,2,4-benzenetricarboxylate = trimellitate) were synthesized and their structures determined by single-crystal X-ray diffraction (XRD). In I, the Mn-4 cluster, [Mn-4(mu(5)-OH)(2)(H2O)(4)O-12], is connected with eight trimellitate anions and each trimellitate anion connects to four different Mn-4 clusters, resulting in a fluorite-like structure. In II, the Mn2O8 dimer is connected with two Na+ ions through carboxylate oxygen to form mixed-metal distorted Kagome-related two-dimensional -M-O-M- layers, which are pillared by the trimellitate anions forming the three-dimensional structure. The extra-framework water molecules in I are reversibly adsorbed and are also corroborated by powder XRD studies. The formation of octameric water clusters involving free and coordinated water molecules appears to be new. Interesting magnetic behavior has been observed for both compounds. Electron spin resonance (ESR) studies indicate a broadening of the signal below the ordering temperature and appear to support the findings of the magnetic studies.

Multipath Dissemination in Regular Mesh Topologies

Mesh topologies are important for large-scale peer-to-peer systems that use low-power transceivers. The Quality of Service (QoS) in such systems is known to decrease as the scale increases. We present a scalable approach for dissemination that exploits all the shortest paths between a pair of nodes and improves the QoS. Despite th presence of multiple shortest paths in a system, we show that these paths cannot be exploited by spreading the messages over the paths in a simple round-robin manner; nodes along one of these paths will always handle more messages than the nodes along the other paths. We characterize the set of shortest paths between a pair of nodes in regular mesh topologies and derive rules, using this characterization, to effectively spread the messages over all the available paths. These rules ensure that all the nodes that are at the same distance from the source handle roughly the same number of messages. By modeling the multihop propagation in the mesh topology as a multistage queuing network, we present simulation results from a variety of scenarios that include link failures and propagation irregularities to reflect real-world characteristics. Our method achieves improved QoS in all these scenarios.

Time- and Temperature-Dependent Study in the Three-Component Zinc-Triazolate-Oxybis(benzoate) System: Stabilization of New Topologies

Three new three-dimensional zinc-triazolate-oxybis(benzoate) compounds. [{Zn-3(H2O)(2)}{C12H8O(COO)(2)}(2)-{C2H2N3}(2)]center dot 2H(2)O(I), [Zn-7{C12H8O(COO)(2)}(4){C2H2N3}(6)]center dot H2O, (II), and[{Zn-5(OH)(2)}{C12H8O(COO)(2)}(3){C2H2N3}(2)] (III), synthesized by a hydrothermal reaction of a mixture of Zn(OAc)(2)center dot 2H(2)O, 4,4'-oxybis(benzoic acid), 1,2,4-triazole, NaOH, and water. Compound I has an interpenetrated diamond structure and II and III have pillared-layer related structures. The formation of a hydrated phase (I) at low temperature and a completely dehydrated phase (III) at high temperature suggests the importance of thermodynamic factors in the formation of three compounds. Transformation studies of I in the presence of water shows the formation of a simple Zn-OBA compound, [Zn(OBA)(H2O)] (IV), at 150 and 180 degrees C and compound III at 200 degrees C. The compounds have been characterized by single-crystal X-ray diffraction, powder X-ray diffraction. thermogravimetric analysis, IR, and photoluminescence studies.

Efficient Content-based Routing, Mobility-aware Topologies, and Temporal Subspace Matching

Event-based systems are seen as good candidates for supporting distributed applications in dynamic and ubiquitous environments because they support decoupled and asynchronous many-to-many information dissemination. Event systems are widely used, because asynchronous messaging provides a flexible alternative to RPC (Remote Procedure Call). They are typically implemented using an overlay network of routers. A content-based router forwards event messages based on filters that are installed by subscribers and other routers. The filters are organized into a routing table in order to forward incoming events to proper subscribers and neighbouring routers. This thesis addresses the optimization of content-based routing tables organized using the covering relation and presents novel data structures and configurations for improving local and distributed operation. Data structures are needed for organizing filters into a routing table that supports efficient matching and runtime operation. We present novel results on dynamic filter merging and the integration of filter merging with content-based routing tables. In addition, the thesis examines the cost of client mobility using different protocols and routing topologies. We also present a new matching technique called temporal subspace matching. The technique combines two new features. The first feature, temporal operation, supports notifications, or content profiles, that persist in time. The second feature, subspace matching, allows more expressive semantics, because notifications may contain intervals and be defined as subspaces of the content space. We also present an application of temporal subspace matching pertaining to metadata-based continuous collection and object tracking.

Design of logical topologies for wavelength-routed optical networks

his paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.

Forming Networks of Strategic Agents with Desired Topologies

Many networks such as social networks and organizational networks in global companies consist of self-interested agents. The topology of these networks often plays a crucial role in important tasks such as information diffusion and information extraction. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a stable network having that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation and a utility model that captures many key features. Based on this model, we analyze relevant network topologies and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks, wherein no node wants to delete any of its links and no two nodes would want to create a link between them.