检索结果-南通市图书馆

On the upper bounds of (1,0)-super solutions for the regular balanced random (k,2s)-SAT problem

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of computer science 2024年第4期18卷 139-146页

作者： Yongping WANG Daoyun XU Jincheng ZHOU School of information Guizhou University of Finance and EconomicsGuiyang 550025China college of computer science and Technology Guizhou UniversityGuiyang 550025China School of computer and information Qiannan Normal University for NationalitiesDuyun 558000China Key Laboratory of Complex Systems and Intelligent Optimization of guizhou Province Duyun 558000China

This paper explores the conditions which make a regular balancedrandom(k,2s)-CNFformula(1,O)-unsatisfiable with high *** conditions also make a random instance of the regular balanced(k-1,2(k-1)s)-SAT problem unsatisfiable with high probability,where the instance obeys a distribution which differs from the distribution obeyed by a regular balanced random(k-1,2(k-1)s)-CNF *** F be a regular balanced random(k,2s)-CNF formula where k≥3,then there exists a number so such that F is(1,O)-unsatisfiable with high probability if s>so.A numerical solution of the number so when k e(5,6,...,14)is given to conduct simulated *** simulated experiments verify the theoretical ***,the experiments also suggest that F is(1,O)-satisfiable with high probability if s is less than a certain value.

关键词： regular balanced random(k,2s)-SAT problem (1,0)-super solution upper bound

An Innovative K-Anonymity Privacy-Preserving Algorithm to Improve Data Availability in the Context of Big Data

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2024年第4期79卷 1561-1579页

作者： Linlin Yuan Tiantian Zhang Yuling Chen Yuxiang Yang Huang Li State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China college of information Engineering Guizhou Open UniversityGuiyang550025China guizhou Academy of Tobacco science Guiyang550025China

The development of technologies such as big data and blockchain has brought convenience to life,but at the same time,privacy and security issues are becoming more and more *** K-anonymity algorithm is an effective and low computational complexity privacy-preserving algorithm that can safeguard users’privacy by anonymizing big ***,the algorithm currently suffers from the problem of focusing only on improving user privacy while ignoring data *** addition,ignoring the impact of quasi-identified attributes on sensitive attributes causes the usability of the processed data on statistical analysis to be *** on this,we propose a new K-anonymity algorithm to solve the privacy security problem in the context of big data,while guaranteeing improved data ***,we construct a new information loss function based on the information quantity *** that different quasi-identification attributes have different impacts on sensitive attributes,we set weights for each quasi-identification attribute when designing the information loss *** addition,to reduce information loss,we improve K-anonymity in two ***,we make the loss of information smaller than in the original table while guaranteeing privacy based on common artificial intelligence algorithms,i.e.,greedy algorithm and 2-means clustering *** addition,we improve the 2-means clustering algorithm by designing a mean-center method to select the initial center of ***,we design the K-anonymity algorithm of this scheme based on the constructed information loss function,the improved 2-means clustering algorithm,and the greedy algorithm,which reduces the information ***,we experimentally demonstrate the effectiveness of the algorithm in improving the effect of 2-means clustering and reducing information loss.

关键词： Blockchain big data K-anonymity 2-means clustering greedy algorithm mean-center method

Luminescence properties and optical sensing behaviors of Sr_(2)GdSbO_(6):Eu^(3+) phosphors

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Rare Earths 2024年第8期42卷 1458-1469,I0002页

作者： Youfa Tai Ruirui Cui Jun Zhang Chunkai Wang Tingyu Zhao Beiqiao Zhang Chaoyong Deng Key Laboratory of Functional Composite Materials of guizhou Province College of Big Data and Information EngineeringGuizhou UniversityGuiyang550025China college of computer and information Engineering Guizhou University of CommerceGuiyang550014China School of Electronics and information Engineering Guiyang UniversityGuiyang550005China

Novel orange-red Sr_(2)GdSbO_(6):xEu^(3+)(x=0,0.05,0.1,0.2,0.3,0.4,0.5 and 0.6) phospho rs were successfully prepared by the traditional high-temperature solid-state *** results of Rietveld refinement,energy dispersive spectroscopy(EDS) spectrum and elemental mapping demonstrate that Eu^(3+) successfully replaces the Gd^(3+) sites and distributes uniformly in the particles of *** luminescence properties of Sr_(2)GdSbO_(6):Eu_(3+)phosphors were investigated in *** emission spectra of the strongest emission peak is the ^(5)D_(0)→^(7)F_(1)(593 nm) transition,which can emit orange-red light under393 nm *** the doping concentration of Eu3+ions is x=0.2,the luminescence intensity of the phosphors reaches the *** detailed mechanism of concentration quenching is attributed to dipole-dipole *** thermal stability values of Sr_(2)GdSbO_(6):0.2Eu^(3+) phosphors are 87%,82% and114% under 393,467 and 527 nm excitations,*** causes of the abnormal thermal quenching under 527 nm excitation were *** on the abnormal thermal quenching under527 nm excitation,the optical thermometry properties of Sr_(2)GdSbO_(6):0.2Eu^(3+)phosphors were investigated by fluorescence intensity ratio(FIR) technique,and appreciable relative sensitivity was *** results suggest that Sr_(2)GdSbO_(6):0.2Eu^(3+)phosphors can be potentially applied to w-LEDs and optical thermometers.

关键词： Sr_(2)GdSbO_(6):Eu^(3+) Phosphors Luminescence properties Abnormal thermal quenching Rare earths

维普期刊数据库

Sparse representation scheme with enhanced medium pixel intensity for face recognition

在线全文

学校读者我要写书评

暂无评论

CAAI Transactions on Intelligence Technology 2024年第1期9卷 116-127页

作者： Xuexue Zhang Yongjun Zhang Zewei Wang Wei Long Weihao Gao Bob Zhang State Key Laboratory of Public Big Data Institute for Artificial IntelligenceCollege of Computer Science and TechnologyGuizhou UniversityGuiyangGuizhouChina Department of computer and information science University of MacaoAvenida da UniversidadeTaipaMacaoChina

Sparse representation is an effective data classification algorithm that depends on the known training samples to categorise the test *** has been widely used in various image classification *** in sparse representation means that only a few of instances selected from all training samples can effectively convey the essential class-specific information of the test sample,which is very important for *** deformable images such as human faces,pixels at the same location of different images of the same subject usually have different ***,extracting features and correctly classifying such deformable objects is very ***,the lighting,attitude and occlusion cause more *** the problems and challenges listed above,a novel image representation and classification algorithm is ***,the authors’algorithm generates virtual samples by a non-linear variation *** method can effectively extract the low-frequency information of space-domain features of the original image,which is very useful for representing deformable *** combination of the original and virtual samples is more beneficial to improve the clas-sification performance and robustness of the ***,the authors’algorithm calculates the expression coefficients of the original and virtual samples separately using the sparse representation principle and obtains the final score by a designed efficient score fusion *** weighting coefficients in the score fusion scheme are set entirely ***,the algorithm classifies the samples based on the final *** experimental results show that our method performs better classification than conventional sparse representation algorithms.

关键词： computer vision face recognition image classification image representation

DeepOCL:A deep neural network for Object Constraint Language generation from unrestricted nature language

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

CAAI Transactions on Intelligence Technology 2024年第1期9卷 250-263页

作者： Yilong Yang Yibo Liu Tianshu Bao Weiru Wang Nan Niu Yongfeng Yin School of Software Beihang UniversityBeijingChina college of computer science and Technology Guizhou UniversityGuiyangGuizhouChina Faculty of information Technology Beijing University of TechnologyBeijingChina Department of Electrical Engineering and computer sciences University of CincinnatiCincinnatiOhioUSA

Object Constraint Language(OCL)is one kind of lightweight formal specification,which is widely used for software verification and validation in NASA and Object Management Group *** OCL provides a simple expressive syntax,it is hard for the developers to write correctly due to lacking knowledge of the mathematical foundations of the first-order logic,which is approximately half accurate at the first stage of devel-opment.A deep neural network named DeepOCL is proposed,which takes the unre-stricted natural language as inputs and automatically outputs the best-scored OCL candidates without requiring a domain conceptual model that is compulsively required in existing rule-based generation *** demonstrate the validity of our proposed approach,ablation experiments were conducted on a new sentence-aligned dataset named *** experiments show that the proposed DeepOCL can achieve state of the art for OCL statement generation,scored 74.30 on BLEU,and greatly outperformed experienced developers by 35.19%.The proposed approach is the first deep learning approach to generate the OCL expression from the natural *** can be further developed as a CASE tool for the software industry.

关键词： deep learning OCL software engineering

Unlocking high-efficiency oxygen evolution reaction through Co-N coordination engineering in Co@N-doped porous carbon core–shell nanoparticles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Nano Research 2024年第8期17卷 7068-7076页

作者： Shucheng Liu Yu Shuai Xiaosi Qi Zhao Ding Yi Liu college of Big Data and information Engineering Guizhou UniversityGuiyang 550025China college of Physics Guizhou Province Key Laboratory for Photoelectrics Technology and ApplicationGuizhou UniversityGuiyang 550025China

Modulation of metal sites coordination can significantly refine the electronic architecture of catalysts,thereby improving their catalytic *** work successfully developed a core–shell Co@N-doped porous carbon(Co@NC)catalyst by pyrolyzing the COF/MOF(IISERP-COF3/ZIF-67)composite in an inert *** Co@NC catalyst exhibited impressive oxygen evolution reaction(OER)performance,with a small overpotential of 304 mV and a modest Tafel slope of 88.6 mV·dec^(−1) in a 1 M KOH,alongside remarkable stability,maintaining 98.5%of its activity over 13 *** role of IISERP-COF3 was pivotal in preventing Co atom aggregation during the ZIF-67 pyrolysis,which facilitated the creation of mesopores for enhanced mass transport and ***,it effectively modulated the Co-N coordination to fine-tune the electronic structure,thereby optimizing the catalyst's capacity for adsorption of intermediates and boosting its intrinsic *** functional theory(DFT)studies corroborate that the exceptional OER efficiency of Co@NC can be linked to the enhanced Co-N coordination,optimizing the localized electronic structure at the Co active *** study not only proposes an innovative approach for optimizing COF/MOF as effective electrocatalysts but also clears the path for the emergence of affordable,high-performance alternatives to precious metal-based catalysts,marking a significant advancement in sustainable energy technologies.

关键词： covalent organic framework(COF) metal-organic framework(MOF) core-shell structure catalysts oxygen evolution reaction

A Distributed Adaptive Second-Order Latent Factor Analysis Model

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第11期11卷 2343-2345页

作者： Jialiang Wang Weiling Li Xin Luo the School of computer science and Technology Dongguan University of Technology the college of computer and information science Southwest University

Dear Editor,This letter presents a distributed adaptive second-order latent factor(DAS) model for addressing the issue of high-dimensional and incomplete data representation. Compared with first-order optimizers, a second-order optimizer has stronger ability in approaching a better solution when dealing with the non-convex optimization problems, thus obtaining better performance in extracting the latent factors(LFs) well representing the known information from high-dimensional and incomplete data.

关键词： Particle swarm optimization (PSO)

Blockchain-Based Key Management Scheme Using Rational Secret Sharing

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

computers, Materials & Continua 2024年第4期79卷 307-328页

作者： Xingfan Zhao Changgen Peng Weijie Tan Kun Niu State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China guizhou Big Data Academy Guizhou UniversityGuiyang550025China

Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of ***,decentralized threshold key management schemes have become a research focus for blockchain private key *** security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset *** threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public *** design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public *** proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart *** to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.

关键词： Blockchain smart contract rational secret sharing key management

Expression Complementary Disentanglement Network for Facial Expression Recognition

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第3期33卷 742-752页

作者： Shanmin WANG Hui SHUAI Lei ZHU Qingshan LIU college of computer science and Technology Nanjing University of Aeronautics and Astronautics college of computer and Software Nanjing University of Information Science and Technology School of information and Control Nanjing University of Information Science and Technology

Disentangling facial expressions from other disturbing facial attributes in face images is an essential topic for facial expression *** methods only care about facial expression disentanglement(FED)itself,ignoring the negative effects of other facial *** to the annotations on limited facial attributes,it is difficult for existing FED solutions to disentangle all disturbance from the input *** solve this issue,we propose an expression complementary disentanglement network(ECDNet).ECDNet proposes to finish the FED task during a face reconstruction process,so as to address all facial attributes during *** from traditional reconstruction models,ECDNet reconstructs face images by progressively generating and combining facial appearance and matching *** designs the expression incentive(EIE) and expression inhibition(EIN) mechanisms,inducing the model to characterize the disentangled expression and complementary parts *** geometry and appearance,generated in the reconstructed process,are dealt with to represent facial expressions and complementary parts,*** combination of distinctive reconstruction model,EIE,and EIN mechanisms ensures the completeness and exactness of the FED *** results on RAF-DB,AffectNet,and CAER-S datasets have proven the effectiveness and superiority of ECDNet.

关键词： Geometry Image recognition Annotations Face recognition Task analysis Image reconstruction Facial features