Data-and State-Dependent Power Characterisation and Simulation of Black-Box RTL IP Components at System Level

2014 ◽  
Author(s):  
Daniel Lorenz ◽  
Kim Gruettner ◽  
Wolfgang Nebel
Keyword(s):  
Black Box ◽  
System Level ◽  
State Dependent

Some Pitfalls of Black Box Queue Inference: The Case of State-Dependent Server Queues

1993 ◽  
Vol 7 (2) ◽  
pp. 149-157 ◽  
Author(s):  
Sheldon M. Ross ◽  
J. George Shanthikumar ◽  
Xiang Zhang
Keyword(s):  
Queueing Systems ◽  
Work Load ◽  
Black Box ◽  
Arrival Process ◽  
Service Rate ◽  
Actual System ◽  
Sample Distribution ◽  
State Dependent ◽  
Service Times ◽  
Number Of Customers

In several queueing systems the service rate of a server is affected by the work load present in the system. For example, a teller at a bank or a checker at a check-out counter in a supermarket may change the service rate depending on the number of customers present in the system. But the service rate as a function of the number in the system can rarely be measured. Consequently, in a typical model of such a system it is assumed that the service rate is constant. Hence, such systems with a single stage are often modeled by GI/GI/c queueing systems with mutually independent arrival and service processes. Then the observed service times are used to find a sample distribution that will represent the distribution of the assumed i.i.d. service times. The purpose of this paper is to explore the effect of this black box queue inference (BBQI) in its ability to predict the performance of the actual system. In this regard, we have shown that when the arrival process is Poisson, if the servers react favorably [unfavorably] to higher work loads (i.e., if the server increases [decreases] the service rate as the number of customers in the system increases) then the BBQI predictions will be pessimistic [optimistic]. This result can be used to identify the server's attitude toward higher work load.

Black-Box Modeling of Three-Phase Voltage Source Inverters for System-Level Analysis

2012 ◽  
Vol 59 (9) ◽  
pp. 3648-3662 ◽  
Author(s):  
V. Valdivia ◽  
A. Lazaro ◽  
A. Barrado ◽  
P. Zumel ◽  
C. Fernandez ◽  
...  
Keyword(s):  
Black Box ◽  
System Level ◽  
Voltage Source ◽  
Phase Voltage ◽  
Voltage Source Inverters ◽  
Three Phase ◽  
Level Analysis

Learning-based power modeling of system-level black-box IPs

2015 ◽  
Author(s):  
Dongwook Lee ◽  
Taemin Kim ◽  
Kyungtae Han ◽  
Yatin Hoskote ◽  
Lizy K. John ◽  
...  
Keyword(s):  
Black Box ◽  
System Level ◽  
Power Modeling

scholarly journals Re-Keying Scheme Revisited: Security Model and Instantiations

2019 ◽  
Vol 9 (5) ◽  
pp. 1002 ◽  
Author(s):  
Yuichi Komano ◽  
Shoichi Hirose
Keyword(s):  
Block Cipher ◽  
Black Box ◽  
System Level ◽  
Side Channel ◽  
Security Model ◽  
Symmetric Encryption ◽  
Secret Key ◽  
Session Key ◽  
Tweakable Block Cipher ◽  
Definition Of

The re-keying scheme is a variant of the symmetric encryption scheme where a sender (respectively, receiver) encrypts (respectively, decrypts) plaintext with a temporal session key derived from a master secret key and publicly-shared randomness. It is one of the system-level countermeasures against the side channel attacks (SCAs), which make attackers unable to collect enough power consumption traces for their analyses by updating the randomness (i.e., session key) frequently. In 2015, Dobraunig et al. proposed two kinds of re-keying schemes. The first one is a scheme without the beyond birthday security, which fixes the security vulnerability of the previous re-keying scheme of Medwed et al. Their second scheme is an abstract scheme with the beyond birthday security, which, as a black-box, consists of two functions; a re-keying function to generate a session key and a tweakable block cipher to encrypt plaintext. They assumed that the tweakable block cipher was ideal (namely, secure against the related key, chosen plaintext, and chosen ciphertext attacks) and proved the security of their scheme as a secure tweakable block cipher. In this paper, we revisit the re-keying scheme. The previous works did not discuss security in considering the SCA well. They just considered that the re-keying scheme was SCA resistant when the temporal session key was always refreshed with randomness. In this paper, we point out that such a discussion is insufficient by showing a concrete attack. We then introduce the definition of an SCA-resistant re-keying scheme, which captures the security against such an attack. We also give concrete schemes and discuss their security and applications.

System-Level Behavioral Black-Box Modeling of DC-DC Converters for the More-Electric-Aircraft Based on Time Domain Measurements

2011 ◽  
Author(s):  
Virgilio Valdivia ◽  
Andres Barrado ◽  
Antonio Lazaro ◽  
Pablo Zumel ◽  
Cristina Fernandez
Keyword(s):  
Time Domain ◽  
Black Box ◽  
System Level ◽  
Electric Aircraft ◽  
More Electric Aircraft

System-Level Behavioral Black-Box Modeling of Three-Phase DCAC Converters for the More-Electric-Aircraft

2011 ◽  
Author(s):  
Virgilio Valdivia ◽  
Antonio Lazaro ◽  
Andres Barrado ◽  
Pablo Zumel ◽  
Cristina Fernandez ◽  
...  
Keyword(s):  
Black Box ◽  
System Level ◽  
Three Phase ◽  
Electric Aircraft ◽  
More Electric Aircraft

scholarly journals Exploring Parameter Space in Reinforcement Learning

2010 ◽  
Vol 1 (1) ◽  
Author(s):  
Thomas Rückstieß ◽  
Frank Sehnke ◽  
Tom Schaul ◽  
Daan Wierstra ◽  
Yi Sun ◽  
...  
Keyword(s):  
Reinforcement Learning ◽  
Parameter Space ◽  
Robot Control ◽  
State Of The Art ◽  
Black Box ◽  
General Function ◽  
Natural Evolution ◽  
State Dependent ◽  
Learning Parameter ◽  
Function Approximator

AbstractThis paper discusses parameter-based exploration methods for reinforcement learning. Parameter-based methods perturb parameters of a general function approximator directly, rather than adding noise to the resulting actions. Parameter-based exploration unifies reinforcement learning and black-box optimization, and has several advantages over action perturbation. We review two recent parameter-exploring algorithms: Natural Evolution Strategies and Policy Gradients with Parameter-Based Exploration. Both outperform state-of-the-art algorithms in several complex high-dimensional tasks commonly found in robot control. Furthermore, we describe how a novel exploration method, State-Dependent Exploration, can modify existing algorithms to mimic exploration in parameter space.

scholarly journals APPROACHING TRUSTED TESTING OF NETWORKS WITH THE USE OF PROBES

Telecom IT ◽  
2019 ◽  
Vol 7 (1) ◽  
pp. 52-59
Author(s):  
R. Pirmagomedov
Keyword(s):  
Black Box ◽  
Telecommunication Networks ◽  
System Level ◽  
Current Work ◽  
Testing System ◽  
Study Group ◽  
International Telecommunication Union ◽  
International Telecommunication ◽  
Ongoing Work

This paper presents a system-level architecture and signaling procedures of the system enabling trusted testing of telecommunication networks utilizing probes. The described system relies on the ongoing work of Study Group 11 at the International Telecommunication Union. The paper also includes testing profiles description, results storing, and users’ access to the results. In a nutshell the considered approach allows for the testing system to operate as a “black box” recording all required network events on the user side. The results of such testing can be further used for resolving disputes between stakeholders. The system discussed in this paper is rely on current work items of Q9/11 of International Telecommunication Union (Standardization sector).

Sign in / Sign up

Export Citation Format

Share Document