Boundary recovery is one of the main obstacles in applying the Delaunay criterion to mesh generation. A stan- dard resolution is to add Steiner points directly at the intersection positions between missing boundaries ...Boundary recovery is one of the main obstacles in applying the Delaunay criterion to mesh generation. A stan- dard resolution is to add Steiner points directly at the intersection positions between missing boundaries and triangulations. We redesign the algorithm with the aid of some new concepts, data structures and operations, which make its implementation routine. Furthermore, all possible intersection cases and their solutions are presented, some of which are seldom discussed in the litera- ture. Finally, numerical results are presented to evaluate the performance of the new algorithm.展开更多
Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution ad...Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution adaptive behaviour. It is not recommended to refine the parts of the domain where the solution shows little variation. It is desired to concentrate grid points and cells in the part of the domain where the solution shows strong gradients or variations. We present a simple, effective and com- putationally efficient approach for quadrilateral mesh adaptation. Several numerical examples are presented for supporting our claim.展开更多
Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to...Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.展开更多
It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions...It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space.展开更多
An algorithm for estimating the cross-bispectrum of an acoustic vector signal was formulated. Composed features of sound pressure and acoustic vector signals are extracted by the proposed algorithm and other estimatin...An algorithm for estimating the cross-bispectrum of an acoustic vector signal was formulated. Composed features of sound pressure and acoustic vector signals are extracted by the proposed algorithm and other estimating algorithms for secondary and higher order spectra. Its effectiveness was tested with lake and sea trial data. These features can be used to construct an input vector set for a radial basis function neural network. The classification of vessels can then be made based on the extracted features. It was shown that the composed features of acoustic vector signals are more easily divided into categories than those of pressure signals. When using the composed features of acoustic vector signals, the recognition rate of underwater acoustic targets improves.展开更多
Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of th...Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of the WiMedia protocol.In this work,we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that are located out of the transmission range.The proposed routing protocol is a hybrid algorithm,which mixes the table-driven and on-demand routing algorithms,searching one or more routes according to the number of hops to a destination device.WiMedia MAC is potentially capable of learning the existence of neighbor devices by using a beacon frame.By utilizing the neighbors' information,all devices can create routing entries for devices within 2-hops periodically.For devices beyond the 2-hop range,the newly designed on-demand routing algorithm is applied to multi-hop routing.If a routing entry for a destination device is not listed in the routing table,the source device sends a request packet to 2-hop range devices which could be found in the routing table.Since every device maintains routing entries for 2-hop range devices in the routing table,the request packet is replied in advance before its arrival at the destination device.Also,to decide the optimal route for a destination device,the number of medium access slots(MASs),received signal strength indicator(RSSI)and hop count are utilized to establish a QoS-enabled routing table.We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV.The simulation results show that the proposed protocol has better throughput and lower overhead than other protocols.展开更多
基金Project (No. 60225009) supported by the National Natural ScienceFoundation of China through the National Science Fund for Distin-guished Young Scholars
文摘Boundary recovery is one of the main obstacles in applying the Delaunay criterion to mesh generation. A stan- dard resolution is to add Steiner points directly at the intersection positions between missing boundaries and triangulations. We redesign the algorithm with the aid of some new concepts, data structures and operations, which make its implementation routine. Furthermore, all possible intersection cases and their solutions are presented, some of which are seldom discussed in the litera- ture. Finally, numerical results are presented to evaluate the performance of the new algorithm.
文摘Accuracy of a simulation strongly depends on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios and solution adaptive behaviour. It is not recommended to refine the parts of the domain where the solution shows little variation. It is desired to concentrate grid points and cells in the part of the domain where the solution shows strong gradients or variations. We present a simple, effective and com- putationally efficient approach for quadrilateral mesh adaptation. Several numerical examples are presented for supporting our claim.
文摘Applying ontology to describe resource metadata richly in the peer-to-peer environment has become current research trend. In this semantic peer-to-peer environment, indexing semantic element of resource description to support efficient resource location is a difficult and challenging problem. This paper provided a hybrid indexing architecture, which combines local indexing and global indexing. It uses community strategy and semantic routing strategy to organize key layer metadata element and uses DHT (distributed hash table) to index extensional layer metadata element. Compared with related system, this approach is more efficient in resource location and more scalable.
基金Supported by the National Natural Science Foundation of China (No. 29776028, No. 29836140).
文摘It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space.
基金Supported by the National Natural Science Foundation under Grant No.40827003
文摘An algorithm for estimating the cross-bispectrum of an acoustic vector signal was formulated. Composed features of sound pressure and acoustic vector signals are extracted by the proposed algorithm and other estimating algorithms for secondary and higher order spectra. Its effectiveness was tested with lake and sea trial data. These features can be used to construct an input vector set for a radial basis function neural network. The classification of vessels can then be made based on the extracted features. It was shown that the composed features of acoustic vector signals are more easily divided into categories than those of pressure signals. When using the composed features of acoustic vector signals, the recognition rate of underwater acoustic targets improves.
基金Project supported by the Second Stage of Brain Korea 21 ProjectsProject(10035236)supported by the IT_R&D Program of MKE/KEIT,Korea
文摘Though the WiMedia supports higher data rates than other WPAN technologies,a WiMedia device cannot reach other devices that are separated from it by more than 10 m,which is the typical limited transmission range of the WiMedia protocol.In this work,we propose a multi-hop QoS routing protocol to enable WiMedia devices to transmit real-time data to devices that are located out of the transmission range.The proposed routing protocol is a hybrid algorithm,which mixes the table-driven and on-demand routing algorithms,searching one or more routes according to the number of hops to a destination device.WiMedia MAC is potentially capable of learning the existence of neighbor devices by using a beacon frame.By utilizing the neighbors' information,all devices can create routing entries for devices within 2-hops periodically.For devices beyond the 2-hop range,the newly designed on-demand routing algorithm is applied to multi-hop routing.If a routing entry for a destination device is not listed in the routing table,the source device sends a request packet to 2-hop range devices which could be found in the routing table.Since every device maintains routing entries for 2-hop range devices in the routing table,the request packet is replied in advance before its arrival at the destination device.Also,to decide the optimal route for a destination device,the number of medium access slots(MASs),received signal strength indicator(RSSI)and hop count are utilized to establish a QoS-enabled routing table.We perform ns-2 simulation to investigate the performance of the proposed routing protocol with AODV and DSDV.The simulation results show that the proposed protocol has better throughput and lower overhead than other protocols.
