Results 11 to 20 of about 258,017 (310)

Monte Carlo optimization of redundancy of nanotechnology computer memories in the conditions of background radiation [PDF]

open access: yesNuclear Technology and Radiation Protection, 2018
The aim of this paper is applying statistical laws and enlargement law to determine a redundancy level of nanotechnology computers with a pre-given statistical confidence.
Dolićanin Edin, Fetahović Irfan S.
doaj   +1 more source

A Vexing Question in Motor Control: The Degrees of Freedom Problem

open access: yesFrontiers in Bioengineering and Biotechnology, 2022
The human “marionette” is extremely complex and multi-articulated: anatomical redundancy (in terms of Degrees of Freedom: DoFs), kinematic redundancy (movements can have different trajectories, velocities, and accelerations and yet achieve the same goal,
Pietro Morasso
doaj   +1 more source

Redundant Sudoku rules [PDF]

open access: yesTheory and Practice of Logic Programming, 2012
AbstractThe rules of Sudoku are often specified using 27 all_different constraints, referred to as the big constraints. Using graphical proofs and exploratory logic programming, the following main and new result is obtained: Many subsets of six of these big constraints are redundant (i.e., they are entailed by the remaining 21 constraints), and six is ...
Demoen, Bart, Garcia de la Banda, Maria
openaire   +3 more sources

Macrophyte functional composition is stable across a strong environmental gradient of a Neotropical floodplain

open access: yesActa Botânica Brasílica, 2021
Ecological communities are compared by the similarity or distinctness of their species. Taking into account community composition at a determined site, one could expect a similar reasoning to explain differences in both taxonomic and functional ...
Suelen C. A. da Silva Pereto   +1 more
doaj   +1 more source

Removing propagation redundant constraints in redundant modeling [PDF]

open access: yesACM Transactions on Computational Logic, 2007
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with various degrees of constraint propagation for pruning the search space. One common technique to improve the execution efficiency is to add redundant constraints, which are constraints logically implied by others in the problem model ...
Choi, CW, Lee, JHM, Stuckey, PJ
openaire   +3 more sources

On statistical power grid observability under communication constraints (invited paper)

open access: yesIET Smart Grid, 2018
Phasor Measurement Units (PMUs) have enabled real-time power grid monitoring and control applications realizing an integrated power grid and communication system. The communication network formed by PMUs has strict latency requirements.
Minglei You   +5 more
doaj   +1 more source

A formulation of control allocation problem by several quadratic programming sub-problems and application for the motion control

open access: yesNihon Kikai Gakkai ronbunshu, 2019
This paper proposes a control allocation method for the motion control in which the number of manipulated variables is one more than control degree of freedom.
Naoki IMAMURA   +2 more
doaj   +1 more source

A Multi-Hop Data Dissemination Algorithm for Vehicular Communication

open access: yesComputers, 2020
In vehicular networks, efficient multi-hop message dissemination can be used for various purposes, such a informing the driver about the recent emergency event or propagating the local dynamic map of a predefined region.
Odilbek Urmonov, HyungWon Kim
doaj   +1 more source

Differential Effector Engagement by Oncogenic KRAS

open access: yesCell Reports, 2018
Summary: KRAS can bind numerous effector proteins, which activate different downstream signaling events. The best known are RAF, phosphatidylinositide (PI)-3′ kinase, and RalGDS families, but many additional direct and indirect effectors have been ...
Tina L. Yuan   +29 more
doaj   +1 more source

Minimax Rényi redundancy [PDF]

open access: yes2017 IEEE International Symposium on Information Theory (ISIT), 2017
The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax R\'enyi divergence, which is shown to be equal to the maximal $\alpha$-mutual information via a generalized redundancy-capacity theorem.
Semih Yagli, Yucel Altug, Sergio Verdu
openaire   +2 more sources

Home - About - Disclaimer - Privacy