Search

Colloidal and nanoparticle self-assembly enables the creation of ordered structures with a variety of electronic and photonic functionalities. The outcomes of the self-assembly processes used to synthesize such structures, however, strongly depend on the uniformity of the individual nanoparticles. Here, we explore the simplest form of particle size dispersity—bidispersity—and its impact on the self-assembly process. We investigate the robustness of self-assembling bcc-type crystals via isotropic interaction potentials in binary systems with increasingly disparate particle sizes by determining their terminal size ratio—the most extreme size ratio at which a mixed binary bcc crystal forms. Our findings show that two-well pair potentials produce bcc crystals that are more robust with respect to particle size ratio than one-well pair potentials. This suggests that an improved self-assembly process is accomplished with a second attractive length scale encoded in the particle–particle interaction, which stabilizes the second-nearest neighbor shell. In addition, we document qualitative differences in the process of ordering and disordering: in bidisperse systems of particles interacting via one-well potentials, we observe a breakdown of order prior to demixing, while in systems interacting via two-well potentials, demixing occurs first and bcc continues to form in parts of the droplet down to low size ratios. [ABSTRACT FROM AUTHOR]

An unsupervised computational protocol is proposed with the aim of obtaining accurate structures of large molecules in the gas phase at the cost of standard density functional theory (DFT) computations. The whole workflow is fully automated and provides optimized equilibrium geometries and ground state rotational constants to be directly compared with experiments. The results for a panel of molecules of biological or medicinal interest show that the accuracy of the results delivered by the new tool at the cost of a single DFT geometry optimization is close to that delivered by state-of-the-art composite wavefunction methods for small semi-rigid molecules. [ABSTRACT FROM AUTHOR]

Monomial ordering is the process of putting single polynomial terms, or monomials, in a certain order depending on predefined principles. It facilitates the systematic grouping and comparison of monomials, as well as the division and factorization of polynomials and other algebraic operations. Let R := 핂[xi,j|i ∈ [c],j ∈ ℕ], be a polynomial ring over arbitrary field 핂, where c is any fixed natural number. In this paper, we have defined different orderings like lexicographical, degree lexicographical and reverse degree lexicographical ordering on polynomial ring. We have discussed the infinitely many Inc-compatible term ordering on polynomial ring R with respect to two different weight vectors Wc and Wc,n′. [ABSTRACT FROM AUTHOR]

Considering the increasing competition among manufacturers and the diversification of customer orders, it is important to use the optimal production system. Hybrid manufacturing systems have proven to be a viable solution to achieve a satisfactory level of customization while maintaining adequate production volumes. This article determines the optimal strategy for decision makers in order to choose the appropriate method of supplying customers’ orders. In this article, a hybrid MTS-MTO production system has been studied in two different scenarios. For this purpose, a mixed-integer linear bi-objective model with product substitution and replaceable materials has been developed and solved by a Lagrangian Relaxation algorithm. The findings of this study reveal that enabling product substitution by manufacturers leads to an increase in the number of accepted orders, along with resulting in a higher average level of customer dissatisfaction. The system prioritizes the fulfillment of orders from permissive customers. Also, with the increase of uncertainty in each of the supplying methods, manufacturers are using other sources to supply raw materials to satisfy the accepted orders. [ABSTRACT FROM AUTHOR]

In the eighteenth century, the sciences and their applications adopted a new attitude based on quantification and, increasingly, on a notion of precision. Within this process, instruments played a significant role. However, while new devices such as the micrometer, telescope, and pendulum clock embodied a formerly unknown potential of precision, this could only be realized by defining a set of practices regulating their application and control. The paper picks up the case of pendulum clocks used in eighteenth-century observatories in order to show the process of learning in the course of which the pendulum clock first became a precision instrument. By examining the results of an especially developed statistical analysis, conducted to compare the performance of eighteenth-century clocks, it highlights the diversity of conditions, attitudes, and manners of handling that are characteristic for the epoch. In this way, it underlines the necessity of standardization of timekeeping practices rather than exclusively focusing on the technological development of clocks. Ultimately, the paper discusses the role of makers and users in order to show the evolution of a "precision instrument." [ABSTRACT FROM AUTHOR]

It is known that artificial intelligence algorithms are based on calculations performed using various mathematical operations. In order for these calculation processes to be carried out correctly, some types of data cannot be fed directly into the algorithms. In other words, numerical data should be input to these algorithms, but not all data in datasets collected for artificial intelligence algorithms are always numerical. These data may not be quantitative but may be important for the study under consideration. That is, these data cannot be thrown away. In such a case, it is necessary to transfer categorical data to numeric type. In this research work, 14 encoding methods of transforming of categorical data were considered. At the same time, conclusions are given about the general conditions of using these methods. During the research, categorical data in the dataset that were collected in order to assess whether it is possible to give credit to customers will be transformed based on 14 methods. After applying each encoding method, experimental tests are conducted based on the classification algorithm, and they are evaluated. At the end of the study, the results of the experimental tests are discussed and research conclusions are presented. [ABSTRACT FROM AUTHOR]

This study describes our thorough experience of formal modeling and exhaustive verification of concurrent systems, particularly mutual exclusion algorithms. The experience focuses on Lycklama and Hadzilacos's (LH) mutual exclusion algorithm. LH rests on the reduced size of the shared state, contains a mechanism that tries to enforce an FCFS order to processes entering their critical section, and embodies Burns and Lamport's (BL) mutual exclusion algorithm. The modeling methodology is based on timed automata and the model checker of the popular Uppaal toolbox. The effectiveness of the modeling and analysis approach is first demonstrated by studying the BL's solution and retrieving all its properties, including, in general, its unbounded overtaking, which is the non-limited number of by-passes a process can suffer before accessing its critical section. Then, the LH algorithm is investigated in depth by showing it fulfills all the mutual exclusion properties when it operates with atomic memory. However, as this study demonstrates, LH is not free of deadlocks when used with non-atomic memory. Finally, a state-of-the-art mutual exclusion solution is proposed, which relies on a stripped-down LH version for processes, which is used as the arbitration unit in a tournament tree (TT) organization. This study documents that LH's TT-based algorithm satisfies all the mutual exclusion properties, with a linear overtaking, both using atomic and non-atomic memory. [ABSTRACT FROM AUTHOR]

Emerging research on the etiology of violent radical political behavior has begun to explore the role of empathy in shaping an individual's beliefs, attitudes, and intentions that culminate in radicalization. The existing studies focus on persuasive influence upon an individual, but they overlook the centrality of empathy and that in the absence of empathy, persuasion is not salient. If an individual empathizes with a message then when it is processed by the receiver, the message is more likely to be considered realistic, relatable, believable, and therefore, persuasive. However, very little is known as to how messages should be designed to stimulate empathy in order to optimize their persuasive impact, which is particularly relevant to terrorist and extremist messaging given the lethal outcome of successful persuasion. This study examines the neurocognitive process of radicalization, specifically as it occurs within virtual online space, and how message content and production features have the potential to arouse empathy and generate radical-persuasive outcomes among the target audience. The findings of this research demonstrate how emotions, specifically that of empathy, can be stimulated in order to facilitate the process of radicalization, thus increasing the potential for violent radical political behavior. [ABSTRACT FROM AUTHOR]

Summary: Cognitive Radio Ad Hoc Networks (CRAHNs) are an essential method for resolving conflicts between extreme spectrum scarcity and rapid traffic increase while maintaining high‐quality service for consumers. However, the coexistence of primary and secondary users represents a critical challenge for reasonable resource allocation in order to provide a sustaining system performance. Many approaches have been developed to efficiently allocate resources; however, these methods are currently limited by things like user collision, strange traffic networks, and high data transmission error rates. To address these constraints, this paper proposes a policy‐configured reinforcement learning‐based ad hoc network (AHN) model. To obtain the ideal policy configuration for the network, the system first models the cognitive radio (CR) network, in which nodes are initialised and grouped employing the Link Reliability K‐Means clustering Algorithm (LR‐KMA). The available spectrum was then detected and separated into multiple bands utilizing coherent‐based detection (CBD) and signal source identification employing the Parzen–Rosenblatt Window‐based Restricted Boltzmann Machine (PRW‐RBM). Next, the learning model for the resource allocation process employs the Weibull Distribution‐based Blue Monkey Optimization (WD‐BMO) approach to pick the relevant bands. Finally, the experimental results were analyzed in order to evaluate the proposed resource allocation model's performance in CRAHNs. When compared with previous findings, the proposed method improves resource utilization by 5%, the proposed model achieves a 7% higher throughput, and the PRW‐RBM's accuracy improves classification accuracy by 1.07%. [ABSTRACT FROM AUTHOR]

The objective of this study was to investigate the impact of music training on the processing of temporal order in Mandarin sentence reading using event-related potentials (ERPs). Two-clause sentences with temporal connectives ("before" or "after") were presented to both musicians and non-musicians. Additionally, a verbal N-back task was utilized to evaluate the participants' working memory capacities. The findings revealed that musicians, but not nonmusicians, demonstrated a more negative amplitude in the second clauses of "before" sentences compared with "after" sentences. In the N-back task, musicians exhibited faster reaction times than nonmusicians in the two-back condition. Furthermore, a correlation was observed between the ERP amplitude differences (before vs. after) and reaction time differences in the N-back task (0-back vs. 2-back) among musicians. These findings suggested that music training enhances the depth of temporal order processing, potentially mediated by improvements in working memory capacity. [ABSTRACT FROM AUTHOR]

The four-dimensional ellipsoid of an anisotropic hyper-structure corresponds to the four-dimensional sphere of an isotropic hyper-structure. In three dimensions, both theories for spherical and ellipsoidal harmonics have been developed by Laplace and Lamé, respectively. Nevertheless, in four dimensions, only the theory of hyper-spherical harmonics is hitherto known. This void in the literature is expected to be filled up by the present work. In fact, it is well known that the spectral decomposition of the Laplace equation in three-dimensional ellipsoidal geometry leads to the Lamé equation. This Lamé equation governs each one of the spectral functions corresponding to the three ellipsoidal coordinates, which, however, live in non-overlapping intervals. The analysis of the Lamé equation leads to four classes of Lamé functions, giving a total of 2n + 1 functions of degree n. In four dimensions, a much more elaborate procedure leads to similar results for the hyper-ellipsoidal structure. Actually, we demonstrate here that there are eight classes of the spectral hyper-Lamé equation and we provide a complete analysis for each one of them. The number of hyper-Lamé functions of degree n is (n + 1)2; that is, n2 more functions than the three-dimensional case. However, the main difficulty in the four-dimensional analysis concerns the evaluation of the three separation constants appearing during the separation process. One of them can be extracted from the corresponding theory of the hyper-sphero-conal system, but the other two constants are obtained via a much more complicated procedure than the three-dimensional case. In fact, the solution process exhibits specific nonlinearities of polynomial type, itemized for every class and every degree. An example of this procedure is demonstrated in detail in order to make the process clear. Finally, the hyper-ellipsoidal harmonics are given as the product of four identical hyper-Lamé functions, each one defined in its own domain, which are explicitly calculated and tabulated for every degree less than five. [ABSTRACT FROM AUTHOR]

Predictive coding accounts of perception state that the brain generates perceptual predictions in the service of processing incoming sensory data. These predictions are hypothesized to be afforded by the brain's ability to internalize useful patterns, that is, statistical regularities, from the environment. We have previously argued that the N300 ERP component serves as an index of the brain's use of representations of (real-world) statistical regularities. However, we do not yet know whether overt attention is necessary in order for this process to engage. We addressed this question by presenting stimuli of either high or low real-world statistical regularity in terms of their representativeness (good/bad exemplars of natural scene categories) to participants who either fully attended the stimuli or were distracted by another task (attended/distracted conditions). Replicating past work, N300 responses were larger to bad than to good scene exemplars, and furthermore, we demonstrate minimal impacts of distraction on N300 effects. Thus, it seems that overtly focused attention is not required to maintain the brain's sensitivity to real-world statistical regularity. Furthermore, in an exploratory analysis, we showed that providing additional, artificial regularities, formed by altering the proportions of good and bad exemplars within blocks, further enhanced the N300 effect in both attended and distracted conditions, shedding light on the relationship between statistical regularities learned in the real world and those learned within the context of an experiment. [ABSTRACT FROM AUTHOR]

Robotic Mobile Fulfillment Systems (RMFSs) face challenges in handling large-scale orders and navigating complex environments, frequently encountering a series of intricate decision-making problems, such as order allocation, shelf selection, and robot scheduling. To address these challenges, this paper integrates Deep Reinforcement Learning (DRL) technology into an RMFS, to meet the needs of efficient order processing and system stability. This study focuses on three key stages of RMFSs: order allocation and sorting, shelf selection, and coordinated robot scheduling. For each stage, mathematical models are established and the corresponding solutions are proposed. Unlike traditional methods, DRL technology is introduced to solve these problems, utilizing a Genetic Algorithm and Ant Colony Optimization to handle decision making related to large-scale orders. Through simulation experiments, performance indicators—such as shelf access frequency and the total processing time of the RMFS—are evaluated. The experimental results demonstrate that, compared to traditional methods, our algorithms excel in handling large-scale orders, showcasing exceptional superiority, capable of completing approximately 110 tasks within an hour. Future research should focus on integrated decision-making modeling for each stage of RMFSs and designing efficient heuristic algorithms for large-scale problems, to further enhance system performance and efficiency. [ABSTRACT FROM AUTHOR]

The aim of the study is to review the evolution of the Hungarian food retail network between 1989 and 2023 and to analyse the acquisition processes of the firms in order to point out future trends. It was examined how the individual networks have evolved and how the ranking of food retailers has evolved, highlighting the reasons behind them. The aim of the research was to follow the expansion of food retailing multinational and domestic retailers both in space and time. The authors' findings show a steady decline in the number of small food stores and a rise in the number of discounters in the Hungarian grocery stores networks. New trends and sales models in the field of retail 4.0 are posing serious challenges for retailers, which may lead to further transformations in the future. [ABSTRACT FROM AUTHOR]

Picking protein particles in cryo-electron microscopy (cryo-EM) micrographs is a crucial step in the cryo-EM-based structure determination. However, existing methods trained on a limited amount of cryo-EM data still cannot accurately pick protein particles from noisy cryo-EM images. The general foundational artificial intelligence–based image segmentation model such as Meta's Segment Anything Model (SAM) cannot segment protein particles well because their training data do not include cryo-EM images. Here, we present a novel approach (CryoSegNet) of integrating an attention-gated U-shape network (U-Net) specially designed and trained for cryo-EM particle picking and the SAM. The U-Net is first trained on a large cryo-EM image dataset and then used to generate input from original cryo-EM images for SAM to make particle pickings. CryoSegNet shows both high precision and recall in segmenting protein particles from cryo-EM micrographs, irrespective of protein type, shape and size. On several independent datasets of various protein types, CryoSegNet outperforms two top machine learning particle pickers crYOLO and Topaz as well as SAM itself. The average resolution of density maps reconstructed from the particles picked by CryoSegNet is 3.33 Å, 7% better than 3.58 Å of Topaz and 14% better than 3.87 Å of crYOLO. It is publicly available at https://github.com/jianlin-cheng/CryoSegNet [ABSTRACT FROM AUTHOR]

We propose a new definition of the γ -convex stochastic processes (C SP) using center and radius (CR) order with the notion of interval valued functions (C. R I. V) . By utilizing this definition and Mean-Square Fractional Integrals, we generalize fractional Hermite–Hadamard–Mercer-type inclusions for generalized   C. R I. V versions of convex, tgs-convex, P-convex, exponential-type convex, Godunova–Levin convex, s-convex, Godunova–Levin s-convex, h-convex, n-polynomial convex, and fractional n-polynomial (C SP) . Also, our work uses interesting examples of   C. R I. V (C SP) with Python-programmed graphs to validate our findings using an extension of Mercer's inclusions with applications related to entropy and information theory. [ABSTRACT FROM AUTHOR]

In the traditional picking and sorting process of fragrant pears, the quality control process is not perfect, and the identification and extraction methods are not mature enough. By combining the Internet of Things (IoT) and image detection technologies, the image data of pear planting area in the orchard was obtained, and the image of pear was preprocessed, denoised, and feature extracted by the visual background extraction algorithm. In order to verify the actual effect of the optimized identification and extraction method for fragrant pears using IoT and image detection technologies, a comparative experiment was conducted. The results show that compared with the traditional pear recognition and extraction method, the optimized pear recognition and extraction method has a better predictive effectiveness in the process of pear image processing, and the recall and accuracy rates are improved by approximately 8% and 12.7%, respectively. This verifies the reliability and efficiency of the identification extraction method for fragrant pear based on IoT and image detection technologies. In this paper, the traditional pear identification and extraction methods are improved by IoT technology and UAV (unmanned aerial vehicle), which improves the picking efficiency and sorting quality of pear picking robots. [ABSTRACT FROM AUTHOR]

In this article, we consider two parametric classes of derivative free iterative methods of high order of convergence in Banach spaces. We study local and semilocal convergence results in Banach spaces for both families of iterative processes. We carry out a numerical application to solve a nonlinear and nondifferentiable Fredholm integral equation in the Banach space of continuous functions with the maximum norm. [ABSTRACT FROM AUTHOR]

In order processing, consecutive sequences (e.g., 1‐2‐3) are generally processed faster than nonconsecutive sequences (e.g., 1‐3‐5) (also referred to as the reverse distance effect). A common explanation for this effect is that order processing operates via a memory‐based associative mechanism whereby consecutive sequences are processed faster because they are more familiar and thus more easily retrieved from memory. Conflicting with this proposal, however, is the finding that this effect is often absent. A possible explanation for these absences is that familiarity may vary both within and across sequence types; therefore, not all consecutive sequences are necessarily more familiar than all nonconsecutive sequences. Accordingly, under this familiarity perspective, familiar sequences should always be processed faster than unfamiliar sequences, but consecutive sequences may not always be processed faster than nonconsecutive sequences. To test this hypothesis in an adult population, we used a comparative judgment approach to measure familiarity at the individual sequence level. Using this measure, we found that although not all participants showed a reverse distance effect, all participants displayed a familiarity effect. Notably, this familiarity effect appeared stronger than the reverse distance effect at both the group and individual level; thus, suggesting the reverse distance effect may be better conceptualized as a specific instance of a more general familiarity effect. [ABSTRACT FROM AUTHOR]

Two-dimensional (2D) materials and their heterostructures have been widely explored for high-performance energy conversion applications. The Thomson effect—a higher order transport process—plays an important role in thermoelectric devices, yet its effect on the performance of thermionic devices remains unknown thus far. Here, we investigate the performance of thermionic refrigeration in vertically stacked heterostructure (VHS) and laterally stitched heterointerface (LHS) composed of a graphene and a 2D semiconductor (i.e., MoS 2 and WSe 2) in the presence of the Thomson effect. Using a temperature-dependent Seebeck coefficient, we derived the analytical expressions of the cooling efficiency and the effective Z T. We shall show that the Thomson effect improves the coefficient of performance (COP) by up to 20%, particularly, in the case where the temperature difference between the cold and the hot electrodes is large. However, the Carnot efficiency decreases with the temperature difference. The overall COP is reduced by the Thomson effect. We calculate the COP in graphene/MoS 2 /graphene and graphene/WSe 2 /graphene VHS and LHS devices. We show that the LHS composed of WSe 2 significantly outperforms the VHS and MoS 2 counterpart. These findings provide an understanding of thermionic processes in the higher-order transport regime and shall offer insights into the design of novel 2D material heterostructure thermionic energy converters. [ABSTRACT FROM AUTHOR]

In this paper, we consider a class of k-order (3 ≤ k ≤ 5) backward differentiation formulas (BDF-k) for the molecular beam epitaxial (MBE) model without slope selection. Convex splitting technique along with k-th order Douglas-Dupont regularization term τ n k (− Δ) k D _ k ϕ n ( D _ k represents a truncated BDF-k formula) is added to the numerical schemes to ensure unconditional energy stability. The stabilized convex splitting BDF-k (3 ≤ k ≤ 5) methods are unique solvable unconditionally. Then the modified discrete energy dissipation laws are established by using the discrete gradient structures of BDF-k (3 ≤ k ≤ 5) formulas and processing k-th order explicit extrapolations of the concave term. In addition, based on the discrete energy technique, the L 2 norm stability and convergence of the stabilized BDF-k (3 ≤ k ≤ 5) schemes are obtained by means of the discrete orthogonal convolution kernels and the convolution type Young inequalities. Numerical results are carried out to verify our theory and illustrate the validity of the proposed schemes. [ABSTRACT FROM AUTHOR]

New families of composition methods with processing of order 4 and 6 are presented and analyzed. They are specifically designed to be used for the numerical integration of differential equations whose vector field is separated into three or more parts which are explicitly solvable. The new schemes are shown to be more efficient than previous state-of-the-art splitting methods. [ABSTRACT FROM AUTHOR]

In order to handle second order lead processes with time delay, this paper provides a unique dominant pole placement based filtered PID controller design approach. This method does not require any finite term approximation like Pade to obtain the quasi-polynomial characteristic polynomial, arising due to the presence of the time delay term. The continuous time second order plus time delay systems with zero (SOPTDZ) are discretized using a pole-zero matching method with specified sampling time, where the transcendental exponential delay terms are converted into a finite number of poles. The pole-zero matching discretization approach with a predetermined sampling period is also used to discretize the continuous time filtered PID controller. As a result, it is not necessary to use any approximate discretization technique, such as Euler or Tustin, to derive the corresponding discrete time PID controller from its continuous time counterpart. The analytical expressions for discrete time dominant pole placement based filtered PID controllers are obtained using the coefficient matching approach, while two distinct kinds of non-dominant poles, namely all real and all complex conjugate, have been taken into consideration. The stabilizable region in the controller and design parameter space for the chosen class of linear second order time delay systems with lead is numerically approximated using the particle swarm optimization (PSO) based random search technique. The efficacy of the proposed method has been validated on a class of SOPTDZ systems including stable, integrating, unstable processes with minimum as well as non-minimum phase zeros. [ABSTRACT FROM AUTHOR]

Warehouses recently face increasing stress imposed by a volatile customer demand and increasing customer expectations in terms of ever shorter order response times. In that respect, warehouses more and more offer same-day and next-day shipment conditions. However, same-day shipment promises are challenging to fulfil, especially as the order fulfilment process operates against fixed deadlines imposed by the predefined truck departure times. As a natural mitigation strategy, warehouses set a cutoff point and offer same-day shipment only to customers that order until the cutoff point, but next-day shipment to all customers ordering thereafter. Setting an appropriate cutoff point is challenging as it affects multiple facets of the service quality, such as the order response time and the service level. In this paper, we study the design of cutoff-based shipment promises for stochastic deadline-oriented order fulfilment processes in warehouses. We present a discrete-time Markov chain model for exact steady-state performance analysis and propose two novel performance measures – α - and β - cutoff service level – for service level measurement in these systems. We numerically show the benefit of cutoff-based shipment promises. Even with a late cutoff point, there is a significant gain in the system performance. Furthermore, we find that warehouses should set the cutoff point such that it balances customer expectations in terms of service level and order response time. Finally, warehouses can improve their shipment promises when referring to β - instead of α - cutoff service level and by implementing measures reducing the utilisation and the variabilities of the order fulfilment process. [ABSTRACT FROM AUTHOR]

Accurate detection of muskmelon fruit ripeness is crucial to ensure fruit quality, optimize picking time, and enhance economic benefits. This study proposes an improved lightweight YOLO-RFEW model based on YOLOv8n, aiming to address the challenges of low efficiency in muskmelon fruit ripeness detection and the complexity of deploying a target detection model to a muskmelon picking robot. Firstly, the RFAConv replaces the Conv in the backbone part of YOLOv8n, allowing the network to focus more on regions with significant contributions in feature extraction. Secondly, the feature extraction and fusion capability are enhanced by improving the C2f module into a C2f-FE module based on FasterNet and an Efficient Multi-Scale attention (EMA) mechanism within the lightweight model. Finally, Weighted Intersection over Union (WIoU) is optimized as the loss function to improve target frame prediction capability and enhance target detection accuracy. The experimental results demonstrate that the YOLO-RFEW model achieves high accuracy, with precision, recall, F1 score, and mean Average Precision (mAP) values of 93.16%, 83.22%, 87.91%, and 90.82%, respectively. Moreover, it maintains a lightweight design and high efficiency with a model size of 4.75 MB and an inference time of 1.5 ms. Additionally, in the two types of maturity tests (M-u and M-r), APs of 87.70% and 93.94% are obtained, respectively, by the YOLO-RFEW model. Compared to YOLOv8n, significant improvements in detection accuracy have been achieved while reducing both model size and computational complexity using the proposed approach for muskmelon picking robots' real-time detection requirements. Furthermore, when compared to lightweight models such as YOLOv3-Tiny, YOLOv4-Tiny, YOLOv5s, YOLOv7-Tiny, YOLOv8s, and YOLOv8n, the YOLO-RFEW model demonstrates superior performance with only 28.55%, 22.42%, 24.50%, 40.56%, 22.12%, and 79.83% of their respective model sizes, respectively, while achieving the highest F1 score and mAP values among these seven models. The feasibility and effectiveness of our improved scheme are verified through comparisons between thermograms generated by YOLOv8n and YOLO-RFEW as well as detection images. In summary, the YOLO-RFEW model not only improves the accuracy rate of muskmelon ripeness detection but also successfully realizes the lightweight and efficient performance, which has important theoretical support and application value in the field of muskmelon picking robot development. [ABSTRACT FROM AUTHOR]

We consider two companies that are competing for orders. Let X 1 (n) denote the number of orders processed by the first company at time n, and let τ (k) be the first time that X 1 (n) < j or X 1 (n) = r , given that X 1 (0) = k . We assume that { X 1 (n) , n = 0 , 1 , ... } is a controlled discrete-time queueing system. Each company is using some control to increase its share of orders. The aim of the first company is to maximize the expected value of τ (k) , while its competitor tries to minimize this expected value. The optimal solution is obtained by making use of dynamic programming. Particular problems are solved explicitly. [ABSTRACT FROM AUTHOR]

This paper discusses a case study of a zone-picking system in a distribution centre. In particular, we designed a basic simulation model for analysing the system using Simio and connected the model to the MySQL database using the existing and new steps in Simio. A ranking and selection problem was subsequently formulated to determine the capacity of the system that maximises the expected throughput while satisfying the constraints on: (1) the expected maximum utilisation, (2) expected time-averaged number of boxes in the main conveyor, and (3) expected flow time. To solve the problem under a limited simulation budget, we implemented an optimal computing budget allocation procedure, which may work in the presence of stochastic constraints. The experimental results demonstrate that our approach can more efficiently and effectively determine the capacity of the system than the equal allocation scheme. [ABSTRACT FROM AUTHOR]

Today, the Ising model is an archetype describing collective ordering processes. As such, it is widely known in physics and far beyond. Less known is the fact that the thesis defended by Ernst Ising 100 years ago (in 1924) contained not only the solution of what we call now the 'classical 1D Ising model' but also other problems. Some of these problems, as well as the method of their solution, are the subject of this note. In particular, we discuss the combinatorial method Ernst Ising used to calculate the partition function for a chain of elementary magnets. In the thermodynamic limit, this method leads to the result that the partition function is given by the roots of a certain polynomial. We explicitly show that 'Ising's roots' that arise within the combinatorial treatment are also recovered by the eigenvalues of the transfer matrix, a concept that was introduced much later. Moreover, we discuss the generalization of the two-state model to a three-state one presented in Ising's thesis, which is not included in his famous paper of 1925 (E. Ising, Z. Physik 31 (1925) 253). The latter model can be considered as a forerunner of the now-abundant models with many-component order parameters. [ABSTRACT FROM AUTHOR]

Direct ethanol fuel cells (DEFCs), which have been widely recognized as nontoxic and green energy conversion devices, show attractive application prospects for liquid hydrogen-carriers, due to the higher specific energy and lower toxicity of ethanol. Pt-based catalysts are widely used in DEFCs, while their poor poisoning resistance highlights the importance of composition and structure optimization. Herein, we synthesized a series of reduced graphene oxide supported ternary alloy AuxPt1−xCu3/rGO (x = 0-1) catalysts with excellent ethanol oxidation performance and a composition-dependent volcano plot trend of the ordering degree was observed and rationalized. The highest Pt-normalized mass activity of Au0.8Pt0.2Cu3/rGO is attributed to the optimized CO binding energy according to DFT calculations. This work not only provides an efficient EOR catalyst based on ordered alloys AuxPt1−xCu3 (x = 0-1), but also offers valuable insight into the role of a third metal in tuning the structure and function of alloys. [ABSTRACT FROM AUTHOR]

Previous research suggests that child HSs' performance in offline linguistic tasks is typically worse than their age-matched monolingual peers and is modulated by linguistic and child-level factors. This study examined the comprehension and production of three Mandarin non-canonical structures in 5- to 9-year-old Mandarin–English heritage children and Mandarin-speaking monolingual children, including an online processing task. Results showed that heritage children had different performance in production and offline comprehension across structures compared to monolinguals. In online processing, they showed sensitivity to different cues similarly to monolinguals but took longer to revise initial misinterpretations. Within heritage children, we found that presence of morphosyntactic cues facilitated performance across tasks while cross-linguistic influence was only identified in production and offline comprehension but not in online processing. Additionally, input quantity predicted their production and offline comprehension accuracy of non-canonical structures, whereas age modulated their production. Lastly, online processing was not modulated by age nor input. [ABSTRACT FROM AUTHOR]

The following article proposes a reflection on the experience of Narrative Therapy of a group of cancer patients, non-homogeneous for sites and stages of disease, participating to a therapeutic writing path, in order to process the trauma reactive to cancer and to reflect on themselves. Taking inspiration from the assumption that "writing helps when people are faced with a stumble", facilitating the process of distancing from life-events, each writer establishes either context, in a more intimate and true way, or memories and emotions connected to it, in order to express them to the group and to themselves too, and to identify new adaptation styles. The therapeutic path lasted eight meetings, during which some themes were chosen to guide the written reflection, which was carried out at home, and then shared with the group. The therapeutic path is an opportunity to adjust the perspective with which the specialist accompanies patients during the adaptation process to the disease, moving from the "explanation" to "comprehension"; from symptom to "sense". The group narration is based on a relational perspective of co-construction of the meaning of experiences, highlighting the different roles and relevance of the factors involved. [ABSTRACT FROM AUTHOR]

Astrocyte-derived pyruvate is considered to have neuroprotective functions. In order to investigate the processes that are involved in astrocytic pyruvate release, we used primary rat astrocyte cultures as model system. Depending on the incubation conditions and medium composition, astrocyte cultures established extracellular steady state pyruvate concentrations in the range between 150 µM and 300 µM. During incubations for up to 2 weeks in DMEM culture medium, the extracellular pyruvate concentration remained almost constant for days, while the extracellular lactate concentration increased continuously during the incubation into the millimolar concentration range as long as glucose was present. In an amino acid-free incubation buffer, glucose-fed astrocytes released pyruvate with an initial rate of around 60 nmol/(h × mg) and after around 5 h an almost constant extracellular pyruvate concentration was established that was maintained for several hours. Extracellular pyruvate accumulation was also observed, if glucose had been replaced by mannose, fructose, lactate or alanine. Glucose-fed astrocyte cultures established similar extracellular steady state concentrations of pyruvate by releasing pyruvate into pyruvate-free media or by consuming excess of extracellular pyruvate. Inhibition of the monocarboxylate transporter MCT1 by AR-C155858 lowered extracellular pyruvate accumulation, while inhibition of mitochondrial pyruvate uptake by UK5099 increased the extracellular pyruvate concentration. Finally, the presence of the uncoupler BAM15 or of the respiratory chain inhibitor antimycin A almost completely abolished extracellular pyruvate accumulation. The data presented demonstrate that cultured astrocytes establish a transient extracellular steady state concentration of pyruvate which is strongly affected by modulation of the mitochondrial pyruvate metabolism. [ABSTRACT FROM AUTHOR]

Establishing warehouses is necessary in societies where commercial activities have grown to the extent that efficient storage becomes a prerequisite for seamless exchange. Variable holding cost is a pivotal factor influencing warehouse costs, as is the dynamic nature of holding expenses, which tend to increase over time. This study focuses on an inventory model designed for goods subject to degradation, stored across two distinct warehouses (rented and owned) within a partial backlogging and inflationary economic environment. The cost associated with holding these goods is linearly dependent on time. The demand pattern in the inventory model for goods follows an exponential trajectory over time. The primary objective of the proposed model is to forecast the optimal quantity and the corresponding timeframe, thereby minimizing the overall cost. Rigorous validation of the model's outcomes is undertaken through sensitivity analysis utilizing MATLAB R2017b software, ensuring the robustness and reliability of the findings. [ABSTRACT FROM AUTHOR]

For a more effective merger control framework, Chilean law establishes, among other measures, penalties for those who provide false information when notifying a merger. On 27 February 2024, the Chilean Competition Court issued its first ruling in which it analysed this infringement and when it is deemed committed. This article relates to the importance of the merger control procedure and of the parties providing accurate information during the process in order for it to be efficient. To this end, we focus particularly on the requirements for the infringement of providing false information as set out by the Chilean Competition Court. [ABSTRACT FROM AUTHOR]

In this paper, we study the scheduling of n jobs on a single machine. Each of the n jobs will be processed without interruption and becomes available for processing at time zero. The goal is to find a processing order for the jobs, minimizing the total completion time, total late work, total earliness time, and maximum earliness maximum tardiness. The posed problems in this paper are as follows: The first problem is to minimize the multi-criteria, which includes minimizing the total completion time, total late work, total earliness time, maximum earliness, and maximum tardiness that are denoted by ΣCj, ΣVj, ΣΕj, Emax, and Tmax, respectively. The second problem is to minimize the multi-objective functions (ΣCj + ΣVj, +ΣΕj; + Emax + Tmax). The theoretical section will present the mathematical formula for the discussed problem. Because these problems are NP- hard problems. It is difficult to determine the efficient (optimal) solution set for these problems. Some special cases are shown and proven to find efficient (optimal) solutions to the discussed problem. The significance of the dominance rule can be applied to problems to improve and to get good solutions that will be highlighted. [ABSTRACT FROM AUTHOR]

The autocovariance and cross‐covariance functions naturally appear in many time series procedures (e.g. autoregression or prediction). Under assumptions, empirical versions of the autocovariance and cross‐covariance are asymptotically normal with covariance structure depending on the second‐ and fourth‐order spectra. Under non‐restrictive assumptions, we derive a bound for the Wasserstein distance of the finite‐sample distribution of the estimator of the autocovariance and cross‐covariance to the Gaussian limit. An error of approximation to the second‐order moments of the estimator and an m‐dependent approximation are the key ingredients to obtain the bound. As a worked example, we discuss how to compute the bound for causal autoregressive processes of order 1 with different distributions for the innovations. To assess our result, we compare our bound to Wasserstein distances obtained via simulation. [ABSTRACT FROM AUTHOR]

This paper investigates the performance of a two-stage multi-criteria decision-making procedure for order scheduling problems. These problems are represented by a novel nonlinear mixed integer program. Hybridizations of three Multi-Objective Evolutionary Algorithms (MOEAs) based on dominance relations are studied and compared to solve small, medium, and large instances of the joint order batching and picking problem in storage systems with multiple blocks of two and three dimensions. The performance of these methods is compared using a set of well-known metrics and running an extensive battery of simulations based on a methodology widely used in the literature. The main contributions of this paper are (1) the hybridization of MOEAs to deal efficiently with the combination of orders in one or several picking tours, scheduling them for each picker, and (2) a multi-criteria approach to scheduling multiple picking teams for each wave of orders. Based on the experimental results obtained, it can be stated that, in environments with a large number of different items and orders with high variability in volume, the proposed approach can significantly reduce operating costs while allowing the decision-maker to anticipate the positioning of orders in the dispatch area. [ABSTRACT FROM AUTHOR]

To probe the processing of gaze-dependent positional information and gaze-independent order information when matching strings of characters, we compared effects of visual similarity (hypothesized to affect gaze-centered position coding) with the effects of character transpositions (hypothesized to affect the processing of gaze-independent order information). In Experiment 1, we obtained empirical measures of visual similarity for pairs of characters, separately for uppercase consonants and keyboard symbols. These similarity values were then used in Experiment 2 to create pairs of four-character stimuli (four letters or four symbols) that could differ by substituting one character with a different character from the same category that was visually similar (e.g., FJDK–FJBK) or dissimilar (e.g., FJVK–FJBK). We also compared the effects of transposing two characters (e.g., FBJK–FJBK) with substituting two characters (e.g., FHSK–FJBK). "Different" responses were harder to make in the single substitution condition when the substituted character was visually similar, and this effect was not conditioned by character type. On the other hand, transposition costs (i.e., greater difficulty in detecting a difference with transpositions compared with double substitutions) were greater for letters compared with symbols. We conclude that visual similarity mainly affects the generic gaze-dependent processing of complex visual features, and that the encoding of letter order involves a mechanism that is specific to reading. [ABSTRACT FROM AUTHOR]

Additive manufacturing (AM) has become a widely used technique in 3D printing, but it has proven to be a very costly process, even when optimizing parameters in existing models. Due to the characteristics of AM, and in order to optimize its process, a new approach is introduced to the problem: the discretization of each layer to be printed. This involves establishing an order relation based on the sequence in which the layers should be printed. The valid orders for the execution of the process, referred to as compatible with the order relation, will be characterized. Additionally, algorithms will be provided to obtain new compatible orders from others that were already compatible, and strategies will be presented to optimally and efficiently reorder non-compatible orders, converting them into compatible ones. [ABSTRACT FROM AUTHOR]

We report the results of one visual-world eye-tracking experiment and two referent selection tasks in which we investigated the effects of information structure in the form of prosody and word order manipulation on the processing of subject pronouns er and der in German. Factors such as subject-hood, focus, and topicality, as well as order of mention have been linked to an increased probability of certain referents being selected as the pronoun's antecedent and described as increasing this referent's prominence, salience, or accessibility. The goal of this study was to find out whether pronoun processing is primarily guided by linguistic factors (e.g., grammatical role) or nonlinguistic factors (e.g., first-mention), and whether pronoun interpretation can be described in terms of referents' "prominence" / "accessibility" / "salience." The results showed an overall subject preference for er, whereas der was affected by the object role and focus marking. While focus increases the attentional load and enhances memory representation for the focused referent making the focused referent more available, ultimately it did not affect the final interpretation of er, suggesting that "prominence" or the related concepts do not explain referent selection preferences. Overall, the results suggest a primacy of linguistic factors in determining pronoun resolution. [ABSTRACT FROM AUTHOR]