A 1314 nm two-crystal Nd:YLF laser was designed and operated in both CW and actively Q-switched modes. Maximum CW output of 26.5 W resulted from 125 W of combined incident pump power. Active Q-switching was obtained by inserting a Brewster-cut acousto optic modulator. This setup delivered an average power of 18.6 W, with a maximum of 5.6 mJ energy per pulse with a pulse duration of 36 ns at a p...

In this paper, we propose a new parallel algorithm that can help the maximum neural network escape from local minima for maximum cut problem. By adding a nonlinear self-feedback to the maximum neural network, the proposed parallel algorithm has richer and more flexible dynamics and can prevent the network from getting stuck at local minima. A large number of instances have been simulated to ver...

One of the most significant and effective criteria in the process of cutting dimensional rocks using the gang saw is the maximum energy consumption rate of the machine, and its accurate prediction and estimation can help designers and owners of this industry to achieve an optimal and economic process. In the present research work, it is attempted to study and provide models for predicting the m...

1. Max-3-SAT: In this case, Γ represents the OR-predicate. 2. Max-Cut: We can model this as a CSP where the vertices that get assigned to one side get 0 value and the other gets 1; so the domain set is D = {0, 1}. The set Γ contains only 6= predicate. 3. Max-E3-LIN2: The domain is {0, 1}. There are two types of precidates in Γ, i.e. xi + xj + xk = 0 and xi + xj = xk = 1 (under modolu two.) 4. M...

In this work, we present a theoretical study about NP-hard optimization problems of cuts in graphs and the state of the art in approximation algorithms that use techniques of mathematical programming and of metric spaces. Three problems of cuts in graphs were modeled by integer mathematical programs and they are relaxed to admit solutions with continuous values. The solution of these programs d...

We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and very general) definition of niceness, we show that if a nice weighted problem is hard to approximate within r, then its polynomially bounded weighted version is hard to approximate within r − o(1). Then we turn our attention to specific p...

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...