Miracle-dz/UniFAR-FTUs huggingface dataset:
Coupling Climate Conditions, Sediment Sources and Sediment Transport in an Alpine Basin

In a fluvial system, mountain basins control sediment export to the lowland rivers. Hence, analysis of erosion processes and sediment delivery patterns in mountain basins is a key factor for many applications such as land‐use management, hazard assessment and infrastructure design. Several studies have investigated the alterations triggered by recent climatic change on the hydrological regime, while only a few works have explored the consequences on fluvial sediment dynamics. Here, we combined and analyzed the quasi‐unique dataset of climatic conditions, landform response and sediment export produced, since 1986 in the Rio Cordon basin (5 km2, Eastern Italian Alps) to examine the sediment delivery processes occurring in the last 3 decades. The temperature, precipitation and fluvial sediment fluxes in the basin were analyzed using continuous measurement executed by a permanent monitoring station, while the evolution of sediment source areas was investigated using three sediment source inventories. The results showed that during the period 1986–1993 the sediment fluxes (339 Mg yr−1) reflected the stable trend of the climatic conditions. The period between the first and second source inventory (i.e. 1994–2006) was characterized by climatic fluctuations and by the occurrence of high magnitude floods. Nevertheless, a limited increase in the extent of sediment source areas was detected, suggesting that the increased sediment export (759 Mg yr−1) was mainly driven by in‐channel sediment supply. Notwithstanding the marked climate warming and the increased precipitation, a weak source area evolution and a reduction in sediment export (237 Mg yr−1) were observed during the period 2007–2015. In particular, the higher rainfall did not result in an intensification of flood events, stressing the absence of hillslope‐channel connectivity. Copyright © 2017 John Wiley & Sons, Ltd.
UC Merced Proceedings of the Annual Meeting of the Cognitive Science Society

In this paper it is argued that the way the world is conceptualized for language is language dependent and the result of negotiation between language users. This is investigated in a computer experiment in which a population of artiﬂcial agents construct a shared language to talk about a world that can be conceptualized in multiple and possibly con(cid:176)icting ways. It is argued that the establishment of a successful communication system requires that feedback about the communicative success is propagated to the ontological level, and thus that language shapes the way we conceptualize the world for communication.
Proceedings of the 12th USENIX Security Symposium

We present a new class of low-bandwidth denial of service attacks that exploit algorithmic deﬁciencies in many common applications’ data structures. Frequently used data structures have “average-case” expected running time that’s far more efﬁcient than the worst case. For example, both binary trees and hash tables can degenerate to linked lists with care-fully chosen input. We show how an attacker can effectively compute such input, and we demonstrate attacks against the hash table implementations in two versions of Perl, the Squid web proxy, and the Bro intrusion detection system. Using bandwidth less than a typical dialup modem, we can bring a dedicated Bro server to its knees; after six minutes of carefully chosen packets, our Bro server was dropping as much as 71% of its trafﬁc and consuming all of its CPU. We show how modern universal hashing techniques can yield performance comparable to commonplace hash functions while being provably secure against these attacks.
Holocene temperature trends in the extratropical Northern Hemisphere based on inter‐model comparisons

Large uncertainties exist in Holocene climate estimates, especially for the early Holocene when large‐scale reorganization occurred in the climate system. To improve our understanding of these uncertainties, we compare four Holocene simulations performed with the LOVECLIM, CCSM3, HadCM3 and FAMOUS climate models. The simulations are generally consistent for the large‐scale Northern Hemisphere extratropics, while the multi‐simulation consistencies are heterogeneous on the sub‐continental scale. Consistently simulated temperature trends are found in Greenland, northern Canada, north‐eastern and north‐western Europe, and central‐west Siberia. These Holocene temperatures show a pattern of an early Holocene warming, mid‐Holocene warmth and gradual decrease towards the pre‐industrial in winter, and the extent of early Holocene warming varies spatially, with 9 °C warming in northern Canada compared with 3 °C warming in central‐west Siberia. In contrast, mismatched temperatures are detected: in Alaska, the warm early Holocene winter in LOVECLIM primarily results from strongly enhanced southerly winds induced by the ice sheets; in eastern Siberia, the intense early‐Holocene summer warmth anomaly in CCSM3 is caused by large negative albedo anomalies due to overestimated snow cover at 0 ka; in the Arctic, cool winter conditons in FAMOUS can be attributed to extensive sea ice coverage probably due to simplified sea ice representations. Thus, the Holocene temperature trends in these regions remain inconclusive.
Late Holocene palaeoproductivity changes: a multi‐proxy study in the Norwegian Trench and the Skagerrak, North Sea

To detect climatic linkages between the Baltic Sea, the Skagerrak and the Nordic Seas, we present multi‐proxy reconstructions covering the last 4500 years from three sediment cores taken in the Skagerrak and along the SW Norwegian margin. Foraminiferal assemblages at all three sites show a distinct change at c. 1700 years BP, associated with a transition from absence and rare occurrence of Brizalina skagerrakensis during c. 4500–2300 years BP to its subsequent abundance increase, suggesting a stronger influence of nutrient‐rich water‐masses during the last c. 1700 years. Increased nutrient availability, which probably stimulated higher primary productivity, is further supported by an increase in diatoms, total organic carbon and benthic foraminiferal species indicative of high productivity and carbon fluxes during the last c. 1700 years as compared to c. 4500–2300 years BP. The amplitude of the B. skagerrakensis signal is largest in the central Skagerrak and gradually becomes smaller towards the Norwegian Sea suggesting that the dominant source of the nutrient‐rich water was the brackish outflow from the Baltic Sea. The generally lower abundances of planktonic foraminifera since c. 1700 years BP support the hypothesis of less saline surface water conditions in the Skagerrak. These results agree with other studies, which suggest a stronger Baltic outflow over the last 1700 years coinciding with a general cooling, increased wintertime westerlies bringing more winter precipitation to northern Europe, increased river runoff and higher frequency of floods. The increase in outflow also occurs during deposition of laminated sediments in the deep Baltic Sea. Leakage of dissolved inorganic phosphorus from anoxic sediments, as well as enhanced erosion due to deforestation in combination with higher runoff from Norway, coastal upwelling and more vigorous frontal dynamics may all have contributed to higher nutrient availability within the adjacent Skagerrak during the last 1700 years BP as compared to c. 4500–2300 years BP, when low productivity prevailed in the study area.
JavaCompExt: Extracting Architectural Elements from Java Source Code

Abstract—Software architecture erosion is a general problem in legacy software. To fight this trend, component models and languages are designed to try to make explicit, and automatically enforceable, the architectural decisions in terms of components, interfaces, and allowed communication channels between component interfaces. To help maintainers work on existing object-oriented systems, we explore the possibility of extracting architectural elements (components, communications, services, .) from the source code. We designed a tool based on some heuristics for extracting component information from Java source code.
Internetworking with TCP/IP, Vol II: design, implementation, and intervals, third edition [Book Reviews]

essays in this book examine these global neighborhoods in detail and explore their implications. Questions addressed include: How does this newest form of communication expand, or limit, interpersonal relationships? What is the ecology of these networks? How much is known about the content? Where do the use and content of the new medium fit within the general landscape of all mediated communication? How does the mass interpersonal mediated group process work?
This paper is

Containers are widely deployed to package, isolate, and multiplex applications on shared computing infrastructure, but rely on the operating system to enforce their security guarantees. This poses a signiﬁcant security risk as large operating system codebases contain many vulnerabilities. We have created BlackBox, a new container architecture that provides ﬁne-grain protection of application data conﬁdentiality and integrity without trusting the operating system. BlackBox introduces a container security monitor, a small trusted computing base that creates protected physical address spaces (PPASes) for each container such that there is no direct information ﬂow from container to operating system or other container PPASes. Indirect information ﬂow can only happen through the monitor, which only copies data between container PPASes and the operating system as system call arguments, encrypting data as needed to protect interprocess communication through the operating system. Containerized applications do not need to be modiﬁed, can still make use of operating system services via system calls, yet their CPU and memory state are isolated and protected from other containers and the operating system. We have implemented BlackBox by leveraging Arm hardware virtualization support, using nested paging to enforce PPASes. The trusted computing base is a few thousand lines of code, many orders of magnitude less than Linux, yet supports widely-used Linux containers with only modest modiﬁcations to the Linux kernel. We show that BlackBox provides superior security guarantees over traditional hypervisor and container architectures with only modest performance overhead on real application workloads.
Extending a λ-calculus with explicit substitution which preserves strong normalisation into a confluent calculus on open terms

The last 15 years have seen an explosion in work on explicit substitution, most of which is done in the style of the λσ-calculus. In Kamareddine and Ríos (1995a), we extended the λ-calculus with explicit substitutions by turning de Bruijn's meta-operators into object-operators offering a style of explicit substitution that differs from that of λσ. The resulting calculus, λs, remains as close as possible to the λ-calculus from an intuitive point of view and, while preserving strong normalisation (Kamareddine and Ríos, 1995a), is extended in this paper to a confluent calculus on open terms: the λse-caculus. Since the establishment of these results, another calculus, λζ, came into being in Muñoz Hurtado (1996) which preserves strong normalisation and is itself confluent on open terms. However, we believe that λse still deserves attention because, while offering a new style to work with explicit substitutions, it is able to simulate one step of classical β-reduction, whereas λζ is not. To prove confluence we introduce a generalisation of the interpretation method (cf. Hardin, 1989; Curien et al., 1992) to a technique which uses weak normal forms (instead of strong ones). We consider that this extended method is a useful tool to obtain confluence when strong normalisation of the subcalculus of substitutions is not available. In our case, strong normalisation of the corresponding subcalculus of substitutions se, is still a challenging open problem to the rewrite community, but its weak normalisation is established here via an effective strategy.
Statistical Robustness of Markov Chain Monte Carlo Accelerators Extended Abstract

Statistical machine learning often uses probabilistic algorithms, such as Markov Chain Monte Carlo (MCMC) methods, to solve a wide range of problems. As alternatives to Deep Neural Networks, these algorithms provide easier access to interpreting why a given result is obtained through their model transparency and statistical properties. The algorithms, often considered too slow on conventional processors due to inefficient sampling process, can be accelerated with specialized hardware by exploiting parallelism and utilizing various hardware approximations for efficiency, such as reducing bit representation, truncating small values to zero, or simplifying the random number generator. Understanding the influence of these approximations on the correct execution of target algorithms is crucial to meet the quality requirement. A common approach to evaluating correctness is to compare the endpoint result quality (“accuracy”) against accurately-measured or hand-labeled ground-truth data using community-standard benchmarks and metrics: the hardware execution is considered to be correct if it provides comparable “accuracy” to the software-only implementations that do not have these approximations. Statistical guarantees can be made on the end-point results [6, 9]. However, domain experts in statistics, especially Bayesian Inference are interested in the full distribution of possible results rather than a single-point estimate, including both end-point results and quantified uncertainty—statistical properties of the full distribution, a.k. a. , statistical robustness. Hardware and/or software solutions should get both aspects correct. Therefore, in the domain of probabilistic computing/algorithms, correctness is defined by more than the endpoint result of executing the algorithm, and includes statistical robustness. Statements and guarantees on the application end-point results are necessary but not sufficient to claim correctness. Failure to adequately account for domain-defined correctness can have adverse or catastrophic outcomes, such as a surgeon failing to completely remove a tumor due to incorrect uncertainty in a segmented image [2, 8]. Furthermore, measuring end-point results may not always be possible as ground-truth data is not always accessible. Therefore, a probabilistic architecture should provide some measure (or guarantee) of statistical robustness.
Transform Coefficient Coding in HEVC

This paper describes transform coefficient coding in the draft international standard of High Efficiency Video Coding (HEVC) specification and the driving motivations behind its design. Transform coefficient coding in HEVC encompasses the scanning patterns and coding methods for the last significant coefficient, significance map, coefficient levels, and sign data. Special attention is paid to the new methods of last significant coefficient coding, multilevel significance maps, high-throughput binarization, and sign data hiding. Experimental results are provided to evaluate the performance of transform coefficient coding in HEVC.
Clustering High-Dimensional Data Using an Efficient and Effective Data Space Reduction March 3 , 2005

Clustering multi-dimensional data on storage in a way that maximizes the densities of storage clusters can greatly facilitate eÆcient and scalable retrieval of data. Clustering algorithms appropriate for this application must support efcient reduction of the data space that enables e ective reduction of the search space. This paper introduces a new algorithm for clustering data in multi-dimensional feature spaces, called GARDENHD. Designed to support intelligent data storage, this algorithm employs an eÆcient data space reduction technique that scales both in terms of the number and dimensionality of data objects. It also produces a compact representation that can e ectively capture the essence of the data. The algorithm is a hybrid of cell-based and density-based clustering. However, unlike typical clustering methods in its class, it applies a recursive partition of sparse regions in the space using a new space-partitioning strategy. The properties of this partitioning strategy greatly facilitate data space reduction. The experiments on synthetic and real data sets reveal that GARDENHD and its data space reduction are e ective, eÆcient, and scalable.
The degradation of Brazilian socioeconomics

: In recent years, a number of illegal activities operated under the radar of conventional analysis have taken place in brazil. this study proposes an extended Keynesian Model in order to understand this phenomenon, a model that explains that crises happen because of the replacement of productive activities with unproductive and destructive activities. the model is used here to examine brazil’s socioeconomic history since the institution of the economic plan that established the actual currency “real” (r$), concluding that as the plan’s concern was predominantly with stabilization and not growth, productive activities have never been promoted on an appropriate scale. this has paved the way for the advancement of unproductive and destructive activities which have ultimately led to the country’s increasing degradation.
TCP Behavior of a Busy Internet Server : Analysis and Improvements

The rapid growth of the World Wide Web in recent years has caused a significant shift in the composition of Internet traffic. Although past work has studied the behavior of TCP dynamics in the context of bulk-transfer applications and some studies have begun to investigate the interactions of TCP and HTTP, few have used extensive real-world traffic traces to examine the problem. This interaction is interesting because of the way in which current Web browsers use TCP connections: multiple parallel short connections from a single host. In this paper, we analyze the way in which Web browsers use TCP connections based on extensive traffic traces obtained from a busy Web server (the official Web server of the 1996 Atlanta Olympic games). At the time of operation, this Web server was one of the busiest on the Internet, handling tens of millions of requests per day from hundreds of thousands of clients. We first describe the techniques used to gather these traces and reconstruct the behavior of TCP on the server. We then present a detailed analysis of TCP’s loss recovery and congestion control behavior from the recorded transfers. The two most important results are that: (1) short Web transfers lead to poor loss recovery performance for TCP, and (2) concurrent connections cause an overly aggressive use of the network. We then discuss techniques designed to solve these problems. To improve the loss recovery performance of short transfers, we present a new technique for TCP loss recovery. To improve the congestion control and loss recovery performance of multiple parallel connections, we present a new transport-level in egrated connection approach to congestion control and loss recovery. Simulation and trace analysis results show that our enhanced loss recovery scheme could have eliminated 25% of all timeout events, and our integrated connection approach provides greater fairness and improved startup performance for parallel connections. Our solutions are more general than a specific protocol enhancement such as the use of persistent connection in P-HTTP [15] and HTTP/1.1 [6], and include techniques, such as improved TCP loss recovery, that are not addressed by these protocols.
An Empirical Study of Post-Production Software Code Quality When Employing the Agile Rapid Delivery Methodology

Creative writers struggle with obtaining reliable and consistent readers for their draft works. Human reviewers are notoriously inconsistent across different reviewers, and a single reviewer’s feedback can vary significantly over time. Additionally, there are logistical issues with human feedback. We apply text analytics techniques to literary works with the goal of aiding writers in revisions. For a set of text, the Literary Analysis Tool (LAT) provides objective statistics, windowed statistics over the length of the text, and mood analysis. The LAT provides quick feedback, at any time, in an absolutely objective manner. We present the feedback of a small set of creative writers. The results indicate that text analytics has a place in the creative writing process.
Modified Non-Local Means De-noising with Patch and Edge Patch based Dictionaries

— Image denoising is a fundamental yet challenging problem that has been studied for decades. Dictionary is built only once with high resolution images belonging to different scenes. Since the dictionary is well organized in terms of indexing its entries, it is used to search similar patches very quickly for efficient NLM denoising.Our approach is very different in the sense, we build a single dictionary as a pre-processing step with a large number of arbitrary but high quality, textured images belonging to different object classes in contrast with building a dictionary for each noisy test image separately. We prefer to do this to avoid the time required to build the dictionary each time for separate test images.Principle Component Analysis (PCA) is a standard tool in modern data analysis because it is simple method for extracting relevant information from complex data matrix using eigenvalues and eigenvectors. The multi-scale principal component generalizes the usual PCA of a multivariate signal seen as a matrix by performing simultaneously a PCA on the matrices of details of different levels. In multi scale Principal Component Analysis (MSPCA) de-correlate the variables by extracting a linear relationship and wavelet analysis. For dictionary building purpose smooth patches has been find using PCA. Then clustering is done for the similar patches. Then id is allocated for each cluster to get the dictionary.
An Adaptive Hybrid Server Architecture for Client Caching ODBMSs

Current client-server object database management systems employ either a page server or an object server architecture. Both of these architectures have their respective strengths, but they also have key drawbacks for important system and workload configurations. We propose a new hybrid server architecture which combines the best features of both page server and object server architectures while avoiding their problems. The new architecture incorporates new or adapted versions of data transfer, recovery, and cache consistency algorithms; in this paper we focus only on the data transfer and recovery issues. The data transfer mechanism allows the hybrid server to dynamically behave as both page and object server. The performance comparison of the hybrid server with object and page servers indicates that the performance of the hybrid server is more robust than the others.
Tiling Motion Patches

Simulating multiple character interaction is challenging because character actions must be carefully coordinated to align their spatial locations and synchronized with each other. We present an algorithm to create a dense crowd of virtual characters interacting with each other. The interaction may involve physical contacts, such as hand shaking, hugging, and carrying a heavy object collaboratively. We address the problem by collecting deformable motion patches, each of which describes an episode of multiple interacting characters, and tiling them spatially and temporally. The tiling of motion patches generates a seamless simulation of virtual characters interacting with each other in a nontrivial manner. Our tiling algorithm uses a combination of stochastic sampling and deterministic search to address the discrete and continuous aspects of the tiling problem. Our tiling algorithm made it possible to automatically generate highly complex animation of multiple interacting characters. We achieve the level of interaction complexity far beyond the current state of the art that animation techniques could generate, in terms of the diversity of human behaviors and the spatial/temporal density of interpersonal interactions.