Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tsang Ming Jiang

dblp:49/2062 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 1 since 2021Systems, architecture and hardware · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 67% Query processing and optimization · 33%
Network and information security
1 paper
Authentication and access control · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Authentication and access control
access control
0.011989
A Binary Single-Key-Lock System for Access Control · IEEE Trans. Computers 1989
Indexing and storage engines › multidimensional indexing
k-d tree
0.011988
Adaptive Algorithms for Balanced Multidimensional Clustering · ICDE 1988
Indexing and storage engines
multidimensional indexing
0.011988
Adaptive Algorithms for Balanced Multidimensional Clustering · ICDE 1988

Methods — techniques the papers use, named apart from their topics

binary coding · 0.0cost modeling · 0.0
YearPublicationVenuePosition
2023 Silicon as a Service and its Economic Impact
abstract
Silicon as a Service (SiaaS) is a service model for serving hardware Silicon. For example, a CPU chip may have different capabilities to be offered as a service for pay per use consumption model or licensed activation model. Three major driving forces for SiaaS shift are “reducing entry barrier on cost”, “increasing flexibility on access”, and “prolonging life cycle on product.” Often, the products we buy are used occasionally, a great waste of both money and occupied space. More importantly, with the rapid growth of world population, product ownership by all is simply not sustainable for the limited resources and higher manufacturing cost. Sharing becomes a necessity. Furthermore, we value and celebrate our unique individuality. We have different interests and taste; hence we demand different kinds of services. The products we own can become obsolete and be rendered useless over time. Yet we want continuous service and stay up to date with all latest and greatest features [1]
Abay Wu, Mark Yang, Tsang Ming Jiang
SSE3
2010 Computer software and applications
Xiaoqing Frank Liu, Carl K. Chang, Tsang Ming Jiang
J. Syst. Softw.3
1989 A Binary Single-Key-Lock System for Access Control
abstract
A binary coding method was invented and has been applied to the single-key-lock (SKL) system which achieves access control by associating with each accesser only one key and with each resource only one lock. The new system is called the binary single-key-lock (BSKL) system. In both the SKL and BSKL systems, through operations on the single-key-lock pair, the control information can be revealed. On the basis of the new binary coding method, and because binary operations are much faster, better performance for such an access control system can be achieved. The increased extensibility of the modification is also discussed.>
Carl K. Chang, Tsang Ming Jiang
IEEE Trans. Computers2
1988 Adaptive Algorithms for Balanced Multidimensional Clustering
abstract
The G-K-D tree (generalized K-D tree) method aims at reducing the average number of data page accesses per query, but it ignores the cost of index search. The authors propose two adaptive algorithms that take into consideration both data page access cost and index page access cost. It attempts to find a minimum total cost. Experimental results indicate that the proposed algorithms are superior to the G-K-D tree method.>
Clement T. Yu, Tsang Ming Jiang
ICDE2