Ferrites are materials of interest due to their broad applications in high technological devices and a lot of research has been focused to synthesize new ferrites. In this regard, an effort has been devoted to synthesize spinel Pr–Ni co-substituted strontium ferrites with a nominal formula of Sr1-xPrxFe2-yNiyO4 (0.0 ≤ x ≤ 0.1, 0.0 ≤ y ≤ 1.0). The cubic structure of pure and Pr–Ni co-substituted strontium ferrite samples calcinated at 1073 K for 3 h has been confirmed through X-ray diffraction (XRD). Average sizes of crystallites (18–25 nm) have been estimated from XRD analysis and nanometer particle sizes of synthesized ferrites have been further verified by scanning electron microscopy (SEM). SEM results have also shown that particles are mostly agglomerated and all the samples possess porosity. It has been observed that at 298 K, the values of resistivity (ρ) increase, while that of AC conductivity, dielectric loss, and dielectric constants decrease with increasing amounts of Pr3+ and Ni2+ ions. The values of dielectric parameters initially decrease with frequency and later become constant and can be explained on the basis of dielectric polarization. Electrochemical impedance spectroscopy (EIS) studies show that the charge transport phenomenon in ferrite materials is mainly controlled via grain boundaries. Overall, synthesized ferrite materials own enhanced resistivity values in the range of 1.38 × 109–1.94 × 109 Ω cm and minimum dielectric losses, which makes them suitable candidates for high frequency devices applications. 相似文献
There has been a surge of interest in the delivery of personalized information to users (e.g., personalized stocks or travel information), particularly as mobile users with limited terminal device capabilities increasingly desire updated and targeted information in real time. When the number of information recipients is large and there is sufficient commonality in their interests, as is often the case, IP multicast is an efficient way of delivering the information. However, IP multicast services do not consider the structure and semantics of the information in the multicast process. We propose the use of Content-Based Multicast (CBM) where extra content filtering is performed at the interior nodes of the IP multicast tree; this will reduce network bandwidth usage and delivery delay, as well as the computation required at the sources and sinks. We evaluate the situations in which CBM is advantageous. The benefits of CBM depend critically upon how well filters are placed at interior nodes of the IP multicast tree and the costs depend upon those introduced by filters themselves. Further, we consider the benefits of allowing the filters to be mobile so as to respond to user mobility or changes in user interests and the corresponding costs of filter mobility. The criterion that we consider is the total network bandwidth utilization. For this criterion, we develop an optimal filter placement algorithm, as well as a heuristic that executes faster than the optimal algorithm. We evaluate the algorithms by means of simulation experiments. Our results indicate that filters can be effective in substantially reducing bandwidth. We also find filter mobility is worthwhile if there is marked large-scale user mobility. We conclude with suggestions for further work. 相似文献
Composites consisting of carbon fibers (CF) and carbon particles (CP) in polypropylene (PP) matrix were melt-compounded. Composites
were analyzed for their mechanical, electrical and thermal properties. Results indicate that the addition of these fillers
improved the mechanical properties of the composites. Thermal conductivity was enhanced as the concentration of fillers was
increased. Carbon fibers render the composites electrically conductive so we observed a percolation threshold near 10 wt.%
of CF for PP/CF (PP and CF composite) and near 25 wt.% of CP for PP/CP (PP and carbon particle composite). All the results
indicated that carbon fibers are more effective in improving the properties as compare to the carbon particles. 相似文献
The edge computing model offers an ultimate platform to support scientific and real-time workflow-based applications over the edge of the network. However, scientific workflow scheduling and execution still facing challenges such as response time management and latency time. This leads to deal with the acquisition delay of servers, deployed at the edge of a network and reduces the overall completion time of workflow. Previous studies show that existing scheduling methods consider the static performance of the server and ignore the impact of resource acquisition delay when scheduling workflow tasks. Our proposed method presented a meta-heuristic algorithm to schedule the scientific workflow and minimize the overall completion time by properly managing the acquisition and transmission delays. We carry out extensive experiments and evaluations based on commercial clouds and various scientific workflow templates. The proposed method has approximately 7.7% better performance than the baseline algorithms, particularly in overall deadline constraint that gives a success rate.
The quantity of information placed on the web has been greater than before and is increasing rapidly day by day. Searching through the huge amount of data and finding the most relevant and useful result set involves searching, ranking, and presenting the results. Most of the users probe into the top few results and neglect the rest. In order to increase user’s satisfaction, the presented result set should not only be relevant to the search topic, but should also present a variety of perspectives, that is, the results should be different from one another. The effectiveness of web search and the satisfaction of users can be enhanced through providing various results of a search query in a certain order of relevance and concern. The technique used to avoid presenting similar, though relevant, results to the user is known as a diversification of search results. This article presents a survey of the approaches used for search result diversification. To this end, this article not only provides a technical survey of existing diversification techniques, but also presents a taxonomy of diversification algorithms with respect to the types of search queries. 相似文献