1,359,573 research outputs found

    Sipalne in transmisijske tehnike za časovno ločljive študije z uporabo koherentnih svetlobnih virov

    No full text
    The ability to probe and manipulate matter on femtosecond timescales has transformed our understanding of ultrafast phenomena in magnetic, molecular, and condensed matter systems. These rapid processes governed by interactions between charge, spin, and lattice degrees of freedom hold the key to the development of next-generation technologies in information storage, spintronics, and quantum materials. However, unlocking such insights requires advanced light sources capable of delivering coherent, element-specific, and polarization-controlled pulses in the extreme ultraviolet (XUV) and soft X-ray regimes. This thesis investigates two complementary platforms that have emerged as frontiers in ultrafast science: Free-Electron Lasers (FELs) and High Harmonic Generation (HHG). FELs offer tunable, high-brilliance radiation with programmable polarization, enabling precision experiments at resonance edges of magnetic elements. HHG, on the contrary, provides laboratory-scale access to femtosecond and attosecond pulses and coherent XUV light, ideal for tabletop pump-probe studies. By combining these two platforms, this work addresses both the technical challenges and scientific opportunities in ultrafast magnetization dynamics, light-induced electronic transitions, and angular momentum exchange in light–matter interactions. The thesis focuses on source optimization strategies, and proof-of-principle experiments ranging from polarization-engineered FEL emission for magnetic dichroism to HHG-based femtosecond Magneto-Optic Kerr Effect (MOKE) and molecular spectroscopy. Through this multiscale approach, it highlights the role of tailored light sources not just as probes but as active tools for manipulating material properties on fundamental timescales. The results lay the groundwork for future studies of complex systems in non-equilibrium regimes, where the interplay of coherence, topology, and ultrafast dynamics defines new states of matter

    Implementasi dan Perbandingan Algoritma Berry-Ravindran dan Algoritma Rabin-Karp pada Kamus Istilah Manajemen Keuangan

    No full text
    Financial management is needed in carrying out life activities both individually and organization, in the world of financial management there some terms that may not be known by the public, therefore required dictionary of financial management terms. But the dictionary of financial management circulating in the community is still in the form of books with heavy weight. Therefore the author makes a dictionary of financial management terms based desktop. This system is implemented using two algorithms, Berry-Ravindran and Rabin-Karp algorithms to compare time complexity (Ө) and running time. In its implementation, the search using the Berry-Ravindran algorithm’s has an average time of 610.23 millisecon, and the Rabin-Karp algorithm’s has an average time of 17.431 milliseconds. The Rabin-Karp algorithm’s is faster than the Berry Ravindran algorithm’s but Rabin-Karp algorithm’s removes punctuation and spaces that will result in words found in the database, Berry Ravindran algorithm’s reads punctuation and spaces. In the preprocessing phase, the Berry-Ravindran algorithm’s have a complexity of Ө (n) and in search phase of the Berry-Ravindran algorithm’s and Rabin-Karp algorithm’s has a time complexity of Ө (n).Manajemen keuangan sangat dibutuhkan dalam menjalankan aktivitas hidup baik secara individu maupun secara organisasi, Dalam dunia manajemen keuangan terdapat beberapa istilah yang mungkin belum diketahui oleh masyarakat, maka dari itu dibutuhkan kamus istilah manajemen keuangan. Namun kamus manajemen keuangan yang beredar dimasyarakat masih dalam bentuk buku dengan bobot yang berat. Maka dari itu penulis membuat kamus istilah manajemen keuangan berbasis dekstop. Sistem ini diimplementasikan menggunakan dua buah algoritma, yaitu algoritma Berry-Ravindran dan Rabin-Karp untuk membandingkan kompleksitas waktu (Ө) dan running time. Pada implementasinya, pencarian menggunakan algoritma Berry-Ravindran memiliki waktu rata-rata 610,23 milidetik, sedangkan dengan algoritma Rabin-Karp memiliki waktu rata-rata 17,431 milidetik. Algoritma Rabin-Karp lebih cepat dibanding algoritma Berry Ravindran akan tetapi algoritma Rabin-Karp menghapus tanda baca dan spasi yang akan berakibat pada kata yang ditemukan dalam database, sedangkan algoritma Berry Ravindran membaca tanda baca dan spasi. Pada fase preprocessing, algoritma Berry-Ravindran memiliki kompleksitas sebesar Ө(n) dan pada fase pencarian algoritma Berry-Ravindran dan algoritma Rabin-Karp memiliki kompleksitas waktu sebesar Ө(n).Skripsi Sarjan

    A Combination of Berry Ravindran Algorithm and Two Way Algorithm for Exact String Matching

    No full text
    [[abstract]]精確字?比對問題定義如下:給予一個長?為 的字? ,長?為 的字? 我們的目標是要在T 上找出所有 發生的位置。對於電腦科學而言,字串比對問題是一個重要的議題。 在本篇論文中,我們提出一個新的方法來解決這個問題. Two Way 演算法與Berry Ravindran 演算法在找尋在 上找出所有 發生的位置而言都是很好的演算法, 不過仍然存在著一些問題. 如果我們考慮在Window後面的兩個字元與P最右邊的兩個字元相等的情形,那麼Berry Ravindran 演算法就會沒有效率.如果我們把 分成 跟 兩部份,常常在 部份就發生錯誤,那麼Two Way 演算法也沒有效率.所以我們把兩個演算法結合起來來解決精確字串比對問題. 最後, 我們會討論Two Way 演算法、Berry Ravindran演算法跟我們的方法 關鍵字:精確字串比對問題、Two Way 演算法、Berry Ravindran 演算法[[abstract]]The exact string matching problem is defined as follows: We are given a text and a pattern , . Our purpose is to find all occurrences of in . It is a classical and important problem in computer science. In this thesis, we propose a new approach to solve this problem. Two Way algorithm and the Berry Ravindran algorithm are good algorithms which find all occurrences of in , but some problems still exist. If we consider the situation that the last two text characters of the window with size m are the same with that of , Berry Ravindran algorithm is not efficient in this situation. If a mismatch often occurs within v part of , Two Way algorithm is not efficient in this situation. So we combine Two Way algorithm and Berry Ravindran algorithm to slove this problem Finally; we discuss the results of Two Way algorithm, Berry Ravindran algorithm and our approach. Keywords:Exact String Matching、Two Way algorithm、Berry Ravindran algorithm[[note]]碩

    Influence of a psychogenic and a neurogenic stressor on several indices of immune functioning in different strains of mice

    No full text
    Examined whether cell proliferation in response to mitogens, natural killer cell (NK) activity, and macrophage functioning of mice may be influenced by either a neurogenic stressor (footshock) or psychogenic stressor (exposing the mouse to a predator, namely a rat)

    Multi-Criteria Decision Making: An Overview and a Comparative Discussion

    No full text
    An attempt to provide an overview of the different techniques in the field of multi-criteria decision-making is made in this chapter. First, some basic terminologies are reviewed. A classification of the various methods is outlined. Some of the basic concepts common to many methods are presented. The methods covered in the overview include the Multi Attribute Utility Theory, the Analytic Hierarchy Process, the ELECTRE methods, PROMETHEE methods, Fuzzy Set Theory, Multi-objective Linear Programming, Goal Programming, the Aspiration-level Interactive Method, Compromise Programming, and Data Envelopment Analysis. The different methods are compared in terms of several vital parameters. Finally, a link to the context of Big Data is provided in line with the theme of this book
    corecore