Finding succinct ordered minimal perfect hashing functions

An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused, and the data are placed in the table in order. A new method for creating ordered minimal perfect hashing functions is presented. The method presented is based on a method developed by Fox, Heath, Daoud, and Chen, but it creates hash functions with representation space requirements closer to the theoretical lower bound. The method presented requires approximately 10% less space to represent generated hash functions, and is easier to implement than Fox et al's. However, a higher time complexity makes it practical for small sets only (< 1000)

The BHK Color Diagram: a New Tool to Study Young Stellar Populations

A new method to derive age differences between the various super star clusters observed in starburst galaxies using the two color diagram (B-H) vs (H-K) is presented. This method offers a quick and easy way to differentiate very young and intermediate age stellar populations even if data on extinction are unavailable. In this case, discrimination of regions younger and older than 4 Myr is feasible. With the availability of data on extinction, the time resolution can be improved significantly. The application of the method to the starbursting system Arp 299 is presented. The validity of the method is confirmed by comparing the equivalent width of the H-alpha line with the chronological map of the northern part of NGC 3690.Comment: 32 pages, 7 figures, 1 table, AJ accepte

New bounds for multi-dimensional packing

New upper and lower bounds are presented for a multi-dimensional generalization of bin packing called box packing. Several variants of this problem, including bounded space box packing, square packing, variable sized box packing and resource augmented box packing are also studied. The main results, stated for d=2, are as follows: A new upper bound of 2.66013 for online box packing, a new $14/9 + varepsilon$ polynomial time offline approximation algorithm for square packing, a new upper bound of 2.43828 for online square packing, a new lower bound of 1.62176 for online square packing, a new lower bound of 2.28229 for bounded space online square packing and a new upper bound of 2.32571 for online two-sized box packing

Dependence of the Superconducting Transition Temperature of MgB2 on Pressure to 20 GPa

The dependence of Tc on nearly hydrostatic pressure has been measured for an isotopically pure (11B) MgB2 sample in a helium-loaded diamond-anvil-cell to nearly 20 GPa. Tc decreases monotonically with pressure from 39.1 K at ambient pressure to 20.9 K at 19.2 GPa. The initial dependence is the same as that obtained earlier (dTc/dP = -1.11(2) K/GPa) on the same sample in a He-gas apparatus to 0.7 GPa. The observed pressure dependence Tc(P) to 20 GPa can be readily described in terms of simple lattice stiffening within standard phonon-mediated BCS superconductivity.Comment: 9 pages, 3 figure

Scale Dependent Dimension of Luminous Matter in the Universe

We present a geometrical model of the distribution of luminous matter in the universe, derived from a very simple reaction-diffusion model of turbulent phenomena. The apparent dimension of luminous matter, $D(l)$, depends linearly on the logarithm of the scale $l$ under which the universe is viewed: $D(l) \sim 3\log(l/l_0)/\log(\xi/l_0)$, where $\xi$ is a correlation length. Comparison with data from the SARS red-shift catalogue, and the LEDA database provides a good fit with a correlation length $\xi \sim 300$ Mpc. The geometrical interpretation is clear: At small distances, the universe is zero-dimensional and point-like. At distances of the order of 1 Mpc the dimension is unity, indicating a filamentary, string-like structure; when viewed at larger scales it gradually becomes 2-dimensional wall-like, and finally, at and beyond the correlation length, it becomes uniform.Comment: 6 pages, 2 figure

A Robust AFPTAS for Online Bin Packing with Polynomial Migration

In this paper we develop general LP and ILP techniques to find an approximate solution with improved objective value close to an existing solution. The task of improving an approximate solution is closely related to a classical theorem of Cook et al. in the sensitivity analysis for LPs and ILPs. This result is often applied in designing robust algorithms for online problems. We apply our new techniques to the online bin packing problem, where it is allowed to reassign a certain number of items, measured by the migration factor. The migration factor is defined by the total size of reassigned items divided by the size of the arriving item. We obtain a robust asymptotic fully polynomial time approximation scheme (AFPTAS) for the online bin packing problem with migration factor bounded by a polynomial in $\frac{1}{\epsilon}$. This answers an open question stated by Epstein and Levin in the affirmative. As a byproduct we prove an approximate variant of the sensitivity theorem by Cook at el. for linear programs

Lower bounds for several online variants of bin packing

We consider several previously studied online variants of bin packing and prove new and improved lower bounds on the asymptotic competitive ratios for them. For that, we use a method of fully adaptive constructions. In particular, we improve the lower bound for the asymptotic competitive ratio of online square packing significantly, raising it from roughly 1.68 to above 1.75.Comment: WAOA 201

Thermodynamic properties of ferromagnetic mixed-spin chain systems

Using a combination of high-temperature series expansion, exact diagonalization and quantum Monte Carlo, we perform a complementary analysis of the thermodynamic properties of quasi-one-dimensional mixed-spin systems with alternating magnetic moments. In addition to explicit series expansions for small spin quantum numbers, we present an expansion that allows a direct evaluation of the series coefficients as a function of spin quantum numbers. Due to the presence of excitations of both acoustic and optical nature, the specific heat of a mixed-spin chain displays a double-peak-like structure, which is more pronounced for ferromagnetic than for antiferromagnetic intra-chain exchange. We link these results to an analytically solvable half-classical limit. Finally, we extend our series expansion to incorporate the single-ion anisotropies relevant for the molecular mixed-spin ferromagnetic chain material MnNi(NO$_{2}$)$_{4}$(ethylenediamine)$_{2}$, with alternating spins of magnitude 5/2 and 1. Including a weak inter-chain coupling, we show that the observed susceptibility allows for an excellent fit, and the extraction of microscopic exchange parameters.Comment: 8 pages including 7 figures, submitted to Phys. Rev. B; series extended to 29th. QMC adde

Building Bridges with Boats: Preserving Community History through Intra- and Inter-Institutional Collaboration

This chapter discusses Launching through the Surf: The Dory Fleet of Pacific City, a project which documents the historical and contemporary role of dory fishers in the life of the coastal village of Pacific City, Oregon, U.S. Linfield College’s Department of Theatre and Communication Arts, its Jereld R. Nicholson Library, the Pacific City Arts Association, the Pacific City Dorymen\u27s Association, and the Linfield Center for the Northwest joined forces to engage in a collaborative college and community venture to preserve this important facet of Oregon’s history. Using ethnography as a theoretical grounding and oral history as a method, the project utilized artifacts from the dory fleet to augment interview data, and faculty/student teams created a searchable digital archive available via open access. The chapter draws on the authors’ experiences to identify a philosophy of strategic collaboration. Topics include project development and management, assessment, and the role of serendipity. In an era of value-added services where libraries need to continue to prove their worth, partnering with internal and external entities to create content is one way for academic libraries to remain relevant to agencies that do not have direct connections to higher education. This project not only developed a positive “town and gown” relationship with a regional community, it also benefited partner organizations as they sought to fulfill their missions. The project also serves as a potential model for intra- and inter-agency collaboration for all types of libraries

Combining request scheduling with web caching

We extend the classic paging model by allowing reordering of requests under the constraint that a request is delayed by no longer than a predetermined number of time steps. We first give a dynamic programming algorithm to solve the offline case. Then we give tight bounds on competitive ratios for the online case. For caches of size k, we obtain bounds of k + O(1) for deterministic algorithms and Theta(log k) for randomized algorithms. We also give bounds for the case where either the online or the offline algorithm can reorder the requests, but not both. Finally, we extend our analysis to the case where pages have different sizes