Developers use various methods and approaches to find bugs and performance bottlenecks in their programs. One of the effective and widely used approach is application profiling by dynamic instrumentation. There are many various tools based on dynamic instrumentation. Each tool has its own benefits and limitations what often forces developers to use several of them for profiling. For example, in...

Order-independent (OI) queues, introduced by Berezner, Kriel, and Krzesinski in 1995, expanded the family of multi-class queues that are known to have a product-form stationary distribution allowing for intricate class-dependent service rates. This paper further broadens this introducing pass-and-swap (P&S) an extension OI where, upon completion, customer completes is not necessarily one leaves...

This paper tests a model based on Wall's (Wall, L., 1989. Journal of Banking and Finance 13, 261±270) hypothesis of agency cost reduction using interest rate swaps. We ®nd a signi®cant positive relationship between the risk of the ®rm and the reduction of agency costs measured by the continuously compounded excess return (CAR) of the ®rm. Our ®ndings are consistent with WallÕs hypothesis and ot...

The forensics community is increasingly embracing the use of memory analysis to enhance traditional storage-based forensics techniques, because memory analysis yields a wealth of information not available on non-volatile storage. Memory analysis involves capture of a system's physical memory so that the live state of a system can be investigated, including executing and terminated processes, ap...

In this paper, we consider the all best swap edges problem in a distributed environment. We are given a 2-edge connected positively weighted networkX, where all communication is routed through a rooted spanning tree T of X. If one tree edge e = {x, y} fails, the communication network will be disconnected. However, since X is 2-edge connected, communication can be restored by replacing e by non-...

We consider the problem of computing the best swap edges of a shortest-path tree Tr rooted in r. That is, given a single link failure: if the path is not affected by the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when the message reaches the edge (u, v) where the failure has occurred, the message will then be re-routed using the comp...