The design of industrial parts feeders is a long, trial-and-error process that can take months-even for the design of feeders that orient only one type of part. This paper describes the use of dynamic simulation to expedite the design and prototyping of parts feeders. We give probabilistic descriptions of vibratory parts feeding behavior and we present a comparison between simulated design experiments and physical experiments done using a real industrial vibratory bowl feeder. Our findings show strong similarities between the results of the two types of experiments. We believe that dynamic simulation is a promising approach for expediting the parts feeder analysis and design process.
The development and deployment of a large-scale, wide-area multicast infrastructure in the Internet has enabled a new family of multi-party, collaborative applications. Several of these applications, such as multimedia slide shows, shared whiteboards, and large-scale multi-player games, require reliable multicast transport, yet the underlying multicast infrastructure provides only a best-effort delivery service. A difficult challenge in the design of efficient protocols that provide reliable service on top of the best-effort multicast service is to maintain acceptable performance as the protocol scales to very large session sizes distributed across the wide area. The Scalable, Reliable Multicast (SRM) protocol [6] is a receiver-driven scheme based on negative acknowledgments (NACKs) reliable multicast protocol that uses randomized timers to limit the amount of protocol overhead in the face of large multicast groups, but the behavior of SRM at extremely large scales is not well-understood.In this paper, we use analysis and simulation to investigate the scaling behavior of global loss recovery in SRM. We study the protocol's control-traffic overhead as a function of group size for various topologies and protocol parameters, on a set of simple, representative topologies --- the cone (a variant of a clique), the linear chain, and the binary tree. We find that this overhead, as a function of group size, depends strongly on the topology: for the cone, it is always linear; for the chain, it is between constant and logarithmic; and for the tree, it is between constant and linear.
The efficient generation of surface plasmons from free space optical waves is still an open problem in the field. Here we present a methodology and optimized design for a grating coupler. The photo-excitation of surface plasmons at an Ag-SiO2 interface is numerically demonstrated to yield greater than 50% coupling from a Gaussian beam into surface plasmon voltages and currents.
In a digital communications system, data is transmitted from one location to another by mapping bit sequences to symbols, and symbols to sample functions of analog waveforms. The analog waveform passes through a bandlimited (possibly time-varying) analog channel, where the signal is distorted and noise is added. In a conventional system the analog sample functions sent through the channel are weighted sums of one or more sinusoids; in a chaotic communications system, the sample functions are segments of chaotic waveforms. At the receiver, the symbol may be recovered by means of coherent detection, where all possible sample functions are known, or by noncoherent detection, where one or more characteristics of the sample functions are estimated. In a coherent receiver, synchronization is the most commonly used technique for recovering the sample functions from the received waveform. These sample functions are then used as reference signals for a correlator. Synchronization-based receivers have advantages over noncoherent ones in terms of noise performance and bandwidth efficiency. These advantages are lost if synchronization cannot be maintained, for example, under poor propagation conditions. In these circumstances, communication without synchronization may be preferable. The main aim of this paper is to provide a unified approach for the analysis and comparison of conventional and chaotic communications systems. In Part I, the operation of sinusoidal communications techniques is surveyed in order to clarify the role of synchronization and to classify possible demodulation methods for chaotic communications
ADVERTISEMENT RETURN TO ISSUEPREVCommunicationNEXTPalladium-Catalyzed Kinetic and Dynamic Kinetic Asymmetric Transformation of 5-Acyloxy-2-(5H)-furanone. Enantioselective Synthesis of (−)-Aflatoxin B LactoneBarry M. Trost and F. Dean TosteView Author Information Department of Chemistry Stanford University Stanford, California 94305-5080 Cite this: J. Am. Chem. Soc. 1999, 121, 14, 3543–3544Publication Date (Web):March 25, 1999Publication History Received28 December 1998Published online25 March 1999Published inissue 1 April 1999https://pubs.acs.org/doi/10.1021/ja9844229https://doi.org/10.1021/ja9844229rapid-communicationACS PublicationsCopyright © 1999 American Chemical SocietyRequest reuse permissionsArticle Views3138Altmetric-Citations143LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InRedditEmail Other access optionsGet e-AlertscloseSupporting Info (1)»Supporting Information Supporting Information SUBJECTS:Aromatic compounds,Cyclization,Enantioselective synthesis,Kinetics,Stereoselectivity Get e-Alerts
Reactions of the cationic ruthenium silylene complexes [Cp*(PiPr3)Ru(H)2(═SiRR′)][B(C6F5)4] (R = Mes, R′ = H, 1; R = R′ = Ph, 2) with alkenes, alkynes, ketones, and Lewis bases were explored. Addition of 1-hexene, 3,3-dimethylbut-1-ene, styrene, and cyclopentene to 1 afforded the disubstituted silylene products [Cp*(PiPr3)Ru(H)2(═SiMesR)][B(C6F5)4] (R = Hex, 3; R = CH2CH2tBu, 4; R = CH2CH2Ph, 5; R = C5H9, 6). Analogous reactions with 2-butyne and 3,3-dimethylbut-1-yne yielded the vinyl-substituted silylene complexes [Cp*(PiPr3)Ru(H)2(═Si(CR═CHR′)Mes)][B(C6F)4] (R = R′ = Me, 7; R = H, R′ = tBu, 8). Complex 1 undergoes reactions with ketones to give the heteroatom-substituted silylene complexes [Cp*(PiPr3)Ru(H)2(═Si(OCHPhR)Mes)][B(C6F)4] (R = Ph, 9; R = Me, 10). Interestingly, complexes 3–8 display a weak interaction between the hydride ligands and the silicon center, while 9 and 10 exhibit a relatively large interaction (as determined by 2JSiH values). The reaction of isocyanates with 1 resulted in the silyl complexes [Cp*(PiPr3)Ru(H)2(Si(Mes)[κ2-O(CH)(NC6H4R)][B(C6F5)4] (R = H, 11; R = CF3, 12), and an intermediate in this transformation is observed. Complex 2 was subjected to various Lewis bases to yield the base-stabilized silylene complexes [Cp*(PiPr3)Ru(H)2(SiPh2·L)][B(C6F)4] (L = DMAP, 13; L = Ph2CO, 14; L = PhCONH2, 15; L = NHMePh, 16, L = tBuSONH2, 18), and the reaction of 1 with NHMePh gave [Cp*(PiPr3)Ru(H)2(SiHMes·NHMePh)][B(C6F)4].
A fundamental problem in computer vision is that of inferring the intrinsic, 3D structure of the world from flat, 2D images of that world. Traditional methods for recovering scene properties such as shape, reflectance, or illumination rely on multiple observations of the same scene to overconstrain the problem. Recovering these same properties from a single image seems almost impossible in comparison-there are an infinite number of shapes, paint, and lights that exactly reproduce a single image. However, certain explanations are more likely than others: surfaces tend to be smooth, paint tends to be uniform, and illumination tends to be natural. We therefore pose this problem as one of statistical inference, and define an optimization problem that searches for the most likely explanation of a single image. Our technique can be viewed as a superset of several classic computer vision problems (shape-from-shading, intrinsic images, color constancy, illumination estimation, etc) and outperforms all previous solutions to those constituent problems.