Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Reading LevelReading Level
-
Content TypeContent Type
-
YearFrom:-To:
-
More FiltersMore FiltersItem TypeIs Full-Text AvailableSubjectPublisherSourceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
81,559
result(s) for
"Specifications"
Sort by:
Design of 64 V 24 Ah Battery Pack with Li-Ion 1865 Cells for Two-Wheels Electric Vehicle
by
Izzaturrahman, A
,
Athallah, R A N
,
Raharjo, J
in
Batteries
,
Electric vehicles
,
Specifications
2025
Electric vehicles have become increasingly popular in recent years, including in Indonesia. Many manufacturers are starting to produce their own versions of electric vehicles, including two-wheeled electric vehicles. Two-wheeled electric vehicles are known to be popular in Indonesia since it is used for running errands and other daily routines. As the popularity grows, the variety of battery packs are being produced and distributed. Battery packs variety is due to the lack of standardization in Indonesia. Therefore, this study aims to develop a battery with specifications of 64V and 24 Ah capacity. Test results show that the developed battery achieves a voltage of 69.67V when fully charged and a total capacity of 23.36 Ah. Dyno testing also demonstrates that the battery can generate power up to 1.54 HP with a maximum speed of 34 km/h. These specifications make the two-wheeled electric vehicles to be expected to travel further than others that are currently available in the market.
Journal Article
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
by
Toro Icarte, Rodrigo
,
McIlraith, Sheila A.
,
Valenzano, Richard
in
Artificial intelligence
,
Finite state machines
,
Learning
2022
Reinforcement learning (RL) methods usually treat reward functions as black boxes. As such, these methods must extensively interact with the environment in order to discover rewards and optimal policies. In most RL applications, however, users have to program the reward function and, hence, there is the opportunity to make the reward function visible – to show the reward function’s code to the RL agent so it can exploit the function’s internal structure to learn optimal policies in a more sample efficient manner. In this paper, we show how to accomplish this idea in two steps. First, we propose reward machines, a type of finite state machine that supports the specification of reward functions while exposing reward function structure. We then describe different methodologies to exploit this structure to support learning, including automated reward shaping, task decomposition, and counterfactual reasoning with off-policy learning. Experiments on tabular and continuous domains, across different tasks and RL agents, show the benefits of exploiting reward structure with respect to sample efficiency and the quality of resultant policies. Finally, by virtue of being a form of finite state machine, reward machines have the expressive power of a regular language and as such support loops, sequences and conditionals, as well as the expression of temporally extended properties typical of linear temporal logic and non-Markovian reward specification.
Journal Article
Tolerance Specifications Management Integrated into the Product Development Cycle
by
Concheri, Gianmaria
,
Meneghello, Roberto
,
Maltauro, Mattia
in
Design
,
Digital twins
,
Documentation
2024
In tolerancing activities focusing on the allocation of geometrical tolerances, many critical issues originate from the non-optimal assignment of responsibilities among the organization units involved. This paper aims to depict relations between different tolerancing activities and relevant specifications, assigning them to the proper actor and, therefore, expanding the ISO 8015:2011 “responsibility principle”. A classification among tolerancing activities, specifications, and media is proposed; a horizontal hierarchical framework among functional, manufacturing, and verification specifications and a vertical hierarchical framework along the supply chain are discussed. Examples of both hierarchical structures are presented.
Journal Article
Practical TLA+ : planning driven development
Learn how to design complex, correct programs and fix problems before writing a single line of code. This book is a practical, comprehensive resource on TLA+ programming with rich, complex examples. Practical TLA+ shows you how to use TLA+ to specify a complex system and test the design itself for bugs. You'll learn how even a short TLA+ spec can find critical bugs. Start by getting your feet wet with an example of TLA+ used in a bank transfer system, to see how it helps you design, test, and build a better application. Then, get some fundamentals of TLA+ operators, logic, functions, PlusCal, models, and concurrency. Along the way you will discover how to organize your blueprints and how to specify distributed systems and eventual consistency. Finally, you'll put what you learn into practice with some working case study applications, applying TLA+ to a wide variety of practical problems: from algorithm performance and data structures to business code and MapReduce. After reading and using this book, you'll have what you need to get started with TLA+ and how to use it in your mission-critical applications. What You'll LearnRead and write TLA+ specificationsCheck specs for broken invariants, race conditions, and liveness bugsDesign concurrency and distributed systemsLearn how TLA+ can help you with your day-to-day production workWho This Book Is ForThose with programming experience who are new to design and to TLA+.
Non-uniqueness for specifications in /ell^sup 2+epsilon
2018
For every [formula omitted: see PDF] , we construct a regular and continuous specification ( [formula omitted: see PDF] -function), which has a variation sequence that is in [formula omitted: see PDF] and which admits multiple Gibbs measures. Combined with a result of Johansson and Öberg [Square summability of variations of [formula omitted: see PDF] -functions and uniqueness in [formula omitted: see PDF] -measures. Math. Res. Lett. 10(5-6) (2003), 587-601], this determines the optimal modulus of continuity for a specification which admits multiple Gibbs measures.
Journal Article
Formalizing the use case model: A model-based approach
by
Sindhu, Muddassar Azam
,
Zaman, Qamar uz
,
Nadeem, Aamer
in
Computer and Information Sciences
,
Computer applications
,
Computer programs
2020
In general, requirements expressed in natural language are the first step in the software development process and are documented in the form of use cases. These requirements can be specified formally using some precise mathematical notation (e.g. Linear Temporal Logic (LTL), Computational Tree Logic (CTL) etc.) or using some modeling formalism (e.g. a Kripke structure). The rigor involved in writing formal requirements requires extra time and effort, which is not feasible in several software development scenarios. A number of existing approaches are able to transform informal software requirements to formal specifications. However, most of these approaches require additional skills like understanding of specification languages additional artifacts, or services of domain expert(s). Consequently, an automated approach is required to reduce the overhead of effort for converting informal requirements to formal specifications. This work introduces an approach that takes a use case model as input in the proposed template and produces a Kripke structure and LTL specifications as output. The proposed approach also considers the common use case relationships (i.e., include and extend). The generated Kripke structure model of the software allows analysis of software behavior early at the requirements specification stage which otherwise would not be possible before the design stage of the software development process. The generated LTL formal specifications can be used against a formal model like a Kripke structure generated during the software development process for verification purpose. We demonstrate the working of the proposed approach by a SIM vending machine example, where the use cases of this system are inputs in the proposed template and the corresponding Kripke structure and LTL formal specifications are produced as final output. Additionally, we use the NuSMV tool to verify the generated LTL specifications against the Kripke structure model of the software, which reports no counterexamples thus validating the proposed approach.
Journal Article