Cubic–Quartic Optical Solitons with Differential Group Delay for Kudryashov’s Model by Extended Trial Function

Journal of Communications Technology and Electronics - This paper implements mathematically rigorous extended trial function algorithm to address cubic–quartic optical solitons in...     

Magnetization reversal mechanism of chemically synthesized linear chains of α-Fe nanospheres

Journal of Materials Science - We report upon synthesis of stable chains of magnetically aligned zero-valent α-Fe nanoparticles and investigation of their magnetization reversal mechanism. The...     

Landcover classification in MRF context using Dempster-Shafer fusion for multisensor imagery.

This work deals with multisensor data fusion to obtain landcover classification. The role of feature-level fusion using the Dempster-Shafer rule and that of data-level fusion in the MRF context is studied in this paper to obtain an optimally segmented image. Subsequently, segments are validated and classification accuracy for the test data is evaluated. Two examples of data fusion of optical images and a synthetic aperture radar image are presented, each set having been acquired on different dates. Classification accuracies of the technique proposed are compared with those of some recent techniques in literature for the same image data.     

Chemical modification of metallocene‐based polyethylene–octene elastomer through solution grafting of acrylic acid and its effect on the physico‐mechanical properties

In the present work, the metallocene‐based polyethylene–octene elastomer (POE) was chemically modified by solution grafting of acrylic acid in presence of benzoyl peroxide. The relative proportions of graft and gel formation were optimized through %weight gain, Fourier Transform infrared spectroscopy, elemental analysis and proton nuclear magnetic resonance spectroscopy. The gel formation in the POE matrix was found to be the prime competitor. The effect of grafting at its maximum level on various physicomechanical properties was thoroughly investigated, using X‐ray diffraction analysis, differential scanning calorimetry, mechanical, dynamic mechanical, and thermogravimetric analysis. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 2007     

Impact of bounded delay on throughput in multi-hop networks

This paper presents a closed form solution relating to the impact of bounded delays on throughput in multi-hop networks. In contrast to contemporary literature that largely focuses on average delay to estimate the Quality of Service, our model focuses on an upper bound of delay, referred to as delay threshold in this paper. Traffic that exceeds the delay threshold is treated as lost throughput. The results obtained can be used in scaling resources in a multi-hop network for attaining specified levels of throughput under different thresholds of acceptable delays. Both single-hop and multi-hop transfers are addressed. The theoretical analysis presented in this paper is further corroborated by simulation. The findings presented in this paper will be very relevant to multi-hop network applications where received data that are older than a specified threshold period are not relevant and must be discarded.     

Simple N‐Heterocyclic Carbenes as Ligands in Ullmann‐Type Ether and Thioether Formations

A simple N‐heterocyclic carbene (NHC) derived from 1‐methyl‐3‐ethylimidazolium tetrafluoroborate was found to be an efficient ligand for a range of copper‐catalyzed cross‐coupling reactions, leading to the formation of aromatic ethers and thioethers.

     

Performance Assessment of a New Radiation Microsensor Based 4H-SiC trench MOSFET: A Simulation Study

Silicon - The MOSFET has been widely used as a detector for high-energy radiations in areas like nuclear energy and medical treatments. Generally, the shift in threshold voltage of the...     

Direct Ranking for Voltage Contingency Selection

It is now commonly accepted that for security assessment of a power system, the most efficient and practical strategy is to deal with the problem in two stages. First in contingency selection, those potentially critical contingency cases are ranked by the severity of their impacts on a system. Then in contingency analysis, detailed AC power flows are applied only to the most dangerous cases appearing on top of the ranked list. In the past decade, the problem of ranking outage cases in the order of decreasing severity has attracted a lot of intensive studies, and many efficient and reliable algorithms were developed. But most of these techniques can only be applied to MW limit security problems. On the other hand, voltage problems were also found to be a very important aspect of security assessment. It has become the target of many research projects. Because the MVAR-voltage problem involves a much more complicated model than the MW-angle problem, significant obstacles were experienced in developing ranking algorithms for voltage security monitoring, making it an area where further study is still required. Almost all contingency ranking algorithms employ a scalar performance index to represent a global severity of voltage disturbance after a contingency event. The scalar performance index can be viewed as a weighted distance in voltage space measuring the post contingency voltage profile against specified voltage limits.     

Performance improvement of self-adaptive evolutionary methods with a dynamic lower bound

Recent research on self-adaptive evolutionary programming (EP) methods evidenced the problem of premature convergence. Self-adaptive evolutionary programming methods converge prematurely because their object variables evolve more slowly than do their strategy parameters, which subsequently leads to a stagnation of object variables at a non-optimum value. To address this problem, a dynamic lower bound has been proposed, which is defined here as the differential step lower bound (DSLB) on the strategy parameters. The DSLB on an object variable depends on its absolute distance from the corresponding object variable of the best individual in the population pool. The performance of the self-adaptive EP algorithm with DSLB has been verified over eight different test functions of varied complexities.