Characterization of Lower-bound and Upper-bound of Required Settlement Fund Under Real-Time Gross Settlement

2015 ◽  
Author(s):  
Hitoshi Hayakawa
Keyword(s):  
Lower Bound ◽  
Real Time ◽  
Upper Bound

NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS

2014 ◽  
Vol 25 (07) ◽  
pp. 823-835 ◽  
Author(s):  
DANIEL GOČ ◽  
ALEXANDROS PALIOUDAKIS ◽  
KAI SALOMAA
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
State Complexity ◽  
Nondeterministic State

The language [Formula: see text] consists of first halfs of strings in L. Many other variants of a proportional removal operation have been considered in the literature and a characterization of removal operations that preserve regularity is known. We consider the nondeterministic state complexity of the operation [Formula: see text] and, more generally, of polynomial removals as defined by Domaratzki (J. Automata, Languages and Combinatorics 7(4), 2002). We give an O(n2) upper bound for the nondeterministic state complexity of polynomial removals and a matching lower bound in cases where the polynomial is a sum of a monomial and a constant, or when the polynomial has rational roots.

scholarly journals Bound Graph Polysemy

10.37236/1521 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
Paul J. Tanenbaum
Keyword(s):  
Lower Bound ◽  
Partial Order ◽  
Upper Bound ◽  
Special Cases ◽  
Vertex Set

Bound polysemy is the property of any pair $(G_1, G_2)$ of graphs on a shared vertex set $V$ for which there exists a partial order on $V$ such that any pair of vertices has an upper bound precisely when the pair is an edge in $G_1$ and a lower bound precisely when it is an edge in $G_2$. We examine several special cases and prove a characterization of the bound polysemic pairs that illuminates a connection with the squared graphs.

scholarly journals Priority based computation: “An Initial study result of paradigm shift on real time computation”

2017 ◽  
Vol 6 (1) ◽  
pp. 29-38
Author(s):  
Sukemi Sukemi ◽  
Riyanto Riyanto
Keyword(s):  
Lower Bound ◽  
Real Time ◽  
Upper Bound ◽  
Interval Arithmetic ◽  
Paradigm Shift ◽  
Initial Study ◽  
Time Variable ◽  
Statistical Control ◽  
Time System ◽  
Real Time System

This research is purposed to increase computer function into a time driven to support real time system. This purposed would the processor can work according to determined time variable and can work optimally in a certained deadline. The first approachment to design some of processor that has a different bit space 64, 32, 16 and 8 bits. Each processor will be separated by selector/arbiter priority of a task. In addition, the design of the above processors are designed as a counter with varying levels of accuracy (variable precision computing). The selection is also done by using statistical control in the task are observed by the appearance of controller mounted on the front of the architecture bit space the second approach above. The last approach to ‘add’ certainty in the form of interval arithmetic precision cutting task that can be the upper bound and lower bound of the area (bounds). These four approachment can be structured orthogonally into a processor/several processors by introducing a new classifier that serves as a selector or a task arbiter. The results of the four approaches to prove that the processor is prepared by incorporating a variable bitspace adder selectors can provide optimality of 0.43%.

scholarly journals Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks

1991 ◽  
Vol 20 (377) ◽  
Author(s):  
Ofer Biran ◽  
Shlomo Moran ◽  
Shmuel Zaks
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Worst Case ◽  
Crash Failure ◽  
Round Complexity ◽  
Precise Characterization

<p>A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was given by the authors in 1990.</p><p>In this paper we determine the number of rounds of communication that are required, in the worst case, by a protocol which 1-solves a given 1-solvable task T for <em>n</em> processors. We define the radius R(T) of T, and show that if R(T) is finite, then this number is Theta (log_n R(T)) ; more precisely, we give a lower bound of log_(n-1) R(T), and an upper bound of 2+|log_(n-1)R(T)| . The upper bound implies, for example, that each of the following tasks: renaming, order preserving renaming and binary monotone consensus can be solved in the presence of one fault in 3 rounds of communications. All previous protocols that 1-solved these tasks required Omega(n) rounds. The result is also generalized to tasks whose radii are not bounded, e.g., the approximate consensus and its variants.</p>

scholarly journals Mass Spectrometric Calibration Procedure for Real-Time Detection of Lighter Hydrocarbons

Energies ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 2123
Author(s):  
Makuachukwu F. Mbaegbu ◽  
Puspa L. Adhikari ◽  
Ipsita Gupta ◽  
Mathew Rowe
Keyword(s):  
Real Time ◽  
Mass Spectrometer ◽  
Calibration Procedure ◽  
Mass Spectrometric ◽  
Spectrometric Method ◽  
Mass Selection ◽  
Mass Spectrometric Method ◽  
Mass Spectrometers ◽  
Drilling Rig

Determining gas compositions from live well fluids on a drilling rig is critical for real time formation evaluation. Development and utilization of a reliable mass spectrometric method to accurately characterize these live well fluids are always challenging due to lack of a robust and effectively selective instrument and procedure. The methods currently utilized need better calibration for the characterization of light hydrocarbons (C1–C6) at lower concentrations. The primary goal of this research is to develop and optimize a powerful and reliable analytical method to characterize live well fluid using a quadruple mass spectrometer (MS). The mass spectrometers currently being used in the field have issues with detection, spectra deconvolution, and quantification of analytes at lower concentrations (10–500 ppm), particularly for the lighter (<30 m/z) hydrocarbons. The objectives of the present study are thus to identify the detection issues, develop and optimize a better method, calibrate and QA/QC the MS, and validate the MS method in lab settings. In this study, we used two mass spectrometers to develop a selective and precise method to quantitatively analyze low level lighter analytes (C1–C6 hydrocarbons) with masses <75 m/z at concentrations 10–500 ppm. Our results suggest that proper mass selection like using base peaks with m/z 15, 26, 41, 43, 73, and 87, respectively, for methane, ethane, propane, butane, pentane, and hexane can help detect and accurately quantify hydrocarbons from gas streams. This optimized method in quadrupole mass spectrometer (QMS) will be invaluable for early characterization of the fluid components from a live hydrocarbon well in the field in real time.

scholarly journals Evaluating Latency in Multiprocessing Embedded Systems for the Smart Grid

Energies ◽  
2021 ◽  
Vol 14 (11) ◽  
pp. 3322
Author(s):  
Sara Alonso ◽  
Jesús Lázaro ◽  
Jaime Jiménez ◽  
Unai Bidarte ◽  
Leire Muguira
Keyword(s):  
Operating System ◽  
Smart Grid ◽  
Real Time ◽  
Processing System ◽  
The Other ◽  
Programmable Logic ◽  
Detailed Characterization ◽  
Timing Constraint ◽  
Time Part

Smart grid endpoints need to use two environments within a processing system (PS), one with a Linux-type operating system (OS) using the Arm Cortex-A53 cores for management tasks, and the other with a standalone execution or a real-time OS using the Arm Cortex-R5 cores. The Xen hypervisor and the OpenAMP framework allow this, but they may introduce a delay in the system, and some messages in the smart grid need a latency lower than 3 ms. In this paper, the Linux thread latencies are characterized by the Cyclictest tool. It is shown that when Xen hypervisor is used, this scenario is not suitable for the smart grid as it does not meet the 3 ms timing constraint. Then, standalone execution as the real-time part is evaluated, measuring the delay to handle an interrupt created in programmable logic (PL). The standalone application was run in A53 and R5 cores, with Xen hypervisor and OpenAMP framework. These scenarios all met the 3 ms constraint. The main contribution of the present work is the detailed characterization of each real-time execution, in order to facilitate selecting the most suitable one for each application.

Sign in / Sign up

Export Citation Format

Share Document