This is a survey of topological, group theoretical and some graph theoretical aspects of ends. After discussing the notion of ends in topology, we consider ends of graphs and show that the metric end topology of connected graphs is metrizable. The “1–2–Cantor theorem” is proved for graphs whose ends are all limit ends, that is, ends which are accumulation points of an orbit of the group of auto...

A step-impedance bandpass filter is presented for multimode wireless LANs. The filter has a new dual-band feature of two tunable passbands at desired frequencies and high out-of-band suppression, generated by incorporating step-impedance resonators in a comb-filter topology. It saves more than half the circuit size compared with the switch-type dual-band topology. The simulation and measurement...

A significant part of the Internet traffic today is generated by peer-to-peer (P2P) applications used originally for file sharing, and more recently for real-time communications and live media streaming. Such applications discover a route to each other through an overlay network with little knowledge of the underlying network topology. As a result, they may choose peers based on information ded...

In this article, the performance of a hybrid artificial neural network (i.e. scale-free and small-world) was analyzed and its learning curve compared to three other topologies: random, scale-free and small-world, as well as to the chemotaxis neural network of the nematode Caenorhabditis Elegans. One hundred equivalent networks (same number of vertices and average degree) for each topology were ...

The present work analyses a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple messages, is generated by interactions during the agent's walk and manifest itself in the collapse of the various opinions into a single one. We analyze how the topol...

This paper presents an algorithm for imprinting and merging adjacent parts. Imprint and merge is often used to facilitate generation of conformal meshes between adjacent parts. The algorithm tolerantly intersects the discretized boundary edges of adjacent faces to calculate the imprint Boolean. An input tolerance is used during the process to minimize the effect imprinting has on the meshing pr...

3D mesh morphing based on a metamesh has fundamental limitations of complicated in-between meshes and no topology (connectivity) changes in a metamorphosis. This paper presents a novel approach for 3D mesh morphing, which is not based on a metamesh. The approach simultaneously interpolates the topology and geometry of input meshes. In our approach, an in-between mesh contains only the vertices ...

The prediction of the correct β-sheet topology for pure β and mixed α/β proteins is a critical intermediate step toward the three dimensional protein structure prediction. The predicted beta sheet topology provides distance constraints between sequentially separated residues, which reduces the three dimensional search space for a protein structure prediction algorithm. Here, we present a novel ...