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

Convergence analysis of a Schrödinger problem with moving boundary

Mathematics and Computers in Simulation 2025年 238卷 45-64页

作者： Alfaro Vigo, Daniel G. Gomes, Daniele C.R. do Carmo, Bruno A. Rincon, Mauro A. Institute of Computing Federal University of Rio de Janeiro Caixa Postal 68.530 RJ Rio de JaneiroCEP 21941-590 Brazil Graduate Program in Informatics Federal University of Rio de Janeiro Caixa Postal 68.530 RJ Rio de JaneiroCEP 21941-590 Brazil

In this article, we present the mathematical analysis of the convergence of the linearized Crank–Nicolson Galerkin method for a nonlinear Schrödinger problem related to a domain with a moving boundary. The convergence analysis of the numerical method is carried out for both semidiscrete and fully discrete problems. We establish an optimal error estimate in the L2-norm with order O(τ2+hs),2≤s≤r, where h is the finite element mesh size, τ is the time step, and r−1 represents the degree of the finite element polynomial basis. Numerical simulations are provided to confirm the consistency between theoretical and numerical results, validating the method and the order of convergence for different degrees p≥1 of the Lagrange polynomials and also for Hermite polynomials (degree p=3), which form the basis of the approximate solution. © 2025 International Association for Mathematics and Computers in Simulation (IMACS)

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

Investigating the computation of smoothed deceptive routes in topographic terrains for agent-based simulation systems

Investigating the computation of smoothed deceptive routes i...

引用

Computational Intelligence in Security, Defence and Biometrics (CISDB), IEEE Symposium on

作者： Luigi P. Souza Thiago R. S. Leão Crhistopher Lenhard Edison P. Freitas Luis A. L. Silva Graduate Program in Computer Science Federal Univ. of Santa Maria Santa Maria Brazil Undergraduate Course in Computer Science Federal Univ. of Santa Maria Santa Maria Brazil Institute of Informatics Federal Univ. of Rio Grande do Sul Porto Alegre Brazil Applied Computing Department Federal Univ. of Santa Maria Santa Maria Brazil

ISBN: (数字)9798331508296

ISBN: (纸本)9798331508302

The capacity to deceptively move in hilly terrains is fundamental to agents in simulation systems for tactical and strategic military training. Such an ability to deceive the adversary can ensure a relevant advantage by hiding the real goals of a mission. Using pairs of real and deceptive mission goals, this paper investigates the planning of realistic deceptive routes for simulated agents. With real-world terrain elevation maps, it shows how to explore pathfinding algorithms with relevant path-smoothing characteristics (Theta* and WJPS*, contrasting with the standard $A^{*}$ algorithm) in terrains with pronounced relief features. The study analyzes the effects of terrain elevation costs and the representation of relief contour lines on the determination of more realistic deceptive paths. This work also investigates how users can adjust a Last Topographic Deceptive Point ($L D P_{T}$) calculation to enhance the pathfinding algorithm’s ability to produce more deceptively dense and topographically aware routes. Experimental results for different deceptive topographic path planning strategies are evaluated according to statistical models showing that Theta*, despite being slower than the base $A^{*}$ method in most cases, generated smoothed paths while maintaining a similar deception density for the proposed strategies. On the other hand, WJPS outperformed both in execution time for certain strategies while maintaining the smoothed path characteristic and resulting in a path with lower deceptive capacity.

关键词： Training Hands Biometrics Costs Path planning Planning Security Standards Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

Strengthening the Security of Deniable Authentication Scheme Using Zero-Knowledge Proof 11

Strengthening the Security of Deniable Authentication Scheme...

引用

11th International Conference on Communication and Network Security, ICCNS 2021

作者： Moesriami Barmawi, Ari Rizal Nurjaman, Asep Informatics Graduate Program School of Computing Telkom University Bandung Indonesia

ISBN: (纸本)9781450386425

In an electronic voting system, authentication is used to ensure that the voter is legitimate without knowing his/her identity, while the vote collectors verify the data is received from a legitimate user without knowing the identity of the voter. One of the authentication schemes that fulfilled this requirement is called a deniable authentication scheme, where the receiver can prove the source of the message while another party cannot identify the source of the message. In 2013, Li-Takagi et al. proposed a deniable authentication scheme. However, Li-Takagi's scheme has weaknesses if the receiver fully cooperates with the third party. In this case, the third party can identify the source of a given message. In the proposed method, zero-knowledge proof is introduced to preserve the anonymity of the deniable authentication scheme when the receiver fully cooperates with the third party. Based on the analysis, the proposed scheme fulfills the requirement of the deniable authentication scheme when the receiver fully cooperates with the third party. However, the proposed scheme has additional computation costs for securing the shared secret key. Two attack schemes that are carried out on both Li-Takagi and the proposed scheme are the MITM attack and the impersonation attack. The probability of breaking the proposed scheme using an MITM attack is lower than when using Li-Takagi's scheme, but the probability of breaking the proposed scheme using an impersonation attack is the same as Li-Takagi's scheme. © 2021 ACM.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Linguistic based steganography using lexical substitution and syntactical transformation 6

Linguistic based steganography using lexical substitution an...

引用

6th International Conference on IT Convergence and Security, ICITCS 2016

作者： Barmawi, Ari Informatics Graduate Program School of Computing Telkom University Bandung Indonesia

ISBN: (纸本)9781509037643

Recently, secure information transmission is necessary such that no one can detect information sent via an open channel. In 2013, Chang and Clark proposed a method using lexical substitution and vertex coding for securing the information exchange between parties, such that no one can detect the exchanged information. However, the maximum payload capacity was still 2 bits. This work proposed a method for increasing the payload capacity of Chang's method by applying additional syntactical transformation instead of only lexical substitution and vertex coding. Based on the implementation, the payload resulted by the proposed method may increase minimum 2 bits, such that the minimum payload size is 4 bits, which is greater than Chang's method. © 2016 IEEE.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

New Energy-Efficient 3-2 and 4-2 Approximate Adder Compressors Topologies 30

New Energy-Efficient 3-2 and 4-2 Approximate Adder Compresso...

引用

30th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2023

作者： Lopes, Rodrigo Antonietti, Leonardo Rosa, Morgana M. A. Costa, Eduardo Soares, Rafael Bampi, Sergio Graduate Program on Computing Pelotas Brazil Graduate Program on Electronic Engineering and Computing Pelotas Brazil PPGC & PGMICRO - Informatics Institute Porto Alegre Brazil

ISBN: (纸本)9798350326499

Addition units are present across many computational kernels inherent in various error-tolerant applications, including machine learning, signal, image, and video processing. Notably, adder compressors are the target when high speed and low power are the main design concerns. This work introduces energy-efficient structures of 3-2 approximate adder compressors (Ax3-2) and three distinct versions of 4-2 approximate adder compressors (Ax4-2). We compared our proposed Ax3-2 and Ax4-2 compressors with state-of-the-art energy-efficient approximate adder compressors (AxACs). Both Ax3-2 and Ax4-2 models passed through rigorous tests as standalone units. Furthermore, we integrated the Ax4-2 models into an essential application kernel appearing in video coding, i.e., the Sum Squared Differences (SSD) video accelerator. We introduce Ax3-2 and Ax4-2 that yield a new Pareto front concerning both energy-quality and area-quality trade-offs, thereby demonstrating a marked improvement over the prevailing state-of-the-art energy-efficient AxACs. © 2023 IEEE.

关键词： Adders

来源：评论

学校读者我要写书评

暂无评论

Method for improvement of transparency: Use of text mining techniques for reclassification of governmental expenditures records in Brazil

引用

International Journal of Business Intelligence and Data Mining 2021年第2期18卷 155-196页

作者： de Oliveira Almeida, Gustavo Revoredo, Kate Cappelli, Claudia Maciel, Cristiano Graduate Program in Business Federal Fluminense University Niteroi/RJ Brazil Graduate Program in Informatics Federal University of Rio de Janeiro State Rio de Janeiro/RJ Brazil Computing Institute Mato Grosso Federal University Cuiabá/MT Brazil

Many countries have transparency laws requiring availability of data. However, often data is available but not transparent. We present the Transparency Portal of Brazilian Federal Government case and discuss limitations of public acquisitions data stored in free text format. We employed text-mining techniques to reclassify descriptive texts of measurement units related to products and services. The solution presented in KNIME and Java aggregated measurements in the original (n = 69,372 with 78% reduction in number of descriptions, 94% items classified) and in cross validation sample (n = 105,266 with 88% reduction, classifying 78% of items). In addition, we tested computational time for processing of texts for a wide range of data input sizes, suggesting the stability and scalability of the solution to process larger datasets. Finally, we produced analysis identifying probable input errors, suppliers and purchasing units with abnormal transactions and factors affecting procurement prices. We present suggestions for future research and improvements. Copyright © 2021 Inderscience Enterprises Ltd.

关键词： Transparency

来源：评论

学校读者我要写书评

暂无评论

Enhancing dynamic ensemble selection: combining self-generating prototypes and meta-classifier for data classification

引用

Neural computing and Applications 2024年第32期36卷 20295-20320页

作者： Manastarla, Alberto Silva, Leandro A. Graduate Program in Electrical Engineering and Computing Mackenzie Presbyterian University R. da Consolação 930 - Consolação SP Sao Paulo01302-907 Brazil Computing and Informatics Faculty and Graduate Program in Electrical Engineering and Computing Mackenzie Presbyterian University R. da Consolação 930 - Consolação SP Sao Paulo01302-907 Brazil

In dynamic ensemble selection (DES) techniques, the competence level of each classifier is estimated from a pool of classifiers, and only the most competent ones are selected to classify a specific test sample and predict its class labels. A significant challenge in DES is efficiently estimating classifier competence for accurate prediction, especially when these techniques employ the K-Nearest Neighbors (KNN) algorithm to define the competence region of a test sample based on a validation set (known as the dynamic selection dataset or DSEL). This challenge is exacerbated when the DSEL does not accurately reflect the original data distribution or contains noisy data. Such conditions can reduce the precision of the system, induce unexpected behaviors, and compromise stability. To address these issues, this paper introduces the self-generating prototype ensemble selection (***) framework, which combines meta-learning with prototype selection. The proposed meta-classifier of *** supports multiple classification algorithms and utilizes meta-features from prototypes derived from the original training set, enhancing the selection of the best classifiers for a test sample. The method improves the efficiency of KNN in defining competence regions by generating a reduced and noise-free DSEL set that preserves the original data distribution. Furthermore, the *** framework facilitates tailored optimization for specific classification challenges through the use of hyperparameters that control prototype selection and the meta-classifier operation mode to select the most appropriate classification algorithm for dynamic selection. Empirical evaluations of twenty-four classification problems have demonstrated that *** outperforms state-of-the-art DES methods as well as traditional single-model and ensemble methods in terms of accuracy, confirming its effectiveness across a wide range of classification contexts. © The Author(s), under exclusive licence to Springer-Ver

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Discovering frequent itemsets on uncertain data: A systematic review

Discovering frequent itemsets on uncertain data: A systemati...

引用

9th International Conference on International Conference on Machine Learning and Data Mining, MLDM 2013

作者： De Carvalho, Juliano Varella Ruiz, Duncan Dubugras Computing Science Graduate Program - Faculty of Informatics Pontifical Catholic University of RS - PUCRS Porto Alegre RS Brazil

ISBN: (纸本)9783642397110

In this paper, we describe the development of a systematic review about the topic "Discovering Frequent Itemsets on Uncertain Data". To the best of our knowledge, this work seems to be the first systematic review addressing the topic. We show the whole process executed and its findings. Initially we define a rigorous protocol to lead the process. In the first phase, we create a systematic mapping of the area. In addition, from the complete reading of each article, a panorama of this area is presented. We reveal the search engines that most publicize this topic and which publishing types, authors and research institutions are involved in these papers. Moreover we identify the algorithms and the classes of these algorithms most compared over the years, how are made these comparisons, as well as their availabilities. Therefore this systematic review becomes a rich material for understanding this knowledge area. © 2013 Springer-Verlag.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Case-based comparison of career trajectories 24

Case-based comparison of career trajectories

引用

24th International Conference on Case-Based Reasoning Workshops, ICCBR-WS 2016

作者： Duarte, Kedma Weber, Rosina O. Pacheco, Roberto C. S. Graduate Program in Knowledge Engineering and Management Federal University of Santa Catarina Brazil College of Computing and Informatics Drexel University United States

Data generated across time may not be easily comparable in its original form thus potentially leading to results that may be perceived as unfair to some. We investigate quality assessment of scholarly researchers from their curricula vitae (CVs) for processes such as hiring, promotion, and grant funding. In previous work, we demonstrated that case-based reasoning (CBR) offers advantages as a transparent methodology to assess researcher quality. Its benefits include consistency, transparency, ability to adapt to specific purposes, and ability to provide explanation. The problem we now face is how to preprocess the data from the CVs to compare researchers whose scholarly production is achieved under different conditions, different points in time, and span different career trajectory lengths. We propose strategies to deal with these aspects of time during preprocessing of the data for case representation. We use 1,000 CVs from the Brazilian Lattes database to illustrate. Copyright © 2016 for this paper by its authors.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Evaluation of an agent-based reinforcement learning framework for model-based testing 7

Evaluation of an agent-based reinforcement learning framewor...

引用

7th International Congress on Ambient Intelligence, Software Engineering, and e-Health and Mobile Health, AmITIC 2024

作者： Ramírez-Méndez, Jose Quesada-López, Christian University of Costa Rica Graduate Program in Computing and Informatics San Pedro Costa Rica University of Costa Rica Department of Computer Science and Informatics San Pedro Costa Rica

ISBN: (纸本)9798350364538

This study evaluates an agent-based reinforcement learning framework for model-based testing (MBT). The framework's performance was assessed on three key metrics: effectiveness and efficiency in achieving model coverage objectives, the quantity and uniqueness of generated test cases, and code coverage. The results show improved metrics for the framework compared to traditional testers in model coverage evaluation and test case metrics. Specifically, the framework achieved higher effectiveness and efficiency, generating a higher average number of test cases with a substantial proportion of unique cases, indicating more diverse and thorough testing. Additionally, the framework, along with random and greedy testers, achieved over 70% coverage across branch, method, and line code metrics. The framework showed slightly higher values in method and line coverage compared to other testers. The evaluation highlights the use of agent-based reinforcement learning to support model-based testing in planning test case generation, exploring models using multiple strategies, and learning guided by testing metrics. Future work will focus on further refining the framework learning model, including error coverage evaluation, and testing its applicability across different software systems. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：