In fluid simulation, the analysis and calculation of various forces within the fluid is critical, since the detailed motion of the fluid animated surface depends on the motion of the particles caused by various forces between the internal particles of the fluid. The vorticity constraint of the fluid is ubiquitous in the fluid, especially in the simulation of multiphase fluids, due to the different properties of the viscosity, density and other properties of the different phase fluids, resulting in more complex vortex generation. We mainly modify the vorticity method and the single-phase fluid simulation method in the previous grid simulation, optimize it, apply it to the simulation of multi-phase flow in the hybrid model to simulate the vorticity phenomenon, so that the fluid animations are more vivid and more realistic.
Today, the main traffic in peer-to-peer (P2P) network is still multimedia files including large numbers of music files. The study of Music Information Retrieval (MIR) brings out many encouraging achievements in music search area. Nevertheless, the research of music search based on MIR in P2P network is still insufficient. Query by Humming (QBH) is one MIR technology studied for years. In this paper, we present a server based P2P music sharing system which is based on QBH and integrated with a Hierarchical Index Structure (HIS) to enhance the relation between surface data and potential information. HIS automatically evolving depends on the music related items carried by each peer such as midi files, lyrics and so forth. Instead of adding large amount of redundancy, the system generates a bit of index for multiple search input which improves the traditional keyword-based text search mode largely. When network bandwidth, speed, etc. are no longer a bottleneck of internet serve, the accessibility and accuracy of information provided by internet are being more concerned by end users.
Chord which used in structured P2P network is a successful routing algorithm based on DHT (Distributed Hash Table).
In Chord nodes locate along the Chord ring by being assigned the node identifiers and data store in corresponding nodes
with key identifier. Finger table is built in each node and is maintained when nodes join and depart. The problems in
Chord are unidirectional clockwise routing along ring and information redundancy in routing table. An improved method
is presented which is bidirectional routing table. Routing can perform along clockwise and anticlockwise according to
the locations of the current node and destination node. The next hop direction is optimization that the next node is the
nearest one apart from the destination node. This strategy limits the search area in half-ring, reduces the average hops
and enhances the search efficiency. The redundancy routing information is deleted in order to decrease the added storage
space in bidirectional routing table, thus the items share the routing information.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.