Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for a semiconductor industry can be solved by constraint answer set programming (CASP) and, its solver called clingcon. The considered scheduling problem includes a robot for lot transfers between the baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, Constraint Processing and Satisfiability Modulo Theories. For a long time, exact methods such as constraint programming have displayed difficulties in solving real large-scale problem instances. Currently, the performance of state-of-the-art constrains solvers is comparatively better than a decade ago, and some complex combinatorial problems can be optimally solved. These theoretical and technical achievements open new horizons for declarative programming applications such as logistics. A successful solution to this problem is achieved and we found that in most cases tested, CASP is faster and obtains in most cases similar makespan values than solutions based on mixed integer linear programming and constraint paradigms.

To assist Java programming learning of novice students, we have developed the web-based Java programming learning assistant system (JPLAS). JPLAS provides several types of exercise problems to cultivate code reading/writing skills at various levels. In JPLAS, the code writing problem (CWP) asks a student to write a source code that will pass the test code given in the assignment where the correctness is verified by running them on JUnit. In this paper, to reduce the teacher load at marking process, we present the answer code validation program that verifies all the source codes from a lot of students for each assignment at a time and reports the number of passing tests for each source code in the CSV file. Besides, to test a source code with various input data, we implement the test data generation algorithm that identifies the data type, generates a new data, and replaces it for each test data in the test code. Furthermore, to verify the correctness of the implemented procedure in the source code, we introduce the intermediate state testing in the test code. For evaluations, we applied the proposal to source codes and test codes in a Java programming course in Okayama university, Japan, and confirmed the validity and effectiveness.

Although total nett CO₂ atmospheric flow can be estimated with reasonable accuracy, the contributing gross fluxes between the atmosphere and the earth's surface are poorly understood. This paper presents a method, driven by the objective of simplicity, by which the global outflow and inflow of CO₂ between atmosphere and a globally equivalent "mixing reservoir" can be estimated, using the isotopes ¹⁴C and ¹³C as tracers. It has been asserted that the isotopic carbon in CO₂ cannot be directly used as a tracer in flow studies because it is not subject to the Revelle factor. Evidence is provided showing that this view is mistaken. The model contains 7 key parameters which are used to create synthetic records of Δ¹⁴C and d¹³C spanning 200 years or more, including during the period of atmospheric weapons testing and its decay known as the "bomb pulse". By optimising the fit between these computed values and the historical records of d¹³C and Δ¹⁴C, all seven key parameters are determined. The effective "mixing reservoir" is thereby determined to have a size around six times that of the atmosphere, with global outflux rising from 39.7 GTC yr-1 in 1750 to 58.9 GTC/yr in 2020, this figure probably not including annually cycled carbon.

Based upon a radically new approach, this paper describes a 2-box absolute flow model that calculates the CO₂ transfer between the atmosphere and a terrestrial / ocean mixing reservoir. Given the inputs of anthropogenic fossil fuel emissions (CO2ff), atmospheric CO₂ mixing-ratio and nuclear weapons bomb yields, the model calculates atmospheric d¹³C and Δ¹⁴C time-series, with the level of agreement for d¹³C being to within ± 0.05 ‰, for Δ¹⁴C to within ± 3‰, spanning 200 years. The model contains only seven internal parameters which are varied to optimize the fit. Yet according to conventional wisdom, this model should not work. It is commonly held that the ¹³C and ¹⁴C isotopic forms of carbon bypass seawater carbonate chemistry, resulting in very different absorption properties (Revelle factor) as compared to ¹²C. This study rejects this assumption, and uses the same residence time and reservoir mixing properties for all isotopes. The paper includes an analysis justifying why the isotopic bypass of the Revelle factor is not significant. The study describes the use of the model to track CO2ff takeup using two separate measures, a) the amount of molecular CO2ff remaining in the atmosphere and b) the amount of atmospheric growth attributable to CO2ff, thereby resolving discrepancies in published values.

This paper presents a new implementation of a 2-box absolute flow model, enabling the calculation of CO₂ transfer between the atmosphere and a mixing reservoir representing the combined effect of the terrestrial and ocean regions. The model uses published values of anthropogenic CO₂ fossil fuel emissions (CO2ff), atmospheric CO₂ mixing ratio and nuclear weapons bomb yields, to compute atmospheric d¹³C and Δ¹⁴C time-series. The level of agreement between the calculated values and the accepted values for d¹³C is within ± 0.05 ‰, and for Δ¹⁴C is within ± 3‰, spanning 200 years. The model contains only seven internal parameters; these are varied to optimize the fit, leading to reasonable parameter values, indicating the validity of the method. In addition, the model shows how a rising CO₂ exchange influx fluctuating with surface temperature is compatible with a nett atmospheric CO₂ sink. The study demonstrates that a single CO₂ residence time applies to both the ¹⁴C bomb pulse and the anthropogenic flux, contrary to the conventional view that "bomb radiocarbon and anthropogenic CO₂ do not behave identically." [Joos 1994 Nature 370, 181–182]. It is shown that the difference in behaviour, claimed to be due to seawater chemistry, is not significant in practice since fluctuating bulk carbon dominates fluctuating isotopic ratio. A new analysis of the airborne fraction indicates that the assumption of a time-dependent exchange influx results in a similar residence time for bulk CO₂ as for ¹⁴C in the nuclear bomb pulse, reinforcing the view that the ¹²C, ¹³C and ¹⁴C carbon isotopic forms of CO₂ behave similarly in the carbon cycle.

This paper presents the PEnsemble 4 model, a sophisticated machine learning framework that integrates IoT-based environmental data to accurately forecast maize yield. With the projected significant growth in global maize demand over the next decade, the inherent risks posed by the crop’s dependence on weather conditions necessitate improved prediction capabilities. The PEnsemble 4 model, developed with high accuracy, incorporates comprehensive datasets encompassing soil attributes, nutrient composition, weather conditions, and UAV-captured vegetation imagery. By employing a combination of Huber and M estimates, the PEnsemble 4 model effectively analyzes temporal patterns in vegetation indices, specifically CIre and NDRE, which serve as reliable indicators of canopy density and plant height. In addition, this research significantly contributes to precision agriculture by offering an efficient and sustainable alternative to conventional farming practices through precise yield predictions. Notably, the PEnsemble 4 model enables earlier estimation, advancing the timeline for yield prediction from the conventional day 100 in the R6 stage to day 79 in the R2 stage. This improvement enhances decision-making processes in farming operations. The remarkable accuracy rate of 91% underscores the importance of adopting a multifaceted data approach that harnesses IoT-derived environmental insights. Additionally, the PEnsemble 4 model extends its benefits beyond yield prediction, facilitating the detection of water and crop stress, as well as disease monitoring in broader agricultural contexts. Ultimately, the PEnsemble 4 model establishes a new standard in maize yield prediction, revolutionizing crop management and protection through the synergistic utilization of IoT and machine learning technologies.

AbstractLocal estimates of coastal flood risk are required for coastal planning and development, including the location and design of sea-defences and coastal buildings, such as harbours and associated infrastructure. This paper discusses the use of three parameters associated with estimating such risks; the flood return period, the instantaneous flood probability and the flood design risk, and it describes the mathematical background for their derivation. The discussion is extended to include the effects of sea level rise and how it can be incorporated into the calculations. Flood height can vary quite rapidly with distance along the coast, being affected by coastal topology, which may magnify or diminish the tidal and surge effects. Similarly land heave influences the local effects of sea level rise and can be influenced by water extraction, tectonic movements and melting ice. Tide gauge measurements provide a local historical record from which the various parameters can be retrieved. This paper discusses the algorithms used to derive these measures from tide-gauge records. The figures have been derived for four tide gauges located on the UK east coast.

Deep learning neural networks require an immense amount of computation, especially in the training phase of the network when networks with multiple layers of intermediate neurons need to be built. In this paper, we will focus on the PSO algorithm with the aim of significantly accelerating the DLNN training phase by taking advantage of the GPGPU architecture and the Apache Spark analytics engine for large-scale data processing tasks. PSO is a bio-inspired stochastic optimization method whose goal is to iteratively improve the solution to a (usually complex) problem by attempting to approximate a given objective. However, parallelizing an efficient PSO is not a straightforward process due to the complexity of the computations performed on the swarm of particles and the iterative execution of the algorithm until a solution close to the objective with minimal error is achieved. In the present work, two parallelizations of the PSO algorithm have been implemented , both designed for a distributed execution environment. The synchronous parallel PSO implementation ensures consistency at the cost of potential idle time due to global synchronization, while the asynchronous parallel PSO approach improves execution time by reducing the need for global synchronization, making it more suitable for large datasets and distributed environments such as Apache Spark. Both variants of PSO have been implemented to distribute the computational load supported by this algorithm –due to the costly fitness evaluation and updating of particle positions– across the different Spark cluster executor nodes to effectively achieve coarse-grained parallelism, resulting in a significant performance increase over current sequential variants of PSO.

The foot-mounted inertial navigation system is an important application of pedestrian navigation as it in principle does not rely any external assistance. A real-time range decomposition constraint method is proposed in this paper to combine the information of dual foot-mounted inertial navigation systems. It is well known that low-cost inertial sensors with ZUPT (zero-velocity update) and range decomposition constraint perform better than in either single way. This paper recommends that the distance of separation between the position estimates of feet-mounted inertial navigation systems be restricted in the ellipsoidal constraint which relates to the maximum step and leg height. The performance of the proposed method is studied utilizing experimental data. The results indicate that the method can effectively correct the dual navigation systems’ position over the existing spherical constraint.

Quantum optimization is a significant area of quantum computing with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational Hamiltonian-based algorithms, struggle on present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning but often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for the Quantum Approximate Optimization Algorithm to satisfy all the requirements that correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities of measuring solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in linear number of entangleming gates instead of exponential and superior performance compared to standard formulations. Specifically, we achieve higher probabilities of measuring feasible solutions in 9 out of 9 instances compared to standard Hamiltonian formulations and surpass quadratic programming formulations known from quantum annealers in 7 out of 9 instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

The paper addresses the energy consumption minimization problem in wireless powered communication networks (WPCNs) and proposes a DT-SWIPT-assisted time allocation scheme, named DaTA, such that the wireless station can share the remaining energy after transmission to the HAP to those who have not transmitted to the HAP to minimize the energy consumption of the network. In addition to proposing a new frame structure, the paper also considers the SNR (Signal-to-Noise) constraint to guarantee that the HAP can successfully receive data from wireless stations. In the paper, the energy consumption minimization problem is formulated as a nonlinear programming model. We employ the SQP (Sequential Quadratic Programming) algorithm to figure out the optimal solution. Moreover, a heuristic method is proposed as well to obtain a near-optimal solution in a shorter time. Simulation results showed that the proposed scheme can have better performance than the related work in terms of energy consumption and energy efficiency.

We review the literature on medical discourse and attempt to build a computational model of it. Medical discourse sheds a light on communication structure of patient-doctor and other communication scenarios in healthcare and should be leveraged to facilitate and automate this communication when it is possible and practical. We propose a unified framework to represent communication discourse at the meta-level, where the subject of the communication is expressed in a language object. So far, the broad range of work on medical discourse is detached from computational discourse analysis, and we explore the possibilities of filling this gap and computationally treat the peculiarities of how information is passed between the agents in a hospital setting. We select the domain of question answering (QA) against a corpus of medical documents of diverse nature to evaluate our computational model of medical discourse. It turns out that applying specific structures obtained in medical discourse studies improves the relevance and efficiency of question answering.

"Eureka" is a transformative platform designed to address the academic challenges faced by students by fostering an inclusive and collaborative learning environment. Through an online Q\&A discussion format, it facilitates knowledge sharing, coursework discussions, and peer support, thereby enhancing collaborative learning. Key features such as Q\&A, Answer Validation, and Leaderboard ensure efficient and reliable information exchange, motivating active student participation and mutual support. The platform's development using Agile methodologies has proven effective, emphasizing iterative development, constant user feedback, and collaborative efforts. This approach has significantly boosted student engagement and improved learning outcomes. "Eureka" not only aids in students' understanding of course material but also contributes to overall academic performance, serving as a powerful tool in creating a supportive academic environment. Its Agile-based development ensures ongoing responsiveness to student needs, enabling continuous improvement and a sustained positive impact on learning experiences.

Management of sarcomas in specialist centers delivers significant benefits. In much of the world specialists are not available and development of expertise is identified as a major need. However the terms ‘specialist’ or ‘expert’ center are rarely defined. Our objective is to offer a definition for patient advocates and a tool for healthcare providers to underpin improving the care of people with sarcoma. SPAGN developed a discussion paper for a workshop at the SPAGN 2023 Conference, attended by 75 delegates. A presentation to the Connective Tissue Oncology Society (CTOS) and further discussion led to this paper. Core Principles were identified that underlie specialist sarcoma care. The primary principle is the multi-disciplinary team discussing every patient, at first diagnosis and during treatment. Principles for optimal sarcoma management include accurate diagnosis followed by safe, high-quality treatment, with curative intent. These Principles are supplemented by Features describing areas of healthcare, professional involvement, and service provision and identifying further research and development needs. These allow for variations because of national or local policies and budgets. We propose the term ‘Sarcoma Intelligent Specialist Network’ to recognize expertise wherever it is found in the world. This provides a base for further discussion and local refinement.

In this study, a novel oral formulation of berberine hydrochloride (BBH) hydrogel was successfully synthesized through physical cross-linking using chitosan (CS) and carboxymethyl-β-cyclodextrin (CMCD). The characterization results confirmed the successful synthesis of CS/CMCD hydrogel and the subsequent loading of BBH into this composite (CS/CMCD/BBH) was effectively accomplished. BBH was used as a model drug and the resulting hydrogel demonstrated a sustained drug release profile. In addition to its improved solubility and sustained release characteristics, the hydrogel exhibited excellent antibacterial activity against common pathogens such as Escherichia coli (E. coli), Staphylococcus aureus (S. aureus), and Candida albicans (C. albicans). Additionally, in vitro studies indicated that the hydrogel was not cytotoxic to NIH3T3 and HaCaT cells, suggesting its safety for biomedical applications. This lack of cytotoxic effects, combined with the mechanical strength, solubility improvements, and antibacterial properties of the hydrogel, positions the CS/CMCD/BBH hydrogel as a promising candidate for effective oral delivery of BBH. By addressing the solubility and delivery challenges of BBH, this hydrogel offers a viable solution for the oral administration of berberine hydrochloride, with potential applications in various biomedical fields.

The advancement of autonomous capabilities in maritime navigation has gained significant attention, with a trajectory moving from decision support systems to full autonomy. This push towards autonomy has led to extensive research focusing on collision avoidance, a critical aspect of safe navigation. Among the various possible approaches, Dynamic Programming is a promising tool for optimizing collision avoidance maneuvers. This paper presents a DP formulation for collision avoidance of autonomous vessels. We set up the problem framework, formulate it as a multi-stage decision process, define cost functions and constraints focusing on the actual requirements a marine maneuver must comply with, and propose a solution algorithm leveraging parallel computing. Additionally, we present a greedy approximation to reduce algorithm complexity. Through case studies, we demonstrate the effectiveness of the proposed approach in navigating complex scenarios, contributing to the future of autonomous maritime navigation. Through case studies, we show the efficacy of our approach in navigating complex scenarios.

Spectral calibration consists of the calibration of wavelengths and the measurement of the instrument's spectral response function (SRF). Unlike conventional slits, the absorbed aerosol sensors (AAS) are used as a slit homogenizer, in which the spectral response function (SRF) is not a conventional Gaussian curve. To be more precise, the SRF is the convolution of the slit function of the spectrometer, the line spread function of the optical system, and the detector response function. The SRF of the slit homogenizer is a flat-topped multi-Gaussian function. Considering the convenience of fitting, a super-Gaussian function, which looks like a similar distribution to the flat-topped multi-Gaussian function, is used to fit the measured data in a spectral calibration. According to the results, the SRF’s shapes, due to the Earth port, resemble a Gaussian curve with a flatted top could be concluded, which contains an FWHM of 1.78–1.82 nm for the AAS. The results show that the correlation coefficients are about 0.99, which proves that the fitting function could better characterize the SRF of the instrument.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

The uncertainty in the secondary path of an Active Noise Control (ANC) headphone affects the waterbed effect and stability of the feedback system. This study focuses on the uncertainty of the secondary path when real users wear headphones, and proposes a new uncertainty constraint based on the measured results of the secondary path transfer function under different wearing conditions of dummy head and limited subjects. This constraint and a cascaded second-order infinite impulse response filter with fixed coefficients are used to formulate a control strategic function, which is optimized by the Improved Grey Wolf Optimizer (IGWO) algorithm to obtain the optimal controller with better noise reduction performance. The proposed method and simulation model are validated based on the experimental test results. The results demonstrate that the safety factor and waterbed suppressing factor contained in the proposed uncertainty constraint ensures more stable noise reduction and effective suppression of the waterbed effect for new subjects without a priori data.

Advancements in computing technology have resulted in significant changes in education, healthcare, and manufacturing fields. Thus, personnel training in computer-related fields is directly related to national competitiveness. Therefore, the importance of programming education has been emphasized worldwide. Programming education has been conducted since the 1980s, however beginners often find programming tedious and difficult because of the cognitive burden of using text commands. Therefore, block-based programming environments, such as Scratch and Code.org, and beginner-oriented programming environments, such as Blockly and Pencil Code, have been de-veloped. However, they have limitations when transitioning from block to text-based programming. In this study, we conducted one semester of classes for 128 middle school, high school, and uni-versity students to determine whether an environment that allows using a text-based programming language in a block-based programming environment aids beginners’ understanding of program-ming instructions, command usage confidence, and programming usefulness. The results confirm that the usability of a block-based environment positively influences programming perception. This study is significant because it verifies the necessity and effectiveness of a block-based environment that employs a text-based programming language in programming education for beginners.

The use of Retrieval-augmented generation (RAG) using large language models (LLMs) has shown potential for addressing issues such as hallucinations and inadequately contextualized responses. A pivotal stage in the RAG process involves a retriever for retrieving chunks based on semantic similarity with the query. In this study, we advocate for and provide experimental evidence supporting integrating and maintaining questions and answers (QA) formatted databases to improve retrieved-context representations and response quality. Our experiments evaluate our approach on benchmark RAG datasets using standard evaluation metrics and provide comparative analyses against state-of-the-art retrieval methods, showing the potential of our approach.

Private Set Intersection (PSI) is a cryptographic method in secure multi-party computation that allows entities to identify common elements in their datasets without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI protocols to these imbalances is crucial. This paper explores unbalanced PSI scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities. It introduces three innovative solutions for unbalanced PSI: unbalanced PSI protocol based on Cuckoo filters, unbalanced PSI protocol based on single cloud assistance, and unbalanced PSI protocol based on dual cloud assistance, each addressing the shortcomings of the previous solution. These protocols primarily optimize database computational load, storage capacity, protocol execution time, and security. Depending on performance and security needs, different protocols can be employed for applications such as private contact discovery.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

The kind of set which is based on edges, is introduced. The analysis on this set is done in the matter of operation which are the classes of graphs. The general notion which is related to this concept, is up. The set of edges is seen in the matter of common vertex, entitled neighbor edges and the set of edges which has specific condition on the vertices of graphs, entitled ghost set. The kind of viewpoint when the edges are up so the kind of efforts to assign some notions which get the sensible result of edges which make sense about these two types of notions. Notions of having some attributes about vertices concerning edges and edges' attributes to get result about edges in the matter of vertices.

SET protein carries out multiple functions including those for protein phosphatase 2A (PP2A) inhibition, histone modification, DNA repair and gene regulation. SET overexpression has been detected in brain neurons of Alzheimer's disease patients, follicle theca cells of Polycystic Ovary Syndrome (PCOS) patients, and ovarian cancer cells, indicating that SET may play a pathological role for these disorders. SET transcript 2, produced by a specific promoter, represents a major transcript variant in different cell types. In this study, we characterized the transcriptional activation of human SET transcript 2 promoter in HeLa cells. Promoter deletion experiments and co-transfection assays indicated that ZFX, the Zinc finger and X-linked transcription factor, was able to transactivate the SET promoter. A proximal promoter region containing four ZFX-binding sites was found to be critical for the ZFX-mediated transactivation. Mutagenesis study indicated that the site located closest to the transcription start site accounted for most of the ZFX-mediated transactivity. Manipulation of ZFX levels by overexpression or siRNA knockdown confirmed the significance and specificity of the ZFX-mediated SET promoter activation. Chromatin immunoprecipitation results verified the binding of ZFX to its cognate site in the SET promoter. These findings have led to identification of ZFX as an upstream factor regulating SET gene expression. More studies are required to define the in vivo significance of this mechanism, and specifically, its implication for several benign and malignant diseases related to SET dysregulation.

Utilizing groundwater offers a promising solution to alleviate water stress in Ethiopia, providing a dependable and sustainable water source, particularly in regions with limited or unreliable surface water availability. However, effective decision-making regarding well drilling and placement is essential to maximize groundwater resource potential, enhancing agricultural productivity, reducing hunger, and bolstering food security in Ethiopia. This study concentrates on the development of two-stage stochastic mixed integer programming (SMIP) models to optimize well placement for sustainable agricultural irrigation, considering uncertain demand scenarios. Additionally, a deterministic mixed integer programming model is formulated for comparison with the two-stage SMIP. Experiments are conducted to explore various demand scenario distributions, revealing that the optimized total cost for the two-stage SMIP generally exceeds that of a deterministic setting, aligning with the two-stage SMIP's focus on long-term benefits. Moreover, slight differences are observed in well layouts under different assumption scenarios. The study also examines the impact of selected parameters, such as fixed construction costs, per-meter drilling costs, and demand scenarios. The out-of-sample performance shows that the stochastic model is more flexible and resilient, with 11% and 4% lower costs than deterministic cases 1 and 3, respectively. This flexibility provides a more robust long-term strategy for well placement and resource allocation in groundwater management.

Hypersonic aircraft focuses more on the integration of aircraft and engine than ordinary aircraft owing to high performance requirements, and the nozzle design is reflected in the required large area ratio of nozzle inlet and outlet and the compactness of the overall size of the aircraft. In this study, the height constraint is directly introduced into the maximum thrust nozzle design method. A new method for designing nozzles under the height constraints that consults the maximum thrust theory is proposed. Initially, the condition that the nozzle reaches the maximum thrust under the height constraint is deduced mathematically. Then, a nozzle design method satisfying the height constraint is computed using the method of characteristics (MOC). Subsequently, the influence of the design parameters on the design method is studied parametrically. Results show that Mach number scale and asymmetrical factors can affect ramp length and flap length of the nozzle, respectively. These factors great influence the axial thrust performance and lift under a specific height constraint. Compared with the traditional truncation design method, the thrust coefficient and lift increased by 11.93% and 138.45% respectively.

Aging rate differs greatly between species, indicating that the process of senescence is largely genetically determined. Senescence evolves in part due to antagonistic pleiotropy (AP), where selection favors gene variants that increase fitness earlier in life but promote pathology later. Identifying the biological mechanisms by which AP causes senescence is key to understanding the endogenous causes of aging and its attendant diseases. Here we argue that the frequent occurrence of AP as a property of genes reflects the presence of constraint in the biological systems that they specify. This arises particularly because the functionally interconnected nature of biological systems constrains the simultaneous optimization of coupled traits (interconnection constraints), or because individual traits cannot evolve (impossibility constraints). We present an account of aging that integrates AP and biological constraint with recent programmatic aging concepts, including costly programs, quasi-programs, hyperfunction and hypofunction. We argue that AP mechanisms of costly programs and triggered quasi-programs are consequences of constraint, in which costs resulting from hyperfunction or hypofunction cause senescent pathology. Impossibility constraint can also cause hypofunction independently of AP. We also describe how AP corresponds to Stephen Jay Gould’s constraint-based concept of evolutionary spandrels, and argue that pathologies arising from AP are bad spandrels. Biological constraint is a missing link between ultimate and proximate causes of senescence, including diseases of aging. That this was not realized previously may reflect a combination of hyperadaptationism among evolutionary biologists, and the erroneous assumption by biogerontologists that molecular damage accumulation is the principal primary cause of aging.

CTC numbers in the blood of cancer patients can indicate the progression and invasiveness of tumors and their prognostic and predictive value has been repeatedly demonstrated. However, the standard baseline CTC count at the beginning of treatment, while informative, is not completely reliable and may not adequately reflect the state of the disease. The growing number of studies indicate that long-term monitoring of CTC numbers in the same patient provides more comprehensive prognostic data and should be incorporated into clinical practice, as a factor that contributes to therapeutic decisions. This Review describes the current status of CTC enumeration as a prognostic and predictive factor, highlights the shortcomings of current solutions and advocates for longitudinal CTC analysis as a more effective method of the evaluation of developing disease, treatment efficacy, and long term-monitoring of the minimal residual disease.

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

Road traffic accidents are associated with different factors, such as non-signalized road networks, inexperienced drivers, lack of communication skills, distraction, and visual or cognitive impairment of road users, which have led to this increase in traffic accidents. Understanding these factors in alignment with road user communication skills can provide solutions that can reduce traffic fatalities. Road users’ communication is predominantly formal in nature, but informal means of communication also exist but are not given proper attention during the driving training and licence testing processes. Therefore, this study investigated communication skills between drivers as a factor contributing to traffic accidents in South African cities. Consequently, 16 traffic scenarios of communication between drivers were simulated using PTV Vissim and Blender software, and a semistructured interview questionnaire was used to collect data from South African road users. The questionnaire was further used to evaluate the confidence level of road users concerning informal communication. The data were analysed via regression analysis to establish the relationship between traffic accidents and miscommunication between drivers. The information gathered and analysed from this study helps to understand the informal communication types between drivers and establish where communication loss exists, which ultimately leads to a traffic accident. The results also show that misinterpretation of communication signals can present the possibility of traffic safety risk.

This is a methodological contribution to reference mode development in system dynamics model conceptualization. Existing behavior mode taxonomies-developed for various modeling phases-provide no comprehensive method for mode classification based on an exhaustive set of mutually exclusive modes, and derivation of questions the simulation model should answer. Novice modelers need such guidance. The article proposes a conceptual framework for systemic behavior with a hierarchical taxonomy of elementary, composite, and overlaid modes. A structured method identifies the intervals of each respective mode, orders them into episodes and then condenses the variables’ episodes to systemic episodes. Each transition then gives rise to a fundamental question for the model under development. Three classical cases illustrate the application and contrast the proposed taxonomy to others in the extant literature. The article then discusses some validation criteria referring to reference modes and their link to the dynamic hypothesis, current limitations, and questions for further research.

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed point problems) with quasi-pseudocontractive mappings in real Hilbert spaces, which special cases can be found in many important engineering practical applications such as image recognizing, signal processing and machine learning. In order to solve HVIPs of potential application value, inspired by the primal-dual algorithm, we propose a novel accelerated cyclic iterative algorithm that combines the inertial method with a correction term and a self-adaptive step-size technique. Our approach eliminates the need for prior knowledge of the bounded linear operator norm. Under appropriate assumptions, we establish strong convergence of the algorithm. Finally, we apply our novel iterative approximation to solve multiple-set split feasibility problems and verify the effectiveness of the proposed iterative algorithm through numerical results.

Considering the unquestionable role of education in economic development, it has an impact at a macroeconomic level—contributing to enhancing productivity and innovation, reducing poverty and promoting social cohesion—and at a personal level—ensuring the improvement of knowledge, skills and individual capabilities and promoting social values like empowerment and equality. Notably, quality education is recognized as one of the Sustainable Development Goals (SDGs), which, jointly with other behaviors and attitudes, could impact the development of societies in other fields like health and well-being, cultural preservation, environmental sustainability and even peace and stability—all of them also listed as SDGs. However, the capacity, or not, to reach higher levels of compliance with quality in education (SDG 4) varies from country to country, according to the 2023 Sustainable Development Report results. Thus, the present study used a fuzzy set qualitative comparative analysis to assess the conditions for attaining higher levels of quality education based on the different indicators used to measure SDG 4. The analysis will allow comparisons of results among different countries and provide information about the initiatives that could be relevant to increasing quality education worldwide and for policymakers.

We are of the opinion that during the design of a binary classifier one ought to consider adding an “I don’t know” answer. We provide the case for the introduction of this third category when a human needs to make a decision based on the answer from a binary classifier. We discuss the costs and potential benefits of its introduction. Colloquially, we have used the term “I don’t know”, but formally we refer to it as NotAvailable. A procedure to define NotAvailable predictions in binary classifiers, called all leave-one-out models (ALOOM), is presented as proof of the concept. Furthermore, we discuss the potential benefits of applying ALOOM in real life applications.

This paper presents the prelaunch radiometric calibration of the Ozone Monitor Suite - Nadir (OMS-N) instrument, a vital payload on the FY-3F satellite. FY-3F achieved a successful launch on August 3, 2023. The radiance calibration of the OMS-N instrument was achieved using an integrating sphere, with known exit radiance ascertained through a transferring radiometer. The calibration model incorporates six energy levels. The Solar Simulator Standard System was employed to validate the calibration results, selecting specific rows to represent varying spatial dimensions. Considering the influence of xenon lamp characteristic peaks and transmission errors during the calibration process, the average deviation remained within 2.3% for the UVIS channel, 3% for the UV1 channel, and 2.2% for the UV2 channel. Furthermore, this study analyzed the uncertainty of the radiometric calibration. The results indicated an absolute uncertainty of 2.32% for both UV1 and UV2 channels, while the VIS channel exhibited an uncertainty of 1.67%. The relative uncertainty was 1.84% for both UV1 and UV2 channels, with the VIS channel exhibiting an uncertainty of 1.45%. The obtained calibration coefficients are accurate and reliable and can be used for the inversion of product parameters, which is of great significance to the quantitative application of satellite data and the advancement of scientific research on quantitative remote sensing.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

. In this paper, we introduce a series of definitions of generalized affine functions for vector-valued functions. We prove that our generalized affine functions have some similar properties with generalized convex functions. We present examples to show that our generalized affinenesses are different from one another, and also provide an example to show that our definition of presubaffinelikeness is non-trivial; presubaffinelikeness is the weakest generalized affineness introduced in this article. We work with optimization problems that are defined and taking values in linear topological spaces. We devote to the study of constraint qualifications, and derive some optimality conditions as well as a strong duality theorem. Our optimization problems have inequality constraints, equality constrains and abstract constraints; our inequality constraints are generalized convex functions and equality constraints are generalized affine functions.

Optimal dividend payment under a ruin constraint is a two objective control problem which—in simple models—can be solved numerically by three essentially different methods. One is based on a modified Bellman equation and the policy improvement method (see Hipp C., 2003). In this paper we use explicit formulas for running allowed ruin probabilities which avoid a complete search and speed up and simplify the computation. The second is also a policy improvement method, but without the use of a dynamic equation (see Hipp C., 2003). It is based on closed formulas for first entry probabilities and discount factors for the time until first entry (see Hipp C., 2016). Third a new, faster and more intuitive method which uses appropriately chosen barrier levels and a closed formula for the corresponding dividend value. Using the running allowed ruin probabilities, a simple test for admissibility—concerning the ruin constraint—is given. All these methods work for the discrete De Finetti model and are applied in a numerical example. The non stationary Lagrange multiplier method suggested in (see Hipp C., 2016), Section 2.2.2 does also yield optimal dividend strategies which differ from those in all other methods, and Lagrange gaps are present here. These gaps always exist in De Finetti models, see (see Hipp C., 2017).

Hybrid power plants have recently emerged as reliable and flexible electricity generation stations by combining multiple renewable energy sources, energy storage systems (ESS), and fossil-based output. However, the effective operation of the hybrid power plants to ensure continuous energy dispatch under challenging conditions is a complex task. This paper proposes a dispatch engine (DE) based on mixed-integer linear programming (MILP) for the planning and management of hybrid power plants. To maintain the committed electricity output, the dispatch engine will provide schedules for operation over extended time periods as well as monitor and reschedule the operation in real-time. Through precise prediction of the PV and wind power output, the proposed approach guarantees optimum scheduling. The precise prediction of the PV and wind power are achieved by employing a predictor of Feed-Forward Neural Network (FFNN) type. With such a dispatch engine, the operational cost of the hybrid power plants, and the use of diesel generators (DGs) are both minimized. A case study is carried out to assess the proposed dispatch engine feasibility. A real-time measurement data pertaining to load, wind, and PV power outputs is obtained from different locations in the Sultanate of Oman. The real-time data is utilized to predict the future output power from PV and the Wind farm over 24 hours. The predicted powers are then used in combination with a PV-Wind-DG-ESS-Grid hybrid plant to evaluate the performance of the proposed dispatch engine. The proposed approach is implemented and simulated using MATLAB. The results of the simulation reveal the proposed Feed-Forward Neural Network’s (FFNN) powerful forecasting abilities. In addition, the results demonstrate that adopting the proposed DE can minimize the use of DG units and reduce plant running expenses.

This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UNMPVC) via convexificators. Using the properties of convexificators, we introduce generalized standard Abadie constraint qualification (in short, GS-ACQ) for the considered problem UNMPVC. Moreover, we introduce generalized robust version of nonsmooth stationary conditions, namely, weakly stationary point (in short, RW-Stationary), T-stationary point (in short, RT-Stationary), M-stationary point (in short, RM-Stationary) and S-stationary point (in short, RS-Stationary) for UNMPVC. By employing GS-ACQ, we establish that the RS-Stationary is the necessary first-order optimality condition for a local Pareto solution of UNMPVC. Moreover, under generalized convexity assumptions, we establish sufficient optimality criteria for UNMPVC. Furthermore, we formulate the Wolfe-type (in short, WRD) and Mond-Weir-type (in short, MWRD) robust dual models corresponding to the primal problem UNMPVC.

The aim of this article is to introduce the new notion on a given graph. The notions of valued set, valued function, valued graph and valued quotient are introduced. The attributes of these new notions are studied. Valued set is about the set of vertices which have the maximum number of neighbors. The kind of partition of the vertex set to the vertices of the valued set is introduced and its attributes are studied. The behaviors of classes of graphs under these new notions are studied and the algebraic operations on these sets in the different situations get new result to understand the classes of graphs, these notions and the general graphs better and more.

The article presents a model for optimizing biomass supply chains using the linear programming framework integrated with a Geographic Information System. Based on the distance from a given type of biomass resource, its calorific value, price, and transportation costs, the model identifies the optimal source of biomass, allowing it to cover the demand for the required total energy value with the lowest possible costs. The case study includes the Połaniec power plant in southeastern Poland and potential sources of forest biomass and agricultural straw within 100 km of the plant. Unit costs of biomass varied depending on biomass availability and energy demands. For energy demand on the level of 1 PJ yearly, the lowest unit costs of biomass (4.08 €/MJ) were when all kinds of biomass were available, and the highest (5.47 €/MJ) was when only stacked wood was available. As energy demand increased, unit costs increased, and the ability to meet this demand with just one type of biomass decreased. The energy biomass sector can utilize the model to benefit both biomass producers and their final buyers.

Memristor has attracted a lot of interest due to its high processing speed, low power consumption and high integration ability, which is critical for electronic systems and memory-centric computing. However, the memristor programming circuit and strategy are still inflexible and complex, since the signal generator/collector and stimulate pulse must be carefully matched and designed based on memristor intrinsic characteristics without reconfigurable. Here, a simple and effective circuit only consists a parallel reference-resistor-and-NMOS is designed to program memristor with a more than 99% memristance precision. And the amplitude and width of stimulate pulse are fixed to ±4V and 5ms, respectively. In order to cope with the device variation, such as ±10% tolerance of transition voltage, an optimized programming strategy was proposed and demonstrated great robustness. Additionally, a set of reference resistors and NMOSs have been added to facilitate multi-level memristance operation without requiring any changes to the circuit structure. This program circuit was also employed to program memristor crossbar remains 99% precision. In the end, a memristor-based convolutional neural network which controlled by our optimized programming circuit was used for image recognition, and 89.36% accuracy can be achieved even under 15.8% memristance tolerance. This novel circuit demonstrates a simple and flexible strategy in memristor programming, providing a new way to control memristor crossbar for practical application.

Newborn screening (NBS) is hailed as a public health success, but little is known about long-term outcomes following a positive newborn screen. There has been difficulty gathering long-term follow-up (LTFU) data consistently, reliably, and with minimal effort. Six programs developed and tested a core set of minimal LTFU data elements. After an iterative data collection process and the development of a data collection tool, the group agreed on minimal LTFU data elements. The denominator captured all infants with an NBS diagnosis, accounting for children who moved or died prior to the follow-up year. They also agreed on three LTFU outcomes: if the child was still alive, had contact with a specialist, and received appropriate care specific to their diagnosis within the year. The six programs representing NBS public health programs, clinical providers, and research programs provided data across multiple NBS disorders. In 2022, 83.8% (563/672) of the children identified by the LTFU programs were alive and living in the jurisdiction; of those, 92.0% (518/563) saw a specialist, and 87.7% (494/563) received appropriate care. The core LTFU data elements can be applied as a foundation to address the impact of early diagnosis by NBS within and across jurisdictions.

This paper introduces the implementation of a genetic programming (GP)-based procedure to the automatic design and tuning of process controllers. The proposed approach makes a significant contribution to the field of artificial intelligence (AI) in control engineering. Unlike other controller design methods, the GP-based program handles the entire design in the time domain, including differential operations like derivatives and integrals, without the need for intermediate inverse Laplace transformation. This approach not only simplifies the design process but also ensures that all generated controllers are implementable in physical systems. Furthermore, GP’s functions set includes various mathematical operations beyond basic arithmetic operators, such as trigonometric, exponential, and logarithmic operators. The performance and validity of the resulting controllers generated by the proposed GP-based approach are evaluated by verifying whether the generator can replicate the structure and performance of those produced by traditional controller design methods and, in some cases, achieve even better results. As a result, the GP-based approach presents a promising solution for automating the controller design process and addressing control problems in various engineering applications.

Different organisms, cell types, and even similar cell lines can dramatically differ in resistance to genotoxic stress. This testifies to the wide opportunities for genetic and epigenetic regulation of stress resistance. These opportunities could be used to increas the effectiveness of cancer therapy, develop new varieties of plants and animals, and search for new pharmacological targets to enhance human radioresistance, for example, for -manned deep space expeditions. Based on the comparison of transcriptomic studies in cancer cells, in this review we propose that there is a high diversity of genetic mechanisms of development of genotoxic stress resistance. This review focused onpossibilities and limitations of the proposed regulation of the resistance of normal cells whole organisms to genotoxic and oxidative stress by overexpressing of stress-response genes. Moreover, the existing experimental data on the effect of such overexpression on the resistance of cells and organisms to various genotoxic agents has been analyzed and systematized. We suggest that the recent advances in the development of multiplex and highly customizable gene overexpression technology that utilizes the mutant Cas9 protein and the wealth of available data on gene functions and their signal networks open new opportunities for research in this field.

The author previously investigated the thermodynamic properties of the one-dimensional Potts-SOS model on the lattice of positive natural numbers N in [Akin H, Phys. Scr. 99 (2024), 055231]. In this present paper, we extend that research by determining the Gibbs measures for the same mixed-type model using partition functions constructed on a second-order semi-infinite Cayley tree. By leveraging the self-similarity of the Cayley tree, we analyze the behavior of these partition functions and identify the regions where phase transitions occur. We pinpoint these phase transition regions through a stability analysis of the dynamical system associated with the model at specific fixed points.

New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having no edge amid vertices in a set is a key type of approach to have these notions namely neutrosophic independent number and independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which doesn’t have some vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S aren’t endpoints for an edge, simultaneously; independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S aren’t endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Independent Number,” and “Setting of Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic independent number and independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, either odd indexes or even indexes, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, either odd indexes or even indexes, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices containing one vertex leads us to neutrosophic independent number and independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding (four) vertices from one part as possible makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding vertices from all parts but one part, makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic independent number and independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic independent number but the neutrosophic cardinality of a set has eligibility to call independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have connection amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

A sparse language is a formal language such that the number of strings of length $n$ is bounded by a polynomial function of $n$. We create a class with the opposite definition, that is a class of languages that are dense instead of sparse. We define a dense language on $m$ as a formal language (a set of binary strings) where there exists a positive integer $n_{0}$ such that the counting of the number of strings of length $n \geq n_{0}$ in the language is greater than or equal to $2^{n - m}$ where $m$ is a real number and $0 < m \leq 1$. We call the complexity class of all dense languages on $m$ as $DENSE(m)$. We prove that there exists an $\textit{NP--complete}$ problem that belongs to $DENSE(m)$ for every possible value of $0 < m \leq 1$.

Hash tables are widely used. They rely on good quality hash functions. Popular data structure libraries either provide no hash functions or weak hash functions for sets or maps, making it impossible or impractical to use them as keys in other tables. This article presents three algorithms for hashing a set, two of which are simple to implement, practically fast, and can be combined. The quality evaluations follow the method of [1, chapter 2]. The insight that we are looking for commutative semigroups suggests that even better methods than symmetric polynomials may be found.

Camera malfunctions or loss of storage elements in imaging devices may lead to loss of important image information or random impulse noise interference. Low rank is one of the important prior information in image optimization processing. This paper uses different low-rank constraint models of the image matrices to recover the impulse interference satellite images. Firstly, an overview of image inpainting models based on nuclear norm, truncated nuclear norm, weighted nuclear norm, and matrix-factorization-based F-norm is presented, and corresponding optimiza-tion iterative algorithms are provided. Then, we conducted experiments under three types of pulse interference and provided visual and numerical results. Finally, it is concluded that the WSVT_ADMM method based on the weighted nuclear norm can obtain the best image inpainting results; The UV_ADMM method based on F norm of matrix factorization has the least computa-tion time and can be used for large-scale low-rank matrix computation; The WSVT_ADMM method based on weighted nuclear norm and the TSVT_ ADMM method based on truncated nuclear norms can significantly improve the repair effect compared to the nuclear norm-based methods such as SVT, SVP, and n_ADMM.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

Microalgae biomass is a budding raw material for the origination of food, fuel, and other value-added products. However, bulk production of microalgal biomass at commercial level is a herculean task for the current microalgal mass production technologies due to the undesirable contaminations by biological pollutants. These contaminants hamstring the production of microalgae biomass by debilitating the growth of cultures, crumble the quality of biomass and sometimes may crash the whole culture. The best utilization of the microalgae biomass at industrial level could be attained by avoiding various possible biological contaminations in mass cultivation system, understanding the contamination mechanisms, and the complex interactions of algae with other microorganisms. This review explores the various types of biological pollutants, their possible mode of infection along with mechanisms, different controlling methods to maintain desired microalgae culture.

An inverse aeroacoustic problem for a helicopter rotor combined with aerodynamic constraint is proposed based on Ffowcs Williams and Hawkings equation in subsonic. The rotor noise includes thickness noise and loading noise when quadrupole noise is neglected. Thickness noise is related to geometry and motion conditions. Loading noise is related to the pressure on the wall. Therefore, the equation between pressure on the wall and far-field noise can be established, thus the pressure on the wall can be obtained by solving this equation. Since this equation is an ill-posed, the singular value decomposition combined with the regulation method is applied and the aerodynamic constraint is taken into account. The direct noise prediction is verify firstly and then the inverse problem is solved. The reconstruction pressure is compared to the input data. The result is in good agreement with the input value. At the same time, the influence of interference noise is also considered. Under low signal-to-noise ratio, the reconstruction result is also reasonable.

This paper presents a case study on using Emacs and Org-mode for literate programming in undergraduate data science courses. Over three academic terms, the author mandated these tools across courses in R, Python, C++, SQL, and more. Onboarding relied on simplified Emacs tutorials and starter configurations. Students gained proficiency after initial practice. Live coding sessions demonstrated the flexible instruction enabled by literate notebooks. Assignments and projects required documentation alongside functional code. Student feedback showed enthusiasm for learning a versatile IDE, despite some frustration with the learning curve. Skilled students highlighted efficiency gains in a unified environment. However, uneven adoption of documentation practices pointed to a need for better incorporation into grading. Additionally, some students found Emacs unintuitive, desiring more accessible options. This highlights a need to match tools to skills levels, potentially starting novices with graphical IDEs before introducing Emacs. Key takeaways include literate programming aids comprehension but requires rigorous onboarding and reinforcement; Emacs excels for advanced workflows but has a steep initial curve. With proper support, these tools show promise for data science education.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

Silybin is a natural compound extensively studied for its hepatoprotective, neuroprotective and anti-cancer properties. Envisioning the enhancement of silybin potential by suitable modifications in its chemical structure, here, a series of new 7-O alkyl silybins derivatives were synthesized by Mitsunobu reaction starting from the silybins and tyrosol-based phenols, such as tyrosol (TYR, 3), 3-methoxytyrosol (MTYR, 4) and 3-hydroxytyrosol (HTYR, 5). This research sought to explore the antioxidant and anticancer properties of new eighteen derivatives and their mechanisms. In particular, the antioxidant properties of new derivatives outlined by DPPH assay, showed a very pronounced activity depending on the tyrosyl moiety (HTYR&gt;MTYR&gt;&gt;TYR). A significant contribution of the HTYR moiety was observed for silybins and 2,3-dehydro-silybin based derivatives. According to the very potent antioxidant activity, 2,3-dehydro-silybin derivatives 15ab, 15a and 15b exerted the most potent anticancer activity in human prostate cancer PC-3 cells. Furthermore, flow cytometric analysis for cell cycle and apoptosis revealed that 15ab, 15a and 15b induce strong G1 phase arrest and increase late apoptotic population in PC-3 cells. Additionally, western blotting for apoptotic marker cleaved caspase-3 confirmed apoptosis induction by these silybin derivatives in PC-3 cells. These findings hold significant importance in the investigation of anticancer properties of silybin derivatives and strongly encourage swift investigation in pre-clinical models and clinical trials.

In this paper, we study the constrained minimization problem for an energy functional which is related to the following Kirchhoff type equation \begin{equation*} -\Big(\eta+b\big(\int_{\R^{3}}|\nabla u|^{2}dx\big)^{s}\Big)\Delta u+V(x)u=\mu u +\lambda|u|^{p}u,\end{equation*} where $b$ is a positive constant, parameters $\eta\geq0, \lambda>0$, exponents $s>0$, $0

Carbon nanotube (CNT) yarns are fiber-like materials that exhibit excellent mechanical, electrical and thermal properties. More importantly, they exhibit a piezoresistive response that can be tapped for sensing purposes. The objective of this study is to determine experimentally the piezoresistive response of CNT yarns that are embedded in a polymeric medium while subjected to either compression or tension, and compare it with that of the free or unconstrained CNT yarns. The rationale for this study is the need to know the response of the CNT yarn while in a medium, which provides a lateral constraint to the CNT yarn thus mimicking the response of integrated CNT yarn sensors. The experimental program will include the fabrication of samples and their electromechanical characterization. The CNT yarns are integrated in polymeric beams and subjected to four-point bending, allowing the determination of their response under tension and compression. The electrical resistance data from an Inductance-Capacitance-Resistance (LCR) device is used with the data acquired from the mechanical testing system to determine the piezoresistive response of the CNT yarns. This data and information will be used for future modeling efforts and to study the phenomena that occur when CNT yarns are integrated in polymeric and composite materials and structures.

Deep learning has achieved lots of successes in many fields, but when trainable sample are extremely limited, deep learning often under or overfitting to few samples. Meta-learning was proposed to solve difficulties in few-shot learning and fast adaptive areas. Meta-learner learns to remember some common knowledge by training on large scale tasks sampled from a certain data distribution to equip generalization when facing unseen new tasks. Due to the limitation of samples, most approaches only use shallow neural network to avoid overfitting and reduce the difficulty of training process, that causes the waste of many extra information when adapting to unseen tasks. Euclidean space-based gradient descent also make meta-learner's update inaccurate. These issues cause many meta-learning model hard to extract feature from samples and update network parameters. In this paper, we propose a novel method by using multi-stage joint training approach to post the bottleneck during adapting process. To accelerate adapt procedure, we also constraint network to Stiefel manifold, thus meta-learner could perform more stable gradient descent in limited steps. Experiment on mini-ImageNet shows that our method reaches better accuracy under 5-way 1-shot and 5-way 5-shot conditions.

This paper presents an alternative constraint handling approach within a specialized genetic algorithm (SGA) for the optimal reactive power dispatch (ORPD) problem. The ORPD is formulated as a nonlinear single-objective optimization problem aiming to minimize power losses while keeping network constraints. The proposed constraint handling approach is based on a product of sub-functions that represents permissible limits on system variables and that includes a specific goal on power loss reduction. The main advantage of this approach is the fact that it allows a straightforward verification of both feasibility and optimality. The SGA is examined and tested with the proposed constraint handling approach and the traditional penalization of deviations from feasible solutions. Several tests are run in the IEEE 30, 57, 118 and 300 bus test power systems. The results obtained with the proposed approach are compared to those offered by other metaheuristic techniques reported in the specialized literature. Simulation results indicate that the proposed genetic algorithm with the alternative constraint handling approach yields superior solutions when compared to other recently reported techniques.

In order to understand the hot deformation behavior of novel Cu/Al laminated composites, isothermal hot compression tests were conducted by Gleeble-1500D thermo-mechanical simulator. And the effect of bonding interface, deformation temperature and strain rate on the deformation behavior was analyzed. Results show that under the interface constraint effect, soft Al layer trends to flow synchronously with hard Cu layer. And further microstructure examinations indicate the cooperative deformation capability of Cu/Al composites increases with increasing stain rate and decreasing deformation temperature. Strain hardening exponent, calculated based on the true stress-true strain data, also proves the effect of deformation temperature and strain rate on the cooperative deformation behavior. Meanwhile, unique composites structure allows the Al matrix to exhibit the characteristic of dynamic recrystallization during the hot deformation process. Lastly, strain compensated Arrhenius-type constitutive equation was employed to describe the coupling effect of temperature, strain rate and strain on the flow stress.

We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}

In this paper, we propose the set-membership quaternion normalized least-mean-square (SM-QNLMS) algorithm. For this purpose, first, we review the quaternion least-mean-square (QLMS) algorithm, then go into the quaternion normalized least-mean-square (QNLMS) algorithm. By having the QNLMS algorithm, we propose the SM-QNLMS algorithm in order to reduce the update rate of the QNLMS algorithm and avoid updating the system parameters when there is not enough innovation in upcoming data. Moreover, the SM-QNLMS algorithm, thanks to the time-varying step-size, has higher convergence rate as compared to the QNLMS algorithm. Finally, the proposed algorithm is utilized in wind profile prediction and quaternionic adaptive beamforming. The simulation results demonstrate that the SM-QNLMS algorithm outperforms the QNLMS algorithm and it has higher convergence speed and lower update rate.

This paper is regarding design and program an Micro-controller Arduino Uno board by using Arduino software to work as a photo-sensor(Active) single axial solar tracker system(SASTS). A solar panel, two photo-resistors (LDR) in two sides (north/south) of the photo-voltaic(PV) and a servo motor are connected to the Uno board, which is running a code that prepared by Arduino software IDE in advanced then it works as a tracking system. Here, the LDRs send the signal of presence or absence of the light to the board and based on that sent signal the Uno reflects a new signal to the servo motor to rotate and finds the light source. Lastly, the photo-sensor single axis tracker is made while Continuously, the system tries to face the panel to the sun and whilst changing the irradiance intensity it starts searching to find the angle of highest irradiance. Based on results that are extracted from the data, the tracker system significantly boosts the output efficiency of the solar panel. By using the Micro-controller Uno board, LDRs, servo motor and special designed mechanical base, the tracking system is constructed, based on acquired data the influence of the STS on the increasing the solar panel efficiency is more obvious. Significantly, the tracker system rises the efficiency of the PV .

Vulnerability is the big issue of the small inland urban centers exposed to the risk of depopulation. In the climate and in the context of an increasing seismic risk in the center-northern part of Italy, seismic vulnerability can become the determinant cause of the final abandonment of a small town. In some Italian regions, as well as Emilia Romagna, municipalities are implementing seismic vulnerability reduction policies based on the Emergency Limit Condition that has become a basic reference for ordinary land planning. This study proposes a valuation planning approach to the seismic vulnerability reduction carried out within the general planning framework concerning the Faentina Union, a group of five small towns located in the south-western part of the Province of Ravenna, Italy. The approach consists of three main stages: knowledge – the typological, constructive and technological description of the buildings specifically concerning their vulnerability degree; interpretation – the analyses aimed to outline a range of hypotheses about the damages in case of seism; planning – identifying the works intended to definitely reduce the vulnerability of the buildings. This stage includes a cost modelling tools aimed at outlining the trade-off between the extension and the intensity of the vulnerability reduction works, given the budget.

The Absorbing Aerosol Sensor (AAS) is carried on the Gao Fen 5B (GF-5B) satellite, which allows for measuring the solar backscatter radiation by the atmosphere in UV-VIS wavelength. AAS is an imaging spectrometer using CCD for capturing both continuous spectrum and the cross-track orientation with a 114° wide swath. The broad field-of-view provides daily global envelopment with a 4 km spatial resolution at the nadir. This paper mainly analyzed the initial working status of the instrument in orbit, including wavelength calibration, radiation calibration, detector performance, and product availability. Preliminary observations indicate that the AAS can monitor the absorbing aerosol like dust, biomass burning, volcano ash, and some pollution aerosol and can identify the aerosol events in China and other regions with high spatial resolution.

The oral route remains one of the most popular and important routes of administration that warrants the development of advanced drug delivery systems such as the polymeric nanoparticles capable of enhancing the absorption and bioavailability of the used drugs. In this work, systematic reviewing through several databases followed by a meta-analysis study were utilized in order to navigate the published studies and reach literature-based evidence about the capability of polymeric nanoparticulate systems of augmenting the absorption and the bioavailability of the orally administered drugs. The pharmacokinetic parameter; area under the curve (AUC) was utilized as the “effect” of the meta-analysis study. The meta-analysis study demonstrated the significant increase AUC as compared to the conventional formulations. Furthermore, comparing the synthetic polymeric nanoparticles versus the naturally-based counterparts, as subgroups of the meta-analysis, revealed no significant differences.

Students in their first year of computer science (CS1) at universities typically struggle to grasp programming concepts. This paper covers research using a Java programming language-guided visual execution environment (VEE) to teach CS1 students about programming concepts. The topics covered include input and output, conditionals, loops, functions, arrays, recursion, and files, all of which are covered in an introductory programming course. The VEE walks beginner programmers through the fundamentals of programming, utilizing visual metaphors to explain and direct interactive Java tasks. The primary goal of this study is to determine whether a cohort of 105 CS1 students from four different groups who are enrolled in two universities—one in Madrid, Spain, and the other in Galway, Ireland—can advance their programming abilities under the guidance of the VEE. Second, does the improvement vary depending on the programming concept? The findings demonstrate that students' programming knowledge has greatly increased. This improvement is significant for all programming concepts, while it is more pronounced for some topics than others, such as operators, conditionals, and loops. Additionally, it demonstrates that students had little prior understanding of files and recursion. The most well-known concept to them was the sequence concept.

The focus of this paper is on analyzing the role and the choice of parameters in sociophysics diffusion models, by leveraging the potentialities of sociophysics from a mathematical programming perspective. We first present a generalised version of Galam’s opinion diffusion model (see, e.g. , ). For a given selection of the coefficients in our model, this proposal yields the original Galam’s model. The generalised model suggests guidelines for possible alternative selection of its parameters that allow to foster diffusion. Examples of the parameters selection process as steered by numerical optimisation, taking into account various objectives, are provided.

Electricity distribution network operators face several operational constraints in the provision of safe and reliable power given that investments for network area reinforcement must be commensurate with improvements in network reliability. This paper provides an integrated approach for assessing the impact of different operational constraints on distribution network reliability by incorporating component lifetime models, time-varying component failure rates as well as the monetary cost of customer interruptions in an all-inclusive probabilistic methodology that applies a time-sequential Monte Carlo simulation. A test distribution network based on the Roy Billinton test system is modelled to investigate the system performance when overloading limits are exceeded as well as when preventive maintenance is performed. Standard reliability indices measuring the frequency and duration of interruptions, and the energy not supplied are complemented with a novel monetary reliability index. The comprehensive assessment includes not only average indices but also their probability distributions to adequately describe the risk of customer interruptions. Results demonstrate the effectiveness of this holistic approach as the impacts of operational decisions are assessed from both reliability and monetary perspectives. This informs network planning decisions through optimum investments and consideration of customer outage costs.

: Following the phenomenal growth of and competition among coffee chain retailers, the coffee chain market has expanded substantially thanks to rising income levels, the increasing young population, and rapidly changing lifestyles. Attracting consumers’ attention and enhancing their loyalty behaviors have become very difficult for coffee chain retailers. This study seeks to understand the mechanisms through which emotions and the dedication-constraint model lead to brand loyalty and willingness to pay more to certain coffee chain retailers. Emotions and the dedication-constraint model are major factors in the research, but few studies have combined them to examine the formation of loyalty behaviors. This study synthesizes emotional responses and the dedication-constraint model to develop a theoretical model. Based on the ambivalent view of emotions, it also examines how positive and negative emotions affect the combination of brand loyalty and willingness to pay more to certain coffee chain retailers. Moreover, it identifies the antecedents of affective and calculative commitments in the context of coffee chain retailers. Our findings indicate that loyalty behaviors (dedication- and constraint-based mechanisms from brand loyalty and willingness to pay more to certain coffee chain retailers), emotional responses, and affective and calculative commitments significantly affect brand loyalty directly and indirectly through both positive and negative emotions. Furthermore, service quality, physical environment quality, and price fairness significantly affect affective commitments, while price fairness significantly affects both affective and calculative commitments. Finally, affective and calculative commitments significantly affect willingness to pay more, both directly and indirectly, through positive emotions and affect it directly through negative emotions. The results’ theoretical and managerial implications and possible future research directions are discussed.

With the renewed interest for lunar surface exploration, the European Space Agency envisions to stimulate the creation of lunar communications and navigation services (LCNS) to enable, among others, autonomous navigation capabilities for lunar rovers. As the number of satellites foreseen in such a service is much smaller compared to Earth based global navigation satellite systems (GNSS), different complementary technologies are pursued to improve the attainable navigation accuracy for lunar rovers. One way to improve the position accuracy provided by the LCNS satellites is to constrain the vertical position using a high resolution digital elevation model (DEM). This article presents the results of a variance covariance analysis of an extended Kalman filter (EKF) implementation in which the LCNS ranging measurements are used together with DEM from the LRO LOLA instrument. Assuming a realistic orbit determination and time synchronization (ODTS) accuracy of the LCNS satellites, the usage of a navigation grade IMU and an oven controlled crystal oscillator (OCXO), a 3-sigma position accuracy of less than 10 meters can be obtained. Furthermore, the availability is substantially improved as the DEM aided solution enables a position solution in case of only 3 visible satellites.

This proposal advocates using energy states as fundamental units for quantum computer programming. Each programming unit is conceptualized as an energy state, manifested as an essence-unit. The essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach allows recording various forms of matter on quantum computers in essence-units representing their energy states. Recording energy states is achieved through the creation of four distinct coherent potentials facilitated by quantum dots or crystals. It is crucial to note that these energy states, embodied in essence-units, cannot be subdivided. The study examines the intricate relationship between similarity, fractals, and uniqueness in quantum dot operations, elucidating their profound implications for information transfer efficiency. Normalized entropy quantifies the charge localization in quantum dot impurities in systems exhibiting distortions. Utilizing N-level recording and entropy-fractal dimension equivalence enables this paper to elucidate the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology represents a significant departure from the current state of quantum computing, offering unprecedented potential for overcoming previously intractable challenges.

This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.

Ranked Set Sampling (RSS) is a useful technique for improving the estimator of population mean when the sampling units in a study can be easily ranked than the actual measurement. RSS performs better than simple random sampling (SRS) when the mean of units corresponding to each rank is used. The performance of RSS can be increased further by assigning weights to the ranked observations. In this paper, we propose weighted RSS procedures to estimate the population mean of positively skew distributions. It is shown that the gain in the relative precisions of the population mean for chosen distributions are uniformly higher than those based on RSS. The gains in relative precisions are substantially high. Further, the relative precisions of our estimator are slightly higher than the ones based on Neyman’s optimal allocation model for small sample sizes. Moreover, it is shown that, the performance of the proposed estimator increases as the skewness increases by using the example of lognormal family of distributions.

A time interval only description necessarily needs its own independent definitions, without one moment time coordinates to it. In this paper derived are time interval only set properties, including commutation relations, addition, multiplication and derivatives. Time interval only set commutation relations, consistent with one moment time set properties, are introduced by defining correspondence relations for these sets. Time development and equilibrium within the time interval description depend on the well-known ‘mean velocity theorem’ and the time interval version of the Legendre transform. In contrast, usually applied is only the traditional vector and one moment time coordinate kinematic approach from Newton’s laws. The main results of this paper are correspondences and time interval only set commutation relations. All other properties are derived from these results, while for the time interval only set, different from the one moment time set the canonical property is not valid. The time interval only description can be applied assuming spherical symmetric star-source radiation propagation, with finite time intervals for realistic measurement events. From time development with (a-)symmetry of time intervals, and from Curie’s principle, change can be described with a set theoretic approach. Time interval only set properties include the time interval only version of Noether charges and structure constants. A time interval only description for wave propagation, including group-velocity, for zero and non-zero mass wave particles, relates to the properties of the time interval only set. A second result in terms of the time interval only description is propagation wave energy equivalence with gravitation energy, derived from time interval only set commutation relations. A time interval approach, however including one moment time description dependence, was introduced in earlier publications of this author. In part 1 investigated are the time interval only set and its properties, a forthcoming part 2 to application of the time interval only description to specific groups of stars as emission sources.

Obesity is a complex chronic disease characterized by excess of body fat. It represents a significant public health problem due to the health-related risk factors. There are growing evidences showing that maternal obesity can program the offspring, which influence neonatal phenotype and predispose offspring to a higher prevalence of metabolic disorders such as obesity. This increased risk may also be epigenetically transmitted across generations. Thus, there is an urgent need to find effective reprogramming approaches in order to resume normal fetal development. Polyphenols are bioactive compounds found in fruits and vegetables that exert their anti-obesity effect through its powerful anti-oxidant and anti-inflammatory activities. Polyphenols supplementation has been proven to counteract the deleterious effects of maternal obesity programming on offspring. Indeed, some polyphenols can cross the placenta and protect the fetal predisposition against obesity. The present review summarizes the effects of dietary polyphenols on obesity-induced maternal reprogramming as an offspring anti-obesity approach.

In this article, we consider a class of nonsmooth interval-valued multiobjective semi-infinite programming problems with vanishing constraints (in short, NIMSIPVC). We introduce the VC-Abadie constraint qualification (in short, VC-ACQ) for NIMSIPVC and employ it to establish Karush-Kuhn-Tucker (in short, KKT)-type necessary optimality conditions. Related to NIMSIPVC, we formulate interval-valued vector Lagrange type dual and scalarized Lagrange type dual problems. Subsequently, we establish weak, strong, and converse duality results relating NIMSIPVC and corresponding dual problems. In addition, we introduce the notions of saddle points for interval-valued vector Lagrangian and scalarized Lagrangian of NIMSIPVC. Moreover, we establish the saddle point optimality criteria for NIMSIPVC. Various non-trivial examples are provided to demonstrate the validity of established results. To the best of our knowledge, optimality conditions, Lagrange type duality, and saddle point optimality criteria for NIMSIPVC have not been investigated yet via Clarke subdifferentials.

High-precision dynamic positioning of highway vehicles is the foundation and prerequisite for achieving intelligent connected transportation. For the shortcomings of GNSS/INS combination and GNSS/INS/OD combination in tunnel vehicle positioning, this paper proposes a tunnel vehi-cle positioning method of GNSS/INS/OD combination based on lateral distance measurement and lane constraint. Firstly, lateral distance measurement of vehicles inside the tunnel is conducted based on laser radar point cloud data. Secondly, map matching positioning is performed based on lateral distance measurement, odometer, and lane markings. Experimental results demonstrate that for a 4.6 km tunnel, the average absolute error of lateral positioning is 0.294 meters, and the longitudinal positioning error is no more than 0.6 meters, which can effectively meet practical operational requirements.

Continuous Distributed Constraint Optimization Problem (C-DCOPs) are a powerful framework to model problems with continuous variables in multi-agent systems. Previous works about C-DCOP algorithms mainly use pseudo-trees to guarantee the anytime property or are without anytime property guarantees. However, there is a risk of privacy leakage in the pseudo-tree due to utility passing between agents. Therefore, based on the basic constraint graph instead of the pseudo-tree, we (i) extend the Maximum Gain Message (MGM) algorithm by combining the local search strategy to solve C-DCOPs, named Continuous MGM (C-MGM), and it’s able to guarantee the monotonicity of the solution quality; (ii) propose a Parallel C-MGM (C-PMGM) algorithm to improve the solution quality through parallel random search; and (iii) introduce the differential search into C-PMGM to design a Parallel Differential Search C-MGM (C-PDSM) algorithm, which constructs a heuristic method to speed up convergence and improve solution quality. Compared to other anytime C-DCOP algorithms using pseudo-trees, the proposed three algorithms can exhibit better performance in avoiding privacy violations. We theoretically prove that the proposed algorithms are the anytime algorithms and empirically demonstrate that our algorithms outperform the state-of-the-art C-DCOP algorithms.

Computers have evolved over the years and as the evolution continues, we have been ushered into an era where high-speed internet has made it possible for devices in our homes, hospital, energy and industry to communicate with each other. This era is what is known as the Internet of Things (IoT). IoT has several benefits in the health, energy, transportation and agriculture sectors of a country’s economy. These enormous benefits coupled with the computational constraint of IoT devices which makes it difficult to deploy enhanced security protocols on them make IoT devices a target of cyber-attacks. One approach that has been used in traditional computing over the years to fight cyber-attacks is Intrusion Detection System (IDS). However, it is practically impossible to deploy IDS meant for traditional computers in IoT environments because of the computational constraint of these devices. In this regard, this study proposes a lightweight IDS for IoT devices using an incremental ensemble learning technique. We used Gaussian Naive Bayes and Hoeffding tree to build our incremental ensemble model. The model was then evaluated on the TON IoT dataset. Our proposed model was compared with other state-of-the-art methods proposed and evaluated using the same dataset. The experimental results show that the proposed model achieved an average accuracy of 99.98\%. We also evaluated the memory consumption of our model which showed that our model achieved a lightweight model status of 650.11KB as the highest memory consumption and 122.38KB as the lowest memory consumption.

At present, indoor localization is one of the core technologies of location-based services (LBS), and there exist numerous scenario-oriented application solutions. Visual features, as the main semantic information to help people understand the environment and thus occupy the dominant part, many techniques about indoor scene recognition are widely adopted. However, the engineering application problem of cell phone indoor scene recognition and localization has not been well solved due to insufficient semantic constraint information of building map and the immaturity of building map location anchors (MLA) matching positioning technology. To address the above problems, this paper proposes a cell phone indoor scene recognition and localization method with building map semantic constraints. Firstly, we build a library of geocoded entities for building map location anchors (MLA), which can provide users with "immersive" real-world building maps on the one hand and semantic anchor point constraints for cell phone positioning on the other. Secondly, using the improved YOLOv5s deep learning model carried on the mobile terminal, we recognize the universal map location anchors (MLA) elements in building scenes by cell phone camera video in real-time. Lastly, the spatial location of the scene elements obtained from the cell phone video recognition is matched with the building MLA to achieve real-time positioning and navigation. The experimental results show that the model recognition accuracy of this method is above 97.2%, and the maximum localization error is within the range of 0.775 m, and minimized to 0.5 m after applying the BIMPN road network walking node constraint, which can effectively achieve high positioning accuracy in the building scenes with rich MLA element information. In addition, the building map location anchors (MLA) has universal characteristics, and the positioning algorithm based on scene element recognition is compatible with the extension of indoor map data types, so this method has good prospects for engineering applications.

A basic pattern in the body plan architecture of many animals, plants and some molecular and cellular systems is five-part units. This pattern has been understood as a result of genetic blueprints in development and as a widely conserved evolutionary character. Despite some efforts, a definitive explanation of the abundance of pentagonal symmetry at so many levels of complexity is still missing. Based on both, a computational platform and a statistical spatial organization argument, we show that five-fold morphology is substantially different from other abundant symmetries like three-fold, four-fold and six-fold symmetries in terms of spatial interacting elements. We develop a measuring system to determine levels of spatial organization in 2D polygons (homogeneous or heterogeneous partition of defined areas) based in principles of regularity in a morphospace. We found that spatial organization of five-fold symmetry is statistically higher than all other symmetries studied here (three to ten-fold symmetries) in terms of spatial homogeneity. The significance of our findings is based on the statistical constancy of geometrical constraints derived from spatial organization of shapes, beyond the material or complexity level of the many different systems where pentagonal symmetry occurs.

This paper provides a data set collected with an underground shaft mobile mapping system equipped with rotated Velodyne VLP-16, Velodyne Ultra Puck VLP-32c, Livox Tele-15, and IMU Xsens MTi-30. The ground truth data was acquired with a geodetic survey including 15 ground control points and 6 Faro Focus 3D Terrestrial Laser Scanner stations of a total 273,784,932 of 3D measurement points. The aim of the paper is to describe the data set of a mining shaft. Obtained mobile mapping data can be the basis for detailed analyzes of the technical condition of the shaft. This data set provides an end-user case study of realistic applications in mobile mapping technology. It provides ground truth data, mobile mapping data and software tools for manipulation and visualization. The project is released and maintained at https://michalpelka.github.io/mine-mapping-dataset/.

For a set of closed curved surfaces that resemble a Langmuir monolayer an energy is defined that depends only on the curvature of the surfaces interacting with the dimensions normal to the surfaces, that is, the thickness of these surfaces. The thickness, or depth, of the surfaces originates because of surface-particles with chains, that move freely on the inside of the surfaces at a certain depth. This is a purely geometrical description that does not depend on the introduction of ad hoc constants like the elastic constant. With a statistical mechanical model the equations of state are calculated for a gas of non-connected sphere-like surfaces in a volume. There are two states of which the lower temperature state is depending mostly on the interaction energy and surface properties, and the higher temperature state is depending mostly on sphere kinetic and volume properties. This results in aggregation of the sphere-like surfaces from many small ones to few large ones when lowering temperature and vice versa. The model allows for the calculation of the partition function and, when the emergence of the curvature - depth interaction is described as a phase-transformation, for the application of Noether’s theorem. Because of these properties the model is interesting in its own right apart from being an addition to existing elastic descriptions of surfaces.

In the paper is described the control electronics for an industrial pneumatic – hydraulic system based on a low-cost PLC. The developed system is a hydraulic pulse system and it generates series of high pressure hydraulic pulses (max. 200 bar). We describe requirements, an overall concept of the embedded control system, user interface, security features and network connectivity. In the description of the software solution we describe implementation of hierarchical ordered program threads (multithreaded program) and main control state machine. At the conclusion, we describe the calibration method of the system and calibration curves and we present the schematic diagram and a photo of a functional prototype of the system.

The notion of oriented set is the basic elementary concept of the theory of changeable sets. The main motivation for the introduction of changeable sets was the sixth Hilbert problem, that is, the problem of mathematically rigorous formulation of the fundamentals of theoretical physics. In the present paper the necessary and sufficient condition of the existence of one-point time on an oriented set is established. From the intuitive point of view, one-point time is the time associated with the evolution of a system consisting of only one object (for example, from one material point). Namely, it is proven that the one-point time exists on the oriented set if and only if this oriented set is a quasi-chain. Also, using the obtained result, the problem of describing all possible images of linearly ordered sets is solved. This problem naturally arises in the theory of ordered sets.

The growing need to use renewable sources and the current difficulty in spreading the electricity grid in a widespread manner raise the question of how to respond to the need for more electricity immediately. The idea behind this study is to power a horizontal axis wind turbine with the air flow generated for cooling a stationary internal combustion engine. The power extracted from this solution is significantly lower than that of the internal combustion engine (about 0.3%) and could be advantageous only in limited contexts. Installation costs are limited because many elements deriving from wind variability can be removed or simplified.

Three computer algorithms are presented. One reduces a network $\CALN$ to its interior, $\CALI$. Another counts all the triangles in the network, and the last randomly generates networks similar to $\CALN$ given just its interior $\CALI$. But these algorithms are not the usual numeric programs that manipulate a matrix representation of the network; they are set-based. Union and meet are essential binary operators; contained_in is the basic relational comparator. The interior $\CALI$ is shown to have desirable formal properties and to provide an effective way of revealing ``communities'' in social networks.

Most of the existing influence maximization algorithms are not suitable for large-scale social networks due to their high time complexity or limited influence propagation range. Therefore, a D-RIS influence maximization algorithm is proposed based on the independent cascade model and combined with the reverse reachable set sampling. Under the premise that the influence propagation function satisfies monotonicity and submodularity, the D-RIS algorithm uses automatic debugging method to determine the critical value of the number of reverse reachable sets, which not only obtains a better influence propagation range, and greatly reduce the time complexity. The experimental results on the two real data sets of Slashdot and Epinions show that D-RIS algorithm is close to the CELF algorithm and higher than RIS algorithm, HighDegree algorithm, LIR algorithm and pBmH algorithm in influence propagation range. At the same time, it is significantly better than the CELF algorithm and RIS algorithm in running time, which indicates that D-RIS algorithm is more suitable for large scale social network.

In this paper, the set-membership affine projection (SM-AP) algorithm is utilized to censor non-informative data in big data applications. To this end, the probability distribution of the additive noise signal and the excess of mean-squared error (EMSE) in steady-state are employed in order to estimate the threshold parameter of the single threshold SM-AP (ST-SM-AP) algorithm aiming at attaining the desired update rate. Furthermore, by defining an acceptable range for the error signal, the double threshold SM-AP (DT-SM-AP) algorithm is proposed to detect very large errors due to the irrelevant data such as outliers. The DT-SM-AP algorithm can censor non-informative and irrelevant data in big data applications, and it can improve misalignment and convergence rate of the learning process with high computational efficiency. The simulation and numerical results corroborate the superiority of the proposed algorithms over traditional algorithms.

Recent advancements in Intelligent Tutoring Systems (ITS), driven by Artificial Intelligence (AI), have attracted substantial research interest, particularly in the domain of computer programming education. Given the diversity in learners' backgrounds, cognitive abilities, and learning paces, the development of personalized tutoring strategies to support effective attainment of learning objectives has become a critical challenge. This paper introduces PerFuSIT (Personalized Fuzzy Logic Strategies for Intelligent Tutoring of Programming), an innovative fuzzy logic-based module designed to select the most appropriate tutoring strategy from five available options, based on individual learner characteristics. The available strategies include revisiting previous content, progressing to the next topic, providing supplementary materials, assigning additional exercises, or advising the learner to take a break. PerFuSIT's decision-making process incorporates a range of learner-specific parameters, such as performance metrics, error types, indicators of carelessness, frequency of help requests, and the time required to complete tasks. Embedded within the traditional ITS framework, PerFuSIT introduces a sophisticated reasoning mechanism for dynamically determining the optimal instructional approach. Experimental evaluations demonstrate that PerFuSIT significantly enhances learner performance and improves the overall efficacy of interactions with the ITS. The findings highlight the potential of fuzzy logic to optimize adaptive tutoring strategies by customizing instruction to individual learners' strengths and weaknesses, thereby providing more effective and personalized educational support in programming instruction.

Today, computer programming is an essential pillar in the education of individuals. Even though technological evolution has eased the massive need for computer programming, a systematic lit-erature review shows some problems remain with teaching computer programing. To address such issues, in this paper we propose an adapted theory, a method, and a model for teaching some knowledge objects associated with the concepts of variables, expressions, comparisons, loops, and functions in programming fundamentals in computer sciences. The main contribution of this study comprises the extension of the concept of didactic transposition to improve teaching in context; in this paper, the idea is called didactic transposition in extensa sensu. The proposal involves the development of a linguistic corpus based on syllabi, textbooks, reference manuals, and a survey applied to experts in teaching programming fundamentals based on seventy-eight universities worldwide. An adapted theory, a method, and a model for teaching programming fundamentals using computational linguistics are produced. In addition, a template is created for designing teaching practices in this regard. The proposal generates an important alternative for the devel-opment of teaching strategies where the conditions of the context are addressed as a priority; ad-ditionally, several aspects are considered for elaborating teaching strategies using computational linguistic techniques from written documents.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.