اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMatching Algorithms: Fundamentals, Applications and Challenges
134
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to peoples daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach a stable or optimal state. In computer science, all branches of matching problems have emerged, such as the question-answer matching in information retrieval, user-item matching in a recommender system, and entity-relation matching in the knowledge graph. A preference list is the core element during a matching process, which can either be obtained directly from the agents or generated indirectly by prediction. Based on the preference list access, matching problems are divided into two categories, i.e., explicit matching and implicit matching. In this paper, we first introduce the matching theorys basic models and algorithms in explicit matching. The existing methods for coping with various matching problems in implicit matching are reviewed, such as retrieval matching, user-item matching, entity-relation matching, and image matching. Furthermore, we look into representative applications in these areas, including marriage and labor markets in explicit matching and several similarity-based matching problems in implicit matching. Finally, this survey paper concludes with a discussion of open issues and promising future directions in the field of matching.
قيم البحث
اقرأ أيضاً
The emergence of novel wireless networking paradigms such as small cell and cognitive radio networks has forever transformed the way in which wireless systems are operated. In particular, the need for self-organizing solutions to manage the scarce sp
ectral resources has become a prevalent theme in many emerging wireless systems. In this paper, the first comprehensive tutorial on the use of matching theory, a Nobelprize winning framework, for resource management in wireless networks is developed. To cater for the unique features of emerging wireless networks, a novel, wireless-oriented classification of matching theory is proposed. Then, the key solution concepts and algorithmic implementations of this framework are exposed. Then, the developed concepts are applied in three important wireless networking areas in order to demonstrate the usefulness of this analytical tool. Results show how matching theory can effectively improve the performance of resource allocation in all three applications discussed.
Centrality rankings such as degree, closeness, betweenness, Katz, PageRank, etc. are commonly used to identify critical nodes in a graph. These methods are based on two assumptions that restrict their wider applicability. First, they assume the exact
topology of the network is available. Secondly, they do not take into account the activity over the network and only rely on its topology. However, in many applications, the network is autonomous, vast, and distributed, and it is hard to collect the exact topology. At the same time, the underlying pairwise activity between node pairs is not uniform and node criticality strongly depends on the activity on the underlying network. In this paper, we propose active betweenness cardinality, as a new measure, where the node criticalities are based on not the static structure, but the activity of the network. We show how this metric can be computed efficiently by using only local information for a given node and how we can find the most critical nodes starting from only a few nodes. We also show how this metric can be used to monitor a network and identify failed nodes.We present experimental results to show effectiveness by demonstrating how the failed nodes can be identified by measuring active betweenness cardinality of a few nodes in the system.
Symmetry is fundamental to understanding our physical world. An antisymmetry operation switches between two different states of a trait, such as two time-states, position-states, charge-states, spin-states, chemical-species etc. This review covers th
e fundamental concepts of antisymmetry, and focuses on four antisymmetries, namely spatial inversion in point groups, time reversal, distortion reversal and wedge reversion. The distinction between classical and quantum mechanical descriptions of time reversal is presented. Applications of these antisymmetries in crystallography, diffraction, determining the form of property tensors, classifying distortion pathways in transition state theory, finding minimum energy pathways, diffusion, magnetic structures and properties, ferroelectric and multiferroic switching, classifying physical properties in arbitrary dimensions, and antisymmetry-protected topological phenomena are presented.
Molecular chirality is a geometric property that is of great importance in chemistry, biology, and medicine. Recently, plasmonic nanostructures that exhibit distinct chiroptical responses have attracted tremendous interest, given their ability to emu
late the properties of chiral molecules with tailored and pronounced optical characteristics. However, the optical chirality of such human-made structures is in general static and cannot be manipulated postfabrication. Herein, different concepts to reconfigure the chiroptical responses of plasmonic nano- and micro-objects are outlined. Depending on the utilized strategies and stimuli, the chiroptical signature, the 3D structural conformation, or both can be reconfigured. Optical devices based on plasmonic nanostructures with reconfigurable chirality possess great potential in practical applications, ranging from polarization conversion elements to enantioselective analysis, chiral sensing, and catalysis.
The coefficients a and b of the Fundamental Plane relation R ~ Sigma^a I^b depend on whether one minimizes the scatter in the R direction or orthogonal to the Plane. We provide explicit expressions for a and b (and confidence limits) in terms of the
covariances between logR, logSigma and logI. Our analysis is more generally applicable to any other correlations between three variables: e.g., the color-magnitude-Sigma relation, the L-Sigma-Mbh relation, or the relation between the X-ray luminosity, Sunyaev-Zeldovich decrement and optical richness of a cluster, so we provide IDL code which implements these ideas, and we show how our analysis generalizes further to correlations between more than three variables. We show how to account for correlated errors and selection effects, and quantify the difference between the direct, inverse and orthogonal fit coefficients. We show that the three vectors associated with the Fundamental Plane can all be written as simple combinations of a and b because the distribution of I is much broader than that of Sigma, and Sigma and I are only weakly correlated. Why this should be so for galaxies is a fundamental open question about the physics of early-type galaxy formation. If luminosity evolution is differential, and Rs and Sigmas do not evolve, then this is just an accident: Sigma and I must have been correlated in the past. On the other hand, if the (lack of) correlation is similar to that at the present time, then differential luminosity evolution must have been accompanied by structural evolution. A model in which the luminosities of low-L galaxies evolve more rapidly than do those of higher-L galaxies is able to produce the observed decrease in a (by a factor of 2 at z~1) while having b decrease by only about 20 percent. In such a model, the Mdyn/L ratio is a steeper function of Mdyn at higher z.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
