Search
Author
- Osman, Ahmed I. (5)
- Daqing, Ma (3)
- Jorgensen, Ed (3)
- Li, Yan (3)
- next >
Subject
- kinh tế (26)
- Economics (12)
- programming (10)
- XRD (10)
- next >
Date issued
- 2020 - 2025 (2128)
- 2010 - 2019 (129)
- 2000 - 2009 (9)
- 1999 - 1999 (1)
Has File(s)
Search Results
High-entropy alloys have made significant progress in high mechanical properties, wear resistance, and corrosion resistance properties. Excellent tribological properties, especially high-temperature lubrication, have become another sought performance. In this work, VAlTiCrW high-entropy alloy film with body-centered cubic (BCC) structure was prepared on superalloy substrate by magnetron sputtering. It is found that the VAlTiCrW film shows very low friction coefficient of 0.15 and a low wear rate of 10−5 orders of magnitude at 800 °C. After 800 °C oxidation, the film can still obtain a friction coefficient of no more than 0.2 at 700 °C. XRD and TEM revealed the formation of ternary oxide AlV3O9 with preferred orientation of (002) crystal plane with large spacing of 0.71 nm on the wea... |
Polyalkylene glycol (PAG) aqueous solutions have recently been demonstrated to exhibit an ultralow friction coefficient (COF, μ < 0.01). However, the prolonged running-in period and low bearing capacity have limited its widespread application. In this study, we determined that the running-in period can be decreased by more than 75% when the pH value of the lubricant is controlled at 3 by introducing various acid solutions. Additionally, less time was required to realize stable superlubricity with inorganic acid at lower pH values. This was mainly attributed to the acceleration effect of hydrogen ions around the contact region. In case of PAG aqueous solution with organic acid, the wear loss between sliding solid surfaces was reduced, and thus the bearing pressure during the superlub... |
2010 First International Conference on Electrical and Electronics Engineering was held in Wuhan, China December 4-5. Advanced Electrical and Electronics Engineering book contains 72 revised and extended research articles written by prominent researchers participating in the conference. Topics covered include, Power Engineering, Telecommunication, Control engineering, Signal processing, Integrated circuit, Electronic amplifier, Nano-technologies, Circuits and networks, Microelectronics, Analog circuits, Digital circuits, Nonlinear circuits, Mixed-mode circuits, Circuits design, Sensors, CAD tools, DNA computing, Superconductivity circuits. Electrical and Electronics Engineering will offer the state of art of tremendous advances in Electrical and Electronics Engineering and also serv... |
omplexity measures aim to characterize the underlying complexity of supervised data. These measures tackle factors hindering the performance of Machine Learning (ML) classifiers like overlap, density, linearity, etc. The state-of-the-art has mainly focused on the dataset perspective of complexity, i.e., offering an estimation of the complexity of the whole dataset. Recently, the instance perspective has also been addressed. In this paper, the hostility measure, a complexity measure offering a multi-level (instance, class, and dataset) perspective of data complexity is proposed. |
Extending the main result of Lorscheid and Weist (2015), in the first part of this paper we show that every quiver Grassmannian of an indecomposable representation of a quiver of type D~n has a decomposition into affine spaces. In the case of real root representations of small defect, the non-empty cells are in one-to-one correspondence to certain, so called non-contradictory, subsets of the vertex set of a fixed tree-shaped coefficient quiver. In the second part, we use this characterization to determine the generating functions of the Euler characteristics of the quiver Grassmannians (resp. F-polynomials). |
Efficient computability is an important property of solution concepts. We consider the computational complexity of finding and verifying various solution concepts in trading networks—multi-sided matching markets with bilateral contracts and without transferable utility—under the assumption of full substitutability of agents’ preferences. It is known that outcomes that satisfy trail stability always exist and can be found in linear time. However, we show that the existence of stable outcomes—immune to deviations by arbitrary sets of agents—is an NP
-hard problem in trading networks. We also show that even verifying whether a given outcome is stable is NP
-hard in trading networks. |
The integrated meta-model for organizational resource audit is a consistent and comprehensive instrument for auditing intangible resources and their relations and associations from the network perspective. This book undertakes a critically important problem of management sciences, poorly recognized in literature although determining the current and future competitiveness of enterprises, sectors and economies. The author notes the need to introduce a theoretical input, which is manifested by the meta-model. An expression of this treatment is the inclusion of the network as a structure of activities, further knowledge as an activity, and intangible assets as intellectual capital characterized by a structure of connections. The case study presented is an illustration of the use of netw... |
Computational intelligence (CI) is the philosophy, architecture, execution, and creation of cognitive paradigms that are biologically and linguistically driven. Neural networks, fuzzy systems, evolutionary computation, learning theory, and probabilistic methods are historically the five main pillars of CI. In this book, CI and the applicable nature of CI are highlighted by explaining different practical applications. This book starts with some applications of CI, and then proceeds with the usage of data mining in the field of CI. The book ends with some real-life and practical applications of deep learning in various fields of studies from video detection to patient disease. |
Unit square visibility graphs (USV) are described by axis-parallel visibility between unit squares placed in the plane. If the squares are required to be placed on integer grid coordinates, then USV become unit square grid visibility graphs (USGV), an alternative characterisation of the well-known rectilinear graphs. We extend known combinatorial results for USGV and we show that, in the weak case (i.e., visibilities do not necessarily translate into edges of the represented combinatorial graph), the area minimisation variant of their recognition problem is NP
-hard. |
This easy-to-read book introduces the basics of solving partial differential equations by means of finite difference methods. Unlike many of the traditional academic works on the topic, this book was written for practitioners. Accordingly, it especially addresses: the construction of finite difference schemes, formulation and implementation of algorithms, verification of implementations, analyses of physical behavior as implied by the numerical solutions, and how to apply the methods and software to solve problems in the fields of physics and biology. |
