Bulk extractor windows prefetch decoder

scan winprefetch is a C++ and thread-safe Windows prefetch scanner for the bulk extractor framework that decodes prefetch files. The decoder analyzes disk images for Windows prefetch files. At the completion of analyzing each prefetch file found on the disk image, a text file is created containing a XML output detailing all found prefetch files.Approved for public release; distribution is unlimited

Algebraic and combinatorial aspects of sandpile monoids on directed graphs

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph, known as its sandpile monoid. Most of the work on sandpiles so far has focused on the sandpile group rather than the sandpile monoid of a graph, and has also assumed the underlying graph to be undirected. A notable exception is the recent work of Babai and Toumpakari, which builds up the theory of sandpile monoids on directed graphs from scratch and provides many connections between the combinatorics of a graph and the algebraic aspects of its sandpile monoid. In this paper we primarily consider sandpile monoids on directed graphs, and we extend the existing theory in four main ways. First, we give a combinatorial classification of the maximal subgroups of a sandpile monoid on a directed graph in terms of the sandpile groups of certain easily-identifiable subgraphs. Second, we point out certain sandpile results for undirected graphs that are really results for sandpile monoids on directed graphs that contain exactly two idempotents. Third, we give a new algebraic constraint that sandpile monoids must satisfy and exhibit two infinite families of monoids that cannot be realized as sandpile monoids on any graph. Finally, we give an explicit combinatorial description of the sandpile group identity for every graph in a family of directed graphs which generalizes the family of (undirected) distance-regular graphs. This family includes many other graphs of interest, including iterated wheels, regular trees, and regular tournaments.Comment: v2: Cleaner presentation, new results in final section. Accepted for publication in J. Combin. Theory Ser. A. 21 pages, 5 figure

Experimental insight into the domain decomposition method for a finite element method code

The use of Domain Decomposition Methods (DDM) for a Finite Element Method (FEM) framework was a hot topic in the past decade, leading to very powerful results in terms of scalability and widening the problems that could be full-wave simulated with the FEM, [1–3]. However, despite the promising results shown in these references, it seems not to be a widespread use of the DDM in commercial FEM softwares or publications, whereas the common research topics (adaptivity, higher-order basis functions, different element shapes) in FEM have not been explored together with DDM. In this communication, we share experimental details with different non-overlapping DDM within FEM. We explore the use of different finite element shapes with up to fourth-order basis functions. We propose a propagation problem through a rectangular waveguide as a benchmark, and we show the different implementation choices available and their impact in the performance of the code

Eisenstein cohomology classes for GLN\mathrm{GL}_N over imaginary quadratic fields

We study the arithmetic of degree $N-1$ Eisenstein cohomology classes for locally symmetric spaces associated to $\mathrm{GL}_N$ over an imaginary quadratic field $k$. Under natural conditions we evaluate these classes on $(N-1)$-cycles associated to degree $N$ extensions $F/k$ as linear combinations of generalised Dedekind sums. As a consequence we prove a remarkable conjecture of Sczech and Colmez expressing critical values of $L$-functions attached to Hecke characters of $F$ as polynomials in Kronecker--Eisenstein series evaluated at torsion points on elliptic curves with multiplication by $k$. We recover in particular the algebraicity of these critical values.Comment: 35 pages, 1 figur

The reform of the portuguese pension system: a micro-simulation approach

Doutoramento em Estudos do DesenvolvimentoThis thesis uses a Dynamic Microsimulation Model (DYNAPOR) to analyse the impact of a transition from a traditional Defined Benefit Pay-As-You-Go pension scheme to a Notional Defined Contribution system on both the financial and the social sustainability of the pension system in Portugal. The results show that while the NDC scenarios outperform the DB-PAYG system in terms of financial sustainability, it does so at cost of the social component. Additionally, the various features of the NDC pension system are proven to be essential in both curbing expenditure and improving adequacy and poverty alleviation.Esta tese utiliza um modelo de micro-simulação dinâmico (DYNAPOR) para analisar o impacto económico, financeiro e social da transição de um sistema de pensões pay-as-you-go de benefício definido para um sistema de contas nocionais em Portugal. Utiliza o modelo DYNAPOR para simular quatro cenários diferentes. Os resultados obtidos sugerem que uma transição para um sistema de contas nocionais semelhante ao que está em vigor na Suécia se traduz num melhoramento significativo da sustentabilidade financeira em relação ao previsto no sistema atual. Contudo, este melhoramento na sustentabilidade financeira acontece em detrimento da componente social do sistema de pensões. Mais, o impacto da componente redistributiva e de balanço automático do sistema NDC no alívio da pobreza e da despesa é comprovado pelos resultados.N/