Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

In this article, the usual factorials and binomial coefficients have been generalized and extended to the negative integers. Basing on this generalization and extension, a new kind of polynomials has been proposed, which led directly to the non-classical hypergeometric orthogonal polynomials and the non-classical second-order hypergeometric linear DEs. The resulting polynomials can be used in non-relativistic and relativistic QM, particularly, in the case of the Schrödinger equation, and Dirac equations for an electron in a Coulomb potential field.

Effective prediction of wastewater treatment is beneficial for precise control of wastewater treatment processes. The nonlinearity of pollutant indicators such as COD and TP makes the model difficult to fit and has low prediction accuracy. The classical deep learning methods have been shown to perform nonlinear modeling. However, there are enormous numerical differences between multi-dimensional data in the prediction problem of wastewater treatment, such as COD above 3000 mg/L and TP around 30 mg/L. It will make current normalization methods challenging to handle effectively, leading to the training failing to converge and the gradient disappears or exploding. This paper proposes a multi-factor prediction model based on deep learning. The model consists of a combined normalization layer and a codec. The combined normalization layer combines the advantages of three normalization calculation methods: z-score, Interval, and Max, which can realize the adaptive processing of multi-factor data, fully retain the characteristics of the data, and finally cooperate with the codec to learn the data characteristics and output the prediction results. Experiments show that the proposed model can overcome data differences and complex nonlinearity in predicting industrial wastewater pollutant indicators and achieve better prediction accuracy than classical models.

The capacitated team orienteering problem with time windows (CTOPTW) is a NP-hard combinatorial optimization problem. In the CTOPTW, a set of customers is given each with a profit, a demand, a service time and a time window. A homogeneous fleet of vehicles is available for serving customers and collecting their associated profits. Each vehicle is constrained by a maximum tour duration and a limited capacity. The CTOPTW is concerned with the determination of a preset number of vehicle tours that begin and end at a depot, visit each customer no more than once while satisfying the time duration, time window and vehicle capacity constraints on each tour. The objective is to maximize the total profit collected. In this study we propose an iterated local search (ILS) algorithm to deal with the CTOPTW. ILS is a single solution based meta-heuristic that successively invokes a local search procedure to explore the solution space. A perturbation operator is used to modify the current local optimum solution in order to provide a starting solution for the local search procedure. As different problems and instances have different characteristics, the success of the ILS is highly dependent on the local search procedure, the perturbation operator(s) and the perturbation strength. The basic ILS uses a single perturbation operator and the perturbation strength remains the same during the optimization process. To address these issues, we use three different perturbation operators and a varying perturbation strength which changes as the algorithm progresses. The idea is to assign a larger perturbation strength in the early stages of the search in order to focus on exploring the search space. The perturbation strength is gradually decreased so that we focus more on exploitation. The computational results show that the proposed ILS algorithm is able to generate high quality solutions on the CTOPTW benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both the solution quality and computational time. Moreover, the proposed ILS produces 21 best known results and 5 new best solutions.

The up-and-coming microfluidic technology is the most promising platform for designing anti-cancer drugs and new point-of-care diagnostics. Compared to conventional drug screening methods based on Petri dishes and animal studies, drug delivery in microfluidic systems has many advantages. For instance, these platforms offer high throughput drug screening, require a small amount of samples, provide an in vivo-like microenvironment for cells, and eliminate ethical issues associated with animal studies. Multiple cell cultures in microfluidic chips could better mimic the 3D tumor environment using low reagents consumption. The clinical experiments have shown that combinatorial drug treatments have a better therapeutic effect than monodrug therapy. So many attempts were performed in this field in the last decade. This review highlights the applications of microfluidic chips in anti-cancer drug screening and systematically categorizes these systems as a function of sample size and combination of drug screening. Finally, it provides a perspective on the future of the clinical applications of microfluidic systems for anti-cancer drug development.

In tracking-by-detection paradigm for multi-target tracking, target association is modeled as an optimization problem that is usually solved through network flow formulation. In this paper, we proposed combinatorial optimization formulation and used a bipartite graph matching for associating the targets in the consecutive frames. Usually, the target of interest is represented in a bounding box and track the whole box as a single entity. However, in the case of humans, the body goes through complex articulation and occlusion that severely deteriorate the tracking performance. To partially tackle the problem of occlusion, we argue that tracking the rigid body organ could lead to better tracking performance compared to the whole body tracking. Based on this assumption, we generated the target hypothesis of only the spatial locations of person’s heads in every frame. After the localization of head location, a constant velocity motion model is used for the temporal evolution of the targets in the visual scene. Qualitative results are evaluated on four challenging video surveillance dataset and promising results has been achieved.

Many combinatorial optimization problems are hard to solve within the polynomial computational time or NP-hard problems. Therefore, developing new optimization techniques or improving existing ones still grab attention. This paper presents an improved variant of the Ant Colony Optimization meta-heuristic called Enhanced Hyper Cube Framework ACO (EHCFACO). This variant has an enhanced exploitation feature that works through two added local search movements of insertion and bit flip. In order to examine the performance of the improved meta-heuristic, a well-known structural optimization problem of laminate Stacking Sequence Design (SSD) for maximizing critical buckling load has been used. Furthermore, five different ACO variants were concisely presented and implemented to solve the same optimization problem. The performance assessment results reveal that EHCFACO outperforms the other ACO variants and produces a cost-effective solution with considerable quality.

$P$ versus $NP$ is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is $P$ equal to $NP$? The precise statement of the $P$ versus $NP$ problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is $\textit{P-Sel}$. $\textit{P-Sel}$ is the class of decision problems for which there is a polynomial time algorithm (called a selector) with the following property: Whenever it's given two instances, a $``yes"$ and a $``no"$ instance, the algorithm can always decide which is the $``yes"$ instance. It is known that if $NP$ is contained in $\textit{P-Sel}$, then $P = NP$. We consider the problem of computing the sum of the weighted densities of states of a Boolean formula in $3CNF$. Given a Boolean formula $\phi$ with $m$ clauses, the density of states $n(E)$ for some integer $0 \leq E \leq m$ counts the number of truth assignments that leave exactly $E$ clauses unsatisfied in $\phi$. The weighted density of states $m(E)$ is equal to $E \times n(E)$. The sum of the weighted densities of states of a Boolean formula in $3CNF$ with $m$ clauses is equal to $\sum_{E = 0}^{m} m(E)$. We prove that we can calculate the sum of the weighted densities of states in polynomial time. Given two Boolean formulas $\phi_{1}$ and $\phi_{2}$ in $3CNF$ with $n$ variables and $m$ clauses, the combinatorial optimization problem $\textit{SELECTOR-3SAT}$ consists in selecting the formula which is satisfiable, where every clause from $\phi_{1}$ and $\phi_{2}$ can be unsatisfied for some truth assignment. We assume that the formula that is satisfiable has the minimum sum of the weighted densities of states. In this way, we solve $\textit{SELECTOR-3SAT}$ with an exact polynomial time algorithm. We claim this problem is a selector of $3SAT$ and thus, $P = NP$.

3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML and CityJSON use polygonal modelling in order to represent geometries. True topological data structures have proven to be more computationally efficient for geometric analysis compared to polygonal modelling. In a previous study, we have introduced a method to topologically reconstruct CityGML models while maintaining the semantic information of the dataset, based solely on the combinatorial map (C-Map) data structure. As a result of the limitations of C-Map's semantic representation mechanism, the resulting datasets could suffer either from semantic information loss or the redundant repetition of them. In this article, we propose a solution for a more efficient representation of both geometry, topology and semantics by incorporating the C-Map data structure in the CityGML data model and implementing a CityJSON extension to encode the C-Map data. In addition, we provide an algorithm for the topological reconstruction of CityJSON datasets to append them according to this extension. Finally, we apply our methodology to three open datasets in order to validate our approach when applied to real-world data. Our results show that the proposed CityJSON extension can represent all geometric information of a city model in a lossless way, providing additional topological information for the objects of the model.

In this paper, we mainly show that generalized hyperharmonic number sums with reciprocal binomial coefficients can be expressed in terms of classical (alternating) Euler sums, zeta values and generalized (alternating) harmonic numbers.

In the paper, by virtue of techniques in combinatorial analysis, the authors simplify two families of nonlinear ordinary differential equations in terms of the Stirling numbers of the first kind.

The existence of multiple copies of genes is a well-known phenomenon. A gene family is a set of sufficiently similar genes, formed by gene duplication. In earlier works conducted on limited number of completely sequenced and annotated genomes it was found that size of gene family and size of genome are positively correlated. Additionally, it was found that several atypical microbes deviated from the observed general trend. In this study, we reexamined these associations on a larger dataset consisting of 1484 prokaryotic genomes and using several ranking approaches. We applied ranking methods in such a way that genomes with lower number of paralogs would have lower rank. Until now only simple ranking methods were used; we applied the Kemeny optimal aggregation approach as well. Regression and correlation analysis were utilized in order to accurately quantify and characterize the relationships between measures of paralog indices and genome size. In addition, boxplot analysis was employed as a method for outlier detection. We found that, in general, all paralog indexes positively correlate with an increase of genome size. As expected, different groups of atypical prokaryotic genomes were found for different types of paralog quantities.

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. Currently, a major persisting problem is to cherry pick the combinations based on expert advice, literature survey or guesses for investigation. This entails investment in time, energy and expenses at various levels of research. To address these issues, a search engine design was recently been developed, which showed promise by revealing existing confirmatory published wet lab results. Additionally and of import, the engine mined up a range of unexplored/untested/unknown combinations of genetic factors in the Wnt pathway that were affected by ETC-1922159 enantiomer, a PORCN-WNT inhibitor, after the colorectal cancer cells were treated with the inhibitor drug. As an example, MYC is known to upregulate PRC2 complex. PRC2 complex contains EZH2, which suppresses tumor suppressor genes via epigenetic modifications. MYC and HOXB8 are up regulated in colorectal cancer, however, the dual working mechanism of the same is not known. The in silico engine showed positioning which correctly approximates and assigns to this 3rd order combination of MYC-HOXB8-EZH2, pointing to the in vitro/in vivo down regulation by ETC-1922159. If the protein interaction of MYC-HOXB8 can be established and a study be done apropos EZH2, it will establish at in vitro/in vivo level, the in silico ranking also. The potential of this engine is immense given the problem faced in biology and other fields. Here we elucidate the R code to understand the mechanics of the search engine in a fluid manner for systems biologists. Though the search engine is in the developmental stage, we share the detailed mechanism of the working principles of the same as it can be generalized to problems in other fields.

WNT10B belongs to the family of WNT proteins that are implicated in a range of phenomena that are affected by the Wnt signaling pathway. Recent studies have shown that WNT10B plays a role in colorectal cancer. WNTs have been found to directly affect the stemness of the tumor cells via regulation of ASCL2. Switching off the ASCL2 literally blocks the stemness process of the tumor cells and vice versa. Furthermore, recent findings suggest BVES to be highly suppressed in malignancies and in vitro deletions of BVES show higher Wnt signaling activity to induce stem- ness. WNT10B was found to be highly expressed in such cases. Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. For example, WNT10B-ASCL2 is one such 2^nd order combination whose relation needs to be tested under the influence of recently developed porcupine-WNT inhibitor ETC-1922159. The inhibitor is known to suppress PORCN (porcupine) and thus inhibit a range of oncogenes known to be directly or indirectly affected by the Wnts. In a recent unpublished work in bioRxiv, Sinha 1, we had the opportunity to rank these unknown biological hypotheses for down regulated genes at 2^nd order level after the drug was administered. The in silico observations showed that the combination of WNT10B-ASCL2 was assigned a relatively lower rank, thus validating the pipeline’s efficacy with the confirmed wet lab experiment that indicate that both WNT10B and ASCL2 were down regulated after treatment in cancer cells. Here, we take one step further by in silico analysis of the 3rd order combinations of WNT10B-X-X (X can be known or unknown factor), from a range of 100 randomly picked down regulated genes after ETC-1922159 treatment. The pipeline uses the density based HSIC (Hilbert Schmidt Information Criterion) sensitivity index with an rbf (ra- dial basis function) kernel, which is known to be highly effective in sensitivity analysis. Various unknown/unexplored/untested 3^rd order biological hypotheses emerge some of which are con- firmed in wet lab, while others need to be tested. The potential of such ranking is indispensable in the current era of search in a vast combinatorial forest.

DNA repair helps in maintaining the proper and healthy functioning for the cells in the human body. Failure in DNA repair process can lead to aberrations as well as tumorous stages. There are various types of damages that a DNA can go through, one of which is the DNA double strand breaks (DSB) that can be repaired via homologous recombination (HR). RAD51 plays a central role in HR and has been implicated as a negative/poor prognostic marker for colorectal adenocarcinoma, with high expression in colorectal cancer. Mechanistically, RAD51AP1 facilitates RAD51 during the repairing process by binding with RAD51 via two DNA binding sites, thus helping in the D-loop formation in the HR process. Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. For example, RAD51AP1-XRCC2 is one such 2^nd order combination whose relation needs to be tested under the influence recently developed Porcupine-WNT inhibitor ETC-1922159. The x-ray repair cross complementing XRCC family is known to work as a mediator or stabilizer for RAD51 during the HR process. The inhibitor is known to suppress Porcupine and thus inhibit a range of oncogenes known to be directly or indirectly affected by the Wnts. In a recent unpublished work in bioRxiv, we had the opportunity to rank these unknown biological hypotheses for down regulated genes at 2^nd order level after the drug was administered. The in silico observations showed that the combination of RAD51AP1-XRCC2 was assigned a relatively lower rank, thus validating the pipeline's efficacy with the confirmed wet lab experiment that indicate that both RAD51AP1 and XRCC2 were down regulated after treatment in cancer cells. Here, we take one step further by in silico analysis of the 3^rd order combinations of RAD51-X-X & RAD51AP1-X-X (X can be known or unknown factor), from a range of 100 randomly picked down regulated genes after ETC-1922159 treatment. The pipeline uses the density based HSIC (Hibert Schmidth Information Criterion) sensitivity index with an rbf (radial basis function) kernel, which is known to be highly effective in sensitivity analysis. Various unknown/unexplored/untested RAD51/RAD51AP1 related 3^rd order biological hypotheses emerge some of which are confirmed in wet lab, while others need to be tested.

\textsc{Background} Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. Currently, a major problem in biology is to cherry pick the combinations based on expert advice, literature survey or guesses for investigation. The search and wet lab testing of these combinations costs a lot in terms of time, investment and energy. In a recent development of the PORCN-WNT inhibitor ETC-1922159 for colorectal cancer, a list of down-regulated genes were recorded in a time buffer after the administration of the drug. The regulation of the genes were recorded individually but for a majority, it is still not known which higher ($\geq 2$) order combinations might be playing a greater role in the pathway. \textsc{Results} The pipeline provides a prioritised list of important $2^{nd}$ order combinations of a range of family of genes involved in the Wnt pathway. More specifically, it reveals the various unexplored FZD-WNT combinations that have been untested till now in the pathway. In relation to ETC-1922159 affected combinations, the down-regulation of LGR-RNF family after the drug treatment is evident in these rankings as it takes bottom priorities for LGR5-RNF43 combination. The LGR6-RNF43 takes higher ranking than LGR5-RNF43, indicating that it might not be playing a greater role as LGR5 during the Wnt enhancing signals. These rankings confirm the efficacy of the proposed search engine design. \textsc{Conclusion} A pipeline has been developed to prioritise an $n^{th}$ order combination of factors that affect a signaling pathway. It takes into account the sensitivity indices computed from variance based (SOBOL) and density-kernel based (HSIC) methods to estimate the influence of each factor or combination of factors. These are then fed as feature vectors into a powerful support vector ranking algorithm that produces a ranked list of the interactions/combinations.