Surgical treatment and outcome in patients with a hepatocellular carcinoma greater than 10 cm in diameter

BACKGROUND: Hepatocellular carcinoma (HCC) over 10 cm in diameter at the time of diagnosis continues to account for a number of patients undergoing hepatic resection. This study evaluated the clinicopathological features and outcome following surgery for large HCC. METHODS: Forty patients with a large HCC (greater than 10 cm) (group 1) resected between 1991 and 1996 were studied retrospectively. They were compared with 245 patients who had smaller HCCs (10 cm or less) (group 2). RESULTS: No patient in group 1 had hepatitis C infection compared with 22.9 per cent in group 2 (P=0.001). Patients in group 1 were significantly younger, had higher alpha-fetoprotein levels (16750 versus 1864 ng/ml; P < 0.001), better liver function, a higher incidence of multiple tumours (27 of 40 versus 42.0 per cent; P=0.003) and venous invasion (35 of 40 versus 52.2 per cent; P < 0.001), and underwent more major resections (37 of 40 versus 26.5 per cent; P < 0.001) than those in group 2. Morbidity and mortality rates and hospital stay were comparable in the two groups. For group 1, the 1-, 3- and 5-year disease-free survival rates were 42, 30 and 28 per cent respectively. Multiple tumours, venous invasion and impaired liver function were factors associated with recurrence. CONCLUSION: Large HCC had specific clinicopathological features. In selected patients, resection is safe and offers the chance of long-term disease-free survival.     

Chaos-based joint compression and encryption algorithm for generating variable length ciphertext

Here we modify a chaos-based joint compression and encryption algorithm previously proposed by us. Two modifications are suggested for improving the compression performance and generating ciphertext with variable length, respectively. The first goal is achieved by counting the number of distinct symbols visited by the chaotic search orbit, rather than the total number of iterations of the chaotic map. The second objective is realized by introducing a user-chosen parameter to determine the ratio between the search and the mask modes. The performance of the modified algorithm is justified by simulation results using standard test files.     

Analysis of distribution time of multiple files in a P2P network

Peer-to-Peer (P2P) file sharing attracts much attention due to its scalability and robustness. One important metric in measuring the performance of a P2P file sharing system is the amount of time required for all peers to get the files. We refer this time as the file distribution time. Researchers have proposed protocols to minimize the file distribution time under different situation. However, most works are based on the single-file scenario. On the other hand, there are studies showing that in a file sharing application, users may download multiple files at the same time. In this paper, we analyze the minimum time needed to distribute multiple files. We develop an explicit expression for the minimum amount of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file is not always achievable. With a comprehensive consideration of all the configurations, we elaborate how to partition the bandwidth capacities of both seeds and leechers for a particular file such that the finish time is optimal.     

Analysis and scheduling of practical network coding in OFDMA relay networks

Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization. Specifically, we aim to explore the following questions: (1) When and how can wireless nodes select relay paths in the presence of network coding? (2) How can an OFDMA relay system assign network resource such as subcarrier and power for all the transmitting nodes? (3) What are the impacts of OFDMA system parameters on the network coding gain? To answer these questions, two efficient coding-aware relay strategies are presented to select forwarding paths with fixed and dynamic power allocation. In order to exploit the network capacity in slow frequency selective fading channels, we formulate optimization frameworks and propose channel-aware coding-aware resource allocation algorithms for an arbitrary traffic pattern. Our studies show that the network coding (i.e. XOR) gain depends on the nodes’ powers, traffic patterns etc. Especially, OFDMA relay network with dynamic power possesses both coding gain and power gain. Extensive simulations are performed to verify our analysis and demonstrate the throughput improvement of our proposals in the presence of XOR coding.     

Application of virtual reality for peritoneal dialysis exchange learning in patients with end-stage renal disease and cognitive impairment

Virtual Reality - Cognitive impairment is not uncommon in patients with end-stage renal disease and can make it more difficult for these patients to carry out peritoneal dialysis (PD) on their own....     

On oligopoly spectrum allocation game in cognitive radio networks with capacity constraints

Dynamic spectrum sharing is a promising technology to improve spectrum utilization in future wireless networks. The flexible spectrum management provides new opportunities for licensed primary user and unlicensed secondary users to reallocate the spectrum resource efficiently. In this paper, we present an oligopoly pricing framework for dynamic spectrum allocation in which the primary users sell excessive spectrum to the secondary users for monetary return. We present two approaches, the strict constraints (type-I) and the QoS penalty (type-II), to model the realistic situation that the primary users have limited capacities. In the oligopoly model with strict constraints, we propose a low-complexity searching method to obtain the Nash Equilibrium and prove its uniqueness. When reduced to a duopoly game, we analytically show the interesting gaps in the leader–follower pricing strategy. In the QoS penalty based oligopoly model, a novel variable transformation method is developed to derive the unique Nash Equilibrium. When the market information is limited, we provide three myopically optimal algorithms “StrictBEST”, “StrictBR” and “QoSBEST” that enable price adjustment for duopoly primary users based on the Best Response Function (BRF) and the bounded rationality (BR) principles. Numerical results validate the effectiveness of our analysis and demonstrate the convergence of “StrictBEST” as well as “QoSBEST” to the Nash Equilibrium. For the “StrictBR” algorithm, we reveal the chaotic behaviors of dynamic price adaptation in response to the learning rates.     

Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization

The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how the profitability can be increased while maintaining good service qualities as the network scales up. In this work, we seek to understand the fundamental issues on the "interplay" (or interaction) between ISPs at different tiers. Although the local ISPs (which we term peers) can communicate with each other by purchasing the connectivity from transit ISPs, there stands an opportunity for them to set up private peering relationships. Under this competitive framework, we explore the issues on 1) the impact of peering relationship; 2) resource distribution; 3) revenue maximization; and 4) condition for network upgrade. First, a generalized model is presented to characterize the behaviors of peers and the transit ISP, in which their economic interests are reflected. We study how a peer can distributively determine its optimal peering strategy. Furthermore, we show how a transit ISP is able to utilize the available information to infer its optimal pricing strategy, under which a revenue maximization is achieved. Two distributed algorithms are proposed to help ISPs to provide a fair and efficient bandwidth allocation to peers, avoiding a resource monopolization of the market. Last, we investigate the above issues in a "many-peers region," that is, when we scale up the network. We provide insightful evidence to show that the ISPs can still gain profits as they upgrade the network infrastructures. Extensive simulations are carried out to support our theoretical claims.     

Fuzzy medial axis transformation (fmat): Image representation,skeleton extraction and uncertainty management in computer vision

The problem of extraction of medial axis transformation of a gray image with reference to skeletonization, image representation and uncertainty management in a vision system has been addressed. The Fuzzy Medial Axis Transformation (fmat) of a fuzzy setf is a set of fuzzy disks whose sup isf. Unfortunately, specifying thefmat sometimes requires more storage space than specifyingf itself. The present paper describes some techniques to improve the compact representation offmat; thereby making it practically useful to an image for its skeleton extraction and compact representation, for shape analysis and template matching, for representation and retrieval, for uncertainty management in recognition and for creating new images of various poses. The algorithms involve reduction of redundancy infmat, its approximation, and reduction of the searching spaces for its computation. Computational aspects for the convenience of writing an efficient program have been described. Some applications of thefmat have also been mentioned. This work was done while SKP held annrc-nasa Senior Research Associateship at the Lyndon B Johnson Space Center, Houston, Texas.     

Threshold-Based Dynamic Replication in Large-Scale Video-on-Demand Systems

Recent advances in high speed networking technologies and video compression techniques have made Video-on-Demand (VOD) services feasible. A large-scale VOD system imposes a large demand on I/O bandwidth and storage resources, and therefore, parallel disks are typically used for providing VOD service. Although striping of movie data across a large number of disks can balance the utilization among these disks, such a striping technique can exhibit additional complexity, for instance, in data management, such as synchronization among disks during data delivery, as well as in supporting fault tolerant behavior. Therefore, it is more practical to limit the extent of data striping, for example, by arranging the disks in groups (or nodes) and then allowing intra-group (or intra-node) data striping only. With multiple striping groups, however, we may need to assign a movie to multiple nodes so as to satisfy the total demand of requests for that movie. Such an approach gives rise to several design issues, including: (1) what is the right number of copies of each movie we need so as to satisfy the demand and at the same time not waste storage capacity, (2) how to assign these movies to different nodes in the system, and (3) what are efficient approaches to altering the number of copies of each movie (and their placement) when the need for that arises. In this paper, we study an approach to dynamically reconfiguring the VOD system so as to alter the number of copies of each movie maintained on the server as the access demand for these movies fluctuates. We propose various approaches to addressing the above stated issues, which result in a VOD design that is adaptive to the changes in data access patterns. Performance evaluation is carried out to quantify the costs and the performance gains of these techniques.     

热泵干燥系统在纺织行业的应用

在分析对比热泵干燥系统的几种空气循环方式后,结合纺织干燥工艺的特点,提出一种新的干燥循环方式-物料流动准封闭式循环干燥系统,通过对这种循环方式的运行过程分析,说明该系统具有较好的节能效果.