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

Exploring household food security through institutional factors: A statistical and mathematical analysis

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 9179-9195页

作者： Khan, Younas Ashraf, Shahzaib Farman, Muhammad Abdallah, Suhad Ali Osman Department of Sociology Kohat University of Science and Technology Kohat Pakistan Institute of Mathematics Khawaja Fareed University of Engineering and Information Technology Rahim Yar Khan Pakistan Department of Mathematics Faculty of Arts and Science Near East University Turkey Department of Computer Science and Mathematics Lebanese American University Beirut Lebanon Applied College Khamis Mushait King Khalid University Abha Saudi Arabia

Achieving household food security is the tumbling issue of the century. This article explores the factors affecting household food security and solutions by utilizing a synergy of statistical and mathematical models. The methodology section is divided into two portions namely sociological and mathematical methods. Sociologically, 379 household heads were interviewed through structured questions and further analyzed in terms of descriptive and binary logistic regression. The study found that 4 independent variables (poverty, poor governance, militancy, and social stratification) showed a significant association (P = 0.000) to explain variations in the dependent variable (household FS). The Omnibus test value (χ2= 102.386;P = 0.000) demonstrated that the test for the entire model against constant was statistically significant. Therefore, the set of predictor variables could better distinguish the variation in household FS. The Nagelkerke's R Square (R2 = .333) helps to interpret that the prediction variable and the group variables had a strong relationship. Moreover, 23% to 33% variation in FS was explained by the grouping variables (Cox and Snell R2 = 0.237 and Nagelkerke's R2 = 0.333). The significant value of Wald test results for each variable confirmed that the grouping variables (poor governance P = 0.004, militancy P = 0.000, social stratification P = 0.021 and poverty P = 0.000) significantly predicted FS at the household level. Mathematically, all the statistics were validated further through the application of spherical fuzzy mathematics (TOPIS and MADM) to explore what factors are affecting household FS. Thus, the study found that F3 (poverty) > F2 (militancy) > F4 (social stratification) > F1 (poor governance) respectively. Thus, it could be concluded from these findings that the prevalence of poverty dysfunctional all the channels of household FS at the macro and micro levels. Therefore, a sound and workable model to eradicate poverty in the study area by

关键词： Food supply

来源：评论

学校读者我要写书评

暂无评论

ROAR: A Benchmark for NFT Rarity Meters 6

ROAR: A Benchmark for NFT Rarity Meters

引用

6th IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2024

作者： Belousov, Dmitry Shuklin, Maksim Stepin, Alexander Yanovich, Yury Moscow Institute of Physics and Technology Phystech School of Applied Mathematics and Informatics Moscow Russia Hse University Faculty of Computer Science Moscow Russia Skolkovo Institute of Science and Technology Wireless Center Moscow Russia

ISBN: (纸本)9798350316742

Rarity meters are incorporated by industry and discursive by academia. Rarity, as an intuitive term, attracted numerous researchers to present their own view of it. While there is existing literature on comparing rarity meters, it requires access to NFT collection data, which can be challenging for researchers without a background in blockchain technology. This has created a demand for an easily accessible rarity meter benchmark. In this paper, we introduce the Rating over all Rarities (ROAR) benchmark, which includes data from one hundred popular NFT collections from the Ethereum blockchain, implemented a weighted correlation-based performance measurement function, as well as four state-of-the-art rarity meters (***, Kramer, OpenRarity, and NFTGo), along with a new rarity meter called ROAR. Our experiments show that the ROAR rarity meter, an ensemble of the other four meters, outperforms its competitors, with *** and Kramer as runner-ups. The ROAR benchmark is a tool for examination and testing of rarity meter ideas, and we challenge readers to develop models that can outperform the ROAR rarity meter. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Algebraic Properties for Molecular Structure of Magnesium Iodide

引用

computer Modeling in Engineering & Sciences 2023年第5期135卷 1131-1146页

作者： Ali N.A.Koam Ali Ahmad Muhammad Azeem Muhammad Kamran Siddiqui Department of Mathematics College of ScienceNew CampusJazan UniversityJazanSaudi Arabia College of Computer Science and Information Technology Jazan UniversityJazanSaudi Arabia Department of Mathematics Riphah Institute of Computing and Applied SciencesRiphah International UniversityLahorePakistan Department of Mathematics COMSATS University IslamabadLahorePakistan

As an inorganic chemical,magnesium iodide has a significant crystalline *** is a complex and multifunctional substance that has the potential to be used in a wide range of medical *** graph theory,on the other hand,provides a sufficient and cost-effective method of investigating chemical structures and networks.M-polynomial is a relatively new method for studying chemical networks and structures in molecular graph *** displays numerical descriptors in algebraic form and highlights molecular features in the form of a polynomial *** present a polynomials display of magnesium iodide structure and calculate several M-polynomials in this paper,particularly the M-polynomials of the augmented Zagreb index,inverse sum index,hyper Zagreb index and for the symmetric division index.

关键词： Magnesium iodide M-polynomials algebraic properties of magnesium iodide algebraic formation of numerics of magnesium iodide

来源：评论

学校读者我要写书评

暂无评论

HS–WOA–MANET: a hybrid meta-heuristic approach-based multi-objective constraints for energy efficient routing protocol in mobile ad hoc networks

引用

Journal of Reliable Intelligent Environments 2024年第2期10卷 151-176页

作者： Goswami, Subhrananda Mondal, Sukumar Johardar, Subhankar Das, Chandan Bikash Research Centre of Natural and Applied Sciences Department of Computer Science Raja Narendra Lal Khan Women’s College Affiliated to Vidyasagar University Midnapore India Department of Mathematics Raja Narendra Lal Khan Women’s College Midnapore India Department of Computer Science Haldia Institute of Technology Haldia India Department of Mathematics Tamralipta Mahavidyalaya Tamluk India

A self-organizing, reconfigurable, and structure-less wireless network that provides intended communications without any radio infrastructure is called the mobile ad hoc network (MANETs). It is generally utilized in special outside occasions, locations, military surgeries, and natural disasters. In MANET, providing security is the primary issue because of the adoption of network structures. Moreover, the modifications in dynamic topologies expose the strike selection, such as routing, eavesdropping, and alteration of several programs. If MANET has several privacy and security issues, then it may surpass the quality of services (QoS). Hence, the security in MANET is guaranteed by using intrusion tracking approaches. This intrusion tracking system regulates the MANET in recognizing some other violation weaknesses. High protections are provided by detecting intrusions from the entire network, which includes attacks that are beyond the network layer. The nodes are not merely altered by the power collapse in the system, but it is also capable of transferring the packets in the network, which depends on the total system life. An effective routing protocol is designed to select the optimal paths for enhancing navigation in MANETs. Moreover, the terms secure routing and energy efficiency are critical problems when changing the network topology and limiting resources with this kind of network. A hybridized optimization-aided routing strategy is offered in this research work to provide an energy-efficient routing protocol. At the initial stage, the experimentation is conducted based on the sensor nodes in MANET. Since the existing models are ineffective in achieving high energy efficiency, the new routing protocol is developed by proposing the hybrid optimization algorithm. Accordingly, the suggested work is regarded for optimizing the shortest path in the routing model by using the Hybrid Sailfish Optimizer and Whale Optimization Algorithm (HS-WOA). To validate the network e

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

mLBOA:A Modified Butterfly Optimization Algorithm with Lagrange Interpolation for Global Optimization

引用

Journal of Bionic Engineering 2022年第4期19卷 1161-1176页

作者： Sushmita Sharma Sanjoy Chakraborty Apu Kumar Saha Sukanta Nama Saroj Kumar Sahoo Department of Mathematics National Institute of Technology AgartalaAgartalaTripura 799046India Department of Computer Science and Engineering Iswar Chandra Vidyasagar CollegeBeloniaTripura 799155India Department of Computer Science and Engineering National Institute of Technology AgartalaAgartalaTripura 799046India Department of Applied Mathematics Maharaja Bir Bikram UniversityAgartalaTripura 799004India

Though the Butterfly Bptimization Algorithm(BOA)has already proved its effectiveness as a robust optimization algorithm,it has certain ***,a new variant of BOA,namely mLBOA,is proposed here to improve its *** proposed algorithm employs a self-adaptive parameter setting,Lagrange interpolation formula,and a new local search strategy embedded with Levy flight search to enhance its searching ability to make a better trade-off between exploration and ***,the fragrance generation scheme of BOA is modified,which leads for exploring the domain effectively for better *** evaluate the performance,it has been applied to solve the IEEE CEC 2017 benchmark *** results have been compared to that of six state-of-the-art algorithms and five BOA ***,various statistical tests,such as the Friedman rank test,Wilcoxon rank test,convergence analysis,and complexity analysis,have been conducted to justify the rank,significance,and complexity of the proposed ***,the mLBOA has been applied to solve three real-world engineering design *** all the analyses,it has been found that the proposed mLBOA is a competitive algorithm compared to other popular state-of-the-art algorithms and BOA variants.

关键词： Butterfly optimization algorithm Lagrange interpolation Levy flight search IEEE CEC 2017 functions Engineering design problems

来源：评论

学校读者我要写书评

暂无评论

On the Uncrossed Number of Graphs 32

On the Uncrossed Number of Graphs

引用

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

作者： Balko, Martin Hliněný, Petr Masařík, Tomáš Orthaber, Joachim Vogtenhuber, Birgit Wagner, Mirko H. Department of Applied Mathematics Faculty of Mathematics and Physics Charles University Prague Czech Republic Faculty of Informatics Masaryk University Brno Czech Republic Institute of Informatics Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Institute of Software Technology Graz University of Technology Austria Institute of Computer Science Osnabrück University Germany

ISBN: (纸本)9783959773430

Visualizing a graph G in the plane nicely, for example, without crossings, is unfortunately not always possible. To address this problem, Masařík and Hliněný [GD 2023] recently asked for each edge of G to be drawn without crossings while allowing multiple different drawings of G. More formally, a collection D of drawings of G is uncrossed if, for each edge e of G, there is a drawing in D such that e is uncrossed. The uncrossed number unc(G) of G is then the minimum number of drawings in some uncrossed collection of G. No exact values of the uncrossed numbers have been determined yet, not even for simple graph classes. In this paper, we provide the exact values for uncrossed numbers of complete and complete bipartite graphs, partly confirming and partly refuting a conjecture posed by Hliněný and Masařík [GD 2023]. We also present a strong general lower bound on unc(G) in terms of the number of vertices and edges of G. Moreover, we prove NP-hardness of the related problem of determining the edge crossing number of a graph G, which is the smallest number of edges of G taken over all drawings of G that participate in a crossing. This problem was posed as open by Schaefer in his book [Crossing Numbers of Graphs 2018]. © Martin Balko, Petr Hliněný, Tomáš Masařík, Joachim Orthaber, Birgit Vogtenhuber, and Mirko H. Wagner.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

An Efficient Solution for the Collusion Problem of DECO 17

An Efficient Solution for the Collusion Problem of DECO

引用

17th International Conference on Information Security and Cryptology, ISCTurkiye 2024

作者： Sen, Ugur Osmanoglu, Murat Selcuk, Ali Aydin Institute of Applied Mathematics Middle East Technical University Ankara Turkey Department of Computer Engineering Ankara University Ankara Turkey Department of Computer Engineering TOBB University of Economics and Technology Ankara Turkey

ISBN: (纸本)9798331533649

DECO is one of the state-of-The-Art TLS evidence protocols that enables privacy-preserving verification without necessitating server-side modifications. It allows applications to extract verifiable data from websites. However, DECO is vulnerable to collusion attacks, where the prover and verifier may secretly conspire, even if DECO itself remains secure. This vulnerability limits DECO's ability to transfer data to smart contracts. To address the collusion issue, decentralized oracle networks have been integrated with DECO, involving multiple executions for the same attestation and relying on majority consensus to determine the correct outcome. While this approach mitigates collusion risk, it is inefficient. In this paper, we address the collusion vulnerability in DECO by proposing an enhanced approach that expands the verifier's role to a set of n verifiers within a single DECO execution, utilizing a Distributed Verifiable Random Function (DVRF). This method requires the prover to obtain consensus from all n verifiers, thereby increasing the difficulty of collusion and enhancing the security of the system. Furthermore, the proposed solution is more efficient than executing n separate DECO protocols and provides verifiable features that facilitate integration with slashing and reward mechanisms, thereby improving its applicability in decentralized systems. © 2024 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Polish-ASTE: Aspect-Sentiment Triplet Extraction Datasets for Polish 30

Polish-ASTE: Aspect-Sentiment Triplet Extraction Datasets fo...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Lango, Marta Naglik, Borys Lango, Mateusz Naglik, Iwo Poznan University of Technology Faculty of Computing and Telecommunications Poland Adam Mickiewicz University Faculty of Mathematics and Computer Science Poland Charles University Faculty of Mathematics and Physics Institute of Formal and Applied Linguistics Czech Republic

ISBN: (纸本)9782493814104

Aspect-Sentiment Triplet Extraction (ASTE) is one of the most challenging and complex tasks in sentiment analysis. It concerns the construction of triplets that contain an aspect, its associated sentiment polarity, and an opinion phrase that serves as a rationale for the assigned polarity. Despite the growing popularity of the task and the many machine learning methods being proposed to address it, the number of datasets for ASTE is very limited. In particular, no dataset is available for any of the Slavic languages. In this paper, we present two new datasets for ASTE containing customer opinions about hotels and purchased products expressed in Polish. We also perform experiments with two ASTE techniques combined with two large language models for Polish to investigate their performance and the difficulty of the assembled datasets. The new datasets are available under a permissive licence and have the same file format as the English datasets, facilitating their use in future research. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Inter-Stream Dependencies in Time-Sensitive Networking 28

Inter-Stream Dependencies in Time-Sensitive Networking

引用

28th Conference on Innovation in Clouds, Internet and Networks, ICIN 2025

作者： Chahed, Hamza Yarvis, Mark Frick, Florian Kassler, Andreas Intel Deutschland GmbH Germany Intel Corporation United States Department of Mathematics and Computer Science Karlstad University Karlstad Sweden Institute for Control Technology of Machine Tools and Manufacturing Equipment University of Stuttgart Germany Faculty of Applied Computer Science Deggendorf Institute of Technology Deggendorf Germany

ISBN: (纸本)9798331542399

Effective configuration of Time-Sensitive Networks is crucial for providing timeliness and reliability guarantees for real-time industrial applications, where many inter-dependent streams may co-exist. However, existing methods for specifying the characteristics of real-time streams to the Centralized Network Configuration element (CNC) do not allow the specification of stream dependencies. Consequently, the CNC may schedule the real-time streams in a sub-optimal way, leading to low number of real-time applications supported. To address this pressing issue, we present methods that allow to model and express such inter-stream dependencies and propose extensions to the user network interface (UNI) to convey these dependencies to the CNC, transforming it into an intent-based UNI. We define a novel metric to evaluate a specific network configuration regarding the latency budget available for scheduling the transmission of a stream. Using a set of numerical simulations, we show that when exploiting the knowledge of inter-stream dependencies, we can derive better network schedules, which results in significant increase in applications onboarding up to 2.2x and increased network utilization for real-time streams up to 3x. © 2025 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of a new fractal compression method for medical images based on fixed partition

引用

International Journal of Information technology (Singapore) 2022年第1期14卷 411-419页

作者： Biswas, Amit Kumar Karmakar, Sanjeev Sharma, Sanjay Department of Computer Applications Bhilai Institute of Technology Chhattisgarh Durg India Department of Applied Mathematics Bhilai Institute of Technology Chhattisgarh Durg India

Applications of image compression have been gaining importance over the years in medical fields. The medical imaging modalities produced a large amount of information on all levels of hospital care. This information, in the form of images, needs to be stored for future references. While compressing the medical images, it is necessary to maintain high diagnostic quality with a high compression rate. Several image compression approaches have been developed towards the direction of the storage space problem in such a way that the doctors accurately and reliably diagnose the patient’s diseases from the reconstructed image after decompression. A high compression ratio is required to reduce the storage space due to the large size of medical images. Fractal image compression is a lossy technique to compress the image in a coded form instead of pixels and is differentiated by its long encoding time with a high compression ratio, resolution-independent, fast decoding, and self-similarity. The main purpose of this paper is to present a comparative performance study of the three coding schemes of fractal compression for grayscale medical images based on fixed partition. The first two coding schemes are based on the pixel-pattern measure and the third scheme is a proposed method based on the fractal dimension for complexity measure of range and domain blocks. The comparative study included encoding time, peak signal to noise ratio, and compression ratio, as a result, has been accomplished. © 2021, Bharati Vidyapeeth's institute of computer Applications and Management.

关键词： Fractal dimension Fractal image compression Image enhancement Pixel-peak Quadtree-partition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：