Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in that we show that approximating max bipartite clique is hard under the weaker assumption, that random 4-SAT formulas are hard to refute with high probability. On the positive side we present an efficient algorithm whic...

Background There are many critical steps for the clinical efficacy of antigen-specific T cell-based immunotherapies among which traffic to and access to tumor beds of effector T cells, are the most limiting [1]. Preclinical research most often uses ectopic mouse tumor models for the readout fastness and easiness provided by such models. However, those models may not be the optimal way to addres...

The generation of a topographical surface or digital elevation model for given set points in space is known problem civil engineering and topography. In this article, we propose simple efficient way to obtain the terrain by using structural shell finite element model, giving advice on how implement it. proposed methodology does not need large number define terrain, so it especially suitable be ...

This paper documents the application of the Poisson Inverse Gaussian (PIG) regression model for modeling motor vehicle crash data. The PIG distribution, which mixes the Poisson distribution and Inverse Gaussian distribution, has the potential for modeling highly dispersed count data due to the flexibility of Inverse Gaussian distribution. The objectives of this paper were to evaluate the applic...

This paper proposes a pattern called GIG, a generic interface graph which deals with definition and control of processes taking into account some specific requirements of simplicity, easiness of definition from algorithmic natural language and flexibility in the granularity of defined processes. The pattern is intended to help the design and reuse of programs.

This paper presents a pattern called GIG, a generic interface graph which deals with definition and control of processes taking into account some specific requirements of simplicity, easiness of definition from algorithmic language and flexibility in the granularity of defined processes. The pattern is intended to help the design and reuse of programs.

Shuffled Frog Leaping Algorithm (SFLA) is one of the most widespread algorithms. It was developed by Eusuff and Lansey in 2006. SFLA a population-based metaheuristic algorithm that combines benefits memetics with particle swarm optimization. has been used various areas, especially engineering problems due to its implementation easiness limited variables. Many improvements have made alleviate dr...

Usable Artificial Intelligence (AI) application refers to an AI solution that is characterized by the easiness of use and learning through optimum interface established a proficient Human-Computer Interface (HCI) design. This article reviews related literature find out importance HCI make valuable usable. The also investigates possible solutions guidelines ensure usability AI-powered applicatio...