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

International Conference for Students on Applied Engineering (ICSAE)

作者： Thike, Aye Min Lupin, Sergey Vagapov, Yuriy Natl Res Univ Elect Technol Dept Comp Sci Zelenograd 124498 Moscow Russia Glyndwr Univ Sch Appl Sci Comp & Engn Plas CochMold Rd Wrexham LL11 2AW Wales

ISBN: (纸本)9781467390538

The paper discusses the topology optimisation of wireless networks using a brute force algorithm. In order to reduce the computational complexity of the algorithm the multi-thread application has been implemented to conduct the optimisation procedure. The efficiency of the algorithm was verified using an example task where topology of a wireless network has been optimised under various criteria.

关键词： topology optimisation wireless networks parallel computing brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

An open computing language-based parallel brute force algorithm for formal concept analysis on heterogeneous architectures

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2021年第18期33卷

作者： Novais, Joao P. P. Maciel, Lucas A. Souza, Matheus A. Song, Mark A. J. Freitas, Henrique C. Pontificia Univ Catolica Minas Gerais Dept Comp Sci Rua Walter Ianni 255 BR-31980110 Belo Horizonte MG Brazil

algorithms for the extraction of formal concepts are widely studied in several areas of knowledge, such as finance, health, and statistics. However, these algorithms require high-performance processing due to their combinatorial characteristics. In this work, an Open computing language (OpenCL)-based brute force algorithm is proposed and evaluated for formal concept extraction on heterogeneous architectures (CPU+GPU and CPU+FPGA). The CPU+GPU architecture presents higher performance and scalability than other architectures when our brute force algorithm processes high dimensional contexts with many objects and attributes. Our parallel approach shows performance results up to 18x better than a smarter sequential algorithm called Data-Peeler. Moreover, our brute force algorithm running on CPU+GPU architecture has greater energy efficiency, reaching at least 1.79x more operations per energy consumption than other algorithms on different architectures explored in this work.

关键词： brute force algorithm formal concept analysis heterogeneous architectures OpenCL

来源：评论

学校读者我要写书评

暂无评论

A brute-force algorithm for Reconstructing a Scene from Two Projections

A Brute-Force Algorithm for Reconstructing a Scene from Two ...

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Olof Enqvist Fangyuan Jiang Fredrik Kahl Centre for Mathematical Sciences Lund University

ISBN: (纸本)9781457703942

Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences, popular methods like the eight point algorithm and minimal solvers may break down due to planar scenes or small relative motions. In this paper, we derive a simple, brute-force algorithm which is both robust to outliers and has no such algorithmic degeneracies. Several cost functions are explored including maximizing the consensus set and robust norms like truncated least-squares. Our method is based on parameter search in a four-dimensional space using a new epipolar parametrization. In principle, we do an exhaustive search of parameter space, but the computations are very simple and easily parallelizable, resulting in an efficient method. Further speedups can be obtained by restricting the domain of possible motions to, for example, planar motions or small rotations. Experimental results are given for a variety of scenarios including scenes with a large portion of outliers. Further, we apply our algorithm to 3D motion segmentation where we outperform state-of-the-art on the well-known Hopkins-155 benchmark database.

关键词： brute force algorithm outliers Motion segmentation exhaustive search Cost functions four-dimensional parameter space methods

来源：评论

学校读者我要写书评

暂无评论

Comparision of Conformable and Caputo fractional grey models

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2025年 463卷

作者： Bilgil, Halis Yuksel, Simge Kayseri Univ Fac Engn Architecture & Design TR-38280 Kayseri Turkiye Aksaray Univ Dept Math TR-68100 Aksaray Turkiye

In recent years, fractional order derivatives have been encountered in various fields of science, particularly in applied mathematics. Although there are many fractional derivative definitions in the literature, there are very few studies on which derivative definition works better in a mathematical model. In applications, it is seen that calculations are easier with the model using the Conformable derivative operator due to the simplicity of the derivative definition. However, the Caputo derivative operator, which is considered to be more effective in models related to time series due to its memory property, leads to more complex calculations. In this article, two fractional grey models were created in the same structure with Conformable and Caputo derivative operators and their applications were implemented on the same data sets to performance comparison of the fractional operators. The working mechanisms of fractional grey models constructed with both Caputo and Conformable derivative operators were demonstrated in detail. Solution of the whitening differential equation in the Caputo fractional grey model was obtained using Laplace transforms. Here, Conformable and Caputo fractional grey models were applied to the forecast of three real time series and their forecast performances were compared. Data on China's annual domestic energy consumption, annual wind energy consumption, and areas affected by drought disasters were utilized as real-time series. It has been observed that Conformable fractional grey models provide more accurate predictions with lower errors for certain datasets, while Caputo fractional grey models demonstrate better performance for others. This study is the first study in the literature that compared the Conformable and Caputo derivative operators on a grey model.

关键词： Caputo fractional calculus Conformable fractional calculus brute force algorithm Fractional grey model Least square method Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Intelligent Optimized Controlled Health Care System Using brute force and Heuristic algorithms 3

Intelligent Optimized Controlled Health Care System Using Br...

引用

3rd Scientific Conference of Electrical Engineering (SCEE)

作者： Raafat, Safanah M. Naji, Diyar J. Univ Technol Iraq Control & Syst Engn Dept Baghdad Iraq

ISBN: (纸本)9781728115870

Recently, the health care system has gained increased attention due to the required increase in population in societies and the need for fast action urgent cases of health. New development of technologies, internet, and IoT make further progress in the establishment of a health care system to the extent that it considered as a measure of the progress in a country. The quality of the healthcare system depends on the comfort of patients during the treatment time and monitoring. In order to achieve these goals, scientists created a remote real-time monitoring system. In this research, the data taken from simulated healthcare sensors are used in an explicit functional model called Quality of inference (QoINF), which will be optimized within either by the intelligent brute force or heuristic algorithms. The required task is to find the best set of sensors with high accuracy and the lowest cost. Moreover, based on the value of context, the deduced best set of sensors would be examined by Fuzzy Logic Controller (FLC) to make a proper decision for the nurse or doctor that supervise the patients or elderly people.

关键词： Healthcare system sensors brute force algorithm Heuristic algorithm Remote real-time monitoring Fuzzy Logic Control

来源：评论

学校读者我要写书评

暂无评论

A comparison study of succinct data structures for use in GWAS

引用

BMC BIOINFORMATICS 2013年第1期14卷 1-7页

作者： Putnam, Patrick P. Zhang, Ge Wilsey, Philip A. Sch Elect & Comp Syst Expt Comp Lab Cincinnati OH 45221 USA Cincinnati Childrens Hosp Med Ctr Cincinnati OH 45229 USA

Background: In recent years genetic data analysis has seen a rapid increase in the scale of data to be analyzed. Schadt et al (NRG 11:647-657, 2010) offered that with data sets approaching the petabyte scale, data related challenges such as formatting, management, and transfer are increasingly important topics which need to be addressed. The use of succinct data structures is one method of reducing physical size of a data set without the use of expensive compression techniques. In this work, we consider the use of 2- and 3-bit encoding schemes for genotype data. We compare the computational performance of allele or genotype counting algorithms utilizing genotype data encoded in both schemes. Results: We perform a comparison of 2- and 3-bit genotype encoding schemes for use in genotype counting algorithms. We find that there is a 20% overhead when building simple frequency tables from 2-bit encoded genotypes. However, building pairwise count tables for genome-wide epistasis is 1.0% more efficient. Conclusions: In this work, we were concerned with comparing the performance benefits and disadvantages of using more densely packed genotype data representations in Genome Wide Associations Studies (GWAS). We implemented a 2-bit encoding for genotype data, and compared it against a more commonly used 3-bit encoding scheme. We also developed a C++ library, libgwaspp, which offers these data structures, and implementations of several common GWAS algorithms. In general, the 2-bit encoding consumes less memory, and is slightly more efficient in some algorithms than the 3-bit encoding.

关键词： Graphic Processing Unit Contingency Table Encode Scheme Frequency Table brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison Between Different Optimization Techniques in Cognitive Radio for Spectrum Allocation

引用

WIRELESS PERSONAL COMMUNICATIONS 2022年第1期125卷 143-157页

作者： Sofia, D. Sumithra Edward, A. Shirly SRM Inst Sci & Technol Coll Engn & Technol Elect & Commun Engn Chennai Tamil Nadu India

Dynamic spectrum sharing is a distributive opportunistic spectrum access for wireless users to access the spectrum any time dynamically. This proposed approach provides a spectrum allocation technique to the users based on a multi-objective genetic optimization algorithm in interweave mode of spectrum sharing. The multiple objectives targeted are minimizing BER, minimizing Power consumption, and maximizing the Throughput and minimizing interference. This proposed algorithm is compared with the existing brute force algorithm and provides a gradual increase in the fitness value for an increase in the transmission BW. Also, this proposed algorithm finds better solution to multi-objective scenario with high fitness score values.

关键词： Dynamic spectrum sharing 4G-LTE 5G-NR brute force algorithm Multi objective genetic optimization algorithm Interweave mode

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for two-dimensional Kolmogorov-Smirnov two sample tests

引用

COMPUTATIONAL STATISTICS & DATA ANALYSIS 2017年 105卷 53-58页

作者： Xiao, Yuanhui Mississippi State Univ Dept Math & Stat Mississippi State MS 39762 USA

By using the brute force algorithm, the application of the two-dimensional two-sample Kolmogorov-Smirnov test can be prohibitively computationally expensive. Thus a fast algorithm for computing the two-sample Kolmogorov-Smirnov test statistic is proposed to alleviate this problem. The newly proposed algorithm is O(n) times more efficient than the brute force algorithm, where n is the sum of the two sample sizes. The proposed algorithm is parallel and can be generalized to higher dimensional spaces. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Kolmogorov-Smirnov test brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

On optimal anchor placement for area-based localisation in wireless sensor networks

引用

IET WIRELESS SENSOR SYSTEMS 2021年第2期11卷 67-77页

作者： Cheriet, Abdelhakim Bachir, Abdelmalik Lasla, Noureddine Abdallah, Mohamed Kasdi Merbah Univ Ouargla Dept Comp Sci & Informat Technol Ouargla Algeria Mohamed Khider Univ Biskra Dept Comp Sci Biskra Algeria Hamad Bin Khalifa Univ HBKU Coll Sci & Engn Div Informat & Comp Technol Doha Qatar

We consider the problem of optimal anchor placement for area-based localisation algorithms with the goal of providing cost-effective, simple, and robust positioning in wireless sensor networks. Due to the high complexity of the problem, we propose two placement algorithms based on heuristics. The first, called genetic algorithm anchors placement (GAAP), is based on genetic algorithms meta-heuristic, and the second, called local search anchors placement (LSAP), is based on an intuitive heuristic inspired from search techniques used in quad-trees. For the evaluation of these algorithms, we built a simulation framework, which we made publicly available for the community, and compared their performance against a brute force (BF) algorithm, and against RND, a random walk-inspired algorithm. Obtained results show that GAAP provides anchor placements that lead to a very high accuracy while keeping execution time drastically smaller compared to LSAP, BF, and RND.

关键词： called local search anchors placement search problems random walk-inspired algorithm called genetic algorithm anchors placement optimal anchor placement genetic algorithms meta-heuristic Wireless sensor networks anchor placements sensor placement brute force algorithm robust positioning area-based localisation algorithms Combinatorial mathematics Optimisation techniques wireless sensor networks genetic algorithms placement algorithms

来源：评论

学校读者我要写书评

暂无评论

Identification of Numbers and Positions Using MATLAB to Solve Sudoku on FPGA 12

Identification of Numbers and Positions Using MATLAB to Solv...

引用

12 IEEE Int C Elect Energy Env Communications Computer Control

作者： Kamal, Snigdha Chawla, Simarpreet Singh Goel, Nidhi Delhi Technol Univ DCE Dept Elect & Commun Engn New Delhi 110042 India

ISBN: (纸本)9781467365406

In this paper, we propose the digital detection and decryption of a sudoku puzzle using vision based techniques and subsequent solving of the puzzle in FPGA using brute force. The system can recognize any sudoku puzzle captured from a digital camera and after employing appropriate pre-processing algorithms which include adaptive thresholding, Hough Transform and geometric transformation, the digits are recognized using Optical Character Recognition (OCR), and based on their pixel locations in the image, they are stored in corresponding locations in the 9 x 9 matrix which is then further consigned to the FPGA for solution generation. Subsequently, the FPGA uses the 9 x 9 matrix to construct bitmaps for every row, column and block which are stored in the memory. The algorithm employed to solve the sudoku puzzle uses a brute force method, which fills the empty cells in a row wise manner and backtracks if a cell is encountered to which a digit cannot be assigned. The system was tested for various kinds of Sudoku puzzles, and proved to be capable in handling problems arising from non-uniform illumination, background noise and translation and was able to work at the maximum frequency of 353.61 MHz, while consuming 314 slices, 396 LUTs and 0.253 W in power.

关键词： Sudoku Image processing Optical Character Recognition FPGA brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：