The file upload is one of the controls of the tool bar of the VisualStodio.NET, but it can’t be used with Ajax technology (It's almost impossible today to be involved in web application design or development and not be aware of Ajax) because the file upload control don’t support Ajax technology that the execution of the instruction is not completed or the (object is not set) message will appear, although the essential need to use this control with Ajax to gain the asynchronous data transfer that supplied by Ajax, because the file upload don’t work without the Postback operation from the client to the server, and the main idea of Ajax technology is working without Postback operation to the server. After the deep research in www.asp.net and www.msdn.microsoft.com sites the result was that the solution will be in the next version VisualStodio.NET 2008, but it was not a real solution because the Postback operation is continuous. So this paper suggests alternative solution to Ajax by building Web Services to upload files asynchronously and avoid reload the whole web site (Postback operation) when file uploading process is lemented.
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).
(1)
This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the HSS algorithm produce better performance than original Scatter Search algorithm. The HSS in the value of average fitness is 27.6% comparing with original SS. In other hand the elapsed time of HSS is larger than the original SS by small value. The developed algorithm has been compared with other algorithms for the same problem, and the r
... Show MoreThis article proposes a new strategy based on a hybrid method that combines the gravitational search algorithm (GSA) with the bat algorithm (BAT) to solve a single-objective optimization problem. It first runs GSA, followed by BAT as the second step. The proposed approach relies on a parameter between 0 and 1 to address the problem of falling into local research because the lack of a local search mechanism increases intensity search, whereas diversity remains high and easily falls into the local optimum. The improvement is equivalent to the speed of the original BAT. Access speed is increased for the best solution. All solutions in the population are updated before the end of the operation of the proposed algorithm. The diversification f
... Show More
(4)
(4)
The purpose of this research is to demonstrate the effectiveness of a program to address the problem of mixing similar letters in the Arabic language for students in the second grade of primary and to achieve the goal of the research. The researcher followed the experimental method to suit the nature of this research and found that there are statistically significant differences between the tribal and remote tests, The effectiveness of the proposed educational program. At the end of the research, the researcher recommends several recommendations, the most important of which are: 1 - Training students to correct pronunciation of the outlets, especially in the first three stages of primary education (primary) and the use of direct training
... Show MoreIn project management process, the objective is to define and develop a model for planning, scheduling, controlling, and monitoring different activities of a particular project. Time scheduling plays an important role in successful implementation of various activities and general outcome of project. In practice, various factors cause projects to suffer from time delay in accomplishing the activities. One important reason is imprecise knowledge about time duration of activities. This study addresses the problem of project scheduling in uncertain resource environments, which are defined by uncertain activity durations. The study presents a solution of the levelling and allocation problems for projects that have some uncertain ac
... Show More
This paper presents a fully computerized method to backup the router configuration file. The method consists of a friendly graphical interface programmed by Java programming language.
The proposed method is compared with the two existing methods, namely: TFTP server method and Copy/Paste method. The comparison reveals that the proposed method has many advantages over the existing ones. The proposed method has been implemented on Cisco routers (series 2500, 2600 and 2800).
The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid
... Show MoreThis paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six employees , and it was chosen queuing model is a single-service channel M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and it was composed of data collection times (arrival time , service time, departure time)
... Show More
In this paper, we investigate some methods to solve one of the multi-criteria machine scheduling problems. The discussed problem is the total completion time and the total earliness jobs To solve this problem, some heuristic methods are proposed which provided good results. The Branch and Bound (BAB) method is applied with new suggested upper and lower bounds to solve the discussed problem, which produced exact results for in a reasonable time.
(10)
(3)
This is a philosophical statements regrading the structural and functional ponds between criminal law and philosophy.
Aiming to prove the practical value of philosophy regarding the question of the true nature of law in general and criminal justice – law in particular.
We try to revel the deepest connections that shape the fundamental character us tics of law in reality far from the misunderstanding general by social, political and cultural influences that affection negatively the efficiency of the law.
The elementary question of the study is how to
... Show More