Radiation-Induced graft copolymerization of methacrylic acid onto polypropylene fibers. V. Mechanical properties

Mechanical properties of polypropylene-g-poly(methacrylic acid) fibers, prepared by graft copolymerization of methacrylic acid onto polypropylene fiber using simultaneous gamma ray irradiation technique, were evaluated. In general, an improvement in the mechanical behavior of the polypropylene fiber by grafting was observed. Denier and initial modulus of the fiber showed a linear increase with the percent graft, and elongation showed an opposite trend. The results have been explained in terms of reinforcing effect of poly(methacrylic acid) grafts and reduction in the segmental mobility of the polymeric chains. Tenacity also increases up to certain graft level, beyond which a sharp decrease occurs, probably due to the influence on the compactness of the macromolecular chains with the further grafting.     

Quality-of-Service Based Protection in MPLS Control WDM Mesh Networks

Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization.     

Complex variable formulations for usual and hypersingular integral equations for potential problems — with applications to corners and cracks

This paper first presents an unified discussion of real and complex boundary integral equations (BIEs) for two-dimensional potential problems. Relationships between real and complex formulations, for both usual and hypersingular BIEs, are discussed. Potential problems in bounded as well as in unbounded domains are of concern in this work. Quantities of particular interest are derivatives of the primary field that exhibit discontinuities across corners, as well as stress intensity factors at the tips of mode III cracks. The latter problem in an application of a recent generalization of the well-known Plemelj-Sokhotsky formulae. Numerical implementations and results for interior problems in bounded domains, as well as for crack problems in unbounded domains, are presented and discussed.C. Y. Hui is supported by the Material Science Center at Cornell University, which is funded by the National Science Foundation (DMR-MRL program). S Mukherjee acknowledges partial support from NSF grant number ECS-9321508 to Cornell University.     

Embedded deterministic test for low-cost manufacturing

You have probably heard that BIST takes too long and its fault coverage is low, and that deterministic test requires too many patterns. This article shows how on-chip compression and decompression techniques provide high fault coverage with low test times.     

Simplified steady-state model of an SCR-inverter-basedload-commutated commutatorless series motor

This paper presents a simplified analytical model of a silicon-controlled-rectifier based, load-commutated inverter driven, commutatorless series motor to predict its speed-current, torque-current and torque-speed characteristics. The model has been formulated, keeping in view the steady state equivalent circuit of a conventional DC series motor. The proposed analytical expressions relating torque and current with speed are found to follow an inverse law and that relating torque and current is found to be parabolic, as is expected in a "series" machine. The drive has been implemented, loaded with a DC generator and experimentally similar characteristics have been obtained, as predicted by the analytical model. The characteristics obtained experimentally are seen to follow the ones, predicted by the analytical model closely     

Node and element resequencing using the Laplacian of a finite element graph: Part I—General concepts and algorithm

A Finite Element Graph (FEG) is defined here as a nodal graph (G), a dual graph (G*), or a communication graph (G˙) associated with a generic finite element mesh. The Laplacian matrix ( L (G), L (G*) or L (G˙)), used for the study of spectral properties of an FEG, is constructed from usual vertex and edge connectivities of a graph. An automatic algorithm, based on spectral properties of an FEG (G, G* or G˙), is proposed to reorder the nodes and/or elements of the associated finite element mesh. The new algorithm is called Spectral PEG Resequencing (SFR). This algorithm uses global information in the graph, it does not depend on a pseudoperipheral vertex in the resequencing process, and it does not use any kind of level structure of the graph. Moreover, the SFR algorithm is of special advantage in computing environments with vector and parallel processing capabilities. Nodes or elements in the mesh can be reordered depending on the use of an adequate graph representation associated with the mesh. If G is used, then the nodes in the mesh are properly reordered for achieving profile and wavefront reduction of the finite element stiffness matrix. If either G* or G˙ is used, then the elements in the mesh are suitably reordered for a finite element frontai solver, A unified approach involving FEGs and finite element concepts is presented. Conclusions are inferred and possible extensions of this research are pointed out. In Part II of this work,¹ the computational implementation of the SFR algorithm is described and several numerical examples are presented. The examples emphasize important theoretical, numerical and practical aspects of the new resequencing method.