@conference {17442,
	title = {TreeVersity: Comparing tree structures by topology and node{\textquoteright}s attributes differences},
	booktitle = {2011 IEEE Conference on Visual Analytics Science and Technology (VAST)},
	year = {2011},
	month = {2011/10/23/28},
	pages = {275 - 276},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {It is common to classify data in hierarchies, they provide a comprehensible way of understanding big amounts of data. From budgets to organizational charts or even the stock market, trees are everywhere and people find them easy to use. However when analysts need to compare two versions of the same tree structure, or two related taxonomies, the task is not so easy. Much work has been done on this topic, but almost all of it has been restricted to either compare the trees by topology, or by the node attribute values. With this project we are proposing TreeVersity, a framework for comparing tree structures, both by structural changes and by differences in the node attributes. This paper is based on our previous work on comparing traffic agencies using LifeFlow [1, 2] and on a first prototype of TreeVersity.},
	keywords = {Computer science, data classification, Data visualization, Educational institutions, hierarchy, Image color analysis, LifeFlow, node attributes differences, Pattern classification, structural changes, Topology, topology attributes differences, traffic agencies, tree structures comparison, trees (mathematics), TreeVersity, Vegetation, Visualization},
	isbn = {978-1-4673-0015-5},
	doi = {10.1109/VAST.2011.6102471},
	author = {Gomez,J.A.G. and Buck-Coleman,A. and Plaisant, Catherine and Shneiderman, Ben}
}
@conference {19285,
	title = {Scalable representation of dataflow graph structures using topological patterns},
	booktitle = {2010 IEEE Workshop on Signal Processing Systems (SIPS)},
	year = {2010},
	month = {2010},
	pages = {13 - 18},
	abstract = {Tools for designing signal processing systems with their semantic foundation in dataflow modeling often use high-level graphical user interface (GUI) or text based languages that allow specifying applications as directed graphs. Such graphical representations serve as an initial reference point for further analysis and optimizations that lead to platform-specific implementations. For large-scale applications, the underlying graphs often consist of smaller substructures that repeat multiple times. To enable more concise representation and direct analysis of such substructures in the context of high level DSP specification languages and design tools, we develop the modeling concept of topological patterns, and propose ways for supporting this concept in a high-level language. We augment the DIF language - a language for specifying DSP-oriented dataflow graphs - with constructs for supporting topological patterns, and we show how topological patterns can be effective in various aspects of embedded signal processing design flows using specific application examples.},
	keywords = {arrays, data flow graphs, Dataflow graphs, DIF language, Digital signal processing, directed graphs, DSP specification languages, embedded signal processing design flows, embedded systems, Field programmable gate arrays, graphical user interface, Graphical user interfaces, High-level languages, modelbased design, optimisation, optimizations, scalable dataflow graph structures representation, semantics, Signal processing, Signal processing systems, Specification languages, text based languages, Topological patterns, Topology, Transform coding},
	author = {Sane, N. and Kee, Hojin and Seetharaman, G. and Bhattacharyya, Shuvra S.}
}
@conference {15684,
	title = {Dynamic load balancing across mirrored multimedia servers},
	booktitle = {2003 International Conference on Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings},
	volume = {2},
	year = {2003},
	month = {2003/07/06/9},
	pages = {II- 53-6 vol.2 - II- 53-6 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The purpose of this paper is to present protocols for efficient load balancing across replicated multimedia servers in a metropolitan area network. Current multimedia infrastructures, even when they use mirrored servers, do not have standardized load balancing schemes. Existing schemes frequently require participation from the clients in balancing the load across the servers efficiently. We propose two protocols in this paper for fair load balancing without any client-side processing being required. Neither protocol requires any change to the network-level infrastructure. Using network packet loss and packet transmission delay as the chief metrics, we show the effectiveness of the protocols through extensive simulations.},
	keywords = {client-server systems, Delay, Internet, load balancing protocols, Load management, media streaming, metropolitan area network, metropolitan area networks, mirrored multimedia servers, Multimedia communication, multimedia servers, network packet loss, Network servers, packet transmission delay, Propagation losses, Protocols, Streaming media, Topology, Traffic control, Web server},
	isbn = {0-7803-7965-9},
	doi = {10.1109/ICME.2003.1221551},
	author = {Matthur,A. and Mundur, Padma}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {13272,
	title = {A Smale-like decomposition for discrete scalar fields},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {1},
	year = {2002},
	month = {2002///},
	pages = {184 - 187 vol.1 - 184 - 187 vol.1},
	abstract = {In this paper we address the problem of representing the structure of the topology of a d-dimensional scalar field as a basis for constructing a multiresolution representation of the structure of such afield. To this aim, we define a discrete decomposition of a triangulated d-dimensional domain, on whose vertices the values of the field are given. We extend a Smale decomposition, defined by Thom (1949) and Smale (1960) for differentiable functions, to the discrete case, to what we call a Smale-like decomposition. We introduce the notion of discrete gradient vector field, which indicates the growth of the scalar field and matches with our decomposition. We sketch an algorithm for building a Smale-like decomposition and a graph-based representation of this decomposition. We present results for the case of two-dimensional fields.},
	keywords = {data, decomposition;, differentiable, discrete, domain;, field;, fields;, functions;, gradient, graph-based, methods;, multidimensional, multiresolution, representation;, scalar, Smale-like, structure, Topology, triangulated, vector, visualisation;},
	doi = {10.1109/ICPR.2002.1044644},
	author = {De Floriani, Leila and Mesmoudi,M. M. and Danovaro,E.}
}
@article {18852,
	title = {Integrated Microelectromechanical System (MEMS) Inertial Measurement Unit (IMIMU)},
	year = {2001},
	month = {2001/12//},
	institution = {CARNEGIE-MELLON UNIVERSITY},
	abstract = {Processes, designs and design tools are developed to enable the monolithic integration of arrays of inertial microsensors with electronics. Accelerometers and gyroscopes, fabricated in a single CMOS process, are functional and demonstrate a single chip IMU. Two integrated post CMOS micro-machining processes are demonstrated. Thin-film microstructures are defined from the metal-dielectric stack of a conventional process. In the second process, a back-side silicon etch, followed by front-side DRIE produces bulk silicon microstructures. Accelerometer and gyroscope designs are developed with accompanying low noise electronic circuitry. Noise performance was limited to 1/f circuit noise. The chip output sensibility is set by the interface circuit design. A thermally stabilized accelerometer and circuit design is demonstrated using embedded polysilicon resistors as temperature sensors and heaters in a closed loop. Nested gyroscope topologies are demonstrated with a lateral MEMS accelerometer used as a coriolis acceleration sensor. Modeling and simulation tools that simultaneously consider the electromechanical transducer and the electronic circuit to predict system performance are developed. Electrical, electromechanical and mechanical parasitics required to enable predictive lumped parameter simulation are identified and can be extracted, enabling a designer to confidently estimate design performance prior to fabrication. Generic physics-based fault models for surface-micromachined actuators and sensors are developed that enable effective testing, diagnosis and design for manufacturability.},
	keywords = {*ELECTROMECHANICAL DEVICES, *GYROSCOPES, *INERTIAL MEASUREMENT UNITS, *INERTIAL NAVIGATION, *MICROELECTROMECHANICAL SYSTEMS, ACCELEROMETERS, BULK MATERIALS, CHIPS(ELECTRONICS), CIRCUITS, CLOSED LOOP SYSTEMS, CORIOLIS EFFECT, Detectors, DIELECTRICS, ELECTRICAL AND ELECTRONIC EQUIPMENT, EMBEDDING, METALS, MICROSENSORS., MICROSTRUCTURE, MONOLITHIC STRUCTURES(ELECTRONICS), NAVIGATION AND GUIDANCE, PARASITES, PE63739E, PERFORMANCE(ENGINEERING), POLYSILICONS, RESISTORS, SILICON, TEMPERATURE SENSITIVE ELEMENTS, THERMAL STABILITY, THIN FILMS, tools, Topology, WUAFRLE1170030},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA399565},
	author = {Fedder,Gary K. and Blanton,Shawn and Carley,L. R. and Gupta, Satyandra K. and Koester,David}
}
@article {17964,
	title = {Controlled topology simplification},
	journal = {Visualization and Computer Graphics, IEEE Transactions on},
	volume = {2},
	year = {1996},
	month = {1996/06//},
	pages = {171 - 184},
	abstract = {We present a simple, robust, and practical method for object simplification for applications where gradual elimination of high frequency details is desired. This is accomplished by converting an object into multi resolution volume rasters using a controlled filtering and sampling technique. A multiresolution triangle mesh hierarchy can then be generated by applying the Marching Cubes algorithm. We further propose an adaptive surface generation algorithm to reduce the number of triangles generated by the standard Marching Cubes. Our method simplifies the topology of objects in a controlled fashion. In addition, at each level of detail, multilayered meshes can be used for an efficient antialiased rendering},
	keywords = {(computer, algorithm;adaptive, algorithm;controlled, antialiased, Cubes, Cubes;antialiasing;computational, details;multi, filtering;controlled, Frequency, generation, geometry;rendering, graphics);topology;, hierarchy;object, Marching, mesh, meshes;multiresolution, rasters;multilayered, rendering;high, resolution, simplification;efficient, simplification;sampling, surface, technique;standard, Topology, triangle, volume},
	isbn = {1077-2626},
	doi = {10.1109/2945.506228},
	author = {He,Taosong and Hong,Lichan and Varshney, Amitabh and Wang,S.W.}
}
