615 research outputs found
Algorithms for Fast Computing of the 3D-DCT Transform
The algorithm for video compression based on the Three-Dimensional Discrete Cosine Transform (3D-DCT) is presented. The original algorithm of the 3D-DCT has high time complexity. We propose several enhancements to the original algorithm and make the calculation of the DCT algorithm feasible for future real-time video compression
Recommended from our members
Expert and operator perspectives on barriers to energy efficiency in data centers
It was last estimated in 2016 that data centers (DCs) comprise approximately 2% of total US electricity consumption. However, this estimate is currently being updated to account for the massive increase in computing needs due to streaming, cryptocurrency, and artificial intelligence (AI). To prevent energy consumption that tracks with increasing computing needs, it is imperative we identify energy efficiency strategies and investments beyond the low-hanging fruit solutions. In a two-phased research approach, we ask: What non-technical barriers still impede energy efficiency (EE) practices and investments in the data center sector, and what can be done to overcome these barriers? In particular, we are focused on social and organizational barriers to EE. In Phase I, we performed a literature review and found that technical solutions are abundant in the literature, but fail to address the top-down cultural shifts that need to take place in order to adapt new energy efficiency strategies. In Phase II, reported here, we interviewed 16 data center operators/experts to ground-truth our literature findings. Our interview protocols focus on three aspects of DC decision-making: procurement practices, metrics and monitoring, and perceived barriers to energy efficiency. We find that vendors are the key drivers of procurement decisions, advanced efficiency metrics are facility-specific, and there is convergence in the design of advanced facilities due to the heat density of parallelized infrastructure. Our ultimate goals for our research are to design DC decarbonization policies that target organizational structure, empower individual staff, and foster a supportive external market
Teaching powerful geographical knowledge : a matter of social justice : initial findings from the GeoCapabilities 3 project
GeoCapabilities offers an approach for unlocking powerful disciplinary knowledge (PDK) for children. In phase three of the project, we are exploring how far GeoCapabilities âworksâ for teachers serving communities in challenging socio-economic circumstances. We connect GeoCapabilities to social justice in education, theoretically. Then, using the topic of migration, we discuss initial empirical findings of how teachers understand PDK and their challenges for teaching PDK. Collaborative work between teachers and academics suggests that the social justice dimension of GeoCapabilities could be realised, with appropriate support for teachers. We conclude with a set of principles to inform the future work of GeoCapabilities
Wi-Fi Influence on LTE-U Downlink Data and Control Channel Performance in Shared Frequency Bands
Nowadays, providers of wireless services try to find appropriate ways to increase user data throughput mainly for future 5G cellular networks. Utilizing the unlicensed spectrum (ISM bands) for such purpose is a promising solution: unlicensed frequency bands can be used as a complementary data pipeline for UMTS LTE (Universal Mobile Telecommunication System - Long Term Evolution) and its advanced version LTE-Advanced, especially in pico- or femtocells. However, coexisting LTE and WLAN services in shared ISM bands at the same time can suffer unwanted performance degradation. This paper focuses predominantly on co-channel coexistence issues (worst case) between LTE and WLAN (IEEE 802.11n) services in the ISM band. From the viewpoint of novelty, the main outcomes of this article are follows. Firstly, an appropriate signal processing approach for coexisting signals with different features in the baseband is proposed. It is applied in advanced link-layer simulators and its correctness is verified by various simulations. Secondly, the influence of IEEE 802.11n on LTE data and control channel performance is explored. Performance evaluation is based on error rate curves, depending on Signal-to-Interference ratio (SIR). Presented results allow for better understanding the influence of IEEE 802.11n on the LTE downlink physical control channels (PCCH) and are valuable for mobile infrastructure vendors and operators to optimize system parameters
YORP and Yarkovsky effects in asteroids (1685) Toro, (2100) Ra-Shalom, (3103) Eger, and (161989) Cacus
The rotation states of small asteroids are affected by a net torque arising
from an anisotropic sunlight reflection and thermal radiation from the
asteroids' surfaces. On long timescales, this so-called YORP effect can change
asteroid spin directions and their rotation periods. We analyzed lightcurves of
four selected near-Earth asteroids with the aim of detecting secular changes in
their rotation rates that are caused by YORP. We use the lightcurve inversion
method to model the observed lightcurves and include the change in the rotation
rate as a free parameter of optimization. We
collected more than 70 new lightcurves. For asteroids Toro and Cacus, we used
thermal infrared data from the WISE spacecraft and estimated their size and
thermal inertia. We also used the currently available optical and radar
astrometry of Toro, Ra-Shalom, and Cacus to infer the Yarkovsky effect. We
detected a YORP acceleration of for asteroid Cacus. For
Toro, we have a tentative () detection of YORP from a significant
improvement of the lightcurve fit for a nonzero value of . For asteroid
Eger, we confirmed the previously published YORP detection with more data and
updated the YORP value to . We also updated the shape model of
asteroid Ra-Shalom and put an upper limit for the change of the rotation rate
to . Ra-Shalom has a greater than
Yarkovsky detection with a theoretical value consistent with observations
assuming its size and/or density is slightly larger than the nominally expected
values
(16) Psyche: A mesosiderite-like asteroid?
Asteroid (16) Psyche is the target of the NASA Psyche mission. It is
considered one of the few main-belt bodies that could be an exposed
proto-planetary metallic core and that would thus be related to iron
meteorites. Such an association is however challenged by both its near- and
mid-infrared spectral properties and the reported estimates of its density.
Here, we aim to refine the density of (16) Psyche to set further constraints on
its bulk composition and determine its potential meteoritic analog.
We observed (16) Psyche with ESO VLT/SPHERE/ZIMPOL as part of our large
program (ID 199.C-0074). We used the high angular resolution of these
observations to refine Psyche's three-dimensional (3D) shape model and
subsequently its density when combined with the most recent mass estimates. In
addition, we searched for potential companions around the asteroid. We derived
a bulk density of 3.99\,\,0.26\,gcm for Psyche. While such
density is incompatible at the 3-sigma level with any iron meteorites
(7.8\,gcm), it appears fully consistent with that of
stony-iron meteorites such as mesosiderites (density
4.25\,cm). In addition, we found no satellite in our images
and set an upper limit on the diameter of any non-detected satellite of
1460\,\,200}\,m at 150\,km from Psyche (0.2\%\,\,R, the
Hill radius) and 800\,\,200\,m at 2,000\,km (3\%\,\,).
Considering that the visible and near-infrared spectral properties of
mesosiderites are similar to those of Psyche, there is merit to a
long-published initial hypothesis that Psyche could be a plausible candidate
parent body for mesosiderites.Comment: 16 page
Microscopic observation of magnon bound states and their dynamics
More than eighty years ago, H. Bethe pointed out the existence of bound
states of elementary spin waves in one-dimensional quantum magnets. To date,
identifying signatures of such magnon bound states has remained a subject of
intense theoretical research while their detection has proved challenging for
experiments. Ultracold atoms offer an ideal setting to reveal such bound states
by tracking the spin dynamics after a local quantum quench with single-spin and
single-site resolution. Here we report on the direct observation of two-magnon
bound states using in-situ correlation measurements in a one-dimensional
Heisenberg spin chain realized with ultracold bosonic atoms in an optical
lattice. We observe the quantum walk of free and bound magnon states through
time-resolved measurements of the two spin impurities. The increased effective
mass of the compound magnon state results in slower spin dynamics as compared
to single magnon excitations. In our measurements, we also determine the decay
time of bound magnons, which is most likely limited by scattering on thermal
fluctuations in the system. Our results open a new pathway for studying
fundamental properties of quantum magnets and, more generally, properties of
interacting impurities in quantum many-body systems.Comment: 8 pages, 7 figure
Phase transitions for suspension flows
This paper is devoted to study thermodynamic formalism for suspension flows
defined over countable alphabets. We are mostly interested in the regularity
properties of the pressure function. We establish conditions for the pressure
function to be real analytic or to exhibit a phase transition. We also
construct an example of a potential for which the pressure has countably many
phase transitions.Comment: Example 5.2 expanded. Typos corrected. Section 6.1 superced the note
"Thermodynamic formalism for the positive geodesic flow on the modular
surface" arXiv:1009.462
A Finite Representation of the Narrowing Space
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-14125-1_4Narrowing basically extends rewriting by allowing free variables
in terms and by replacing matching with unification. As a consequence,
the search space of narrowing becomes usually infinite, as in
logic programming. In this paper, we introduce the use of some operators
that allow one to always produce a finite data structure that still represents
all the narrowing derivations. Furthermore, we extract from this
data structure a novel, compact equational representation of the (possibly
infinite) answers computed by narrowing for a given initial term.
Both the finite data structure and the equational representation of the
computed answers might be useful in a number of areas, like program
comprehension, static analysis, program transformation, etc.Nishida, N.; Vidal, G. (2013). A Finite Representation of the Narrowing Space. En Logic-Based Program Synthesis and Transformation. Springer. 54-71. doi:10.1007/978-3-319-14125-1_4S5471Albert, E., Vidal, G.: The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing 20(1), 3â26 (2002)Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20(4), 768â844 (1998)Alpuente, M., Falaschi, M., Vidal, G.: Compositional Analysis for Equational Horn Programs. In: RodrĂguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol. 850, pp. 77â94. Springer, Heidelberg (1994)Antoy, S., Ariola, Z.: Narrowing the Narrowing Space. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 1â15. Springer, Heidelberg (1997)Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1â2), 133â178 (2000)Arts, T., Zantema, H.: Termination of Logic Programs Using Semantic Unification. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 219â233. Springer, Heidelberg (1996)Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)Bae, K., Escobar, S., Meseguer, J.: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. In: Proceedings of the 24th International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 21, pp. 81â96. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik (2013)De Schreye, D., GlĂŒck, R., JĂžrgensen, J., Leuschel, M., Martens, B., SĂžrensen, M.: Conjunctive partial deduction: foundations, control, algorihtms, and experiments. Journal of Logic Programming 41(2&3), 231â277 (1999)Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1â2), 162â202 (2006)Escobar, S., Meseguer, J.: Symbolic Model Checking of Infinite-State Systems Using Narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153â168. Springer, Heidelberg (2007)Fribourg, L.: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In: Proceedings of the Symposium on Logic Programming, pp. 172â185. IEEE Press (1985)Gnaedig, I., Kirchner, H.: Proving weak properties of rewriting. Theoretical Computer Science 412(34), 4405â4438 (2011)Hanus, M.: The integration of functions into logic programming: From theory to practice. Journal of Logic Programming 19&20, 583â628 (1994)Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012). http://www.curry-language.orgHermenegildo, M., Rossi, F.: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In: Lusk, E., Overbeck, R. (eds.) Proceedings of the 1989 North American Conf. on Logic Programming, pp. 369â389. The MIT Press, Cambridge (1989)Hölldobler, S. (ed.): Foundations of Equational Logic Programming. LNCS, vol. 353. Springer, Heidelberg (1989)Meseguer, J., Thati, P.: Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science 117, 153â182 (2005)Middeldorp, A., Okui, S.: A Deterministic Lazy Narrowing Calculus. Journal of Symbolic Computation 25(6), 733â757 (1998)Nishida, N., Sakai, M., Sakabe, T.: Generation of Inverse Computation Programs of Constructor Term Rewriting Systems. IEICE Transactions on Information and Systems J88âDâI(8), 1171â1183 (2005) (in Japanese)Nishida, N., Sakai, M., Sakabe, T.: Partial Inversion of Constructor Term Rewriting Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 264â278. Springer, Heidelberg (2005)Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Schmidt-SchauĂ, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 10, pp. 283â298. Schloss Dagstuhl - Leibniz-Zentrum fĂŒr Informatik (2011)Nishida, N., Vidal, G.: Computing More Specific Versions of Conditional Rewriting Systems. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol. 7844, pp. 137â154. Springer, Heidelberg (2013)Nutt, W., RĂ©ty, P., Smolka, G.: Basic Narrowing Revisited. Journal of Symbolic Computation 7(3/4), 295â317 (1989)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, London, UK (2002)Palamidessi, C.: Algebraic Properties of Idempotent Substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386â399. Springer, Heidelberg (1990)Ramos, J.G., Silva, J., Vidal, G.: Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Systems. In: Danvy, O., Pierce, B.C. (eds.) Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, pp. 228â239. ACM Press (2005)Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622â642 (1974
- âŠ