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

IEEE Symposium on computers and Communications (ISCC)

作者： Yunting Tao Fanyu Kong Yuliang Shi Jia Yu Hanlin Zhang Huiyi Liu School of Software Shandong University College of Information Engineering Binzhou Polytechnic College of Computer Science and Technology Qingdao University Shandong Sansec Information Technology Co. Ltd

The proliferation of Internet of Things (IoT) devices has led to the generation of massive amounts of data that require efficient aggregation for analysis and decision-making. However, multi-tier IoT systems, which involve multiple layers of devices and gateways, face more complex security challenges in data aggregation compared to ordinary IoT systems. In this paper, we propose an efficient privacy-preserving multi-functional data aggregation scheme for multi-tier IoT architecture. The scheme supports privacy-preserving calculation of mean, variance, and anomaly proportion. The scheme uses the Paillier cryptosystem and the BLS algorithm for encryption and signature, and uses blinding techniques to keep the size of the IoT system secret. In order to make the Paillier algorithm more suitable for the IoT scenario, we also improve its efficiency of encryption and decryption. The performance evaluation shows that the scheme improves encryption efficiency by 43.7% and decryption efficiency by 45% compared to the existing scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Investigating the Effects of Hyperparameters in Quantum-Enhanced Deep Reinforcement Learning

Quantum Engineering

引用

Quantum engineering 2023年第1期2023卷

作者： Fikadu Tilaye, Getahun Pandey, Amit College of Informatics Software Engineering Department Bule Hora University Bule Hora Ethiopia College of Informatics Computer Science Department Bule Hora University Bule Hora Ethiopia

Quantum machine learning uses quantum mechanical concepts of superposition of states to make the decision. In this work, we used these quantum advantages to enhance deep reinforcement learning (DRL). Our primary and foremost goal is to investigate and elucidate a way of representing and solving the frozen lake problems by using PennyLane which contains Xanadu’s back-end quantum processing unit. This paper specifically discusses how to enhance classical deep reinforcement learning algorithms with quantum computing technology, making quantum agents get a maximum reward after a fixed number of epochs and realizing the effect of a number of variational quantum layers on the trainability of enhanced framework. We have analyzed that, as the number of layers increases, the ability of the quantum agent to converge to the optimal state also increases. For this work, we have trained the framework agent with 2, 3, and 5 variational quantum layers. An agent with 2 layers converges to a total reward of 0.95 after the training episode of 526. The other agent with layers converges to a total reward of 0.95 after the training episode of 397 and the agent which uses 5 quantum variational layers converges to a total reward of 0.95 after the training episode of 72. From this, we can understand that the agent with a more variational layer exploits more and converges to the optimal state before the other agent. We also analyzed our work in terms of different learning rate hyperparameters. We recorded every single learning epoch to demonstrate the outcomes of enhanced DRL algorithms with selected 0.1, 0.2, 0.3, and 0.4 learning rates or alpha values. From this result, we can conclude that the greater the learning rate values in quantum deep reinforcement learning, the fewer timesteps it takes to move from the start point to the goal state. Copyright © 2023 Getahun Fikadu Tilaye and Amit Pandey.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A parallel proposal with message passing for the implementation of a Pipeline in the development of the video game SIMON 35

A parallel proposal with message passing for the implementat...

引用

35th European Modeling and Simulation Symposium, EMSS 2023

作者： Rossainz-López, Mario Cabrera-Hernández, Liosbel Sánchez-Rinza, Bárbara Capel-Tuñon, Manuel Faculty of Computer Science Autonomous University of Puebla Av. San Claudio and 14 Sur Street San Manuel PueblaC.P. 72570 Mexico Software Engineering Department College of Informatics and Telecommunications ETSIIT University of Granada Daniel Saucedo Aranda s/n Granada18071 Spain

ISBN: (纸本)9788885741881

The design and development of the inter-process communication pattern called Pipeline is presented as a proposal of Parallel Object Composition to solve simple way problems that can be solved with this same parallel control structure. A particular class library called JPMI (Java Passing Message Interface) is used for parallel programming with message passing and to implement an original and particular version of the well-known video game called SIMON with the objective, on the one hand, to show the usefulness of this design within Structured Parallel Programming and, on the other hand, that this proposal serves to guarantee good performance in the execution of real time applications. An example of this type of applications is precisely video games. The parallel algorithm implemented as a Composition of Parallel Objects is based on the development and use of a methodology where the algorithmic design represents the parallel control structure common to a given algorithmic technique that can use the pipeline communication pattern, generating a generic and abstract parallel program from which programs that solve specific problems using the same communication pattern can be derived. The implementation of this proposal within structured parallel programming tries to facilitate to the novice programmer in parallelism the reusability, genericity, and uniformity of code abstract enough to be suitable for any problem that can be solved with a pipeline offered implemented with a parallel message passing structure. This particularized proposal for the implementation of the SIMON video game is compared with another using a thread library called boost and ZeroC Ice for remote invocation of distributed objects. The execution times and speedups of both proposals are compared to identify how similar or different they are in their respective performances with training tests using AI modules with sequences of 500000 colors in a cluster of 2 Intel Xeon CPUs of 8 cores each and 2 nodes,

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Building a question answering system for the manufacturing domain

arXiv

引用

arXiv 2021年

作者： Xingguang, Liu Zhenbo, Cheng Zhengyuan, Shen Haoxin, Zhang Hangcheng, Meng Xuesong, Xu Gang, Xiao College of Computer Science and Technology College of Software Engineer ZheJiang University of Technology ZheJiang HangZhou310032 China College of Mechanical Engineering ZheJiang University of Technology ZheJiang HangZhou310032 China

The design or simulation analysis of special equipment products must follow the national standards, and hence it may be necessary to repeatedly consult the contents of the standards in the design process. However, it is difficult for the traditional question answering system based on keyword retrieval to give accurate answers to technical questions. Therefore, we use natural language processing techniques to design a question answering system for the decision-making process in pressure vessel design. To solve the problem of insufficient training data for the technology question answering system, we propose a method to generate questions according to a declarative sentence from several different dimensions so that multiple question-answer pairs can be obtained from a declarative sentence. In addition, we designed an interactive attention model based on a bidirectional long short-term memory (BiLSTM) network to improve the performance of the similarity comparison of two question sentences. Finally, the performance of the question answering system was tested on public and technical domain datasets. © 2021, CC BY-NC-ND.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Efficient private multi-party computations of trust in the presence of curious and malicious users

引用

Journal of Trust Management 2014年第1期1卷 1-21页

作者： Dolev, Shlomi Gilboa, Niv Kopeetsky, Marina Department of Computer Science Ben-Gurion University of the Negev Beer-Sheva Israel Department of Communication Systems Engineering Ben-Gurion University of the Negev Beer-Sheva Israel Department of Software Engineering Sami-Shamoon College of Engineering Beer-Sheva Israel

Schemes for multi-party trust computation are presented. The schemes do not make use of a Trusted Authority. The schemes are more ein a completely distributed manner, where each user calculates its trust value privately and independently. Given a community C and its members (users) U1,…,U n , we present computationally secure schemes for trust computation. The first scheme, Accumulated Protocol AP computes the average trust attributed to a specific user, U t following a trust evaluation request initiated by a user U n . The exact trust values of each queried user are not disclosed to U n . The next scheme, Weighted Accumulated Protocol WAP generates the average weighted trust in a specific user U t taking into consideration the unrevealed trust that U n has in each user participating in the trust evaluation process. The Public Key Encryption Protocol PKEP outputs a set of the exact trust values given by the users without linking the user that contributed a specific trust value to the trust this user contributed. The obtained vector of trust values assists in removing outliers. Given the set of trust values, the outliers that provide extremely low or high trust values can be removed from the trust evaluation process. We extend our schemes to the case when the initiator, U n , can be compromised by the adversary, and we introduce the Multiple Private Keys and the Weighted protocols (MPKP and MPWP) for computing average unweighted and weighted trust, respectively. Moreover, the Csed Protocol (CEBP) extends the PKEBP in this case. The computation of all our algorithms requires the transmission of O(n) (possibly large) messages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Face recognition using gabor wavelet and self-adaptive intelligent single particle optimizer

Face recognition using gabor wavelet and self-adaptive intel...

引用

Chinese Conference on Pattern Recognition

作者： Zhou, Jiarui Ji, Zhen Huang, Weigan Tian, Tao College of Biomedical Engineering and Instrument Science Zhejiang University Hangzhou 310027 China College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 China Shenzhen Key Laboratory of Embedded System Design Shenzhen 518060 China

ISBN: (纸本)9781424472109

A Gabor wavelet based face recognition algorithm of PSOGabor is introduced in this paper. By using particular Gabor filters in feature extraction on important region of face image, PSOGabor can attain more representative feature information with less processing time. To overcome the drawback of overly dependence on the input parameters in intelligent single particle optimizer (ISPO), an improved algorithm of self-adaptive ISPO (AdpISPO) is proposed in this paper. With no critical parameter required, AdpISPO can achieve higher performance than original algorithms. Experimental results demonstrated that, by employing AdpISPO in Gabor filters' selection, PSOGabor can attain higher recognition rate with less computational time. ©2010 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Designing a Credit Approval System Using Web Services, BPEL, and AJAX

Designing a Credit Approval System Using Web Services, BPEL,...

引用

IEEE International Conference on e-Business engineering (ICEBE)

作者： Vincent C.T. Chan Dickson K.W. Chiu Michelle Watson Patrick C.K. Hung Haiyang Hu Hua Hu Yi Zhuang Department of Computer Science & Engineering Hong Kong University of Science and Technology Hong Kong China Faculty of Business and IT University of Ontario Institute of Technology (UOIT) Canada College of Computer Science and Information Engineering Zhejiang Gongshang University China State Key Laboratory for Novel Software Technology Nanjing University China College of Computer Science Hangzhou Dianzi University China

In the business world, financial institutions, like banks and investment firms, heavily rely on technology to manipulate daily operations and support business. Many more business processes have now become automated and require procedures to be approved. For example, when providing business services liked personal / corporate loans, mortgage, or Letter of Credit (LC), a customer is required to submit information within their applications; whereas, the service provider has to perform complicated approval procedures, involving different departments or even external parties. In this paper, we discuss how a credit approval system (CAS) handles the workflow of such business processes. The system is extensible to contemporary technologies including business process execution language (BPEL), asynchronous JavaScript and XML (AJAX), and Java server face (JSF) in order to coordinate related parties through the Internet as well as to facilitate the operations and communications with different levels of staff in the Intranet. Our experiences and design characteristics will be further implemented into a system designed for a global financial firm.

关键词： Web services Content addressable storage Java computer science Educational institutions Loans and mortgages XML Financial management Design engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

Coordinated Sampling to Improve the Efficiency of Wireless Network Monitoring

Coordinated Sampling to Improve the Efficiency of Wireless N...

引用

IEEE International Conference on Networks

作者： Udayan Deshpande David Kotz Chris McDonald Institute for Security Technology Studies Dartmouth College Hanover NH USA Computer Science and Software Engineering University of Western Australia Nedlands WA Australia

ISBN: (纸本)9781424412297;1424412293

Wireless networks are deployed in home, university, business, military and hospital environments, and are increasingly used for mission-critical applications like VoIP or financial applications. Monitoring the health of these networks, whether it is for failure, coverage or attacks, is important in terms of security, connectivity, cost, and performance. Effective monitoring of wireless network traffic, using commodity hardware, is a challenging task due to the limitations of the hardware. IEEE 802.11 networks support multiple channels, and a wireless interface can monitor only a single channel at one time. Thus, capturing all frames passing an interface on all channels is an impossible task, and we need strategies to capture the most representative sample. When a large geographic area is to be monitored, several monitoring stations must be deployed, and these will typically overlap in their area of coverage. The competing goals of effective wireless monitoring are to capture as many frames as possible, while minimizing the number of those frames that are captured redundantly by more than one monitoring station. Both goals may be addressed with a sampling strategy that directs neighboring monitoring stations to different channels during any period. To be effective, such a strategy requires timely access to the nature of all recent traffic. We propose a coordinated sampling strategy that meets these goals. Our implemented solution involves a central controller considering traffic characteristics from many monitoring stations to periodically develop specific sampling policies for each station. We demonstrate the effectiveness of our coordinated sampling strategy by comparing it with existing independent strategies. Our coordinated strategy enabled more distinct frames to be captured, providing a solid foundation for focused sampling and intrusion detection.

关键词： Sampling methods Wireless networks Condition monitoring Hardware Hospitals Mission critical systems Costs Telecommunication traffic Communication system security Centralized control

来源：评论

学校读者我要写书评

暂无评论

SmartOracle: Generating Smart Contract Oracle via Fine-Grained Invariant Detection

arXiv

引用

arXiv 2024年

作者： Su, Jianzhong Chen, Jiachi Fang, Zhiyuan Lin, Xingwei Tang, Yutian Zheng, Zibin School of Software Engineering Sun Yat-sen University China College of Computer Science and Technology Zhejiang University China School of Computing Science University of Glasgow United Kingdom

As decentralized applications (DApps) proliferate, the increased complexity and usage of smart contracts have heightened their susceptibility to security incidents and financial losses. Although various vulnerability detection tools have been developed to mitigate these issues, they often suffer poor performance in detecting vulnerabilities, as they either rely on simplistic and general-purpose oracles that may be inadequate for vulnerability detection, or require user-specified oracles, which are labor-intensive to create. In this paper, we introduce SmartOracle, a dynamic invariant detector that automatically generates fine-grained invariants as application-specific oracles for vulnerability detection. From historical transactions, SmartOracle uses pattern-based detection and advanced inference to construct comprehensive properties, and mines multi-layer likely invariants to accommodate the complicated contract functionalities. After that, SmartOracle identifies smart contract vulnerabilities by hunting the violated invariants in new transactions. In the field of invariant detection, SmartOracle detects 50% more ERC20 invariants than existing dynamic invariant detection and achieves 96% precision rate. Furthermore, we build a dataset that contains vulnerable contracts from real-world security incidents. SmartOracle successfully detects 466 abnormal transactions with an acceptable precision rate 96%, involving 31 vulnerable contracts. The experimental results demonstrate its effectiveness in detecting smart contract vulnerabilities, especially those related to complicated contract functionalities. Copyright © 2024, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Detection of LSB matching steganography using neighborhood node degree characteristics

引用

Information Technology Journal 2011年第8期10卷 1601-1607页

作者： Xia, Bin Sun, Xingming Xiang, Lingyun Luo, Haijun Yang, Hengfu College of Information Science and Engineering Hunan University No 252 Lushan South Road Yuelu District Changsha 410082 China College of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China Department of Information Sciences and Engineering Hunan First Normal University China

This study presented a method to detect Least Significant Bit (LSB) matching steganography in gray images based on the neighborhood node degree characteristic. Natural imageshave a strong correlation between adjacent pixels and it's disturbed by LSB matching. Accordingly the effects of LSB matching steganography on neighborhood node degree were examined at first. Then features were extracted from neighborhood node degree histogram. A newcalibration algorithm based on neighborhood node degree was proposed to get more effective features. Support Vector Machine (SVM) was used as classifier. Experimental results demonstrated that the proposed method was efficient to detect the LSB matching steganography and had superior results compared with other recently proposed algorithms on compressed images and low embedding rate uncompressed images. © 2011 Asian Network for Scientific Information.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：