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

2nd International Conference on Recent Trends in Advanced Computing, Disruptive Innovation (ICRTAC-DTI)

作者： Selvamani, D. Selvi, V Sivet Coll Chennai 600073 Tamil Nadu India Mother Teresa Womens Univ Kodaikanal 624101 India

Intrusion detection systems (IDS) are indispensible for all types of networks to protect them from the intruders. The IDS have to process millions of network packets with many features, which delay the detection of anomalies. To understand the attacks of the past and to design proper tools to defeat their impending peril, Host based IDS or HIDS, establishes to be a robust design. An Efficacious Intellectual Framework for Host based Intrusion Detection with Rule Structure Generation and Pattern Matching algorithm sets the rule structure for the unknown attack generated by using Association Rule Mining in the Map Reduce Framework. It is accomplished in two stages. In the first stage, an efficacious Rule structure is generated using Intellectual method. In the second stage, brute force algorithm pattern matching algorithm is utilized in the proposed framework. It is proper to audit and review logs for malicious activity. Notably intrusions are rare after proven analysis to prevent the attacks to happen. The present HIDS establishes to be a robust design for understanding of attacks of the past and determining effective methods to defeat their future threats. (C) 2019 The Authors. Published by Elsevier B.V.

关键词： Data Mining MapReduce Network based Intrusion Detection System Association Rule Mining brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a sort-based matching algorithm for DDM 16

Evaluation of a sort-based matching algorithm for DDM

引用

16th Workshop on Parallel and Distributed Simulation

作者： Jun, Y Raczy, C Tan, G Natl Univ Singapore Sch Comp Singapore 119260 Singapore

ISBN: (纸本)0769516084

The High Level Architecture (HLA) provides several Data Distribution Management (DDM) services to reduce the transmission and reception of irrelevant data. These services rely on the computation of the intersection between "update" and "subscription" regions. As the brute force approach does not scale well, the current implementations of DDM usually use a grid partitioning of the routing space to efficiently compute the intersection. Since this approach still has some shortcomings, we have focused our recent research on the design and the evaluation of different intersection algorithms for the DDV. In this paper, we introduce a new intersection algorithm in which regions are sorted before computing the intersections. The strong points of this algorithm are (1) the sort suppresses many useless checks, (2) the algorithm allows many optimizations at the implementation level. An experimental comparison of this algorithm with brute force and grid-based approach provides additional information about the good points and weak points of each of the three approaches.

关键词： high level architecture runtime infrastructure data distribution management brute force algorithm grid-based algorithm sort-based algorithm

来源：评论

学校读者我要写书评

暂无评论

Accelerate Assessment Calculations for Quadratic Assignment Problem Solution

Accelerate Assessment Calculations for Quadratic Assignment ...

引用

2024 Conference of Young Researchers in Electrical and Electronic Engineering, ElCon 2024

作者： Thike, Aye Min Lupin, Sergey A. National Research University of Electronic Technology Zelenograd Moscow Russia

ISBN: (纸本)9798350360646

The Quadratic Assignment Problem (QAP) is widely recognized as an important combinatorial optimization problem. QAP finds extensive applications in practical scenarios such as facility placement, computer manufacturing, communication networks, and other areas. It solves real-world challenges by optimizing resource allocation in a way that minimizes costs or distances. The essence of the proposed approach is a systematic enumeration of possible permutations of elements using the next lexicographical permutation and heap's methods. Rather than relying on random or heuristic-based initialization, we generate permutations in a predictable sequence. Moreover, this study proposes an efficient calculation approach that selectively calculates only the changes in elements resulting from the adjustment of permutations, thereby reducing the need to re-evaluate the entire cost function for each permutation and speeding up the search for optimal solutions. In addition, we employ a brute force algorithm, which evaluates all permutations and calculates the cost of each permutation, and an illustrative implementation of this approach using C++ program for QAP. The proposed approach demonstrates improved computational efficiency, reduces the search space, and opens avenues for further exploration of the use of optimization technologies in other combinatorial optimization problems for larger problem instances. © 2024 IEEE.

关键词： brute force algorithm next lexicographical permutation method and heap's method optimization methods quadratic assignment problem

来源：评论

学校读者我要写书评

暂无评论

Indonesian text-to-speech using syllable concatenation for PC-based low vision aid

Indonesian text-to-speech using syllable concatenation for P...

引用

2011 International Conference on Electrical Engineering and Informatics, ICEEI 2011

作者： Soedirdjo, Subaryani D.H. Zakaria, Hasballah Mengko, Richard Biomedical Engineering Programme Institut Teknologi Bandung Ganesha 10 Bandung Indonesia

ISBN: (纸本)9781457707520

Severe low vision patient cannot read a text clearly. Thus, an instrument engineered for them should have an extra function to read aloud the text. Nowadays, Bahasa Indonesia is still not supported properly in any text to speech modul. This ongoing research is trying to develop an Indonesian text to speech with syllable concatenation. The input of the system comes from a plain text file or manually typed input. This text is then truncated until we get a list of words. The word is then analyzed using brute force algorithm to get proper combination of syllable according to the sound library, which has been recorded previously. Arranged sound then came out from speaker. Test of the system shows that this method works well for any text in Bahasa Indonesia. © 2011 IEEE.

关键词： Bahasa Indonesia Bahasa Indonesia Delay force Indonesian text-to-speech module Instruments Libraries PC-based low vision aid Software Speech Visualization brute force algorithm handicapped aids plain text file speech synthesis syllable concatenation syllable concatenation text analysis text to speech vision defects

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Exhaustive Search Energy Optimization Method for Residential Building Envelope in Different Climatic Zones of Kazakhstan

引用

BUILDINGS 2021年第12期11卷 633页

作者： Kaderzhanov, Mirzhan Memon, Shazim Ali Saurbayeva, Assemgul Kim, Jong R. Nazarbayev Univ Sch Engn & Digital Sci Dept Civil & Environm Engn Nur Sultan 010000 Kazakhstan

Nowadays, the residential sector of Kazakhstan accounts for about 30% of the total energy consumption. Therefore, it is essential to analyze the energy estimation model for residential buildings in Kazakhstan so as to reduce energy consumption. This research is aimed to develop the Overall Thermal Transfer Value (OTTV) based Building Energy Simulation Model (BESM) for the reduction of energy consumption through the envelope of residential buildings in seven cities of Kazakhstan. A brute force optimization method was adopted to obtain the optimal envelope configuration varying window-to-wall ratio (WWR), the angle of a pitched roof, the depth of the overhang shading system, the thermal conductivity, and the thicknesses of wall composition materials. In addition, orientation-related analyses of the optimized cases were conducted. Finally, the economic evaluation of the base and optimized cases were presented. The results showed that an average energy reduction for heating was 6156.8 kWh, while for cooling it was almost 1912.17 kWh. The heating and cooling energy savings were 16.59% and 16.69%, respectively. The frontage of the building model directed towards the south in the cold season and north in the hot season demonstrated around 21% and 32% of energy reduction, respectively. The energy cost savings varied between 9657 to 119,221 x20b8;for heating, 9622 to 36,088 x20b8;for cooling.

关键词： building envelope optimization OTTV energy consumption brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

An efficacious intellectual framework for host based intrusion detection system

引用

Procedia Computer Science 2019年 165卷 9-17页

作者： D. Selvamani V. Selvi SIVET COLLEGE GOWRIVAKKAM CHENNAI -600073 INDIA MOTHER TERESA WOMEN’S UNIVERSITY KODAIKANAL- 624101 INDIA

Intrusion detection systems (IDS) are indispensible for all types of networks to protect them from the intruders. The IDS have to process millions of network packets with many features, which delay the detection of anomalies. To understand the attacks of the past and to design proper tools to defeat their impending peril, Host-based IDS or HIDS, establishes to be a robust design. An Efficacious Intellectual Framework for Host based Intrusion Detection with Rule Structure Generation and Pattern Matching algorithm sets the rule structure for the unknown attack generated by using Association Rule Mining in the Map Reduce Framework. It is accomplished in two stages. In the first stage, an efficacious Rule structure is generated using Intellectual method. In the second stage, brute force algorithm pattern matching algorithm is utilized in the proposed framework. It is proper to audit and review logs for malicious activity. Notably intrusions are rare after proven analysis to prevent the attacks to happen. The present HIDS establishes to be a robust design for understanding of attacks of the past and determining effective methods to defeat their future threats.

关键词： Data Mining MapReduce Network based Intrusion Detection System Association Rule Mining brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of photovoltaic panel tilt angle for short periods of time or multiple reorientations

引用

ENERGY CONVERSION AND MANAGEMENT-X 2023年 20卷

作者： Prunier, Yanis Chuet, David Nicolay, Sylvain Hamon, Gwenaelle Darnon, Maxime Univ Sherbrooke Inst Interdisciplinaire Innovat Technol 3IT 3000 Blvd Univ Sherbrooke PQ J1K 0A5 Canada Univ Sherbrooke Inst Interdisciplinaire Innovat Technol 3IT Lab Nanotechnol Nanosyst LN2 CNRS IRL 3463 3000 Blvd Univ Sherbrooke PQ J1K 0A5 Canada

Photovoltaic installations typically use fixed-mount photovoltaics (PV) panels with a constant orientation throughout the year. However, this does not maximize the energy output since the irradiance received by the panels depends on the sun position and the weather. This paper presents a novel approach to maximize the energy produced by fixed-mount PV panels for short-term and for permanent PV installations. For permanent installations, we considered a multiple-tilt scenario where the panel orientation is modified throughout the year. We developed a bi-layer algorithm to optimize the angles and timing of adjustments. Our method has been implemented in an open-source software, allowing optimal orientations and dates to be calculated for any installation. The optimal dates and the optimal angles have been successfully calculated for PV panels located at Reykjavik (Iceland), Sherbrooke (Canada), Quito (Ecuador), and Brasilia (Brazil). We found that two reor-ientations per year were the most suitable option for all locations, resulting in a 3 % to 4.8 % gain in annual energy production compared to no reorientation. For short-term installations, using optimal orientation can improve energy production, with for instance 13 % improvement for a monthly installation in Brasilia.

关键词： Photovoltaic panels Optimal orientation Seasonal tilt Typical meteorological year brute force algorithm

来源：评论

学校读者我要写书评

暂无评论

The Computational Aspects of Estimating the Efficiency of Wireless Networks' Topology

The Computational Aspects of Estimating the Efficiency of Wi...

引用

IEEE Russia Section Young Researchers in Electrical and Electronic Engineering Conference (EIConRus)

作者： Thike, Aye Min Lupin, Sergey Than, Ba Hla Chakirov, Roustiam Natl Res Univ Elect Technol Moscow Russia Bonn Rhein Sieg Univ Appl Sci St Augustin Germany

ISBN: (纸本)9781509048656

Wireless Network has become the critical part of the communication infrastructure in our environment. Nowadays, the using of mobile computing devices such as laptops and Wi-Fi enabled phones in the workplace is increasing. The design of wireless networks for enterprise environments remains a challenging task due to the problem of topological design. In this paper, we discuss the computational aspects of the task of calculation the various criteria of efficiency wireless networks' topology. These criteria determine the different characteristics of wireless networks - the access level of populations to network services, the level of the distributed signal and the level of signal accepted in the city. We use brute force algorithm for comparing the different criteria of efficiency the topology of wireless networks. The brute force algorithm has high computational complexity therefore in our experiments we use parallel computing to solve the problem. For illustration the results we use the task of optimization the Wireless network topology for fragment of Myanmar territory.

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

来源：评论

学校读者我要写书评

暂无评论

Evaluation of a sort-based matching algorithm for DDM 02

Evaluation of a sort-based matching algorithm for DDM

引用

Proceedings of the sixteenth workshop on Parallel and distributed simulation

作者： Yu Jun Come Raczy Gary Tan National University of Singapore Singapore

ISBN: (纸本)9780769516080

The High Level Architecture (HLA) provides several Data Distribution Management (DDM) services to reduce the transmission and reception of irrelevant data. These services rely on the computation of the intersection between "update" and "subscription" regions. As the brute force approach does not scale well, the current implementations of DDM usually use a grid partitioning of the routing space to efficiently compute the intersection. Since this approach still has some shortcomings, we have focused our recent research on the design and the evaluation of different intersection algorithms for the *** this paper, we introduce a new intersection algorithm in which regions are sorted before computing the intersections. The strong points of this algorithm are (1) the sort suppresses many useless checks, (2) the algorithm allows many optimizations at the implementation level. An experimental comparison of this algorithm with brute force and grid-based approach provides additional information about the good points and weak points of each of the three approaches.

关键词： runtime infrastructure data distribution management grid-based algorithm sort-based algorithm brute force algorithm high level architecture

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：