Model of sources: a proposal for the hierarchy, merging strategy and representation of the information sources in virtual models of historical buildings

Contributed to: Fusion of Cultures: XXXVIII Annual Conference on Computer Applications and Quantitative Methods in Archaeology – CAA2010 (Granada, Spain, Apr 6-9, 2010)

Non-destructive characterization of structural hierarchy within aligned carbon nanotube assemblies

Understanding and controlling the hierarchical self-assembly of carbon nanotubes (CNTs) is vital for designing materials such as transparent conductors, chemical sensors, high-performance composites, and microelectronic interconnects. In particular, many applications require high-density CNT assemblies that cannot currently be made directly by low-density CNT growth, and therefore require post-processing by methods such as elastocapillary densification. We characterize the hierarchical structure of pristine and densified vertically aligned multi-wall CNT forests, by combining small-angle and ultra-small-angle x-ray scattering (USAXS) techniques. This enables the nondestructive measurement of both the individual CNT diameter and CNT bundle diameter within CNT forests, which are otherwise quantified only by delicate and often destructive microscopy techniques. Our measurements show that multi-wall CNT forests grown by chemical vapor deposition consist of isolated and bundled CNTs, with an average bundle diameter of 16 nm. After capillary densification of the CNT forest, USAXS reveals bundles with a diameter 4 m, in addition to the small bundles observed in the as-grown forests. Combining these characterization methods with new CNT processing methods could enable the engineering of macro-scale CNT assemblies that exhibit significantly improved bulk properties. © 2011 American Institute of Physics.

Energy-Momentum of a Cosmological Brane Model and the Gauge Hierarchy

We analyze in this paper the general covariant energy-momentum tensor of the gravitational system in general five-dimensional cosmological brane-world models. Then through calculating this energy-momentum for the cosmological generalization of the Randall-Sundrum model, which includes the original RS model as the static limit, we are able to show that the weakness of the gravitation on the "visible" brane is a general feature of this model. This is the origin of the gauge hierarchy from a gravitational point of view. Our results are also consistent with the fact that a gravitational system has vanishing total energy.

An application of the analytic hierarchy process and fuzzy logic inference in a decision support system for forage selection

Forage selection plays a prominent role in the process of returning cultivated lands back into grasslands. The conventional method of selecting forage species can only provide attempts for problem-solving without considering the relationships among the decision factors globally. Therefore, this study is dedicated to developing a decision support system to help farmers correctly select suitable forage species for the target sites. After collecting data through a field study, we developed this decision support system. It consists of three steps: (1) the analytic hierarchy process (AHP), (2) weights determination, and (3) decision making. In the first step, six factors influencing forage growth were selected by reviewing the related references and by interviewing experts. Then a fuzzy matrix was devised to determine the weight of each factor in the second step. Finally, a gradual alternative decision support system was created to help farmers choose suitable forage species for their lands in the third step. The results showed that the AHP and fuzzy logic are useful for forage selection decision making, and the proposed system can provide accurate results in a certain area (Gansu Province) of China.

A Robust Amorphous Hierarchy from Persistent Nodes

For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a hierarchy, but hierarchies often have a few critical nodes whose death can disrupt organization over long distances. I address this with a system of distributed aggregates called Persistent Nodes, such that spatially local failures disrupt the hierarchy in an area proportional to the diameter of the failure. I describe and analyze this system, which has been implemented in simulation.

Learning Classes Correlated to a Hierarchy

Trees are a common way of organizing large amounts of information by placing items with similar characteristics near one another in the tree. We introduce a classification problem where a given tree structure gives us information on the best way to label nearby elements. We suggest there are many practical problems that fall under this domain. We propose a way to map the classification problem onto a standard Bayesian inference problem. We also give a fast, specialized inference algorithm that incrementally updates relevant probabilities. We apply this algorithm to web-classification problems and show that our algorithm empirically works well.

Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

It is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC=P.

A Memory Model for Concept Hierarchy Representation and Commonsense Reasoning

Most associative memory models perform one level mapping between predefined sets of input and output patterns1 and are unable to represent hierarchical knowledge. Complex AI systems allow hierarchical representation of concepts, but generally do not have learning capabilities. In this paper, a memory model is proposed which forms concept hierarchy by learning sample relations between concepts. All concepts are represented in a concept layer. Relations between a concept and its defining lower level concepts, are chunked as cognitive codes represented in a coding layer. By updating memory contents in the concept layer through code firing in the coding layer, the system is able to perform an important class of commonsense reasoning, namely recognition and inheritance.