Geopolymer assembly by emulsion templating: Emulsion stability and hardening mechanisms

This work investigates emulsion templating to synthesize hexadecane oil/geopolymer composites. In a system with hexadecane as the internal (dispersed) phase and an alkali activated continuous phase without added surfactant, adding aluminosilicate clay particles does not increase resistance against creaming or coalescence, while adding a surfactant (L35 or CTAB) stabilizes the solid-liquid interface. Infrared studies and rheological studies of the associated geopolymerization determined that the presence of the organic phase or surfactant has no significant effect on the geopolymerization kinetics, as determined by the change in time of the Si-O-T IR stretching frequency and the rheological moduli involved during the process. The stabilization of the organic template is reminiscent of Pickering emulsion even though we employ a much greater amount of inorganic material for geopolymer formation. Although the addition of surfactant has a significant effect on the behavior of the paste, the percolation of the network remains unmodified, highlighting the fact that the phenomenon is not dependent on viscosity. Finally, rheological measurements were used to obtain the mass fractal dimension of the as-made gel network, which is able to differentiate the interfacial effect between surfactant molecules with a slightly denser interphase when a cationic surfactant is used.     

Pilot: probabilistic lightweight group communication system for ad hoc networks

Providing reliable group communication is an ever recurring topic in distributed settings. In mobile ad hoc networks, this problem is even more significant since all nodes act as peers, while it becomes more challenging due to highly dynamic and unpredictable topology changes. In order to overcome these difficulties, we deviate from the conventional point of view, i.e., we "fight fire with fire," by exploiting the nondeterministic nature of ad hoc networks. Inspired by the principles of gossip mechanisms and probabilistic quorum systems, we present in this paper PILOT (probabilistic lightweight group communication system) for ad hoc networks, a two-layer system consisting of a set of protocols for reliable multicasting and data sharing in mobile ad hoc networks. The performance of PILOT is predictable and controllable in terms of both reliability (fault tolerance) and efficiency (overhead). We present an analysis of PILOT's performance, which is used to fine-tune protocol parameters to obtain the desired trade off between reliability and efficiency. We confirm the predictability and tunability of PILOT through simulations with ns-2.     

Self-organized public-key management for mobile ad hoc networks

In contrast with conventional networks, mobile ad hoc networks usually do not provide online access to trusted authorities or to centralized servers, and they exhibit frequent partitioning due to link and node failures and to node mobility. For these reasons, traditional security solutions that require online trusted authorities or certificate repositories are not well-suited for securing ad hoc networks. We propose a fully self-organized public-key management system that allows users to generate their public-private key pairs, to issue certificates, and to perform authentication regardless of the network partitions and without any centralized services. Furthermore, our approach does not require any trusted authority, not even in the system initialization phase.     

Nash equilibria of packet forwarding strategies in wireless ad hoc networks

In self-organizing ad hoc networks, all the networking functions rely on the contribution of the participants. As a basic example, nodes have to forward packets for each other in order to enable multihop communication. In recent years, incentive mechanisms have been proposed to give nodes incentive to cooperate, especially in packet forwarding. However, the need for these mechanisms was not formally justified. In this paper, we address the problem of whether cooperation can exist without incentive mechanisms. We propose a model,based on game theory and graph theory to investigate equilibrium conditions of packet forwarding strategies. We prove theorems about the equilibrium conditions for both cooperative and noncooperative strategies. We perform simulations to estimate the probability that the conditions for a cooperative equilibrium hold in randomly generated network scenarios.. As the problem is involved, we deliberately restrict ourselves to a static configuration. We conclude that in static ad hoc networks where the relationships between the nodes are likely to be stab le-cooperation needs to be encouraged.     

Microscale and mesoscale discrete models for dynamic fracture of structures built of brittle material

In this work we present the discrete models for dynamic fracture of structures built of brittle materials. The models construction is based on Voronoi cell representation of the heterogeneous structure, with the beam lattice network used to model the cohesive and compressive forces between the neighboring cells. Each lattice component is a geometrically exact shear deformable beam which can describe large rigid body motion and the most salient fracture mechanisms. The latter can be represented through the corresponding form of the beam constitutive equations, which are derived either at microscale with random distribution of material properties or at a mesoscale with average deterministic values. The proposed models are also placed within the framework of dynamics, where special attention is paid to constructing the lattice network mass matrix as well as the corresponding time-stepping schemes. Numerical simulations of compression and bending tests is given to illustrate the models performance.     

FDTD simulation of 30 /spl mu/m diameter polymer micro-ring

Numerical results on polymer surrounded by an air micro-ring coupled to waveguides are presented. The FDTD method predicts a filter width of 1.4 nm and an extraction efficiency of almost 80% for a gap of 0.15 /spl mu/m.     

Secure vehicular communication systems: implementation, performance, and research challenges

Vehicular communication systems are on the verge of practical deployment. Nonetheless, their security and privacy protection is one of the problems that have been addressed only recently. In order to show the feasibility of secure VC, certain implementations are required. In [1] we discuss the design of a VC security system that has emerged as a result of the European SeVe- Com project. In this second article we discuss various issues related to the implementation and deployment aspects of secure VC systems. Moreover, we provide an outlook on open security research issues that will arise as VC systems develop from today?s simple prototypes to fullfledged systems.     

Linearly bounded infinite graphs

Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs.A preliminary version of this article appeared in MFCS 2005.