|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Link-Privacy Preserving Graph Embedding Data Publication with Adversarial Learning显示文摘The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph,which is amenable to be adopted in traditional machine learning algorithms in favor of vector representations.Graph embedding methods build an important bridge between social network analysis and data analytics,as social networks naturally generate an unprecedented volume of graph data continuously.Publishing social network data not only brings benefit for public health,disaster response,commercial promotion,and many other applications,but also gives birth to threats that jeopardize each individual’s privacy and security.Unfortunately,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social networks.To be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network embedding.In this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links,while persevering sufficient non-sensitive information,such as graph topology and node attributes in graph embedding.Extensive experiments are conducted to evaluate the proposed framework using ground truth social network datasets. | Kainan Zhang Zhi Tian Zhipeng Cai Daehee Seo | 2022 | Tsinghua Science and Technology2022，27，2： | 3 |
| 2 | Facile synthesis of fully ordered L10-FePt nanoparticles with controlled Pt-shell thicknesses for electrocatalysis显示文摘我们为 ~ 的合成报导一条简单一步舞途径 4 nm 制服并且充分 L1 0-ordered 以脸为中心四角形(fct ) FePt nanoparticles (NP ) 在 ~ 嵌入 60 nm MCM-41 (fct-FePt NPs@MCM-41 ) 。我们由与醋酸(HOAc ) 对待 fct-FePt NPs@MCM-41 控制了 fct-FePt NP 的磅壳厚度或盐酸在 sonication 下面的酸(HCl ) ,从而蚀刻 NP 的表面 Fe 原子。扔到碳支持(fct-FePt NP/C ) 上的 fct-FePt NP 被与碳混合 fct-FePt NPs@MCM-41 并且随后用 NaOH 移开 MCM-41 准备。我们也开发了一个灵巧的方法综合由使用一个 HF 答案同时的 surface-Fe 蚀刻和 MCM-41 移动的酸处理的 fct-FePt NP/C。我们学习了 surface-Fe 为甲醇氧化反应(粗腐殖质) 在 fct-FePt NP 的 electrocatalytic 性质上蚀刻和磅壳厚度的效果。与非对待的 fct-FePt NP/C 催化剂相比,对待 HOAc 、对待 HCl 的催化剂展出多达 34% 更大的电气化学地活跃的表面区域(ECASA ) ;另外,对待 HCl 的 fct-FePt NP (与 ~ 1.0 nm 磅壳)/C 催化剂展览最高特定的活动。对待 HF 的 fct-FePt NP/C 展出 ECASA 比那些大几乎 2 倍另外的酸处理的 fct-FePt NP/C 催化剂和表演最高集体的活动(1,435 妈吗?? | Yonghoon Hong Hee Jin Kim Daehee Yang Gaehang Lee Ki Min Nam Myung-Hwa Jung Young-Min Kim Sang-II Choi Won Seok Seo | 2017 | Nano Research2017，10，8： | 2 |
| 3 | Multiple HPV infection in cervical cancer screened by HPVDNAChip?显示文摘 | Sang Ah Lee Daehee Kang Sang Soo Seo Jeongmi Kim Jeong Keun Young Yoo Yong Tark Jeon Jae Weon Kim Noh Hyun Park Soon Beom Kang Hyo Pyo Lee Yong Sang Song | 2003 | Cancer Letters2003，，2： | 1 |
| 4 | An unsupervised anomaly detection framework for detecting anomalies in real time through network system’s log files analysis显示文摘Nowadays,in almost every computer system,log files are used to keep records of occurring events.Those log files are then used for analyzing and debugging system failures.Due to this important utility,researchers have worked on finding fast and efficient ways to detect anomalies in a computer system by analyzing its log records.Research in log-based anomaly detection can be divided into two main categories:batch log-based anomaly detection and streaming log-based anomaly detection.Batch log-based anomaly detection is computationally heavy and does not allow us to instantaneously detect anomalies.On the other hand,streaming anomaly detection allows for immediate alert.However,current streaming approaches are mainly supervised.In this work,we propose a fully unsupervised framework which can detect anomalies in real time.We test our framework on hdfs log files and successfully detect anomalies with an F-1 score of 83%. | Vannel Zeufack Donghyun Kim Daehee Seo Ahyoung Lee | 2021 | High-Confidence Computing2021，1，2： | 0 |
| 5 | Secure verifiable aggregation for blockchain-based federated averaging显示文摘IoT devices’storage and computation capacities are constantly increasing in recent years,which brings critical challenges in data privacy protection.Federated learning(FL)and blockchain technology are two popular tech-niques used in IoT data aggregation,where FL enables data training with privacy protection,and blockchain provides a decentralized architecture for data storage and mining.However,very few the state-of-the-art works consider the applicability of the combination of FL and blockchain.In this paper,we adopt the federated aver-aging algorithm to reduce the communication overhead between the blockchain and end users to achieve higher performance.We also apply the double-mask-then-encrypt approach for end users to submit their local updates in order to protect data privacy.Finally,we propose and implement a non-interactive Public Verifiable Secret Sharing(PVSS)algorithm with Distributed Hash Table(DHT)that solves the user-drop-out problem and improves the communication efficiency between blockchain and end-users.At last,we theoretically analyze the security strengths of the proposed solution and conduct experiments to measure the execution time of PVSS on both the server and clients sides. | Saide Zhu Ruinian Li Zhipeng Cai Donghyun Kim Daehee Seo Wei Li | 2022 | High-Confidence Computing2022，2，1： | 0 |
| 6 | A Novel Transparent and Auditable Fog-Assisted Cloud Storage with Compensation Mechanism显示文摘This paper introduces a new fog-assisted cloud storage which can achieve much higher throughput compared to the traditional cloud-only storage architecture by reducing the traffics toward the cloud storage. The fog-storage service providers are transparency to end-users and therefore, no modification on the end-user devices is necessary. This new system is featured with(1) a stronger audit scheme which is naturally coupled with the proposed architecture and does not suffer from the replay attack and(2) a transparent and efficient compensation mechanism for the fog-storage service providers. We provide rigorous theoretical analysis on the correctness and soundness of the proposed system. To the best of our knowledge, this is the first paper to discuss about a storage data audit scheme for fog-assisted cloud storage as well as the compensation mechanism for the service providers of the fog-storage service providers. | Donghyun Kim Junggab Son Daehee Seo Yeojin Kim Hyobin Kim Jung Taek Seo | 2020 | Tsinghua Science and Technology2020，25，1： | 0 |
| 7 | Few-Shot Graph Classification with Structural-Enhanced Contrastive Learning for Graph Data Copyright Protection显示文摘Open-source licenses can promote the development of machine learning by allowing others to access,modify,and redistribute the training dataset.However,not all open-source licenses may be appropriate for data sharing,as some may not provide adequate protections for sensitive or personal information such as social network data.Additionally,some data may be subject to legal or regulatory restrictions that limit its sharing,regardless of the licensing model used.Hence,obtaining large amounts of labeled data can be difficult,time-consuming,or expensive in many real-world scenarios.Few-shot graph classification,as one application of meta-learning in supervised graph learning,aims to classify unseen graph types by only using a small amount of labeled data.However,the current graph neural network methods lack full usage of graph structures on molecular graphs and social network datasets.Since structural features are known to correlate with molecular properties in chemistry,structure information tends to be ignored with sufficient property information provided.Nevertheless,the common binary classification task of chemical compounds is unsuitable in the few-shot setting requiring novel labels.Hence,this paper focuses on the graph classification tasks of a social network,whose complex topology has an uncertain relationship with its nodes'attributes.With two multi-class graph datasets with large node-attribute dimensions constructed to facilitate the research,we propose a novel learning framework that integrates both meta-learning and contrastive learning to enhance the utilization of graph topological information.Extensive experiments demonstrate the competitive performance of our framework respective to other state-of-the-art methods. | Kainan Zhang DongMyung Shin Daehee Seo Zhipeng Cai | 2024 | Tsinghua Science and Technology2024，29，2： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员