This paper studies the problem of light splitter placement (LSP) and wavelength converter placement (WCP) in all-optical WDM networks to enable optimal provisioning of static and dynamic traffic through efficient photonic multicast connections. To solve the LSP-WCP problem under static traffic provisioning, an Integer Linear Programming model is formulated to achieve the optimal solution in the...

Optical properties of InGaN/GaN multi-quantum-well (MQW) structures with a nanolayer of Ag/SiO2 nanoparticle (NP) on top were studied. Modeling and optical absorption (OA) measurements prove that the NPs form localized surface plasmons (LSP) structure with a broad OA band peaked near 440-460 nm and the fringe electric field extending down to about 10 nm into the GaN layer. The presence of this ...

Specialised or LSP translation is often compared unfavourably with literary translation in terms of the creative input required from the translator to produce a „good‟ translation. The supposed formulaic nature of LSP texts is contrasted with the creative nature of literary texts. The authors of LSP texts are often anonymous, possibly working in a team, and not necessarily native speakers of th...

Objective:  To examine the types of traumatic dental injuries primary teeth (TDI-p) and long-term sequelae on permanent dentition (LSP) comparing with a control group (CG). In addition, questionnaire that measures parents' knowledge awareness was used .  Material Methods:  The trauma (TG) consisted following TDI-p exposed teeth, while CG unexposed same patients. total, 141 were evaluated in 27 ...

the current internet inherently has a degree of survivability due to the connection less ip protocol. dynamic routing protocols are designed to react to faults by changing routes when routers learn about topology changes via routing information updates (e.g., link status advertisements). loss of quality of service (qos) has not been an issue because current internet traffic is the best-effort. ...

We present a technique for reducing the number of edge scans performed by Dijkstra’s algorithm for computing all pairs shortest paths. The main idea is to restrict path scanning only to locally shortest paths, i.e., paths whose proper subpaths are shortest paths. On a directed graph with n vertices and m edges, the technique we discuss allows it to reduce the number of edge scans from O(mn) to ...

The Logistics Service Provider (LSP) industry is undergoing radical change which focuses on the entire supply chain between manufacturers, warehouses, distributors and the ultimate clients. Due to the complexity and size of service coverage is increasing in meeting a great variety of stakeholder requirements, the LSP has to fully utilize information system that facilitates the transmission and ...