Separation of propranolol enantiomers through membranes based on chiral derivatized polysulfone

The characterization of new synthesized chiral polymeric membranes, based in polysulfone polymer is here reported. Polysulfone was derivatized to chiral polysulfone, by bonding covalently the chiral carrier, N-dodecyl-4(R)-hydroxy-l-proline, to the polymer matrix. Two different chiral polysulfones, referred to as CPS_A and CPS_B, have been synthesized and used in the preparation of chiral polymeric membranes. However, as a consequence of the limited CPS_B solubility, only CPS_A resulted adequate to obtain useful membranes. Therefore, various chiral polysulfone membranes containing different amounts of CPS_A in unmodified polysulfone (PS) were prepared and properly characterized by scanning electron microscopy (SEM) and by enantioselective transport experiments of racemic propranolol. Dialysis transport experiments allowed us to determine the influence of the carrier content in the membrane on the transport rate and on enantiomer separation. Membranes containing a CPS_A/PS ratio of 1:3 showed an alpha value of 1.1 at 96 h of performance. Modelling of the propranolol transport rate is also performed.     

Efficient primal-dual heuristic for a dynamic location problem

In this paper the dynamic location problem with opening, closure and reopening of facilities is formulated and an efficient primal-dual heuristic that computes both upper and lower limits to its optimal solution is described. The problem here studied considers the possibility of reconfiguring any location more than once over the planning horizon. This problem is NP-hard (the simple plant location problem is a special case of the problem studied). A primal-dual heuristic based on the work of Erlenkotter [A dual-based procedure for uncapacitated facility location. Operations Research 1978;26:992–1009] and Van Roy and Erlenkotter [A dual-based procedure for dynamic facility location. Management Science 1982;28:1091–105] was developed and tested over a set of randomly generated test problems. The results obtained are quite good, both in terms of the quality of lower and upper bounds calculated as in terms of the computational time spent by the heuristic. A branch-and-bound procedure that enables to optimize the problem is also described and tested over the same set of randomly generated problems.     

Perceptual primitives from an extended 4D Hough transform

Directional features extracted from Gabor wavelets responses were used to train a structure of self-organising maps, thus classifying each pixel in the image within a neuron-map. Resulting directional primitives were grouped into perceptual primitives introducing an extended 4D Hough transform to group pixels with similar directional features. These can then be used as perceptual primitives to detect salient structures. The proposed method has independently fixed parameters that do not need to be tuned for different kind or quality of images. We present results in application to noisy FLIR images and show that line primitives for complex structures, such as bridges, or simple structures, such as runways, can be found by this approach. We compare and demonstrate the quality of our results with those obtained through a parameter-dependent traditional Canny edge detector and Hough line finding process.     

Environmental damage costs in Iran by the energy sector

On the basis of the energy supply and demand, this paper assesses the environmental damage from air pollution in Iran using the Extern-E study that has extended over 10 years and is still in progress in the European Union (EU) commission. Damage costs were transferred from Western European practice to the conditions of Iran by scaling according to GDP per capital measured in PPP terms.     

Converting Daily Rainfall Data to Sub-daily—Introducing the MIMD Method

One of the most important analysis in many hydrological and agricultural studies is to convert the daily rainfall data into sub-daily (hourly) because in many rainfall stations, only the daily rainfall data are available and for a comprehensive rainfall analysis, these data should be converted to sub-daily. Many experimental and analytical methods are available for this conversion but one of the simplest yet accurate ones has been proposed by the Indian Meteorological Department (IMD). Since the IMD method has shown low accuracy in some regions, in this study, the IMD method is modified to a single parameter equation, called Modified Indian Meteorological Department (MIMD) in order to improve the accuracy of the conversion. For this reason, the parameter is calibrated so that the maximum correlation between observed and estimated values is achieved. Five stations in different regions with different climatic conditions were selected so that the daily and sub-daily rainfall data were available in each of them. Then, the parameter of the MIMD method was derived for each station. The results were compared with both observed data and IMD method and it was shown that the mean correlation coefficient of MIMD and IMD methods were 0.9 and 0.73 respectively for 12-h rainfall depth which indicated that the accuracy of the MIMD method in estimation of sub-daily rainfall depths was significantly increased. Moreover, the results showed that the accuracy of the MIMD method decreases as rainfall duration decreases.

     

Ignite-GPU: a GPU-enabled in-memory computing architecture on clusters

The Journal of Supercomputing - During recent years, big data explosion and the increase in main memory capacity, on the one hand, and the need for faster data processing, on the other hand, have...     

Efficient designs of reversible sequential circuits

The Journal of Supercomputing - Recently, the synthesis of reversible sequential circuits has attracted researchers’ attention for implementing low-power logic designs. So far, the direct and...     

Extremal optimization vs. learning automata: Strategies for spin selection in portfolio selection problems

Nowadays, various imitations of natural processes are used to solve challenging optimization problems faster and more accurately. Spin glass based optimization, specifically, has shown strong local search capability and parallel processing. But, spin glasses have a low rate of convergence since they use Monte Carlo simulation techniques such as simulated annealing (SA). Here, we propose two algorithms that combine the long range effect in spin glasses with extremal optimization (EO-SA) and learning automata (LA-SA). Instead of arbitrarily flipping spins at each step, these two strategies aim to choose the next spin and selectively exploiting the optimization landscape. As shown in this paper, this selection strategy can lead to faster rate of convergence and improved performance. The resulting two algorithms are then used to solve portfolio selection problem that is a non-polynomial (NP) complete problem. Comparison of test results indicates that the two algorithms, while being very different in strategy, provide similar performance and reach comparable probability distributions for spin selection. Furthermore, experiments show there is no difference in speed of LA-SA or EO-SA for glasses with fewer spins, but EO-SA responds much better than LA-SA for large glasses. This is confirmed by tests results of five of the world's major stock markets. In the last, the convergence speed is compared to other heuristic methods such as Neural Network (NN), Tabu Search (TS), and Genetic Algorithm (GA) to approve the truthfulness of proposed methods.     

On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.