Given a set of distinct non-negative integers X^n and a target certificate S in parametrized form: ∃X^k⊆X^n,∑_(x_i∈X^k)▒x_i =S (k=|X^k |,n=|X^n |). We present a polynomial solution of the subset sum problem with time complexity T≤O(kn)≤O(n^2) and space complexity S≤O(((n-1)n)/2)≤O(n^2 ), so that P = NP.

Lung cancer has been the leading cause of cancer death in the world. In addition to smoking, estrogen is supposed to play an important role in the lung cancer development because women have a higher proportion of adenocarcinoma than men. In the environment, there are many metabolites and wastes that mimic human estrogen structurally and functionally. As an oral contraceptive, 17α-ethynylestradiol (EE2) is released to wastewater after being utilized. Moreover, 4-nonylphenol (NP) exiting in the petrochemical products and air pollutants has estrogenic activity. In our study, 17β-estradiol (E2), EE2, and NP are administered to stimulate A549 male lung adenocarcinoma cells and H1435 female lung adenocarcinoma cells. The results demonstrate that EE2 and NP stimulate A549 and H1435 cells proliferation in a dose- and time-dependent trend. Both estrogen receptor α and β are activated simultaneously during these processes. Up-regulation of epidermal growth factor receptor (EGFR) and ERK expression is involved in response to estrogens. In conclusion, we first time report that EE2 and NP exert biotoxic effect to stimulate the proliferation of both male and female lung cancer cells in a dose- and time- response manner. New challenges from environmental hormones to lung cancer deserved further investigation.

We successfully fabricated Ag@Cu2O core-shell decorated on reduced graphene oxide (rGO) nanocomposites (ACRN) by a simple and convenient in situ substitution method. The properties of these ACRN with heterostructure layers were characterized by scanning and transmission electron microscopies and absorption spectroscopy. We used p-nitrophenol (4-NP) as a probe molecule to determine the chemical catalytic activity of the ACRN. Upon introduction of rGO, a high electron transfer efficiency was achieved; thus, the catalytic activity was improved significantly. Therefore, the ACRN exhibited significantly improved catalytic activity for the reduction of 4-NP and showed the high application value in the removal of toxic and harmful substances from water. In addition, the fabricated ACRN was used for the reduction of organic dyes and explosive pollutants to generate nontoxic products. Furthermore, the high charge redistribution and transfer among Ag, Cu2O and rGO in the ACRN induced the high catalytic reduction of organic pollutants, indicating the excellent potential of these materials for applications in water pollution treatment.

Cervi cornu has been extensively used in traditional medicine as an antioxidant and for the treatment of various disorders, including osteoporosis. However, since it is not easy to separate the active ingredient, absorption is not performed well. In this study, we extracted the low molecular weight (843Da) collagen NP-2007 from cervi cornu by enzyme hydrolyzation, and evaluated the therapeutic effect in a monosodium iodoacetate (MIA)-induced rat osteoarthritis model, and identified their molecular mechanisms. NP-2007 was orally administered at 50, 100, and 200 mg/kg for 21 d. Efficacy was evaluated based on serum parameters, inflammatory mediators, and mor-phological and histopathological analyses of knee joints. Production of matrix metalloproteinases, including MMP-2, MMP-3, and MMP-9, in the serum was higher in MIA-treated rats; however, these levels decreased after NP-2007 treatment. Serum levels of tumor necrosis factor-α, interleukin (IL)-1β, IL-6, and prostaglandin E2 were lower in the NP-2007 group than in the MIA group. Furthermore, the administration of NP-2007 resulted in effective preservation of both the synovial membrane and knee cartilage, and significantly decreased the transformation of fibrous tissue. This study indicates that NP-2007 can prevent and alleviate symptoms of osteoarthritis and have applications as a novel arthritis treatment.

Consider a robot that is navigating in a space modeled by a graph, and that wants to know its current location. It can send a signal to determine how far it is from each landmark among a set of fixed landmarks. We study the problem of computing the minimum required number of landmarks, and where they should be placed so that the robot can always determine its location. Since the problem is an NP-complete problem, the robot's responses to the actions are slow. To accelerate this response, we can use the parallel version of this problem. In this work, we introduce a new parallel implementation for determining the metric dimension of a given graph. We run the proposed algorithm on a symmetric multi-processing (SMP) cluster using C programming language and the Message Passing Interface (MPI) library. Finally, we run our implementation on four categories of graphs (the tracks in which the robot moves): a cycle graph Cn, a path graph Pn, a triangular snake graph and a ladder graph Ln. Preliminary computational results indicate that the metric dimension problem is an NP-complete problem and prove the ability of the proposed algorithm to achieve a speedup of 6 for 8 processors.

Using assembly theory, we investigate the assembly pathways of binary strings of length N formed by joining bits present in the assembly pool and the strings that entered the pool as a result of previous joining operations. We show that the string assembly index is bounded from below by the shortest addition chain for N, and we conjecture about the form of the upper bound. We define the degree of causation for the minimum assembly index and show that for certain N it features regularities that can be used to determine a shortest addition chain. We show that a string with the smallest assembly index for N can be assembled by a binary program of length equal to this index if the length of this string is expressible as a product of Fibonacci numbers. We conjecture that there is no binary program that has a length shorter than the length of the string having the largest assembly index for N that could assemble this string. The results confirm that four Planck areas provide a minimum information capacity that corresponds to a minimum thermodynamic (Bekenstein-Hawking) entropy. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that this problem is NP-complete, while the problem of creating the string so that it would have a predetermined largest assembly index is NP-hard. The proof of this conjecture would imply P ≠ NP, since every computable problem and every computable solution can be encoded as a finite binary string.

Graph coloring is a manifestation of graph partitioning, wherein, a graph is partitioned based on the adjacency of its elements. Partitioning serves potentially as a compartmentalization for any structural problem. Vertex coloring is the heart of the problem which is to find the chromatic number of a graph. The fact that there is no general efficient solution to this problem that may work unequivocally for all graphs opens up the realistic scope for combinatorial optimization algorithms to be invoked. The algorithmic complexity of graph coloring is non-deterministic in polynomial time (NP) and hard. To the best of our knowledge, there is no algorithm as yet that procures an exact solution of the chromatic number comprehensively for any and all graphs within the polynomial (P) time domain. However, several heuristics as well as some approximation algorithms have been attempted to obtain an approximate solution for the same. Here, we present a novel heuristic, namely, the 'trailing path', which returns an approximate solution of the chromatic number within polynomial time, and, with a better accuracy than most existing algorithms. The ‘trailing path’ algorithm is effectively a subtle combination of the search patterns of two existing heuristics (DSATUR and Largest First), and, operates along a trailing path of consecutively connected nodes (and thereby effectively maps to the problem of finding spanning tree(s) of the graph) during the entire course of coloring, where essentially lies both the novelty and the apt of the current approach. The study also suggests that the judicious implementation of randomness is one of the keys towards rendering an improved accuracy in such combinatorial optimization algorithms. Apart from the algorithmic attributes, essential properties of graph partitioning in random and different structured networks have also been surveyed, followed by a comparative study. The study reveals the remarkable stability and absorptive property of chromatic number across a wide array of graphs. Finally, a case study is presented to demonstrate the potential use of graph coloring in protein design – yet another hard problem in structural and evolutionary biology.

Background. Escalating global plastic production, expected to reach 34,000 million tons by 2050, poses a significant threat to human and environmental well-being, particularly in aquatic ecosystems. Microplastics (MP) and nanoplastics (NP), which originate from the degradation of plastics, are of concern due to their potential bioaccumulation and uptake of pollutants. This study addresses identification methods and focuses on insect meal, a raw material for aquaculture feed. Methods. By using different techniques, the study was able to detect MP and NP in insect meal samples. Chemical digestion with KOH at 60°C efficiently removed organic matter without affecting the synthetic polymer polyethylene (PE). Filtration, confocal Raman microscopy, SEM and TEM were used for comprehensive analysis and integrity tests on PE films were performed using Raman and FTIR spectroscopy. The results showed the presence of PE microplastic particles in the insect meal, which was confirmed by correlative Raman and SEM mapping on a positively charged surface. In addition, the increased resolution of the Raman microscope identified submicrometric PE NP (800 nm). Transmission electron microscopy (TEM) with energy dispersive X-ray spectroscopy (EDX) confirmed plastic-like structures in the insect meal, highlighting the presence of PE plastics characterized by irregular shapes and some agglomeration. The higher carbon concentration in the EDX analysis supported the plastic nature, which was also confirmed by Raman spectroscopy. Conclusions. The study provides a robust method for the detection of MP and NP in insect meal and provides valuable insight into the possible presence of plastics in insect-based aquafeeds. The combination of different analytical methods increases the reliability of the results and sets the stage for future investigations that could focus on the quantification of NP and the assessment of their potential environmental impact.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.