The Most Probable Bayesian Network and Beyond

This doctoral dissertation introduces an algorithm for constructing the most probable Bayesian network from data for small domains. The algorithm is used to show that a popular goodness criterion for the Bayesian networks has a severe sensitivity problem. The dissertation then proposes an information theoretic criterion that avoids the problem.

Nitrogenase activity (acetylene reduction) associated with leaves of different cultivars of paddy

An investigation was conducted to study the levels of nitrogen fixation on the leaf or sheath surfaces of four cultivars of paddy plants by using acetylene reduction technique. Varying levels of positive nitrogenase activity were observed on all the leaf surfaces. Sheath of IET 1991 cultivar showed a higher rate of fixation than the leaf surface. All the nitrogen-fixing organisms on the leaf or sheath surfaces belonged to the genus Beijerinckia. There was no correlation between the bacterial density and the level of fixation. Scanning electron microscopic data revealed that the upper surface of IET 1991 leaf was highly silicified and the microflora was either scanty or nil while the lower surface appeared quite different and harboured more micro-organisms. Similarly, the inner surface of sheath was devoid of silicification and showed the presence of micro-organisms.

Nitrogenase activity (acetylene reduction) associated with leaves of different cultivars of paddy (Oryza sativa L.)

An investigation was conducted to study the levels of nitrogen fixation on the leaf or sheath surfaces of four cultivars of paddy plants by using acetylene reduction technique. Varying levels of positive nitrogenase activity were observed on all the leaf surfaces. Sheath of IET 1991 cultivar showed a higher rate of fixation than the leaf surface. All the nitrogen-fixing organisms on the leaf or sheath surfaces belonged to the genus Beijerinckia. There was no correlation between the bacterial density and the level of fixation. Scanning electron microscopic data revealed that the upper surface of IET 1991 leaf was highly silicified and the microflora was either scanty or nil while the lower surface appeared quite different and harboured more micro-organisms. Similarly, the inner surface of sheath was devoid of silicification and showed the presence of micro-organisms.

Topochemically controlled hydrogen reduction of scheelite-related rare-earth metal molybdates

Scheelite-related -Ln2Mo3O12(Ln = La, Pr, Nd, Sm, Gd, Tb, or Dy) oxides are reduced by hydrogen at 780–870 K yielding molybdenum (IV) oxides of formula Ln2Mo3O9. The latter crystallize in a tetragonal scheelite (ABO4) type structure where one third of the A sites and a quarter of the anion sites are vacant: Ln2/3(cat)1/3MoO3(an). The reaction Ln2Mo3O12+ 3H2 Ln2Mo3O9(an)3+ 3H2O may be regarded as topochemically controlled, since both the parent and the product phases have scheelite-related structures. Infrared spectra and electrical and magnetic properties of these metastable defect scheelite phases are reported.

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

A network forensics tool for precise data packet capture and replay in cyber-physical systems

Network data packet capture and replay capabilities are basic requirements for forensic analysis of faults and security-related anomalies, as well as for testing and development. Cyber-physical networks, in which data packets are used to monitor and control physical devices, must operate within strict timing constraints, in order to match the hardware devices' characteristics. Standard network monitoring tools are unsuitable for such systems because they cannot guarantee to capture all data packets, may introduce their own traffic into the network, and cannot reliably reproduce the original timing of data packets. Here we present a high-speed network forensics tool specifically designed for capturing and replaying data traffic in Supervisory Control and Data Acquisition systems. Unlike general-purpose "packet capture" tools it does not affect the observed network's data traffic and guarantees that the original packet ordering is preserved. Most importantly, it allows replay of network traffic precisely matching its original timing. The tool was implemented by developing novel user interface and back-end software for a special-purpose network interface card. Experimental results show a clear improvement in data capture and replay capabilities over standard network monitoring methods and general-purpose forensics solutions.

DNP3 network scanning and reconnaissance for critical infrastructure

The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols to control national infrastructure. The move from point-to-point serial connections to Ethernet-based network architectures, allowing for large and complex critical infrastructure networks. However, networks and con- figurations change, thus auditing tools are needed to aid in critical infrastructure network discovery. In this paper we present a series of intrusive techniques used for reconnaissance on DNP3 critical infrastructure. Our algorithms will discover DNP3 outstation slaves along with their DNP3 addresses, their corresponding master, and class object configurations. To validate our presented DNP3 reconnaissance algorithms and demonstrate it’s practicality, we present an implementation of a software tool using a DNP3 plug-in for Scapy. Our implementation validates the utility of our DNP3 reconnaissance technique. Our presented techniques will be useful for penetration testing, vulnerability assessments and DNP3 network discovery.

Energy-output linkages in Australia: Implications for emissions reduction policies

The study investigates the long-run and dynamic relationships between energy consumption and output in Australia using a multivariate cointegration and causality framework. Using both Engle-Granger and Johansen cointegration approaches, the study finds that energy consumption and real Gross Domestic Product are cointegrated. The Granger causality tests suggest bidirectional Granger causality between energy consumption and real GDP, and Granger endogeineity in the system. Since the energy sector largely contributes to carbon emissions in Australia, we suggest that direct measures to reduce carbon by putting constraints on the energy consumption would pose significant economic costs for the Australian economy.

Letters from Moise and Jacob Seixas to K. K. S. I. regarding reduction in seat costs because they are refugees

Digital image

Investigations on the preparation, oxidation and reduction reactions of thiophosphoryl fluoride

Pure thiophosphoryl fluoride has been prepared by the fluorination of thiophosphoryl chloride by sodium fluoride in acetonitrile medium. Oxidation of this phosphoryl fluoride by acidified chloramine-T ruptures the phosphorus-sulphur bond and oxidises the sulphur present to the hexavalent state. Anhydrous hydrogen iodide reduces the sulphur to hydrogen sulphide and phosphorus to the trivalent state.

Sodium-ammonia reduction of some cyclic vinyl bromides

Abstract is not available.

Collaboration on social network sites: Amateurs, professionals and celebrities

Amateurs are found in arts, sports, or entertainment, where they are linked with professional counterparts and inspired by celebrities. Despite the growing number of CSCW studies in amateur and professional domains, little is known about how technologies facilitate collaboration between these groups. Drawing from a 1.5-year field study in the domain of bodybuilding, this paper describes the collaboration between and within amateurs, professionals, and celebrities on social network sites. Social network sites help individuals to improve their performance in competitions, extend their support network, and gain recognition for their achievements. The findings show that amateurs benefit the most from online collaboration, whereas collaboration shifts from social network sites to offline settings as individuals develop further in their professional careers. This shift from online to offline settings constitutes a novel finding, which extends previous work on social network sites that has looked at groups of amateurs and professionals in isolation. As a contribution to practice, we highlight design factors that address this shift to offline settings and foster collaboration between and within groups.

Being online, living offline: The influence of social ties over the appropriation of social network sites

Research on social network sites has examined how people integrate offline and online life, but with a particular emphasis on their use by friendship groups. We extend earlier work by examining a case in which offline ties are non-existent, but online ties strong. Our case is a study of bodybuilders, who explore their passion with like-minded offline 'strangers' in tightly integrated online communities. We show that the integration of offline and online life supports passion-centric activities, such as bodybuilding.

"Hey world, take a look at me!": Appreciating the human body on social network sites

Social network sites (SNSs) such as Facebook have the potential to persuade people to adopt a lifestyle based on exercise and healthy nutrition. We report the findings of a qualitative study of an SNS for bodybuilders, looking at how bodybuilders present themselves online and how they orchestrate the SNS with their offline activities. Discussing the persuasive element of appreciation, we aim to extend previous work on persuasion in web 2.0 technologies.