Downloads & Free Reading Options - Results

No Description

Algorithms aren’t neutral. They can be full of bias, misunderstanding and human prejudice. So, can we trust them?

Algorithms aren’t neutral. They can be full of bias, misunderstanding and human prejudice. So, can we trust them?

The use of support vector regression (SVR) for regression tasks has been on increase over the past few years. Unfortunately, the practical application of SVR for regression task is limited due to its dependence on proper setting of its hyper-parameters and associated kernel parameter. Therefore, it become imperative to device a reliable and fast mechanism of determining the value of these parameters that could guarantee lowest generalization error. This paper presents SVR parameter optimization approaches using African buffalo optimisation (ABO) algorithm, i.e. SVR-ABO. The SVR parameters are optimized by using African buffalo optimisation algorithm. Results obtained from several experiments performed has shown that the proposed ABO algorithm has the capability of determining SVR hyper-parameters which most of time has to be done through estimation.

This Paper presents the method for controlling the congestion by modifying DB routing algorithm is presented. MDB (Modified Depth wise, breadth wise) routing algorithm an implementation of AntNet is an agent based routing algorithm that is influenced from individual behavior of the ants in ant colony optimization. Ant Net. algorithm does not take into account of the effect of increasing the total numbers of routing packets (ants) moving inside the network which may lead to congestion problem. This could eventually have a negative impact on the overall network performance. Moreover, AntNet concentrates only on the problem of routing not load balancing as AntNet philosophy can lead to network congestion and create bottlenecks. The main objective of this work is modifying the DBrouting algorithm to address its above mentioned drawbacks. This work measures the effect of increasing the number of ants on the average packet delay and network throughput; and modifying, accordingly, the ants’ generation rate. Also we introduced a modified MDB routing load- aware algorithm that improves DB routing in order to support load balancing.

Ambiguous Multi-Symmetric Cryptography (AMSC) that hide multiple plain-texts in a cipher-text using the same number of keys. The goal of this method is to overcome the problem of symmetric cryptography failure when the shared key is exposed. The proposed method AMSC is a cryptographic primitive that preserves plausible deniability after a cryptographic key is discovered. We evaluate AMSC in terms of security and complexity. The security analysis shows that our scheme withstands all security attack models with different knowledge of the adversary. In terms of time complexity, AMSC produces the cipher-text in polynomial time with respect to the number and size of the plaintexts and keys. AMSC has two main applications: a) It sends multiple messages for multiple receivers through one cipher-text. b) It sends one real message and multiple decoys to defeat attacks by providing security beyond conventional brute-force bounds. For both applications, AMSC can be used to deny encryption. Tushar Anil Patil | Prof. Dr. Mrs. K. V. Kulhalli"Symmetric Key Cryptography Algorithm for Data Security" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-2 , February 2018, URL: http://www.ijtsrd.com/papers/ijtsrd9444.pdf Article URL: http://www.ijtsrd.com/engineering/electronics-and-communication-engineering/9444/symmetric-key-cryptography-algorithm-for-data-security/tushar-anil-patil

This research presents a modification of the horned lizard optimization (HLO) algorithm to optimize proportional integral derivative (PID) parameters in direct current (DC) motor control. This hybrid method is called horned lizard optimization algorithm-aquila optimizer (HLAO). The HLO algorithm models various escape tactics, including blood spraying, skin lightening or darkening, crypsis, and cellular defense systems, using mathematical techniques. HLO enhancement by modifying additional functions of aquila optimizer improves HLO performance. This research validates the performance of HLAO using performance tests on the CEC2017 benchmark function and DC motors. From the CEC2017 benchmark function simulation, it is known that HLAO's performance has promising capabilities. By simulating using 3 types of benchmark functions, HLOA has the best value. Tests on DC motors showed that the HLAO-PID method had the best integrated of time-weighted squared error (ITSE) value. The ITSE value of HLOA is 89.25 and 5.7143% better than PID and HLO PID.

Introduction: Population aging is occurring in nearly all countries, with adults aged 80 and older representing the fastest-growing segment. Millions of older adults will stop or limit their driving after a lifetime of relying on it for independence and mobility. Driving cessation in older adults is linked to increased depressive symptoms, reduced physical functioning, and diminished social health. Anticipating driving cessation will be increasingly important as our population ages. Existing algorithms are not often operationalized in a way that enables older adults to use on their own because they require inputs from clinical tests. Methods and analysis: The objective of this study is to develop and validate algorithms with and without clinical measures to predict the risk of driving cessation in 6 years in adults aged 65 years and older. The study cohort will be derived using both the Comprehensive and Tracking cohorts in the Canadian Longitudinal Study on Aging (CLSA) among adults aged 65 years and older and driving at baseline (2010–2015; 11,762 drivers). Cases will be identified based on the incidence of driving cessation at 6 years following baseline measurement (2018–2021; 948 individuals stopped driving). Prespecified predictors include sociodemographic, self-reported health, functional and health condition variables. The base model will use self-reported information only, while the extended model will include additional clinical measures. Expected outcomes include validated multivariable models with measures of calibration and discrimination to assess predictive performance. The better performing algorithm will be used to support early identification of individuals at risk of driving cessation, enabling timely interventions and planning to maintain independence and mobility. This study protocol and the reporting of model estimation results will be guided by the Transparent Reporting of a Multivariable Prediction Model for Individual Prognosis or Diagnosis (TRIPOD) statements.

Video content can be found here: https://www.youtube.com/channel/UC0BAd8tPlDqFvDYBemHcQPQ/

Study summarizing levitation control strategies using a single magnet levitation system as the object and a non-linear numerical model of a vehicle-guideway coupling system. 

The Algorithm Design Manual Solution Wiki dumped with wikiteam3 tools.

A predictive model for urban vehicular congestion using Dijkstra's Algorithm - MATLAB Source Code

Algorithms aren’t neutral. They can be full of bias, misunderstanding and human prejudice. So, can we trust them?

Algorithms aren’t neutral. They can be full of bias, misunderstanding and human prejudice. So, can we trust them?

Algorithms aren’t neutral. They can be full of bias, misunderstanding and human prejudice. So, can we trust them?

Thesis advisors, Kevin B. Smith and Ching-Sang Chiu

A Message Authentication Code (MAC) is a key-dependent one way hash function. One popular way to construct a MAC algorithm is to use a block cipher in conjunction with the Cipher-Block-Chaining (CBC) mode of operation. The classic CBC-MAC algorithm, while secure for messages of a pre-selected fixed length, has been shown to be insecure across messages of varying lengths such as the type found in typical IP datagrams. This memo specifies the use of AES in CBC mode with a set of extensions to overcome this limitation. This new algorithm is named AES-XCBC-MAC-96. [STANDARDS-TRACK]

Spurious retransmission timeouts cause suboptimal TCP performance because they often result in unnecessary retransmission of the last window of data. This document describes the F-RTO detection algorithm for detecting spurious TCP retransmission timeouts. F-RTO is a TCP sender-only algorithm that does not require any TCP options to operate. After retransmitting the first unacknowledged segment triggered by a timeout, the F-RTO algorithm of the TCP sender monitors the incoming acknowledgments to determine whether the timeout was spurious. It then decides whether to send new segments or retransmit unacknowledged segments. The algorithm effectively helps to avoid additional unnecessary retransmissions and thereby improves TCP performance in the case of a spurious timeout. The F-RTO algorithm can also be applied to the Stream Control Transmission Protocol (SCTP). This memo defines an Experimental Protocol for the Internet community.

Are biometrics protecting or seriously compromising our privacy?

Design is forcing us all to be complicit in what’s called ‘the biggest lie on the internet'.

Design is forcing us all to be complicit in what’s called ‘the biggest lie on the internet'.

In order to meet the needs of process inspection technology for industrial equipment, image recognition technology based on deep learning has shown great potential in the field of welding defects. In this paper, an improved YOLOv8 algorithm is proposed to improve the welding defect identification ability of the workpiece. Through experimental verification on selected data sets in kaggle, this study evaluates the detection performance of YOLOv8 improved algorithm that integrates SCConv in C2f module at Backbone level. The experimental results show that the improved YOLOv8 has improved the accuracy of welding defect detection compared with the traditional version, and has certain application potential.

Tri 2 2016/2017

Trimester 2 2019/2020

The IPsec series of protocols makes use of various cryptographic algorithms in order to provide security services. The Encapsulating Security Payload (ESP) and the Authentication Header (AH) provide two mechanisms for protecting data being sent over an IPsec Security Association (SA). To ensure interoperability between disparate implementations, it is necessary to specify a set of mandatory-to-implement algorithms to ensure that there is at least one algorithm that all implementations will have available. This document defines the current set of mandatory-to-implement algorithms for ESP and AH as well as specifying algorithms that should be implemented because they may be promoted to mandatory at some future time. [STANDARDS-TRACK]

Data-empires: Is Big Tech colonising the internet?

In present years, the increasing use of power electronic based nonlinear devices in various power system applications causes harmonic distortions in source side voltages and currents. The unwanted harmonic distortion can introduce detrimental effects on electrical equipment and temperature increases in neutral conductors and distribution transformers. In this paper, a new optimization method of Meta-heuristic firefly algorithm is proposed for the optimal design of passive harmonic filters to mitigate the harmonics existing in the power system environment. The performance of the proposed firefly algorithm based passive filter evidences better result compared with the other algorithm based methods.

An algorithm for generating a structural syntactic surrogate of English text is defined in this paper. The "performance" of the surrogate is judged empirically according to adherence to the following criteria: (1) The surrogate is an organized representation of natural language text; (2) The algorithm which produces the surrogate is equally applicable to any English text; (3) The surrogate may be derived solely by computer processing; (4) The major concepts (or themes) of the text are clearly discernable and/or mechanically derivable from the surrogate; (5) The document may be derived from the surrogate; and (6) The surrogate is feasible to implement. That is, it is not inordinately expensive in computer processing time nor storage, and does not rely upon human processing, preprocessing or interpretation. Possible applications and derivations of the surrogate are explored and discussed. (Author/NH)

In this work, Harmony Search Meta-Heuristic Optimization Algorithm has been developed for aerodynamic shape optimization problem for the first time. The aerodynamic shape, which has been investigated, is an airfoil with Parces method for its shape parameterization. The problem was minimization of aerodynamic objective function using inverse design method and the objective function has been the deviation of pressure distribution between investigated airfoil and the target airfoil. The 2-Dimensional compressible Navier-Stokes equations have been considered for simulation of flow using Spalart-Almaras turbulence model. A global improvement has been carried out to enhance the efficiency of Harmony Search Algorithm. In improved Harmony Search Algorithm one obtains the optimum design values and target airfoil by changing the airfoil shape design variables. To do this, algorithm starts from NACA0012 airfoil and reconstructs the target airfoil (RAE2822) by making pressure distribution closer to the target airfoil pressure distribution. For more accurate investigation and to make sure about the accuracy of algorithm, this optimization process has also been done in inverse direction. It means that, NACA0012 airfoil has been reconstructed starting from RAE2822 airfoil. The obtained results show that the utilization of Harmony Search Algorithm allows us to obtain an efficient and powerful tool for Aerodynamic Shape Optimization.

A novel metaheuristic optimization algorithm based on cuckoo search algorithm (CSA) is presented to solve the construction site layout planning problem (CSLP). CSLP is a complex optimization problem with various applications, such as plant layout, construction site layout, and computer chip layout. Many researchers have investigated the CSLP by applying many algorithms in an exact or heuristic approach. Although both methods yield a promising result, technically, nature-inspired algorithms demonstrate high achievement in successful percentage. In the last two decades, researchers have been developing a new nature-inspired algorithm for solving different types of optimization problems. The CSA has gained popularity in resolving large and complex issues with promising results compared with other nature-inspired algorithms. However, for solving CSLP, the algorithm based on CSA is still minor. Thus, this study proposed CSA with additional modification in the algorithm mechanism, where the algorithm shows a promising result and can solve CSLP cases.

"June 1999"

Effective harmonic current identification is critical for shunt active power filters (SAPF) to provide accurate and sufficient compensation. This study proposes a modified synchronous reference frame fundamental (MSRFF) method for harmonic extraction in three-phase, three-wire systems. A band pass filter (BPF) was designed by combining low-pass and high-pass filters in the direct-quadrature (d-q) reference frame to improve filtering performance. Unlike traditional methods using phase-locked loops (PLL), this approach employs unit vector templates for synchronization and relies on direct current measurements from load currents. The band pass filter, with low cutoff frequencies, effectively isolates harmonic components in heavily contaminated systems, outperforming other filtering methods. System performance was evaluated using matrix laboratory (MATLAB) simulations, where total harmonic distortion (THD) values were reduced to 2.19% with a low pass filter, 0.99% with a conventional band pass filter, and 0.98% with the combined filter approach. The results demonstrate that the proposed strategy can accurately track and estimate harmonic signals, offering a robust solution for shunt active power filter applications.

This report discusses an adaptive algorithm for optimizing the gain of an antenna array on an incoming signal. The algorithm is based on a steepest-ascent maximization of the array output power, subject to a constraint on the array weights. This algorithm is under investigation for use in conjunction with a power inversion adaptive array, a modified version of the LMS adaptive array. A power inversion adaptive array can provide significant protection from interference in a spread spectrum communication system, but it does not provide any form of beam tracking on the desired signal. Beam tracking can be obtained, however, by first arraying antenna elements in pairs with power inversion feedback, and then combining the element-pair outputs with the gain optimizing algorithm described here. This report discusses only the gain optimizing algorithm. An algorithm for optimizing the gain of an adaptive antenna system is discussed in this report. The gain optimization is accomplished by a constrained gradient-search technique. The algorithm is presented and some simple examples showing how the gain is optimized in a two-element array are given. The convergence and stability of the algorithm are also discussed.

In this paper a novel and automatic method for classification of breast malignancy in digital mammogram images is proposed. It is based on two features named as Normalized mean radial distance as F [email protected],[email protected] 1 and number of crossing point between fitting circle and tumor for the circle as F2. The roughness of the breast tumor out-layer is measured in terms of normalized mean radial distance. The fitting circle is obtained by considering the centroid of tumor as its centre and arithmetic mean of maximum and minimum radial distances of contour points from the centroid, as its radius. The similarity between tumor and its circle is measured in terms of number of crossing points between tumor contour and circle for the tumor contour. The simulation results show that for a set of 150 tumor contours, the proposed method gives 92.67% accuracy for F1 and 94.667% accuracy for F2. The performance obtained in terms of the receiver operating characteristic (ROC) parameters like accuracy (Ac), sensitivity (Se), specificity (Sp and positive (PPV) and negative predictive values (NPV) for F1 and F2 as(0.92667,0.9241,0.9296,0.9359,0.9167),(0.94667,0.9873,0.9014,0.9176,0.9846) respectively.

Magnetic levitation is an electromechanical technique that allows objects to float in air using magnetic fields alone. This technology eliminates physical contact, thereby reducing friction, wear, and energy loss while providing high-precision and stable operation. A key challenge in maglev systems lies in their inherent instability and nonlinearity, which complicate control design. In this study, a hollow metal sphere is levitated as part of a real-time experimental setup, which requires a fine balance between gravitational and magnetic forces.

Several clients with kidney cancer are able to receive curative treatment because there is nowadays no way to detect the cancer in its initial stages. To decrease the likelihood of kidney tumour cells and the need for transplant, it is important to be able to predict kidney cancer at an early stage so that service users can begin appropriate therapy and treatment. Thanks to advancements in AI, automated cancer diagnostic tools have been developed. These degree of excellence many unique deep learning and machine learning algorithms. Extracting intelligent and predictive models from large datasets is possible through the use of data mining. Data mining is the practise of gaining insight from massive datasets. It fuses time-honoured techniques to analyse data with cutting-edge mathematical advances to handle massive datasets. Concepts from several other fields are incorporated into it as well, making it a multidisciplinary field. These fields include database frameworks, measurements, AI, the figuring data hypothesis, and example recognition. Using a combination of the decision tree algorithm and the naive Bayes data mining technique, the proposed model was able to successfully identify cases of kidney cancer in this study

Ranking algorithms based on link structure of the network are well-known methods in web search engines to improve the quality of the searches. The most famous ones are PageRank and HITS. PageRank uses probability of random surfers to visit a page as the score of that page, and HITS instead of produces one score, proposes using two scores, authority and hub scores, where the authority scores describe the degree of popularity of pages and hub scores describe the quality of hyperlinks on pages. In this paper, we show the differences between WWW network and trading network, and use these differences to create a ranking algorithm for trading networks. We test our proposed method with international trading data from United Nations. The similarity measures between vectors of proposed algorithm and vector of standard measure give promising results.

In this paper a hybrid algorithm based on genetic algorithm (GA) and Nelder–Mead (NM) simplex search method is combined with least squares method for the determination of temperature in some nonlinear inverse parabolic problems (NIPP). The performance of hybrid algorithm is established with some examples of NIPP. Results show that hybrid algorithm is better than GA and NM separately. Numerical results are obtained by implementation expressed algorithms on 2.20GHz clock speed CPU.

A new digital Gaussian pulse shaping algorithm based on bilinear transformation 作者： GE Qing 1 GE Liang-Quan 1 YUAN Hong-Wen 2 LI Ao-Mei 2 作者单位： 1. The College of Nuclear Technology and Automation Engineering, Chendu University of Technology, Chengdu 610059, China 2. Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031, China 提交时间： 2023-06-18 摘要: Nuclear pulse signal needs to be transformed to a suitable pulse shape to remove noise and improve energy resolution of a nuclear spectrometry system. In this paper, a new digital Gaussian shaping method is proposed. According to Sallen-Key analog Gaussian shaping filter circuits, the system function of Sallen-Key analog Gaussian shaping filter is deduced on the basis of Kirchhoff laws. The system function of the digital Gaussian shaping filter based on bilinear transformation is deduced too. The expression of unit impulse response of the digital Gaussian shaping filter is obtained by inverse z-transform. The response of digital Gaussian shaping filter is deduced from convolution sum of the unit impulse response and the digital nuclear pulse signal. The simulation and experimental results show that the digital nuclear pulse has been transformed to a pulse with a pseudo-Gaussian, which confirms the feasibility of the new digital Gaussian pulse shaping algorithm based on bilinear transformation. Digital shaping Bilinear transformation Convolution sum 期刊： Nuclear Science and Techniques 分类： 核科学技术 >> 核探测技术与核电子学 投稿状态： 已在期刊出版 引用： ChinaXiv:202306.00327 (或此版本 ChinaXiv:202306.00327V1 ) DOI:dx.doi.org/10.13538/j.1001-8042/nst.26.010402 CSTR:32003.36.ChinaXiv.202306.00327.V1 推荐引用方式： GE Qing,GE Liang-Quan,YUAN Hong-Wen,LI Ao-Mei.(2023).A new digital Gaussian pulse shaping algorithm based on bilinear transformation.Nuclear Science and Techniques.doi:dx.doi.org/10.13538/j.1001-8042/nst.26.010402 版本历史 [V1] 2023-06-18 18:11:05 ChinaXiv:202306.00327V1 下载全文

A new digital Gaussian pulse shaping algorithm based on bilinear transformation 作者： GE Qing 1 GE Liang-Quan 1 YUAN Hong-Wen 2 LI Ao-Mei 2 作者单位： 1. The College of Nuclear Technology and Automation Engineering, Chendu University of Technology, Chengdu 610059, China 2. Institute of Plasma Physics, Chinese Academy of Sciences, Hefei 230031, China 提交时间： 2023-06-18 摘要: Nuclear pulse signal needs to be transformed to a suitable pulse shape to remove noise and improve energy resolution of a nuclear spectrometry system. In this paper, a new digital Gaussian shaping method is proposed. According to Sallen-Key analog Gaussian shaping filter circuits, the system function of Sallen-Key analog Gaussian shaping filter is deduced on the basis of Kirchhoff laws. The system function of the digital Gaussian shaping filter based on bilinear transformation is deduced too. The expression of unit impulse response of the digital Gaussian shaping filter is obtained by inverse z-transform. The response of digital Gaussian shaping filter is deduced from convolution sum of the unit impulse response and the digital nuclear pulse signal. The simulation and experimental results show that the digital nuclear pulse has been transformed to a pulse with a pseudo-Gaussian, which confirms the feasibility of the new digital Gaussian pulse shaping algorithm based on bilinear transformation. Digital shaping Bilinear transformation Convolution sum 期刊： Nuclear Science and Techniques 分类： 核科学技术 >> 核探测技术与核电子学 投稿状态： 已在期刊出版 引用： ChinaXiv:202306.00327 (或此版本 ChinaXiv:202306.00327V1 ) DOI:dx.doi.org/10.13538/j.1001-8042/nst.26.010402 CSTR:32003.36.ChinaXiv.202306.00327.V1 推荐引用方式： GE Qing,GE Liang-Quan,YUAN Hong-Wen,LI Ao-Mei.(2023).A new digital Gaussian pulse shaping algorithm based on bilinear transformation.Nuclear Science and Techniques.doi:dx.doi.org/10.13538/j.1001-8042/nst.26.010402 版本历史 [V1] 2023-06-18 18:11:05 ChinaXiv:202306.00327V1 下载全文

We can find the simultaneous monitoring of thousands of genes in parallel Microarray technology. As per these measurements, microarray technology have proven powerful in gene expression profiling for discovering new types of diseases and for predicting the type of a disease. Gridding, Intensity extraction, Enhancement and Segmentation are important steps in microarray image analysis. This paper gives simple linear iterative clustering (SLIC) based self organizing maps (SOM) algorithm for segmentation of microarray image. The clusters of pixels which share similar features are called Superpixels, thus they can be used as mid-level units to decrease the computational cost in many vision applications. The proposed algorithm utilizes superpixels as clustering objects instead of pixels. The qualitative and quantitative analysis shows that the proposed method produces better segmentation quality than k-means, fuzzy c-means and self organizing maps clustering methods.

Resonance Algorithm: A New Look at the Shortest Path Problem 作者： Liu, Yu 1 Lin, Qiguang 2 Hong, Binbin 3 Hjerpe, Daniel 4 Liu, Xiaofeng 2,5 作者单位： 1. International Academic Center of Complex Systems, Beijing Normal University at Zhuhai, Zhuhai 519087, Guangdong, China. 2. College of IoT Engineering, Hohai University, Changzhou 213022, Jiangsu, China. 3. Institute of Microscale Optoelectronics, Shenzhen University, Shenzhen 518060, Guangdong, China. 4. Ericsson AB, Kista 16483, Sweden. 5. Jiangsu Key laboratory of Special Robotic Technologies, Changzhou 213022, Jiangsu, China. 通讯作者： Liu, Yu Email:[email protected] Liu, Xiaofeng 提交时间： 2021-10-11 摘要: The shortest path problem (SPP) is a classic problem and appears in a wide range of applications. Although a variety of algorithms already exist, new advances are still being made, mainly tuned for particular scenarios to have better performances. As a result, they become more and more technically complex and sophisticated. Here we developed a novel nature-inspired algorithm to compute all possible shortest paths between two nodes in a graph: Resonance Algorithm (RA), which is surprisingly simple and intuitive. Besides its simplicity, RA turns out to be much more time-efficient for large-scale graphs than the extended Dijkstra's algorithm (such that it gives all possible shortest paths). Moreover, RA can handle any undirected, directed, or mixed graphs, irrespective of loops, unweighted or positively-weighted edges, and can be implemented in a fully decentralized manner. These good properties ensure RA a wide range of applications. Abstract: " Dijkstra's algorithm Large-scale graph Nature-inspired algorithm Decentralized algorithm Fermat's principle 来自： 刘宇 分类： 数学 >> 应用数学 计算机科学 >> 计算机软件 信息科学与系统科学 >> 信息与系统科学其他学科 引用： ChinaXiv:202110.00056 (或此版本 ChinaXiv:202110.00056V1 ) doi:10.12074/202110.00056 CSTR:32003.36.ChinaXiv.202110.00056.V1 推荐引用方式： Liu, Yu,Lin, Qiguang,Hong, Binbin,Hjerpe, Daniel,Liu, Xiaofeng.(2021).Resonance Algorithm: A New Look at the Shortest Path Problem.中国科学院科技论文预发布平台.[ChinaXiv:202110.00056] 版本历史 [V1] 2021-10-11 19:03:48 ChinaXiv:202110.00056V1 下载全文

This study probed children's reasoning about both correct and incorrect but plausible statements of hypothetical children concerning the concepts of subtraction, with the intention of examining misconceptions in greater depth. Eight third graders, 14 fourth graders, and 14 fifth graders were interviewed individually to assess their understanding of regrouping in multidigit subtraction. The results illustrate the firmness of children's misconceptions about the regrouping procedure in particular and place value in general. (PK)

Health insurance fraud is a significant problem affecting insurance providers and policyholders. To address the rising problem of fraudulent activities in the health insurance sector, this paper proposes a pioneering blockchain-based system aimed at increasing transparency and security. Utilizing a hybrid Blockchain architecture, the system incorporates a consensus algorithm influenced by practical byzantine fault tolerance (PBFT) and proof of activity (PoA) to ensure reliability and efficiency in distributing mining power. Developed using Python, extensive testing confirms the system's performance and security metrics. Results show that a block size containing one transaction is 1.63 KB, with 1.2 KB for data and 0.43 KB for identification and hashing. Operational tests demonstrate that a single participant can upload 850 transactions to the transaction pool, with validation completed in just 7.49 seconds. Block appending time for these transactions is a swift 10 seconds. Notably, the system exhibits resilience against data tampering, detecting unauthorized changes within 881.3 milliseconds across 10,000 blocks and identifying irregularities in the transaction pool within 8.78 seconds. Additionally, to enhance data privacy, patient information is accessible only through a unique QR code, providing an extra layer of security; this research represents a significant advancement in combatting fraud and safeguarding data privacy.

Ubiquitous learning receives much attention in these few years due to its wide spectrum of applications, such as the T-learning application. The learner can use mobile devices to watch the digital TV based course content, and thus, the T-learning provides the ubiquitous learning environment. However, in real-world data broadcast environments, the mobile learners are unable to continuously watch a digital course for a long time, because the power of devices and the user patient constrain available learning time. In this paper, we design an optimal watching mode for data broadcast T-learning environment, such that the learner can retrieve as many distinct courses as possible within given time. We then optimize the watching mode by using the genetic algorithm in order to reduce the computation cost of the optimization. Our experimental results show that genetic optimization process indeed reduces the computation cost, and still lead to a near optimal watching mode. (Contains 4 tables and 11 figures.)

\{MODIS\} global evapotranspiration (ET) products by Mu et al. [Mu, Q., Heinsch, F. A., Zhao, M., Running, S. W. (2007). Development of a global evapotranspiration algorithm based on \{MODIS\} and global meteorology data. Remote Sensing of Environment, 111, 519–536. doi: 10.1016/j.rse.2007.04.015] are the first regular 1-km2 land surface \{ET\} dataset for the 109.03 Million km2 global vegetated land areas at an 8-day interval. In this study, we have further improved the \{ET\} algorithm in Mu et al. (2007a, hereafter called old algorithm) by 1) simplifying the calculation of vegetation cover fraction; 2) calculating \{ET\} as the sum of daytime and nighttime components; 3) adding soil heat flux calculation; 4) improving estimates of stomatal conductance, aerodynamic resistance and boundary layer resistance; 5) separating dry canopy surface from the wet; and 6) dividing soil surface into saturated wet surface and moist surface. We compared the improved algorithm with the old one both globally and locally at 46 eddy flux towers. The global annual total \{ET\} over the vegetated land surface is 62.8 × 103 km3, agrees very well with other reported estimates of 65.5 × 103 km3 over the terrestrial land surface, which is much higher than 45.8 × 103 km3 estimated with the old algorithm. For \{ET\} evaluation at eddy flux towers, the improved algorithm reduces mean absolute bias (MAE) of daily \{ET\} from 0.39 mm day−1 to 0.33 mm day−1 driven by tower meteorological data, and from 0.40 mm day−1 to 0.31 mm day−1 driven by \{GMAO\} data, a global meteorological reanalysis dataset. \{MAE\} values by the improved \{ET\} algorithm are 24.6% and 24.1% of the \{ET\} measured from towers, within the range (10–30%) of the reported uncertainties in \{ET\} measurements, implying an enhanced accuracy of the improved algorithm. Compared to the old algorithm, the improved algorithm increases the skill score with tower-driven \{ET\} estimates from 0.50 to 0.55, and from 0.46 to 0.53 with GMAO-driven ET. Based on these results, the improved \{ET\} algorithm has a better performance in generating global \{ET\} data products, providing critical information on global terrestrial water and energy cycles and environmental changes.

This paper presents the need to operate the power system economically and with optimum levels of voltages has further led to an increase in interest in Distributed Generation. In order to reduce the power losses and to improve the voltage in the distribution system, distributed generators (DGs) are connected to load bus. To reduce the total power losses in the system, the most important process is to identify the proper location for fixing and sizing of DGs. It presents a new methodology using a new population based meta heuristic approach namely Artificial Bee Colony algorithm(ABC) for the placement of Distributed Generators(DG) in the radial distribution systems to reduce the real power losses and to improve the voltage profile, voltage sag mitigation. The power loss reduction is important factor for utility companies because it is directly proportional to the company benefits in a competitive electricity market, while reaching the better power quality standards is too important as it has vital effect on customer orientation. In this paper an ABC algorithm is developed to gain these goals all together. In order to evaluate sag mitigation capability of the proposed algorithm, voltage in voltage sensitive buses is investigated. An existing 20KV network has been chosen as test network and results are compared with the proposed method in the radial distribution system.

science

ADA769816

Specular reflection removal algorithm for preprocessing of colposcopic and endoscopic images.