2850355
An Optimal Node Selection Scheme in Multi-hop Wireless Network
In this paper, a cooperative wireless multi-hop network is considered, cooperative diversity can be realized by allowing nodes close proximity to cooperate in transmission. In order to group receiver nodes into a cluster, it is necessary to select appropriate nodes. We introduce an optimal node selection algorithm based on MIMO antenna selection, this algorithm, combining with cooperative transmission strategy, gives an optimal node selection algorithm using convex optimization theory. Theoretical analysis and simulation indicate that this scheme can give good performance of maximizing the channel capacity through optimal node selection.
19641962
Adaptive Video Streaming over P2P Multi-Hop Path
27040656
Rough Asymptotics of Forward-Backward Stochastic Differential Equations
This note is concerned with the asymptotic behavior of adapted solutions to forward-backward SDEs when the forward diffusion contains small noises. We prove the sample path Large Deviation Principle (LDP) for the adapted solutions to the FBSDEs under appropriate conditions stated in terms of a certain type of convergence of the solutions to the associated quasilinear PDEs. As an application we apply the LDP results to a problem of rare event simulation. We provide a necessary condition for the existence of an asymptotically efficient estimator amongst the class of importance sampling estimators.
370694
Further Results on the Asymptotic Memory Capacity of the Generalized Hopfield Network
This paper presents a further theoretical analysis on the asymptotic memory capacity of the generalized Hopfield network (GHN) under the perceptron learning scheme. It has been proved that the asymptotic memory capacity of the GHN is exactly 2(n− 1), where n is the number of neurons in the network. That is, the GHN of n neurons can store 2(n− 1) bipolar sample patterns as its stable states when n is large, which has significantly improved the existing results on the asymptotic memory capacity of the GHN.
18813613
Efficient Training of RBF Networks Via the BYY Automated Model Selection Learning Algorithms
Radial basis function (RBF) networks of Gaussian activation functions have been widely used in many applications due to its simplicity, robustness, good approximation and generalization ability, etc.. However, the training of such a RBF network is still a rather difficult task in the general case and the main crucial problem is how to select the number and locations of the hidden units appropriately. In this paper, we utilize a new kind of Bayesian Ying-Yang (BYY) automated model selection (AMS) learning algorithm to select the appropriate number and initial locations of the hidden units or Gaussians automatically for an input data set. It is demonstrated well by the experiments that this BYY-AMS training method is quite efficient and considerably outperforms the typical existing training methods on the training of RBF networks for both clustering analysis and nonlinear time series prediction.
19569352
Peer Collaboration Modes and Private Room Services in TOMSCOP
This paper presents the implementation of peer group management services in a pure P2P groupware framework called TOMSCOP (technology of multiuser synchronous collaboration platform). To support a variety of computer-based collaborative activities and styles, a user in a group can be assigned a role or identity such as a discusser peer, a chair peer, a presenter peer, a player peer, or an observer peer-Based on the above identities and their control service, we developed three collaboration modes, i.e., discussion mode, presentation mode and rotation mode, for smoothly manipulating shared applications in their different usages. Moreover we designed and implemented the public and private room services for users to create suitable collaboration rooms that match theirs privacy requirements. These modes and services not only provide more functions to TOMSCOP users, but also support software developers for easily and flexibly making P2P shared applications with different purposes
956305
Fast interval-valued statistical modeling of interconnect and effective capacitance
Correlated interval representations of range uncertainty offer an attractive solution to approximating computations on statistical quantities. The key idea is to use finite intervals to approximate the essential mass of a probability density function (pdf) as it moves through numerical operators; the resulting compact interval-valued solution can be easily interpreted as a statistical distribution and efficiently sampled. This paper first describes improved interval-valued algorithms for asymptotic wave evaluation (AWE)/passive reduced-order interconnect macromodeling algorithm (PRIMA) model order reduction for tree-structured interconnect circuits with correlated resistance, inductance, and capacitance (RLC) parameter variations. By moving to a much faster interval-valued linear solver based on path-tracing ideas, and making more optimal tradeoffs between interval- and scalar-valued computations, the delay statistics roughly 10/spl times/ faster than classical Monte Carlo (MC) simulation, with accuracy to within 5% can be extracted. This improved interval analysis strategy is further applied in order to build statistical effective capacitance (C/sub eff/) models for variational interconnect, and show how to extract statistics of C/sub eff/ over 100/spl times/ faster than classical MC simulation, with errors less than 4%.