Peer-to-Peer (P2P) traffic has increased rapidly over the past few years, with file sharing providing the main drive behind
such traffic. In this work we perform a measurement study of the content shared over the popular BitTorrent P2P file sharing
network. We mathematically model the file size distributions of shared files after categorizing them into Audio, Video, Archive
and CD image classes. For each of these categories we look into the most popular shared file formats and investigate their
file size statistics. This provides an important milestone to building a realistic simulation framework for P2P systems, and
for future analytical modeling of P2P networks. 相似文献
In this paper, size-dependent dynamic stability of axially loaded functionally graded (FG) composite truncated conical microshells with magnetostrictive facesheets surrounded by nonlinear viscoelastic foundations including a two-parameter Winkler–Pasternak medium augmented via a Kelvin–Voigt viscoelastic approach is analyzed considering nonlinear cubic stiffness. To this purpose, von Karman-type kinematic nonlinearity along with modified couple stress theory of elasticity was applied to third-order shear deformation conical shell theory in the presence of magnetic permeability tensor and magnetic fluxes. The numerical technique of generalized differential quadrature (GDQ) was used for the solution of microstructural-dependent dynamic stability responses of FG composite truncated conical microshells. It was seen that moving from prebuckling to postbuckling domain somehow increased the significance of couple stress type of size dependency on frequency. In addition, within both prebuckling and postbuckling regimes, an increase of material gradient index decreased the importance of couple stress type of size dependency on the frequency of an axially loaded FG composite truncated conical microshell. Furthermore, it was revealed that by applying a positive magnetic field to an axially loaded truncated conical microshell with magnetostrictive facesheets, its frequency at a specific axial load value was increased in prebuckling domain and decreased in postbuckling domain. However, this pattern was reversed by applying a negative magnetic field.
The Journal of Supercomputing - Recently, the synthesis of reversible sequential circuits has attracted researchers’ attention for implementing low-power logic designs. So far, the direct and... 相似文献
Neural Computing and Applications - Detecting and correcting misspelled words in a written text are of great importance in many natural language processing applications. Errors can be broadly... 相似文献
Nowadays, various imitations of natural processes are used to solve challenging optimization problems faster and more accurately. Spin glass based optimization, specifically, has shown strong local search capability and parallel processing. But, spin glasses have a low rate of convergence since they use Monte Carlo simulation techniques such as simulated annealing (SA). Here, we propose two algorithms that combine the long range effect in spin glasses with extremal optimization (EO-SA) and learning automata (LA-SA). Instead of arbitrarily flipping spins at each step, these two strategies aim to choose the next spin and selectively exploiting the optimization landscape. As shown in this paper, this selection strategy can lead to faster rate of convergence and improved performance. The resulting two algorithms are then used to solve portfolio selection problem that is a non-polynomial (NP) complete problem. Comparison of test results indicates that the two algorithms, while being very different in strategy, provide similar performance and reach comparable probability distributions for spin selection. Furthermore, experiments show there is no difference in speed of LA-SA or EO-SA for glasses with fewer spins, but EO-SA responds much better than LA-SA for large glasses. This is confirmed by tests results of five of the world's major stock markets. In the last, the convergence speed is compared to other heuristic methods such as Neural Network (NN), Tabu Search (TS), and Genetic Algorithm (GA) to approve the truthfulness of proposed methods. 相似文献
The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT2 andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT2=(n2log2n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT2 andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6. 相似文献
Journal of Inorganic and Organometallic Polymers and Materials - The silver oxide nanoparticle was successfully synthesized using floral waste by simple one pot, cost effective method. The complete... 相似文献