Continuous GRASP with a local active-set method for bound-constrained global optimization

Global optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic-based on the CGRASP and GENCAN methods-for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Purification and partial characterization of a midgut membrane-bound alpha-glucosidase from Quesada gigas (Hemiptera: Cicadidae)

Adults of Quesada gigas (Hemiptera: Cicadidae) have a major alpha-glucosidase bound to the perimicrovillar membranes, which are lipoprotein membranes that surround the midgut cell microvilli in Hemiptera and Thysanoptera. Determination of the spatial distribution of alpha-glucosidases in Q. gigas midgut showed that this activity is not equally distributed between soluble and membrane-bound isoforms. The major membrane-bound enzyme was solubilized in the detergent Triton X-100 and purified to homogeneity by means of gel filtration on Sephacryl S-100, and ion-exchange on High Q and Mono Q columns. The purified alpha-glucosidase is a protein with a pH optimum of 6.0 against the synthetic substrate p-nitrophenyl alpha-D-glucoside and M(r) of 61,000 (SDS-PAGE). Taking into account V(Max)/K(M) ratios, the enzyme is more active on maltose than sucrose and prefers oligomaltodextrins up to maltopentaose, with lower efficiency for longer chain maltodextrins. The Q gigas alpha-glucosidase was immunolocalized in perimicrovillar membranes by using a monospecific polyclonal antibody raised against the purified enzyme from Dysdercus peruvianus. The role of this enzyme in xylem fluid digestion and its possible involvement in osmoregulation is discussed. (C) 2009 Elsevier Inc. All rights reserved.

Produktion, skador och grenegenskaper hos 10-årig tall i ett kombinerat förbands- och avkommeförsök : Volume production, damages and branch properties in a 10-year old combined spacing and progeny trial of Scots pine

A Scots pine (Pinus sylvestris) progeny trial was established in 1990, in the southwestern part of Sweden. The offspring was from 30 plus trees. The trial is located on abandoned agricultural land and has a single tree block design with a variation in spacing. The trial has been damaged by voles. At a tree age of ten years, growth, damages and branch properties were estimated. An analysis of variance on height, diameter and stem volume shows significant difference between spacing and progenies as well as interactions between these factors. As indicated by a better annual height increment and fewer and thinner branches at each whorl the densest spacing has the highest potential to produce quality logs.There were also differences between progenies in growth and quality traits. Some progenies combined good growth and branch characters with low mortality, straight stems and few damages. Other progenies had superior volume production.

Statistical bound of genetic solutions to quadratic assignment problems

Quadratic assignment problems (QAPs) are commonly solved by heuristic methods, where the optimum is sought iteratively. Heuristics are known to provide good solutions but the quality of the solutions, i.e., the confidence interval of the solution is unknown. This paper uses statistical optimum estimation techniques (SOETs) to assess the quality of Genetic algorithm solutions for QAPs. We examine the functioning of different SOETs regarding biasness, coverage rate and length of interval, and then we compare the SOET lower bound with deterministic ones. The commonly used deterministic bounds are confined to only a few algorithms. We show that, the Jackknife estimators have better performance than Weibull estimators, and when the number of heuristic solutions is as large as 100, higher order JK-estimators perform better than lower order ones. Compared with the deterministic bounds, the SOET lower bound performs significantly better than most deterministic lower bounds and is comparable with the best deterministic ones. 

Evidence Algorithm and Processing Formalized Mathematical Texts

The goal of a research programme Evidence Algorithm is a development of an open system of automated proving that is able to accumulate mathematical knowledge and to prove theorems in a context of a self-contained mathematical text. By now, the first version of such a system called a System for Automated Deduction, SAD, is implemented in software. The system SAD possesses the following main features: mathematical texts are formalized using a specific formal language that is close to a natural language of mathematical publications; a proof search is based on special sequent-type calculi formalizing natural reasoning style, such as application of definitions and auxiliary propositions. These calculi also admit a separation of equality handling from deduction that gives an opportunity to integrate logical reasoning with symbolic calculation.

Study of the audio coding algorithm of the MPEG-4 AAC standard and comparison among implementations of modules of the algorithm

Audio coding is used to compress digital audio signals, thereby reducing the amount of bits needed to transmit or to store an audio signal. This is useful when network bandwidth or storage capacity is very limited. Audio compression algorithms are based on an encoding and decoding process. In the encoding step, the uncompressed audio signal is transformed into a coded representation, thereby compressing the audio signal. Thereafter, the coded audio signal eventually needs to be restored (e.g. for playing back) through decoding of the coded audio signal. The decoder receives the bitstream and reconverts it into an uncompressed signal. ISO-MPEG is a standard for high-quality, low bit-rate video and audio coding. The audio part of the standard is composed by algorithms for high-quality low-bit-rate audio coding, i.e. algorithms that reduce the original bit-rate, while guaranteeing high quality of the audio signal. The audio coding algorithms consists of MPEG-1 (with three different layers), MPEG-2, MPEG-2 AAC, and MPEG-4. This work presents a study of the MPEG-4 AAC audio coding algorithm. Besides, it presents the implementation of the AAC algorithm on different platforms, and comparisons among implementations. The implementations are in C language, in Assembly of Intel Pentium, in C-language using DSP processor, and in HDL. Since each implementation has its own application niche, each one is valid as a final solution. Moreover, another purpose of this work is the comparison among these implementations, considering estimated costs, execution time, and advantages and disadvantages of each one.

New developmental stages for common marmosets (Callithrix jacchus) using mass and age variables obtained by K-means algorithm and self-organizing maps (SOM)

LEÃO, Adriano de Castro; DÓRIA NETO, Adrião Duarte; SOUSA, Maria Bernardete Cordeiro de. New developmental stages for common marmosets (Callithrix jacchus) using mass and age variables obtained by K-means algorithm and self-organizing maps (SOM). Computers in Biology and Medicine, v. 39, p. 853-859, 2009

Membrane-bound alkaline phosphatase from ectopic mineralization and rat bone marrow cell culture

Cells from rat bone marrow exhibit the proliferation-differentiation sequence of osteoblasts, form mineralized extracellular matrix in vitro and release alkaline phosphatase into the medium. Membrane-bound alkaline phosphatase was obtained by method that is easy to reproduce, simpler and fast when compared with the method used to obtain the enzyme from rat osseous plate. The membrane-bound alkaline phosphatase from cultures of rat bone marrow cells has a MWr of about 120 kDa and specific PNPP activity of 1200 U/tng. The ecto-enzyme is anchored to the plasma membrane by the GPI anchor and can be released by PIPLC (selective treatment) or polidocanol (0.2 mg/mL protein and 1% (w/v) detergent). The apparent optimum pH for PNPP hydrolysis by the enzyme was pH 10. This fraction hydrolyzes ATP (240 U/mg), ADP (350 U/ mg), glucose 1-phosphate (1100 U/mg), glucose 6-phosphate (340 Wing), fructose 6-phosphate (460 U/mg), pyrophosphate (330 U/mg) and (3glycerophosphate (600 U/mg). Cooperative effects were observed for the hydrolysis of PPi and beta-glycerophosphate. PNPPase activity was inhibited by 0.1 mM vanadate (46%), 0.1 mM ZnCl2 (68%), 1 mM levamisole (66%), 1 mM arsenate (44%), 10 mM phosphate (21%) and 1 mM theophylline (72%). We report the biochemical characterization of membrane-bound alkaline phosphatase obtained from rat bone marrow cells cultures, using a method that is simple, rapid and easy to reproduce. Its properties are compared with those of rat osseous plate enzyme and revealed that the alkaline phosphatase obtained has some kinetics and structural behaviors with higher levels of enzymatic activity, facilitating the comprehension of the mineralization process and its function. (c) 2006 Elsevier B.V. All rights reserved.

Image processing algorithm for the identification of Martian dust devil tracks in MOC and HiRISE images

This paper presents a method for automatic identification of dust devils tracks in MOC NA and HiRISE images of Mars. The method is based on Mathematical Morphology and is able to successfully process those images despite their difference in spatial resolution or size of the scene. A dataset of 200 images from the surface of Mars representative of the diversity of those track features was considered for developing, testing and evaluating our method, confronting the outputs with reference images made manually. Analysis showed a mean accuracy of about 92%. We also give some examples on how to use the results to get information about dust devils, namelly mean width, main direction of movement and coverage per scene. (c) 2012 Elsevier Ltd. All rights reserved.

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)