A neural network model for the wire bonding process

A crucial step in manufacturing microcircuits is the wire bonding process in which a very thin gold wire must be formed to connect two surfaces in the microcircuit. The quality of the wire bond can be measured by visual inspection and a pull test—both of which are high-reliability, high-cost approaches to statistical process control. Westinghouse wanted to develop a high-reliability, low-cost quality assurance system. In this paper, we report on a year-long study to construct a neural network model that is capable of predicting the quality of wire bonds. The results of our modeling efforts reveal that neural networks are useful tools for statistical process control problems.     

Egg Thiamine Status of Lake Ontario Salmonines 1995–2004 with Emphasis on Lake Trout

Alewives (Alosa pseudoharengus), the major prey fish for Lake Ontario, contain thiaminase. They are associated with development of a thiamine deficiency in salmonines which greatly increases the potential for developing an early mortality syndrome (EMS). To assess the possible effects of thiamine deficiency on salmonine reproduction we measured egg thiamine concentrations for five species of Lake Ontario salmonines. From this we estimated the proportion of families susceptible to EMS based on whether they were below the ED20, the egg thiamine concentration associated with 20% mortality due to EMS. The ED20s were 1.52, 2.63, and 2.99 nmol/g egg for Chinook salmon (Oncorhynchus tshawytscha), lake trout (Salvelinus namaycush), and coho salmon (Oncorhynchus kisutch), respectively. Based on the proportion of fish having egg thiamine concentrations falling below the ED20, the risk of developing EMS in Lake Ontario was highest for lake trout, followed by coho (O. kisutch), and Chinook salmon, with the least risk for rainbow trout (O. mykiss). For lake trout from western Lake Ontario, mean egg thiamine concentration showed significant annual variability during 1994 to 2003, when the proportion of lake trout at risk of developing EMS based on ED20 ranged between 77 and 100%. Variation in the annual mean egg thiamine concentration for western Lake Ontario lake trout was positively related (p < 0.001, r² = 0.94) with indices of annual adult alewife biomass. While suggesting the possible involvement of density-dependent changes in alewives, the changes are small relative to egg thiamine concentrations when alewife are not part of the diet and are of insufficient magnitude to allow for natural reproduction by lake trout.     

Effect of the type of nylon chain‐end on the compatibilization of PP/PP‐GMA/nylon 6 blends

Polyamide and polypropylene (PP) are two important classes of commercial polymers; however, their direct mixing leads to incompatible blends with poor properties. Polypropylene functionalized with glycidyl methacrylate (PP‐GMA) was used as a compatibilizer in blends of PP and nylon 6, because of the possible reaction of ? NH₂ and ? COOH groups with the epoxide group of GMA. Two types of nylon 6 with different ratios between ? NH₂ and ? COOH groups were used. The one with higher concentration of ? COOH groups was less compatible with PP in a binary blend. When PP‐GMA was used as a compatibilizer, a better dispersion of nylon in the PP matrix was obtained together with better mechanical properties for both nylons used in this work. © 2001 Society of Chemical Industry     

Hypercube sandwich approach to conferencing

This paper presents a novel cascaded conference network that provides distributed processing and signal transmission among members of disjoint sets of generic send/receive devices called conferees. It assumes an online request model in which idle groups of conferees may request the formation of a conference interconnection. Once a conference is established, all conferees remain connected until the entire conference is dissolved. The Hypercube Sandwich Network (HSN) consists of two components. A bidirectional permutation network is used for routing purposes to and from a hypercube of special processing elements for the purpose of conference formation. The HSN achieves strictly nonblocking performance for N conferees using O(Nlog N) processing elements, and this is shown to be tight to within a log ^1/4 N factor. Previous constructions required a quadratic number of processing elements for strictly nonblocking performance or could only provide wide-sense nonblocking conferencing. If the stronger requirement is made that the communication delay is logarithmic in the conference size, a simple algorithm is presented for wide-sense nonblocking conferencing in an HSN with O(N log N) processing elements.An earlier version of this paper was presented at the 1995 International Conference on Parallel Processing Techniques and Applications.     

Command governor for constrained switched systems with scheduled model transition dwell times

In this paper, a switched control architecture for constrained control systems is presented. The strategy is based on command governor ideas that are here specialized to ‘optimally’ schedule switching events on the plant dynamics for improving control performance at the expense of low computational burdens. The significance of the method mainly lies in its capability to avoid constraints violation and loss of stability regardless of any configuration change occurrence in the plant/constraint structure. To this end, the concept of model transition dwell time is used within the proposed control framework to formally define the minimum time necessary to enable a switching event under guaranteed conditions on the overall stability and constraint fulfilment. Simulation results on a simple linear system and on a Cessna 182 aircraft model show the effectiveness of the proposed strategy. Copyright © 2017 John Wiley & Sons, Ltd.     

Sensorless supervision of linear dynamical systems: The Feed-Forward Command Governor approach

This paper proposes a novel class of Command Governor (CG) strategies for input and state-related constrained discrete-time LTI systems subject to bounded disturbances in the absence of explicit state or output measurements. While in traditional CG schemes the set-point manipulation is undertaken on the basis of either the actual measure of the state or its suitable estimation, it is shown here that the CG design problem can be solved, with limited performance degradation and with similar properties, also in the case that such an explicit measure is not available. This approach, which will be referred to as the Feed-Forward CG (FF-CG) approach, may be a convenient alternative CG solution in all situations whereby the cost of measuring the state may be a severe limitation, e.g. in distributed or decentralized applications. In order to evaluate the method proposed here, numerical simulations on a physical example have been undertaken and comparisons with the standard state-based CG solution reported.     

Discovery of an Allosteric Ligand Binding Site in SMYD3 Lysine Methyltransferase

SMYD3 is a multifunctional epigenetic enzyme with lysine methyltransferase activity and various interaction partners. It is implicated in the pathophysiology of cancers but with an unclear mechanism. To discover tool compounds for clarifying its biochemistry and potential as a therapeutic target, a set of drug-like compounds was screened in a biosensor-based competition assay. Diperodon was identified as an allosteric ligand; its R and S enantiomers were isolated, and their affinities to SMYD3 were determined (K_D=42 and 84 μM, respectively). Co-crystallization revealed that both enantiomers bind to a previously unidentified allosteric site in the C-terminal protein binding domain, consistent with its weak inhibitory effect. No competition between diperodon and HSP90 (a known SMYD3 interaction partner) was observed although SMYD3–HSP90 binding was confirmed (K_D=13 μM). Diperodon clearly represents a novel starting point for the design of tool compounds interacting with a druggable allosteric site, suitable for the exploration of noncatalytic SMYD3 functions and therapeutics with new mechanisms of action.     

A distributed command governor based on graph colorability theory

In this paper, a distributed command governor (CG) strategy is introduced that, by the use of graph colorability theory, improves the scalability property and the performance of recently introduced distributed noncooperative sequential CG strategies. The latter are characterized by the fact that only 1 agent at a decision time is allowed to update its command, whereas all the others keep applying their previously computed commands. The scalability of these early CG distributed schemes and their performance are limited because the structure of the constraints is not taken into account in their implementation. Here, by exploiting the idea that agents that are not directly coupled by the constraints can simultaneously update their control actions, the agents in the network are grouped into particular subsets (turns). At each time instant, on the basis of a round‐robin policy, all agents belonging to a turn are allowed to update simultaneously their commands, whereas agents in other turns keep applying their previous commands. Then, a turn‐based distributed CG strategy is proposed and its main properties are analyzed. Graph colorability theory is used to determine the minimal number of turns and to distribute each agent in at least a turn. A novel graph colorability problem that allows one to maximize the frequency at which agents can update their commands is proposed and discussed. A final example is presented to illustrate the effectiveness of the proposed strategy.