检索结果-南通市图书馆

A Cost-Efficient Approach to Storing Users'Data for Online Social Networks

Journal of Computer Science & Technology 2019年第1期34卷 234-252页

作者： Jing-Ya Zhou Jian-Xi Fan cheng-kuan lin Bao-Lei cheng School of Computer Science and Technology Soochow UniversitySuzhou 215006China Provzncial Key Laboratory for Computer Information Processing Technology Soochow UniversitySuzhou 215006China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing University Nanjing 210023China

As users increasingly befriend others and interact online via their social media accounts,online social networks (OSNs)are expanding *** with the big data generated by users,it is imperative that data storage be distributed,scalable,and *** one of the most significant challenges about this topic is determining how to minimize the cost without deteriorating system *** many storage systems use the distributed key value store,it cannot be directly applied to OSN storage *** because users'data are highly correlated,hash storage leads to frequent inter-server communications,and the high inter-server traffic costs decrease the OSN storage system's scalability. Previous studies proposed conducting network partitioning and data replication based on social ***,data replication increases storage costs and impacts traffic ***,we consider how to minimize costs from the perspective of data storage,by combining partitioning and *** cost-efficient data storage approach supports scalable OSN storage *** proposed approach co-locates frequently interactive users together by conducting partitioning and replication simultaneously while meeting load-balancing *** experiments are undertaken on two real- world traces,and the results show that our approach achieves lower cost compared with state-of-the-art *** we conclude that our approach enables economic and scalable OSN data storage.

关键词： online social network inter-server traffic cost storage cost network partitioning data replication

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Fault-Tolerant Hamiltonicity and Hamiltonian Connectivity of BCube with Various Faulty Elements

引用

Journal of Computer Science & Technology 2020年第5期35卷 1064-1083页

作者： Gui-Juan Wang cheng-kuan lin Jian-Xi Fan Jing-Ya Zhou Bao-Lei cheng School of Computer Science and Technology Soochow UniversitySuzhou 215006China School of Computer Science and Technology Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China College of Mathematics and Computer Science Fuzhou UniversityFuzhou 350108China

BCube is one kind of important data center *** and Hamiltonian connectivity have significant applications in communication *** far,there have been many results concerning fault-tolerant Hamiltonicity and fault-tolerant Hamiltonian connectivity in some data center ***,these results only consider faulty edges and faulty *** this paper,we study the fault-tolerant Hamiltonicity and the fault-tolerant Hamiltonian connectivity of BCube(n,k)under considering faulty servers,faulty links/edges,and faulty *** any integers n≥2 and k≥0,let BCn,k be the logic structure of BCube(n,k)and F be the union of faulty elements of BCn,k,Let fv/fe,and fs be the number of faulty servers,faulty edges,and faulty switches of BCiLbe(n,k),*** show that BCnik-F is fault-tolerant Hamiltonian if fv+fe+(n-1)/s≤(n-1)(k+1)-2 and BCn,k-F is fault-tolerant Hamiltonian-connected ifv,+fe+(n-1)fs≤(n-1)(k+1)-*** the best of our knowledge,this paper is the first work which takes faulty switches into account to study the fault-tolerant Hamiltonicity and the fault-tolerant Hamiltonian connectivity in data center networks.

关键词： data center network BCube fault-tolerance Hamiltonicity Hamiltonian connectivity

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

BCDC： A High-Performance, Server-Centric Data Center Network

引用

Journal of Computer Science & Technology 2018年第2期33卷 400-416页

作者： Xi Wang Jian-Xi Fan cheng-kuan lin Jing-Ya Zhou Zhao Liu School of Computer Science and Technology Soochow University Suzhou 215006 China School of Software and Services Outsourcing Suzhou Institute of Industrial Technology Suzhou 215004 China

The capability of the data center network largely decides the performance of cloud computing. However, the number of servers in the data center network becomes increasingly huge, because of the continuous growth of the application requirements. The performance improvement of cloud computing faces great challenges of how to connect a large number of servers in building a data center network with promising performance. Traditional tree-based data center networks have issues of bandwidth bottleneck, failure of single switch, etc. Recently proposed data center networks such as DCell, FiConn, and BCube, have larger bandwidth and better fault-tolerance with respect to traditional tree-based data center networks. Nonetheless, for DCell and FiConn, the fault-tolerant length of path between servers increases in case of failure of switches; BCube requires higher performance in switches when its scale is enlarged. Based on the above considerations, we propose a new server-centric data center network, called BCDC, based on crossed cube with excellent performance. Then, we study the connectivity of BCDC networks. Furthermore, we propose communication algorithms and fault-tolerant routing algorithm of BCDC networks. Moreover, we analyze the performance and time complexities of the proposed algorithms in BCDC networks. Our research will provide the basis for design and implementation of a new family of data center networks.

关键词： data center network interconnection network crossed cube server-centric fault-tolerant

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optimal Path Embedding in the Exchanged Crossed Cube

引用

Journal of Computer Science & Technology 2017年第3期32卷 618-629页

作者： Dong-Fang Zhou Jian-Xi Fan cheng-kuan lin Bao-Lei cheng Jing-Ya Zhou Zhao Liu School of Computer Science and Technology Soochow University Suzhou 215006 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing University Nanjing 210000 China

The （s＋t＋1）-dimensional exchanged crossed cube, denoted as ECQ（s, t）, combines the strong points of the exchanged hypercube and the crossed cube. It has been proven that ECQ（s, t） has more attractive properties than other variations of the fundamental hypercube in terms of fewer edges, lower cost factor and smaller diameter. In this paper, we study the embedding of paths of distinct lengths between any two different vertices in ECQ（s, t）. We prove the result in ECQ（s, t）： if s≥3, t≥3, for any two different vertices, all paths whose lengths are between max{9,「s＋1/2」＋「t＋1/2＋4}and 2s＋t＋1？1 can be embedded between the two vertices with dilation 1. Note that the diameter of ECQ（s, t） is「s＋1/2 」＋「t＋1/2 」＋2. The obtained result is optimal in the sense that the dilations of path embeddings are all 1. The result reveals the fact that ECQ（s, t） preserves the path embedding capability to a large extent, while it only has about one half edges of CQn.

关键词： interconnection network exchanged crossed cube path embedding parallel computing system

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Optimally Embedding 3-Ary n-Cubes into Grids

引用

Journal of Computer Science & Technology 2019年第2期34卷 372-387页

作者： Wei-Bei Fan Jian-Xi Fan cheng-kuan lin Yan Wang Yue-Juan Han Ru-Chuan Wang School of Computer Science and Technology Soochow University Suzhou 215006 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 China College of Mathematics and Computer Science Fuzhou University Fuzhou 350108 China

The 3-ary n-cube,denoted as Qn3,is an important interconnection network topology proposed for parallel computers,owing to its many desirable properties such as regular and symmetrical structure,and strong scalability,among *** this paper,we first obtain an exact formula for the minimum wirelength to embed Qn3 into *** then propose a load balancing algorithm for embedding Qn3 into a square grid with minimum dilation and ***,we derive an O(N2)algorithm for embedding Qn3 into a gird with balanced communication,where N is the number of nodes in *** experiments are performed to verify the total wirelength and evaluate the network cost of our proposed embedding algorithm.

关键词： 3-ary n-cube embedding algorithm grid interconnection network

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Non-volatile dynamically switchable color display via chalcogenide stepwise cavity resonators

引用

Opto-Electronic Advances 2024年第1期7卷 16-27页

作者： kuan Liu Zhenyuan lin Bing Han Minghui Hong Tun Cao School of Optoelectronic Engineering and Instrumentation Science Dalian University of TechnologyDalian 116024China Pen-Tung Sah Institute of Micro-Nano Science and Technology Xiamen UniversityXiamen 361102China Institute of Laser Engineering Faculty of Materials and ManufacturingBeijing University of TechnologyBeijing 100124China

High-resolution multi-color printing relies upon pixelated optical nanostructures,which is crucial to promote color display by producing nonbleaching colors,yet requires simplicity in fabrication and dynamic *** trisulfide(Sb_(2)S_(3))is a newly rising chalcogenide material that possesses prompt and significant transition of its optical characteristics in the visible region between amorphous and crystalline phases,which holds the key to color-varying ***,we proposed a dynamically switchable color printing method using Sb_(2)S_(3)-based stepwise pixelated Fabry-Pérot(FP)cavities with various cavity *** device was fabricated by employing a direct laser patterning that is a less timeconsuming,more approachable,and low-cost *** switching the state of Sb_(2)S_(3) between amorphous and crystalline,the multi-color of stepwise pixelated FP cavities can be actively *** color variation is due to the profound change in the refractive index of Sb_(2)S_(3) over the visible spectrum during its phase ***,we directly fabricated sub-50 nm nano-grating on ultrathin Sb_(2)S_(3) laminate via microsphere 800-nm femtosecond laser irradiation in far *** minimum feature size can be further decreased down to~45 nm(λ/17)by varying the thickness of Sb_(2)S_(3) *** switchable Sb_(2)S_(3) photonic devices can take one step toward the next generation of inkless erasable papers or displays and enable information encryption,camouflaging surfaces,anticounterfeiting,***,our work explores the prospects of rapid and rewritable fabrication of periodic structures with nano-scale resolution and can serve as a guideline for further development of chalcogenide-based photonics components.

关键词： tunable color displays Fabry-Pérot cavity resonators color printing chalcogenide materials

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The Minimum Centroid Branch Spanning Tree Problem

引用

Journal of the Operations Research Society of China 2024年第2期12卷 528-539页

作者： Hao lin cheng He School of Science Henan University of TechnologyZhengzhou450001HenanChina

For a spanning tree T of graph G,the centroid of T is a vertex v for which the largest component of T-v has as few vertices as *** number of vertices of this component is called the centroid branch weight of *** minimum centroid branch spanning tree problem is to find a spanning tree T of G such that the centroid branch weight is *** application to design of communication networks,the loads of all branches leading from the switch center should be as balanced as *** this paper,we prove that the problem is strongly NP-hard even for bipartite ***,the problem is shown to be polynomially solvable for split graphs,and exact formulae for special graph familis,say Kn_(1),n_(2),...,n_(k)and P_(m)×P_(n),are presented.

关键词： Spanning tree optimization Centroid branch-NP-hardness Polynomial-time algorithm

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Precise mapping of hilar cholangiocarcinoma with a skip lesion by SpyGlass cholangioscopy:A case report

引用

World Journal of Gastrointestinal Surgery 2023年第5期15卷 965-971页

作者： cheng-Han Chiang kuan-Chih Chen Benedict Devereaux Chen-Shuan Chung Kuei-Chang Kuo Chien Chu lin cheng-kuan lin Hsiu-Po Wang Kuo-Hsin Chen Division of Gastroenterology and Hepatology Department of Internal MedicineXin-Tai General HospitalNew Taipei 242063Taiwan Department of Internal Medicine Far Eastern Memorial HospitalNew Taipei 22060Taiwan Department of Gastroenterology Royal Brisbane and Women's HospitalHerston 4029QueenslandAustralia Department of Internal Medicine College of MedicineNational Taiwan UniversityTaipei 10002Taiwan Department of Surgery Far Eastern Memorial HospitalNew Taipei 22060Taiwan

BACKGROUND Cholangiocarcinoma(CC)is a very aggressive cancer with a poor *** surgery is the only curative therapy,preoperative evaluation of the tumor extent is essential for surgical *** high-quality image modalities such as computed tomography and magnetic resonance imaging have been used extensively in preoperative evaluation,the accuracy is *** obtain precise localization of tumor spread arising from the hilar region preoperatively,the development of an acceptable imaging modality is still an unmet *** SUMMARY A 52-year-old female presented to our emergency department with jaundice,abdominal pain,and ***,she was treated for *** retrograde cholangiopancreatography with the cholangiogram showed long segment filling defect in the common hepatic duct with dilatation of bilateral intrahepatic *** biopsy was performed,and the pathology suggested intraductal papillary neoplasm with high-grade *** treatment of cholangitis,contrasted-enhanced computed tomography revealed a hilar lesion with undetermined Bismuth-Corlette *** cholan gioscopy showed that the lesion involved the confluence of the common hepatic duct with one skip lesion in the posterior branch of the right intrahepatic duct,which was not detected by previous image *** surgical plan was modified from extended left hepatectomy to extended right *** final diagnosis was hilar CC,*** patient has remained disease-free for more than 3 *** SpyGlass cholangioscopy may have a role in precision localization of hilar CC to provide surgeons with more information before the operation.

关键词： Hilar cholangiocarcinoma Jaundice SpyGlass cholangioscopy Bismuth-Corlette classification Hepatectomy Case report

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Unified Classification and Rejection:A One-versus-all Framework

引用

Machine Intelligence Research 2024年第5期21卷 870-887页

作者： Zhen cheng Xu-Yao Zhang cheng-lin Liu State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of AutomationChinese Academy of SciencesBeijing100190China School of Artificial Intelligence University of Chinese Academy of SciencesBeijing100049China

Classifying patterns of known classes and rejecting ambiguous and novel(also called as out-of-distribution(OOD))inputs are involved in open world pattern *** neural network models usually excel in closed-set classification while perform poorly in rejecting OOD *** tackle this problem,numerous methods have been designed to perform open set recognition(OSR)or OOD rejection/detection *** methods mostly take post-training score transformation or hybrid models to ensure low scores on OOD inputs while separating known *** this paper,we attempt to build a unified framework for building open set classifiers for both classification and OOD *** formulate the open set recognition of K-known-class as a(K+1)-class classification problem with model trained on known-class samples *** decomposing the K-class problem into K one-versus-all(OVA)binary classification tasks and binding some parameters,we show that combining the scores of OVA classifiers can give(K+1)-class posterior probabilities,which enables classification and OOD rejection in a unified *** maintain the closed-set classification accuracy of the OVA trained classifier,we propose a hybrid training strategy combining OVA loss and multi-class cross-entropy *** implement the OVA framework and hybrid training strategy on the recently proposed convolutional prototype network and prototype classifier on vision transformer(ViT)*** on popular OSR and OOD detection datasets demonstrate that the proposed framework,using a single multi-class classifier,yields competitive performance in closed-set classification,OOD detection,and misclassification *** code is available at https://***/zhen-cheng121/CPN_OVA_unified.

关键词： Open set recognition out-of-distribution detection misclassification detection convolutional prototype network oneversus-all Dempster-Shafer theory of evidence

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Reactor field reconstruction from sparse and movable sensors using Voronoi tessellation-assisted convolutional neural networks

引用

Nuclear Science and Techniques 2024年第5期35卷 173-185页

作者： He-lin Gong Han Li Dunhui Xiao Sibo cheng Paris Elite Institute of Technology Shanghai Jiao Tong UniversityShanghai 200240China School of Mathematical Sciences Tongji UniversityShanghai 200092China Department of Computing Data Science InstituteImperial College LondonLondon SW72AZUK

The aging of operational reactors leads to increased mechanical vibrations in the reactor *** vibration of the incore sensors near their nominal locations is a new problem for neutronic field *** field-reconstruction methods fail to handle spatially moving *** this study,we propose a Voronoi tessellation technique in combination with convolutional neural networks to handle this *** from movable in-core sensors were projected onto the same global field structure using Voronoi tessellation,holding the magnitude and location information of the *** convolutional neural networks were used to learn maps from observations to the global *** proposed method reconstructed multi-physics fields(including fast flux,thermal flux,and power rate)using observations from a single field(such as thermal flux).Numerical tests based on the IAEA benchmark demonstrated the potential of the proposed method in practical engineering applications,particularly within an amplitude of 5 cm around the nominal locations,which led to average relative errors below 5% and 10% in the L_(2) and L_(∞)norms,respectively.

关键词： Voronoi tessellation Field reconstruction Nuclear reactors Reactor physics On-line monitoring

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：