检索结果-内蒙古大学图书馆

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

Journal of Computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Mining Top-k Frequent Patterns over Streaming Graphs 28th

Mining Top-k Frequent Patterns over Streaming Graphs

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Wang, Xi Zhang, Qianzhen Guo, Deke Zhao, Xiang Institute for Quantum Information and State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China Laboratory for Big Data and Decision National University of Defense Technology Changsha China

ISBN: (纸本)9783031306747

Mining top-k frequent patterns is an important operation on graphs, which is defined as finding k interesting subgraphs with the highest frequency. Most existing work assumes a static graph. However, graphs are dynamic in nature, which is described as streaming graphs. Mining top-k frequent patterns in streaming graphs is challenging due to the streaming nature of the input and the exponential time complexity of the problem. A naive solution is to calculate approximations of the frequent patterns in the streaming graph and then find the top-k answers, which is a memory- and time-consuming method. In this paper, we design a novel auxiliary data structure, FPC, to detect valid subgraph patterns and their frequency in real-time. We first convert each newly produced subgraph into a sequence and then map it into corresponding tracks in FPC based on hash functions. We theoretically prove that FPC can provide unbiased estimation and then give an error bound of our algorithm. In addition, we propose a vertical hashing and candidate buckets sampling technique to further improve FPC with higher space utilization and higher accuracy. Extensive experiments confirm that our approach generates high-quality results compared to the baseline method. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Identification of Key Genes as Potential Drug Targets for Gastric Cancer

引用

Tsinghua Science and Technology 2023年第4期28卷 649-664页

作者： Md.Tofazzal Hossain Md.Selim Reza Yin Peng Shengzhong Feng Yanjie Wei Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis TechnologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Statistics Bangabandhu Sheikh Mujibur Rahman Science and Technology UniversityGopalganj 8100Bangladesh Guangdong Provincial Key Laboratory for Genome Stability and Disease Prevention and Regional Immunity and Diseases Department of PathologyShenzhen UniversityShenzhen 518060China

Gastric cancer(GC)is one of the most common cancers and ranks the third in cancer mortality all over the *** goal of this study was to identify potential hub-genes,highlighting their functions,signaling pathways,and candidate drugs for the treatment of GC *** used publicly available next generation sequencing(NGS)data to identify differentially expressed(DE)*** top DE genes were mapped to STRING database to construct the protein-protein interaction(PPI)network and top hub genes were selected for further *** found a total of 1555 DE genes with 870 upregulated and 685 downregulated genes in *** selected the top 400(200 upregulated and 200 downregulated)genes to construct a PPI network and extracted the top 15 hub *** gene ontology(GO)term and kyoto encyclopedia of genes and genomes(KEGG)pathway enrichment analyses of the 15 hub genes exposed some important functions and signaling pathways that were significantly associated with GC *** survival analysis of the hub genes disclosed that the lower expressions of the three hub genes CDH2,COL4A1,and COL5A2 were associated with better survival of GC *** three genes might be the candidate biomarkers for the diagnosis and treatment of ***,we considered 3 key proteins(genomic biomarkers)(COL4A1,CDH2,and CO5A2)as the drug target proteins(receptors),performed their docking analysis with the 102 meta-drug agents,and found Everolimus,Docetaxel,Lanreotide,Venetoclax,Temsirolimus,and Nilotinib as the top ranked 6 candidate drugs with respect to our proposed target proteins for the treatment against GC ***,the proposed drugs might play vital role for the treatment against GC patients.

关键词： gastric cancer hub genes candidate genes molecular docking candidate drugs

来源：评论

学校读者我要写书评

暂无评论

Airfoil Inverse Design using Conditional Generative Adversarial Networks

Airfoil Inverse Design using Conditional Generative Adversar...

引用

International Conference on Control, Automation, Robotics and Vision (ICARCV)

作者： Xavier Tan Dai Manna Joyjit Chattoraj Liu Yong Xu Xinxing Dao My Ha Yang Feng Computing & Intelligence Department Institute of High Performance Computing A*STAR Singapore School of Informatics & IT Diploma in Big Data Analytics Temasek Polytechnic Singapore Fluid Dynamics Department Institute of High Performance Computing A*STAR Singapore

ISBN: (纸本)9781665476881

Creating an aerodynamic shape, like an airfoil wing, requires many factors to be considered, especially aerodynamic properties such as its lift-to-drag ratio (L/D). Currently, generating feasible airfoil shapes usually requires computationally expensive tools, such as Computational Fluid Dynamics (CFD). In recent years, increasing work has been directed to utilizing machine learning algorithms to synthesize accurate airfoil shapes while reducing the required computational cost. Generative Adversarial Network (GAN) is one of many algorithms to see success in airfoil shape optimization and is shown to generate good airfoils given a small set of training examples. This paper focuses on implementing a conditional GAN (cGAN) based framework with various filters for airfoil inverse design problem. By labelling the training dataset with aerodynamic characteristics separated by pre-defined thresholds to lift-to-drag ratio (L/D) and shape area, the class labels will be able to guide the network to generate different classes of airfoils influenced by these characteristics. Together with layers of Savitzky-Golay (SG) filter and B-Spline Interpolation, the developed model was shown to achieve good performance in generating new airfoils. In addition, we explored the viability of adding Wasserstein loss from Wasserstein GAN into the network architecture, forming a cWGAN-GP. Testing results showed that cWGAN-GP was able to achieve better performance for a specific airfoil class.

关键词： Training Interpolation Machine learning algorithms Shape Atmospheric modeling Computational fluid dynamics Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

SimSIMS: Simulation-based Supernova Ia Model Selection with thousands of latent variables

arXiv

引用

arXiv 2023年

作者： Karchev, Konstantin Trotta, Roberto Weniger, Christoph Theoretical and Scientific Data Science SISSA Trieste Italy Department of Physics Imperial College London United Kingdom Italian Research Center on High Performance Computing Big Data and Quantum Computing Italy National Institute for Nuclear Physics Trieste Italy GRAPPA Institute University of Amsterdam Netherlands

We present principled Bayesian model comparison through simulation-based neural classification applied to SN Ia analysis. We validate our approach on realistically simulated SN Ia light curve data, demonstrating its ability to recover posterior model probabilities while marginalizing over > 4000 latent variables. The amortized nature of our technique allows us to explore the dependence of Bayes factors on the true parameters of simulated data, demonstrating Occam’s razor for nested models. When applied to a sample of 86 low-redshift SNæ Ia from the Carnegie Supernova Project, our method prefers a model with a single dust law and no magnitude step with host mass, disfavouring different dust laws for low- and high-mass hosts with odds in excess of 100:1. Copyright © 2023, The Authors. All rights reserved.

关键词： Supernovae

来源：评论

学校读者我要写书评

暂无评论

Graph algorithms: parallelization and scalability

引用

Science China(Information Sciences) 2020年第10期63卷 234-254页

作者： Wenfei FAN Kun HE Qian LI Yue WANG School of Informatics University of Edinburgh Shenzhen Institute of Computing Sciences Shenzhen University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen University

For computations on large-scale graphs, one often resorts to parallel algorithms. However, parallel algorithms are difficult to write, debug and analyze. Worse still, it is difficult to make algorithms parallelly scalable, such that the more machines are used, the faster the algorithms run. Indeed, it is not yet known whether any PTIME computational problems admit parallelly scalable algorithms on shared-nothing *** it possible to parallelize sequential graph algorithms and guarantee convergence at the correct results as long as the sequential algorithms are correct? Moreover, does a PTIME parallelly scalable problem exist on shared-nothing systems? This position paper answers both questions in the affirmative.

关键词： parallelization parallel scalability PTIME problems graph algorithms shared-nothing systems

来源：评论

学校读者我要写书评

暂无评论

Towards a Benchmark for Colorectal Cancer Segmentation in Endorectal Ultrasound Videos: dataset and Model Development

arXiv

引用

arXiv 2024年

作者： Jiang, Yuncheng Hu, Yiwen Zhang, Zixun Wei, Jun Feng, Chun-Mei Tang, Xuemei Wan, Xiang Liu, Yong Cui, Shuguang Li, Zhen SSE The Chinese University of Hong Kong Shenzhen China Shenzhen Future Network of Intelligence Insititute China Institute of High Performance Computing Agency for Science Technology and Research Singapore Shenzhen Research Institute of Big Data Shenzhen China Affiliated Hospital of North Sichuan Medical College Sichuan China

Endorectal ultrasound (ERUS) is an important imaging modality that provides high reliability for diagnosing the depth and boundary of invasion in colorectal cancer. However, the lack of a large-scale ERUS dataset with high-quality annotations hinders the development of automatic ultrasound diagnostics. In this paper, we collected and annotated the first benchmark dataset that covers diverse ERUS scenarios, i.e. colorectal cancer segmentation, detection, and infiltration depth staging. Our ERUS-10K dataset comprises 77 videos and 10,000 high-resolution annotated frames. Based on this dataset, we further introduce a benchmark model for colorectal cancer segmentation, named the Adaptive Sparse-context TRansformer (ASTR). ASTR is designed based on three considerations: scanning mode discrepancy, temporal information, and low computational complexity. For generalizing to different scanning modes, the adaptive scanning-mode augmentation is proposed to convert between raw sector images and linear scan ones. For mining temporal information, the sparse-context transformer is incorporated to integrate inter-frame local and global features. For reducing computational complexity, the sparse-context block is introduced to extract contextual features from auxiliary frames. Finally, on the benchmark dataset, the proposed ASTR model achieves a 77.6% Dice score in rectal cancer segmentation, largely outperforming previous state-of-the-art methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Vision-Amplified Semantic Entropy for Hallucination Detection in Medical Visual Question Answering

arXiv

引用

arXiv 2025年

作者： Liao, Zehui Hu, Shishuai Zou, Ke Fu, Huazhu Zhen, Liangli Xia, Yong National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Institute of High Performance Computing Agency for Science Technology and Research Singapore138632 Singapore National University of Singapore Singapore119077 Singapore

Multimodal large language models (MLLMs) have demonstrated significant potential in medical Visual Question Answering (VQA). Yet, they remain prone to hallucinations—incorrect responses that contradict input images, posing substantial risks in clinical decision-making. Detecting these hallucinations is essential for establishing trust in MLLMs among clinicians and patients, thereby enabling their real-world adoption. Current hallucination detection methods, especially semantic entropy (SE), have demonstrated promising hallucination detection capacity for LLMs. However, adapting SE to medical MLLMs by incorporating visual perturbations presents a dilemma. Weak perturbations preserve image content and ensure clinical validity, but may be overlooked by medical MLLMs, which tend to over rely on language priors. In contrast, strong perturbations can distort essential diagnostic features, compromising clinical interpretation. To address this issue, we propose Vision Amplified Semantic Entropy (VASE), which incorporates weak image transformations and amplifies the impact of visual input, to improve hallucination detection in medical VQA. We first estimate the semantic predictive distribution under weak visual transformations to preserve clinical validity, and then amplify visual influence by contrasting this distribution with that derived from a distorted image. The entropy of the resulting distribution is estimated as VASE. Experiments on two medical open-ended VQA datasets demonstrate that VASE consistently outperforms existing hallucination detection methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Circuit area optimization of multi-output MPRM based on ERWOA algorithm

引用

Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics 2023年第5期49卷 1193-1200页

作者： He, Juncai He, Zhenxue Wang, Fushun Huo, Zhisheng Xiao, Limin Intelligent Agricultural Equipment Research Institute Hebei Agricultural University Baoding071001 China Key Laboratory of Agricultural Big Data of Hebei Province Hebei Agricultural University Baoding071001 China High Performance Computing Platform Beihang University Beijing100191 China School of Software Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China

Mixed polarity Reed-Muller (MPRM) circuit area optimization has become a research hotspot in the field of integrated circuit design. It is a combinatorial optimization, aiming at finding the MPRM expression with the least number of terms among many MPRM expressions. A explosion strategy and restart strategy based whale optimization algorithm (ERWOA) is proposed. In addition, a multi-output MPRM circuit area optimization method is proposed, which uses the improved whale algorithm and the improved polarity conversion algorithm to search for the MPRM circuit with the least number of AND terms. Results on the MCNC Benchmark circuits show that the proposed algorithm increases the conversion efficiency by 99.93% and 99.96% at most, compared with the mixed polarity and inter-polarity conversion algorithms based on the list technology, respectively. Compared with the genetic algorithm and the artificial bee colony algorithm, the improved whale optimization algorithm saves the circuit area up to 18.32% with an average of 5.54%, and 14.41% with an average of 5.00%, respectively. © 2023 Beijing University of Aeronautics and Astronautics (BUAA). All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

LLM Knows Geometry Better than Algebra: Numerical Understanding of LLM-Based Agents in A Trading Arena

arXiv

引用

arXiv 2025年

作者： Ma, Tianmi Du, Jiawei Huang, Wenxin Wang, Wenjie Xie, Liang Zhong, Xian Zhou, Joey Tianyi Hubei Key Laboratory of Transportation Internet of Things Wuhan University of Technology China Hubei Key Laboratory of Big Data Intelligent Analysis and Application Hubei University China Centre for Frontier AI Research Agency for Science Technology and Research Singapore Institute of High Performance Computing Agency for Science Technology and Research Singapore School of Computing National University of Singapore Singapore School of Science Wuhan University of Technology China

Recent advancements in large language models (LLMs) have significantly improved performance in natural language processing tasks. However, their ability to generalize to dynamic, unseen tasks, particularly in numerical reasoning, remains a challenge. Existing benchmarks mainly evaluate LLMs on problems with predefined optimal solutions, which may not align with real-world scenarios where clear answers are absent. To bridge this gap, we design the Agent Trading Arena, a virtual numerical game simulating complex economic systems through zero-sum games, where agents invest in stock portfolios. Our experiments reveal that LLMs, including GPT-4o, struggle with algebraic reasoning when dealing with plain-text stock data, often focusing on local details rather than global trends. In contrast, LLMs perform significantly better with geometric reasoning when presented with visual data, such as scatter plots or K-line charts, suggesting that visual representations enhance numerical reasoning. This capability is further improved by incorporating the reflection module, which aids in the analysis and interpretation of complex data. We validate our findings on NASDAQ STOCK dataset, where LLMs demonstrate stronger reasoning with visual data compared to text. Our code and data are publicly available at https://***/wekjsdvnm/***. © 2025, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：