Transform-based graph topology similarity metrics

Neural Computing and Applications - Graph signal processing has recently emerged as a field with applications across a broad spectrum of fields including brain connectivity networks, logistics and...     

A Parametric Estimation Approach for Groove Dimensioning Using Remote Field Eddy Current Inspection

The remote field eddy current technique is used for dimensioning grooves that may occur in ferromagnetic pipes. We propose a method to estimate the depth and the length of corrosion grooves from the measurement of a pick-up coil signal phase at different positions close to the defect. Groove dimensioning needs the knowledge of the physical relation between measurements and defect dimensions; therefore, finite-element calculations are performed to obtain a parametric algebraic function of the physical phenomena. The parameters of this model function are obtained by an optimization technique. By means of this model and a previously defined general approach, an estimate of groove size may be given. In this approach, algebraic function parameters and groove dimensions are linked through a polynomial function. To validate this estimation procedure, a statistical study has been performed. The approach is proved to be suitable for real measurements.     

Facilitating the comparison of multiple visual items on screen: The example of electronic architectural plan correction

This paper describes two experiments designed to (1) ascertain whether the way in which architectural plans are displayed on a computer screen influences the quality of their correction by humans, and (2) identify the visual exploration strategies adopted in this type of task. Results of the first “spot the difference” experiment showed that superimposing the plans yielded better error correction performances than displaying them side by side. Furthermore, a sequential display mode, where the second plan only gradually appeared on the screen, improved error search effectiveness. In the second experiment, eye movement recordings revealed that superimposition increased plan comparison efficiency by making it easier to establish coreference between the two sources of information. The improvement in effectiveness in the sequential condition was shown to be linked to the attentional guidance afforded by this display mode, which helped users to make a more thorough exploration of the plans.     

Laser cladded AlCuFe＋Sn quasicrystalline compositecoatings

Al-Cu-Fe Sn quasicrystalline(QC) composite coatings with different volume fractions of Sn, i. e. 12%,20% and 30%, were prepared by laser cladding technique. The effects of soft phase Sn and processing parameters on the microstructure, microhardness and frictional behavior of the coatings were investigated. The results show that after laser cladding, /-phase existing in the powder is decomposed and element Sn reacts with Cu, forming β-CuSn. The volume fraction of Sn addition has less obvious effect on the microstructure, microhardness and friction performance than that of plasma sprayed coatings. The best performance in terms of microhardness and friction are obtained for the coating containing 20% Sn additions prepared with the laser power of 950 W and scanning velocity of 3 mm/s.     

Rapid Diminution in the Level and Activity of DNA-Dependent Protein Kinase in Cancer Cells by a Reactive Nitro-Benzoxadiazole Compound

The expression and activity of DNA-dependent protein kinase (DNA-PK) is related to DNA repair status in the response of cells to exogenous and endogenous factors. Recent studies indicate that Epidermal Growth Factor Receptor (EGFR) is involved in modulating DNA-PK. It has been shown that a compound 4-nitro-7-[(1-oxidopyridin-2-yl)sulfanyl]-2,1,3-benzoxadiazole (NSC), bearing a nitro-benzoxadiazole (NBD) scaffold, enhances tyrosine phosphorylation of EGFR and triggers downstream signaling pathways. Here, we studied the behavior of DNA-PK and other DNA repair proteins in prostate cancer cells exposed to compound NSC. We showed that both the expression and activity of DNA-PKcs (catalytic subunit of DNA-PK) rapidly decreased upon exposure of cells to the compound. The decline in DNA-PKcs was associated with enhanced protein ubiquitination, indicating the activation of cellular proteasome. However, pretreatment of cells with thioglycerol abolished the action of compound NSC and restored the level of DNA-PKcs. Moreover, the decreased level of DNA-PKcs was associated with the production of intracellular hydrogen peroxide by stable dimeric forms of Cu/Zn SOD1 induced by NSC. Our findings indicate that reactive oxygen species and electrophilic intermediates, generated and accumulated during the redox transformation of NBD compounds, are primarily responsible for the rapid modulation of DNA-PKcs functions in cancer cells.     

The importance of economies of scale,transport costs and demand patterns in optimising hydrogen fuelling infrastructure: An exploration with SHIPMod (Spatial hydrogen infrastructure planning model)

Hydrogen is widely recognised as an important option for future road transportation, but a widespread infrastructure must be developed if the potential for hydrogen is to be achieved. This paper and related appendices which can be downloaded as Supplementary material present a mixed-integer linear programming model (called SHIPMod) that optimises a hydrogen supply chains for scenarios of hydrogen fuel demand in the UK, including the spatial arrangement of carbon capture and storage infrastructure. In addition to presenting a number of improvements on past practice in the literature, the paper focuses attention on the importance of assumptions regarding hydrogen demand. The paper draws on socio-economic data to develop a spatially detailed scenario of possible hydrogen demand. The paper then shows that assumptions about the level and spatial dispersion of hydrogen demand have a significant impact on costs and on the choice of hydrogen production technologies and distribution mechanisms.     

A general theory for deadlock avoidance in wormhole-routed networks

Most machines of the last generation of distributed memory parallel computers possess specific routers which are used to exchange messages between nonneighboring nodes in the network. Among the several technologies, wormhole routing is usually preferred because it allows low channel-setup time and reduces the dependency between latency and internode distance. However, wormhole routing is very susceptible to deadlock because messages are allowed to hold many resources while requesting others. Therefore, designing deadlock-free routing algorithms using few hardware facilities is a major problem for wormhole-routed networks. In this paper, we describe a general theoretical framework for the study of deadlock-free routing functions. We give a general definition of what can be a routing function. This definition captures many specific definitions of the literature (e.g., vertex dependent, input-dependent, source-dependent, path-dependent etc.). Using our definition, we give a necessary and sufficient condition which characterizes deadlock-free routing functions. Our theory embraces, at a high level, most of the theories related to deadlock avoidance in wormhole-routed networks previously derived in the literature. In particular, it applies not only to one-to-one routing, but also to one-to-many routing. The latter paradigm is used to solve the multicast problem with the path-based or tree-based facility     

Window-games between TCP flows

We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. Analytical and experimental results show the relevance of the Window-game to real TCP congestion games and provide interesting insight into the respective Nash equilibria. Furthermore, we propose a new algorithmic queue mechanism, called Prince, which at congestion makes a scapegoat of the most greedy flow. We provide evidence which shows that Prince achieves efficient Nash equilibria while requiring only limited computational resources.     

Mobility management and control in intelligent wireless ATM networks

This paper shows how the Asynchronous Transfer Mode (ATM) signaling and the Intelligent Network (IN) concept can be exploited to support mobility in an ATM-based network with wireless access parts and mobile users. The proposed architecture exploits the enhanced service control processing features offered by the IN technology to support location management. The access signaling protocol structure is based on the principles of separation between call and bearer channel control, employed in fixed broadband access networks. The design objective is to minimize the changes required to the wired network signaling, by taking advantage of the well-developed capability sets. This allows the easy introduction of the wireless ATM technology (W-ATM) into the real world. It is shown that the proposed signaling protocol model provides cost-effective implementations without degrading the agreed Quality of Service (QoS) and the system's performance. A comparative signaling performance evaluation is carried-out to demonstrate the impact of the proposed signaling protocol architecture onto various performance measures and to quantify the relative gains. The obtained results can be used for network design purposes in a large-scale private installation supporting many users. The signaling protocol architecture aims for private W-ATM networks, but can be readily extended to fulfill the signaling requirements of public environment broadband wireless systems.     

Optimization of vendor-managed inventory systems in a rolling horizon framework

This paper aims at designing a dynamic VMI system. In this system, the entire supply chain performance is optimized in terms of production planning at vendor’s site, distribution strategy, and inventory management at manufacturer’s site. We also explore some of the complications involved in setting up such a system. The VMI system is modeled as a mixed-integer linear program (MILP) using discrete-time representation. The mathematical representation follows the resource-task network (RTN) formulation. To address the complexity of the problem, different optimization-based solution algorithms are proposed and compared in terms of solution quality and CPU time. First, the problem is solved directly using an exact detailed model. Secondly, an iterative procedure combines a novel aggregate model with the detailed model to provide aggregate pre-matches for the detailed binary variables. Finally, a novel rolling horizon approach that simultaneously combines the aggregate and the detailed models is designed to solve the problem. The entire VMI system is tested with an illustrative example.