Examinando por Materia "ALGORITMOS (COMPUTADORES)"
Mostrando 1 - 20 de 26
Resultados por página
Opciones de ordenación
Ítem Algoritmo de tomografía local basado en la transformada discreta Wavelet(Universidad EAFIT, 2011) Alfonso Cristancho, Amed Alfonso; Rojas Cortés, Lucio; Villegas Gutiérrez, Jairo Alberto; Mejía Quiros, Gustavo AntonioÍtem Algoritmo evolutivo para resolver el problema de enrutamiento de vehículos tiempo dependiente con ventanas de tiempo en una compañía del sector de alimentos y bebidas en Colombia(Universidad EAFIT, 2023) Ramírez Guilombo, Camilo; Rivera Agudelo, Juan CarlosÍtem Aproximación del uso de redes neuronales en mantenimiento(Universidad EAFIT, 2013) Orozco Álvarez, David; Mora Gutiérrez, Luis AlbertoÍtem Aspect ratio-and size-controlled patterned triangulations of parametric surfaces(2007-02) Ruíz, Óscar E.; Peña, Sebastián; Duque, Juan; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEA method to produce patterned, controlled size triangulation of Boundary Representations is presented -- Although the produced patterned triangulations are not immediately suited for fast visualization, they were used in Fixed Grid Finite Element Analysis, and do provide a control on the aspect ratio or shape factor of the triangles produced -- The method presented first calculates a triangulation in the parameter space of the faces in which the B-Rep is partitioned and then maps it to 3D space -- Special emphasis is set in ensuring that the triangulations of neighboring faces meet in a seamless manner, therefore ensuring that a borderless C2 2-manifold would have as triangulation a C0 borderless 2-manifold -- The method works properly under the conditions(i) the parametric form of the face is a 1-1 function, (ii) the parametric pre-image of a parametric face is a connected region, and (iii) the user-requested sampling frequency (samples per length unit ) is higher than twice the spatial frequency of the features in the B-Rep ( thus respecting the Nyquist principle ) -- As the conditions (i) and (ii) are possible under face reparameterization or sub-division and the condition (iii) is the minimum that a triangulation should comply with, the method is deemed as generally applicableÍtem Compendium of M.Sc. publications on numerical estimation of effective properties of porous materials(Universidad EAFIT, 2014) Osorno Tejada, María Camila; Ruíz Salguero, Oscar EduardoÍtem Compresión de imágenes usando wavelets(Universidad EAFIT, 2007) Puetamán Guerrero, Gloria; Salazar Escobar, Hernán; Villegas Gutiérrez, Jairo AlbertoÍtem Definición de un framework para la aplicación del pensamiento computacional en la construcción y prueba de algoritmos(Universidad EAFIT, 2015) Isaza David, Ricardo León; Toro Bermúdez, MauricioÍtem Desarrollo de un algoritmo de corte de mallas tridimensionales en ambientes virtuales con aplicaciones en simuladores quirúrgicos(Universidad EAFIT, 2009) Peniche González, Amaury Andrés; Díaz León, Christian AndrésÍtem Desarrollo de un módulo computacional para la síntesis y procesamiento de campos ópticos con aplicaciones en holografía digital y speckle(Universidad EAFIT, 2010) Sierra Sosa, Daniel Esteban; Ángel Toro, Luciano AlbertoÍtem Diseño de un sistema experto en mantenimiento e implementación en un sistema de ingeniería(Universidad EAFIT, 2008) Escobar Villegas, Daniel; Martinod Restrepo, Ronald MauricioÍtem Estado del arte en técnicas de recuperación de información basadas en ontologías(Universidad EAFIT, 2010) Restrepo Montoya, Daniel; García Zuluaga, Santiago; Lalinde Pulido, Juan GuillermoÍtem Estandarización de datos y priorización de algoritmos para un sistema de recomendación(Universidad EAFIT, 2019) González Arroyave, Dider León; Múnera Montoya, Edwin NelsonÍtem Generación de estructuras 3D a partir de imágenes 2D(Universidad EAFIT, 2008) Ortiz Quintero, Juan Fernando; Soto Duque, Oscar Eduardo; Trefftz Gómez, HelmuthÍtem Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms(Universidad EAFIT, 2006-03) Ruíz, Óscar E.; Ferreira, Placid M.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEGeometric Reasoning ability is central to many applications in CAD/CAM/CAPP environments -- An increasing demand exists for Geometric Reasoning systems which evaluate the feasibility of virtual scenes specified by geometric relations -- Thus, the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem consists of a basic scenario containing geometric entities, whose context is used to propose constraining relations among still undefined entities -- If the constraint specification is consistent, the answer of the problem is one of finitely or infinitely many solution scenarios satisfying the prescribed constraints -- Otherwise, a diagnostic of inconsistency is expected -- The three main approaches used for this problem are numerical, procedural or operational and mathematical -- Numerical and procedural approaches answer only part of the problem, and are not complete in the sense that a failure to provide an answer does not preclude the existence of one -- The mathematical approach previously presented by the authors describes the problem using a set of polynomial equations -- The common roots to this set of polynomials characterizes the solution space for such a problem -- That work presents the use of Groebner basis techniques for verifying the consistency of the constraints -- It also integrates subgroups of the Special Euclidean Group of Displacements SE(3) in the problem formulation to exploit the structure implied by geometric relations -- Although theoretically sound, these techniques require large amounts of computing resources -- This work proposes Divide-and-Conquer techniques applied to local GCS/SF subproblems to identify strongly constrained clusters of geometric entities -- The identification and preprocessing of these clusters generally reduces the effort required in solving the overall problem -- Cluster identification can be related to identifying short cycles in the Spatial Con straint graph for the GCS/SF problem -- Their preprocessing uses the aforementioned Algebraic Geometry and Group theoretical techniques on the local GCS/SF problems that correspond to these cycles -- Besides improving theefficiency of the solution approach, the Divide-and-Conquer techniques capture the physical essence of the problem -- This is illustrated by applying the discussed techniques to the analysis of the degrees of freedom of mechanismsÍtem Geometry generation for computer aided engineering. Study cases in meshing and ceramics modeling(Universidad EAFIT, 2009) Serrano Salazar, Ricardo; Ruíz Salguero, Óscar EduardoÍtem Graphs of optimally fit features in assessment of geometric tolerances(2014) Ruíz, Óscar E.; Congote, John; Acosta, Diego A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis article presents an industrial application case of geometric constraint graphs, whose nodes are statistically optimal instances of manufacturing or design features and whose edges are usual geometric relations used in tolerance applications -- The features might be virtual ones -- As a consequence, they may lie beyond the piece’s extents -- The geometric constraint graph may have cyclic topology -- Contrary to deterministic geometric constraint graphs, tolerance constraint graphs admit numerical slacks, due to their stochastic nature -- The methodology has been applied in industrial scenarios, showing superiority to traditional material features for the assessment of tolerancesÍtem Hacia un método de predicción de resultados de evaluación en un contexto de micro aprendizaje(Universidad EAFIT, 2020) Sánchez Castrillón, Jose David; Vallejo, Paola; Tabares Betancur, Marta Silvia; Tabares Betancur, Marta SilviaThis paper presents a method for predicting the evaluation results of learners interacting with a context-aware microlearning system. We use ASUM-DM to guide di erent data analytics tasks, including applying a genetic algorithm that selects the prediction's highest weight features. Then, we apply machine learning models like Random Forest, Gradient Boosting Tree, Decision Tree, SVM, and Neural Networks to train data and evaluate the context's e ects, either success or failure of the learner's evaluation. We are interested in nding the model of signi cant context-in uence to the learner's evaluation results. The Random Forest model provided an accuracy of 94%, which was calculated with the cross-validation technique. Thus, it is possible to conclude that the model can accurately predict the evaluation result and relate it with the learner context. The model result is a useful insight for sending noti cations to the learners to improve the learning process. We want to provide recommendations about learner behavior and context and adapt the microlearning content in the future.Ítem Hacia un modelo predictivo que apoye el logro de KPI comerciales más asertivos : caso Empresa Comercializadora de Madera(Universidad EAFIT, 2023) Tavera Rodríguez, Jhon Walter; Tabares Betancur, Marta SilviaÍtem Hybrid algorithm based on Reinforcement Learning and DDMRP methodology for inventory management(Universidad EAFIT, 2021) Cuartas Murillo, Carlos Andrés; Aguilar, José Lisandro; Aguilar, José LisandroThis article proposes a hybrid algorithm based on Reinforcement Learning and on the inventory management methodology called DDMRP (Demand Driven Material Requirement Planning) to determine the optimal time to buy a certain product, and how much quantity should be requested. For this, the inventory management problem is formulated as a Markov Decision Process where the environment with which the system interacts is designed from the concepts raised in the DDMRP methodology, and through the Reinforcement Learning algorithm – specifically, Q-Learning. The optimal policy is determined for making decisions about when and how much to buy. To determine the optimal policy, three approaches are proposed for the reward function: the first one is based on inventory levels; the second is an optimization function based on the distance of the inventory to its optimal level, and the third is a shaping function based on levels and distances to the optimal inventory. The results show that the proposed algorithm has promising results in scenarios with different characteristics, performing adequately in difficult case studies with a diversity of situations such as scenarios with discontinuous or continuous demand, seasonal and non-seasonal behavior with high demand peaks, multiple lead times, among others.Ítem Informática teórica : elementos propedéuticos(Fondo Editorial Universidad EAFIT, 2009) Gómez Marín, Raúl; Sicard Ramírez, Andrés