Search

With the development of computer technology, automatic test paper generation systems have gradually become an effective tool for detecting and maintaining national machine security and protecting the rights and interests of workers. This article achieved multi-level oral scores for different types of questions through online scoring using artificial neural networks in recent years. Based on its specific situation and evaluation index requirements, an analysis module that is reasonable, efficient, and in line with the hierarchical structure and module requirements of national conditions has been designed to complete the research on automatic test paper generation technology, in order to help better manage and allocate human resources and improve production efficiency. Afterwards, this article conducted functional testing on the technical module. The test results showed that the scalability of the system was over 82%. [ABSTRACT FROM AUTHOR]

Methods to rank documents in large-scale citation data are increasingly assessed in terms of their ability to identify small sets of expert-selected papers. Here, we propose an algorithm for the accurate identification of milestone papers from citation networks. The algorithm combines an influence propagation process with game theory concepts. It outperforms state-of-the-art metrics in the identification of milestone papers in aggregate citation network data, while potentially mitigating the ranking's temporal bias compared with metrics that have similar milestone identification performance. The proposed method sheds light on the interplay between ranking accuracy and temporal bias. • We transform citation networks into influence propagation networks by reversing the citation relationships. • We propose a novel diffusion-based metric for ranking papers, combining influence propagation and game theory. • Experiments on APS and DBLP datasets demonstrate the effectiveness of our metric in identifying milestone papers. [ABSTRACT FROM AUTHOR]

Differentiation/ranking of authors in the scientific sphere is carried out according to their influence on the particular field(s) of science. The impact of the contribution is measured by the impact a text has on the development of the field/issue. It can be measured by the usage of ideas from other researchers works given as citations. Nowadays, citations are tracked by specific algorithms and citation management systems that have access to various databases, catalogues and bibliography systems through metadata. In the presented article, I discuss problematic issues that authors are facing while writing texts in different languages (other than the English language) and publishing them in periodicals. The most popular (often indicative) texts/authors still fail to be captured/cached by the algorithms, therefore creating an imbalance between the actual number of citations performed by other scholars and cached h-index displayed by the algorithm. The paper discusses the causes of the problem and suggests solutions for both authors and publishers. [ABSTRACT FROM AUTHOR]

Highlights • We evaluate paper-level impact metrics on field bias, time bias, and ranking performance. • We evaluate mean-based, percentile-based, co-citation-based, and post hoc rescaling approaches to normalise citation scores. • Percentile-based citation scores are less field and time biased than mean-normalised citation counts. • No significant difference in ranking performance exists between percentile- and mean-normalised citation scores. • Citation counts are always less time biased but always more field biased than PageRank. Abstract We evaluate article-level metrics along two dimensions. Firstly, we analyse metrics' ranking bias in terms of fields and time. Secondly, we evaluate their performance based on test data that consists of (1) papers that have won high-impact awards and (2) papers that have won prizes for outstanding quality. We consider different citation impact indicators and indirect ranking algorithms in combination with various normalisation approaches (mean-based, percentile-based, co-citation-based, and post hoc rescaling). We execute all experiments on two publication databases which use different field categorisation schemes (author-chosen concept categories and categories based on papers' semantic information). In terms of bias, we find that citation counts are always less time biased but always more field biased compared to PageRank. Furthermore, rescaling paper scores by a constant number of similarly aged papers reduces time bias more effectively compared to normalising by calendar years. We also find that percentile citation scores are less field and time biased than mean-normalised citation counts. In terms of performance, we find that time-normalised metrics identify high-impact papers better shortly after their publication compared to their non-normalised variants. However, after 7 to 10 years, the non-normalised metrics perform better. A similar trend exists for the set of high-quality papers where these performance cross-over points occur after 5 to 10 years. Lastly, we also find that personalising PageRank with papers' citation counts reduces time bias but increases field bias. Similarly, using papers' associated journal impact factors to personalise PageRank increases its field bias. In terms of performance, PageRank should always be personalised with papers' citation counts and time-rescaled for citation windows smaller than 7 to 10 years. [ABSTRACT FROM AUTHOR]

Digital automation in reconstruction of apictorial hand torn paper document increases efficacy and reduces human effort. Reconstruction of torn document has importance in various fields like archaeology, art conservation and forensic sciences. The devised novel technique for hand torn paper document, consists of pre-processing, feature extraction and reconstruction phase. Torn fragment's boundaries are simplified as polygons using douglas peucker polyline simplification algorithm. Features such as Euclidean distance and number of sudden changes in contour orientation are extracted. Our matching criteria identify the matching counterparts. Proposed features curtail ambiguity and enriches efficacy in reconstruction. Reconstructed results of hand torn paper document favour the proposed methodology. [ABSTRACT FROM AUTHOR]

The 5G technology will become a truly integrated technology. It's becoming the most famous technology because of its optimal system computing complex and transforming a group of individual network components. Adequate resources must be provided for the various devices that are typically on the same network. The various functions in the data system also require resource allocation to suit its needs. This will ensure that the various devices on that network perform different types of work effectively. It also represents the various device functionalites to ensure the estimated resources onetime manner. Only then will it be convenient to carry out a variety of jobs depending on their speed and selection. And its various data requirements vary according to the functionality of the various devices featured in this series segment dynamic configuration. In this paper a smart resource utilization scheme was proposed. Its main purpose is to better manage the off-the-shelf resources available here. And provide it where it is needed and streamline data delivery to users on the network. This ensures that all data goes to the users in the correct manner. The proposed method getting 49% energy consumption, 90% resource utilization, 92% resource reservation and 91% Quality of services. [ABSTRACT FROM AUTHOR]

In the work presented in this paper, we analyse ranking algorithms that can be applied to bibliographic citation networks and rank academic entities such as papers and authors. We evaluate how well these algorithms identify important and high-impact entities. The ranking algorithms are computed on the Microsoft Academic Search (MAS) and the ACM digital library citation databases. The MAS database contains 40 million papers and over 260 million citations that span across multiple academic disciplines, while the ACM database contains 1.8 million papers from the computing literature and over 7 million citations. We evaluate the ranking algorithms by using a test data set of papers and authors that won renowned prizes at numerous computer science conferences. The results show that using citation counts is, in general, the best ranking metric to measure high-impact. However, for certain tasks, such as ranking important papers or identifying high-impact authors, algorithms based on PageRank perform better. [ABSTRACT FROM AUTHOR]

To improve the accuracy of defect detection in bank note sorting and decrease the effects of cracks and scratches of bank note on detecting, a new algorithm based on wavelet decomposition is proposed, in which affine transform and wavelet transform are applied to bank note image registration and the edge information is extracted by Kirsch operator, while the defect feature is extracted from edge intensity differential. The bank note image is divided into several fixed size subzones, in each of which the defect feature is calculated to judge the degree of contamination. The experimental results reveal that the proposed feature extraction method is robust to the gray intensity change in each subbone, and obtains high recognition rate and high stability. This method has already been used in practical bank note sorting system. [ABSTRACT FROM AUTHOR]

Abstract: There are a number of issues which are involved with organizing a conference. Among these issues, assigning conference-papers to reviewers is one of the most difficult tasks. Assigning conference-papers to reviewers is automatically the most crucial part. In this paper, we address this issue of paper-to-reviewer assignment, and we propose a method to model the reviewers, based on the matching degree between the reviewers and the papers by combining a preference-based approach and a topic-based approach. We explain the assignment algorithm and show the evaluation results in comparison with the Hungarian algorithm. [Copyright &y& Elsevier]

Abstract: The paper describes a system for executable papers for publishers enabling them to reuse content and to generate further advances of science and engineering. The executable algorithmic descriptions within a paper are presented in natural language sentences and basic code, thereby making long term compatibility absolute. Authors are required to use publicly numerical libraries on the Internet or references to publications with executable papers. As used by authors the system automatically creates a web of algorithmic knowledge on the Internet. Novelty of new algorithms in publications can be evaluated by automated tools available to authors, reviewers and readers of scientific papers published. [Copyright &y& Elsevier]

Abstract: This paper studies how missing data in the PageRank algorithm influences the result of papers ranking and proposes PrestigeRank algorithm on that basis. We make use of PrestigeRank to give the ranking of all papers in physics in the Chinese Scientific and Technology Papers and Citation Database (CSTPCD) published between 2004 and 2006. We compared PrestigeRank result with PageRank and citation ranking. We found PrestigeRank is significantly correlated with PageRank and citation counts. We also used paper citation networks to rank journals, and compared the result with that of journal citation networks. We proposed PR sum , PR ave , and compared both of them with citation counts and impact factor. It indicates PR sum , PR ave can reflect journal''s authority favorably. We also discuss the advantages and disadvantages, application scope and application prospects of PrestigeRank in the evaluation of papers and journals. [Copyright &y& Elsevier]

Technical terms are vital elements for understanding the techniques used in academic research papers, and in this paper, we use focused technical terms to explore technical trends in the research literature. The major purpose of this work is to understand the relationship between techniques and research topics to better explore technical trends. We define this new text mining issue and apply machine learning algorithms for solving this problem by (1) recognizing focused technical terms from research papers; (2) classifying these terms into predefined technology categories; (3) analyzing the evolution of technical trends. The dataset consists of 656 papers collected from well-known conferences on ACM. The experimental results indicate that our proposed methods can effectively explore interesting evolutionary technical trends in various research topics. [ABSTRACT FROM AUTHOR]

Copyright of Power & Electrical Engineering is the property of RTU Publishing House and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

To solve the problem of identifying similar questions in examination database, an algorithm for question similarity identification is proposed in this paper. By introducing domain words to the improvement of the word similarity model in HowNet, a model for question similarity identification is proposed to make the same or similar questions be identified and cut off automatically. This method improves the accuracy of identification compared with other methods. By combining merits of the random selection with those of the backtracking method, a new algorithm of generating papers automatically based on question similarity identification is proposed. It can guarantee the quality of papers. Test results show that the accuracy of question similarity identification of this method is 96% , which approaches to that of manual identification. This method can cut off similar questions not only of the same type, but also of different types. Finally, this method has been applied to the on-line examination of C programming language. [ABSTRACT FROM AUTHOR]

• We compare the performance of global metrics and their local variants in the identification of expert-selected milestone papers on two distinct citation datasets. • We obtain a family of local variants of PageRank (LeaderRank) with a tunable degree of locality and find they can generate highly correlated scores with the scores by the original metrics. • The local variants of PageRank (LeaderRank) perform similarly well as the original global PageRank (LeaderRank) algorithms in the identification of seminal papers. • The local variants of PageRank (LeaderRank) perform significantly better than local metrics such as citation count, h-index and semi-local centrality. • Compared to network-based global metrics, the proposed local estimates provide a better trade-off between performance and computational efficiency. Recent works aimed to understand how to identify "milestone" scientific papers of great significance from large-scale citation networks. To this end, previous results found that global ranking metrics that take into account the whole network structure (such as Google's PageRank) outperform local metrics such as the citation count. Here, we show that by leveraging the recursive equation that defines the PageRank algorithm, we can propose a family of local impact metrics. Our results reveal that the obtained PageRank-based local metrics outperform the citation count and other local metrics in identifying the seminal papers. Compared with global metrics, these local metrics can reach similar performance in the identification of seminal papers in shorter computational time, without requiring the whole network topology. Our findings could help to better understand the nature of groundbreaking research from citation network analysis and find practical applications in large-scale data. [ABSTRACT FROM AUTHOR]

Abstract: A lot of work has been done in the field of multi-valued model checking home and abroad. But some research works are not perfect. Some problems in the semantic definitions of temporal operators and corresponding model checking algorithms are found in the paper “Model Checking Using Partial Kripke Structure with 3-Valued Temporal Logic”. Some counterexamples are given to show these errors. On the basis of the discussion, some sound semantic definitions of temporal operators and correct algorithms of model checking for some temporal operators are given. [Copyright &y& Elsevier]

Cutting force is a significant indicator for in-process monitoring of cutting status. Although dynamometers are widely used in cutting force measurement, they are not suitable for nano-cutting due to insufficient sensitivities and low integrating possibilities. This paper presents a smart tool holder composed by piezoelectric ceramics and a flexible hinge, which could be integrated with a fast tool servo (FTS), for three-axial cutting force measurements in micro/nano-cutting. An algorithm was developed for enabling its quasi-static force measurement. Experiments were performed to verify the capabilities of cutting force measurement, demonstrating a high measurement sensitivity for indicating the micro/nano-cutting status. [ABSTRACT FROM AUTHOR]

Academic research is crucial to the development of science and technology and is an important factor that affects national strength. When writing an academic research paper, a rhetorical structure is typically used to present the paper's ideas, but this task is quite difficult for junior researchers. To solve this problem, some studies have adopted text mining to assist with the writing, but the existing methods still require human intervention to generate sentences. Recently, due to the increasing maturity of deep learning technology and the ability to address the problem of automatic text generation, progress has been made in this area. The highly complex deep learning operations can correctly generate sequences and find correlations between sequences. When a user provides a few keywords and key sentences, the proposed algorithm can generate an introduction section for the user. The results show that the generated introduction is more coherent, clearer, and more fluent than existing summarization methods. In addition, the method proposed in this study improves the accuracy compared with traditional text extraction methods. The manuscript produced by this study has been evaluated to show that the study can produce a comprehensive introduction compared with previous studies. • The proposed framework can generate a comprehensive introduction based on users' brief inputs. • This paper demonstrates a three-testing-threshold approach to check the content quality. • The introduction generated through this method has less than 3% similarity to the original text by comparison. [ABSTRACT FROM AUTHOR]

The smart car collects the signal through the infrared sensor, and obtains the gray map in front of the car, according to the gray map, the tracking is judged.Due to the complexity of the environment, many gray-scale maps are difficult to trace, and even cannot be judged, which brings great uncertainty to the operation of the smart car.The paper designs a method to improve the infrared tracking accuracy of smart cars.First, determine the level of contrast in this graph.By improving the brightness in the grayscale image, the gray signal around the tracking line is eliminated, and then the tracking line is highlighted by increasing the contrast.Therefore, it effectively overcomes the shortcomings of poor practicality of smart cars and improves the infrared tracking accuracy of smart cars. [ABSTRACT FROM AUTHOR]

To find the area of an irregular shape, we break the shape into common shapes. Then we find the area of each shape and add them, but this approach does not always work. In this paper we investigate Gauss’s area formula (for irregular shapes), also known as the shoelace formula or the shoelace algorithm. This theorem is outside the scope of school program. Nevertheless, we provide several applications that emphasize the importance and usefulness of this theorem. Most of the applications provided in this paper are created by the authors. [ABSTRACT FROM AUTHOR]

As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite associationbased resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks. [ABSTRACT FROM AUTHOR]

In recent years, distributed optimization problem have a wide range of applications in various fields. This paper considers the prescribed-time distributed optimization problem with/without constraints. Firstly, we assume the state of each agent is constrained, and the prescribed-time distributed optimization algorithm with constraints is designed on the basis of gradient projection algorithm and consensus algorithm. Secondly, the constrained distributed optimization problem is transformed into the unconstrained distributed optimization problem, and according to the gradient descent algorithm and consensus algorithm, we also propose the prescribed-time distributed optimization algorithm without constraints. By designing the appropriate objective functions, we prove the multi-agent system can converge to the optimal solution within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. Finally, three simulation examples are provided to verify the validity of the designed algorithms. • For distributed optimization problem with convex constraints, we design an effective prescribed-time distributed algorithm which can guarantee the multi-agent system converge to the optimal solution. • The designed algorithm in this paper can achieve convergence within any prescribed-time, and the convergence time is fully independent of the initial conditions and system parameters. • In this paper, we not only consider the condition that the agents' states are constrained, but also ensure that the multi-agent system can reach the optimal solution within any prescribed-time, which is more practical. [ABSTRACT FROM AUTHOR]

The article focuses on the research flaws in the study "The Harmful Effects of Algorithms in Grades 1-4," by Constance Kamii and Ann Dominick. The research explained the benefits of "no algorithms" experience in mastering arithmetic, where the authors theorized that the approach improved the ability of children to master mental math techniques and disadvantages of standard addition algorithm. The flaws proved that standard algorithms are essential in solving arithmetic problems in simple ways.

A critical aspect of software engineering is Software fault prediction which aims to identify and prevent errors in software systems before their release which can cause failures or issues for its users. Various techniques and tools have been developed to detect software faults, including static code analysis, dynamic testing, and machine learning-based approaches. In past few years, the world has seen a growing interest in the use of ML models for predicting software faults, as they can effectively analyse high dimensional datasets and detect complex patterns which are difficult for human experts to detect. However, developing accurate and reliable software fault detection models requires careful selection of data, feature engineering, and model evaluation. This purpose of this paper is to present a comprehensive analysis of potential applications and future research directions in the field of software fault detection. The study emphasizes the importance of identifying and addressing software faults to ensure the reliability and efficiency of software systems. Additionally, the paper outlines various approaches and techniques that can be employed for effective software fault detection. [ABSTRACT FROM AUTHOR]

The paper discusses the possibility of increasing the effectiveness of strategic management of research and development activities in higher education institutions. To achieve this goal, the authors proposed an algorithm for selecting competencies, which allows for the distribution of university employees and students among research and development teams in accordance with their individual competencies for carrying out research and development work. The paper covers the problem statement of competence selection, an overview of natural language processing methods for algorithm development, problematic areas of the algorithm, and prospects for its implementation in university management. [ABSTRACT FROM AUTHOR]

A sensorless control method of permanent magnet synchronous motor (PMSM) based on adaptive super-twisting algorithm sliding mode observer (STASMO) is proposed in this paper. The traditional sliding mode observer (SMO) algorithm has the problem of inherent high-frequency chattering due to the use of switching function. The phase delay will be caused by using low-pass filter to deal with the problem of high-frequency buffeting. In this paper, the chattering of the system is effectively suppressed by combining the super-twisting algorithm and the SMO algorithm. The chattering suppression ability of the algorithm is further improved by adding an adaptive coefficient associated with speed in front of the higher-order integral term of the observer. At the same time, the speed and rotor position information are extracted by normalized phase-locked loop (PLL), which avoids the use of low-pass filter and phase compensation module. In order to overcome the influence of the change of motor parameters on the control system, an online estimation method of motor parameters is proposed. The values of stator resistance and stator inductance are estimated online in real time, and the estimated values are fed back to the SMO, which improves the system performance and estimation accuracy. Through simulations and experiments, it is proved that the proposed algorithm can effectively suppress high-frequency chattering, effectively improve the estimation performance of PMSM sensorless control system, and obtain more accurate speed and rotor position information. [ABSTRACT FROM AUTHOR]

In order to improve the effect of intelligent fusion recommendation under the background of social network, this paper combines the fuzzy perception algorithm to research the intelligent fusion recommendation algorithm of social network. Moreover, this paper proposes a task offloading scheme that relies on V2V communication to utilize idle computing resources in a "resource pool". In addition, this paper formulates the computational task execution time as a min-max problem to reduce the storage overhead to optimize the total task execution time. Numerical results show that the proposed scheme greatly reduces the task execution time. The introduced particle swarm optimization algorithm also proves the convergence speed and accuracy of the optimization problem. The research verifies that the intelligent fusion recommendation algorithm for social network based on fuzzy perception has good social network data fusion effect and can effectively improve the effect of intelligent fusion recommendation. [ABSTRACT FROM AUTHOR]

Star identification algorithms can be applied to resident space object (RSO) surveillance, which includes a large number of stars and false stars. This paper proposes an efficient, robust star identification algorithm for RSO surveillance based on a neural network. First, a feature called equal-frequency binning radial feature (EFB-RF) is proposed for guide stars, and a superficial neural network is constructed for feature classification. Then the training set is generated based on EFB-RF. Finally, the remaining stars are identified using a residual star matching method. The simulation experiment and results show that the identification rate of our algorithm can reach 99.82% under 1 pixel position noise, and it can reach 99.54% under 5% false stars. When the percentage of missing stars is 15%, it can reach 99.40%. The algorithm is verified by RSO surveillance. [ABSTRACT FROM AUTHOR]

Graph Neural Network (GNN) directly inherits the captured collaborative information and there is no determination of whether the captured collaborative information benefits user preferences. Therefore, this paper propose the RCGCN model to solve that issue. First, we detect the level of interaction between a specific neighbor of the target node and other neighbors by the common interaction ratio (CIR), and the experimental results show that the collaboration information propagated by neighbors with higher CIR is more favorable to user preferences. Second, we introduce structural neighborhood contrastive learning to mine the association between users and items by comparing them with their structural neighbors. Finally, we use a joint training approach to optimize the learning objectives. The experimental results indicated that the RCGCN model is superior than the current benchmark models in both Recall@20 and NDCG@20 evaluation metrics. [ABSTRACT FROM AUTHOR]

This paper explains the construction of a novel augmented hunger games search algorithm using a logarithmic spiral opposition-based learning technique. The proposed algorithm (LsOBL-HGS) is used as an efficient tool for both function optimization and controller design. To assess the performance of the algorithm for function optimization, benchmark functions from the CEC2017 test suite were employed and comparisons were made with available and good performing algorithms. In terms of controller design, the proposed LsOBL-HGS algorithm was utilized to design a FOPID controlled magnetic ball suspension system. Comparative assessments were also performed for FOPID controller design, as well using other state-of-the-art methods reported for the magnetic ball suspension system. The results showed that the proposed LsOBL-HGS algorithm has good capability for FOPID controller design employed in a magnetic ball suspension system as it provided an improvement of more than 13 % in terms of the transient response-related parameters and more than 34 % in terms of bandwidth compared to the best-reported approach used for comparisons. [ABSTRACT FROM AUTHOR]

• Fast, reliable signature generation, blockchain storage, and video verification. • Our method detects video forgery on any file, anytime, anywhere, by anyone. • Insignificant additional storage requirements with respect to video size. • Withstands attacks: collisions, key substitutions, side-channels, chosen messages. • Aids real-time devices, e.g., phones, CCTV, serving legal, police, medical inquiries. Within the field of forensic science, video integrity is an essential component that ensures the validity and dependability of visual evidence that is essential for court cases. Maintaining the integrity of justice in a time when digital modification tools are easily accessible requires making sure that video recordings are unaltered. Video footage is carefully inspected by forensic analysts who use advanced tools to look for indications of manipulation or change. This paper presents a novel, lightweight approach for verifying the integrity of video data. The proposed method utilizes the blockchain and the Edwards Curve Digital Signature Algorithm, coupled with the BLAKE2b hash function. Signatures are generated for video clips with a predetermined size called video segments and stored in blocks chronologically. The signature of the previous block is stored in the current block to add another layer of security. At the time of validation, these signatures are verified. Experimental results show that the proposed method outperforms state-of-the-art methods in both speed and security. Our method is capable of identifying any type of forgery on any video file, by anyone, at any given moment, with insignificant additional storage requirements. Furthermore, our security analysis shows that our method is resilient against various types of attacks, including collision attacks, key substitution attacks, side-channel attacks, and chosen message attacks. The proposed lightweight video integrity verification method is better suited for use in resource constrained devices. [ABSTRACT FROM AUTHOR]

In elastic optical networks (EONs), the slicing-and-stitching technique has emerged as a promising solution to reduce spectrum fragmentation by breaking the subcarrier consecutiveness constraint. This physical layer technology enables all-optical slicing of requests, allowing them to be accommodated in multiple lion-consecutive spectral slots within an EON. In this paper, we investigate the survivable routing problem in EONs with slicers. Specifically, we consider the dedicated path protection (DPP) scheme to address single edge failures. For each connection request, we aim to find a pair of link-disjoint lightpaths to route the request. Additionally, we propose four heuristic algorithms to determine the routing paths based on two different slicing schemes, namely source and L-shape. Through extensive simulations, we evaluate the performance of the proposed algorithms and demonstrate their effectiveness in achieving satisfactory results. [ABSTRACT FROM AUTHOR]

In this paper, a pipeline leakage detection algorithm based on information fusion of pressure and flow is proposed, and its core work is the construction of BPA based on discount factors. The wavelet packet decomposition is carried out for the original signals, and the processed signals are used to train different SVM classifiers to achieve the first identification results. For the samples whose initial classification results are not completely consistent, BPA is calculated according to the confusion matrixes of the initial SVM classifiers. In this paper, static discount factors and dynamic discount factors are constructed using different methods, and dynamic discount factors are modified when decisions fail. Then comprehensive discount factors are constructed based on the combination of different static discount factors and dynamic discount factors. The Shafer discount rule is used to modify BPA. Finally, D-S evidence theory is used to fuse the BPA results of all classifiers under different discount combinations. Experiments show that this algorithm can effectively use the correlation of evidences to reasonably fuse the decision results of multiple sensors, overcome the problem that the accuracy of a single sensor is not high enough for leakage identification, and improve the identification accuracy of pipeline leakage. [ABSTRACT FROM AUTHOR]

As urbanization progresses, urban road congestion has intensified, highlighting the need for effective vehicle and pedestrian detection as a cornerstone of public safety transportation. This area holds significant relevance in video surveillance and public safety domains. Despite its importance, achieving precise vehicle and pedestrian detection in complex road environments remains challenging. This paper presents a vehicle-pedestrian detection algorithm based on the improved YOLOv5. Key modifications include the integration of a small target detection layer and alterations to the feature pyramid using the feature fusion technique inherent to the weighted Bidirectional Feature Pyramid Network (BIFPN). This ensures efficient multi-scale feature fusion. A coordinated attention mechanism is introduced to preserve accurate target location data. Furthermore, the paper incorporates the SIOU metric to refine the localization loss function, bolstering both speed and edge regression accuracy. Experimental outcomes indicate that our improved YOLOv5 algorithm augments detection accuracy by 1.9% and achieves a detection speed of 67 FPS, which surpasses many competing target detection algorithms. [ABSTRACT FROM AUTHOR]

Block cipher (BC) is a type of symmetric cipher used to encrypt data. Despite its advantages, it faces a substantial challenge. Writing the script code for the BC scheme accurately using General-Purpose Programming Languages (GPPLs) poses a significant challenge for programmers. The aim of this paper is to present the first graphical domain-specific modeling language (DSML) for designing and implementing BC algorithms, called BCLang. It is an extension to our previous DSML that was developed for Stream cipher. Programming efficiency and expressiveness were increased by reducing grammar and runtime errors and providing a high level of abstraction. BCLang provides the fundamental components of the BC three structures, which enable the programmer to design and implement BC algorithms in a graphical manner. Two keystream generation methods, performance analysis, and tests of the National Institute of Standards and Technology (NIST) for randomness analysis were provided. The presented language was evaluated based on five subjective metrics specific to graphical DSML evaluation. The design, evaluation details, and properties are explained in depth in this paper. [ABSTRACT FROM AUTHOR]

The year 2008 is etched in human history as the year of the 'Global Financial Crises'. Post the crises, Historians and financial commentators alike rushed to impute blame. Some blamed securitizations, some the banks and some Lehman Brothers and AIG. However, in the midst of all of this humbug, a key epicentre of the crises escaped academic scrutiny; 'Automation Technology'. The paper therefore aims to present an alternative view of financial history; one which impleads 'automation technology in finance' i.e., Risk Modelling Algorithms and RegTech. However, the underlying aim of this paper is to make a case against systemic automation bias in finance and to achieve that end, the paper employs an inter-disciplinary approach and uses history, law and data science to show case the multifarious perils of using automation technology blindfold in finance whilst also proposing possible solutions such as the incorporating of design thinking and systems theory in finance. Expired data sets, human assumptions, turning code in law, and a lack of standardized financial semantics as but some of these 'perils'. On the law front; it presents a twofold challenge under constitutional and anti-trust law and aims to reconcile law and technology. Lastly the paper aims to guide regulators by categorizing multiple stages of technological complexity and recommends application of different regulatory approaches to regulating automation. Therefore, the paper shall maintain a 'solution' oriented approach throughout. [ABSTRACT FROM AUTHOR]

The utilization of a supporting tool in Double-Sided Incremental Forming (DSIF) imposes a stabilizing compressive stress through the sheet’s thickness, increasing, thereby, the material’s formability and fatigue life. However, these favorable effects strongly depend on a steady tool-metal contact condition. This work presents a general DSIF control scheme, which augments the conventional position servo-loop with explicit force feedback control. The algorithm is examined for its robustness and effectiveness using complex geometries with varying curvatures and wall angles. The resulting parts have demonstrated enhanced material formability and geometric accuracy. [ABSTRACT FROM AUTHOR]

Software-based technical indicators have been widely used for the stock market forecasting, aiming to predict market direction. Even though many algorithms for the software based technical indicators are presented, there are almost no hardware implementations reported in the literature. In this paper, the hardware implementation is presented for three commonly used technical indicators: Moving Average Convergence/Divergence (MACD), Relative Strength Index (RSI), and Aroon. Latency evaluation is conducted for Bitcoin and Ethereum within a single-day timeframe, utilizing the Xilinx Zynq-7000 programmable SoC XC7Z020-CLG484-1 platform. Additionally, various hardware/software (HW/SW) partitioning strategies are explored to leverage the flexibility of software alongside the performance advantages of hardware via the Zynq SoC platform. The results show that the best performing technical indicator is MACD with a speedup of 30 times over its software only counterpart. Furthermore, a hybrid design integrating multiple technical indicators is proposed, pairing MACD with RSI due to their competitive throughput values, differing by only 0.38 microseconds. This hybrid approach capitalizes on the parallel processing capabilities of hardware, enabling multiple systems to operate simultaneously. • Proposed SoC framework boosts HFT system efficiency. • HW/SW partitioning on Zynq-7000 SoC enhances flexibility. • MACD, RSI, Aroon indicators implemented for forecasting. • MACD outperforms others on ZYNQ SoC, 30x faster than software. • MACD and RSI combination optimal for hybrid designs. [ABSTRACT FROM AUTHOR]

Semantic segmentation of glioma and its subregions plays a critical role in the entirely clinical workflow of brain cancer diagnosis, monitoring, and treatment planning. Recently, automatic tumor segmentation has attracted a lot of attention, especially supervised learning methods based on neural networks, and the popular “Ushaped” network architecture has achieved state-of-the-art performance in many fields of medical image segmentation. Despite the success of these models, the commonly used small convolution kernel can only extract local features, and more global contextual features cannot be learned, resulting in the disappointing performance of modeling long-range information. At the same time, due to the difficulty of obtaining medical image data, and the imbalance of tumor data in which tumor usually occupies a relatively small volume compared with the background, the adverse influence on the training of the model occurs. In this paper, a novel segmentation framework including TensorMixup data augmentation, improved Receptive Field Expansion UNet (RFE-UNet) and hybrid loss function is designed. Specifically, the TensorMixup algorithm in the data preprocessing phase is used to provide more high-quality training data. In the training phase, both a RFE-UNet network and a hybrid loss function are proposed respectively. RFE-UNet network adds Receptive field expansion module based on Dilated convolution in the first three stages of skip connection, which is used to learn more local and global features. In addition, hybrid loss function is mainly composed of focal loss and focal Tversky loss, focal loss increasing the weight of fewer samples and focal Tversky loss focusing on learning the characteristics of samples with incorrect predictions, which is adopted to alleviate data imbalance. The experimental results on the BraTs2019 dataset show that the average Dice value of the proposed algorithm in the intact tumor, tumor core, and enhanced tumor region can reach 91.55%, 89.23%, and 84.16% respectively, which proves the feasibility and effectiveness of using the proposed architecture. [ABSTRACT FROM AUTHOR]

In Currently, research in the field of infrared road object detection is primarily focused on enhancing model performance and robustness to address the challenges posed by complex real-world driving scenarios. In response to these challenges, this paper proposes an infrared road object detection algorithm based on an attention mechanism. By incorporating the CPCA module, which utilizes attention mechanisms, into the YOLOv8s model, the algorithm enhances the model's focus on unobstructed areas and highly illuminated sections, extracting crucial feature information to improve both accuracy and robustness. Additionally, the original model's downsampling layer is replaced with the Context Grided Network Block Downsampling (CGBD) module, which not only preserves feature edge information but also effectively handles local and contextual features, thereby enhancing the overall feature capturing capabilities of the model. To address the issue of equal aspect ratios in the model's original loss function, the proposed algorithm adopts the superior Weighted Intersection over Union (WIoU). This not only addresses the shortcomings of the original loss function (CIoU) but also demonstrates increased sensitivity in classification tasks. Experimental results show that the improved algorithm, compared to YOLOv8s, achieves a 1.4% increase in mean average precision (mAP), along with notable improvements in precision and recall. Furthermore, when compared to mainstream model algorithms, the enhanced model significantly outperforms in infrared road object detection tasks, providing validation of its effectiveness. [ABSTRACT FROM AUTHOR]

Images captured under severe weather conditions, such as haze and fog, suffer from image quality degradation caused by atmospheric particle diffusion. This degradation manifests as color fading, reduced contrast, and adversely affects the performance of various computer vision tasks. To address this, this paper presents an end-to-end feature fusion attention network (FFA-Net) designed to directly restore haze-free images. By incorporating the SSIM loss into the original loss function, the proposed method effectively captures the visual disparities between the estimated defogged image and the authentic haze-free image. Additionally, it mitigates the color distortion problem inherent in the original algorithm. To address the challenge of low brightness in input images, a low illumination enhancement module is introduced, seamlessly integrated with the FFA-Net defogging method. Subsequently, a comparative analysis of different defogging algorithms is conducted using two distinct foggy datasets. Multiple evaluation metrics are employed to assess the performance of these algorithms. The findings indicate that our algorithm significantly outperforms others in terms of objective indicators such as PSNR and SSIM, as well as visual effects. [ABSTRACT FROM AUTHOR]

Network function virtualization can increase the versatility of computing and network platforms, enabling them to provide more flexible services. In terms of a softwaredefined network and network function virtualization environment, this paper explores the joint virtual network function (VNF) deployment and traffic routing in multisource multicast for VNF service chain deployment to minimize the deployment overhead, transmission delay. Firstly, a multi-objective optimization model, which minimizes the deployment overhead and transmission delay, is established to tackle this challenge problem. Then, a highly efficient coding scheme, crossover, and mutation operators are designed. Based on these, an improved genetic algorithm in multi-objective evolutionary algorithm based on decomposition (MOEA/D) framework (GA-MOEA/D) is proposed to solve this multi-objective problem. Finally, simulation experiments are conducted using two widely used network topologies in order to demonstrate the performance of the proposed algorithm. The simulation results demonstrate that the proposed algorithm can obtain the smaller deployment overhead, transmission delay, load degree and energy consumption 5.2%-15.61%, 11.2%-26.4%, 8.3%-17.6% and 7.8%-14.4% than that of the compared algorithm, respectively. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Donghua University (English Edition) is the property of Journal of Donghua University Editorial Board and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The growing need for high-performance folded cascode CMOS OTAs in various fields, such as electronics and communications, requires them to operate with wide bandwidth, high voltage gain, compact devices, and low power consumption. Recent research indicates that implementing the water cycle algorithm (WCA) can greatly improve the performance of the folded cascode CMOS operational transconductance amplifier (OTA). This is due to the WCA's ability to perform both global search and local exploration efficiently. Notably, the OTA in question is constructed using 0.18µm TSMC technology and operates with a voltage supply of ±1.8V. The results of the simulation were collected using PSPICE software (version 17.4). These design solutions demonstrate exceptional efficiency, delivering significant amplification, high frequency, and minimal power usage. In addition, the paper demonstrates the implementation and simulation outcomes of a folded cascode CMOS operational transconductance amplifier utilizing the water cycle algorithm, MATLAB was employed for this purpose. Using WCA in the design of an OTA for folded cascode CMOS OTA results in significant improvements in performance metrics. Experiences a significant increase in voltage gain, with an increase in gain bandwidth by a factor of five compared to the algorithm-free design. In addition, power consumption is reduced by 15.5%, and the common mode rejection ratio is improved by 15.18% compared to the non-WCA folded cascode CMOS OTA design. The results highlight the effectiveness of the WCA technique as a powerful optimization strategy to improve the performance of folded cascode CMOS OTA. [ABSTRACT FROM AUTHOR]