940 resultados para Exchange algorithm
Resumo:
We report the results of Monte Carlo simulations with the aim to clarify the microscopic origin of exchange bias in the magnetization hysteresis loops of a model of individual core/shell nanoparticles. Increase of the exchange coupling across the core/shell interface leads to an enhancement of exchange bias and to an increasing asymmetry between the two branches of the loops which is due to different reversal mechanisms. A detailed study of the magnetic order of the interfacial spins shows compelling evidence that the existence of a net magnetization due to uncompensated spins at the shell interface is responsible for both phenomena and allows to quantify the loop shifts directly in terms of microscopic parameters with striking agreement with the macroscopic observed values.
Resumo:
The role of the bridging ligand on the effective Heisenberg coupling parameters is analyzed in detail. This analysis strongly suggests that the ligand-to-metal charge transfer excitations are responsible for a large part of the final value of the magnetic coupling constant. This permits us to suggest a variant of the difference dedicated configuration interaction (DDCI) method, presently one of the most accurate and reliable for the evaluation of magnetic effective interactions. This method treats the bridging ligand orbitals mediating the interaction at the same level than the magnetic orbitals and preserves the high quality of the DDCI results while being much less computationally demanding. The numerical accuracy of the new approach is illustrated on various systems with one or two magnetic electrons per magnetic center. The fact that accurate results can be obtained using a rather reduced configuration interaction space opens the possibility to study more complex systems with many magnetic centers and/or many electrons per center.
Resumo:
Ion-exchange chromatography has emerged as a practical and rapid method of separation and analysis. A review of literature on chelating resins reveals that eventhough investigations on highly selective resins are intensively pursued from early 1940s, such resins are still insufficiently used in analytical chemistry and process technology. This is mainly due to the complexity of their synthesis and high cost. In this context, it is worthwhile to develop novel chelating resins which are specific or at least selective towards a group of metal ions. Synthesis, characterization and analytical applications of two such resins are presented in this thesis.
Resumo:
Investigations on the water relations and gas exchange of/tcacia aun'culiji_2rmis were carried out in natural and controlled environments. The experiments were performed in both seedlings and five year old trees. Different sets of experiments were conducted in Acacia plantations, at Kothachira, Palakkad District and in .seedlings, at KFRI campus nursery mainly during the summer months. Investigations were also extended to seedlings of A.mangium, Aaulacocarpa and /Lholocericea, which are also phyllodinous species with the intention of comparing their physiology with Acacia auriculifomus. Potted seedlings of four species of Acacia viz., A. auriculi/E)/7r:i.r, /I. aulacocarpa, A. holocericea and A. mangium were used for the study. Measurements of relative water content (RWC), water potential, photosynthetic rate, transpiration, stomatal conductance, water use efficiency etc. of phyllodes were measured diumally in plants subjected to three stress conditions namely, drought, salinity and flooding
Resumo:
Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.
Resumo:
Decimal multiplication is an integral part of financial, commercial, and internet-based computations. A novel design for single digit decimal multiplication that reduces the critical path delay and area for an iterative multiplier is proposed in this research. The partial products are generated using single digit multipliers, and are accumulated based on a novel RPS algorithm. This design uses n single digit multipliers for an n × n multiplication. The latency for the multiplication of two n-digit Binary Coded Decimal (BCD) operands is (n + 1) cycles and a new multiplication can begin every n cycle. The accumulation of final partial products and the first iteration of partial product generation for next set of inputs are done simultaneously. This iterative decimal multiplier offers low latency and high throughput, and can be extended for decimal floating-point multiplication.
Resumo:
A novel and fast technique for cryptographic applications is designed and developed using the symmetric key algorithm “MAJE4” and the popular asymmetric key algorithm “RSA”. The MAJE4 algorithm is used for encryption / decryption of files since it is much faster and occupies less memory than RSA. The RSA algorithm is used to solve the problem of key exchange as well as to accomplish scalability and message authentication. The focus is to develop a new hybrid system called MARS4 by combining the two cryptographic methods with an aim to get the advantages of both. The performance evaluation of MARS4 is done in comparison with MAJE4 and RSA.
Resumo:
Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining
Resumo:
This work proposes a parallel genetic algorithm for compressing scanned document images. A fitness function is designed with Hausdorff distance which determines the terminating condition. The algorithm helps to locate the text lines. A greater compression ratio has achieved with lesser distortion
Resumo:
Professor Irma Glicman Adelman, an Irish Economist working in California University at Berkely, in her research work on ‘Development Over Two Centuries’, which is published in the Journal of Evolutionary Economics, 1995, has identified that India, along with China, would be one of the largest economies in this 21st Century. She has stated that the period 1700 - 1820 is the period of Netherlands, the period 1820 - 1890 is the period of England the period 1890 - 2000 is the period of America and this 21st Century is the century of China and India. World Bank has also identified India as one of the leading players of this century after China. India will be third largest economy after USA and China. India will challenge the Global Economic Order in the next 15 years. India will overtake Italian economy in 2015, England economy in 2020, Japan economy in 2025 and USA economy in 2050 (China will overtake Japan economy in 2016 and USA economy in 2027). India has the following advantages compared with other economies. India is 4th largest GDP in the world in terms of Purchasing Power. India is third fastest growing economy in the world after China and Vietnam. Service sector contributes around 57% of GDP. The share of agriculture is around 17% and Manufacture is 16% in 2005 - 2006. This is a character of a developed country. Expected GDP growth rate is 10% shortly (It has come down from 9.2% in 2006 - 2007 to 6.2% during 2008 - 2009 due to recession. It is only a temporary phenomenon). India has $284 billion as Foreign Exchange Reserve as on today. India had just $1 billion as Foreign Exchange Reserve when it opened its economy in the year 1991. In this research paper an attempt has been made to study the two booming economies of the globe with respect to their foreign exchange reserves. This study mainly based on secondary data published by respective governments and various studies done on this area
Resumo:
The magnetic properties of amorphous Fe–Ni–B based metallic glass nanostructures were investigated. The nanostructures underwent a spin-glass transition at temperatures below 100 K and revealed an irreversible temperature following the linear de Almeida–Thouless dependence. When the nanostructures were cooled below 25 K in a magnetic field, they exhibited an exchange bias effect with enhanced coercivity. The observed onset of exchange bias is associated with the coexistence of the spin-glass phase along with the appearance of another spin-glass phase formed by oxidation of the structurally disordered surface layer, displaying a distinct training effect and cooling field dependence. The latter showed a maximum in exchange bias field and coercivity, which is probably due to competing multiple equivalent spin configurations at the boundary between the two spin-glass phases