Genome-scale metabolic models (GEMs) play an important role in the phenotype prediction of microorganisms, and their accuracy can be further improved by integrating other types of biological data such as enzyme concentrations and kinetic coefficients. Enzyme-constrained models (ecModels) have been constructed for several species and were successfully applied to increase the production of commodity chemicals. However, there was still no genome-scale ecModel for the important model organism Bacillus subtilis prior to this study. Here, we integrated enzyme kinetic and proteomic data to construct the first genome-scale ecModel of B. subtilis (ecBSU1) using the ECMpy workflow. We first used ecBSU1 to simulate overflow metabolism and explore the trade-off between biomass yield and enzyme usage efficiency. Then, we simulated the growth rate on eight previously published substrates and found that the simulation results of ecBSU1 were in good agreement with the literature. Finally, we identified target genes that enhance the yield of commodity chemicals using ecBSU1, most of which were consistent with the experimental data, and some of which may be potential novel targets for metabolic engineering. This work demonstrates that the integration of enzymatic constraints is an effective method to improve the performance of GEMs. The ecModel can predict overflow metabolism more precisely and can be used for the identification of target genes to guide the rational design of microbial cell factories.

Genome-scale metabolic model (GEM) is a powerful tool for interpreting and predicting cellular phenotypes under various environmental and genetic perturbations. However, GEM only consid-ers stoichiometric constraints, and the simulated growth and product yield values will show a monotonic linear increase with increasing substrate uptake rate, which deviates from the experi-mentally measured values. Recently, the integration of enzymatic constraints into stoichiometry-based GEMs was proven to be effective in making novel discoveries and predicting new engineer-ing targets. Here we present the first genome-scale enzyme-constrained model (eciCW773) for Corynebacterium glutamicum reconstructed by integrating enzyme kinetic data from various sources using ECMpy workflow based on the high-quality GEM of C. glutamicum (obtained by modifying the iCW773 model). The enzyme-constrained model improved the prediction of pheno-types and simulated overflow metabolism, while also recapitulating the trade-off between biomass yield and enzyme usage efficiency. Finally, we used eciCW773 to identify several gene modifica-tion targets for L-lysine production, most of which agree with previously reported genes. This study shows that incorporating enzyme kinetic information into the GEM enhances the cellular phenotypes prediction of C. glutamicum, which can help identify key enzymes and thus provide reliable guidance for metabolic engineering.

In this paper, the optimal approximation algorithm is proposed to simplify non-linear functions and/or discrete data as piecewise polynomials by using the constrained least squares. In time-sensitive applications or in embedded systems with limited resources, the runtime of the approximate function is as crucial as its accuracy. The proposed algorithm search to find the Optimal Piecewise Polynomial (OPP) with minimum computational cost while ensuring the error below a specified threshold. This was accomplished by using smooth piecewise polynomials with optimal order and number of intervals. The computational cost only depends on polynomial complexity, i.e., the order and the number of intervals at runtime function call. For optimal approximation, computational costs for all the possible combinations of piecewise polynomials were calculated and tabulated as ascending order for the specific target CPU off-line. Each combination was optimized through constrained least squares and random selection method for given sample points. Afterward, whether the approximation error is below the predetermined value is examined. When the error is permissible, the combination is selected as the optimal approximation or the next combination was examined. To verify the performance, several representative functions were examined and analyzed.

Portfolio optimization is a mathematical formulation whose objective is to maximize returns while minimizing risks. A lot of improvement in the model has been made, including adding practical constraints. With the growing of shares trading, the problem becomes dimensionally very large. In this paper, we propose the usage of modified Biogeography-Based Optimization to solve the large scale constrained portfolio optimization. Results indicate the effectiveness of the method used.

Cash holding is important for Chinese manufacturing firms coping with the increasing cost of financing and stiff market conditions. This study examines the impact of cash holding on the firm value of Chinese manufacturing firms. We find evidence that a non-linear relationship exists between cash holding and firm value in manufacturing firms of China. The study reveals that financially constrained firms having a higher level of cash holding negatively affects the firm value, while the unconstrained firms having a lower level of cash holding positively influences the firm value. Finally, this research is enriched by adopting the novel measure of managerial op-timism and reveals the interactive role of cash holding and optimism on firm value. The study concludes that managerial optimism influences the firm’s cash holding decisions and this is more costly for unconstrained firms.

This study was undertaken to derive and analyze the Advanced Microwave Scanning Radiometer - EOS (AMSR-E) sea surface temperature (SST) footprint associated with the Remote Sensing Systems (RSS) Level-2 (L2) product. The footprint, in this case, is characterized by the weight attributed to each 4  4 km square contributing to the SST value of a given AMSR-E pixel. High-resolution L2 SST fields obtained from the MODerate-resolution Imaging Spectroradiometer (MODIS), carried on the same spacecraft as AMSR-E, are used as the sub-resolution “ground truth“ from which the AMSR-E footprint is determined. Mathematically, the approach is equivalent to a linear inversion problem, and its solution is pursued by means of a constrained least square approximation based on the bootstrap sampling procedure. The method yielded an elliptic-like Gaussian kernel with an aspect ratio  1.58, very close to the AMSR-E 6.93GHz channel aspect ratio,  1.7. (The 6.93GHz channel is the primary spectral frequency used to determine SST.) The semi-major axis of the estimated footprint is found to be alignedwith the instantaneous field-of-view of the sensor as expected fromthe geometric characteristics of AMSR-E. Footprintswere also analyzed year-by-year and as a function of latitude and found to be stable – no dependence on latitude or on time. Precise knowledge of the footprint is central for any satellite-derived product characterization and, in particular, for efforts to deconvolve the heavily oversampled AMSR-E SST fields and for studies devoted to product validation and comparison. A preliminarly analysis suggests that use of the derived footprint will reduce the variance between AMSR-E and MODIS fields compared to the results obtained.

This paper presents a novel algorithm, the multi-objective nonlinear interval PageRank (MONIPR) Algorithm. This algorithm extends the conventional PageRank (PR) algorithm, integrating nonlinear interval computation and multi-objective considerations into the computation process. The MONIPR algorithm bridges a research gap in integrating nonlinear interval approaches and multi-objective problems into the PR algorithm, which were traditionally treated separately. In addition, this research adopts the constrained interval arithmetic proposed to address the limitations of the conventional PR algorithm, which tends to overlook uncertainties and results in deterministic outcomes. In addition, we use a numerical example to demonstrate the proposed algorithm, contrasting it with the conventional approaches. A numerical example demonstrates the algorithm's performance by comparing the rank intervals obtained with the traditional crisp Markov chain and PR algorithm. The results highlight the ability of the proposed algorithm to provide a range of possible rank intervals, considering both uncertainty and multi-objectives. The findings suggest potential applications in decision-making, uncertainty quantification, and systems analysis.

Genome-scale metabolic models (GEMs) have been widely used for phenotypic prediction of microorganisms. However, the lack of other constraints in the stoichiometric model often leads to a large metabolic solution space inaccessible. Inspired by previous studies that take allocation of macromolecule resources into account, we developed a simplified Python-based workflow for constructing enzymatic constrained metabolic network model (ECMpy) and constructed an enzyme-constrained model for Escherichia coli (eciML1515) by directly adding a total enzyme amount constraint in the latest version of GEM for E. coli (iML1515), considering the protein subunit composition in the reaction, and automated calibration of enzyme kinetic parameters. Using eciML1515, we predicted the overflow metabolism of E. coli and revealed that redox balance was the key reason for the difference between E. coli and Saccharomyces cerevisiae in overflow metabolism. The growth rate predictions on 24 single-carbon sources were improved significantly when compared with other enzyme-constrained models of E. coli. Finally, we revealed the tradeoff between enzyme usage efficiency and biomass yield by exploring the metabolic behaviors under different substrate consumption rates. Enzyme-constrained models can improve simulation accuracy and thus can predict cellular phenotypes under various genetic perturbations more precisely, providing reliable guidance for metabolic engineering.

In this work, an innovative numerical approach for polylinear approximation (polylinearization) of non-self-intersecting compact sensor characteristics (transfer functions) specified either pointwise or analytically is introduced. The goal is to optimally partition the sensor characteristic, i.e. to select the vertices of the approximating polyline (approximant) along with their positions on, the sensor characteristics so that the distance (i.e. the separation) between the approximant and the characteristic is rendered below a certain problem-specific tolerance. To achieve this goal, two alternative non-linear optimization problems are solved, whose essential difference is in the adopted quantitative measure of the separation between the transfer function and the approximant. In the first problem, which relates to absolutely integrable sensor characteristics (their energy is not necessarily finite, but they can be represented in terms of convergent Fourier series), the polylinearization is constructed by numerical minimization of the L^1--metric (a distance-based separation measure), concerning the number of polyline vertices and their locations. In the second problem which covers the quadratically integrable sensor characteristics (whose energy is finite, but they do not necessarily admit a representation in terms of convergent Fourier series), the polylinearization is constructed by minimizing numerically the L^2-metric (area-, or energy-based separation measure) for the same set of optimization variables –the locations, and the number of polyline vertices.

A class of controlled plants, whose dynamics is governed by a vector system of ordinary differential equations with a partially known right-hand side, is considered. The state variables and their velocities are assumed to be measurable. The aim is to design a controller which minimizes a loss function under certain constraints which arguments is the current state of the controlled plant. The designed control action is admitted to be a function of the current sub-gradient only, which supposed to be measurable on-line. The control design is based on ASG (Average Sub-Gradient method) — version of Integral Sliding Mode (ISM) concept, aimed to minimize on average a given convex (not obligatory strongly convex) cost function of the current state under a set of given constraints. An optimization type algorithm is developed and analyzed using ideas of SDM technique. The main results consist in proving the reachability of the "desired regime" (nonstationary analogue of sliding surface) from the beginning of the process and obtaining an explicit upper bound for the averaged loss function decrement, that is, the averaged in time functional convergence is proven and the rate of such convergence is estimated.

In this work, we propose a variation of the cellular particle swarm optimization algorithm with differential evolution hybridization (CPSO-DE), to include constrained optimization in it, named Ts-CPD. It is implemented as a kernel of electronic design automation (EDA) tool capable of sizing circuit components considering a single-objective design with restrictions and constraints. The aim is to improve the optimization solutions in the sizing of analog circuits. To evaluate our proposal’s performance, we present the design of three analog circuits: a deferential amplifier, a two-stage operational amplifier, and a folded cascode operational transconductance amplifier. Numerical simulation results indicate that Ts-CPD can find better solutions, in terms of the design objective and the accomplishment of constraints, than those reported in previous works.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Real-world optimization problems are often governed by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Optimization Problems (COPs) fueled by advances in computational intelligence. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose an ensemble of multi- method hybrid EA framework with four mutation operators, two crossover operators, multi-search [Differential Evolution (DE) & Gaining Sharing Knowledge (GSK)] optimization algorithm, and ensemble of constraint handling techniques to solve global real- world constrained optimization problem. The proposed frame- work FEPEA has an ascendancy of multiple adaptation strategies concerning the control parameters, search mechanisms, two sub-populations as well as uses knowledge sharing mechanism between junior and senior phases. The algorithm also combines the power of four popular constraint handling techniques (CHT) and uses a voting mechanism to select any particular CHT. On top of that, this algorithm also uses both linear and non- linear population size reduction in every step of the evolutionary process. We test our method on 57 real-world problems provided as part of the CEC 2020 special session & competition on real- world constrained optimization benchmark suite. Experimental results indicate that FEPEA is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Background: New open-source electric-grid planning models have the potential to improve power system planning and bring a wider range of stakeholders into the planning process for next-generation, high-renewable power systems. However, it has not yet been established whether open-source models perform similarly to the more established commercial models for power system analysis. This reduces their credibility and attractiveness to stakeholders, postponing the benefits they could offer. In this paper, we report the first model intercomparison between an open-source power system model and an established commercial production cost model. Results: We compare the open-source Switch 2.0 to GE Energy Consulting’s Multi Area Production Simulation (MAPS) for production-cost modeling, considering hourly operation under 17 scenarios of renewable energy adoption in Hawaii. We find that after configuring Switch with similar inputs to MAPS, the two models agree closely on hourly and annual production from all power sources. Comparing production gave a coefficient of determination of 0.996 across all energy sources and scenarios, indicating that the two models agree on 99.6% of the variation. For individual energy sources, the coefficient of determination was 69–100. Conclusions: Although some disagreement remains between the two models, this work indicates that Switch is a viable choice for renewable integration modeling, at least for the small power systems considered here. Although some disagreement remains between the two models, this work indicates that Switch is a viable choice for renewable integration modeling, at least for the small power systems considered here.

In order to obtain stable and reliable configuration transformation ability, reliability optimization design is regarded as an effective way to reduce the probability of kinematic function failure for the constrained metamorphic mechanism. Based on the structural composition principle of multi-configuration source metamorphic mechanism that can operate in an under-actuated state, the modularized calculation methods are established for the force analysis of augmented Assur groups including metamorphic kinematic joints. According to the equivalent resistance gradient model of metamorphic mechanisms, with considering the uncertainties in the link dimensions, masses, and compliance parameters et al, a probabilistic evaluation method for describing the configuration transformation ability of the constrained metamorphic mechanism is established. Based on reliability evaluation and reliability sensitivity analysis, a reliability optimization design method for improving the configuration transformation ability is proposed, and then the optimization design is carried out for tolerances of random variables focusing on those structural parameters with higher reliability sensitivity, so that the optimized results can satisfy the requirements of both reliability and economic simultaneously. Finally, the feasibility and effectiveness of the proposed method is verified by the illustration of a paper folding metamorphic mechanism. The research provides the foundation of reliability design of metamorphic mechanisms to obtain the high-probability repeated execution ability of configuration transformation, it also has theoretical and practical significance to promote the engineering application of metamorphic mechanisms.

A simple bounded stochastic motion is employed for modelling equity price dynamics under shocks, where the prices are constrained to lie between two positive bounds. While the stochastic process has an inaccessible boundary, the other boundary is quasi-bounded, implying that the boundary can be breached if the probability leakage condition is met. The quasi-boundedness of the process at the boundary can thus provide an indicator of possible risk of equities under price shocks. Empirical calibration of model parameters of the proposed process for equities can be performed easily due to the availability of an analytically tractable probability density function which generates fat-tailed distributions consistent with empirical observations. The volatility and mean-reversion of the S&P500 dynamics calibrated by the process is positively and negatively co-integrated respectively with the VIX index representing the level of market distress. The process captures the high likelihood of Hertz’s default about two months earlier, using only information until that point, and before the firm filed for Chapter 11 bankruptcy in May 2020 as a result of the Covid-19 pandemic. Empirical calibration of the process for GameStop’s stock price shows that the short squeeze of the stock occurred when the condition for breaching an upper boundary was met on 14 January 2021, i.e., about two weeks before major short sellers closed out their positions with significant losses. The trading volume of the stock was positively co-integrated with the probability leakage ratio.

Euler-Poisson equations of a charged symmetrical body in external constant and homogeneous electric and magnetic fields are deduced starting from the variational problem, where the body is considered as a system of charged point particles subject to holonomic constraints. The final equations are written for the center-of mass-coordinate, rotation matrix and angular velocity. General solution to the equations of motion is obtained for the case of a charged ball. For the case of a symmetrical charged body (solenoid), the task of obtaining the general solution is reduced to the problem of a one-dimensional cubic pseudo-oscillator. Besides, we present a one-parametric family of solutions to the problem in elementary functions.

Motivated for improving the efficiency and reliability of wind turbine energy conversion, this paper presents an advanced control design that enhances the power regulation efficiency and re-liability. The constrained behaviour of the wind turbine is taken into account, by using the barrier Lyapunov function in the analysis of the Lyapunov direct method. This, consequently, guarantees that the generated power remains within the desired bounds to satisfy the grid power demand. Moreover, a Nussbaum-type function is utilized in the control scheme, to cope with the unpre-dictable wind speed. This eliminates the need for accurate wind speed measurement or estimation. Furthermore, via properly designed adaptive laws, a robust actuator fault-tolerant capability is integrated into the scheme, handling the model uncertainty. Numerical simulations are performed on a high-fidelity wind turbine benchmark model, under different fault scenarios, to verify the effectiveness of the developed design. Also, a Monte-Carlo analysis is exploited for the evaluation of the reliability and robustness characteristics against the model-reality mismatch, measurement errors and disturbance effects.

Tracking the kinematics of human movement usually requires the use of equipment that constrains the user within a room (e.g., optical motion capture systems), or requires the use of a conspicuous body-worn measurement system (e.g., inertial measurement units (IMUs) attached to each body segment). This paper presents a novel Lie group constrained extended Kalman filter to estimate lower limb kinematics using IMU and inter-IMU distance measurements in a reduced sensor count configuration. The algorithm iterates through the prediction (kinematic equations), measurement (pelvis height assumption/inter-IMU distance measurements, zero velocity update for feet/ankles, flat-floor assumption for feet/ankles, and covariance limiter), and constraint update (formulation of hinged knee joints and ball-and-socket hip joints). The knee and hip joint angle root-mean-square errors in the sagittal plane for straight walking were 7.6±2.6∘ and 6.6±2.7∘, respectively, while the correlation coefficients were 0.95±0.03 and 0.87±0.16, respectively. Furthermore, experiments using simulated inter-IMU distance measurements show that performance improved substantially for dynamic movements, even at large noise levels (σ=0.2 m). However, further validation is recommended with actual distance measurement sensors, such as ultra-wideband ranging sensors.

The objectives of this paper are to investigate the tradeoffs between a physically constrained neural network and a deep, convolutional neural network and to design a combined ML approach ("VarioCNN"). Our solution is provided in the framework of a cyberinfrastructure that includes a newly designed ML software, GEOCLASS-image, modern high-resolution satellite image data sets (Maxar WorldView data) and instructions/descriptions that may facilitate solving similar spatial classification problems. Combining the advantages of the physically-driven connectionist-geostatistical classification method with those of an efficient CNN, VarioCNN provides a means for rapid and efficient extraction of complex geophysical information from submeter resolution satellite imagery. A retraining loop overcomes the difficulties of creating a labeled training data set. Computational analyses and developments are centered on a specific, but generalizable, geophysical problem: The classification of crevasse types that form during the surge of a glacier system. A surge is a glacial catastrophe, an acceleration of a glacier to typically 100-200 times its normal velocity. GEOCLASS-image is applied to study the current (2016-2024) surge in the Negribreen Glacier System, Svalbard. The geophysical result is a description of the structural evolution and expansion of the surge, based on crevasse types that capture ice deformation in six simplified classes.

This paper presents a novel adaptive fault-tolerant neural-based control design for wind turbines with unknown dynamic and unknown wind speed. By utilizing the barrier Lyapunov function in the analysis of the Lyapunov direct method, the constrained behavior of the system is provided in which the rotor speed, its variation and generated power remain in the desired bounds. In addition, input saturation is also considered in terms of smooth pitch actuator bounding. Furthermore, by utilizing a Nussbaum-type function in designing the control algorithm, the unpredictable wind speed variation is captured without requiring accurate wind speed measurement, observation or estimation. Moreover, with the proposed adaptive analytic algorithms, together with the use of radial basis function neural networks, a robust adaptive and fault-tolerant control scheme is developed without the need for precise information about the wind turbine model nor the pitch actuator faults. Additionally, the computational cost of the resultant control law is reduced by utilizing a dynamic surface control technique. The effectiveness of the developed design is verified using theoretical analysis tools and illustrated by numerical simulations on a high-fidelity wind turbine benchmark model with different fault scenarios. Comparison of the achieved results to the ones that can be obtained via an available industrial controller shows the advantages of the proposed scheme.

We discuss the dynamics of a roller coaster cart driven by a constant force along the suspended track of a winding roller coaster. The track is assumed arbitrarily long and specially shaped. It is made by semicircular track portions, in the form of valleys and hills, standing perfectly vertical in the same plane. This is a mechanical analog of a Josephson junction electrodynamics. To demonstrate the explanatory potential of the analogy, we focus particularly on the conditions of de-trapping of the cart from one of the valleys of the track. This mechanical process has its analog in a non-noise-generated premature switching to the finite voltage state of a Josephson junction.

Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern, too. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the second one suggests the multiplicative (or geometric) nature of averaging. The original concept of PMA was motivated by the practice of matrix population models as a tool to assess the population viability from long-term monitoring data. The task has reduced to searching for an approximate solution to an overdetermined system of polynomial equations for unknown elements of the average matrix (G), hence to a nonlinear constrained minimization problem for the matrix norm. Former practical solutions faced certain technical problems, which required sophisticated algorithms but returned acceptable estimates. Fresh idea to use the eigenvalue approximation ensues also from the basic equation of averaging, which determines the exact value of λ1(G), the dominant eigenvalue of matrix G, too, and the corre-sponding eigenvector. These are bound by the well-known linear equations, which reduce the task to a standard problem of linear programing (LP). The LP approach is realized for 13 fixed-pattern matrices gained in a case study of Androsace albana, an alpine short-lived perennial, monitored on permanent plots during 14 years. A standard software routine reveals the unique exact solution, rather than an approximate one, to the PMA problem, which turns the LP approach into ‘’the best of versatile optimization tools”. The exact solution turns out to be peculiar in reaching zero bounds for certain nonnegative entries of G, which deserves a modified problem formulation separating the lower bounds from zero.

Thin twin-roll cast strips from a model Al-Cu-Mg-Li-Zr alloy with a small addition of Sc were prepared. A combination of a fast solidification rate and a favorable effect of Sc microalloying impacts the size and distribution of primary phase particles and the dimension of eutectic cells. Small interdendritic spacing in the range of 10-15 um enables substitution of the initial long-term homogenization annealing by a two-step annealing at 300 and 450 °C and a short solution treatment at 530 °C before quenching and the final age-hardening procedure. A dense dispersion of small Al3(Sc,Zr) precipitates intensively inhibiting recrystallization forms during this treatment. Further refining and fragmentation of the structure were performed using constrained groove pressing before the solution treatment. Small pre-straining of quenched specimens and subsequent age-hardening simulating T8 temper were used to promote the formation of a homogeneous distribution of strengthening particles and to suppress preferential heterogeneous precipitation on subgrain and grain boundaries. Microstructural features and microhardness evolution during annealing were critically examined and confronted with microstructural characteristics observed on reference mold cast alloy or alloys without Sc alloying. The proposed treatment represents a model near net shape procedure for manufacturing thicker sheets for the aerospace industry.

Buckling defect will appear on the outer surface of the deformed ring during constrained ring rolling (CRR) of aluminum alloy thin wall conical ring with inner high ribs (AATWCRIHR), if the geometrical dimension of the ribs doesn't match the wall thickness. To avoid the buckling defect, a quantitative method for characterizing the degree of the buckling defect is proposed using the area of buckling profile. Then an orthogonal experimental scheme was designed taking the width of the middle rib, thickness of wall, and height of the middle rib as design variables and defining the area of buckling profile as optimization objective. Subsequently, a quadratic polynomial response surface model was established by combining the optimization algorithm with the finite element method (FEM), and the geometrical dimension of the middle ribs of the deformed AATWCRIHR is optimized. Also the optimal parameter combination to minimize the area of buckling profile is obtained and verified using FE simulation. Results show that the AATWCRIHR after optimization doesn’t generate the buckling defect during constrained ring rolling, and it is proved that the quantitative buckling defect representation method and the optimization design method based on the response surface model and the finite element simulation results are feasible for the constrained ring rolling process of the AATWCRIHR.

As the embedded device and internet of things (IoTs) concept prevalent in today's world, there is an increasing demand for the security and performance requirements on deploying these devices to private and public sectors. The crucial part of it is to protect privacy, confidentiality and integrity, meanwhile, maintain an adequate level of performance during transmission, storage and access of critical information. While the conventional cryptography methods, such as the Advanced Encryption Standard (AES), SHA$-$2 hashing method and RSA and Diffie Hellman for message authentication and identification, work well on systems which have reasonable processing power and memory capabilities. These do not scale well into a world with embedded systems and sensor networks, in conjunction with their nature of smaller size and lower cost. Thus, in the context of resource constrained device, lightweight cryptography methods are proposed to overcome many of the problems of conventional cryptography possessed. This includes constraints related to physical size, processing requirement, memory limitation, energy drain and production cost. This paper provides a survey of the architectures that are defined as replacements for conventional ciphers within an IoTs space and discuss some trends in the design of future lightweight algorithms. The performance metrics are carefully chosen to reflect and assess the suitability for embedded devices. The aim of this research is to identify the various performance metrics applied on different types of symmetric block ciphers especially lightweight ciphers and compare the results on versatile platforms with stream ciphers and public key methods. The comparative analysis on efficient LW cipher will be tested against other similar block ciphers on both MacBook Pro with Intel core and resource constrained device Raspberry Pi with ARM processor.

Semi-supervised consensus clustering is a promising strategy to compensate for the subjectivity of clustering and its sensitivity to design factors, with various techniques being recently proposed to integrate domain knowledge and multiple clustering partitions. In this article we present a new approach that makes double use of domain knowledge, namely to build the initial partitions as well as to combine them. In particular, we show how to model and integrate must-link and cannot-link constraints into the objective function of a generic consensus clustering (??) framework that maximizes the similarity between the consensus partition and the input partitions, which have, in turn, been enriched with the same constraints. In addition, borrowing from the theory of functional dependencies, the integrated framework exploits the notions of deductive closure and minimal cover to take full advantage of the logical implication between constraints. Using standard UCI benchmarks, we found that the resulting algorithm, termed ??? (double-Constrained Consensus Clustering), was more effective than plain ?? at combining base constrained partitions. We then argue that ??? is especially well-suited to profiling counterfeit e-commerce websites, because constraints can be acquired by leveraging specific domain features, and demonstrate its potential for detecting affiliate marketing programs. Taken together, our experiments suggest that ??? makes the process of clustering more robust and able to withstand changes in clustering algorithms, datasets, and features, with a remarkable improvement of average performance.

The Internet of Healthcare Things (IoHT) is an essential IoT domain that encompasses the necessary capabilities to transform the current healthcare system. IoHT generates, transfers, manages, stores, and processes highly confidential medical data and sensitive personal information. Thus, IoHT is a critical application from a security perspective and is most favorably targeted by attackers. Several security-breaching attempts can be carried out due to the vulnerabilities of the IoHT that put classified data at constant risk. Henceforth, this work aims to inspect the performance of 6LoWPAN-RPL-based `Patient-Centric IoHT’ in the presence of malicious intruders conducting blackhole, rank, and DoDAG attacks in both normal and emergency operational modes of the mentioned resource-constraint network. PC-IoHT is simulated on the Cooja simulator and Contiki-OS for each attack with two and four intruders (out of 10 motes) for both operation modes. Several performance evaluation parameters are used to assess the overall performance of the considered PC-IoHT. The attacks’ impact on PC-IoHT is analyzed by comparing blackhole, rank, and DoDAG attacks with the no-attack scenario.

Smart living, a concept that has gained increasing attention in recent years, revolves around integrating advanced technologies in homes and cities to enhance the quality of life for citizens. Sensing and human action recognition are crucial aspects of this concept. Smart living applications span various domains, such as energy consumption, healthcare, transportation, and education, which greatly benefit from effective human action recognition. This field, originating from computer vision, seeks to recognize human actions and activities using not only visual data but also many other sensor modalities. This paper comprehensively reviews the literature on human action recognition in smart living environments, synthesizing the main contributions, challenges, and future research directions. This review selects five key domains: Sensing Technology, Multimodality, Real-time Processing, Interoperability, and Resource-Constrained Processing, as they encompass the critical aspects required for successfully deploying human action recognition in smart living. These domains highlight the essential role that sensing and human action recognition play in successfully developing and implementing smart living solutions. This paper serves as a valuable resource for researchers and practitioners seeking to explore further and advance the field of human action recognition in smart living.

The notion of Critical Point Theory has extensive application in the filed of Partial Differential Equations, one of which is studying the existence and commenting on the uniqueness and multiplicity (in case when the solution is not unique) of weak solutions to Elliptic PDEs under certain boundary conditions.\par This article provides a brief survey about specific concepts like : differentiation on Banach Spaces, maxima and minima and its applications to PDEs. Furthermore, we've discussed the notion of defining a weak topology on Banach Spaces, before introducing the Variational Principle and its applications.\par The epilogue of the article primarily deals with results which studies the existence of weak solutions to Dirichlet Boundary Value Problems under specific conditions. The most notable aspect of this article is the proof of \textit{Rabinowitz's Saddle Point Theorem} using the method of \textit{Brouwer Degree}. Readers who are highly motivated in pursuing research in any of the topics relevent to the contents of this paper will surely find the \texttt{References} section to be extremely resourceful.