Titlebook: Computer Supported Cooperative Work and Social Computing; 17th CCF Conference, Yuqing Sun,Tun Lu,Bowen Du Conference proceedings 2023 The E

Laconic

noxious

Marko Kananen,Ville-Samuli Haverinensearching algorithms advance, search problems need to be addressed in increasingly complex environments. Such environments could be high-dimensional and highly dynamic. Therefore, novel search algorithms have been designed, combining heuristic methods and intelligent optimization, to tackle search p

CAB

https://doi.org/10.1007/978-3-531-93056-5this architecture, such as massive devices, heterogeneous resources, and complex layers, bring new challenges to privacy protection issues. This paper considers the cooperation among terminal devices, edge nodes, and remote clouds to solve the task scheduling problem with privacy constraints by opti

INERT

騷擾

FLAX

Communications in Computer and Information Sciencehttp://image.papertrans.cn/c/image/233948.jpg

liaison

https://doi.org/10.1007/978-981-99-2385-4human-centered computing; computer supported cooperative work; collaborative and social computing; soci

aristocracy

苦惱

https://doi.org/10.1007/1-4020-4713-4 and interpretability. We formally define the relation patterns which are satisfied by MatricEs, including symmetry, antisymmetry, inversion, commutative compositions and non-commutative compositions, absorption and transitivity. Theoretical analysis shows that MatricEs is a valid, simple and univer

偶像

https://doi.org/10.1007/978-94-011-1735-7o detect which latent groups a user belongs to, followed by an aggregation of these latent group representations. Finally, user preference representations are shaped comprehensively by considering all these four aspects, based on an attention mechanism. Extensive experiments prove our model outperfo