Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Dionne M. Aleman (“ An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application ”) is an assistant professor in the Department of Mechanical and Industrial Engineering at the University of Toronto. She received her Ph.D. in industrial and systems engineering from the University of Florida in Gainesville. Her research interests are medical applications of operations research, specifically radiotherapy treatment optimization and pandemic outbreak planning. She directs the Medical Operations Research Lab (morLAB) at the University of Toronto and is president of the INFORMS Junior Faculty Group and secretary/treasurer of the INFORMS Section on Public Programs and Service Needs; she previously served as Chair of the INFORMS Health Applications Section. Gad Allon (“ The Impact of Delaying the Delay Announcements ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. Recently he has been studying models of information sharing among firms and customers in service and retail settings. He is also conducting empirical studies to investigate time-based competition in the fast-food industry as well as the factors contributing to emergency department overcrowding. Steve Alpern (“ Patrolling Games ” and “ Find-and-Fetch Search on a Tree ”) is a professor of mathematics at the London School of Economics. He became interested in the field of search games when studying game theory under Oskar Morgenstern, as an undergraduate at Princeton University, and later with Rufus Isaacs. After working on antagonistic versions of these games, he has more recently become interested in versions where the two searchers have the common aim of finding each other as soon as possible (rendezvous). In addition to search games, his current research interests include decentralized matching, and mathematical models in animal behavior. Roberto Baldacci (“ New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem ” and “ An Exact Method for the Capacitated Location-Routing Problem ”) is a researcher in operations research at the Department of Electronics, Computer Science and Systems (DEIS) of the University of Bologna, Italy. His major research interests are in the area of transportation planning, logistics and distribution, and the solution to vehicle routing and scheduling problems over street networks. His research activities are in the theory and applications of mathematical programming. He has worked in the design of new heuristic and exact methods for solving combinatorial problems as routing and location problems. Achal Bassamboo (“ The Impact of Delaying the Delay Announcements ”) is an associate professor of managerial economics and decision science at the Kellogg School of Management at Northwestern University. His research interests lie in the areas of service systems, revenue management, and information sharing. His current research involves designing flexible service systems with a focus on capacity planning and effects of parameter uncertainty. He is also studying credibility of information provided by a service provider or a retailer to its customers. Mark Broadie (“ General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm ”) is the Carson Family Professor of Business in the Graduate School of Business, Columbia University. His research focuses on issues in financial engineering, with a particular focus on the design and analysis of efficient Monte Carlo methods for pricing and risk management. Rodolfo A. Catena (“ Rating Customers According to Their Promptness to Adopt New Products ”) is a health-care researcher for the SPHERE Institute. In 2009, he graduated from the University of California, Berkeley, in industrial engineering and operations research. Previously he completed a thesis on the issue of train timetabling in conjunction with the Operations Research Group at the University of Bologna. His research interests include stochastic programming, network optimization, and combinatorial optimization applied to marketing, finance, production, and health-care problems. Xin Chen (“ Integration of Inventory and Pricing Decisions with Costly Price Adjustments ”) is an associate professor at the Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana–Champaign. His research interests include supply chain management, inventory management, and optimization. He is a coauthor of the book The Logic of Logistics (Springer 2005). Youhua (Frank) Chen (“ Integration of Inventory and Pricing Decisions with Costly Price Adjustments ” and “ A Computational Approach for Optimal Joint Inventory-Pricing Control in an Infinite-Horizon Periodic-Review System ”) is an associate professor at the Department of Systems Engineering and Engineering Management, the Chinese University of Hong Kong. His current research is focused on interfaces between operations and marketing, and inventory models with risk considerations. Mabel C. Chou (“ Process Flexibility Revisited: The Graph Expander and Its Applications ”) is an associate professor in the Department of Decision Sciences, NUS Business School, National University of Singapore. Her research interests include production scheduling, logistic and supply chain analysis, and flexibility design and analysis. Geoffrey A. Chua (“ Process Flexibility Revisited: The Graph Expander and Its Applications ”) is an assistant professor in the Division of Information Technology and Operations Management at Nanyang Business School, Nanyang Technological University, Singapore. His research interests include the analysis and design of process flexibility and robust systems, decision making under uncertainty, and supply chain management. Deniz Cicek (“ General Bounds and Finite-Time Improvement for the Kiefer-Wolfowitz Stochastic Approximation Algorithm ”) is a Ph.D. candidate in the Decision, Risk and Operations division of Columbia Business School. His research interests are simulation optimization and its applications. Youyi Feng (“ A Computational Approach for Optimal Joint Inventory-Pricing Control in an Infinite-Horizon Periodic-Review System ”) is a professor of supply chain management at MIT-Zaragoza International Logistics Program, Zaragoza Logistics Center. His current research interests include revenue management, energy trading and value chain management, and carbon emission control and trading strategies. This note is part of several related publications dealing with dynamic pricing problems where inventories can be replenished. Antonio Frangioni (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated with honors in computer science from the University of Pisa, Italy, in 1992 and earned his Ph.D. in computer science from the same university in 1996. He had been a research associate at the Computer Science Department of the University of Pisa from 1996 to 2004, where he is now an associate professor. His main research interests are in models and algorithms for large-scale continuous and combinatorial optimization problems, using such techniques as decomposition algorithms, interior-point methods, reformulation techniques, and network flow approaches. Claudio Gentile (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated with honors in computer science from the University of Pisa in 1995 and received the Diploma of the Scuola Normale Superiore of Pisa. In 2000 he finished his Ph.D. studies in operations research at University “La Sapienza” of Rome. Since 1999 he has been a researcher at the Institute of System Analysis and Computer Science “Antonio Ruberti” of the Italian National Research Council (IASI-CNR). His main research interests are in combinatorial optimization, polyhedral theory for linear and nonlinear integer programming problems, interior point methods, and network flow problems. Hamid R. Ghaffari (“ An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application ”) is a Ph.D. candidate in the Department of Mechanical and Industrial Engineering at the University of Toronto. His research interests are medical applications of operations research, specifically radiotherapy treatment optimization. K. Giesecke (“ Exact Simulation of Point Processes with Stochastic Intensities ”) is assistant professor of management science and engineering at Stanford University. His research and teaching interests are in applied probability, Monte Carlo simulation, and financial engineering. Enrico Grande (“ Projected Perspective Reformulations with Applications in Design Problems ”) graduated cum laude in industrial engineering from the University of Rome “Tor Vergata” in 2005. In 2010 he finished his Ph.D. in operations research at University “La Sapienza” of Rome. His main research interests are in mixed integer nonlinear programming and in flows over time problems. Robert G. Haight (“ Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks ”) is a research forester with the U.S. Forest Service Northern Research Station in St. Paul, Minnesota. He studies the economics of public programs for wildlife protection, metropolitan open space protection, wildfire management, and invasive species management. Dorit S. Hochbaum (“ Rating Customers According to Their Promptness to Adopt New Products ”) is a full professor and Chancellor Chair at the University of California at Berkeley, Department of Industrial Engineerin
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it