Information dynamics: patterns of expectation and surprise in the perception of music

This is a postprint of an article submitted for consideration in Connection Science © 2009 [copyright Taylor & Francis]; Connection Science is available online at:http://www.tandfonline.com/openurl?genre=article&issn=0954-0091&volume=21&issue=2-3&spage=8

The New Horizon Run Cosmological N-Body Simulations

We present two large cosmological N-body simulations, called Horizon Run 2 (HR2) and Horizon Run 3 (HR3), made using 6000^3 = 216 billions and 7210^3 = 374 billion particles, spanning a volume of (7.200 Gpc/h)^3 and (10.815 Gpc/h)^3, respectively. These simulations improve on our previous Horizon Run 1 (HR1) up to a factor of 4.4 in volume, and range from 2600 to over 8800 times the volume of the Millennium Run. In addition, they achieve a considerably finer mass resolution, down to 1.25x10^11 M_sun/h, allowing to resolve galaxy-size halos with mean particle separations of 1.2 Mpc/h and 1.5 Mpc/h, respectively. We have measured the power spectrum, correlation function, mass function and basic halo properties with percent level accuracy, and verified that they correctly reproduce the LCDM theoretical expectations, in excellent agreement with linear perturbation theory. Our unprecedentedly large-volume N-body simulations can be used for a variety of studies in cosmology and astrophysics, ranging from large-scale structure topology, baryon acoustic oscillations, dark energy and the characterization of the expansion history of the Universe, till galaxy formation science - in connection with the new SDSS-III. To this end, we made a total of 35 all-sky mock surveys along the past light cone out to z=0.7 (8 from the HR2 and 27 from the HR3), to simulate the BOSS geometry. The simulations and mock surveys are already publicly available at http://astro.kias.re.kr/Horizon-Run23/.Comment: 18 pages, 10 figures. Added clarification on Fig 6. Published in the Journal of the Korean Astronomical Society (JKAS). The paper with high-resolution figures is available at http://jkas.kas.org/journals/2011v44n6/v44n6.ht

NASA Strategic Roadmap Summary Report

In response to the Vision, NASA commissioned strategic and capability roadmap teams to develop the pathways for turning the Vision into a reality. The strategic roadmaps were derived from the Vision for Space Exploration and the Aldrich Commission Report dated June 2004. NASA identified 12 strategic areas for roadmapping. The Agency added a thirteenth area on nuclear systems because the topic affects the entire program portfolio. To ensure long-term public visibility and engagement, NASA established a committee for each of the 13 areas. These committees - made up of prominent members of the scientific and aerospace industry communities and senior government personnel - worked under the Federal Advisory Committee Act. A committee was formed for each of the following program areas: 1) Robotic and Human Lunar Exploration; 2) Robotic and Human Exploration of Mars; 3) Solar System Exploration; 4) Search for Earth-Like Planets; 5) Exploration Transportation System; 6) International Space Station; 7) Space Shuttle; 8) Universe Exploration; 9) Earth Science and Applications from Space; 10) Sun-Solar System Connection; 11) Aeronautical Technologies; 12) Education; 13) Nuclear Systems. This document contains roadmap summaries for 10 of these 13 program areas; The International Space Station, Space Shuttle, and Education are excluded. The completed roadmaps for the following committees: Robotic and Human Exploration of Mars; Solar System Exploration; Search for Earth-Like Planets; Universe Exploration; Earth Science and Applications from Space; Sun-Solar System Connection are collected in a separate Strategic Roadmaps volume. This document contains memebership rosters and charters for all 13 committees

Time and volume based optimal pricing strategies for telecommunication networks

In the recent past, there have been several initiatives by major network providers such as Turk Telekom lead the industry towards network capacity distribution in Turkey. In this study, we use a monopoly pricing model to examine the optimal pricing strategies for “pay-per-volume” and “pay-per-time” based leasing of data networks. Traditionally, network capacity distribution includes short/long term bandwidth and/or usage time leasing. Each consumer has a choice to select volume based pricing or connection time based pricing. When customers choose connection time based pricing, their optimal behavior would be utilizing the bandwidth capacity fully therefore it can cause network to burst. Also, offering pay-per-volume scheme to the consumer provides the advantage of leasing the excess capacity for other potential customers for network provider. We examine the following issues in this study: (i) What are the extra benefits to the network provider for providing the volume based pricing scheme? and (ii) Does the amount of demand (number of customers enter the market) change? The contribution of this paper is to show that pay-per-volume is a viable alternative for a large number of customers, and that judicious pricing for pay-per-volume is profitable for the network provider

Finiteness conditions for graph algebras over tropical semirings

Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lov{\'a}sz and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of bounded tree-width. We introduce join matrices, a generalization of connection matrices, and allow graph parameters to take values in the tropical rings (max-plus algebras) over the real numbers. We show that rank-finiteness of join matrices implies that these graph parameters can be computed in polynomial time on graph classes of bounded clique-width. In the case of graph parameters with values in arbitrary commutative semirings, this remains true for graph classes of bounded linear clique-width. B. Godlin, T. Kotek and J.A. Makowsky (2008) showed that definability of a graph parameter in Monadic Second Order Logic implies rank finiteness. We also show that there are uncountably many integer valued graph parameters with connection matrices or join matrices of fixed finite rank. This shows that rank finiteness is a much weaker assumption than any definability assumption.Comment: 12 pages, accepted for presentation at FPSAC 2014 (Chicago, June 29 -July 3, 2014), to appear in Discrete Mathematics and Theoretical Computer Scienc

Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the Feferman-Vaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order logic with modular counting quantifiers. For sum-like operations it is CMSOL, the corresponding monadic second order logic. We discuss whether there are maximal logics satisfying Feferman-Vaught Theorems for finite structures.Comment: Appeared in YuriFest 2015, held in honor of Yuri Gurevich's 75th birthday. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23534-9_1

Connection between electrical conductivity and diffusion coefficient of a conductive porous material filled with electrolyte

The paper focuses on the cross-property connection between the effective electrical conductivity and the overall mass transfer coefficient of a two phase material. The two properties are expressed in terms of the tortuosity parameter which generalized to the case of a material with two conductive phases. Elimination of this parameter yields the cross-property connection. The theoretical derivation is verified by comparison with computer simulation

Optimal pricing strategies for capacity leasing based on time and volume usage in telecommunication networks

In this study, we use a monopoly pricing model to examine the optimal pricing strategies for “pay-per-time”, “pay-per-volume” and “pay-per both time and volume” based leasing of data networks. Traditionally, network capacity distribution includes short/long term bandwidth and/or usage time leasing. Each consumer has a choice to select volume based, connection-time based or both volume and connection-time based pricing. When customers choose connection-time based pricing, their optimal behavior would be utilizing the bandwidth capacity fully, which can cause network to burst. Also, offering the pay-per-volume scheme to the consumer provides the advantage of leasing the excess capacity to other potential customers serving as network providers. However, volume-based strategies are decreasing the consumers’ interest and usage, because the optimal behaviors of the customers who choose the pay-per-volume pricing scheme generally encourages them to send only enough bytes for time-fixed tasks (for real time applications), causing quality of the task to decrease, which in turn creating an opportunity cost. Choosing pay-per time and volume hybridized pricing scheme allows customers to take advantages of both pricing strategies while decreasing (minimizing) the disadvantages of each, because consumers generally have both time-fixed and size-fixed task such as batch data transactions. However, such a complex pricing policy may confuse and frighten consumers. Therefore, in this study we examined the following two issues: (i) what (if any) are the benefits to the network provider of providing the time and volume hybridized pricing scheme? and (ii) would this offering schema make an impact on the market size? The main contribution of this study is to show that pay-per both time and volume pricing is a viable and often preferable alternative to the only time and/or only volume-based offerings for a large number of customers, and that judicious use of such pricing policy is profitable to the network provider