Shrink forming prosthetic sockets from memory plastics offers several advantages over existing techniques. The manual skill requirement is reduced relative to drapeforming flat sheet while compared with the Rapidform process, the requirement for a purpose built vacuum forming machine is eliminated. Two methods for producing thermoplastic sockets from heat shrinkable preforms are described. One ...

Today’s electronic and optoelectronic devices are plagued by heat transfer issues. As device dimensions shrink and operating frequencies increase, ever-increasing amounts of thermal energy are being generated in smaller and smaller volumes. As devices shrink to length scales on the order of carrier mean free paths, thermal transport is no longer dictated by the thermal properties of the materia...

We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that an approach inspired by optimal transport allows us to efficiently bound the mixing time of the associated Markov chain. The algorithm is robust and easy to implement, and samples an ”almost” uniform path of length n ...

The experimental &?la on vector meson photoproduction and Compton scattering is analyzed by utilizing the dual absorptive model. The s-channel helicity conserving (SIIC) PO~UXOII exchange amplitude in p” and + photo:>ro&uction is found to shrink with s, in the same way as in Fand K-~-nucleon elastic scattering. The small SEX!-violatjng amplitudzs’are al.so studied. The ratio of amplitudes for 1...

‎an  oriented perfect path double cover (oppdc) of a‎ ‎graph $g$ is a collection of directed paths in the symmetric‎ ‎orientation $g_s$ of‎ ‎$g$ such that‎ ‎each arc‎ ‎of $g_s$ lies in exactly one of the paths and each‎ ‎vertex of $g$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎maxov{'a} and ne{v{s}}et{v{r}}il (discrete‎ ‎math‎. ‎276 (2004) 287-294) conjectured that ...

This account takes to task papers that criticize the definition of a bond path as a criterion for the bonding between the atoms it links by mistakenly identifying it with a chemical bond. It is argued that the notion of a chemical bond is too restrictive to account for the physics underlying the broad spectrum of interactions between atoms and molecules that determine the properties of matter. ...

Iterative-improvement 2-way min-cut partitioning is an important phase in most circuit placement tools, and finds use in many other CAD applications. Most iterative improvement techniques for circuit netlists like the FiducciaMattheyses (FM) method compute the gains of nodes using local netlist information that is only concerned with the immediate improvement in the cutset. This can lead to mis...

Denoising of images corrupted by Gaussian noise using wavelet transform is of great concern in the past two decades. In wavelet denoising method, detail wavelet coefficients of noisy image are thresholded using a specific thresholding function by comparing to a specific threshold value, and then applying inverse wavelet transform, results in denoised image. Recently, an effective image denoisin...

Classical network flow problems do not impose restrictions on the choice of paths on which flow is sent. Only the arc capacities of the network have to be obeyed. This scenario is not always realistic. In fact, there are many problems for which, e.g., the number of paths being used to route a commodity or the length of such paths has to be small. These restrictions are considered in the length-...

The shortest paths problem on weighted directed graphs is one of the basic network optimization problems. Its importance is mainly due to its applications in various areas, such as communication and transportation. Given a source node s in a weighted directed graph G, with n nodes and m arcs, the single-source shortest path problem (SSSP, for short) from s is the problem of finding the minimum ...