[{"data":1,"prerenderedAt":214},["ShallowReactive",2],{"science-entries":3},[4,52,85,119,152,184],{"id":5,"title":6,"context":9,"date":13,"description":15,"extension":19,"links":20,"meta":32,"order":40,"provisional":41,"status":42,"stem":45,"technologies":46,"__hash__":51},"science/science/newton-quasi-newton-case-studies.md",{"es":7,"en":8},"Métodos de Newton para optimización","Newton methods for optimization",[10],{"es":11,"en":12},"Trabajo en equipo","Team project",{"es":14,"en":14},"2026",[16],{"es":17,"en":18},"Estudio de métodos de optimización multivariable mediante dos casos: Newton sobre la función de Rosenbrock y L-BFGS para entrenar una red neuronal que aproxima la función seno. El repositorio contiene las implementaciones y el material complementario.","A study of multivariable optimization methods through two cases: Newton on the Rosenbrock function and L-BFGS to train a neural network that approximates the sine function. The repository contains the implementations and supporting material.","md",[21,27],{"label":22,"href":25,"external":26},{"es":23,"en":24},"Documento","Paper","/public-assets/research/newton-optimization.pdf",true,{"label":28,"href":31,"external":26},{"es":29,"en":30},"Código","Code","https://github.com/rodamaj/newton-quasi-newton-case-studies",{"body":33},{"type":34,"value":35,"toc":36},"minimark",[],{"title":37,"searchDepth":38,"depth":38,"links":39},"",2,[],1,false,{"es":43,"en":44},"Caso de estudio","Case study","science/newton-quasi-newton-case-studies",[47,48,49,50],"MATLAB","Python","PyTorch","L-BFGS","Y8BfwDc0MMzVnJEOGFwTFR0oIrwjVobJulbQrcHdnxo",{"id":53,"title":54,"context":57,"date":61,"description":62,"extension":19,"links":66,"meta":72,"order":38,"provisional":41,"status":77,"stem":80,"technologies":81,"__hash__":84},"science/science/genetic-image-approximation.md",{"es":55,"en":56},"Aproximación de imágenes con un algoritmo genético","Image approximation with a genetic algorithm",[58],{"es":59,"en":60},"Implementación experimental","Experimental implementation",{"es":14,"en":14},[63],{"es":64,"en":65},"Exploración de un algoritmo genético que aproxima una imagen de referencia mediante cuadrados de color y permite observar los efectos de la selección, el cruce y la mutación a través de generaciones.","An exploration of a genetic algorithm that approximates a reference image with colored squares and makes it possible to observe the effects of selection, crossover, and mutation across generations.",[67],{"label":68,"href":71,"external":26},{"es":69,"en":70},"Repositorio","Repository","https://github.com/rodamaj/genetic-image-approximation",{"body":73},{"type":34,"value":74,"toc":75},[],{"title":37,"searchDepth":38,"depth":38,"links":76},[],{"es":78,"en":79},"Exploración independiente","Independent exploration","science/genetic-image-approximation",[82,83],"JavaScript","p5.js","FY4jVgYj-Bu07z0Otk8v4njUOYlRsW9tdHNnG6q_6Bc",{"id":86,"title":87,"context":90,"date":94,"description":95,"extension":19,"links":99,"meta":103,"order":108,"provisional":41,"status":109,"stem":112,"technologies":113,"__hash__":118},"science/science/phishing-detection.md",{"es":88,"en":89},"Detección de phishing con un perceptrón multicapa","Phishing detection with a multilayer perceptron",[91],{"es":92,"en":93},"Repositorio público","Public repository",{"es":14,"en":14},[96],{"es":97,"en":98},"Exploración de clasificación supervisada que utiliza características extraídas de URL para entrenar un perceptrón multicapa capaz de distinguir entre direcciones legítimas y casos de phishing.","A supervised classification exploration that uses features extracted from URLs to train a multilayer perceptron capable of distinguishing legitimate addresses from phishing cases.",[100],{"label":101,"href":102,"external":26},{"es":69,"en":70},"https://github.com/rodamaj/phishing-detection-mlp",{"body":104},{"type":34,"value":105,"toc":106},[],{"title":37,"searchDepth":38,"depth":38,"links":107},[],3,{"es":110,"en":111},"Exploración académica","Academic exploration","science/phishing-detection",[48,114,49,115,116,117],"TensorFlow","scikit-learn","pandas","NumPy","xymmNNe87RqHc8FJmZoo0EjAIghcvLET9FIDHkffqCA",{"id":120,"title":121,"context":124,"date":126,"description":127,"extension":19,"links":131,"meta":138,"order":143,"provisional":41,"status":144,"stem":147,"technologies":148,"__hash__":151},"science/science/image-compression-noise-experiment.md",{"es":122,"en":123},"Experimento sobre compresión y ruido en imágenes","Image compression and noise experiment",[125],{"es":78,"en":79},{"es":14,"en":14},[128],{"es":129,"en":130},"Experimento reproducible que estudia el efecto del ruido sobre la compresión PNG y WebP en distintos bloques de contenido. El repositorio contiene la tubería experimental y el material necesario para reproducir el análisis.","A reproducible experiment studying the effect of noise on PNG and WebP compression across different content blocks. The repository contains the experimental pipeline and the material needed to reproduce the analysis.",[132,135],{"label":133,"href":134,"external":26},{"es":23,"en":24},"/public-assets/research/image-compression-noise-experiment.pdf",{"label":136,"href":137,"external":26},{"es":29,"en":30},"https://github.com/rodamaj/image-compression-noise-experiment",{"body":139},{"type":34,"value":140,"toc":141},[],{"title":37,"searchDepth":38,"depth":38,"links":142},[],4,{"es":145,"en":146},"Experimento reproducible","Reproducible experiment","science/image-compression-noise-experiment",[48,149,150],"R","Make","aK5ZfXA6IX3oH-bth4PRtun6zCS-T2bz0ItbKBloPug",{"id":153,"title":154,"context":157,"date":159,"description":161,"extension":19,"links":165,"meta":169,"order":174,"provisional":41,"status":175,"stem":178,"technologies":179,"__hash__":183},"science/science/space-mission-log.md",{"es":155,"en":156},"Análisis de bitácoras de misiones espaciales","Space mission log analysis",[158],{"es":11,"en":12},{"es":160,"en":160},"2025",[162],{"es":163,"en":164},"Aplicación de escritorio que realiza análisis léxico y sintáctico de bitácoras de misiones, reporta entradas inválidas y presenta métricas, filtros, gráficos, recursos y análisis por usuario en una interfaz gráfica.","A desktop application that performs lexical and syntactic analysis of mission logs, reports invalid entries, and presents metrics, filters, charts, resources, and user-based analysis in a graphical interface.",[166],{"label":167,"href":168,"external":26},{"es":69,"en":70},"https://github.com/rodamaj/space-mission-log",{"body":170},{"type":34,"value":171,"toc":172},[],{"title":37,"searchDepth":38,"depth":38,"links":173},[],5,{"es":176,"en":177},"Proyecto académico","Academic project","science/space-mission-log",[48,180,181,182,117],"PLY","Tkinter","Matplotlib","PUc7PAyC4Nk8YJs-j7vVt-wFceZZbh-cDpBNtGGfQAE",{"id":185,"title":186,"context":189,"date":191,"description":192,"extension":19,"links":196,"meta":200,"order":205,"provisional":41,"status":206,"stem":207,"technologies":208,"__hash__":213},"science/science/ucr-timetabling-optimization.md",{"es":187,"en":188},"Optimización de horarios universitarios","University timetabling optimization",[190],{"es":11,"en":12},{"es":160,"en":160},[193],{"es":194,"en":195},"Aplicación interactiva que genera horarios universitarios válidos a partir de cursos y preferencias, detecta traslapes y evalúa las soluciones según el turno, la hora de almuerzo, los espacios entre clases y la cantidad de días. Compara búsqueda exhaustiva, selección aleatoria, una heurística voraz con retroceso y recocido simulado.","An interactive application that generates valid university schedules from courses and preferences, detects conflicts, and scores solutions by time of day, lunch breaks, gaps between classes, and number of class days. It compares exhaustive search, random selection, a greedy heuristic with backtracking, and simulated annealing.",[197],{"label":198,"href":199,"external":26},{"es":69,"en":70},"https://github.com/rodamaj/ucr-timetabling-optimization",{"body":201},{"type":34,"value":202,"toc":203},[],{"title":37,"searchDepth":38,"depth":38,"links":204},[],6,{"es":176,"en":177},"science/ucr-timetabling-optimization",[48,209,210,211,212],"Exhaustive search","Greedy heuristics","Backtracking","Simulated annealing","BeIOmjGMOvC-lE0z15gLugQuNCX8KIFQwgiWxScwKjw",1785469067398]