Results 31 to 40 of about 1,321,024 (261)

Production Quality of Shaped Surfaces During Milling [PDF]

open access: yesJournal of Systemics, Cybernetics and Informatics, 2022
In the context of the development of continuous improvement, increasing the level of quality, safety and protection of the ecological environment, it is necessary to deal with the sensitive phases of the production process and to evaluate the efficiency ...
Marek Sadilek   +6 more
doaj  

A week-end off: the first extensive number-theoretical computation on the ENIAC [PDF]

open access: yes, 2008
The first extensive number-theoretical computation run on the ENIAC, is reconstructed. The problem, computing the exponent of 2 modulo a prime, was set up on the ENIAC during a week-end in July 1946 by the number-theorist D.H.
A.W. Burks   +9 more
core   +3 more sources

A Swiss Pocket Knife for Computability [PDF]

open access: yes, 2013
This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and constructions, but with new criteria for success that are natural from a ...
Jones, Neil D.
core   +3 more sources

Effect of Seismic Frequency Spectra on Surrounding Rock Damage Evolution of Large Underground Caverns

open access: yesAdvances in Materials Science and Engineering, 2018
To explore the distribution and evolution of the surrounding rock of underground caverns of hydropower stations, the dynamic compression tests for granite sample were carried out and the dynamic constitutive relation suitable to computer programming was ...
Yumin Zhang   +3 more
doaj   +1 more source

Challenging the Myth of Presentation in Digital Editions

open access: yesJournal of the Text Encoding Initiative, 2016
Are the data of an edition means to a particular and privileged presentation, or is the presentation a side effect? Because of the changing nature of computer systems, with constant progression in hardware and software, the encoded texts are the most ...
Magdalena Turska   +2 more
doaj   +1 more source

How to hunt wild constants [PDF]

open access: yesarXiv, 2021
There are now several comprehensive web applications, stand-alone computer programs and computer algebra functions that, given a floating point number such as 6.518670730718491, can return concise nonfloat constants such as 3 arctan 2 + ln 9 + 1, that closely approximate the float.
arxiv  

Phenotypic continuum of NFU1‐related disorders

open access: yesAnnals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 2025-2035, December 2022., 2022
Abstract Bi‐allelic variants in Iron–Sulfur Cluster Scaffold (NFU1) have previously been associated with multiple mitochondrial dysfunctions syndrome 1 (MMDS1) characterized by early‐onset rapidly fatal leukoencephalopathy. We report 19 affected individuals from 10 independent families with ultra‐rare bi‐allelic NFU1 missense variants associated with a
Rauan Kaiyrzhanov   +45 more
wiley   +1 more source

Nonstandard optimal control problem: case study in an economical application of royalty problem

open access: yesIJAIN (International Journal of Advances in Intelligent Informatics), 2019
This paper's focal point is on the nonstandard Optimal Control (OC) problem. In this matter, the value of the final state variable, y(T) is said to be unknown.
Wan Noor Afifah Wan Ahmad   +6 more
doaj   +1 more source

Graph based Data Dependence Identifier for Parallelization of Programs [PDF]

open access: yesarXiv, 2021
Automatic parallelization improves the performance of serial program by automatically converting to parallel program. Automatic parallelization typically works in three phases: check for data dependencies in the input program, perform transformations, and generate the parallel code for target machine.
arxiv  

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough [PDF]

open access: yesTheory and Practice of Logic Programming 14 (2014) 141-164, 2012
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks related to programs with cardinality or weight constraints - like checking the consistency of a program - are intractable.
arxiv   +1 more source

Home - About - Disclaimer - Privacy