Powder Deposition in Three Parallel-Oriented Dies of Different Shapes

Uniformity of bulk density distribution during the die filling process is required to minimize quality problems, such as distortion and cracking, for powder compacts. Understanding the die filling process is necessary in ensuring a uniform powder deposition. The second-generation pressure deposition tester (PDT-II) was used to investigate the deposition process and final pressure distribution of powder filling in toroidal, cylindrical, and E-shaped dies. All tests were conducted using a spray-dried free-flowing granular powder. The results indicated that for toroidal dies: (1) the area around 0° orientation (the leeward end) had the highest pressure values (1186.7 to 2498.0 Pa), with the average pressure values of the remaining area 353.7-648.0 Pa; (2) the pressure distribution was symmetrical about the centerline parallel to the feed shoe movement direction; (3) the highest feed shoe speed (500 mm/s) led to the most nonuniform pressure distribution among the three speeds; (4) higher feed shoe speed did not always result in higher final pressure values; and (5) the right die tended to have higher final pressure values (215.0 to 2498.0 Pa) than the center die (95.4 to 2052.5 Pa). For E-shaped dies: (1) the final pressure values of the middle leg (308.9 to 760.7 Pa) were higher than those of the left and the right legs (148.9 to 530.3 Pa); (2) the area along the backside had the highest final pressure value (1054.6 to 1303.8 Pa); (3) the pressure distribution was symmetrical about the centerline parallel to the feed shoe movement direction; and (4) neither the center die nor the right die always had higher pressure values than the other one at all locations. Comparison between cylindrical and toroidal dies indicated that: (1) neither of the two die shapes (cylinder and toroid) led to consistently higher or lower final pressure values at all locations and (2) for all three feed shoe speeds, the toroidal die had higher average final pressure values in the 0° orientation.     

A perceptually motivated three-component image model-part II:applications to image compression

For past I see ibid., vol.4, no.4, p.405 (1995). The use of the image model of Part I is investigated in the context of image compression. The model decomposes the image into a primary component that contains the strong edge information, a smooth component that represents the background slow-intensity variations, and a texture component that contains the textures. The primary component, which is known to be perceptually important, is encoded separately by encoding the intensity and geometric information of the strong edge brim contours. Two alternatives for coding the smooth and texture components are studied: entropy-coded adaptive DCT and entropy-coded subband coding. It is shown via simulations that the proposed schemes, which can be thought of as a hybrid of waveform coding and feature-based coding techniques, result in both subjective and objective performance improvements over several other image coding schemes and, in particular, over the JPEG continuous-tone image compression standard. These improvements are especially noticeable at low bit rates. Furthermore, it is shown that a perceptual tuning based on the contrast-sensitivity of the human visual system can be used in the DCT-based scheme, which in conjunction with the three-component model, leads to additional subjective performance improvements.     

Hierarchical production control for a flow shop with dynamic setup changes and random machine breakdowns

In this paper, we study a manufacturing system consisting of two machines separated by two intermediate buffers, and capable of producing two different products. Each product requires a constant processing time on each of the machines. Each machine requires a constant non-negligible setup change time from one product to the other. The demand rate for each product is considered to be piecewise constant. Each machine undergoes failure and repair. The time-to-failure and time-to-repair are exponentially distributed random variables. The setup change and processing operations are resumable. We model our system as a continuous time, continuous flow process. An optimal control problem is formulated for the system to minimize the total expected discounted cost over an infinite horizon. To determine the optimal control policy structure, a discrete version of the problem is solved numerically using a dynamic programming formulation with a piecewise linear penalty function. A real-time control algorithm is then developed with the objective of maintaining low work-in-process inventory and keeping the production close to the demand. The algorithm uses a hierarchical control structure to generate the loading times for each product on each machine in real time and to respond to random disruptions in the system. The system is simulated using this algorithm to study its performance. The performance of the algorithm is also compared to alternative policies.     

Heading towards an advanced signalling system for multimedia,multiparty services in broadband ISDN

Introduction of the broadband integrated services digital network (B-ISDN) will enable network users to make use of advanced multimedia, multiparty services. With this aim in view, RACE II project R2044, MAGIC, is investigating long-term signalling requirements, architecture and protocols for B-ISDN. New service concepts are being developed in MAGIC which will provide more flexibility when compared to narrowband ISDN (N-ISDN). The service requirements and other signalling requirements, such as the separation between call and associated connections at the network-node interface, are used to determine the distribution of functions over the network. The signalling protocols which are used to exchange the signalling information are subsequently developed. These signalling protocols are simulated to prove the performance and the feasibility of call handling concepts     

Experimental and theoretical studies on a distributed temperaturesensor based on Brillouin scattering

Results are reported from recent research on the use of the Brillouin gain/loss mechanism for distributed sensing. A theoretical model of the interaction of the pulsed and CW beams is described and compared with experiments. Results from a system with a 51 km sensing length are presented. We finally investigate issues related to the variation within the sensing fiber of the polarizations of the two beams     

Simulation study of peak junction temperature and power limitationof AlGaAs/GaAs HBTs under pulsed and CW operation

The authors have used a 3-D transmission-line matrix (TLM) modeling method to study the junction temperature distribution and power limitation of device geometries with multiple embedded heat sources. Peak values of the junction temperature against the dissipated power density under both pulsed and CW operation are presented for a typical power AlGaAs/GaAs HBT structure. These data should facilitate the rapid determination of junction temperature for a given output power, which is of paramount importance in power device design     

节流式差压流量计的发展和现状

文章介绍节流式差压流量计的特点及标准化进程，煤气流量测量中存在的难点以及正在试图解决的途径。     

AN improved method of optimization for electrical machines

Methods of optimizing the design of electrical machines are discussed. The augmented Lagrangian multiplier method is described, and an algorithm for this method is introduced. The method is compared with the more familiar exterior penalty function method using, as an example, the cost optimization of permanent magnetic variable-speed drive motors. The improved method is shown to be superior, both in its ability to reach an optimum consistently and in the number of required iterations     

Double-step generation of ellipses

The principle of double-step incremental generation of nonparametric curves on a discrete plane is used to develop a double-step algorithm for scan converting ellipses in sixteen separate segments. The algorithm iterates only half as many times as current algorithms, while each iteration demands the same number of operations or slightly fewer operations than M. Pitteway's (1967, 1985) algorithm (previously the fastest one). This marked gain in the speed of scan conversion is due to the fact that the middle pixel in a two-step increment is obtained without computation