The Erlang Weighted Tree, A New Branching Process

In this paper, we propose a new branching process which we call Erlang Weighted Tree(EWT). EWT appears as the local weak limit of a random graph model proposed by Richard La and Maya Kabkab. We derive the main properties of EWT such as the probability of extinction, the emergence of phase transition and growth rate

Preadolescent presentation of a lumbar chordoma: results of vertebrectomy and fibula strut graft reconstruction at 8 years

Chordoma is a tumour of notochordal origin which usually involves the sacrum or skull base presenting in adulthood. Chordoma in a mobile spinal segment is infrequent and the authors report an extremely rare presentation of L3 chordoma in a child aged 7 years. Although a benign tumour, mobile segment chordoma is more locally aggressive, more likely to metastasise and has a poorer 5 year survival than sacral and clival lesions. Wide surgical excision and reconstruction is the treatment of choice in vertebral chordoma. This case was treated with staged vertebrectomy and fibular strut graft reconstruction and the results of clinical and radiological follow up at 8 years are presented

Multidrug resistant tuberculosis co-existing with aspergilloma and invasive aspergillosis in a 50 year old diabetic woman: a case report

Aspergilloma and invasive aspergillosis coexisting with multidrug resistant Mycobacterium tuberculosis (MDR-TB) in the same patient is a rare entity. We report a 50 year old South Indian woman, a diabetic, who presented to us with complaints of productive cough and hemoptysis for the past 2 months. She was diagnosed to have pulmonary tuberculosis 2 years ago for which she took irregular treatment. Lung imaging showed features of a thick walled cavity in the right upper lobe with an indwelling aspergilloma. She underwent a right lung upper lobe resection. Biopsy and culture of the resected specimen showed the coexistence of Aspergillus fumigatus and multi-drug resistant Mycobacterium tuberculosis. 2 blood cultures grew Aspergillus fumigatus. She was successfully treated with Voriconazole and anti tuberculous therapy against MDR-TB

Practical Techniques For Virtual Call Resolution In Java

Virtual method calls are a fundamental feature offered by Java, an object-oriented programming language. However, they are also a source of degradation of performance at run time and imprecision in interprocedural analyses. There are several well known, inexpensive analyses that have been developed for virtual call resolution. However, they have been observed to be effective in resolving method calls in library code, while not being very effective in the benchmark code excluding libraries. We present a new flow insensitive and context insensitive analysis called reaching type analysis in this thesis. We present the analysis rules for two variations of this analysis, variable type analysis and a coarser grained version declared type analysis. Reaching type analysis is based on an analysis that builds a type propagation graph where nodes represent variables and edges represent the flow of types due to assignments. We have implemented variable type analysis and declared type analysis, and tw..

Practical Virtual Method Call Resolution for Java

This paper addresses the problem of resolving virtual method and interface calls in Java. The main focus is on practical, flow-insensitive techniques that can be used to analyze large applications. We present a new flow-insensitive analysis called reaching-type analysis, which is used to estimate the set of types that reach the receiver of virtual method/interface calls. We present two variations of this analysis, variable-type analysis and a coarser-grain version called declared-type analysis. We also demonstrate how a points-to style analysis, called refers-to analysis, can be used to resolve the types of receivers. We have implemented our techniques using the Soot framework, and we report on empirical results for 9 Java benchmarks, including the 7 benchmarks from SPECjvm98. We have measured the success of the various analyses at building accurate call graphs, and we conclude that reaching-type analysis leads to call graphs with 17% to 44% fewer edges and 14% to 48% fewer nodes than ..

Practical virtual method call resolution for Java

This paper addresses the problem of resolving virtual method and interface calls in Java. The main focus is on practical, flow-insensitive techniques that can be used to analyze large applications. We present a new flow-insensitive analysis called reaching-type analysis, which is used to estimate the set of types that reach the receiver of virtual method/interface calls. We present two variations of this analysis, variable-type analysis and a coarser-grain version called declared-type analysis. We also demonstrate how a points-to style analysis, called refers-to analysis, can be used to resolve the types of receivers. We have implemented our techniques using the Soot framework, and we report on empirical results for 9 Java benchmarks, including the 7 benchmarks from SPECjvm98. We have measured the success of the various analyses at building accurate call graphs, and we conclude that reaching-type analysis leads to call graphs with 17 % to 44 % fewer edges and 14 % to 48 % fewer nodes than the corresponding call graph built using a standard class hierarchy analysis.

Towards an Internet Connectivity Market

Today’s Internet achieves end-to-end connectivity through bilateral contracts between neighboring networks; unfortunately, this “one size fits all” connectivity results in less efficient paths, unsold capacity and unmet demand, and sometimes catastrophic market failures that result in global disconnectivity. This paper presents the design and evaluation of MINT, a Market for Internet Transit. MINT is a connectivity market and corresponding set of protocols that allows ISPs to offer path segments on an open market. Edge networks bid for end-to-end paths, and a mediator matches bids for paths to collections of path segments that form end-to-end paths. MINT can be deployed using protocols that are present in today’s routers, and it operates in parallel with the existing routing infrastructure and connectivity market. We present MINT’s market model and protocol design; evaluate how MINT improves efficiency, the utility of edge networks, and the profits of transit networks; and how MINT can operate at Internet scale