Wenyue Ma

Wenyue Ma

Auto-generated profile, based on publicly available information

Wenyue Ma

Aarhus University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 August 2018 in Science China Materials
Verified
Journal Article
Open access
PDF file
PCPeng Chen
Peng Chen
JSJin-Shi Sun
Jin-Shi Sun
LZLei Zhang
Lei Zhang
WMWen-Yue Ma
Wen-Yue Ma
FSFuxing Sun
Fuxing Sun
GZGuangshan Zhu
Guangshan Zhu
High density of phenyl rings makes PAF-1 have robust structure and highly lipophilic pore, which make it very suitable for organocatalysis. However, there is no report about using PAF-1 as platform for enantioselective organocatalysis. In this paper, using PAF-1 as the platform, a chiral prolinamide catalytic site was introduced onto the framework of PAF-1 via a series of stepwise post-synthetic modifications, obtaining a novel PAF-supported chiral catalyst named PAF-1-NHPro. Then its enantioselective catalytic performance was studied by subjecting it to catalyze the model Aldol reaction between p-nitrobenzaldehyde and cyclohexanone. PAF-1-NHPro showed good diastereoselectivity and enantioselectivity with excellent and easy recyclability. PAF-1 是最著名的多孔芳香骨架材料(PAF), 它拥有许多优异的性质并且可被用于多个领域. 由高密度的苯环组成的PAF-1材料拥有刚性结构和亲脂性孔道, 非常适合用作有机催化的平台. 但是迄今为止, 尚未有将其应用到对映选择性有机催化的报道. 本论文以PAF-1为固载平台, 将手性脯氨酰胺催化位点通过一系列后修饰的方法固载到PAF-1的骨架上, 得到了新颖的手性固载催化剂PAF-1-NHPro.PAF-1-NHPro在催化对硝基苯甲醛和环己酮的Aldol反应的过程中表现出了优良的非对映选择性和对映选择性以及良好的可回收利用性. 本工作展现了PAF材料在非均相对映选择性有机催化领域的应用前景.

20 October 2015 in Journal of Magnetism and Magnetic Materials
Verified
Journal Article
Closed access
LSLihua Shen
Lihua Shen
WMWen-Yue Ma
Wen-Yue Ma
GLGui-Xiang Liu
Gui-Xiang Liu
LYLin Yuan
Lin Yuan

13 May 2024
Verified
Conference Paper
Open access
MEMaximilian K. Egger
Maximilian K. Egger
WMWenyue Ma
Wenyue Ma
DMDavide Mottin
Davide Mottin
Panagiotis KarrasPanagiotis Karras
Panagiotis Karras
IBIlaria Bordino
Ilaria Bordino
AAAris Anagnostopoulos
Aris Anagnostopoulos
Can we assess a priori how well a knowledge graph embedding will perform on a specific downstream task and in a specific part of the knowledge graph? Knowledge graph embeddings (KGEs) represent entities (e.g., ''da Vinci,'' ''Mona Lisa'') and relationships (e.g., ''painted'') of a knowledge graph (KG) as vectors. KGEs are generated by optimizing an embedding score, which assesses whether a triple (e.g., ''da Vinci,'' "painted,'' ''Mona Lisa'') exists in the graph. KGEs have been proven effective in a variety of web-related downstream tasks, including, for instance, predicting relationship(s) among entities. However, the problem of anticipating the performance of a given KGE in a certain downstream task and locally to a specific individual triple, has not been tackled so far. In this paper, we fill this gap withReliK, a Reli ability measure for K GEs. ReliK relies solely on KGE embedding scores, is task- and KGE-agnostic, and requires no further KGE training. As such, it is particularly appealing for semantic web applications which call for testing multiple KGE methods on various parts of the KG and on each individual downstream task. Through extensive experiments, we attest thatReliK correlates well with both common downstream tasks, such as tail/relation prediction and triple classification, as well as advanced downstream tasks, such as rule mining and question answering, while preserving locality.

28 August 2024
Verified
Book Chapter
Closed access
PDF file
WMWenyue Ma
Wenyue Ma
MEMaximilian K. Egger
Maximilian K. Egger
APAndreas Pavlogiannis
Andreas Pavlogiannis
YLYuchen Li
Yuchen Li
PKPanagiotis Karras
Panagiotis Karras

30 June 2026
Verified
Book Chapter
Closed access
PDF file
YZYi Zhou
Yi Zhou
WMWenyue Ma
Wenyue Ma
Yanhao WangYanhao Wang
Yanhao Wang
YLYuchen Li
Yuchen Li
Panagiotis KarrasPanagiotis Karras
Panagiotis Karras

6 February 2023 in arXiv
Verified
Preprint
Open access
PDF file
MHMikael Møller Høgsgaard
Mikael Møller Høgsgaard
PKPanagiotis Karras
Panagiotis Karras
WMWenyue Ma
Wenyue Ma
NRNidhi Rathi
Nidhi Rathi
CSChris Schwiegelshohn
Chris Schwiegelshohn
For the fundamental problem of allocating a set of resources among individuals with varied preferences, the quality of an allocation relates to the degree of fairness and the collective welfare achieved. Unfortunately, in many resource-allocation settings, it is computationally hard to maximize welfare while achieving fairness goals. In this work, we consider ex-ante notions of fairness; popular examples include the \emph{randomized round-robin algorithm} and \emph{sortition mechanism}. We propose a general framework to systematically study the \emph{interpolation} between fairness and welfare goals in a multi-criteria setting. We develop two efficient algorithms ($\varepsilon-Mix$ and $Simple-Mix$) that achieve different trade-off guarantees with respect to fairness and welfare. $\varepsilon-Mix$ achieves an optimal multi-criteria approximation with respect to fairness and welfare, while $Simple-Mix$ achieves optimality up to a constant factor with zero computational overhead beyond the underlying \emph{welfare-maximizing mechanism} and the \emph{ex-ante fair mechanism}. Our framework makes no assumptions on either of the two underlying mechanisms, other than that the fair mechanism produces a distribution over the set of all allocations. Indeed, if these mechanisms are themselves approximation algorithms, our framework will retain the approximation factor, guaranteeing sensitivity to the quality of the underlying mechanisms, while being \emph{oblivious} to them. We also give an extensive experimental analysis for the aforementioned ex-ante fair mechanisms on real data sets, confirming our theoretical analysis.