Recombinant Factors for Hemostasis

Trauma deaths are a result of hemorrhage in 37% of civilians and 47% military personnel and are the primary cause of death for individuals under 44 years of age. Current techniques used to treat hemorrhage are inadequate for severe bleeding. Preliminary research indicates that fibrin sealants (FS) alone or in combination with a dressing may be more effective; however, it has not been economically feasible for widespread use because of prohibitive costs related to procuring the proteins. To meet future demands for hemostatic therapies, FS will likely include recombinant human fibrinogen (rFI) and recombinant human Factor XIII (rFXIII). The underlying hypothesis of the research presented in this dissertation is that a liquid fibrin sealant (LFS) composed of recombinant FI, FXIII and FIIa in optimized proportions can assist hemostasis in the presence and absence of a bioresorbable bandage while using considerably fewer biologics than commercial products currently available. This dissertation characterized rFI produced in the milk of transgenic cows, plasma-derived thrombin (pdFIIa) activated by sodium citrate and rFXIIIa expressed in genetically engineered Pichia pastoris with respect to their capacity to serve as components in a LFS. The ratios of these factors were optimized to yield a LFS with a rapid clot formation rate and high viscoelastic strength. This optimized LFS was preliminarily tested ex vivo and in vivo. The clotting kinetics and viscoelastic strength of our optimized LFS was equivalent to those of a commercially available LFS; however, it uses approximately 75% less fibrinogen and thrombin. Our optimal LFS successfully achieved hemostasis in a significant number of the wounds that included extensive tissue and vascular damage. LFS applied without the assistance of a dressing was able to stop bleeding of oozing wounds or those with small vessels; however, a scaffold was needed when wounds contained large vasculature.

PHOTOGRAPHIC RECORDS — THEIR IMPORTANCE IN TODAY'S ENVIRONMENTALLY SENSITIVE BIRD MANAGEMENT PROGRAMS

We are living in a day of change. Environmental awareness is a part of our everyday life in a way unprecedented in history. The courts, in their infinite wisdom, have initiated the joint and several liability (deep pocket) rules that make everyone at risk in almost all situations. Bird management programs, by their very nature, are extremely sensitive. Any project, if not evaluated, planned, carried out, and documented properly can result in adverse regulatory agency action, bad publicity, and even fines or lawsuits. Proper photographic documentation can play a vital part in helping to provide the necessary records to help prevent problems and/or defend yourself in case of lawsuit or regulatory action. In the preparation of this paper, we surveyed state pesticide lead agencies, state Department of Conservation (Fish and Wildlife) agencies, some U.S. Fish and Wildlife Law Enforcement personnel, and several individuals to get their reaction to and their comments about this concept of supplemental recordkeeping. Of those responding, a majority thought the concept of supplemental photographic recordkeeping would be an asset to individuals and organi¬zations conducting bird management projects.

ENHANCEMENT OF THE FAA’s ON-LINE WILDLIFE AIRCRAFT STRIKE DATABASE WITH AN INTERACTIVE GRAPHICS CAPABILITY

Embry-Riddle Aeronautical University (Prescott, AZ, USA) was awarded a grant from the William J. Hughes FAA Technical Center in October 1999 to develop and maintain a web site dealing with a wide variety of airport safety wildlife concerns. Initially, the web site enabled users to access related topics such as wildlife management (at/near airports), bird identification information, FAA wildlife management guidelines, education, pictures, current news, upcoming meetings and training, available jobs and discussion/forum sections. In April 2001, the web site was augmented with an on-line wildlife strike report (FAA Form 5200-7). Upon submittal on-line, “quick look” email notifications are sent to concerned government personnel. The distribution of these emails varies as to whether there was damage, human injuries/fatalities, and whether feather remains were collected and will be sent to the Smithsonian Institution for identification. In July 2002, a real-time on-line query system was incorporated to allow federal and local government agencies, airport and operator personnel, and USDA and airport wildlife biologists to access this database (which as of June 2005 contains 68,288 researched strike reports added to at a rate of approximately 500 strike reports/month) to formulate strategies to reduce the hazards wildlife present to aviation. To date (June 2005), over 15,000 on-line real-time queries were processed. In June 2004, ERAU was authorized to develop a graphical interface to this on-line query system. Current capabilities include mapping strikes (by species) on the US map, each of the contiguous 48 state maps (with AK and HI being added), and airport diagrams of the major metropolitan airports as well as the next 46 airports with the most reported strikes The latter capability depicts strikes by runway in plan as well as in elevation view. Currently under development is the ability to view time-sequenced strikes on the US map. This extensive graphical interface will give analysts the ability to view strike patterns with a wide variety of variables including species, seasons, migration patterns, etc. on US and state maps and airport diagrams.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.

Joint Computing and Network Resource Scheduling in a Lambda Grid Network

Data-intensive Grid applications require huge data transfers between grid computing nodes. These computing nodes, where computing jobs are executed, are usually geographically separated. A grid network that employs optical wavelength division multiplexing (WDM) technology and optical switches to interconnect computing resources with dynamically provisioned multi-gigabit rate bandwidth lightpath is called a Lambda Grid network. A computing task may be executed on any one of several computing nodes which possesses the necessary resources. In order to reflect the reality in job scheduling, allocation of network resources for data transfer should be taken into consideration. However, few scheduling methods consider the communication contention on Lambda Grids. In this paper, we investigate the joint scheduling problem while considering both optical network and computing resources in a Lambda Grid network. The objective of our work is to maximize the total number of jobs that can be scheduled in a Lambda Grid network. An adaptive routing algorithm is proposed and implemented for accomplishing the communication tasks for every job submitted in the network. Four heuristics (FIFO, ESTF, LJF, RS) are implemented for job scheduling of the computational tasks. Simulation results prove the feasibility and efficiency of the proposed solution.