8,434 research outputs found

    Computer Modeling of Personal Autonomy and Legal Equilibrium

    Full text link
    Empirical studies of personal autonomy as state and status of individual freedom, security, and capacity to control own life, particularly by independent legal reasoning, are need dependable models and methods of precise computation. Three simple models of personal autonomy are proposed. The linear model of personal autonomy displays a relation between freedom as an amount of agent's action and responsibility as an amount of legal reaction and shows legal equilibrium, the balance of rights and duties needed for sustainable development of any community. The model algorithm of judge personal autonomy shows that judicial decision making can be partly automated, like other human jobs. Model machine learning of autonomous lawyer robot under operating system constitution illustrates the idea of robot rights. Robots, i.e. material and virtual mechanisms serving the people, deserve some legal guarantees of their rights such as robot rights to exist, proper function and be protected by the law. Robots, actually, are protected as any human property by the wide scope of laws, starting with Article 17 of Universal Declaration of Human Rights, but the current level of human trust in autonomous devices and their role in contemporary society needs stronger legislation to guarantee the robot rights.Comment: 8 pages, 6 figures, presented at Computer Science On-line Conference 201

    Investigation of refractory dielectrics for integrated circuits

    Get PDF
    Pyrolytic silicon nitride dielectric for integrated circuit

    Computing Nearly Singular Solutions Using Pseudo-Spectral Methods

    Get PDF
    In this paper, we investigate the performance of pseudo-spectral methods in computing nearly singular solutions of fluid dynamics equations. We consider two different ways of removing the aliasing errors in a pseudo-spectral method. The first one is the traditional 2/3 dealiasing rule. The second one is a high (36th) order Fourier smoothing which keeps a significant portion of the Fourier modes beyond the 2/3 cut-off point in the Fourier spectrum for the 2/3 dealiasing method. Both the 1D Burgers equation and the 3D incompressible Euler equations are considered. We demonstrate that the pseudo-spectral method with the high order Fourier smoothing gives a much better performance than the pseudo-spectral method with the 2/3 dealiasing rule. Moreover, we show that the high order Fourier smoothing method captures about 121512 \sim 15% more effective Fourier modes in each dimension than the 2/3 dealiasing method. For the 3D Euler equations, the gain in the effective Fourier codes for the high order Fourier smoothing method can be as large as 20% over the 2/3 dealiasing method. Another interesting observation is that the error produced by the high order Fourier smoothing method is highly localized near the region where the solution is most singular, while the 2/3 dealiasing method tends to produce oscillations in the entire domain. The high order Fourier smoothing method is also found be very stable dynamically. No high frequency instability has been observed.Comment: 26 pages, 23 figure
    corecore