Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
83,325
result(s) for
"Specifications"
Sort by:
Design of 64 V 24 Ah Battery Pack with Li-Ion 1865 Cells for Two-Wheels Electric Vehicle
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
Tolerance Specifications Management Integrated into the Product Development Cycle
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
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
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
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+.
Book
Minimal and proximal examples of \\( d\\)-stable and \\( d\\)-approachable shift spaces
We study shift spaces over a finite alphabet that can be approximated by mixing shifts of finite type in the sense of (pseudo)metrics connected to Ornstein’s \\( d\\) metric (\\( d\\)-approachable shift spaces). The class of \\( d\\)-approachable shifts can be considered as a topological analog of measure-theoretical Bernoulli systems. The notion of \\( d\\)-approachability, together with a closely connected notion of \\( d\\)-shadowing, was introduced by Konieczny, Kupsa, and Kwietniak [Ergod. Th. & Dynam. Sys. 43(3) (2023), 943–970]. These notions were developed with the aim of significantly generalizing specification properties. Indeed, many popular variants of the specification property, including the classic one and the almost/weak specification property, ensure \\( d\\)-approachability and \\( d\\)-shadowing. Here, we study further properties and connections between \\( d\\)-shadowing and \\( d\\)-approachability. We prove that \\( d\\)-shadowing implies \\( d\\)-stability (a notion recently introduced by Tim Austin). We show that for surjective shift spaces with the \\( d\\)-shadowing property the Hausdorff pseudodistance \\( d^ H\\) between shift spaces induced by \\( d\\) is the same as the Hausdorff distance between their simplices of invariant measures with respect to the Hausdorff distance induced by Ornstein’s metric \\( d\\) between measures. We prove that without \\( d\\)-shadowing this need not to be true (it is known that the former distance always bounds the latter). We provide examples illustrating these results, including minimal examples and proximal examples of shift spaces with the \\( d\\)-shadowing property. The existence of such shift spaces was announced in the earlier paper mentioned above. It shows that \\( d\\)-shadowing indeed generalizes the specification property.
Journal Article
Technical Specifications of the Submarine Fiber Optic Channel Bandwidth/Capacity in Optical Fiber Transmission Systems
This work outlines technical specifications of the undersea fiber optic communication channel bandwidth, capacity with taken into account the maximum and minimum extended fiber cost in the presence of amplifiers stations. The number of amplifiers in the amplification stage are addressed based on the amplifier distance to strength the light signal in water depth after 5 km distance. The fiber channel capacity is estimated at different water depth and at the surface of the water. Minimum input signal power and required detectable received power are adjusted to ensure the high data rates in submarine cable systems under the best and worst conditions of the seawater pressure. The study emphasizes the high data rates transmission can be achieved at a distance of 10 km depth.
Journal Article