云南高校图书馆联盟文献共享服务平台- CLIQUE

CLIQUE: 作品数：72被引量：141H指数：7; 导出分析报告; 相关领域：自动化与计算机技术更多>>; 相关作者：孙焕良刘俊岭张智雄郭红梅卢智更多>>; 相关机构：中国科学院大学东北大学沈阳建筑大学中国科学院文献情报中心更多>>; 相关期刊：更多>>; 相关基金：国家自然科学基金教育部人文社会科学研究基金国家重点基础研究发展计划中国博士后科学基金更多>>

Do Institutional Investor Cliques Undermine Stock Price Efficiency?: 《China & World Economy》2025年第1期223-258,共36页Hai Jiang Shuangyi Chen Zifeng Wang; support from the National Social Science Fund of China(No.23AZD024);the National Natural Science Foundation of China(No.71973053).; This study investigates the effects of institutional investor cliques on stock price efficiency. Using a community network algorithm, it identifies cliques of institutional investors and finds that they significantly ...; 关键词：emerging market economics institutional investor clique stock price efficiency

Radiative heat transfer analysis of a concave porous fin under the local thermal non-equilibrium condition:application of the clique polynomial method and physics-informed neural networks: 《Applied Mathematics and Mechanics(English Edition)》2024年第9期1613-1632,共20页K.CHANDAN K.KARTHIK K.V.NAGARAJA B.C.PRASANNAKUMARA R.S.VARUN KUMAR T.MUHAMMAD; funding this work through Small Research Project under grant number RGP.1/141/45。; The heat transfer through a concave permeable fin is analyzed by the local thermal non-equilibrium(LTNE)model.The governing dimensional temperature equations for the solid and fluid phases of the porous extended surfa...; 关键词：heat transfer FIN porous fin local thermal non-equilibrium(LTNE)model physics-informed neural network(PINN)

A Remark on the Characterization of Triangulated Graphs: 《Open Journal of Discrete Mathematics》2023年第2期55-62,共8页Hatem Najar Riadh Gargouri; In this study, we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This gives an alternative characterization of triangulated graphs. ...; 关键词：Triangulated Graphs Perfect Set CLIQUE

Approximation Algorithms on k-Cycle Transversal and k-Clique Transversal: 《Journal of the Operations Research Society of China》2021年第4期883-892,共10页Zhong-Zheng Tang Zhuo Diao; the National Natural Science Foundation of China(No.11901605);the disciplinary funding of Central University of Finance and Economics.; Given a weighted graph G=(V,E)with weight w:E→Z+,a k-cycle transversal is an edge subset A of E such that G−A has no k-cycle.The minimum weight of kcycle transversal is the weighted transversal number on k-cycle,deno...; 关键词：k-cycle transversal k-clique transversal Approximation algorithms

复杂属性条件下基于Spark的clique社区搜索算法: 《计算机工程》2021年第12期54-61,70,共9页佘鑫何震瀛; 国家重点研发计划“精准公共法律服务支撑技术与装备研究”(2018YFC0830900)。; 现有的社区搜索算法难以在网络中找到满足给定复杂属性条件的社区。同时,随着网络规模的不断扩大,单机串行的社区搜索算法也已无法有效地处理大规模的网络数据。针对复杂属性条件下的clique社区搜索问题,提出一种基于Spark的搜索算法。...; 关键词：社区搜索复杂属性条件布尔表达式 Spark并行计算框架 clique结构

DP-UserPro:differentially private user profile construction and publication: 《Frontiers of Computer Science》2021年第5期197-206,共10页Zheng HUO Ping HE Lisha HU Huanyu ZHAO; the National Natural Science Foundation of China(Grant No.62002098);Natural Science Foundation of Hebei Province(F2020207001,F2019207061);the Scientific Research Projects of Hebei Education Department(QN2018116);the Research Foundation of Hebei University of Economics and Business(2018QZ04,2019JYQ08).; User profiles are widely used in the age of big data.However,generating and releasing user profiles may cause serious privacy leakage,since a large number of personal data are collected and analyzed.In this paper,we p...; 关键词：user profile DP-CLIQUE CLUSTERING differential privacy recommender system

A Construction of Sequentially Cohen-Macaulay Graphs被引量：1: 《Algebra Colloquium》2021年第3期399-414,共16页Aming Liu Tongsuo Wu; Supported by the Natural Science Foundation of Shanghai(No.19ZR1424100);the National Natural Science Foundation of China(No.11271250,11971338).; For every simple graph G,a class of multiple clique cluster-whiskered graphs G^(eπm)is introduced,and it is shown that all such graphs are vertex decomposable;thus,the independence simplicial complex Ind G^(eπm)is s...; 关键词：multiple clique cluster-whiskered graph vertex decomposable strongly shell-able Boolean graph facet ideal

Solving diversified top-k weight clique search problem: 《Science China(Information Sciences)》2021年第5期43-44,共2页Junping ZHOU Chumin LI Yupeng ZHOU Mingyang LI Lili LIANG Jianan WANG; supported by National Natural Science Foundation of China(Grant Nos.61976050,61403076,61806050,61806082);Fundamental Research Funds for the Central Universities(Grant No.2412019FZ050)。; Dear editor,Diversified top-k weight clique search(DTKWCS)is a problem that computes k cliques to maximize the sum of weights of all vertices contained in the cliques;that is,∑v_(∈{c1∪c2∪…∪ck})w(v)is maximized b...; 关键词：WEIGHT CLIQUE PROBLEM

Bayesian Network Model of Product Information Diffusion and Reasoning of Influence: 《Journal of Data Analysis and Information Processing》2020年第4期267-281,共15页Xuehua Sun Shaojie Hou Ning Cai Wenxiu Ma Surui Zhao; Information diffusion on social media has become a key strategy in people’s daily interactions. This paper studies consumers’ participation in the product information diffusion, and analyzes the complexity of inform...; 关键词：Product Information Diffusion Bayesian Network Model Influence Reasoning Consumer Behaviors Clique Tree

面向大数据的图模式挖掘概率算法被引量：3: 《计算机应用研究》2020年第12期3545-3551,共7页姜丽丽李叶飞豆龙龙陈智麒钱柱中; 国家自然科学基金面上项目(61872175);江苏省自然科学基金面上项目(BK20181252)。; 在当今大数据时代,MapReduce等大数据处理框架处理数据能力有限,其在处理有关图的数据时常常显得缓慢低效,典型如3-clique计数问题,故需要探究一种高效的算法处理这类clique计数问题。由于在前人文献中对3-clique计数问题已有深入探讨,...; 关键词：4-clique计数问题概率化算法图模式挖掘大数据处理近似算法

CLIQUE