检索结果-南通市图书馆

Nanoimprint lithography-assisted block copolymer self-assembly for hyperfine fabrication of magnetic patterns based on L10-FePt nanoparticles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China Chemistry 2025年

作者： Jie Zhang Yi Chen Guijun Li Zelin Sun Zhengong Meng wai-Yeung wong Department of Applied Biology and Chemical Technology and Research Institute for Smart Energy The Hong Kong Polytechnic University The Hong Kong Polytechnic University Shenzhen Research Institute Division of Integrative Systems and Design and Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology School of Flexible Electronics (Future Technology) and Institute of Advanced Materials (IAM) Nanjing Tech University

L10-FePt-type bit-patterned media has provided a promising alternative for ultrahigh-density magnetic recording systems in the current digital era, but rapid fabrication of magnetic patterns with hyperfine bit islands is still challenging, especially with the target for miniaturization and scalable production simultaneously. Herein, Fe,Pt-containing block copolymers were utilized as single-source precursors for solution-processable patterning and subsequent generation of the demanding magnetic FePt dots by in situ pyrolysis. High-throughput nanoimprint lithography was initially employed to fabricate the predefined bit cells precisely,and then the intrinsic self-assembly of phase-separated block copolymers further drove the formation of accurate bit *** from the synergistic effect of top-down lithographic approach and bottom-up self-assembly, the customizable patterns could be achieved for large-scale mass production in targeted areas, but high-density isolated dots could also be accurately aligned along the patterned features after subsequent self-assembly. This reliable strategy would provide a good avenue to precisely construct ultrahigh-density magnetic data storage devices.

关键词：

Genome of tropical bed bug Cimex hemipterus(Cimicidae,Hemiptera)reveals tetraspanin expanded in bed bug ancestor

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Insect Science 2025年第1期32卷 42-54页

作者： Sean Tsz Sum Law Wenyan Nong Chade Li Tze Kiu Chong Ho Yin Yip Thomas Swale Siu wai Chiu Roger Yat-Nork Chung Hon-Ming Lam Samuel Y.S.wong Hung wong Jerome H.L.Hui School of Life Sciences Simon F.S.Li Marine Science LaboratoryState Key Laboratory of AgrobiotechnologyInstitute of EnvironmentEnergy and SustainabilityThe Chinese University of Hong KongHong KongChina Dovetail Genomics The United States of America School of Life Sciences The Chinese University of Hong KongHong KongChina School of Public Health and Primary Care CUHK Institute of Health EquityThe Chinese University of Hong KongHong KongChina School of Life Sciences State Key Laboratory of AgrobiotechnologyInstitute of EnvironmentEnergy and SustainabilityThe Chinese University of Hong KongHong KongChina Department of Social Work CUHK Institute of Health EquityInstitute of EnvironmentEnergy and SustainabilityThe Chinese University of Hong KongHong KongChina

Cimex species are ectoparasites that exclusively feed on warm-blooded animals such as birds and *** cimicid species are known to be persistent pests for humans,including the tropical bed bug Cimex hemipterus,common bed bug Cimex lectularius,and Eastern bat bug Leptocimex *** date,genomic information is restricted to the common bed bug ***,which limits understanding their biology and to provide controls of bed bug ***,a chromosomal-level genome assembly of ***(495 Mb[megabase pairs])contained on 16 pseudochromosomes(scaffold N50=34 Mb),together with 9 messenger RNA and small RNA transcriptomes were *** comparison between hemipteran genomes,we found that the tetraspanin superfamily was expanded in the Cimex *** study provides the first genome assembly for the tropical bed bug ***,and offers an unprecedented opportunity to address questions relating to bed bug infestations,as well as genomic evolution to hemipterans more widely.

关键词： bedbug genome microRNA sesquiterpenoid tetraspanin

Full Friendly Index Sets of Cartesian Products of Two Cycles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2010年第7期26卷 1233-1244页

作者： wai chee SHIU Department of Mathermatics Hong Kong Baptist University

Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊： E → Z2 defined by f＊（xy） = f（x）＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i... 详细信息

Let G =（V, E） be a connected simple graph. A labeling f ： V → Z2 induces an edge labeling f＊： E → Z2 defined by f＊（xy） = f（x）＋f（y） for each xy ∈ E. For i ∈ Z2, let vf（i） = ｜f^-1（i）｜ and ef（i） = ｜f＊^-1（i）｜. A labeling f is called friendly if ｜vf（1） - vf（0）｜ ≤ 1. For a friendly labeling f of a graph G, we define the friendly index of G under f by if（G） = e（1） - el（0）. The set [if（G）｜ f is a friendly labeling of G} is called the full friendly index set of G, denoted by FFI（G）. In this paper, we will determine the full friendly index set of every Cartesian product of two cycles.

关键词： vertex labeling friendly labeling friendly index set Cartesian product of two cycles

Super-edge-graceful Labelings of Some Cubic Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2006年第6期22卷 1621-1628页

作者： wai chee SHIU Department of Mathematics Hong Kong Baptist University

The notion of super-edge-graceful graphs was introduced by Mitchem and Simoson in ***, few examples except trees are known. In this paper, we exhibit two classes of infinitely many cubic graphs which are super-edge-gr... 详细信息

关键词： super-edge-graceful cubic graph permutation cubic graph permutation Petersen graph,permutation ladder graph

Optimal location query based on k nearest neighbours

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2021年第2期15卷 105-117页

作者： Yubao LIU Zitong CHEN Ada wai-chee FU Raymond Chi-Wing wong Genan DAI School of Data and Computer Science Sun Yat-Sen UniversityGuangzhou510006China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006China Department of Computer Science and Engineering Chinese University of Hong KongHong Kong999077China Department of Computer Science and Engineering The Hong Kong University of Science and TechnologyHong Kong999077China

Optimal location query in road networks is a basic operation in the location intelligence *** a set of clients and servers on a road network,the purpose of optimal location query is to obtain a location for a new server,so that a certain objective function calculated based on the locations of clients and servers is *** works assume no labels for servers and that a client only visits the nearest *** assumptions are not realistic and it renders the existing work not useful in many *** this paper,we relax these assumptions and consider the k nearest neighbours(KNN)of *** introduce the problem of KNN-based optimal location query(KOLQ)which considers the k nearest servers of clients and labeled *** also introduce a variant problem called relocation KOLQ(RKOLQ)which aims at relocating an existing server to an optimal *** main analysis algorithms are proposed for these *** experiments on the real road networks illustrate the efficiency of our proposed solutions.

关键词： optimal location query k nearest neighbours road network

Distance signless Laplacian spectrum of a graph

在线全文

学校读者我要写书评

暂无评论

Frontiers of Mathematics in China 2022年第4期17卷 653-672页

作者： Huicai JIA wai chee SHIU College of Science Henan University of EngineeringZhengzhou451191China Department of Mathematics The Chinese University of Hong KongHong KongChina

Let G be a simple connected graph with n *** transmission Tv of a vertex v is defined to be the sum of the distances from v to all other vertices in G,that is,T_(v)=Σ_(u)∈Vd_(uv),where duv denotes the distance between u and *** T_(1),…,T_(n)be the transmission sequence of *** D=(dij)_(n×n)be the distance matrix of G,and T be the transmission diagonal matrix diag(T_(1),…,T_(n)).The matrix Q(G)=T+D is called the distance signless Laplacian of *** this paper,we provide the distance signless Laplacian spectrum of complete k-partite graph,and give some sharp lower and upper bounds on the distance signless Laplacian spectral radius q(G).

关键词： Distance signless Laplacian spectral radius bound

L(j,k)-number of Direct Product of Path and Cycle

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2013年第8期29卷 1437-1448页

作者： wai chee SHIU Qiong WU Department of Mathematics Hong Kong Baptist University

For positive numbers j and k, an L（j,k）-labeling f of G is an assignment of numbers to vertices of G such that ｜f（u）-f（v）｜≥j if uv∈E（G）, and ｜f（u）-f（v）｜≥k if d（u,v）=2. Then the span of f is the difference between the maximum and the minimum numbers assigned by f. The L（j,k）-number of G, denoted by λj,k（G）, is the minimum span over all L（j,k）-labelings of G. In this paper, we give some results about the L（j,k）-number of the direct product of a path and a cycle for j≤k.

关键词： L(j k)-labeling product of a path and a cycle

Graphs Whose Critical Groups Have Larger Rank

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2011年第9期27卷 1663-1670页

作者： Yao Ping HOU wai chee SHIU wai Hong CHAN Departement of Mathematics Hu'nan Normal University Changsha 410081 P. R. China Department of Mathematics Hong Kong Baptist University Kowloon Tong Hong Kong P. R. China

The critical group C（G） of a graph G is a refinement of the number of spanning trees of the graph and is closely connected with the Laplacian matrix. Let r（G） be the minimum number of generators （i.e., the rank） of the group C（G） and β（G） be the number of independent cycles of G. In this paper, some forbidden induced subgraphs axe given for r（G） = n - 3 and all graphs with r（G） = j3（G） = n - 3 are characterized

关键词： Critical group of a graph Laplacian matrix Smith normal form

k-Factors in Regular Graphs

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2008年第7期24卷 1213-1220页

作者： wai chee SHIU Gui Zhen LIU Department of Mathematics Hong Kong Baptist University Hong Kong P. R. China School of Mathematics and Systems Science Shandong University Ji'nan P. R. China

Plesnik in 1972 proved that an （m - 1）-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular （2n ＋ 1）-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and （or） excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik＇s result and the results obtained by Liu et al. in 1998, and improve Katerinis＇ result obtained 1993. Furthermore, we show that the results in this paper are the best possible.

关键词： regular graph k-factor edge-connectivity