This paper proposes a new RTL design synthesis method focusing on recursive expressions with parallelization. For the purpose, we have extended Mulvery which is a hardware design framework based on Ruby language. Comb...
详细信息
ISBN:
(纸本)9781728129433
This paper proposes a new RTL design synthesis method focusing on recursive expressions with parallelization. For the purpose, we have extended Mulvery which is a hardware design framework based on Ruby language. Combining static and dynamic analysis allows a recursive function in order to generate a control data flow graph (CDFG). CDFG is converted into an RTL module to be synthesized into an appropriately pipelined circuit. We have compared performance of some algorithms with our proposed HLS system with parallelization against performance of synthesized call stack-based hardware from a recursive function similar to software, performance in executing Ruby programs by software as well as performance with an IP core. As a result, high-level synthesized and parallelized FFT performs 7.76x faster than the call stack based hardware and 408.88x faster than the software execution. Against an IP core, 1.28x faster performance has been gained.
We improved a method to support more general and rational reorganization planning, demonstrating its practicality through application to Kobe municipal housing complexes. We initially developed a cost-effective algori...
详细信息
We improved a method to support more general and rational reorganization planning, demonstrating its practicality through application to Kobe municipal housing complexes. We initially developed a cost-effective algorithm using depth-first search, enabling the consideration of a larger pool of dwelling units and houses for reorganization. We then ensured the algorithm accounts for practical constraints by grouping sale sites together and considering proximity to roads, thereby deriving more viable combinations. Furthermore, we clarified the break-even point for the reorganization projects, allowing for an assessment of project feasibility from a profitability standpoint. We developed a method to support more general and rational reorganization planning, demonstrating its practicality through application to Kobe municipal housing complexes. Using a cost-effective algorithm with depth-first search, we considered a larger pool of dwelling units while accounting for practical constraints, such as grouping sale sites and proximity to roads. Additionally, we clarified the break-even point for reorganization projects, enabling an assessment of project feasibility from a profitability ***
We propose a smartphone-based computer vision system for visually impaired people that uses a neural network to classify objects and estimate image depth to improve spatial orientation in the environment. For this pur...
详细信息
ISBN:
(纸本)9783031425073;9783031425080
We propose a smartphone-based computer vision system for visually impaired people that uses a neural network to classify objects and estimate image depth to improve spatial orientation in the environment. For this purpose, we have developed and implemented a spatial orientation algorithm with a recursive function for calculating the sum of image array values to estimate depth. The advantage of this algorithm is the lowcomplexity of calculations, which ensures its high performance in real-time. Our system is designed to be easy to use, portable, and affordable, making it accessible to a wide range of users. The proposed system utilizes a smartphone camera and computer vision algorithms to analyze the user's environment and provide real-time feedback through audio and haptic feedback. The neural network depth estimation model is trained on a large dataset of images and corresponding depthmaps, which allows it to accurately avoid various objects in the user's field of view.
In this paper, we present proofs of properties of semirecursive sets based directly on the definition of these sets and on the recursiveness of Kleene predicates. These proofs are shorter and clearer than traditional ...
详细信息
Neasu (Tibeto-Burman: China) exhibits a prefix that derives new coordinators from existing ones by elaborately changing their subcategorial properties. Prefixed and unprefixed coordinators are distinguished by the com...
详细信息
Neasu (Tibeto-Burman: China) exhibits a prefix that derives new coordinators from existing ones by elaborately changing their subcategorial properties. Prefixed and unprefixed coordinators are distinguished by the complement they take (+/- verbal, +/- CoP) and the possibility of being stacked up at least twice (+/- stackable). A prefixed coordinator has two of these three features switched from "-" to "+", when compared with its unprefixed counterpart and thus see its ability to occur as the head of recursive coordination structures increased. The prefix ao- is an operator of recursion.
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later work investigated intensiona...
详细信息
Classical results in computability theory, notably Rice's theorem, focus on the extensional content of programs, namely, on the partial recursive functions that programs compute. Later work investigated intensional generalisations of such results that take into account the way in which functions are computed, thus affected by the specific programs computing them. In this paper, we single out a novel class of program semantics based on abstract domains of program properties that are able to capture nonextensional aspects of program computations, such as their asymptotic complexity or logical invariants, and allow us to generalise some foundational computability results such as Rice's Theorem and Kleene's Second Recursion Theorem to these semantics. In particular, it turns out that for this class of abstract program semantics, any nontrivial abstract property is undecidable and every decidable over-approximation necessarily includes an infinite set of false positives which covers all the values of the semantic abstract domain. (c) 2022 Elsevier Inc. All rights reserved.
This study presents an early stage data-based maintenance strategy of driving wheels that have different life distributions depending upon their location. Wear was predicted under the condition that the shape of the c...
详细信息
This study presents an early stage data-based maintenance strategy of driving wheels that have different life distributions depending upon their location. Wear was predicted under the condition that the shape of the contact surface changes over time by an original method of back calculating degradation over time through the establishment of a basic wear model and a recursive function for wear progression. An accurate wear model was established and verified by an experiment. The variation in the profile of a wear-induced wheel was applied to the wear model. Furthermore, the model was combined with a recursive function and used to obtain the time-series degradation data. Subsequently, the factors which have a major influence on wheel production were analyzed, and a meta-model was configured using the response surface method. The degradation function and parameter distribution were estimated using uncertainty propagation, and the wear life distribution was derived using Bayesian inference and Markov chain Monte Carlo method. The reliability of driving wheels was obtained, and the maintenance interval was optimized under each maintenance conditions. Based on this novel method, the early stage data-based maintenance strategy was achieved, and the result of the wear life prediction was validated using the probability distribution analysis.
A graphical number representation system based on the formal logic foundation of a recursively defined function is presented. The function exposes a one-to-one correspondence between the natural numbers and the set of...
详细信息
ISBN:
(纸本)9781728133669
A graphical number representation system based on the formal logic foundation of a recursively defined function is presented. The function exposes a one-to-one correspondence between the natural numbers and the set of rooted trees. Secondly, a relation between pairs of natural numbers is shown to partition the integers into disjoint finite sets each visualized as a tree in the forest of all finite trees. This relation encapsulates in visual form the natural structure and distribution of primes in a manner not previously investigated. These representations allow arithmeticians to visually experience natural numbers in a 2D graphical layout. This form is free of cultural choices such as the number of symbols in an alphabet and/or one-dimensional symbol strings. The fundamental nature of these mappings is argued to be accessible to a creative mind independent of formal schooling. This short note includes examples illustrating the simplicity of the constructions.
In programming learning, it is difficult to imagine the behavior of a recursive function. This difficulty stems from the following: (1) learners have to manage different instances of functions with the same name, (2) ...
详细信息
ISBN:
(纸本)9789869401265
In programming learning, it is difficult to imagine the behavior of a recursive function. This difficulty stems from the following: (1) learners have to manage different instances of functions with the same name, (2) they cannot understand the execution process of passive flow, and (3) novice learners cannot manage unnecessary portions as a black box. Furthermore, it is desirable for authors of teaching materials to customize the visualization of each instance individually. In this study, we have extended a program visualization tool (TEDViT) to be able to visualize recursive functions by satisfying the above issues. We conducted an evaluation of our method and obtained positive results.
Graham Priest (Analysis 57:236-242, 1997) has argued that Yablo's paradox (Analysis 53:251-252, 1993) involves a kind of hidden' circularity, since it involves a predicate whose satisfaction conditions can onl...
详细信息
Graham Priest (Analysis 57:236-242, 1997) has argued that Yablo's paradox (Analysis 53:251-252, 1993) involves a kind of hidden' circularity, since it involves a predicate whose satisfaction conditions can only be given in terms of that very predicate. Even if we accept Priest's claim that Yablo's paradox is self-referential in this sensethat the satisfaction conditions for the sentences making up the paradox involve a circular predicateit turns out that there are paradoxical variations of Yablo's paradox that are not circular in this sense, since they involve satisfaction conditions that are not recursively specifiable, and hence not recognizable in the sense required for Priest's argument. In this paper I provide a general recipe for constructing infinitely many (in fact, continuum-many) such noncircular Yabloesque paradoxes, and conclude by drawing some more general lessons regarding our ability to identify conditions that are necessary and sufficient for paradoxically more generally.
暂无评论