10659233
Wiener indices of balanced binary trees
We study a new family of trees for computation of the Wiener indices. We introduce general tree transformations and derive formulas for computing the Wiener indices when a tree is modified. We present several algorithms to explore the Wiener indices of our family of trees. The experiments support new conjectures about the Wiener indices.
6971305
Video streaming over multi-hop wireless networks
In this paper, we considered the problem of transporting layered video over erroneous multi-hop wireless networks and proposed a distributed system. Our proposed distributed scheme is comprised of distributed control (DC), distributed buffer (DB) and distributed error control schemes. The DC scheme improves the efficiency of the network bandwidth usage and reduces the end-to-end delay of the streaming application. End-to-end delay jitter can be reduced by proper use of the DB nodes' buffer. Replacing the traditional EEC and ARQ with our distributed FEC and ARQ scheme reduces the error-protection overhead and ARQ delay and improves the wireless channel throughput. A layered video module is developed in GlomoSim 2.03 for video streaming application. We simulated our distributed scheme employing the layered video module in GlomoSim 2.03. Our simulation results confirm that QoS of streaming video over erroneous multi-hop wireless network can be improved using our proposed distributed scheme.
59897458
Algorithms and qos of video streaming over wireless networks
Video streaming over wireless networks has attracted much attention recently. It is well known that video streaming is QoS Stringent applications and wireless link suffers from erroneous and time-variant conditions. Significant research work has been conducted on QoS guarantee of video streaming application in Physical, MAC and Network layers. In this dissertation, the author designed a combination of packet ordering algorithm and transmission scheme for streaming video over a single wireless link and a distributed system for streaming video over multi-hop wireless networks, respectively. 
QoS routing has been widely researched and a number of routing protocols have been proposed to support routing of QoS stringent real-time applications. Recently, scalable video coding has been used for adaptation of video streaming to heterogeneous networks, especially wireless networks. The author proposed the routing criteria and routing algorithms for the routing of base layer (BL) and enhancement layer (EL) of MPEG-4 FGS. 
Research on Mobile Ad Hoc networks (MANETS) has been driven by either large scale military applications or specialized civilian applications which are tailored to very specialized missions and cost is typically not a main issue. Wireless mesh networks (WMN) meet the demand of a limited number of people wanting to form an ad hoc network for sharing information. In wireless mesh networks, Peer-to-Peer (P2P) video streaming service request generally can be satisfied by more than one video server. WMN P2P video streaming service can be modeled by K-server problem. Competitive work function algorithm is running in the distributed manner and is robust to the update message loss. Modified work function algorithm is proposed for P2P video streaming service over congested WMN. And the author conjectured that the modified work function algorithm is still competitive.
2177063
A New Lightweight and Scalable Encryption Algorithm for Streaming Video over Wireless Networks
A process for improving the stability of a cadmium chalcogenide/copper chalcogenide photovoltaic cell is disclosed. The improvement comprises positioning a layer of a polymer composition containing electrically conductive particles between the copper chalcogenide layer and the metal electrode such that the metal electrode does not make physical contact with the copper chalcogenide layer.
45158244
Discovering pattern-based subspace clusters by pattern tree
Traditional clustering models based on distance similarity are not always effective in capturing correlation among data objects, while pattern-based clustering can do well in identifying correlation hidden among data objects. However, the state-of-the-art pattern-based clustering methods are inefficient and provide no metric to measure the clustering quality. This paper presents a new pattern-based subspace clustering method, which can tackle the problems mentioned above. Observing the analogy between mining frequent itemsets and discovering subspace clusters, we apply pattern tree - a structure used in frequent itemsets mining to determining the target subspaces by scanning the database once, which can be done efficiently in large datasets. Furthermore, we introduce a general clustering quality evaluation model to guide the identifying of meaningful clusters. The proposed new method enables the users to set flexibly proper quality-control parameters to meet different needs. Experimental results on synthetic and real datasets show that our method outperforms the existing methods in both efficiency and effectiveness.
40601169
Performance Modeling and Practical Parallel Algorithms of Cluster Computing with Applications on Distributed Platforms
16691131
Software Productivity Analysis with CSBSG Data Set
The aim is to report on an initial exploratory statistical analysis of the relationship between software productivity and its influencing factors in China. We analyzed of a data set containing project measurement data which were collected from lots of IT companies in China by China Software Benchmarking Standards Group (CSBSG), established by China Software Process Improvement Network (CSPIN), China.Productivity with its influencing factors was investigated using a exploratory statistical analysis. Only 133 closed projects with high ratings could be used in this investigation. Furthermore, confidentiality and data quality, data filling ratio and sizing method were considered as major issues during our current work and also for future investigation. Overall, we observed that influencing factors - project size, project type and business area - do affect productivity with different level statistical significance. However, no clear evidence can be observed that factors, like maximum team size and programming languages affect productivity. Ongoing analysis of productivity and its influencing factors. Based on current productivity analysis results, comparative analysis between counties and estimation modeling will be investigated in future.
14929484
An Auxiliary Ground Station Based Traffic Load Balancing Scheme for LEO Satellite Systems
In the Low Earth Orbit (LEO) satellite mobile communication system, traffic load in a spot beam fluctuates dramatically with a wide dynamic range due to the non-uniform geographical distribution of the traffic sources and the periodic satellite motion. The compromise between the utilization rate of valuable satellite channels and the blocking probability of a call causes higher proportion of channel idle time and cost of per connection. A new scheme based on auxiliary ground station (AGS) is proposed to solve this problem. The AGS is set to manage short distance calls. Simulation results illustrate that the proposed scheme balances the whole traffic load in LEO, improves the utilization rate of channels, and reduces the blocking probabilities of new calls and the dropping probabilities of handover calls. The cost of per connection is reduced at the same time.
16346838
Ant-MST: An Ant-Based Minimum Spanning Tree for Gene Expression Data Clustering
We have proposed an ant-based clustering algorithm for document clustering based on the travelling salesperson scenario. In this paper, we presented an approach called Ant-MST for gene expression data clustering based on both ant-based clustering and minimum spanning trees (MST). The ant-based clustering algorithm is firstly used to construct a fully connected network of nodes. Each node represents one gene, and every edge is associated with a certain level of pheromone intensity describing the co-expression level between two genes. Then MST is used to break the linkages in order to generate clusters. Comparing to other MST-based clustering approaches, our proposed method uses pheromone intensity to measure the similarity between two genes instead of using Euclidean distance or correlation distance. Pheromone intensities associated with every edge in a fully-connected network records the collective memory of the ants. Self-organizing behavior could be easily discovered through pheromone intensities. Experimental results on three gene expression datasets show that our approach in general outperforms the classical clustering methods such as K-means and agglomerate hierarchical clustering.