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

2nd International Conference on Advance Computing and Innovative Technologies in engineering, ICACITE 2022

作者： Chahar, Ankit Christobel, Y. Angeline Ritika Adakane, Prashant K. Sonal, Deepa Tripathi, Vikas R.V. College of Engineering Student Department of Computer Science and Engineering Karnataka Bengaluru India School of Computational Studies Hindustan College of Arts & Science Chennai India G.L Bajaj Institute of Technology & Management It Department Greater Noida India G H Raisoni University Department of Computer Science and Engineering Amravati India Patna Women's College Department of Computer Science Bihar Patna800014 India Graphic Era Deemed to Be University Department of Computer Science & Engineering Uttarakhand Dehradun India

ISBN: (纸本)9781665437899

It is not possible to handle and huge amounts of data using present software programmes and personal computers owing to a lack of appropriate computing power. Manufacturing organisations must either employ Cloud computing technology or engage in more current techniques including Edge Computing technology if they are to compete in the global market. The SEM model is used to examine the Smart Grid Information Processes in this article. Furthermore, it is proposed that the research contributes to the expansion of experience in the discipline of smart meters and Internet of Things acceptability, despite the fact that this is a very rare topic. © 2022 IEEE.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Online Affinity of Instructing Methods for Using Personal-Efficacy and Reading Capacious During Covid-19 5th

Online Affinity of Instructing Methods for Using Personal-Ef...

引用

5th International Conference on Communication, Device and Networking, ICCDN 2021

作者： PremaLatha, V. Sreedevi, E. Sivakumar, S. Nayak, Soumya Ranjan Bhoi, Akash Kumar Ghosh, Uttam Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation K L University Guntur Vaddeswaram522502 India Department of Computer Applications Faculty of Science and Humanities SRM Institute of Science and Technology Kattankulathur603203 India Amity School of Engineering and Technology Amity University Uttar Pradesh Noida India KIET Group of Institutions Delhi-NCR Ghaziabad201206 India Directorate of Research Sikkim Manipal University Sikkim Gangtok737102 India Department of Computer Science and Data Science Meharry School of Computational Sciences Nashville NashvilleTN United States

ISBN: (纸本)9789811920035

Now a days in EFL procedure of education the ability of reading became as significant belief and personal-efficacy reading as a basic understanding for students. By monitoring the acknowledged participates under the ballpark figure of large studying and methods of understanding, the impact of their observation is premeditated on reading of each one’s personal-efficacy. On a daily routine all these things are comparatively considered which are put into effect by teachers of handful in number. Approach towards exhibiting Extensive reading (ER) is inspected to be "more expensive, difficult, and time-consuming". Method of recognition of elements in a various way for effective impact in putting its efforts to utilize for its empowerment. Paper has been segregated into two contexts: Association with attitude is considered as primary one and attitude is considered as secondary one. Whether knowledge work is understood by student or not is considered as the impact of ER by the first review. Procedure which are convenient is taken as the observations of student and is analysed as second one. The examinations are quantifiable to utilize the observations as information in terms of subjective way taken from students who belong to first academic year of reading course in a systematic way and 603 details of undergraduate students from KLEF of Guntur were chosen as participants for extant examination. In ER programme of includes and excludes "comprehension reading work" is treated as fundamental in the proposal of disclosures. In case of any, "the programme appeared to positively affect contributing students". Techniques of classification like "decision tree and Mixed Model Database Miner (MMDBM)" are employed in this paper which leads to improvements of post-test to pre-test in ER group. Observations of students in ER results as optimistic and algorithm of MMDBM which leads to accuracy in higher rate in pre-test and post-test detection. © 2023, The Author(s), under exclusive lice

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Design of Approximate Multiplier Using Highly Compressed 5_2 Counter

Design of Approximate Multiplier Using Highly Compressed 5_2...

引用

Mobile Computing and Sustainable Informatics (ICMCSI), International Conference on

作者： Bathlin Nelmin N R S Shaji Hariprasad S Sudeshna Shettygari Vasan J K Vijayan V Department of Electronics and Communication Engineering University College of Engineering Nagercoil India Department of Computer Science and Engineering St. Xavier's Catholic College of Engineering Nagercoil India Department of Computational Intelligence School of Computing SRM Institute of Science and Technology Chennai India Department of Electronics and Communication Engineering SRM Institute of Science and Technology Chennai India

ISBN: (数字)9798331522667

ISBN: (纸本)9798331522674

Approximate computing effectively impacts low-power VLSI circuits by reducing circuit overhead. It introduces minimal error in the output, which does not significantly affect the application. This paper proposes an approximate multiplier constructed using 5_3 and 5_2 counters. The proposed 5_2 counter delivers two outputs instead of three, thereby achieving 60% compression. The overhead of the 5_2 counter circuit is reduced, achieving a power delay product (PDP) improvement of 18%. This reduction comes with an addition of an 6% error rate. The newly designed multiplier has less delay, where the Mean error distance (MED) is kept as low as possible. The complexity of the 5_2 counter is also reduced since the counter uses only a full adder and three gates. This is achieved by applying various error optimization mechanisms. The error parameters, (i) Error Distance (ED), and (ii) Mean Error Distance (MED) are analyzed and compared with existing works. The proposed multipliers are involved in image contrast application with better Peak Signal to Noise Ratio (PSNR) value.

关键词： Measurement PSNR Image coding Error compensation Very large scale integration Logic gates Delays Standards Optimization Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Efficient Net-based Expert System for Personalized Facial Skincare Recommendations

Efficient Net-based Expert System for Personalized Facial Sk...

引用

International Conference on ent Computing and Control Systems (ICICCS)

作者： J Akshya Vinit Mehra M. Sundarrajan Pattapu Teja Sri Mani Deepak Choudhry Department of Computational Intelligence SRM Institute of Science and Technology Chennai Department of Computer Science and Engineering SRM Institute of Science and Technology Chennai Department of Information Technology KGiSL Institute of Technology Coimbatore

In recent years, recommender systems have gained a lot of traction in both the commercial world and the academic research community. The term “recommendation system for facial skin care” refers to an automated system that gives consumers advice on which facial skin care products to use based on their specific skin type, skin issues, and preferences. Product recommendation systems analyze user data using a variety of methods, including collaborative filtering, content-based filtering, and machine learning algorithms. Better skincare results may be achieved through the usage of a suggestion system in which consumers receive advice related to their own skin issues. The problem with current models is that they don’t adequately address users’ issues and concerns while being based on collaborative or content-based filtering. In order to create an effective face skincare model, the authors of this study suggest a hybrid approach that integrates several existing methods (including KNN, CNN, Transfer Learning of Efficient Net BO, and a content-based filtering recommendation engine). The user’s skin tone, skin type, and acne severity are all inputs into the algorithm, which then outputs a recommendation for the most suitable product. The results of a comparison between the suggested model and other models prove its superiority. Using a hybrid model that takes into account a number of different methodologies and user inputs, the article aspires to deliver a more all-encompassing and individualized solution for facial skincare recommendations. The proposed model has the potential to enhance the precision and efficiency of current skincare recommendation systems. The implementation of EfficientNet B0 improves the model’s accuracy, which now has a validation accuracy of 80% and a training accuracy of 87.10%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enhanced Privacy preserving Security scheme for Wireless Body Area Networks 5

Blockchain-Enhanced Privacy preserving Security scheme for W...

引用

5th IEEE International Conference on Advances in Electronics, computers and Communications, ICAECC 2023

作者： Sowmiya, L. Rajasekaran, Arun Sekar Suresh, A. Younas, Ammar Vimalnath, S. Nageswari, S. KPR Institute of Engineering and Technology M e VLSI Design Coimbatore India SR University Department of ECE Telangana Warangal506371 India Vellore Institute of Technology Department of Computational Intelligence Vellore India Tashkent State University of Law Department of Business Law Uzbekistan Department of ECE Karur Thalavapalayam639113 India CARE College of Engineering Department of Computer Science Tamilnadu Trichy India

ISBN: (纸本)9798350305449

Due to the emergence of telemedicine systems it is necessary to develop a system that gives accurate results and improves security in the network channel. Nowadays Wireless Body Area Network (WBAN) makes a vital role in providing a better telemedicine system. WBAN is a non-invasive mechanism and it can predict many unknown diseases accurately even when a medical practitioner cannot able to predict the diseases. In WBAN, the patient is connected to sensors such as Electro Encephalo Gram (EMG), Electro Cardio Gram (EEG), insulin pump and SPO2 meter. WBAN uses both implantable and wearable sensors. These sensors in the patient body collects the medical data of patient and sent it through the medical practitioner via network channel. Medical practitioner sees the stored medical data in medical server and writes prescription according to it. The problem statement is that the attacker may attack and take patient data or act like medical practitioner and spread false information inside the network channel. In order to prevent this, WBAN must have an enhanced system that prevent and guard against security attacks. In proposed system, initially the patient and medical practitioner register with their original identities in the cloud server. The cloud server issues public and private keys with an elliptic curve to patient and medical practitioner for anonymous authentication. After the process, cloud server collects the data of the patient and store it in a blockchain. Medical practitioner checks the data in the block chain and sends medical prescription after confirmation of authenticated patient. Using of blockchain with cloud server increases the resistant to security attacks and patient data will be all time in the blockchain so the medical practitioner can easily retrieve the patient data without any delay. The proposed work is strength to many security attacks and provided reduced computation cost for cloud based WBAN with blockchain. © 2023 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Spiking representation learning for associative memories

arXiv

引用

arXiv 2024年

作者： Ravichandran, Naresh Lansner, Anders Herman, Pawel Computational Cognitive Brain Science Group Department of Computational Science and Technology School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Mathematics Stockholm University Stockholm Sweden Digital Futures KTH Royal Institute of Technology Stockholm Sweden

Networks of interconnected neurons communicating through spiking signals offer the bedrock of neural computations. Our brain’s spiking neural networks have the computational capacity to achieve complex pattern recognition and cognitive functions effortlessly. However, solving real-world problems with artificial spiking neural networks (SNNs) has proved to be difficult for a variety of reasons. Crucially, scaling SNNs to large networks and processing large-scale real-world datasets have been challenging, especially when compared to their non-spiking deep learning counterparts. The critical operation that is needed of SNNs is the ability to learn distributed representations from data and use these representations for perceptual, cognitive and memory operations. In this work, we introduce a novel SNN that performs unsupervised representation learning and associative memory operations leveraging Hebbian synaptic and activity-dependent structural plasticity coupled with neuron-units modelled as Poisson spike generators with sparse firing (~1 Hz mean and ~100 Hz maximum firing rate). Crucially, the architecture of our model derives from the neocortical columnar organization and combines feedforward projections for learning hidden representations and recurrent projections for forming associative memories. We evaluated the model on properties relevant for attractor-based associative memories such as pattern completion, perceptual rivalry, distortion resistance, and prototype extraction. © 2024, CC BY-SA.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Mixing between flavor singlets in lattice gauge theories coupled to matter fields in multiple representations

引用

Physical Review D 2024年第7期110卷 074504页

作者： Ed Bennett Niccolò Forzano Deog Ki Hong Ho Hsiao Jong-Wan Lee C.-J. David Lin Biagio Lucini Maurizio Piai Davide Vadacchino Fabian Zierler Swansea Academy of Advanced Computing Department of Physics Faculty of Science and Engineering Department of Physics Extreme Physics Institute Institute of Physics Particle Theory and Cosmology Group Center for Theoretical Physics of the Universe Centre for Theoretical and Computational Physics Centre for High Energy Physics Department of Mathematics Faculty of Science and Engineering Centre for Mathematical Sciences

We provide the first extensive, numerical study of the nontrivial problem of mixing between flavor-singlet composite states emerging in strongly coupled lattice field theories with matter field content consisting of fermions transforming in different representations of the gauge group. The theory of interest is the minimal candidate for a composite Higgs model that also accommodates a mechanism for top partial compositeness: the Sp(4) gauge theory coupled to two (Dirac) fermions transforming as the fundamental and three as the two-index antisymmetric representation of the gauge group, respectively. We apply an admixture of APE smearing and Wuppertal smearings, as well as the generalized eigenvalue problem approach, to two-point functions involving flavor-singlet mesons, for ensembles having time extent longer than the space extent. We demonstrate that, in the region of lattice parameter space accessible to this study, both masses and mixing angles can be measured effectively, despite the presence of (numerically noisy) contributions from disconnected diagrams.

关键词： Composite models Extensions of Higgs sector Strong interaction Lattice field theory Lattice gauge theory

来源：评论

学校读者我要写书评

暂无评论

Parallel Repetition for 3-Player XOR Games

arXiv

引用

arXiv 2024年

作者： Bhangale, Amey Braverman, Mark Khot, Subhash Liu, Yang P. Minzer, Dor Department of Computer Science and Engineering University of California Riverside United States Department of Computer Science Princeton University United States Department of Computer Science Courant Institute of Mathematical Sciences New York University United States School of Mathematics Institute for Advanced Study Department of Mathematics Massachusetts Institute of Technology United States

In a 3-XOR game G, the verifier samples a challenge (x, y, z) ~ µ where µ is a probability distribution over Σ × Γ × Φ, and a map t: Σ × Γ × Φ → A for a finite Abelian group A defi... 详细信息

In a 3-XOR game G, the verifier samples a challenge (x, y, z) ~ µ where µ is a probability distribution over Σ × Γ × Φ, and a map t: Σ × Γ × Φ → A for a finite Abelian group A defining a constraint. The verifier sends the questions x, y and z to the players Alice, Bob and Charlie respectively, receives answers f(x), g(y) and h(z) that are elements in A and accepts if f(x) + g(y) + h(z) = t(x, y, z). The value, val(G), of the game is defined to be the maximum probability the verifier accepts over all players’ strategies. We show that if G is a 3-XOR game with value strictly less than 1, whose underlying distribution over questions µ does not admit Abelian embeddings into (Z, +), then the value of the n-fold repetition of G is exponentially decaying. That is, there exists c = c(G) > 0 such that val(Gn) ≤ 2−cn. This extends a previous result of [Braverman-Khot-Minzer, FOCS 2023] showing exponential decay for the GHZ game. Our proof combines tools from additive combinatorics and tools from discrete Fourier analysis. Copyright © 2024, The Authors. All rights reserved.

关键词： Fourier analysis

来源：评论

学校读者我要写书评

暂无评论

Investigating Fault-Tolerance Techniques for Protecting Cyber-Physical Systems 2

Investigating Fault-Tolerance Techniques for Protecting Cybe...

引用

2nd International Conference on Advances in Computation, Communication and Information Technology, ICAICCIT 2024

作者： Jaggi, Arjun Takkalapally, Prashamsh Rajaram, Shravan Kumar Hudani, Karim Jiwani, Nasmin Natarajan, Yuvaraj HCLTech San DiegoCA United States Department of Engineering Computing and Mathematical Sciences Lewis University United States Microsoft Inc. CharlotteNC United States Tampa FL United States Dept. of Information Technology University of The Cumberlands WilliamsburgKY United States Department of Computer Science Engineering Sri Shakthi Institute of Engineering and Technology Tamil Nadu Coimbatore India

ISBN: (纸本)9798331541217

Cyber-physical systems (CPSs) gift a unique set of protection demanding situations because they rely on a huge and various set of digital additives. To protect CPSs from cyber-attacks, fault-tolerance techniques, inclusive of redundancy and diversity, can help to mitigate the chance of assault. The purpose of this study is to analyze the capability advantages of several fault-tolerance techniques and provide a comprehensive assessment of their effectiveness in securing CPSs. It is going to examine the impacts of different techniques on system safety, security, availability, and reliability. Furthermore, the paper will present a standard dialogue of the ability trade-offs and costs associated with distinctive fault-tolerance techniques and provide tips for deciding on the maximum appropriate method to satisfy the required level of security. This research will offer treasured perception into the relevant subjects, facilitating the development of at ease CPSs. © 2024 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

Optimal Bounds for Distinct Quartics

arXiv

引用

arXiv 2024年

作者： Charalampopoulos, Panagiotis Gawrychowski, Pawel Ghazawi, Samah School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom Institute of Computer Science University of Wroclaw Poland Department of Software Engineering Braude College of Engineering Karmiel Israel Department of Computer Science University of Haifa Israel

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms—it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n×n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permutation

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：