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

29th Annual ACM Symposium on Applied Computing, SAC 2014

作者： Yoon, Seok-Ho Kim, Ji-Soo Ha, Jiwoon Kim, Sang-Wook Ryu, Minsoo Choi, Ho-Jin Dept. of Electronics and Computer Engineering Hanyang University Korea Republic of Dept. of Computer and Software Hanyang University Korea Republic of Dept. of Computer Science KAIST Korea Republic of

ISBN: (纸本)9781450324694

In this paper, we present a novel approach to computing link-based similarities among objects accurately. We discuss the problems with previous link-based similarity measures and propose a novel approach that does not suffer from these problems. In the proposed approach, each target object is represented by a vector. The elements of the vector denote all the objects in the given data set, and the value of each element indicates the weight of the corresponding object with respect to the target object. As for this weight value, we propose to utilize the probability of reaching from the target object to the specific object, computed using the "Random Walk with Restart" strategy. Then, we define the similarity between two objects as the cosine similarity of the two vectors representing the two objects. We also evaluate the performance of the proposed approach in comparison with existing link-based measures using two kinds of data sets. Our experimental results show that the proposed approach significantly outperform the existing measures. Copyright 2014 ACM.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Efficient geometric re-ranking for mobile visual search

Efficient geometric re-ranking for mobile visual search

引用

11th Asian Conference on computer Vision, ACCV 2012

作者： Luo, Junwu Lang, Bo State Key Laboratory of Software Development Environment Dept. of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9783642374838

The state-of-the-art mobile visual search approaches are based on the bag-of-visual-word (BoW). As BoW representation ignores geometric relationship among the local features, a full geometric constraint like RANSAC is usually used as a post-processing step to re-rank the matched images, which has been shown to greatly improve the precision but at high computational cost. In this paper we present a novel and efficient geometric re-ranking method. Our basic idea is that the true matching local features should be not only in a similar spatial context, but also have a consistent spatial relationship, thus we simultaneously introduce context similarity and spatial similarity to describe the geometric consistency. By incorporating these two geometric constraints, the co-occurring visual words in the same spatial context can be regarded as a "visual phrase"and significantly improve the discriminative power than single visual word. To evaluate our approach, we perform experiments on Star5k and ImageNet100k dataset. The comparison with the BoW method and Soft-assignment method highlights the effectiveness of our approach in both accuracy and speed. © 2013 Springer-Verlag.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Safety and Security Analysis of Control Chains in SCADA Using the NFR Approach

引用

IFAC-PapersOnLine 2018年第6期51卷 214-219页

作者： Subramanian, Nary Zalewski, Janusz Dept. of Computer Science University of Texas at Tyler TylerTX75799 United States Dept. of Software Engineering Florida Gulf Coast University Fort MyersFL33965 United States

The objective of this research is to shed light on the applicability of the Non-Functional Requirements (NFR) Approach to the concept of control chains for the combined analysis of safety and security of SCADA systems and, more generally, to computer systems used in automation, including functional safety and security standards. The paper discusses the concept of control chains, presents an overview of the NFR Approach, and applies this approach to the safety and security analysis of control chains in a case study of the automatic control of the hydrocarbon tank pressure control system. © 2018

关键词： computer control systems Automation Chains Embedded systems Network security SCADA systems Security of data Security systems ANSI/ISA 62443 Automation systems Cyber physical systems (CPSs) Cyber security IEC 61508 IEC 61511 NFR Approach SCADA

来源：评论

学校读者我要写书评

暂无评论

A UML-based object-oriented framework development methodology

A UML-based object-oriented framework development methodolog...

引用

1998 Asia Pacific software engineering Conference, APSEC 1998

作者： Yang, Young Joon Kim, Soon Yong Choi, Gui Ja Cho, Eun Sook Kim, Chul Jin Kim, Soo Dong Software Engineering Department ETRI Computer and Software Technology Laboratory Daejon305-333 Korea Republic of Dept. Of Computer Science Soongsil University Seoul156-743 Korea Republic of

ISBN: (纸本)0818691832

Recently, object-oriented (OO) frameworks have been known to be highly effective and practical for software reuse;as shown in San Francisco project, a large-scaled industry project for framework development. However, systematic development process and detailed instructions for building OO frameworks have not been studied enough. In addition, it has not been clearly defined how to apply OMG's Unified Modeling Language (UML) in building OO frameworks. In this paper, we propose a practical OO development process that extends UML notations and semantics. The proposed process consists of four typical software development phases;analysis, design, implementation and testing, and each phase is defined as a logical sequence of development tasks. In order to help the seamless migration from one task to subsequent tasks, we provide instructions for carrying out tasks. Since the proposed process is based on UML diagrams and the basic objectory process, we believe that OO frameworks can be more efficiently developed by utilizing the proposed process, and higher quality OO frameworks can be produced. In order to show the applicability and effectiveness of the process, we present a case study of electronic commerce application. © 1998 IEEE.

关键词： Unified Modeling Language

来源：评论

学校读者我要写书评

暂无评论

Extraction of Named Entities from Tables in Gene Mutation Literature

Extraction of Named Entities from Tables in Gene Mutation Li...

引用

2009 Biomedical Natural Language Processing Workshop, BioNLP 2009

作者： Wong, Wern Martinez, David Cavedon, Lawrence Nicta Victoria Research Laboratory The University of Melbourne Australia Dept of Computer Science and Software Engineering The University of Melbourne Australia

ISBN: (纸本)9781932432305

We investigate the challenge of extracting information about genetic mutations from tables, an important source of information in scientific papers. We use various machine learning algorithms and feature sets, and evaluate performance in extracting fields associated with an existing handcreated database of mutations. We then show how classifying tabular information can be leveraged for the task of named entity detection for mutations. © 2009 The Association for Computational Linguistics.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Wildfire Spread Prediction Using Attention Mechanisms in U-NET

Wildfire Spread Prediction Using Attention Mechanisms in U-N...

引用

2023 International Conference on Electrical, computer, Communications and Mechatronics engineering, ICECCME 2023

作者： Shah, Kamen Pantoja, Maria California Polytechnic State University Dept. Computer Science and Software Engineering San Luis Obispo United States

ISBN: (纸本)9798350322972

Global warming has increased large-scale natural disasters at an alarmingly greater frequency. These natural disasters affect humans and the ecosystems that all species rely upon for food and shelter. A significant byproduct of global warming is the emergence of mega-fires, which are wildfires that burn more than 100,000 acres. Mega fires have exhibited the capacity to destroy entire ecosystems and urban areas. Researchers forecast a significant increase in wildfires during the next decade. This is a fundamentally growing problem that mandates modern solutions. Currently, simulation models are employed to predict wildfire propagation and aid firefighters in suppressing them. However, these methods are computationally expensive and often inaccurate. A recent advance in this area is the usage of neural networks (NN), which are systematically more accurate and computationally efficient. This paper focuses on predicting wildfire spread using NN with an attention mechanism to improve spatial recognition and overall performance in neural networks for wildfire spread prediction. We train different models on 12 distinct observational variables derived from the Google Earth Engine catalog. Evaluation is conducted with accuracy, Dice coefficient score, ROC-AUC, and F1-score. Results show that when augmenting segmentation models with attention mechanisms, the attention component improves feature suppression and recognition, improving overall performance. Furthermore, we use ensemble modeling to reduce bias and variation, leading to more consistent and accurate predictions. The architecture presented in this research achieved a ROC-AUC score of 86.2% and an accuracy of 82.1% when inferencing on wildfire propagation at 30-minute intervals. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Exact Dynamic Programming for decentralized POMDPs with lossless policy compression

Exact Dynamic Programming for decentralized POMDPs with loss...

引用

18th International Conference on Automated Planning and Scheduling, ICAPS 2008

作者： Boularias, Abdeslam Chaib-Draa, Brahim Computer Science and Software Engineering Dept. Laval University QC Glk 7p4 Canada

ISBN: (纸本)9781577353867

High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a probability distribution over the system states and the policies of other agents. Belief compression is an efficient POMDP approach that speeds up planning algorithms by projecting the belief state space to a low-dimensional one. In this paper, we introduce a new method for solving DEC-POMDP problems, based on the compression of the policy belief space. The reduced policy space contains sequences of actions and observations that are linearly independent. We tested our approach on two benchmark problems, and the preliminary results confirm that Dynamic Programming algorithm scales up better when the policy belief is compressed. Copyright © 2008, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Satisfying test preconditions through guided object selection

Satisfying test preconditions through guided object selectio...

引用

3rd International Conference on software Testing, Verification and Validation, ICST 2010

作者： Wei, Yi Gebhardt, Serge Meyer, Bertrand Oriol, Manuel Department of Software Engineering ETH Zurich Switzerland Dept. of Computer Science University of York York United Kingdom

ISBN: (纸本)9780769539904

A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditions. This limitation is particularly frustrating if the object pool does contain some precondition-satisfying objects but the strategy, which selects objects at random, does not use them. The extension of random testing described in this article addresses the problem. Experimentally, the resulting strategy succeeds in testing 56% of the routines that the pure random strategy missed;it tests hard routines 3.6 times more often;although it misses some of the faults detected by the original strategy, it finds 9.5% more faults overall;and it causes negligible overhead. © 2010 IEEE.

关键词： Linear constraint solving Precondition satisfaction Random testing

来源：评论

学校读者我要写书评

暂无评论

Integrating AI and Cybersecurity: Advancing Autonomous Vehicle Security and Response Mechanisms 4

Integrating AI and Cybersecurity: Advancing Autonomous Vehic...

引用

4th International Conference on Emerging Trends in Networks and computer Communications, ETNCC 2024

作者： Namburi, Venkata Lakshmi Adapa, Srinivasa Rao Chamala, Shanti Swaroop Kumar Yerram, Manish Gupta, Pranjal Upreti, Kamal Software Systems Engineer Danlaw Inc MI United States Software Engineer OpenLogix LLC MI United States Software Developer Software Bots Inc MI United States Computer Science with IOT VNRVJIET Hyderabad India Computer Science Engineering ADGIPS Delhi India Dept. of Computer Science Christ University Delhi NCR Campus India

ISBN: (纸本)9798350353266

The rapid evolution of autonomous and connected vehicles has led to their integration with numerous technologies and software, rendering them vulnerable targets for cybersecurity attacks. While efforts have traditionally focused on preventing these attacks, the escalating risk underscores the importance of also vindicating their wallop. Nevertheless, this procedure is often onerous & facade scalability confronted, particularly due to connectivity issues in automobiles. This research advises a vehicle-based vibrant imposition response scheme, enabling swift responses to a variety of incidents and reducing reliance on external security centers. The classification encompasses an inclusive range of probable retorts, a procedure for evaluating retorts, & innumerable assortment approaches. Implemented on an embedded platform, the solution was evaluated using two distinct cyberattack use cases, highlighting its adaptability, responsiveness, volume for dynamic arrangement constraint alterations & nominal memory trail. Concurrently, this paper presents an innovative (AVSF) that synergistically integrates (AI) and cybersecurity techniques to fortify AV resilience against evolving threats. Additionally, the framework incorporates advanced cybersecurity measures such as encryption, authentication, and intrusion detection to mitigate vulnerabilities and safeguard critical AV systems. The fusion of AI and cybersecurity not only enhances AV security posture but also enables intelligent cyber threat monitoring and response capabilities. Extensive simulations and experimental evaluations demonstrate the efficacy of the AVSF in real-time scenarios, contributing to the development of robust security solutions for autonomous vehicle deployment and advancing safer transportation systems in the era of AI-driven mobility. © 2024 IEEE.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

The multi-rule partial sequenced route query 08

The multi-rule partial sequenced route query

引用

16th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM GIS 2008

作者： Chen, Haiquan Ku, Wei-Shinn Sun, Min-Te Zimmermann, Roger Dept. of Computer Science and Software Engineering Auburn University Auburn AL 36849 United States Dept. of Computer Science and Information Engineering National Central University Taoyuan 320 Taiwan Dept. of Computer Science National University of Singapore Singapore 117590 Singapore

ISBN: (纸本)9781605583235

Trip planning search (TPS) represents an important class of queries in Geographic Information Systems (GIS). In many real-world applications, TPS requests are issued with a number of constraints. Unfortunately, most of these constrained TPS cannot be directly answered by any of the existing algorithms. By formulating each restriction into rules, we propose a novel form of route query, namely the multi-rule partial sequenced route (MRPSR) query. Our work provides a unified framework that also subsumes the well-known trip planning query (TPQ) and the optimal sequenced route (OSR) query. In this paper, we first prove that MRPSR is NP-hard and then present three heuristic algorithms to search for near-optimal solutions for the MRPSR query. Our extensive simulations show that all of the proposed algorithms can answer the MRPSR query effectively and efficiently. Using both real and synthetic datasets, we investigate the performance of our algorithms with the metrics of the route distance and the response time in terms of the percentage of the constrained points of interest (POI) categories. Compared to the LORD-based brute-force solution, the response times of our algorithms are remarkably reduced while the resulting route length is only slightly longer than the shortest route. Copyright 2008 ACM.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：