New Structural Topologies in a Series of 3d Metal Complexes with Isomeric Phenylenediacetates and 1,3,5-Tris(1-imidazolyl)benzene Ligand: Syntheses, Structures, and Magnetic and Luminescence Properties

In this article we present the syntheses, characterizations, magnetic and luminescence properties of five 3d-metal complexes, Co(tib)(1,2-phda)](n)center dot(H2O)(n) (1), Co-3(tib)(2)(1,3-phda)(3)(H2O)](n)center dot(H2O)(2n) (2), Co-5(tib)(3)(1,4-phda)(5)(H2O)(3)](n)center dot(H2O)(7n) (3), Zn-3(tib)(2)(1,3-phda)(3)](n)center dot(H2O)(4n) (4), and Mn(tib)(2)(H2O)(2)](n)center dot(1,4-phdaH)(2n)center dot(H2O)(4n) (5), obtained from the use of isomeric phenylenediacetates (phda) and the neutral 1,3,5-tris(1-imidazolyl)benzene (tib) ligand. Single crystal X-ray structures showed that 1 constitutes 3,5-connected 2-nodal nets with a double-layered two-dimensional (2D) structure, while 2 forms an interpenetrated 2D network (3,4-connected 3-nodal net). Complex 3 has a complicated three-dimensional structure with 10-nodal 3,4,5-connected nets. Complex 4, although it resembles 2 in stoichiometry and basic building structures, forms a very different overall 2D assembly. In complex 5 the dicarboxylic acid, upon losing only one of the acidic protons, does not take part in coordination; instead it forms a complicated hydrogen bonding network with water molecules. Magnetic susceptibility measurements over a wide range of temperatures revealed that the metal ions exchange very poorly through the tib ligand, but for the Co(II) complexes the effects of nonquenched orbital contributions are prominent. The 3d(10) metal complex 4 showed strong luminescence with lambda(max) = 415 nm (lambda(ex) = 360 nm).

Stepwise Crystallization: Illustrative Examples of the Use of Metalloligands Cu-6(mna)(6)](6-) and (Ag-6(Hmna)(2)(mna)(4)](4-) (H(2)mna=2-Mercapto Nicotinic Acid) in the Formation of Heterometallic Two- and Three-Dimensional Assemblies with brucite, pcu, and sql Topologies

Three new inorganic coordination polymers, {Mn(H2O)(6)]-Mn-2(H2O)(6)](Cu-6(mna)(6)]center dot 6H(2)O}, 1, {Mn-4(OH)(2)(H2O)(10)] (Cu-6(mna)6]center dot 8H(2)O}, 2, and {Mn-2(H2O)(5)]Ag-6(Hmna)(2)(mna)(4)]center dot 20H(2)O}, 3, have been synthesized at room temperature through a sequential crystallization route. In addition, we have also prepared and characterized the molecular precursor Cu-6(Hmna)(6)]. Compounds 1 and 3 have a two-dimensional structure, whereas 2 has a three-dimensional structure. The formation of 2 has been achieved by minor modification in the synthetic composition, suggesting the subtle relationship between the reactant composition and the structure. The hexanudear copper and silver duster cores have Cu center dot center dot center dot Cu and Ag center dot center dot center dot Ag distances close to the sum of the van der Waals radii of Cu1+ and Ag1+, respectively. The connectivity between Cu-6(mna)(6)](6-) cluster units and Mn2+ ions gives rise to a brucite related layer in 1 and a pcu-net in 2. The Ag-6(Hmna)(2)(mna)(4)](4-) cluster in 3, on the other hand, forms a sql-net with Mn2+. Compound 1 exhibits an interesting and reversible hydrochromic behavior, changing from pale yellow to red, on heating at 70 degrees C or treatment under a vacuum. Electron paramagnetic resonance studies indicate no change in the valence states, suggesting the color change could be due to changes in the coordination environment only. The magnetic studies indicate weak antiferromagnetic behavior. Proton conductivity studies indicate moderate proton migrations in 1 and 3. The present study dearly establishes sequential crystallization as an important pathway for the synthesis of heterometallic coordination polymers.

Multimode polymer waveguide components for complex on-board optical topologies

Multimode polymer waveguides are an attractive transmission medium for board-level optical links as they provide high bandwidth, relaxed alignment tolerances, and can be directly integrated onto conventional printed circuit boards. However, the performance of multimode waveguide components depends on the launch conditions at the component input, complicating their use in topologies that require the concatenation of multiple multimode components. This paper presents key polymer components for a multichannel optical bus and reports their performance under different launch conditions, enabling useful rules that can be used to design complex interconnection topologies to be derived. The components studied are multimode signal splitters and combiners, 90°-crossings, S-bends, and 90°-bends. By varying the width of the splitter arms, a splitting ratio between 1% and 95% is achieved from the 1 × 2 splitters, while low-loss signal combining is demonstrated with the waveguide combiners. It is shown that a 3 dB improvement in the combiner excess loss can be achieved by increasing the bus width by 50 μm. The worst-case insertion loss of 50 × 100 μm waveguide crossings is measured to be 0.1 dB/crossing. An empirical method is proposed and used to estimate the insertion losses of on-board optical paths of a polymeric four-channel optical bus module. Good agreement is achieved between the predicted and measured values. Although the components and empirical method have been tailored for use in a multichannel optical bus architecture, they can be used for any on-board optical interconnection topology. © 1983-2012 IEEE.

Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies

Current research on Internet-based distributed systems emphasizes the scalability of overlay topologies for efficient search and retrieval of data items, as well as routing amongst peers. However, most existing approaches fail to address the transport of data across these logical networks in accordance with quality of service (QoS) constraints. Consequently, this paper investigates the use of scalable overlay topologies for routing real-time media streams between publishers and potentially many thousands of subscribers. Specifically, we analyze the costs of using k-ary n-cubes for QoS-constrained routing. Given a number of nodes in a distributed system, we calculate the optimal k-ary n-cube structure for minimizing the average distance between any pair of nodes. Using this structure, we describe a greedy algorithm that selects paths between nodes in accordance with the real-time delays along physical links. We show this method improves the routing latencies by as much as 67%, compared to approaches that do not consider physical link costs. We are in the process of developing a method for adaptive node placement in the overlay topology, based upon the locations of publishers, subscribers, physical link costs and per-subscriber QoS constraints. One such method for repositioning nodes in logical space is discussed, to improve the likelihood of meeting service requirements on data routed between publishers and subscribers. Future work will evaluate the benefits of such techniques more thoroughly.

Inference and Labeling of Metric-Induced Network Topologies

The development and deployment of distributed network-aware applications and services over the Internet require the ability to compile and maintain a model of the underlying network resources with respect to (one or more) characteristic properties of interest. To be manageable, such models must be compact, and must enable a representation of properties along temporal, spatial, and measurement resolution dimensions. In this paper, we propose a general framework for the construction of such metric-induced models using end-to-end measurements. We instantiate our approach using one such property, packet loss rates, and present an analytical framework for the characterization of Internet loss topologies. From the perspective of a server the loss topology is a logical tree rooted at the server with clients at its leaves, in which edges represent lossy paths between a pair of internal network nodes. We show how end-to-end unicast packet probing techniques could b e used to (1) infer a loss topology and (2) identify the loss rates of links in an existing loss topology. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. We report on simulation, implementation, and Internet deployment results that show the effectiveness of our approach and its robustness in terms of its accuracy and convergence over a wide range of network conditions.

Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast

Recent work has shown the prevalence of small-world phenomena [28] in many networks. Small-world graphs exhibit a high degree of clustering, yet have typically short path lengths between arbitrary vertices. Internet AS-level graphs have been shown to exhibit small-world behaviors [9]. In this paper, we show that both Internet AS-level and router-level graphs exhibit small-world behavior. We attribute such behavior to two possible causes–namely the high variability of vertex degree distributions (which were found to follow approximately a power law [15]) and the preference of vertices to have local connections. We show that both factors contribute with different relative degrees to the small-world behavior of AS-level and router-level topologies. Our findings underscore the inefficacy of the Barabasi-Albert model [6] in explaining the growth process of the Internet, and provide a basis for more promising approaches to the development of Internet topology generators. We present such a generator and show the resemblance of the synthetic graphs it generates to real Internet AS-level and router-level graphs. Using these graphs, we have examined how small-world behaviors affect the scalability of end-system multicast. Our findings indicate that lower variability of vertex degree and stronger preference for local connectivity in small-world graphs results in slower network neighborhood expansion, and in longer average path length between two arbitrary vertices, which in turn results in better scaling of end system multicast.

On the Origin of Power Laws in Internet Topologies

Recent empirical studies have shown that Internet topologies exhibit power laws of the form for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs y = x^α within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely diameter, average path length and clustering coefficient. Different kinds of network topologies are generated: (T1) topologies generated using our parametrized generator, we call BRITE; (T2) random topologies generated using the well-known Waxman model; (T3) Transit-Stub topologies generated using GT-ITM tool; and (T4) regular grid topologies. We observe that some generated topologies may not obey power laws P1 and P2. Thus, the existence of these power laws can be used to validate the accuracy of a given tool in generating representative Internet topologies. Power laws P3 and P4 were observed in nearly all considered topologies, but different topologies showed different values of the power exponent α. Thus, while the presence of power laws P3 and P4 do not give strong evidence for the representativeness of a generated topology, the value of α in P3 and P4 can be used as a litmus test for the representativeness of a generated topology. We also find that factors F1 and F2 are the key contributors in our study which provide the resemblance of our generated topologies to that of the Internet.

Unicast-based Characterization of Network Loss Topologies

Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When a number of such connections share a common endpoint, that endpoint has the opportunity to correlate these end-to-end measurements to better diagnose and control the use of shared resources. A valuable characterization of such shared resources is the "loss topology". From the perspective of a server with concurrent connections to multiple clients, the loss topology is a logical tree rooted at the server in which edges represent lossy paths between a pair of internal network nodes. We develop an end-to-end unicast packet probing technique and an associated analytical framework to: (1) infer loss topologies, (2) identify loss rates of links in an existing loss topology, and (3) augment a topology to incorporate the arrival of a new connection. Correct, efficient inference of loss topology information enables new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that our approach is robust in terms of its accuracy and convergence over a wide range of network conditions.

Resonant power conversion topologies for inductive charging of electrical vehicle batteries

This thesis is concerned with inductive charging of electric vehicle batteries. Rectified power form the 50/60 Hz utility feeds a dc-ac converter which delivers high-frequency ac power to the electric vehicle inductive coupling inlet. The inlet configuration has been defined by the Society of Automotive Engineers in Recommended Practice J-1773. This thesis studies converter topologies related to the series resonant converter. When coupled to the vehicle inlet, the frequency-controlled series-resonant converter results in a capacitively-filtered series-parallel LCLC (SP-LCLC) resonant converter topology with zero voltage switching and many other desirable features. A novel time-domain transformation analysis, termed Modal Analysis, is developed, using a state variable transformation, to analyze and characterize this multi-resonant fourth-orderconverter. Next, Fundamental Mode Approximation (FMA) Analysis, based on a voltage-source model of the load, and its novel extension, Rectifier-Compensated FMA (RCFMA) Analysis, are developed and applied to the SP-LCLC converter. The RCFMA Analysis is a simpler and more intuitive analysis than the Modal Analysis, and provides a relatively accurate closed-form solution for the converter behavior. Phase control of the SP-LCLC converter is investigated as a control option. FMA and RCFMA Analyses are used for detailed characterization. The analyses identify areas of operation, which are also validated experimentally, where it is advantageous to phase control the converter. A novel hybrid control scheme is proposed which integrates frequency and phase control and achieves reduced operating frequency range and improved partial-load efficiency. The phase-controlled SP-LCLC converter can also be configured with a parallel load and is an excellent option for the application. The resulting topology implements soft-switching over the entire load range and has high full-load and partial-load efficiencies. RCFMA Analysis is used to analyze and characterize the new converter topology, and good correlation is shown with experimental results. Finally, a novel single-stage power-factor-corrected ac-dc converter is introduced, which uses the current-source characteristic of the SP-LCLC topology to provide power factor correction over a wide output power range from zero to full load. This converter exhibits all the advantageous characteristics of its dc-dc counterpart, with a reduced parts count and cost. Simulation and experimental results verify the operation of the new converter.