1,769,978 research outputs found
Pattern 2451
No full textPattern 2451 is a research and process-based exploration of a tea set that I was given from my grandmother. The project is in response to my experiences of moving and packing my own things, and the objects from my grandparent’s house. I began this work wanting to know what it means for an object to be valuable enough to keep, and how we decide what to throw away. In this exploration of personal value, Pattern 2451 investigates the origins of middle-class objects of luxury, the tension between the duty of safe keeping and guilt of discarding, and the current overwhelming abundant need to buy, as a form of self-improvement/optimization marketed in consumer culture
Galaxy and mass assembly (GAMA) : AUTOZ spectral redshift measurements, confidence and errors
Full text linkThe Galaxy And Mass Assembly (GAMA) survey has obtained spectra of over 230 000 targets using the Anglo-Australian Telescope. To homogenize the redshift measurements and improve the reliability, a fully automatic redshift code was developed (AUTOZ). The measurements were made using a cross-correlation method for both the absorption-and the emission-line spectra. Large deviations in the high-pass-filtered spectra are partially clipped in order to be robust against uncorrected artefacts and to reduce the weight given to single-line matches. A single figure of merit (FOM) was developed that puts all template matches on to a similar confidence scale. The redshift confidence as a function of the FOM was fitted with a tanh function using a maximum likelihood method applied to repeat observations of targets. The method could be adapted to provide robust automatic redshifts for other large galaxy redshift surveys. For the GAMA survey, there was a substantial improvement in the reliability of assigned redshifts and in the lowering of redshift uncertainties with a median velocity uncertainty of 33 kms-1.Peer reviewe
2451. Poésies provençales
No full text2451. Poésies provençales. In: Molinier Auguste. Les Sources de l'histoire de France - Des origines aux guerres d'Italie (1494). III. Les Capétiens, 1180-1328. Paris : A. Picard et fils, 1903. p. 70
[IO Islamic 2451] مثنوی معنوی
No full textMathnawî-i-Ma’nawî.
This manuscript is now IO Islamic 1068 in the India Office collections.
[metadata: Hermann Ethé, Catalogue of Persian Manuscripts in the Library of the India Office, 2 vols. (Oxford: India Office, 1903): volume 1, number 2451 here with notations and hyperlinks].
1068
The same.
Good copy, with all the prose-prefaces, finished on a Sunday ( فى يوم الاحد) in Ṣafar , A.H. 1085 (A.D. 1674, May- June).
Daftar I, on fol. 1b; II, on fol. 75b; III, on fol. 142b; IV, on fol. 227b ; V, on fol. 295b; VI, on fol. 373b.
No. 2451, ff. 459, 2 centre-coll., each ll. 17, and a third on the margin, ll. 32; small, but clear Nasta’lîḳ; an illuminated frontispiece at the beginning of each daftar; size, 95/8 in. by 5 in
Exam Timetabling via Integer Programming: A case study at UTDT
Full text linkThis work tackles the scheduling of midterm exams at Universidad
Torcuato Di Tella (UTDT). Given a set of exams as well as the
students enrolled therein, the problem involves determining the date,
time and classrooms for each exam. Operational constraints such as
conflicts of time, room capacities and availability, as well spacing (i.e.,
the number of days) between exams for a student make this problem
very difficult from an optimization standpoint, in particular when considering
real-world instances. We explore three Integer Linear Programming
based algorithms for scheduling midterm exams within this context.
Based on instances obtained from real data, the methods showed to provide
good quality solutions, providing the students a balanced schedule
for the exams over the planning horizon.Este artículo se encuentra originalmente publicado en Memorias de las JAIIO (ISSN 2451-7496
Electoral College (SC 2451)
Full text linkFinding aid only for Manuscripts Small Collection 2451. Certification of George B. Hodge, James McKenzie, James M. Bigger, S. P. Love, R. S. Bevier, J. M. Atherton, Richard A. Jones, H. Cox, W. C. P. Breckinridge, Robert E. Little, A. L. Martin, and H. L. Stone, electors for Kentucky, as to the outcome of their votes for president and vice president of the United States, 1872. Includes notice of certification for 1880 bearing the signatures of the electors only
Electric Vehicle Routing Model for Last-mile Logistics in Cities with Steep Streets
Full text linkThe Quito local government aims to establish a low-emission
zone in the city’s historic center. A key focus is the shift to eco-friendly
transportation for last-mile logistics, including electric cargo bikes and
other types of light electric vehicles (LEVs). Our research delves into
integer programming models to optimize the vehicle routes. We address
a variation of the electric vehicle routing problem (EVRP), factoring in
vehicle load and street slope for battery consumption and travel times.
Moreover, we consider the existence of multiple paths between each pair
of customers, which vary in distance and slope, yielding different travel
times and battery consumption values. For instance, some paths may
have small travel times but require high battery consumption, while other
paths may have longer travel times and require less battery consumption.
The problem is formulated on a customer multigraph that has one node
for each customer and depot, and where parallel arcs are used to represent
efficient paths in the original network. Road selection is carried out as
part of the vehicle routing. This talk highlights findings on modeling
strategies and reports some computational results to examine the impact
of some model parameters upon the optimal solutions.Este artículo se encuentra originalmente publicado en Memorias de las JAIIO (ISSN 2451-7496
Estimating of time-dependent travel times vía Mixed Integer Programming
Full text linkRouting and distribution problems have been widely studied
within the Operations Research (OR) community. When restricting to
distribution problems in large cities, the congestion of the road network
becomes a key aspect with a significant practical impact. These problems
are known as Time-Dependent VRPs (TDVRPs), as they naturally
capture the effect of congestion by assuming that the travel time between
any two customers varies depending on the departure time. The
TDVRP literature has widely accepted to model the time-dependent
travel time model between two customers as continuous piecewise linear
(PWL) function that satisfies the first-in first-out (FIFO) condition. In
this paper, we investigate the problem of estimating these continuous
PWL travel time functions from real data travel time data. We benchmark
two recently proposed Mixed Integer Programming based models
for estimating general PWL functions and a well-known heuristic proposed
within the context of travel-time estimations. In addition, we also
contribute with a new dataset of instances created using real-world data
as input.Este artículo se encuentra originalmente publicado en Memorias de las JAIIO (ISSN 2451-7496
- …
