Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).
Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the
... Show MoreArtificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing artificial TABU algorithm to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as sport, chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement.
The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show MoreThe aim of this research is to investigation the optimization of the machining parameters (spindle speed, feed rate, depth of cut, diameter of cutter and number of flutes of cutter) of surface roughness for free-form surface of composite material (Aluminum 6061 reinforced boron carbide) by using HSS uncoated flat end mill cutters which are rare use of the free-form surface. Side milling (profile) is the method used in this study by CNC vertical milling machine. The purpose of using ANFIS to obtain the better prediction of surface roughness values and decreased of the error prediction value and get optimum machining parameters by using Taguchi method for the best surface roughness at spindle speed 4500 r.p.m, 920mm/rev feed rate, 0.6mm de
... Show MoreObjective(s): to assess the factors which are associated with the prolonged prehospital delay of patients with
acute myocardial infarction.
Methodology: A descriptive study was conducted at the Coronary Care unit (CCU) in Al-Yarmok Teaching
Hospital, Ibn AL-Nafis Hospital for Cardiovascular Diseases, AL-Kadumia Teaching Hospital, Baghdad Teaching
Hospital, and AL-Kindy Teaching Hospital during the period of the study from February 2
nd
, 2009 to October 30th
,
2009. A random sample of (160) paƟent who were admiƩed to the hospitals were selected one by one. A
questionnaire was constructed for the purpose of the study, which is comprised of four parts that include (1)
sociodemographic data; (2) prehospital d
Oscillation criteria are obtained for all solutions of the first-order linear delay differential equations with positive and negative coefficients where we established some sufficient conditions so that every solution of (1.1) oscillate. This paper generalized the results in [11]. Some examples are considered to illustrate our main results.