哈姆雷特、朱丽叶与电子产品设计师

《罗密欧与朱丽叶》是一出悲剧。假如剧中主角不是罗密欧，换成哈姆雷特，那么该剧会是喜剧还是悲剧?剧情多少会这样发展：这个沉思的丹麦人哈姆雷特爱上了朱丽叶。他用辞藻美丽的独自表达他的爱情永恒。为了爱情，他向友人和占垦家讨教。他意识到没有朱丽叶就无法活下去时、便请求他的家族允许自己向朱丽叶表达爱情。因为家庭仇恨，他父亲命令他马上结束这段恋情。     

Optimal allocation of customers in a two server queue withresequencing

The problem of optimal allocation of customers in a two server queue with heterogeneous service rates and resequencing is addressed. The resequencing constraint ensures that the customers leave the system in the order in which they entered it. It is shown that the optimal policy that minimizes the average end-to-end delay of customers in the system is independent of the number of customers in the resequencing buffer. It is also shown that the faster server should be kept busy whenever possible     

Distributed algorithms for multicast path setup in data networks

Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area asynchronous transfer mode (ATM) network, can be modeled as the NP-complete Steiner problem in networks. In this paper, we introduce and evaluate two distributed algorithms for finding multicast trees in point-to-point data networks. These algorithms are based on the centralized Steiner heuristics, the shortest path heuristic (SPH) and the Kruskal-based shortest path heuristic (K-SPH), and have the advantage that only the multicast members and nodes in the neighborhood of the multicast tree need to participate in the execution of the algorithm. We compare our algorithms by simulation against a baseline algorithm, the pruned minimum spanning-tree heuristic that is the basis of many previously published algorithms for finding multicast trees. Our results show that the competitiveness (the ratio of the sum of the heuristic tree's edge weights to that of the best solution found) of both of our algorithms was, on the average, 25% better in comparison to that of the pruned spanning-tree approach. In addition, the competitiveness of our algorithms was, in almost all cases, within 10% of the best solution found by any of the Steiner heuristics considered, including both centralized and distributed algorithms. Limiting the execution of the algorithm to a subset of the nodes in the network results in an increase in convergence time over the pruned spanning-tree approach, but this overhead can be reduced by careful implementation     

Rate-proportional servers: a design methodology for fair queueingalgorithms

Generalized processor sharing (GPS) has been considered as an ideal scheduling discipline based on its end-to-end delay bounds and fairness properties. Until recently, emulation of GPS in a packet server has been regarded as the ideal means of designing a packet-level scheduling algorithm to obtain low delay bounds and bounded unfairness. Strict emulation of GPS, as required in the weighted fair queueing (WFQ) scheduler, however, incurs a time-complexity of O(N) where N is the number of sessions sharing the link. Efforts in the past to simplify the implementation of WFQ, such as self-clocked fair queueing (SCFQ), have resulted in degrading its isolation properties, thus affecting the delay bound. We present a methodology for the design of scheduling algorithms that provide the same end-to-end delay bound as that of WFQ and bounded unfairness without the complexity of GPS emulation. The resulting class of algorithms, called rate-proportional servers (RPSs), are based on isolating scheduler properties that give rise to ideal delay and fairness behavior. Network designers can use this methodology to construct efficient fair-queueing algorithms, balancing their fairness with implementation complexity     

Catalytic reactions in transport-line reactors

The case of an irreversible first order catalytic reaction is considered in a transport-line reactor, via a model which assumes plug flow of both the solid and gas phases, to investigate reactor performance as a function of major operating variables. Under certain fluid mechanical assumptions, a detailed study is made of the effect of catalyst particle size on reactor conversion.     

Graft copolymerization of wool using acrylate monomers. IV. X-ray diffraction studies

X-ray diffraction of wool graft-copolymerized with methylacrylate, ethylacrylate, n-butylacrylate and methylmethacrylate monomers was studied taking equatorial scans using an x-ray diffractometer. The prominent reflection arcs of wool remained unaffected by grafting as was evident from the x-ray photographs. The ratio of the two intensity peak heights increased with the percentage graft-on indicating an increase in the degree of order. The average crystallite size also increased with grafting showing a narrower spectrum of order in the case of grafted fibres.     

Linear electrooptic effect in doped KDP crystals

The dispersion of half wave voltages with wave length and temperature of potassium dihydrogen ortho phosphate (KDP) crystals with additives and dopants like borax, nickel phosphate, manganese phosphate, sodium dihydrogen orthophosphate and potassium arsenate were determined. The refractive index for all the above crystals were found by the modified Rayleigh’s refractometer method. The linear electrooptic coefficients were calculated at various wavelengths of light. The variation of half wave voltage was also studied as a function of concentration of the dopant.     

Modification of poly(vinyl alcohol) fibers by hexamethylene diisocyanate

Poly(vinyl alcohol) multifilament yarn was modified by reaction with hexamethylene diisocyanate. The effects of reaction variables such as time, temperature, concentration of reagents, solvent, and atomosphere were studied. The role of solvent appears to be very important in the reaction. Dimethylformamide, on account of its swelling power, proved better than the solvents benzene, toluene, and dioxane. Physical properties of modified fibers were compared with those of the parent. Moisture regain of the modified samples decreased with increasing add-on percent. The elastic recovery was not improved, and there was little effect of the HMDI treatment on mechanical properties. The thermal stability of poly(vinyl alcohol) modified with diisocyanate with small add-on was slightly improved.     

Studies on the contamination of feed molasses for continuous ethanol production in an immobilised yeast cell reactor

With the present world problem of fossil fuel limitations, alcohol production from renewable resources such as sugar cane molasses, particularly by continuous processes, has become important. In continuous processing, feed contamination problems could become critical. A useful inexpensive technique, which can minimise these problems when molasses is used as the substrate, is to ensure that the time period elapsing after dilution of molasses and before feeding to the reactor is minimal. Experiments were conducted to determine how long the clarified molasses feed solution could be kept under non-sterile conditions without affecting the performance of an immobilised whole cell reactor for alcohol production. For this purpose, the fastest growing contaminant (under the prevailing conditions) present in molasses feed solution was isolated by plating technique. From the initial total number of contaminant microorganisms in the feed solution, and from the experimentally determined generation time of the fastest growing contaminant cells, the safe period of storage of diluted molasses was calculated. This value was in reasonable agreement with the experimental observations.