期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Sub-nano Layers of Li, Be, and Al on the Si(100) Surface: Electronic Structure and Silicide Formation
1
作者 Victor Zavodinsky Oga Gorkusha 《Semiconductor Science and Information Devices》 2023年第1期11-17,共7页
Within the framework of the density functional theory and the pseudopotential method,the electronic structure calculations of the“metal-Si(100)”systems with Li,Be and Al as metal coverings of one to four monolayers(... Within the framework of the density functional theory and the pseudopotential method,the electronic structure calculations of the“metal-Si(100)”systems with Li,Be and Al as metal coverings of one to four monolayers(ML)thickness,were carried out.Calculations showed that band gaps of 1.02 eV,0.98 eV and 0.5 eV,respectively,appear in the densities of electronic states when the thickness of Li,Be and Al coverings is one ML.These gaps disappear with increasing thickness of the metal layers:first in the Li-Si system(for two ML),then in the Al-Si system(for three ML)and then in the Be-Si system(for four ML).This behavior of the band gap can be explained by the passivation of the substrate surface states and the peculiarities of the electronic structure of the adsorbed metals.In common the results can be interpreted as describing the possibility of the formation of a two-dimensional silicide with semiconducting properties in Li-Si(100),Be-Si(100)and Al-Si(100)systems. 展开更多
关键词 Kohn-Sham method PSEUDOPOTENTIALS Si(100)surface Sub-nano metal layers Density of states Two-dimensional silicides Semiconducting properties
下载PDF
The Complete Chromatic Number of Some Planar Graphs~* 被引量:1
2
作者 张忠辅 王建方 +1 位作者 王维凡 王流星 《Science China Mathematics》 SCIE 1993年第10期1169-1177,共9页
Let G be a planar graph without cut vertex, let X_c(G) be the vertex, edge, face-complete chromatic number of G and let p=|V(G)|. This paper proves X_c(G)=Δ(G)+1 if G is an outerplanar graph with Δ(G)≥7, or a high ... Let G be a planar graph without cut vertex, let X_c(G) be the vertex, edge, face-complete chromatic number of G and let p=|V(G)|. This paper proves X_c(G)=Δ(G)+1 if G is an outerplanar graph with Δ(G)≥7, or a high degree planar graph with p≥9 and Δ(G)≥p-2 or a maximal planar graph with Δ(G)≥14. 展开更多
关键词 outerplanar GRAPH high degree PLANAR GRAPH MAXIMAL PLANAR GRAPH COMPLETE CHROMATIC number
原文传递
DP-UserPro:differentially private user profile construction and publication
3
作者 Zheng HUO Ping HE +1 位作者 Lisha HU Huanyu ZHAO 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第5期197-206,共10页
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 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 propose a differentially private user profile construction method DP-UserPro,which is composed of DP-CLIQUE and privately top-κtags selection.DP-CLIQUE is a differentially private high dimensional data cluster algorithm based on CLIQUE.The multidimensional tag space is divided into cells,Laplace noises are added into the count value of each cell.Based on the breadth-first-search,the largest connected dense cells are clustered into a cluster.Then a privately top-κtags selection approach is proposed based on the score function of each tag,to select the most importantκtags which can represent the characteristics of the cluster.Privacy and utility of DP-UserPro are theoretically analyzed and experimentally evaluated in the last.Comparison experiments are carried out with Tag Suppression algorithm on two real datasets,to measure the False Negative Rate(FNR)and precision.The results show that DP-UserPro outperforms Tag Suppression by 62.5%in the best case and 14.25%in the worst case on FNR,and DP-UserPro is about 21.1%better on precision than that of Tag Suppression,in average. 展开更多
关键词 user profile DP-CLIQUE CLUSTERING differential privacy recommender system
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部