检索结果-内蒙古大学图书馆

Efficient Communication in Wireless Sensor Networks Using Optimized Energy Efficient Engroove Leach Clustering Protocol

引用

Tsinghua science and Technology 2024年第4期29卷 985-1001页

作者： N.Meenakshi Sultan Ahmad A.V.Prabu J.Nageswara Rao Nashwan Adnan Othman Hikmat A.M.Abdeljaber R.Sekar Jabeen Nazeer SRM Institute of Science and Technology KattankulathurChennai 603203India Department of Computer Science College of Computer Engineering and SciencesPrince Sattam Bin Abdulaziz UniversityAlkharj 11942Saudi Arabia University Center for Research and Development(UCRD) Department of Computer Science and EngineeringChandigarh UniversityGharuanMohali 140413India Department of ECE Koneru Lakshmaiah Education FoundationVaddeswaramGuntur 522502India Department of Computer Science and Engineering Lakireddy Balireddy College of Engineering(A)NTR District 521230India Department of Computer Engineering College of EngineeringKnowledge UniversityErbil 44001Iraq Department of Computer Science Faculty of Information TechnologyApplied Science Private UniversityAmman 11937Jordan Department of Electronics and Communication Engineering(ECE) School of EngineeringPresidency UniversityBangalore 834001India

The Wireless Sensor Network(WSN)is a network that is constructed in regions that are inaccessible to human *** widespread deployment of wireless micro sensors will make it possible to conduct accurate environmental monitoring for a use in both civil and military *** make use of these data to monitor and keep track of the physical data of the surrounding environment in order to ensure the sustainability of the *** data have to be picked up by the sensor,and then sent to the sink node where they may be *** nodes of the WSNs are powered by batteries,therefore they eventually run out of *** energy restriction has an effect on the network life span and environmental *** objective of this study is to further improve the Engroove Leach(EL)protocol’s energy efficiency so that the network can operate for a very long time while consuming the least amount of *** lifespan of WSNs is being extended often using clustering and routing *** Meta Inspired Hawks Fragment Optimization(MIHFO)system,which is based on passive clustering,is used in this study to do *** cluster head is chosen based on the nodes’residual energy,distance to neighbors,distance to base station,node degree,and node *** on distance,residual energy,and node degree,an algorithm known as Heuristic Wing Antfly Optimization(HWAFO)selects the optimum path between the cluster head and Base Station(BS).They examine the number of nodes that are active,their energy consumption,and the number of data packets that the BS *** overall experimentation is carried out under the MATLAB *** the analysis,it has been discovered that the suggested approach yields noticeably superior outcomes in terms of throughput,packet delivery and drop ratio,and average energy consumption.

关键词： wireless sensor networks energy efficient engroove leach protocol meta inspired Hawks fragment optimization heuristic wing antfly optimization

来源：评论

学校读者我要写书评

暂无评论

A fast rigid registration algorithm for medical images

引用

Journal of Fiber Bioengineering and Informatics 2014年第3期7卷 409-418页

作者： Feng, Yuncong Li, Xiongfei Zhang, Xiaoli Ding, Tienan Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China Department of Computer Science and Technology Changchun China

Image registration is a vital research branch in medical image processing and analysis. In this paper, we proposed a new framework for rigid medical image registration. It can also be regarded as a pre-processing of non-rigid image registration algorithms. The interest of the algorithm lies in its simplicity and high e±ciency. In the registration algorithm, we firstly segmented the reference image and °oat image into two parts: tissue parts and background parts. Then the centers of the two images were located through performing distance transform on the two segmented tissue images. Finally, we detected the longest radius of the two tissue regions, by which we determined the rotating angle. We tested the registration algorithm on dozens of medical images, and the experimental results show us that the algorithm is competent for medical image registration.

关键词： Image registration

来源：评论

学校读者我要写书评

暂无评论

Geometric intuition and algorithms for Eυ-SVM

引用

Journal of Machine Learning Research 2015年 16卷 323-369页

作者： Barbero, Álvaro Takeda, Akiko López, Jorge Department of Computer Science Knowledge-Engineering Institute Autonomous University of Madrid Madrid Spain Department of Mathematical Informatics University of Tokyo Tokyo Japan

In this work we address the Eυ-SVM model proposed by Pérez-Cruz et al. as an extension of the traditional υ support vector classification model (υ-SVM). Through an enhancement of the range of admissible values for the regularization parameter υ, the Eυ-SVM has been shown to be able to produce a wider variety of decision functions, giving rise to a better adaptability to the data. However, while a clear and intuitive geometric interpretation can be given for the υ-SVM model as a nearest-point problem in reduced convex hulls (RCH-NPP), no previous work has been made in developing such intuition for the Eυ-SVM model. In this paper we show how Eυ-SVM can be reformulated as a geometrical problem that generalizes RCH-NPP, providing new insights into this model. Under this novel point of view, we propose the RAPMINOS algorithm, able to solve Eυ-SVM more efficiently than the current methods. Furthermore, we show how RAPMINOS is able to address the Eυ-SVM model for any choice of regularization norm p≥1 seamlessly, which further extends the SVM model flexibility beyond the usual Eυ-SVM models. ©2015 Álvaro Barbero, Akiko Takeda and Jorge López.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Degradation modeling of degradable copolymers for biomimetic scaffolds

引用

Friction 2020年第3期8卷 594-603页

作者： Taohong ZHANG Yue GAO Lingling ZHU Qingfeng ZENG Ming ZHOU Computer Department School of Computer&Communication EngineeringUniversity of Science and Technology Beijing(USTB)Beijing 100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing 100083China State Key Laboratory of Tribology School of Mechanical EngineeringTsinghua UniversityBeijing 100084China

Biomimetic scaffolds provide a suitable growth environment for tissue engineering and demonstrate good potential for application in biomedical ***-sized copolymerized biomimetic scaffolds degrade differently,and the degradation rate is affected by the copolymerization *** study of the degradation property is the foundational research necessary for realizing individualized biomimetic scaffold *** degradation performance of polyesters with different copolymerization ratios has been widely reported;however,the modeling of this performance has been rarely *** this research,the degradation of copolymers was studied with multi-scale modeling,in which the copolymers were dispersed in a cellular manner,the chain break time was simulated,and the chain selection was based on the Monte Carlo(MC)*** probability model of the copolymer's chain break position was established as a//roulette,/model,whose probability values were estimated by the calculation of the potential energy difference at different chain break positions by molecular dynamics that determined the position of chain shear,thereby fully realizing the simulation of the chain micro-break *** diffusion of the oligomers was then calculated using the macro diffusion equation,and the degradation process of the copolymer was simulated by three-scale coupling *** calculation results were in good agreement with the experimental data,demonstrating the effectiveness of the proposed method.

关键词： copolymer for biomimetic scaffolds copolymerization ratio degradation modeling multi-scale model probability model for chain break location

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Cross-Modal Fusion Based Refinement for Text-to-Image Synthesis

引用

Chinese Journal of Electronics 2023年第6期32卷 1329-1340页

作者： SUN Haoran WANG Yang LIU Haipeng QIAN Biao Department of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of EducationHefei University of Technology

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel finegrained text-image fusion based generative adversarial networks(FF-GAN), which consists of two modules: Finegrained text-image fusion block(FF-Block) and global semantic refinement(GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given texts.

关键词： Visualization Fuses Convolution Semantics Linguistics Benchmark testing Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

BERST: An Engine and Tool for Exploring Biomedical Entities and Relationships

引用

Chinese Journal of Electronics 2019年第4期28卷 797-804页

作者： BAI Tian GE Yan YANG Changqing LIU Xiaohua GONG Leiguang WANG Ye HUANG Lan College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Yantai Intelligent Information Technologies Ltd. Department of Computer Science and Technology Zhuhai College of Jilin University

To facilitate the search of rapidly growing biomedical knowledge in literature, we developed a Biomedical entity-relationship search tool(BERST). It is also a biomedical knowledge integration framework, which presently contains six popular databases represented in terms of a network of concepts and relations extracted from these knowledge sources. Users search the integrated knowledge network by entering keywords, and BERST returns a sub-network matching and representing the keywords and their relationships. The resulting graph can be navigated interactively allowing users to explore specific paths between any two nodes representing potentially interesting relationships between them. A graphical UI was developed to provide a more intuitive and overall view of the information being searched and studied. BERST framework can be naturally expanded to integrate other biomedical knowledge sources. BERST is implemented as a Java web application.

关键词： Biomedical ontology Relationship mining Relationship searching tool

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Networks and Systems

引用

Lecture Notes in Networks and Systems 2025年 1178卷 v-vi页

作者： Nagar, Atulya Jat, Dharm Singh Mishra, Durgesh Joshi, Amit School of Mathematics Computer Science and Engineering Liverpool Hope University Liverpool United Kingdom Department of Computer Science Namibia University of Science and Technology Windhoek Namibia Symbiosis University of Applied Sciences Madhya Pradesh Indore India Global Knowledge Research Foundation Gujarat Ahmedabad India

来源：评论

学校读者我要写书评

暂无评论

Security challenges and defense approaches for blockchain-based services from a full-stack architecture perspective

引用

Blockchain(Research and Applications) 2023年第3期4卷 18-38页

作者： Hongsong Chen Xietian Luo Lei Shi Yongrui Cao Yongpeng Zhang Department of Computer Science University of Science and Technology Beijing(USTB)Beijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China

As an advantageous technique and service,the blockchain has shown great development and application ***,its security has also met great challenges,and many security vulnerabilities and attack issues in blockchain-based services have ***,security issues of blockchain have attracted extensive ***,there is still a lack of blockchain security research from a full-stack architecture perspective,as well as representative quantitative experimental reproduction and *** aim to provide a security architecture to solve security risks in blockchain services from a full-stack architecture ***,we propose a formal definition of the full-stack security architecture for blockchain-based services,and we also propose a formal expression of security issues and defense solutions from a full-stack security *** use ConCert to conduct a smart contract formal verification experiment by property-based *** security vulnerabilities of blockchain services in the Common Vulnerabilities and Exposures(CVE)and China Nation Vulnerability Database(CNVD)are selected and ***,three real contract-layer real attack events are reproduced by an experimental *** Alibaba's blockchain services and Identity Mixer in Hyperledger Fabric as a case study,the security problems and defense techniques are analyzed and *** last,the future research directions are proposed.

关键词： Security and privacy Blockchain-based services Full stack Architecture perspective Case and experimental study Formal verification

来源：评论

学校读者我要写书评

暂无评论

Feature-Oriented Nonfunctional Requirement Analysis for Software Product Line

引用

Journal of computer science & Technology 2009年第2期24卷 319-338页

作者：彭鑫 Seok-Won Lee 赵文耘 School of Computer Science Fudan University Knowledge-Intensive Software Engineering Research Group Department of Software and Information Systems College of Computing and Informatics University of North Carolina at Charlotte

Domain analysis in software product line （SPL） development provides a basis for core assets design and imple- mentation by a systematic and comprehensive commonality/variability analysis. In feature-oriented SPL methods, products of the domain analysis are domain feature models and corresponding feature decision models to facilitate application-oriented customization. As in requirement analysis for a single system, the domain analysis in the SPL development should con- sider both flmctional and nonfunctional domain requirements. However, the nonfunctional requirements （NFRs） are often neglected in the existing domain analysis methods. In this paper, we propose a context-based method of the NFR analysis for the SPL development. In the method, NFRs are materialized by connecting nonfunctional goals with real-world context, thus NFR elicitation and variability analysis can be performed by context analysis for the whole domain with the assistance of NFR templates and NFR graphs. After the variability analysis, our method integrates both functional and nonfunc- tional perspectives by incorporating the nonfunctional goals and operationalizations into an initial functional feature model. NFR-related constraints are also elicited and integrated. Finally, a decision model with both functional and nonfunctional perspectives is constructed to facilitate application-oriented feature model customization. A computer-aided grading system （CAGS） product line is employed to demonstrate the method throughout the paper.

关键词： software product line nonfunctional requirement domain analysis feature-oriented method variability analysis

来源：评论

学校读者我要写书评

暂无评论

Canonical Huffman code based full-text index

引用

Progress in Natural science:Materials International 2008年第3期18卷 325-330页

作者： Yi Zhang a,b, Zhili Pei a, Jinhui Yanga, Yanchun Liang a, a College of computer science and Technology, Jilin University, Key Laboratory of Symbol Computation and knowledge engineering of the Ministry of Education, Changchun 130012, China b department of computer science, Jilin Technology and Business College, Changchun 130062, China College of Computer Science and Technology Jilin University Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Changchun 130012 China Department of Computer Science Jilin Technology and Business College Changchun 130062 China

Full-text indices are data structures that can be used to find any substring of a given string. Many full-text indices require space larger than the original string. In this paper, we introduce the canonical Huffman code to the wavelet tree of a string T[1. . .n]. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet tree is not needed. In case of large alphabet, this part of memory is not negligible. The operations of wavelet tree are also simpler and more efficient due to the canonical Huffman code. Based on the resulting structure, the multi-key rank and select functions can be performed using at most nH0 + jRj(lglgn + lgn lgjRj)+O(nH0) bits and in O(H0) time for average cases, where H0 is the zeroth order empirical entropy of T. In the end, we present an efficient construction algorithm for this index, which is on-line and linear.

关键词： Full-text index Su?x automaton Canonical Hu?man code

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：