a wireless sensor network (wsn) is a wireless decentralized structure network consists of many nodes. nodes can be fixed or mobile. wsn applications typically observe some physical phenomenon through sampling of the environment so determine the location of events is an important issue in wsn. wireless localization used to determine the position of nodes. the precise localization in wsns is a co...

Linear scan register allocation is a fast global register allocation first presented in [PS99] as an alternative to the more widely used graph coloring approach. In this paper, I apply the linear scan register allocation algorithm in a system with SSA form and show how to improve the algorithm by taking advantage of lifetime holes and memory operands, and also eliminate the need for reserving r...

objective(s): in this study, we aimed to describe the characteristics of portal vein tumor thrombosis (pvtt), complicating hepatocellular carcinoma (hcc) in contrast-enhanced fdg pet/ct scan. methods: in this retrospective study, 9 hcc patients with fdg-avid pvtt were diagnosed by contrast-enhanced fluorodeoxyglucose positron emission tomography/computed tomography (fdg pet/ct), which is a comb...

Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear scan register allocation yields poorer code than allocation schemes based on graph coloring. In this paper, we propose a pre-pass instruction scheduling algorithm that improves on the code quality of linear scan allocators. Our...

For n > r > 1, let f,(n) denote the minimum number q, such that it is possible to partition all edges of the complete r-graph on n vertices into q complete r-partite r-graphs. Graham and Pollak showed that fz(n) = n-1. Here we observe that f3(n) = n-2 and show that for every fixed r > 2, there are positive constants cx(r) and c2(r) such that q(r) < f,(n)" n-f'/2J < c2(r) for all n > r. This sol...

In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear Scan algorithms while delivering performance that can match or surpass that of Graph Coloring. Specifically, this paper makes the following contributions: – We highlight three fundamental theoretical limitations in usi...

MOTIVATION Scanning parameters are often overlooked when optimizing microarray experiments. A scanning approach that extends the dynamic data range by acquiring multiple scans of different intensities has been developed. RESULTS Data from each of three scan intensities (low, medium, high) were analyzed separately using multiple scan and linear regression approaches to identify and compare the...