Multiplex Path Research Articles

Communication in multiplex transportation networks

AbstractComplex networks are made up of vertices and edges. The edges, which may be directed or undirected, are equipped with positive weights. Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices in distinct layers represent different kinds of objects. Multiplex networks are special vertex-aligned multilayer networks, in which vertices in distinct layers are identified with each other and inter-layer edges connect each vertex with its copy in other layers and have a fixed weight $$\gamma >0$$ γ > 0 associated with the ease of communication between layers. This paper discusses two different approaches to analyze communication in a multiplex. One approach focuses on the multiplex global efficiency by using the multiplex path length matrix, the other approach considers the multiplex total communicability. The sensitivity of both the multiplex global efficiency and the multiplex total communicability to structural perturbations in the network is investigated to help to identify intra-layer edges that should be strengthened to enhance communicability.

Enhancing multiplex global efficiency

Modeling complex systems that consist of different types of objects leads to multilayer networks, in which vertices are connected by both inter-layer and intra-layer edges. In this paper, we investigate multiplex networks, in which vertices in different layers are identified with each other, and the only inter-layer edges are those that connect a vertex with its copy in other layers. Let the third-order adjacency tensor A∈RN×N×L\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {A}\\in \\mathbb {R}^{N\ imes N\ imes L}$$\\end{document} and the parameter γ≥0\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\gamma \\ge 0$$\\end{document}, which is associated with the ease of communication between layers, represent a multiplex network with N vertices and L layers. To measure the ease of communication in a multiplex network, we focus on the average inverse geodesic length, which we refer to as the multiplex global efficiency eA(γ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$e_\\mathcal {A}(\\gamma )$$\\end{document} by means of the multiplex path length matrix P∈RN×N\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$P\\in \\mathbb {R}^{N\ imes N}$$\\end{document}. This paper generalizes the approach proposed in [15] for single-layer networks. We describe an algorithm based on min-plus matrix multiplication to construct P, as well as variants PK\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$P^K$$\\end{document} that only take into account multiplex paths made up of at most K intra-layer edges. These matrices are applied to detect redundant edges and to determine non-decreasing lower bounds eAK(γ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$e_\\mathcal {A}^K(\\gamma )$$\\end{document} for eA(γ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$e_\\mathcal {A}(\\gamma )$$\\end{document}, for K=1,2,⋯,N-2\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$K=1,2,\\dots ,N-2$$\\end{document}. Finally, the sensitivity of eAK(γ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$e_\\mathcal {A}^K(\\gamma )$$\\end{document} to changes of the entries of the adjacency tensor A\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {A}$$\\end{document} is investigated to determine edges that should be strengthened to enhance the multiplex global efficiency the most.

Multiplex path for magnetorheological jet polishing with vertical impinging.

We report a way to shape surfaces by optimizing the path instead of changing the removal function of a polishing tool for magnetorheological jet polishing (MJP). The M-shaped removal function of MJP generates a track with a W-shaped profile along one path. However, applying two parallel paths with appropriate line spacing can obtain a track with V-shaped profile, which has a removal distribution similar to that by using the Gaussian removal function along one path. Based on this, a multiplex path applying an M-shaped removal function is constructed in an actual process. A transformation model describing the relationship between the M-shaped removal function and the Gaussian removal function is established, which is crucial to determine the velocity function on the multiplex path. By using the M-shaped removal function, we have planned new processing steps by applying the multiplex path and the velocity function for full aperture polishing. Polishing performance is designed and demonstrated on two K9 work-pieces with different multiplex paths. The form error on 23 mm diameter is decreased from 0.256λ PV (λ=632.8 nm) and 0.068λ RMS to 0.038λ PV and 0.005λ RMS with scanning multiplex path. Results indicate that this method of path optimization is suitable for optical manufacturing.

DSRC 통신을 위한 원형 편파 패치 배열 안테나 설계

본 논문에서는 ITS(Intelligent Transport System)의 DSRC(Dedicated Short Range Communication) 통신을 위한 노변 기지국용 원형 편파 패치 배열 안테나를 제안하였다. DSRC 노변 기지국용 안테나가 다중 경로로부터 반사된 신호를 효율적으로 수신하기 위해 원형 편파로 동작하도록 설계하였다. 제안된 안테나는 마이크로스트립 패치와 급전 선로로 구성되었으며, 급전부의 슬롯 부근에 슬릿을 삽입하여 원형 편파를 발생시켰다. DSRC 노변 기지국용 안테나에 요구되는 이득 값을 만족시키기 위해 <TEX>$2{\times}2$</TEX> 배열 구조로 설계하였다. 측정된 임피던스 대역폭과 축비 대역폭은 5.795~5.855 GHz의 DSRC 통신 대역을 모두 만족하였다. 제안된 안테나의 수직 반치각과 수평반치각은 약 <TEX>$43^{\circ}$</TEX>이며, 약 11.21 dBi의 이득 특성을 보였다. In this paper, circularly polarization patch array antenna of RSE(Road-side Equipment) base station for DSRC(Dedicated Short Range Communication) of ITS(Intelligent Transport System) is proposed. The antenna of RSE base station for DSRC is designed to operate circularly polarization to receive reflected signal from multiplex path effectively. The proposed antenna consisted of microstrip patch and feed line, the slit is inserted in the proximity of the slot of feed structure to generate circularly polarization. The <TEX>$2{\times}2$</TEX> array structure is designed to satisfying gain that DSRC RSE base station antenna required. Measured impedance bandwidth and axial-ratio bandwidth are satisfied by all DSRC band of 5.795~5.855 GHz. Vertical and horizontal HPBW of the proposed antenna are both about 43 degrees, it showed gain characteristic of about 11.21 dBi.

Selectivity-sensitive shared evaluation of multiple continuous XPath queries over XML streams

One of the primary issues confronting XML message brokers is the difficulty associated with processing a large set of continuous XPath queries over incoming XML streams. This paper proposes a novel system designed to present an effective solution to this problem. The proposed system transforms multiple XPath queries before their run-time into a new data structure, called an XP- table, by sharing their common constraints. An XP-table is matched with a stream relation ( SR) transformed from a target XML stream by a SAX parser. This arrangement is intended to minimize the run-time workload of continuous query processing. In addition, an early-query-termination strategy is proposed as an improved alternative to the basic approach. It optimizes query processing by arranging the evaluation sequence of the member-lists (m-lists) of an XP-table adaptively and offers increased efficiency, especially in cases of low selectivity. System performance is estimated and verified through a variety of experiments, including comparisons with previous approaches such as YFilter and LazyDFA. The proposed system is practically linear-scalable and stable for evaluating a set of XPath queries in a continuous and timely fashion.