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

2018 8th International Workshop on computer science and engineering, WCSE 2018

作者： Li, Qianru Mo, Xiuliang Wang, Chundong Tianjin Intelligent Computing and Software New Technology Key Laboratory School of Computer Science and Engineering Tianjin university of technology Tianjin300384 China

ISBN: (纸本)9789811178610

In recent years, the increasing popularity of social media such as WeChat and Weibo has facilitated the communication among people. However, due to the characteristics like large scale, fast propagation, low quality and diverse modalities of social short texts, the short text clustering faces the challenge of sparse features, high dimension and noise interference. The traditional clustering method based on vector space model is not good for short text data processing. With the improvement of K-means algorithm, this paper proposes a short-text clustering algorithm named BK-means which alleviates the effect of data sparseness. Firstly, we preprocess the wordset by means of word segmentation, stop-of-word and other operations, then extract the biterm using the BTM to model the document, and get the document-topic, the topic-word distribution matrix. Finally, we use the proposed BK-means algorithm to cluster short texts of documents represented by vectors. Experiments on the short text data of Sina Weibo have proved that the short text clustering algorithm based on BK-means is superior to the traditional one, and both the F-measure and the purity are improved. © Proceedings of 2018 the 8th International Workshop on computer science and engineering, WCSE 2018. All rights reserved.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Approach to Searching software Source Code with Graph Embedding

引用

Ruan Jian Xue Bao/Journal of software 2019年第5期30卷 1481-1497页

作者： Ling, Chun-Yang Zou, Yan-Zhen Lin, Ze-Qi Xie, Bing Zhao, Jun-Feng Key Laboratory of High Confidence Software Technologies Peking University Ministry of Education Beijing100871 China School of Electronics Engineering and Computer Science Peking University Beijing100871 China Peking University Information Technology Institute Tianjin Binhai Tianjin300450 China

Searching software source code and locating software's API (application program interface) are important research issues in software engineering. As software projects are becoming more and more complex, existing search tools mainly face the following two challenges. First, more accurate search results are required in natural language question based search process. Second, the relationships between API are required to illustrate so that these API' underlying logic and usage scenarios are able to be understood more quickly. In this study, an ovel approach is proposed to searching a software project's API based on graph embedding. It aims to improve the accuracy of natural language based code graph search. A software project's code graph is built automatically from its source code and they are represented through graph embedding. For a natural language question, a code-connected subgraph, composed by relevant API and their associated relationships, are returned as the best answer. In experiments, Apache Lucene and POI projects are selected as examples to perform some API search tasks. Experimental results show that the proposed approach improves F1-score by 10% than existing shortest path based approach, while reduces average response time significantly. © Copyright 2019, Institute of software, the Chinese Academy of sciences. All rights reserved.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

An Evolutional Networking Model for Three-Dimensional Topology in Internet of Things

An Evolutional Networking Model for Three-Dimensional Topolo...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Songwei Zhang Tie Qiu Min Han Azizur Rahim Wenbing Zhao School of Software Dalian University of Technology Dalian China School of Computer Science and Technology Tianjin University Tianjin China Department of Electronic Information and Electrical Engineering Dalian University of Technology Dalian China School Of Electrical Engineering and Computer Science National University Of Science and Technology Islamabad Department of Electrical and Computer Engineering Cleveland State University Cleveland OH USA

The research on three-dimensional topology is important for Internet of Thing. Small-world with shorter average path lengths has proven to be an effective model for building evolutional network topologies. In order to build three-dimensional topology in IoT, the ant colony algorithm is used to plan shortcuts in this paper. First, Gaussian integration is used to simulate the ups and downs of terrain in three-dimensional space. Second, a significant number of nodes are randomly deployed on the modeled terrain. Taking into account the information about slope and aspect around the node, the actual sensing range of the node is calculated. Third, a certain percentage of nodes are selected as super sensor nodes. Finally, the ant colony algorithm is used to add shortcuts between super sensor nodes. Extensive experimental results show that an energy-efficient three-dimensional network topology in IoT can be built by the algorithm.

关键词： Network topology Topology Solid modeling Sensors Euclidean distance Internet of Things Buildings

来源：评论

学校读者我要写书评

暂无评论

CSF: An Efficient Parallel Deduplication Algorithm by Clustering Scattered Fingerprints

CSF: An Efficient Parallel Deduplication Algorithm by Cluste...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Hao Fan Guangping Xu Yi Zhang Liming Yuan Yanbing Xue Tianjin University of Technology Tianjin China School of Computer Science and Engineering Tianjin University of Technology Tianjin China Key Laboratory of Computer Vision and System Ministry of Education Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Deduplication is one of the most effective and efficient techniques to save memory space. It is widely used in data centers and cloud storage systems. Multi-stream concurrency is expected to increase the throughput of deduplication. However, multiple data streams hurt the locality of accessed data and weaken the benefit of data concurrency, which forms a challenge for data deduplication. Usually, the ordered index can reshape the locality of data streams, which can improve the cache hit rate during deduplication. In this paper, we first propose an efficient parallel deduplication algorithm by clustering scattered fingerprints, called CSF, to exploit the data locality as much as possible. It tries to improve the utilization rate of the fingerprint page by the clustered fingerprints. Moreover, it retains the scattered fingerprint to next round fingerprint comparison by re-using the fingerprints on the same page. Thus the number of the fingerprint pages to read is reduced. We further optimize the proposed algorithm by a scheduling strategy, which effectively schedules the task of part streams ahead while ensuring the overall performance. Finally, we evaluated the performance of our algorithm with various data sets in experiments. The experimental results show that our proposed algorithm achieves better performance than the state-of-the-art method.

关键词： Indexes Clustering algorithms Task analysis Servers Fingerprint recognition Throughput Distributed databases

来源：评论

学校读者我要写书评

暂无评论

Generalized Lag Synchronization of Multiple Weighted Complex Networks with Fixed and Adaptive Couplings

Generalized Lag Synchronization of Multiple Weighted Complex...

引用

第37届中国控制会议

作者： Qing Wang Jin-Liang Wang Shun-Yan Ren School of Computer Science and Software Engineering Tianjin Polytechnic University School of Mechanical Engineering Tianjin Polytechnic University

The generalized lag synchronization for multi-weighted complex dynamical network with fixed and adaptive couplings is investigated in this paper, respectively. By designing appropriate controller, a synchronization criterion is presented for complex dynamical network with multi-weights based on the selected Lyapunov functional and inequality techniques. Moreover,an adaptive scheme to update the coupling weights is also developed for ensuring the generalized lag synchronization of multiweighted complex dynamical network. Finally, two examples are given to validate effectiveness of the proposed generalized lag synchronization criteria.

关键词： Generalized lag synchronization complex networks multi-weights adaptive coupling

来源：评论

学校读者我要写书评

暂无评论

Gowl: A fast ontology-mediated query answering

Gowl: A fast ontology-mediated query answering

引用

2018 ISWC Posters and Demonstrations, Industry and Blue Sky Ideas Tracks, ISWC-P and D-Industry-BlueSky 2018

作者： Meng, Chenhong Zhang, Xiaowang Xiao, Guohui Feng, Zhiyong Qi, Guilin School of Computer Science and Technology Tianjin University Tianjin300350 China School of Computer Software Tianjin University Tianjin300350 China Faculty of Computer Science Free University of Bozen-Bolzano BolzanoI-39100 Italy School of Computer Science and Engineering Southeast University Nanjing211189 China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin300350 China

This poster shows an ontology-mediated query answering system (gOWL) based on pure materialization to avoid query rewriting online. gOWL shows that answering queries over a partial materialization of the chase is complete for a large fragment of practical queries with bounded depth. From a system engineering perspective, the materialization approach allows us to design a modular architecture to integrate off-the-shelf efficient SPARQL query engines. The poster will be based on DBpedia and UOBM datasets. We will compare the performance of gOWL with PAGOdA, Ontop, and Pellet (with speedup up to three orders of magnitude). © 2018 CEUR-WS. All rights reserved.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Passivity and Adaptive Control of Complex Dynamical Networks with Multiple Derivative Couplings

Passivity and Adaptive Control of Complex Dynamical Networks...

引用

第37届中国控制会议

作者： Dong-Yang Wang Jin-Liang Wang Shun-Yan Ren School of Computer Science and Software Engineering Tianjin Polytechnic University School of Mechanical Engineering Tianjin Polytechnic University

A network model with multiple derivative couplings and different dimensions of output and input vectors is investigated in this *** problem of passivity for the proposed network model is analyzed by utilizing some inequality techniques and Lyapunov functional ***,by employing adaptive feedback control strategy,some sufficient conditions for guaranteeing passivity of complex dynamical network with multiple derivative couplings（CDNMDC） are *** the end,we give an example to verify the effectiveness of the results.

关键词： Passivity Adaptive Control Complex Networks Multiple Derivative Couplings

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient robust federated learning over heterogeneous datasets

arXiv

引用

arXiv 2020年

作者： Dong, Yanjie Giannakis, Georgios B. Chen, Tianyi Cheng, Julian Hossain, Md. Jahangir Leung, Victor C.M. Department of Electrical and Computer Engineering University of British Columbia VancouverBCV6T 1Z4 Canada Department of Electrical and Computer Engineering and Digital Technology Center University of Minnesota MinneapolisMN55455 United States Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute TroyNY12180 United States School of Engineering University of British Columbia KelownaBCV1V 1V7 Canada College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

This work investigates fault-resilient federated learning when the data samples are non-uniformly distributed across workers, and the number of faulty workers is unknown to the central server. In the presence of adversarially faulty workers who may strategically corrupt datasets, the local messages exchanged (e.g., local gradients and/or local model parameters) can be unreliable, and thus the vanilla stochastic gradient descent (SGD) algorithm is not guaranteed to converge. Recently developed algorithms improve upon vanilla SGD by providing robustness to faulty workers at the price of slowing down convergence. To remedy this limitation, the present work introduces a fault-resilient proximal gradient (FRPG) algorithm that relies on Nesterov’s acceleration technique. To reduce the communication overhead of FRPG, a local (L) FRPG algorithm is also developed to allow for intermittent server-workers parameter exchanges. For strongly convex loss functions, FRPG and LFRPG have provably faster convergence rates than a benchmark robust stochastic aggregation algorithm. Moreover, LFRPG converges faster than FRPG while using the same communication rounds. Numerical tests performed on various real datasets confirm the accelerated convergence of FRPG and LFRPG over the robust stochastic aggregation benchmark and competing alternatives. Copyright © 2020, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Guardians of the Mitochondria: Space Mitochondria 2.0 Systemic Analysis Reveals Bioenergetic Dysregulation Across Species

SSRN

引用

SSRN 2025年

作者： Guarnieri, Joseph W. Maghsoudi, Zeynab Kim, JangKeun Bya, Phi Widjaja, Gabrielle A. Barker, Richard Burke, Marissa Cen, Zimu Fazelinia, Hossein Tsoy, Sergey Tiersky, Rachel Peczak, Anna Kim, Jihan Kim, Ye-Ah Haltom, Jeffrey Almeida, Michael Garris, Alex Day, Sarah Sanchez-Hodge, Rebekah Zilberman, Aleeza H. Allen, Noah G. Kubik, Angela J. Blaber, Elizabeth A. Mathyk, Begum Harris, Frederick C. Singh, Kanhaiya Sen, Chandan K. Innes, Lucinda Ali, Nilufar Berliner, Aaron J. Kar, Upendra K. Overbey, Eliah Giunta, Simona Podrabsky, Jason E. Neal, Matthew D. Billiar, Timothy R. Headley, Colwyn Meydan, Cem Tasoula, Alexia Szewczyk, Nathaniel Ikeda, Yasutaka Gotoh-Katoh, Aina Schisler, Jonathan C. Kim, Man S. Schwartz, Robert E. Wallace, Douglas C. Mason, Christopher E. Nguyen, Tin Beheshti, Afshin Children’s Hospital of Philadelphia PhiladelphiaPA United States Computer Science and Engineering University of Nevada Reno RenoNV United States Department of Physiology and Biophysics and WorldQuant Initiative for Quantitative Prediction Weill Cornell Medicine New YorkNY United States Computer Science and Software Engineering University of Auburn AL United States Purdue University Department of Agricultural and Biological engineering IN United States Department of Neurosurgery Houston Methodist Research Institute HoustonTX United States Department of Medicine Division of Gastroenterology and Hepatology Weill Cornell Medicine New YorkNY United States Kyung Hee University Hospital at Gangdong Kyung Hee University Seoul Korea Republic of McAllister Heart Institute Department of Pharmacology The University of North Carolina at Chapel Hill Chapel HillNC United States Shirley Ann Jackson Ph.D. Center for Biotechnology and Interdisciplinary Studies Department of Biomedical Engineering Rensselaer Polytechnic Institute TroyNY United States Division of Reproductive Endocrinology and Infertility Department of Obstetrics and Gynecology University of South Florida Morsani College of Medicine TampaFL United States Center for Space Biomedicine McGowan Institute for Regenerative Medicine Department of Surgery University of Pittsburgh School of Medicine PittsburghPA United States Department of Biological Science Boise State University BoiseID United States Department of Radiation Oncology Weill Cornell Medicine New YorkNY United States BerkeleyCA United States University of Pittsburgh School of Medicine PittsburghPA United States The HRH Prince Alwaleed Bin Talal Bin Abdulaziz Alsaud Institute for Computational Biomedicine Weill Cornell Medicine New YorkNY United States BioAstra Inc New YorkNY United States Center for STEM University of Austin AustinTX78701 United States Laboratory of Genome Evolution Department of Biology and Biotechnology Charle

Spaceflight imposes unique stressors that disrupt mitochondrial function, vital for energy production and immune regulation. Our multi-omics analysis (proteomics, bisulfite sequencing, RNA-seq, and single-nuclei RNA/ATAC-seq) on astronauts, rodents, and model organisms (flies, worms, plants) revealed progressive impairment of mitochondrial oxidative phosphorylation (OXPHOS) during spaceflight, with delayed recovery post-return across species. In rodents, radiation ≥10.34 mGy activated persistent mitochondrial stress pathways across multiple organs except in the spleen, with older and male C57BL/6 mice most affected. Astronaut data from the NASA Twins Study, JAXA, and Inspiration4 missions showed prolonged mitochondrial dysfunction, with OXPHOS suppression and TCA cycle inhibition lasting up to 82 days. Bisulfite sequencing confirmed lasting epigenetic changes in OXPHOS genes. Lastly, Kaempferol, an antioxidant and mitochondrial activator, mitigated radiation-induced liver atrophy in mice and preserved liver function in human organoids. This cross-species study underscores the need for targeted therapies to protect mitochondrial biogenesis during long-duration space missions. © 2025, The Authors. All rights reserved.

关键词： Mammals

来源：评论

学校读者我要写书评

暂无评论

Targeted Malicious Email Detection using Hypervisor-based Dynamic Analysis and Ensemble Learning

Targeted Malicious Email Detection using Hypervisor-based Dy...

引用

IEEE Global Communications Conference

作者： Jian Zhang Zhaojun Gu Wenzhen Li Liangyi Gong Jeffrey Wu School of Computer Science and Engineering Tianjin University of Technology College of Cyber Science Nankai University Tianjin China School of Computer Science and Engineering Tianjin University of Technology Tianjin China School of Software and BNRist Tsinghua University Beijing China Information Security Evaluation Center of Civil Aviation Civil Aviation University of China Tianjin China Jiaxing Chenxiang Information Technology Co. Ltd. Jiaxing China

ISBN: (数字)9781728109626

ISBN: (纸本)9781728109633

At present, email is still one of the most frequently used communication tools for organizations and individuals. With the leakage of personal privacy information, targeted malicious email (TME) is becoming a prominent targeted cyber attack vector in today's Internet. This type of attack often uses personal information, about an individual, group of individuals, or an organization, to make a TME more believable and personalized. TME is effective to penetrate email defense system because it is fundamentally difficult for traditional email security method to distinguish legitimate emails from malicious emails. And TMEs often contain malicious URLs or malicious attachments, which are extremely aggressive and destructive. In order to effectively deal with this new type of malicious email attack, this paper proposes a dynamic detection method for malicious email. We simulate the recipient opening the email in the virtual machine (VM), accessing the URL and activating the attachment. And we use the virtual machine introspection (VMI) and memory forensics analysis (MFA) technology to obtain the dynamic features of the email by the out-of-VM. Then we use AdaBoostM1 ensemble learning method and Voting combination strategy to combine three base classifiers such as BayesNet, SMO and J48 to build a powerful classification model for detecting TME attacks. The AdaBoostM1 classifier achieved the high detection rates, with an AUC of 0.997, true positive rate (TPR) of 0.997, and false positive rate (FPR) of 0.015. In addition, our proposed detection method is superior to the 56 anti-virus engines on VirusTotal and most of the existing research works.

关键词： Electronic mail Feature extraction Virtual machining Unsolicited e-mail Uniform resource locators Learning systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：