Microprocessors have difficulties addressing the demands of today's high-performance embedded applications. ASICs are a good solution to the speed concerns, but their cost and time to market can make them impractical for some needs. Configurable Computing Machines (CCMs) provide a cost-effective way of creating custom components; however, oftentimes it would be better if there were a way to change the configuration of the CCM as a program is executing. An efficient way of doing this is with Runtime Reconfigurable (RTR) computing architectures. In an RTR system, one challenging problem is the assignment of operators onto the array of processing elements (PEs) in a way as to simultaneously minimize both the number of PEs used and the number of interconnections between them for each configuration. This job is automated through the use of a software program referred to as the Spatial Partitioner. The design and implementation of the Spatial Partitioner is the subject of this work. The Spatial Partitioner developed herein uses an iterative, recursive algorithm along with cluster refinement to find a reasonably efficient allocation of operators onto the target platform in a reasonable amount of time. Information about the topology of the target platform is used throughout the execution of the algorithm to ensure that the resulting solution is legal in terms of layout. / Master of Science

When solving partial differential equations using finite difference methods on structured meshes, adaptive refinement can be used to increase the accuracy of the solution in an efficient manner. When implementing solvers using structured adaptive mesh refinement for modern parallel computer systems, an important task is the partitioning of the grid hierarchy over the available processors. The Meta-partitioner is an autonomic framework which can dynamically select between a large number of grid-partitioning algorithms at run time. In this thesis we investigate which modifications that are necessary in order to connect the Meta-partitioner to the existing SAMR-framework Chombo, and begin the process of performing this connection. We conclude that although significant changes to both Chombo and the Meta-partitioner are necessary, a connection definitely seams feasible. We estimate that that the major work of the connection has been done, and that with the experience gained from this project, the continuation is straightforward. We also connect a patch-based partitioning algorithm to Chombo and evaluate it for the first time as part of a real SAMR-based simulation. The results are promising and we conclude that it is a viable candidate for inclusion in the Meta-partitioner.

The Goldbach conjecture states that every even number greater than 2 can be written as a sumof two prime numbers. This thesis will go through the necessary theory and the backgroundto the problem at hand. Some numerical results connected to the Goldbach conjecture suchas displaying Goldbach partitions will be presented visually and interpretations of what theseresults yield will be made. How the Goldbach partitions behave for large even numbers will bestudied as well as patterns within these results. The tendencies in the graphical results supportthat the Goldbach conjecture could be true.

在這篇論文裡，我們將要討論一類古典的問題，這類問題已經經由許多方法解決，例如：遞迴關係式、差分方程式、尤拉公式等等。接著我們歸納低維度的特性，並藉由定義出一組方程式-標準n維空間分割系統-來推廣這些特性到一般的$n$維度空間中。然後我們利用演算法來提供一個更直接的組合論證法。最後，我們會把問題再細分成有界區域與無界區域的個數。 / In this article, we will discuss a class of classical questions had been solved by Recurrence Relation, Difference Equation, and Euler's Formula, etc.. And then, we construct a system of equations -Standard Partition System of n-Dimensional Space- to generalize the properties of maximizing the number of regions made up by k partitioner in an n-dimensional space and look into the construction of each dimension. Also, we provide a more directly Combinatorial Argument by Algorithm for this kind of question. At last, we focus on the number of bounded regions and unbounded regions in sense of maximizing the number of regions.

In this modern rather interconnected era, an organization’s top priority is to protect itself from major security breaches occurring frequently within a communicational environment. But, it seems, as if they quite fail in doing so. Every week there are new headlines relating to information being forged, funds being stolen and corrupt usage of credit card and so on. Personal computers are turned into “zombie machines” by hackers to steal confidential and financial information from sources without disclosing hacker’s true identity. These identity thieves rob private data and ruin the very purpose of privacy. The purpose of this project is to identify suspicious user activity by analyzing a log file which then later can help an investigation agency like FBI to track and monitor anonymous user(s) who seek for weaknesses to attack vulnerable parts of a system to have access of it. The project also emphasizes the potential damage that a malicious activity could have on the system. This project uses Hadoop framework to search and store log files for logging activities and then performs a ‘Map Reduce’ programming code to finally compute and analyze the results.