Caracterização de juntas soldadas em PAW e GTAW de chapas finas em aço maraging 300 submetidas a vários reparos

Pós-graduação em Engenharia Mecânica - FEG

Clearance of p-cresol sulfate and β-2-microglobulin from dialysate by commercially available sorbent technology

Dialysate regeneration by sorbents is an alternative to conventional single-pass dialysis. Little is known about the capacity of sorbents to clear dialysate of “middle molecules” and protein-bound uremic toxins. We studied p-cresol sulfate (PCS) and β-2-microglobulin (β2M) removal from dialysate by a sorbent: 1. PCS (40 mg PCS dissolved in 4 L of fresh dialysate) was recirculated through a sorbent cartridge (SORB Technology, Inc.) for analysis of PCS removal. 2. Spent peritoneal dialysate was recirculated on the “blood” side of a high-flux dialyzer. On the “dialysate” side of the membrane, bicarbonate dialysate was recirculated through a sorbent cartridge. β2M was measured in both streams. Two results are of particular importance for the use of regenerated fluid in chronic dialysis: 1. PCS was virtually completely removed from the dialysate. On average, PCS concentration was reduced to 1.4% of the starting concentration after 60 minutes. PCS extraction across the sorbent was nearly complete at any time. 2. β2M was on average reduced to 14.3% of the starting concentration after 60 minutes. Postsorbent concentrations were consistently below the validated range of the test method. We conclude that PCS and β2M are efficiently removed from the dialysate by commercially available sorbent technology. Spent peritoneal dialysis fluid can be cleared of β2M when circulated against sorbent-regenerated dialysate using a high-flux membrane.

Yellow laser light generation by frequency doubling of the output from a master oscillator fiber power amplifier system

We present a power-scalable approach for yellow laser-light generation based on standard Ytterbium (Yb) doped fibers. To force the cavity to lase at 1154 nm, far above the gain-maximum, measures must be taken to fulfill lasing condition and to suppress competing amplified spontaneous emission (ASE) in the high-gain region. To prove the principle we built a fiber-laser cavity and a fiber-amplifier both at 1154 nm. In between cavity and amplifier we suppressed the ASE by 70 dB using a fiber Bragg grating (FBG) based filter. Finally we demonstrated efficient single pass frequency doubling to 577 nm with a periodically poled lithium niobate crystal (PPLN). With our linearly polarized 1154 nm master oscillator power fiber amplifier (MOFA) system we achieved slope efficiencies of more than 15 % inside the cavity and 24 % with the fiber-amplifier. The frequency doubling followed the predicted optimal efficiency achievable with a PPLN crystal. So far we generated 1.5 W at 1154nm and 90 mW at 577 nm. Our MOFA approach for generation of 1154 nm laser radiation is power-scalable by using multi-stage amplifiers and large mode-area fibers and is therefore very promising for building a high power yellow laser-light source of several tens of Watt.

Cell-cell fusion induced by the Ig3 domain of receptor FGFRL1 in CHO cells.

FGFRL1 is a single-pass transmembrane protein with three extracellular Ig domains. When overexpressed in CHO cells or related cell types, it induces cell-cell fusion and formation of large, multinucleated syncytia. For this fusion-promoting activity, only the membrane-proximal Ig domain (Ig3) and the transmembrane domain are required. It does not matter whether the transmembrane domain is derived from FGFRL1 or from another receptor, but the distance of the Ig3 domain to the membrane is crucial. Fusion can be inhibited with soluble recombinant proteins comprising the Ig1-Ig2-Ig3 or the Ig2-Ig3 domains as well as with monoclonal antibodies directed against Ig3. Mutational analysis reveals a hydrophobic site in Ig3 that is required for fusion. If a single amino acid from this site is mutated, fusion is abolished. The site is located on a β-sheet, which is part of a larger β-barrel, as predicted by computer modeling of the 3D structure of FGFRL1. It is possible that this site interacts with a target protein of neighboring cells to trigger cell-cell fusion.

Abstraction-carrying code: a model for mobile code safety

Proof-Carrying Code (PCC) is a general approach to mobile code safety in which programs are augmented with a certificate (or proof). The intended benefit is that the program consumer can locally validate the certificate w.r.t. the "untrustcd" program by means of a certificate checker a process which should be much simpler, efficient, and automatic than generating the original proof. The practical uptake of PCC greatly depends on the existence of a variety of enabling technologies which allow both proving programs correct and replacing a costly verification process by an efficient checking proceduri on th( consumer side. In this work we propose Abstraction- Carrying Code (ACC), a novel approach which uses abstract interpretation as enabling technology. We argue that the large body of applications of abstract interpretation to program verification is amenable to the overall PCC scheme. In particular, we rely on an expressive class of safely policies which can be defined over different abstract domains. We use an abstraction (or abstract model) of the program computed by standard static analyzers as a certificate. The validity of the abstraction on ihe consumer side is checked in a single pass by a very efficient and specialized abstract-interpreter. We believe that ACC brings the expressiveness, flexibility and automation which is inherent in abstract interpretation techniques to the area of mobile code safety.

Reduced certificates for abstraction-carrying code

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certifícate and its generation is carried out automatically by a fixed-point analyzer. The advantage of providing a (fixedpoint) abstraction to the code consumer is that its validity is checked in a single pass of an abstract interpretation-based checker. A main challenge is to reduce the size of certificates as much as possible while at the same time not increasing checking time. We introduce the notion of reduced certifícate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certifícate in a single pass. Based on this notion, we instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker. We also provide a correct checking algorithm together with sufficient conditions for ensuring its completeness. The experimental results within the CiaoPP system show that our proposal is able to greatly reduce the size of certificates in practice.

Abstraction-carrying code

Proof-Carrying Code (PCC) is a general approach to mobile code safety in which programs are augmented with a certifícate (or proof). The practical uptake of PCC greatly depends on the existence of a variety of enabling technologies which allow both to prove programs correct and to replace a costly verification process by an efñcient checking procedure on the consumer side. In this work we propose Abstraction-Carrying Code (ACC), a novel approach which uses abstract interpretation as enabling technology. We argüe that the large body of applications of abstract interpretation to program verification is amenable to the overall PCC scheme. In particular, we rely on an expressive class of safety policies which can be defined over different abstract domains. We use an abstraction (or abstract model) of the program computed by standard static analyzers as a certifícate. The validity of the abstraction on the consumer side is checked in a single-pass by a very efficient and specialized abstract-interpreter. We believe that ACC brings the expressiveness, flexibility and automation which is inherent in abstract interpretation techniques to the área of mobile code safety. We have implemented and benchmarked ACC within the Ciao system preprocessor. The experimental results show that the checking phase is indeed faster than the proof generation phase, and that the sizes of certificates are reasonable.

On abstraction-carrying code and certificate-size reduction

Abstraction-Carrying Code (ACC) is a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certificate and its generation is carried out automatically by a fixed-point analyzer. The advantage of providing a (fixed-point) abstraction to the code consumer is that its validity is checked in a single pass (i.e., one iteration) of an abstract interpretation-based checker. A main challenge to make ACC useful in practice is to reduce the size of certificates as much as possible, while at the same time not increasing checking time. Intuitively, we only include in the certificate the information which the checker is unable to reproduce without iterating. We introduce the notion of reduced certifícate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certificate in a single pass. Based on this notion, we show how to instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker.

Abstract Interpretation-based verification/certification in the ciaoPP system

CiaoPP is the abstract interpretation-based preprocessor of the Ciao multi-paradigm (Constraint) Logic Programming system. It uses modular, incremental abstract interpretation as a fundamental tool to obtain information about programs. In CiaoPP, the semantic approximations thus produced have been applied to perform high- and low-level optimizations during program compilation, including transformations such as múltiple abstract specialization, parallelization, partial evaluation, resource usage control, and program verification. More recently, novel and promising applications of such semantic approximations are being applied in the more general context of program development such as program verification. In this work, we describe our extensión of the system to incorpórate Abstraction-Carrying Code (ACC), a novel approach to mobile code safety. ACC follows the standard strategy of associating safety certificates to programs, originally proposed in Proof Carrying- Code. A distinguishing feature of ACC is that we use an abstraction (or abstract model) of the program computed by standard static analyzers as a certifícate. The validity of the abstraction on the consumer side is checked in a single-pass by a very efficient and specialized abstractinterpreter. We have implemented and benchmarked ACC within CiaoPP. The experimental results show that the checking phase is indeed faster than the proof generation phase, and that the sizes of certificates are reasonable. Moreover, the preprocessor is based on compile-time (and run-time) tools for the certification of CLP programs with resource consumption assurances.

Abstraction carrying code and resource-awareness

Proof-Carrying Code (PCC) is a general approach to mobile code safety in which the code supplier augments the program with a certifícate (or proof). The intended benefit is that the program consumer can locally validate the certifícate w.r.t. the "untrusted" program by means of a certifícate checker—a process which should be much simpler, eíñcient, and automatic than generating the original proof. Abstraction Carrying Code (ACC) is an enabling technology for PCC in which an abstract model of the program plays the role of certifícate. The generation of the certifícate, Le., the abstraction, is automatically carried out by an abstract interpretation-based analysis engine, which is parametric w.r.t. different abstract domains. While the analyzer on the producer side typically has to compute a semantic fixpoint in a complex, iterative process, on the receiver it is only necessary to check that the certifícate is indeed a fixpoint of the abstract semantics equations representing the program. This is done in a single pass in a much more efficient process. ACC addresses the fundamental issues in PCC and opens the door to the applicability of the large body of frameworks and domains based on abstract interpretation as enabling technology for PCC. We present an overview of ACC and we describe in a tutorial fashion an application to the problem of resource-aware security in mobile code. Essentially the information computed by a cost analyzer is used to genérate cost certificates which attest a safe and efficient use of a mobile code. A receiving side can then reject code which brings cost certificates (which it cannot validate or) which have too large cost requirements in terms of computing resources (in time and/or space) and accept mobile code which meets the established requirements.

Generation of reduced certificates in abstraction-carrying code

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certifícate and its generation is carried out automatically by a fixed-point analyzer. The advantage of providing a (fixedpoint) abstraction to the code consumer is that its validity is checked in a single pass of an abstract interpretation-based checker. A main challenge is to reduce the size of certificates as much as possible while at the same time not increasing checking time. In this paper, we first introduce the notion of reduced certifícate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certifícate in a single pass. Based on this notion, we then instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker.

Reduced certificates for abstraction-carrying code

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certifícate and its generation is carried out automatically by a fixed-point analyzer. The advantage of providing a (fixed-point) abstraction to the code consumer is that its validity is checked in a single pass (i.e., one iteration) of an abstract interpretation-based checker. A main challenge to make ACC useful in practice is to reduce the size of certificates as much as possible while at the same time not increasing checking time. The intuitive idea is to only include in the certifícate information that the checker is unable to reproduce without iterating. We introduce the notion of reduced certifícate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the full certifícate in a single pass. Based on this notion, we instrument a generic analysis algorithm with the necessary extensions in order to identify information which can be reconstructed by the single-pass checker. Finally, we study what the effects of reduced certificates are on the correctness and completeness of the checking process. We provide a correct checking algorithm together with sufficient conditions for ensuring its completeness. Our ideas are illustrated through a running example, implemented in the context of constraint logic programs, which shows that our approach improves state-of-the-art techniques for reducing the size of certificates.

Certificate size reduction in abstraction-carrying code

Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certificate and its generation is carried out automatically by a fixpoint analyzer. The advantage of providing a (fixpoint) abstraction to the code consumer is that its validity is checked in a single pass (i.e., one iteration) of an abstract interpretation-based checker. A main challenge to make ACC useful in practice is to reduce the size of certificates as much as possible while at the same time not increasing checking time. The intuitive idea is to only include in the certificate information that the checker is unable to reproduce without iterating. We introduce the notion of reduced certificate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the fall certificate in a single pass. Based on this notion, we instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker. Interestingly, the fact that the reduced certificate omits (parts of) the abstraction has implications in the design of the checker. We provide the sufficient conditions which allow us to ensure that 1) if the checker succeeds in validating the certificate, then the certificate is valid for the program (correctness) and 2) the checker will succeed for any reduced certificate which is valid (completeness). Our approach has been implemented and benchmarked within the CiaoPP system. The experimental results show t h a t our proposal is able to greatly reduce the size of certificates in practice. To appear in Theory and Practice of Logic Programming (TPLP).

Primary structure and tissue distribution of two novel proline-rich γ-carboxyglutamic acid proteins

Two human cDNAs that encode novel vitamin K-dependent proteins have been cloned and sequenced. The predicted amino acid sequences suggest that both are single-pass transmembrane proteins with amino-terminal γ-carboxyglutamic acid-containing domains preceded by the typical propeptide sequences required for posttranslational γ-carboxylation of glutamic acid residues. The polypeptides, with deduced molecular masses of 23 and 17 kDa, are proline-rich within their putative cytoplasmic domains and contain several copies of the sequences PPXY and PXXP, motifs found in a variety of signaling and cytoskeletal proteins. Accordingly, these two proteins have been called proline-rich Gla proteins (PRGP1 and PRGP2). Unlike the γ-carboxyglutamic acid domain-containing proteins of the blood coagulation cascade, the two PRGPs are expressed in a variety of extrahepatic tissues, with PRGP1 and PRGP2 most abundantly expressed in the spinal cord and thyroid, respectively, among those tissues tested. Thus, these observations suggest a novel physiological role for these two new members of the vitamin K-dependent family of proteins.

The gamma subunit of the Na,K-ATPase induces cation channel activity

The γ subunit of the Na,K-ATPase is a hydrophobic protein of approximately 10 kDa. The γ subunit was expressed in Sf-9 insect cells and Xenopus oocytes to ascertain its role in Na,K-ATPase function. Immunoblotting has shown that the γ subunit is expressed in Sf-9 cells infected with recombinant baculovirus containing the cDNA for the human γ subunit. Confocal microscopy demonstrates that the γ subunit can be delivered to the plasma membrane of Sf-9 cells independently of the other Na,K-ATPase subunits and that γ colocalizes with α1 when these proteins are coexpressed. When Sf-9 cells were coinfected with α1 and γ, antibodies to the γ subunit were able to coimmunoprecipitate the α1 subunit, suggesting that γ is able to associate with α1. The γ subunit is a member of a family of single-pass transmembrane proteins that induces ion fluxes in Xenopus oocytes. Evidence that the γ subunit is a functional component was supported by experiments showing γ-induced cation channel activity when expressed in oocytes and increases in Na+ and K+ uptake when expressed in Sf-9 cells.