Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Neng‐Pin Lu"'
Autor:
Neng-Pin Lu, 盧能彬
88
Superscalar multiprocessors can exploit both coarse-grained and fine-grained parallelism in programs. But the continuing widening gap between processor and memory speeds can quickly offset any performance gains expected from the parallelism e
Superscalar multiprocessors can exploit both coarse-grained and fine-grained parallelism in programs. But the continuing widening gap between processor and memory speeds can quickly offset any performance gains expected from the parallelism e
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/60106227946455163432
Autor:
Neng-Pin Lu
Publikováno v:
The Journal of Mathematical Sociology. 46:246-265
In digraphs representing asymmetric relations, the measured scores of previous spectral rankings are usually dominated by nodes in the largest strongly connected component. In our previous work, we...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93481860d1c501f5ac7152df95b2b22c
https://doi.org/10.1080/0022250x.2021.1885402
https://doi.org/10.1080/0022250x.2021.1885402
Autor:
Neng-Pin Lu
Publikováno v:
The Journal of Mathematical Sociology. 45:51-64
For measuring the centrality in a digraph, Bonacich and Lloyd summarized a vector, from the power series of an attenuated adjacency matrix, as the alpha centrality. However, scores of alpha central...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d892cd9694144d48f15bdb074d6a82c
https://doi.org/10.1080/0022250x.2020.1711753
https://doi.org/10.1080/0022250x.2020.1711753
Autor:
Neng-Pin Lu
Publikováno v:
The Journal of Mathematical Sociology. 43:164-178
Principal eigenvectors of adjacency matrices are often adopted as measures of centrality for a graph or digraph. However, previous principal-eigenvector-like measures for a digraph usually consider...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69092b3a82438ec664c0d6868297995c
https://doi.org/10.1080/0022250x.2018.1555827
https://doi.org/10.1080/0022250x.2018.1555827
Autor:
Neng-Pin Lu
Publikováno v:
The Journal of Mathematical Sociology. 41:139-154
Eigenvector centrality is a popular measure that uses the principal eigenvector of the adjacency matrix to distinguish importance of nodes in a graph. To find the principal eigenvector, the power method iterating from a random initial vector is often
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbc1f072406de489af1dc8997df7061d
https://doi.org/10.1080/0022250x.2017.1328680
https://doi.org/10.1080/0022250x.2017.1328680
Autor:
Neng-Pin Lu
Publikováno v:
Journal of the Chinese Institute of Engineers. 39:936-945
The bowtie structure can illustrate not only the accessibility of the World Wide Web, but also the reachability of other directed networks. In this paper, we use the principal eigenvectors of the adjacency matrix with the unique largest eigenvalue to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ce7a67e594e6ce24265a4b582b0d5c60
https://doi.org/10.1080/02533839.2016.1225517
https://doi.org/10.1080/02533839.2016.1225517
Autor:
Neng-Pin Lu
Publikováno v:
Journal of the Chinese Institute of Engineers. 38:1080-1089
Among the various methods of network analyses, blockmodeling is one of the key approaches to analyzing network structures. It can be applied not only to position analysis of the individual nodes, but also to cohesive subgroup discovery of the whole n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96478df1a146fdf5a9f9673e0b4c7698
https://doi.org/10.1080/02533839.2015.1047800
https://doi.org/10.1080/02533839.2015.1047800
Autor:
Shu‐Chun Lin, Neng‐Pin Lu
Publikováno v:
Journal of the Chinese Institute of Engineers. 32:123-128
Internet topology analyses have been well investigated for years; however, previous research was always based on large‐scale censuses of all the Internet routers around the world. To reduce census efforts but still to figure out the Internet topolo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b1ae3353dc8de1fcaa000f81716c7e29
https://doi.org/10.1080/02533839.2009.9671488
https://doi.org/10.1080/02533839.2009.9671488
Publikováno v:
Journal of Systems and Software. 66:129-134
In this paper, we propose a new multistage interconnection network, called 3-disjoint gamma interconnection network (3DGIN). The 3DGIN is a modified gamma interconnection network that provides 3-disjoint paths to tolerate two switch or link faults be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::461298d88cc848c509ba279afc7ad663
https://doi.org/10.1016/s0164-1212(02)00070-5
https://doi.org/10.1016/s0164-1212(02)00070-5
Publikováno v:
Journal of Systems and Software. 52:67-78
Branch target buffer (BTB) is widely used in modern microprocessor designs to reduce the penalties caused by branches. To evaluate the performance of a BTB, trace-driven simulation is often used. However, as the trace of a typical program is very lar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2749456f818be7f43e50e2b4051a03d6
https://doi.org/10.1016/s0164-1212(99)00133-8
https://doi.org/10.1016/s0164-1212(99)00133-8