ISSN: 2310-2799
Aviso:
Los resultados se limitan exclusivamente a documentos publicados en revistas incluidas en el Catálogo 2.0 de Latindex.
Para más información sobre el Descubridor de Artículos escribir al correo: descubridorlatindex@gmail.com.
Leer más
Búsqueda por:
546,196 artículos
|
Año:
2016
ISSN:
1688-6593, 1688-3691
Rodríguez Arzuaga, Mariana; Salsi, María Sara; Piagentini, Andrea Marcela
Laboratorio Tecnológico del Uruguay - LATU
Resumen
The effect of the minimal processing with and without treatment with citric and ascorbic acids and yerba mate on the physicochemical, bioactive, microbiological and sensory characteristics of ‘Granny Smith’ apples was studied. Soluble solids and polyphenol contents, total aerobic mesophilic microorganism counts, sour taste and the browning sensory attribute were reduced by the minimal processing (without chemical treatment), while the sensory general appearance improved. When comparing the results obtained for the treated and untreated (control) freshcut apples, it was observed that the applied chemical treatment reduced the characteristic flavor of the apples and increased the sour taste, off-flavors and off-odors. However, the treatment was effective in controlling the browning development (L* increased, sensory general appearance improved and a* and sensory attribute browning decreased), in increasing the healthy potential (higher polyphenol and vitamin C content and antioxidant capacity), and maintaining the microbial counts similar to those obtained for the raw material.
|
|
Año:
2016
ISSN:
2007-1558
Cruz-Reyes, Laura; Fernández, Eduardo; Sánchez, Patricia; Gómez, Claudia
Editorial Académica Dragón Azteca
Resumen
Here, an interactive method is proposed to incorporate the preferences of the Decision Maker (DM) into the optimization process and lead the search towards the Region of Interest (ROI). The DM’s preferences are expressed in a reference set and are reflected by an outranking model. This information is used by a multi-criteria sorting method to create selective pressure towards solutions that are satisfactory to the DM. Our method obtains a better characterization of the ROI when compared with the well known NSGA-II and A2-NSGA-III in simple and complex project portfolio problems.
|
|
Año:
2016
ISSN:
2007-1558
Policroniades Chípuli, Gabriel; Flores de la Mota, Idalia
Editorial Académica Dragón Azteca
Resumen
Recently, automobile manufacturers are trying to procure parts using the Milk-Run logistics at most of their nearby suppliers and others kinds of consolidation applied to their distribution system with far suppliers. This article shows generally a state of art of this kind of consolidation used in the automotive industry. However, it is important to mention that the process of Milk-Run does not apply to all levels of the supply chain; only between the shipbuilder and nearby suppliers. All this leaves devoid of a transport mechanism of equal magnitude to the other levels or supply chain; allowing the modeling of different transport models that provide solutions to each specific distribution system depending on the type of consolidation. These models are based on the vehicle routing problems (VRP) and its various aspects; which are mentioned in this work.
|
|
Año:
2016
ISSN:
2007-1558
Soto-Monterrubio, J. Carlos; Santiago, Alejandro; Fraire-Huacuja, Héctor J.; Frausto-Solís, Juan; Terán-Villanueva, David
Editorial Académica Dragón Azteca
Resumen
In this paper the Pareto optimization of the Heterogeneous Computing Scheduling Multi-Objective Problem (HCSMOP) is approached. The goal is to minimize two objectives which are in conflict: the overall completion time (makespan) and the energy consumed. In the revised literature, there are no reported exact algorithms which solve the HCSMOP. In this work, we propose a Branch and Bound algorithm to solve the problem and it is used to find the optimal Pareto front of a set of instances of the literature. This set is the first available benchmark to assess the performance of multiobjective algorithms with quality metrics that requires known the optimal front of the instances.
|
|
Año:
2016
ISSN:
2007-1558
Maldonado-Nava, Fanny Gabriela; Frausto-Solís, Juan; Sánchez-Hernández, Juan Paulo; González-Barbosa, Juan Javier; Liñán-García, Ernesto; Castilla Valdez, Guadalupe
Editorial Académica Dragón Azteca
Resumen
Protein folding problem (PFP) is a challenge in some areas, such as molecular biology, computational biology, combinatorial optimization, and computer science. This is due to the large number of conformational structures that a protein can take from its primary structure to the native structure (NS). The aim of PFP is to find the NS of a protein target sequence. In general, the NS which has the lowest Gibbs energy or an energy close to it. In this paper, a Simulated Annealing like algorithm is presented, using the Golden Ratio search strategy and evolutionary techniques for PFP in small peptides. This method looks for the NS using only the protein's amino acid sequence, and determines the three-dimensional structure with the minimum energy or a close value of it.
|
|
Año:
2016
ISSN:
2007-1558
Balderas, Fausto; Fernandez, Eduardo; Gómez Santillán, Claudia; Rivera, Gilberto; Cruz-Reyes, Laura; Rangel, Nelson
Editorial Académica Dragón Azteca
Resumen
The problem of selection of project portfolio is often approached by organizations. The decision maker, along with the decision analyst must often provide information about the portfolio values, that most of the time come with uncertainty. An interval number is a set of numbers, which the exact value is not known. In this paper, we apply the interval approach to the problem of the project portfolio, modeling the imprecision in resources available, projects and the total resource, as well as restrictions relevant to the problem. The experiment is performed on two fronts: uncertainty modeling approach with interval analysis and without the interval approach in order to compare results. The results show that modeling the uncertainty and imprecision with interval numbers, were able to overcome results to those found without the application of interval approach.
|
|
Año:
2016
ISSN:
2007-1558
Kalashnikov, Vyacheslav; Kreinovich, Vladik; Flores-Muñiz, José Guadalupe; Kalashnykova, Nataliya
Editorial Académica Dragón Azteca
Resumen
One of the main problems of optimization algorithms is that they often end up in a local optimum. It is, therefore, necessary to make sure that the algorithm gets out of the local optimum and eventually reaches the global optimum. One of the promising ways guiding one from the local optimum is prompted by the filled function method. It turns out that empirically, the best smoothing functions to use in this method are the Gaussian and Cauchy functions. In this paper, we provide a possible theoretical explanation of this empirical effect.
|
|
Año:
2016
ISSN:
2007-1558
Leal-Coronado, Mariel A.; García-Martínez, Arturo; Kalashnikov, Vyacheslav V.
Editorial Académica Dragón Azteca
Resumen
We study the effects of merging two separate markets each originally monopolized by a producer into a globalized duopoly market. We consider a linear inverse demand with cap price and quadratic cost functions. After globalization, we find the consistent conjectural variations equilibrium (CCVE) of the duopoly game. Unlike in the Cournot equilibrium, a complete symmetry (identical cost functions parameters of both firms) does not imply the strongest coincident profit degradation. For the situation where both agents are low-marginal cost firms, we find that the company with a technical advantage over her rival has a better ratio of the current and previous profits.Moreover, as the rival becomes ever weaker, that is, as the slope of the rival’s marginal cost function increases, the profit ratio improves.
|
|
Año:
2016
ISSN:
2007-1558
Vergara Villegas, Osslan O.; Cruz Sánchez, Vianey Guadalupe; Rodríguez Jorge, Ricardo; Nandayapa Alfaro, Manuel de Jesús
Editorial Académica Dragón Azteca
Resumen
|
|
Año:
2016
ISSN:
2007-1558
Jiménez-García, José Alfredo; Mendiola-García, Javier Yáñez; Medina-Flores, José Martín; Mezura-Montes, Efrén; Vázquez-López, José Antonio
Editorial Académica Dragón Azteca
Resumen
In this article an optimization model based on mixed-integer linear programming to solve a novel problem of delivery of materials in a manufacturing plant of constant velocity joints (CVJ) is proposed. For modelling there were taken into account restrictions of forklift drivers, production cells being supplied, two warehouses of the different CVJ components and a production schedule to fulfil in a given sequence. As a result, a representative model of supply scheme was obtained that when solved by branch and bound method it provides a sequence in materials supply, fulfills the production schedule and reduces the percentage of losses due to lack of supply, directing to forklift drivers to the components to be taken, the cell which will be supplied and the CVJ model to be produced. The goal of the company at which this study was applied is to reach 1.5% in losses due to lack of supply; by the modeling solution it was achieved near 0% in losses due to lack of supply.
|
Hecho en México, Universidad Nacional Autónoma de México (UNAM). Todos los derechos reservados 1997-2022. Esta página puede ser reproducida con fines no lucrativos, siempre y cuando no se mutile y se cite la fuente completa y su dirección electrónica. De otra forma, se requiere permiso previo de la institución por escrito. Mapa del sitio | Créditos
