Comprehensive performance modeling and analysis of multicasting in optical networks

Multicasting is becoming increasingly important in today's networks. In optical networks, optical splitters facilitate the multicasting of optical signals. By eliminating the transmission of redundant traffic over certain links, multicasting can improve network performance. However, in a wavelength-division multiplexed (WDM) optical network, the lack of wavelength conversion necessitates the establishment of a single multicast circuit (light-tree) on a single wavelength. On the other hand, establishing several unicast connections (lightpaths) to satisfy a multicast request, while requiring more capacity, is less constrained in terms of wavelength assignment. The objective of the paper is to evaluate the tradeoff between capacity and wavelength continuity in the context of optical multicasting. To this end, we develop accurate analytical models with moderate complexity for computing the blocking probability of multicast requests realized using light-trees, lightpaths, and combinations of light-trees and lightpaths. Numerical results indicate that a suitable combination of light-trees and lightpaths performs best when no wavelength conversion is present.     

HotSpot: a compact thermal modeling methodology for early-stage VLSI design

This paper presents HotSpot-a modeling methodology for developing compact thermal models based on the popular stacked-layer packaging scheme in modern very large-scale integration systems. In addition to modeling silicon and packaging layers, HotSpot includes a high-level on-chip interconnect self-heating power and thermal model such that the thermal impacts on interconnects can also be considered during early design stages. The HotSpot compact thermal modeling approach is especially well suited for preregister transfer level (RTL) and presynthesis thermal analysis and is able to provide detailed static and transient temperature information across the die and the package, as it is also computationally efficient.     

Optimal temperature policies for catalytic transport reactors under periodic operation

The influence of inlet gas concentration cycling on the optimal temperature policy of catalytic transport reactors is studied theoretically. The model considered is based on plug flow of gas and catalyst particles with negligible interand intra-particle diffusional resistances and concentration dependent deactivation kinetics. To utilise the concentration of the reactant and the activity of the deactivating catalyst fully a proper temperature sequence along the reactor is needed. Thus, a general optimal temperature policy using the continuous minimum principle is derived for the reactor under periodic operation. The model equations are solved analytically for gas concentration, activity and temperature profiles. Resonance behaviour (maximum in conversion with pulse width) is obtained using the optimal temperature policy for certain sets of parameters. The effects of activation energy groups, reaction and deactivation constant groups and inlet temperature on the optimal temperature policy under periodic operation are evaluated. In all cases an improvement in conversion with the optimal temperature policy under periodic operation over that with an isothermal policy under periodic operation is obtained. A suboptimal policy, comprising constant temperature over different reactor sections, which is useful for implementation purposes is also discussed.     

Fine grinding of silicon wafers: a mathematical model for the chuck shape

Fine grinding of silicon wafers is a patented technology to manufacture super flat semiconductor wafers cost-effectively. Two papers on fine grinding were previously published in this journal, one discussed its uniqueness and special requirements, and the other presented the results of a designed experimental investigation. As a follow up, this paper presents a study aiming at overcoming one of the technical barriers that have hindered the widespread application of this technology, namely, the difficulty and uncertainty in chuck preparation. Although the chuck shape is critically important in fine grinding, there are no standard procedures for its preparation. Furthermore, the information on the relation between the set-up parameters and the resulting chuck shape is not readily available. In this paper, a mathematical model for the chuck shape is first developed. Then the model is used to predict the relations between the chuck shape and the set-up parameters. Finally, the results of the pilot experiments to verify the model are discussed.     

Cancer predisposition, radiosensitivity and the risk of radiation-induced cancers. IV. Prediction of risks in relatives of cancer-predisposed individuals

Individuals carrying cancer-predisposing germline mutations are known to be at a higher risk for cancers than those who do not carry them. This is also true of their biological relatives because they have a higher probability of being carriers of such mutant genes than unrelated individuals in the population. Further, there are now sufficient grounds for assuming that cancer-predisposed individuals may also be at a higher risk for cancers induced by ionizing radiation. In our earlier work, we examined the impact of this heterogeneity (with respect to cancer predisposition and radiosensitivity differentials) on risks of radiation-induced cancer at the population level. This paper is focused on the question of risks of radiation-induced cancer in relatives of cancer-predisposed individuals. Using an autosomal dominant model of cancer predisposition and radiosensitivity developed earlier and applying it to breast cancer risks associated with mutations in the BRCA1 gene, we show that: (1) The risk ratio (i.e. the ratio of risk of radiation-induced cancer in relatives to that in unrelated individuals) in the population increases with the degree of biological relatedness of the relative, being higher for close than for distant relatives; incomplete penetrance of the mutant gene "dilutes" this risk ratio. (2) The proportion of excess radiation-induced cancers in relatives (i.e. the attributable fraction) is higher than in unrelated individuals. (3) In relatives, the proportion of excess cancers due to radiosensitivity differentials alone depends on the strength of predisposition, the radiosensitivity differentials assumed, the radiation dose, the proportion of cancers due to predisposition, the mutant gene frequency and the penetrance of the mutant gene. This is in contrast to the situation for unrelated individuals, for whom the above-mentioned proportion is dependent on the first three but not on the last three of these factors. Further, even when the proportion of excess cancers is small, most of it is due to radiosensitivity differential alone both in unrelated individuals and in relatives. (4) For values of predisposition strength and radiosensitivity differential <10, even when the estimated frequency of a mutant BRCA1 gene is 0.0047 and the proportion of breast cancers due to these mutations is 38% (as is the case for Ashkenazi Jewish women under age 30), the increase in breast cancer risks is only marginal even for first-degree relatives. (5) These findings support the conclusion that increases in radiation risks to relatives (compared to those in unrelated individuals), to be detectable epidemiologically, will occur only when the mutant alleles are common and the strength of predisposition and radiosensitivity differentials are conjointly dramatic.     

Symbolic modular deadlock analysis

Methods in object-oriented concurrent libraries often encapsulate internal synchronization details. As a result of information hiding, clients calling the library methods may cause thread safety violations by invoking methods in an unsafe manner. This is frequently a cause of deadlocks. Given a concurrent library, we present a technique for inferring interface contracts that specify permissible concurrent method calls and patterns of aliasing among method arguments. In this work, we focus on deriving contracts that guarantee deadlock-free execution for the methods in the library. The contracts also help client developers by documenting required assumptions about the library methods. Alternatively, the contracts can be statically enforced in the client code to detect potential deadlocks in the client. Our technique combines static analysis with a symbolic encoding scheme for tracking lock dependencies, allowing us to synthesize contracts using a SMT solver. Additionally, we investigate extensions of our technique to reason about deadlocks in libraries that employ signaling primitives such as wait-notify for cooperative synchronization. Our prototype tool analyzes over a million lines of code for some widely-used Java libraries within an hour, thus demonstrating its scalability and efficiency. Furthermore, the contracts inferred by our approach have been able to pinpoint real deadlocks in clients, i.e. deadlocks that have been a part of bug-reports filed by users and developers of client code.     

MELOC-X: extended memory and location optimized caching for large mobile ad hoc networks of UAVs

Effective caching in mobile ad hoc network increases data availability. However, caching at strategic locations with reduced (controlled) number of copies is needed for many military applications involving UAVs to address security concerns, less maintenance overhead and maintaining availability. In general, existing cooperative caching approaches are deficient in finding the reduced number of strategic cache locations. One such technique to reduce the number of strategic cache locations without affecting the efficacy of data access for a small network topology of UAVs is called “memory and location optimized caching scheme (MELOC)”. However, having a single broker and metadata broadcast across the whole network in MELOC lead to severe performance hindrance in case of a large network topology of UAVs. Moreover, frequent cache replacements due to a change in network topology do not favor cache hit and bandwidth conservation in case of large mobile networks consisting of UAVs. In this paper, we design and evaluate an extended version of “MELOC called MELOC-X”, which suits large network topologies of UAVs by overcoming the above challenges. Our comparison with one such recent scheme with similar objectives showcased a significant improvement in performance. We also evaluate the impact of this scheme with respect to different metrics including the average number of hops, the average roundtrip time (i.e., average query latency), cache hits and mobility to access cached data through extensive simulations.     

Path curvature of a geared seven-bar mechanism

This paper presents a graphical technique to locate the center of curvature of the path traced by a coupler point of a planar, single-degree-of-freedom, geared seven-bar mechanism. Since this is an indeterminate mechanism then the pole for the instantaneous motion of the coupler link; i.e., the point coincident with the instantaneous center of zero velocity for this link, cannot be obtained from the Aronhold–Kennedy theorem. The graphical technique that is presented in the first part of the paper to locate the pole is believed to be an important contribution to the kinematics literature. The paper then focuses on the graphical technique to locate the center of curvature of the path traced by an arbitrary coupler point. The technique begins with replacing the seven-bar mechanism by a constrained five-bar linkage whose links are kinematically equivalent to the second-order properties of motion. Then three kinematic inversions are investigated and a four-bar linkage is obtained from each inversion. The motion of the coupler link of the final four-bar linkage is equivalent up to and including the second-order properties of motion of the coupler of the geared seven-bar. Then the center of curvature of the path traced by an arbitrary coupler point can be obtained from existing techniques, such as the Euler–Savary equation. An analytical method, referred to as the method of kinematic coefficients, is presented as an independent check of the graphical technique.