Additive functions in boolean models of gene regulatory network modules.

Gene-on-gene regulations are key components of every living organism. Dynamical abstract models of genetic regulatory networks help explain the genome's evolvability and robustness. These properties can be attributed to the structural topology of the graph formed by genes, as vertices, and regulatory interactions, as edges. Moreover, the actual gene interaction of each gene is believed to play a key role in the stability of the structure. With advances in biology, some effort was deployed to develop update functions in Boolean models that include recent knowledge. We combine real-life gene interaction networks with novel update functions in a Boolean model. We use two sub-networks of biological organisms, the yeast cell-cycle and the mouse embryonic stem cell, as topological support for our system. On these structures, we substitute the original random update functions by a novel threshold-based dynamic function in which the promoting and repressing effect of each interaction is considered. We use a third real-life regulatory network, along with its inferred Boolean update functions to validate the proposed update function. Results of this validation hint to increased biological plausibility of the threshold-based function. To investigate the dynamical behavior of this new model, we visualized the phase transition between order and chaos into the critical regime using Derrida plots. We complement the qualitative nature of Derrida plots with an alternative measure, the criticality distance, that also allows to discriminate between regimes in a quantitative way. Simulation on both real-life genetic regulatory networks show that there exists a set of parameters that allows the systems to operate in the critical region. This new model includes experimentally derived biological information and recent discoveries, which makes it potentially useful to guide experimental research. The update function confers additional realism to the model, while reducing the complexity and solution space, thus making it easier to investigate.

Algorithmic aspects of bio-inspired string operations

We present building blocks for algorithms for the efficient reduction of square factor, i.e. direct repetitions in strings. So the basic problem is this: given a string, compute all strings that can be obtained by reducing factors of the form zz to z. Two types of algorithms are treated: an offline algorithm is one that can compute a data structure on the given string in advance before the actual search for the square begins; in contrast, online algorithms receive all input only at the time when a request is made. For offline algorithms we treat the following problem: Let u and w be two strings such that w is obtained from u by reducing a square factor zz to only z. If we further are given the suffix table of u, how can we derive the suffix table for w without computing it from scratch? As the suffix table plays a key role in online algorithms for the detection of squares in a string, this derivation can make the iterated reduction of squares more efficient. On the other hand, we also show how a suffix array, used for the offline detection of squares, can be adapted to the new string resulting from the deletion of a square. Because the deletion is a very local change, this adaption is more eficient than the computation of the new suffix array from scratch.

Toolbox to Address Safety and Operations on School Grounds and Public Streets Adjacent to Elementary and Middle Schools in Iowa, August 2006

This study identified transportation safety issues at existing Iowa school sites through on-site observations, traffic data collection, and through interviews with schools, law enforcement, and traffic engineers. Frequently observed problems, such as crossing at unmarked crosswalks, unloading and loading students on the street side, inattentive student safety patrols, and illegal parking, were documented and solutions were recommended for implementation. The results of the study also conclude that regular communications between school officials, traffic engineers, law enforcement, parents, and school transportation personnel are all critical to promoting safe operations within school zones.

On circuit functionality in boolean networks.

It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic attractor). However, there are no definite mathematical frameworks translating the underlying meaning of "generates." Focusing on Boolean networks, we recall and propose some definitions concerning the notion of functionality along with associated mathematical results.

Audit report on the Honey Creek Resort Operations Account maintained by Central Group Management, LLC for the year ended June 30, 2010

Audit report on the Honey Creek Resort Operations Account maintained by Central Group Management, LLC for the year ended June 30, 2010

Assessment of the soil compaction of two ultisols caused by logging operations

The impact of wood loads on bulk density and preconsolidation pressure and of harvester and forwarder traffic on rut depth, bulk density and preconsolidation pressure of two Ultisols were examined in this study. Our objective was to quantify the threshold beyond which significant soil compaction and rutting would occur. This study was carried out in the county of Eunápolis, state of Bahia, Brazil, (16 º 23 ' 17 '' S and 39 º 10 ' 06 '' W; altitude 80 m asl) in two Ultisols (PAd2 and PAd3) with different texture classes, in experimental areas with eucalypt plantation. The study involved measurements at the wood load site and machine driving at specific locations in the forest during logging operations. The treatments consisted of one harvester pass and, 8, 16 and 40 passes of a fully loaded forwarder. Thresholds were established based on the rut depth and percentage of preconsolidation pressure values in the region of additional soil compaction defined in the bearing capacity model. The percentage of soil samples with values of preconsolidation pressure in the region of additional soil compaction indicated a greater susceptibility of PAd3 than of PAd2 to soil compaction. The threshold levels established here based on preconsolidation pressure and rut depth indicated that no more than eight forwarder passes should be allowed in loading operations in order to minimize soil compaction.

Final Report-Freeway Operations Analysis of I-80 to I-29 Interchange, January 1974

A t the request of the Iowa State Highway Commission, the Engineering Research Institute observed the traffic operations at the Interstate 29 (1-29) and Interstate 80 (1-80) interchange in the southwest part of Council Bluffs. The general location of the site is shown in Figure 1. Before limiting the analysis to the diverging area the project staff drove the entire Council Bluffs freeway system and consulted with M r . Philip Hassenstab (Iowa State Highway Commission, District 4, Resident Maintenance Engineer at Council Bluffs). The final study scope was delineated as encompassing only the operational characteristics of the diverge area where 1-29 South and 1-80 East divide and the ramp to merge area where 1-80 West joins 1-29 North (both areas being contained within the aforementioned interchange). Supplementing the traffic operations scope, was an effort to delineate and document the applicability of video-tape techniques to traffic engineering studies and analyses. Documentation was primarily in the form of a demonstration video-tape.

Backhoe loaders as base machines in logging operations

Summary