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

8th International Symposium on Computing and Networking Workshops, CANDARW 2020

作者： Nagao, Kosei Fujiwara, Akihiro Kyushu Institute of Technology Graduate School of Computer Science and Systems Engineering Iizuka Fukuoka820-8502 Japan

ISBN: (纸本)9781728199191

Membrane computing, which is a computational model based on cell activity, has attracted considerable attention as a new paradigm in computation. Using membrane computing, several algorithms for elementary operations, such as sorting, have been proposed. However, the proposed algorithms for sorting in membrane computing have different types of inputs. In addition, there is room for improvement on the complexities of the proposed *** the present paper, we propose an asynchronous P system based on counting sort for inputs representing binary numbers. The proposed P system sorts n binary numbers of m bits in O(mn2) sequential steps and O(mn) parallel steps. © 2020 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Asynchronous p systems for the maximum independent set and related graph problems

Asynchronous p systems for the maximum independent set and r...

引用

2013 IEEE 37th Annual computer Software and Applications Conference, COMPSAC 2013

作者： Tanaka, Kohei Fujiwara, Akihiro Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Fukuoka 820-8502 Japan

ISBN: (纸本)9780769549798

In the present paper, we consider fully asynchronous parallelism in membrane computing, and propose asynchronous P systems for three graph problems, which are the maximum independent set, the minimum vertex cover, and the maximum clique. We first propose an asynchronous P system that solves the maximum independent set for a graph with n nodes, and show that the proposed P system works in O(n2 ·2n) sequential steps or O(n2) parallel steps using O(n2) kinds of objects. We next propose an asynchronous P system that solves the minimum vertex cover and the maximum clique for a graph with n nodes by reduction to the maximum independent set, and show that the proposed P system works in O(n2 ·2n) sequential steps or O(n2) parallel steps using O(n2) kinds of objects. © 2013 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Posture Prediction in Response to Seat Angle Change with Smart Chair

Posture Prediction in Response to Seat Angle Change with Sma...

引用

2024 IEEE International Conference on systems, Man, and Cybernetics, SMC 2024

作者： Esumi, Tsubasa Takemura, Noriko Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Department of Artificial Intelligence Fukuoka Japan

ISBN: (纸本)9781665410205

Long-term desk work with lousy posture causes physical disabilities. To solve this problem, we have developed a smart chair with a controllable seat angle in our previous research. In order to control the seat angle and guide the user to the correct posture using this smart chair, it is necessary to investigate how the posture changes in response to the seat angle change. In this study, we first constructed a dataset by capturing posture data from 30 subjects while changing the seat angle of the smart chair. This dataset trained a model based on a graph neural network to predict posture in response to seat angle changes. We compared the model's prediction performance in the evaluation experiment depending on the training data and the body part. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Asynchronous P systems for arithmetic operations and factorization

Asynchronous P systems for arithmetic operations and factori...

引用

2nd International Conference on Networking and Computing, ICNC 2011

作者： Murakawa, Takayuki Fujiwara, Akihiro Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Fukuoka 820-8502 Japan

ISBN: (纸本)9780769545691

In the present paper, we consider the asynchronous parallelism in membrane computing, and propose asynchronous P systems that perform two basic arithmetic operations and factorization. We first propose a P system that computes addition of two binary numbers of m bits. The P system works in O(m) sequential and parallel steps using O(m) types of objects. We next propose a P system for multiplication of the two binary numbers of m bits, and show that the P system works in O(m log m) parallel steps or O(m3) sequential steps using O(m2) types of objects. Finally, we propose a P system for factorization of a positive integer of m bits using the above P system as a sub-system. The P system computes the factorization in O(m log m) parallel steps or O(4 m x m2 log m) sequential steps using O(m 2) types of objects. © 2011 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

An asynchronous P system with branch and bound for solving the knapsack problem 8

An asynchronous P system with branch and bound for solving t...

引用

8th International Symposium on Computing and Networking Workshops, CANDARW 2020

作者： Nakano, Yoshikata Fujiwara, Akihiro Kyushu Institute of Technology Graduate School of Computer Science and Systems Engineering Iizuka Fukuoka820-8502 Japan

ISBN: (纸本)9781728199191

Membrane computing, which is a computational model based on cell activity, has considerable attention as a new computation paradigm. In general membrane computing, computationally hard problems have been solved in a polynomial number of steps using an exponential number of membranes. However, reduction of the number of membranes must be considered in order to make a P system a more realistic *** the present paper, we propose an asynchronous P system for the 0/1 knapsack problem using branch and bound, which is a well-known optimization technique. The proposed P system solves the knapsack problem with n items and works in O(n2n) sequential steps or O(n2) parallel *** addition, the numbers of membranes used in the proposed P system are evaluated by computational simulation. The experimental results show the validity and efficiency of the proposed P system. © 2020 IEEE.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

An asynchronous P system with branch and bound for solving the subset sum problem 9

An asynchronous P system with branch and bound for solving t...

引用

9th International Symposium on Computing and Networking Workshops, CANDARW 2021

作者： Nagao, Kosei Fujiwara, Akihiro Kyushu Institute of Technology Graduate School of Computer Science And Systems Engineering Iizuka Fukuoka820-8502 Japan

ISBN: (纸本)9781665428354

Membrane computing is a computational model inspired by living cell activity. Using the membrane computing, a number of computationally hard problems have been solved by using exponential number of natural materials. However, existing algorithms for computationally hard problems define a huge number of evolution rules to execute arithmetic *** the present paper, we propose an asynchronous P system with branch and bound for solving the subset sum problem by applying existing P systems for elementary operations. Experimental results for the proposed P system show that the proposed method contributes to the large reduction of the numbers of evolution rules and membranes. © 2021 IEEE.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

Training data subdivision and periodical rotation in hybrid fuzzy genetics-based machine learning

Training data subdivision and periodical rotation in hybrid ...

引用

10th International Conference on Machine Learning and Applications, ICMLA 2011

作者： Ishibuchi, Hisao Mihara, Shingo Nojima, Yusuke Department of Computer Science and Intelligent Systems Graduate School of Engineering Osaka Prefecture University Sakai Osaka Japan

ISBN: (纸本)9780769546070

We have already proposed an idea of simultaneous implementation of population subdivision and training data set subdivision, which leads to significant decrease in computation time of genetics-based machine learning (GBML) for large data sets. In our idea, a population is subdivided into multiple sub-populations as in island models where subdivided training data are rotated over the sub-populations. In this paper, we focus on the effect of training data rotation on the generalization ability and the computation time of our hybrid fuzzy GBML algorithm. First we show parallel distributed implementation of our hybrid fuzzy GBML algorithm. Then we examine the effect of training data rotation through computational experiments where both single-population (i.e., non-parallel) and multi-population (i.e., parallel) versions of our GBML algorithm are applied to a multi-class high-dimensional problem with a large number of training patterns. Experimental results show that training data rotation improves the generalization ability of our GBML algorithm. It is also shown that the population size is more directly related to the computation time than the training data set size. © 2011 IEEE.

关键词： Rotation

来源：评论

学校读者我要写书评

暂无评论

Transmission rate enhancement of cooperative communications in wireless networks

Transmission rate enhancement of cooperative communications ...

引用

International Workshop on Specialized Ad Hoc Networks and systems

作者： Wang, Xiaoyan Li, Jie Wu, Kui Graduate School of Systems and Information Engineering University of Tsukuba Japan Department of Computer Science University of Victoria Canada

ISBN: (纸本)9780769543864

Recently, the cooperative communication has been explored more and more as an impressing technique to combat the effects of channel fading and to reduce the energy consumption in wireless networks. However, the impact of cooperative communications on transmission rate has not been well-addressed yet. In this paper, we provide an analytical framework for transmission rate enhancement issue in wireless communications. For a given transmit power and a desired probability of success, we investigate how much average transmission rate can be increased by cooperative communications. Three transmission models have been compared: the direct transmission, the cooperative transmission without maximal ratio combiner (MRC), and cooperative transmission with MRC. The analytical and numerical results show that around 1 ∼ 3b/s/Hz transmission rate can be improved when the source-destination distance is 20m. We also reveal that the MRC scheme is not always beneficial, especially when the source-destination distance is short and the relay is close to the destination. © 2011 IEEE.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

Static Taint Analysis Traversal with Object Oriented Component for Web File Injection Vulnerability Pattern Detection 3

Static Taint Analysis Traversal with Object Oriented Compone...

引用

3rd International Conference on computer science and Computational Intelligence, ICCSCI 2018

作者： Kurniawan, Aditya Abbas, Bahtiar Saleh Trisetyarso, Agung Isa, Sani Muhammad Computer Science Department School of Computer Science Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program - Doctor of Computer Science Bina Nusantara University Jakarta11480 Indonesia Computer Science Department BINUS Graduate Program - Master of Computer Science Bina Nusantara University Jakarta11480 Indonesia Industrial Engineering Department Faculty of Engineering Bina Nusantara University Jakarta11480 Indonesia

We introduce a composition of object-oriented component PHP grammar for taint analysis. Our novel method successfully restructured the PHP parser and reduced grammar artifact objects that must be visited in a taint analysis process by up to 52% grammar variation. Taint analysis is an analysis that detects any injection vulnerability pattern in source code. The analysis identifies the information flow of untrustworthy input that affects the sensitive sink or part of the system. The static taint analysis was run on an abstract syntax tree and traversed all nodes. A static taint analysis uses a parser to traverse abstract syntax trees of the source code. A web PHP parser has 140 grammar combinations in an abstract syntax tree, which has to be traversed to recognize the tainted flow pattern. Additionally, there are many variations of syntax and coding styles for tainted flow patterns. Therefore, the amount of combinations will consume many computation resources. © 2018 The Authors. Published by Elsevier Ltd.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic and Attentive Network for Unsupervised Video Summarization

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2022年第2期18卷 1-21页

作者： Zhong, Sheng-Hua Lin, Jingxu Lu, Jianglin Fares, Ahmed Ren, Tongwei College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical Engineering Computer Systems Engineering Program Faculty of Engineering at Shoubra Benha University Cairo Egypt State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

With the rapid growth of video data, video summarization is a promising approach to shorten a lengthy video into a compact version. Although supervised summarization approaches have achieved state-of-the-art performance, they require frame-level annotated labels. Such an annotation process is time-consuming and tedious. In this article, we propose a novel deep summarization framework named Deep Semantic and Attentive Network for Video Summarization (DSAVS) that can select the most semantically representative summary by minimizing the distance between video representation and text representation without any frame-level labels. Another challenge associated with video summarization tasks mainly originates from the difficulty of considering temporal information over a long time. Long Short-Term Memory (LSTM) performs well for temporal dependencies modeling but does not work well with long video clips. Therefore, we introduce a self-attention mechanism into our summarization framework to capture the long-range temporal dependencies among the frames. Extensive experiments on two popular benchmark datasets, i.e., SumMe and TVSum, show that our proposed framework outperforms other state-of-the-art unsupervised approaches and even most supervised methods. © 2022 Association for Computing Machinery.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：