Effect of proteolytic enzyme and fiber of papaya fruit on human digestive health

The World Health Organization (WHO, 2005) recommends consumption of fruits and vegetables as part of a healthy diet with daily recommendation of 5 servings or at least 400 g per day. Fruits and vegetables are good sources of vitamins, minerals, antioxidants, and fiber. Papaya fruit is known for his high nutrient and fiber content, and with few exceptions, it is generally consumed ripe due to its characteristic flavor and aroma. Digestion improvement has been attributed to consumption of papaya; this we speculate is attributed to the fiber content and proteolytic enzymes associated with this highly nutritious fruit. However, research is lacking that evaluates the impact of papaya fruit on human digestion. Papain is a proteolytic enzyme generally extracted from the latex of unripe papaya. Previous research has focused on evaluating papain activity from the latex of different parts of the plant; however there are no reports about papain activity in papaya pulp through fruit maturation. The activity of papain through different stages of ripeness of papaya and its capacity of dislodging meat bolus in an in vitro model was addressed. The objective of this study was to investigate whether papain activity and fiber content are responsible for the digestive properties attributed to papaya and to find a processing method that preserves papaya health properties with minimal impact on flavor. Our results indicated that papain was active at all maturation stages of the fruit. Ripe papaya pulp displayed the highest enzyme activity and also presented the largest meat bolus displacement. The in vitro digestion study indicated that ripe papaya displayed the highest protein digestibility; this is associated with proteolytic enzymes still active at the acidity of the stomach. Results from the in vitro fermentation study indicated that ripe papaya produced the highest amount of Short Chain Fatty Acids SCFA of the three papaya substrates (unripe, ripe, and processed). SCFA are the most important product of fermentation and are used as indicators of the amount of substrate fermented by microorganisms in the colon. The combination of proteolytic enzymes and fiber content found in papaya make of this fruit not only a potential digestive aid, but also a good source of SCFA and their associated potential health benefits. Irradiation processing had minimal impact on flavor compounds of papaya nectar. However, processed papaya experienced the lowest protein digestibility and SCFA production among the papaya substrates. Future research needs to explore new processing methods for papaya that minimize the detrimental impact on enzyme activity and SCFA production.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.

Design and development of distributed feedback transistor lasers

The transistor laser is a unique three-port device that operates simultaneously as a transistor and a laser. With quantum wells incorporated in the base regions of heterojunction bipolar transistors, the transistor laser possesses advantageous characteristics of fast base spontaneous carrier lifetime, high differential optical gain, and electrical-optical characteristics for direct “read-out” of its optical properties. These devices have demonstrated many useful features such as high-speed optical transmission without the limitations of resonance, non-linear mixing, frequency multiplication, negative resistance, and photon-assisted switching. To date, all of these devices operate as multi-mode lasers without any type of wavelength selection or stabilizing mechanisms. Stable single-mode distributed feedback diode laser sources are important in many applications including spectroscopy, as pump sources for amplifiers and solid-state lasers, for use in coherent communication systems, and now as TLs potentially for integrated optoelectronics. The subject of this work is to expand the future applications of the transistor laser by demonstrating the theoretical background, process development and device design necessary to achieve singlelongitudinal- mode operation in a three-port transistor laser. A third-order distributed feedback surface grating is fabricated in the top emitter AlGaAs confining layers using soft photocurable nanoimprint lithography. The device produces continuous wave laser operation with a peak wavelength of 959.75 nm and threshold current of 13 mA operating at -70 °C. For devices with cleaved ends a side-mode suppression ratio greater than 25 dB has been achieved.