Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef

The aim of this study was to critically appraise and synthesize the best available evidence on the effectiveness of interventions suitable for delivery by nurses, designed to enhance cardiac patients' adherence to their prescribed medications.

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

Early detection of brain tumors is critical for enhancing treatment options and extending patient survival. Magnetic resonance imaging (MRI) scanning gives more detailed information, such as greater contrast and clarity than any other scanning method. Manually dividing brain tumors from many MRI images collected in clinical practice for cancer diagnosis is a tough and time-consuming task. Tumors and MRI scans of the brain can be discovered using algorithms and machine learning technologies, making the process easier for doctors because MRI images can appear healthy when the person may have a tumor or be malignant. Recently, deep learning techniques based on deep convolutional neural networks have been used to analyze med

WA Shukur, journal of the college of basic education, 2011 The aim of this research is designing and implementing proposed steganographic method. The proposed steganographic method don’t use a specific type of digital media as a cover but it can use all types of digital media such as audio, all types of images, video and all types of files as a cover with the same of security, accuracy and quality of original data, considering that the size of embedded data must be smaller than the size of a cover. The proposed steganographic method hides embedded data at digital media without any changing and affecting the quality of the cover data. This means, the difference rate between cover before hiding operation and stego is zero. The proposed steg