Valuing the Reload Features of Executive Stock Options

Under Statement of Financial Accounting Standards No. 123, the grant date value of executive stock options excludes the value of any reload feature because, at the time of writing the standard in 1995, the Financial Accounting Standards Board believed it was not feasible to value a reload feature at the grant date. We show how the Binomial Option Pricing Model can be used to determine the grant date value of such options. Ignoring the reload feature can substantially understate the value of the option: the reload feature increases the value of an otherwise similar option by 24 percent in the example we consider. In view of the potential significance of the reload feature and the versatility of the Binomial Option Pricing Model, the Financial Accounting Standards Board may wish to reconsider the accounting for options with a reload feature.

Minimum Reload Cost Graph Factors

The concept of Reload cost in a graph refers to the cost that occurs while traversing a vertex via two of its incident edges. This cost is uniquely determined by the colors of the two edges. This concept has various applications in transportation networks, communication networks, and energy distribution networks. Various problems using this model are defined and studied in the literature. The problem of finding a spanning tree whose diameter with respect to the reload costs is the smallest possible, the problems of finding a path, trail or walk with minimum total reload cost between two given vertices, problems about finding a proper edge coloring of a graph such that the total reload cost is minimized, the problem of finding a spanning tree such that the sum of the reload costs of all paths between all pairs of vertices is minimized, and the problem of finding a set of cycles of minimum reload cost, that cover all the vertices of a graph, are examples of such problems. % In this work we focus on the last problem. Noting that a cycle cover of a graph is a 2-factor of it, we generalize the problem to that of finding an $r$-factor of minimum reload cost of an edge colored graph. We prove several NP-hardness results for special cases of the problem. Namely, bounded degree graphs, planar graphs, bounded total cost, and bounded number of distinct costs. For the special case of $r=2$, our results imply an improved NP-hardness result. On the positive side, we present a polynomial-time solvable special case which provides a tight boundary between the polynomial and hard cases in terms of $r$ and the maximum degree of the graph. We then investigate the parameterized complexity of the problem, prove W[1]-hardness results and present an FPT algorithm

PERANCANGAN JARINGAN RT/RW NET MENGGUNAKAN TEKNOLOGI WIRELESS LAN (STUDI KASUS : RZ RELOAD CONNECTION)

RZ Reload merupakan sebuah perusahaan yang bergerak dibidang penyedia jasa layanan internet swadaya. Dalam melakukan proses bisnisnya RZ Reload selama ini belum memiliki Jaringan Wireless LAN (Local Area Network). Sehingga pelanggan yang menggunakan layanan internet RZ Reload ini sangat tidak fleksibel dan mengganggu mobilitas maupun kenyamanan dari pelanggan tersebut. Tujuan membuat rancangan jaringan RT/RW Net menggunakan teknologi Wireless LAN adalah solusi untuk menyelesaikan masalah yang ada di RZ Reload. Metode yang digunakan adalah metode PPDIOO. Tahapan dengan pendekatan metode PPDIOO terdiri dari prepare, plan, design, implementasi, operate dan optimaze. Dengan penerapan metode PPDIOO dalam perancangan jaringan yang terdapat di RZ Reload, menghasilkan pemanfaatan dan penggunaan jaringan Wireless LAN dengan koneksi yang stabil dan area koneksi yang lebih luas. Kata Kunci : Perancangan, RT/RW Net, PPDIOO, Wireless La