Finding fact by using fiction

This study was to explore the psychoanalytic process that writers experience when they write memoirs. With psychoanalytic theory, the findings were that when writers compose memoirs which include repressed information, the writer's word choice or word block is heavily influenced by his/her own moral code. This idea led to the assertions that first, we are fragmented because of the discordance that arises between the structures of morality and language, the latter which includes good and evil; second, when we write memoirs, we must create a fictional identity that allows the different fragments of identity to operate under the illusion of continuity that language provides; and third, the language we use may transcend our repressed information into consciousness. The conclusion was that when past immoral truths are uncovered, the various fragments with their selfish aims and the fictional identity cease to exist in the wake of being. ^

Modeling security and cooperation in wireless networks using game theory

This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.^

Pseudomonas aeruginosa β-lactamase induction requires two permeases, AmpG and AmpP

Background In Enterobacteriaceae, β-lactam antibiotic resistance involves murein recycling intermediates. Murein recycling is a complex process with discrete steps taking place in the periplasm and the cytoplasm. The AmpG permease is critical to this process as it transports N-acetylglucosamine anhydrous N-acetylmuramyl peptides across the inner membrane. In Pseudomonadaceae, this intrinsic mechanism remains to be elucidated. Since the mechanism involves two cellular compartments, the characterization of transporters is crucial to establish the link. Results Pseudomonas aeruginosa PAO1 has two ampG paralogs, PA4218 (ampP) and PA4393 (ampG). Topology analysis using β-galactosidase and alkaline phosphatase fusions indicates ampP andampG encode proteins which possess 10 and 14 transmembrane helices, respectively, that could potentially transport substrates. Both ampP and ampG are required for maximum expression of β-lactamase, but complementation and kinetic experiments suggest they act independently to play different roles. Mutation of ampG affects resistance to a subset of β-lactam antibiotics. Low-levels of β-lactamase induction occur independently of either ampP or ampG. Both ampG and ampP are the second members of two independent two-gene operons. Analysis of the ampG and ampPoperon expression using β-galactosidase transcriptional fusions showed that in PAO1, ampGoperon expression is β-lactam and ampR-independent, while ampP operon expression is β-lactam and ampR-dependent. β-lactam-dependent expression of the ampP operon and independent expression of the ampG operon is also dependent upon ampP. Conclusions In P. aeruginosa, β-lactamase induction occurs in at least three ways, induction at low β-lactam concentrations by an as yet uncharacterized pathway, at intermediate concentrations by an ampPand ampG dependent pathway, and at high concentrations where although both ampP and ampGplay a role, ampG may be of greater importance. Both ampP and ampG are required for maximum induction. Similar to ampC, ampP expression is inducible in an ampR-dependent manner. Importantly, ampP expression is autoregulated and ampP also regulates expression of ampG. Both AmpG and AmpP have topologies consistent with functions in transport. Together, these data suggest that the mechanism of β-lactam resistance of P. aeruginosa is distinct from well characterized systems in Enterobacteriaceae and involves a highly complicated interaction between these putative permeases and known Amp proteins.

Trajectory privacy preservation in mobile Wireless Sensor Networks

In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node. ^ This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.^

Trajectory Privacy Preservation in Mobile Wireless Sensor Networks

In recent years, there has been an enormous growth of location-aware devices, such as GPS embedded cell phones, mobile sensors and radio-frequency identification tags. The age of combining sensing, processing and communication in one device, gives rise to a vast number of applications leading to endless possibilities and a realization of mobile Wireless Sensor Network (mWSN) applications. As computing, sensing and communication become more ubiquitous, trajectory privacy becomes a critical piece of information and an important factor for commercial success. While on the move, sensor nodes continuously transmit data streams of sensed values and spatiotemporal information, known as ``trajectory information". If adversaries can intercept this information, they can monitor the trajectory path and capture the location of the source node. This research stems from the recognition that the wide applicability of mWSNs will remain elusive unless a trajectory privacy preservation mechanism is developed. The outcome seeks to lay a firm foundation in the field of trajectory privacy preservation in mWSNs against external and internal trajectory privacy attacks. First, to prevent external attacks, we particularly investigated a context-based trajectory privacy-aware routing protocol to prevent the eavesdropping attack. Traditional shortest-path oriented routing algorithms give adversaries the possibility to locate the target node in a certain area. We designed the novel privacy-aware routing phase and utilized the trajectory dissimilarity between mobile nodes to mislead adversaries about the location where the message started its journey. Second, to detect internal attacks, we developed a software-based attestation solution to detect compromised nodes. We created the dynamic attestation node chain among neighboring nodes to examine the memory checksum of suspicious nodes. The computation time for memory traversal had been improved compared to the previous work. Finally, we revisited the trust issue in trajectory privacy preservation mechanism designs. We used Bayesian game theory to model and analyze cooperative, selfish and malicious nodes' behaviors in trajectory privacy preservation activities.