Thesis (M. Arch.)--Massachusetts Institute of Technology, Dept. of Architecture, 1980. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH. / Includes bibliographical references. / Adaptability in this Thesis refers to the inherent capacity of a dwelling, to accommodate changing spatial and economic requirements over time. The adaptable dwelling is intended to respond to change as a fundamental condition of the human life-cycle, and offers choices to its inhabitants when changes occur. The adaptable dwelling is intended to provide an alternative to either moving as a result of change or to tolerating a space/need mis-match. Adaptability inevitably requires some overprovision of space and/or services within the dwelling which, in turn, requires increased expenditures. Thus, a major obstacle to providing adaptable housing - quite aside from strictly architectural concerns - is an economic one. A major contention of this Thesis is that adaptability will be realized only when it is built within an economic framework that will support/justify the necessary overprovision of space and/or services. The proposed economic framework in this Thesis is based on the notion of income-generation. The dwelling is conceived as a collection of areas that the inhabitants can combine - and continuously recombine - in a variety of ways such that the inhabitants can rent to others those areas which they do not need for themselves at any given time. In this way, overprovided space and/or services can generate operating income for the inhabitant which can offset the additional expenditures required for adaptability. The architectural intent of this Thesis is to design prototypical adaptable dwellings based on these social and economic notions. The adaptable dwelling is designed to function usefully as a residence for one, two or three families - at the option of the controlling inhabitant. A dwelling conceived and designed in this manner has a significant potential for adaptability within a supportive economic framework. / by John A. Winslow. / M.Arch.

<p>Weed control is nowadays a hi-tech discipline. Inter-row weed control is very sophisticated </p><p>whereas the intra-row weed control lacks a lot. The aim of this pro ject is to implement </p><p>an embedded system of an autonomous vision based intra-row weeding robot. Weed and </p><p>crops can be distinguished due to several attributes like colour, shape and context fea- </p><p>tures. Using an emebedded system has several advantages. The embedded system is </p><p>specialized on video processing and is designed to withstand the needs of outdoor use. </p><p>This embedded system is already able to distinguish between weed and crops. The per- </p><p>formance of the hardware is very good whereas the software still needs some optimizations.</p>

Weed control is nowadays a hi-tech discipline. Inter-row weed control is very sophisticated whereas the intra-row weed control lacks a lot. The aim of this pro ject is to implement an embedded system of an autonomous vision based intra-row weeding robot. Weed and crops can be distinguished due to several attributes like colour, shape and context fea- tures. Using an emebedded system has several advantages. The embedded system is specialized on video processing and is designed to withstand the needs of outdoor use. This embedded system is already able to distinguish between weed and crops. The per- formance of the hardware is very good whereas the software still needs some optimizations.

Escalation of right-of-way (ROW) costs have been shown to be a prime contributor to project cost escalation in the highway industry. Two problems contribute to ROW cost escalation: 1) the ROW cost estimation and cost estimate management process generally lacks structure and definition as compared to other areas of cost estimation; and 2) there is a lack of integration and communication between those responsible for ROW cost estimating and those responsible for general project cost estimating. The research for this thesis was preceded by a literature review to establish the basis for the study. Data collection was completed through interviews of seven state highway agencies (SHAs) and two local public agencies (LPAs). The findings of the research are presented in a set of ROW flowcharts which document the steps, inputs, and outputs of the ROW cost estimation and cost estimate management process. Three ROW cost estimates and a cost management process take place throughout project development. An effort was made from the onset of the research to relate the ROW cost estimating and cost estimate management process to the first four project development phases (planning, programming. preliminary design, and final design). There are five flowcharts produced as a result of this research: 1) an agency-level flowchart showing all cost estimates and the interaction of ROW with the project development process; 2) a conceptual ROW cost estimating flowchart which depicts the required steps during planning; 3) a baseline ROW cost estimating flowchart which depicts the required steps during programming; 4) an update ROW cost estimating flowchart which depicts the required steps during preliminary design to include a cost estimate management loop; and 5) a ROW cost management flowchart which depicts the required steps during final design. Although selected SHA contacts provided input following the development of the flowcharts, the flowcharts were only validated to a limited extent due to time and budget constraints. These flowcharts attempt to address the two contributing problems to ROW cost escalation by providing structure to the ROW cost estimation process and by developing the ROW process flowcharts linked to the project development process. Based on the input provided by SHA contacts, the flowcharts appear to have the potential to provide guidance to SHAs in improving the accuracy of ROW cost estimates through addressing these two problems.

A DNA microarray is a very good tool to study the gene expression level in different situations. Mining association rules in DNA microarray datasets can help us know how genes affect each other, and what genes are usually co-expressed. Mining closed large itemsets can be useful for reducing the size of the mining result from the DNA microarray datasets, where a closed itemset is an itemset that there is no superset whose support value is the same as the support value of this itemset. Since the number of genes stored in columns is much larger than the number of samples stored in rows in a DNA microarray dataset, traditional mining methods which use column enumeration face a great challenge, where the column enumeration means that enumerating itemsets from the combinations of items stored in columns. Therefore, several row enumeration methods, e.g., RERII, have been proposed to solve this problem, where row enumeration means that enumerating itemsets from the combinations of items stored in rows. Although the RERII method saves more memory space and has better performance than the other row enumeration methods, it needs complex intersection operations at each node of the row enumeration tree to generate the closed itemsets. In this thesis, we propose a new method, UMiner, which is based on the union operations to mine the closed large itemsets in the DNA microarray datasets. Our approach is a row enumeration method. First, we add all tuples in the transposed table to a prefix tree, where a transposed table records the information about where an item appears in the original table. Next, we traverse this prefix tree to create a row-node table which records the information about a node and the related range of its child nodes in the prefix tree created from the transposed table. Then we generate the closed itemset by using the union operations on the itemsets in the item groups stored in the row-node table. Since we do not use the intersection operations to generate the closed itemset for each enumeration node, we can reduce the time complexity that is needed at each node of the row enumeration tree. Moreover, we develop four pruning techniques to reduce the number of candidate closed itemsets in the row enumeration tree. By replacing the complex intersection operations with the union operations and designing four pruning techniques to reduce the number of branches in the row enumeration tree, our method can find closed large itemsets very efficiently. In our performance study, we use three real datasets which are the clinical data on breast cancer, lung cancer, and AML-ALL. From the experiment results, we show that our UMiner method is always faster than the RERII method in all support values, no matter what the average length of the closed large itemsets is. Moreover, in our simulation result, we also show that the processing time of our method increases much more slowly than that of the RERII method as the average number of items in the rows of a dataset increases.

Given a string S = {a1, a2, a3, ..., an}, the longest increasing subsequence (LIS) problem is to find a subsequence of the given string such that the subsequence is increasing and its length is maximal. In a previous result, to find the longest increasing subsequences of each sliding window with a fixed size w of a given string with length n can be solved in O(w log log n+OUTPUT) time, where O(w log log n+ w^2) time is taken for preprocessing and OUTPUT is the sum of all output lengths. In this thesis, we solve the problem for finding the longest increasing subsequence of every substring of S. With the straightforward implementation of the previous result, the time required for the preprocessing would be O(n^3). We modify the data structure used in the algorithm, hence the required preprocessing time is improved to O(n^2). The time required for the report stage is linear to the size of the output. In other words, our algorithm can find the LIS of every substring in O(n^2+OUTPUT) time. If the LIS's of all substrings are desired to be reported, since there are O(n^2) substrings totally in a given string with length n, our algorithm is optimal.

For Taiwanese new row mian is small food and is also one part of life and history. By promotion of Taipei International New row, Taiwanese can know and place importance on this traditional small food. In addition, Taipei International New row can improve the business of new row mian industry and city awareness of Taipei in the whole world. City Marketing become a top priority of each government. Therefore,in this thesis take Taipei International new row mian Festival for example and take advantage of research method, like observation, doing the literature review, case studies and interviews. I hope that this thesis can conduct the Key factor of City Marketing strategy, give some recommendations and references for research institution¡Bnon-governmental groups and government. I propose some recommendations as follows: 1¡B Organization of plan group must be integrity and resources must be integrated 2¡BGive target market strong attraction and strengthen city position 3. Strengthen the connections with the product and target market

Ultra-narrow row (UNR) cotton (Gossypium hirsutum L.) is a production system using high plant populations in reduced row spacings. The responses of this production system to nitrogen fertilizer have not been fully investigated. Evaluations of yield and earliness of harvest are also important. A three-year study was conducted at the Texas Agricultural Experiment Station farm, Burleson County, TX, on a Ships clay (very-fine, mixed, active, thermic Chromic Hapluderts) and a Weswood silty clay loam (fine-silty, mixed, superactive, thermic Udifluventic Haplustepts). A split plot design was used. Nitrogen fertilizer rates of 0, 50, 101, and 151 kg N ha-1 were applied as the whole plots and row spacings of 19, 38, and 76 cm were established as the split plots. Data included lint yield and yield components, as well as earliness of crop maturity and earliness-related parameters such as boll distribution. Lint yield was increased by higher nitrogen rate. There was no nitrogen rate by row spacing interaction on lint yield, implying fertilizer rates do not need to be changed for UNR systems. Reductions in row spacing did not significantly affect lint yield in any year. Responses such as reduced bolls per plant, increased plant populations, increased ginout, and decreased boll size were often significant and combined to allow the crop to maintain equivalent yields as row spacings were reduced. The slight UNR earliness advantages were probably due to changes in boll distribution. Based on these results, increases in lint yield and earliness may not reliably contribute to the profitability of UNR cotton.

It is known that the ring of invariants of any two-row group is Cohen-Macaulay. This result inspired the conjecture that the ring of invariants of any two-row group is a complete intersection. In this thesis, we study this conjecture in the case where the ground field is the prime field $\mathbb{F}_p$. We prove that all Abelian reflection two-row $p$-groups have complete intersection invariant rings. We show that all two-row groups with \textit{non-normal} Sylow $p$-subgroups have polynomial invariant rings. We also show that reflection two-row groups with \textit{normal} reflection Sylow $p$-subgroups have polynomial invariant rings. As an interesting application of a theorem of Nakajima about hypersurface invariant rings, we rework a classical result which says that the invariant rings of subgroups of $\text{SL}(2,\,p)$ are all hypersurfaces. In addition, we obtain a result that characterizes Nakajima $p$-groups in characteristic $p$, namely, if the invariant ring is generated by norms, then the group is a Nakajima $p$-group. / Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2009-09-29 15:08:40.705

No description available.