958 resultados para Testing strategies
Resumo:
Multiple UAVs are deployed to carry out a search and destroy mission in a bounded region. The UAVs have limited sensor range and can carry limited resources which reduce with use. The UAVs perform a search task to detect targets. When a target is detected which requires different type and quantities of resources to completely destroy, then a team of UAVs called as a coalition is formed to attack the target. The coalition members have to modify their route to attack the target, in the process, the search task is affected, as search and destroy tasks are coupled. The performance of the mission is a function of the search and the task allocation strategies. Therefore, for a given task allocation strategy, we need to devise search strategies that are efficient. In this paper, we propose three different search strategies namely; random search strategy, lanes based search strategy and grid based search strategy and analyze their performance through Monte-Carlo simulations. The results show that the grid based search strategy performs the best but with high information overhead.
Resumo:
Optimum design of dynamic fracture test rigs demands a thorough appreciation of beam vibration under impact. Analyses invariably presume rigid anvils, and neglect overhang effects. The beam response predicted analytically and numerically in this paper highlights the significant role of anvil rigidity and beam overhangs on the impact dynamics of three point bend (3PB) specimens.
Resumo:
Exothermic interactions like hydrogen bonding, ionic and charge transfer, etc., and ''copolymer effect'' are commonly used to induce miscibility in immiscible blends. The efficacy of these methods in promoting miscibility in poly(benzyl methacrylate) (PBMA)-polystyrene (PS) immiscible blends has been studied by suitably modifying the structure of the component polymers. It has been found that hydrogen bonding approach is most advantageous among these approaches as it involves the need for minimum interacting sites. It has also been shown that these results can be extended to the blends of poly(acrylate)s or poly(methacrylate)s with PS. (C) 1996 John Wiley & Sons, Inc.
Resumo:
CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.
Resumo:
This work describes an online handwritten character recognition system working in combination with an offline recognition system. The online input data is also converted into an offline image, and parallely recognized by both online and offline strategies. Features are proposed for offline recognition and a disambiguation step is employed in the offline system for the samples for which the confidence level of the classifier is low. The outputs are then combined probabilistically resulting in a classifier out-performing both individual systems. Experiments are performed for Kannada, a South Indian Language, over a database of 295 classes. The accuracy of the online recognizer improves by 11% when the combination with offline system is used.
Resumo:
We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.
Resumo:
We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.
Resumo:
There have been major advances in solid state and materials chemistry in the last two decades and the subject is growing rapidly. In this account, a few of the important aspects of materials chemistry of interest to the author are presented. Accordingly, transition metal oxides, which constitute the most fascinating class of inorganic materials, receive greater attention, Metal-insulator transitions in oxides, high temperature superconductivity in cuprates and colossal magnetoresistance in manganates are discussed at some length and the outstanding problems indicated, We then discuss certain other important classes of materials which include molecular materials, biomolecular materials and porous solids. Recent developments in synthetic strategies for inorganic materials are reviewed. Some results on metal nanoparticles and nanotubes are briefly presented. The overview, which is essentially intended to provide a flavour of the subject and show how it works, lists references to many crucial reviews in the recent literature.
Resumo:
The determination of consolidation characteristics forms an important aspect in the design of foundations and other earth-retaining structures. The conventional consolidation test as originally proposed by Teaaghi takes considerable time (more than 15 days in highly compressible soils with low coefficient of consolidation) and effort. Any effort to reduce the duration of testing will be desirable from several considerations. In this paper, an attempt has been made to propose a rapid method of consolidation testing. In the proposed method, the next load increment is applied as soon as the necessary time required to identify the percent consolidation is reached and to evaluate the coefficient of consolidation by one of the popular curve-fitting procedures. The rectangular hyperbola method has been used to identify the percent consolidation reached after any load increment, and to determine the coefficient of consolidation, before making the next load increment. The time required to complete the test using the rapid consolidation method could be as low as 4-5 h compared with 1 or 2 weeks in the case of the conventional consolidation test.
Resumo:
Two regiospecific modifications have been developed in the synthesis of valeranone. The first one is based on the regiospecific protection of a diol and the second is based on the Wittig reaction of a hemiacetal.
Resumo:
With the immense growth in the number of available protein structures, fast and accurate structure comparison has been essential. We propose an efficient method for structure comparison, based on a structural alphabet. Protein Blocks (PBs) is a widely used structural alphabet with 16 pentapeptide conformations that can fairly approximate a complete protein chain. Thus a 3D structure can be translated into a 1D sequence of PBs. With a simple Needleman-Wunsch approach and a raw PB substitution matrix, PB-based structural alignments were better than many popular methods. iPBA web server presents an improved alignment approach using (i) specialized PB Substitution Matrices (SM) and (ii) anchor-based alignment methodology. With these developments, the quality of similar to 88% of alignments was improved. iPBA alignments were also better than DALI, MUSTANG and GANGSTA(+) in > 80% of the cases. The webserver is designed to for both pairwise comparisons and database searches. Outputs are given as sequence alignment and superposed 3D structures displayed using PyMol and Jmol. A local alignment option for detecting subs-structural similarity is also embedded. As a fast and efficient `sequence-based' structure comparison tool, we believe that it will be quite useful to the scientific community. iPBA can be accessed at http://www.dsimb.inserm.fr/dsimb_tools/ipba/.
Resumo:
Strategies for efficient start-up of a continuous process for biooxidation of refractory gold ore and concentrate obtained from Hutti, Gold Mines Limited (HGML), India are discussed in this work. The biooxidation of the concentrate at high pulp density (10%) with wild strain of Thiobacillus ferrooxidans isolated from HGML mines is characterized by significant lag phase (20 days) and incomplete oxidation (35%) even after prolonged operation (60 days). Two strategies, biooxidation with concentrate adapted cells and a step leaching strategy, in which the pulp density is progressively increased from 2% to 10% were considered and the latter resulted in efficient biooxidation of concentrate. Conversion of such a process from batch to continuous operation is shown to result in complete biooxidation of the concentrate and gold extraction efficiency in excess of 90%. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
As computational Grids are increasingly used for executing long running multi-phase parallel applications, it is important to develop efficient rescheduling frameworks that adapt application execution in response to resource and application dynamics. In this paper, three strategies or algorithms have been developed for deciding when and where to reschedule parallel applications that execute on multi-cluster Grids. The algorithms derive rescheduling plans that consist of potential points in application execution for rescheduling and schedules of resources for application execution between two consecutive rescheduling points. Using large number of simulations, it is shown that the rescheduling plans developed by the algorithms can lead to large decrease in application execution times when compared to executions without rescheduling on dynamic Grid resources. The rescheduling plans generated by the algorithms are also shown to be competitive when compared to the near-optimal plans generated by brute-force methods. Of the algorithms, genetic algorithm yielded the most efficient rescheduling plans with 9-12% smaller average execution times than the other algorithms.
Resumo:
The Brittle-to-ductile-transition-temperature (BDTT) of free-standing Pt-aluminide (PtAl) coating specimens, i.e. stand-alone coating specimens without any substrate, was determined by micro-tensile testing technique. The effect of Pt content, expressed in terms of the thickness of initial electro-deposited Pt layer, on the BDTT of the coating has been evaluated and an empirical correlation drawn. Increase in the electrodeposited Pt layer thickness from nil to 10 mu m was found to cause an increase in the BDTT of the coating by about 100 degrees C.