Filetype
Partially Premixed Combustion (PPC) has shown to be a promising advanced combustion mode for future engines in terms of efficiency and emission levels. The combustion timing should be suitably phased to realize high efficiency. However, a simple constant model based predictive controller is not sufficient for controlling the combustion during transient operation. This article proposed one learning
Partially premixed combustion (PPC) is an advanced combustion concept and powertrain technology, which has a great potential to improve the fuel economy of vehicles. The process of PPC is driven by both chemical kinetics and mixing process, and is, therefore, sensitive to inlet conditions and injection process. This article presents a control-oriented combustion and air-path model of a PPC multicy
Ray-Triangle intersection is a fundamental computation in most ray tracing algorithms. The prohibitive cost of the ray-triangle test algorithms, however, limits the utilization of these algorithms in settings with low power budgets, such as mobile systems. In this work, we analyze the precision requirements for ray-triangle intersection and observe that for most of the rays a low-precision is suff
Propagation models constitute a fundamental building block of wireless communications research. Before we build and operate real systems, we must understand the science of radio propagation, and develop channel models that both reflect the important propagation processes and allow a fair comparison of different systems. In the past five decades, wireless systems have gone through five generations,
The article is devoted to the concept of "conflict of interest." The author reveals the content of this concept, referring to the relevant international acts and legislation of the Republic of Uzbekistan, considers the main causes of the conflict of interest and puts forward a proposal regarding measures to prevent conflict of interest.
Embedded systems are built for specific purposes and are optimized to meet different kind of constraints, such as performance, timing, power and cost. The design process therefore involves different optimization activities. In this paper, we discuss the use of constraint programming (CP) technology for these optimization problems. The main advantages and disadvantages of applying CP to embedded sy
Radio based positioning or tracking solutions typically require wideband signals or phase coherent antennas. In this paper, we present a target tracking method based on received non-coherent signal strength differences (RSSDs) between antennas for outdoor Internet-of-things (IoT) scenarios. We introduce an RSSD model based on classical path-loss models. With known antenna patterns and antenna arra
The use of ultra-low power wake-up receivers (WuRx) can significantly reduce idle listening energy cost. To tailor a WuRx scheme to orthogonal frequency division multiplexing (OFDM) based systems, such as LTE-MTC or IEEE 802.11, the wake-up signal (WUS) also needs to follow OFDM principles to avoid interfering with other transmissions in the same shared bandwidth. Here, we address this particular
Cellular radio based localization can be an important complement or alternative to other localization technologies, as base stations continuously transmit signals of opportunity with beneficial positioning properties. In this paper, we use the long term evolution (LTE) cell-specific reference signal for this purpose. The multipath component delays are estimated by the ESPRIT algorithm, and the est
We investigate local convergence of identical DC/AC converters interconnected via identical resistive and inductive lines towards a synchronous equilibrium manifold. We exploit the symmetry of the resulting vector field and develop a Lyapunov-based framework, in which we measure the distance of the solutions of the nonlinear power system model to the equilibrium manifold by analyzing the evolution
We study planning problems where the transition function is described by a learned binarized neural network (BNN). Theoretically, we show that feasible planning with a learned BNN model is NP-complete, and present two new constraint programming models of this task as a mathematical optimization problem. Experimentally, we run solvers for constraint programming, weighted partial maximum satisfiabil
An algorithm is said to be certifying if it outputs, together with a solution to the problem it solves, a proof that this solution is correct. We explain how state of the art maximum clique, maximum weighted clique, maximal clique enumeration and maximum common (connected) induced subgraph algorithms can be turned into certifying solvers by using pseudo-Boolean models and cutting planes proofs, an
A (Formula presented.) -configuration is a set of (Formula presented.) blocks on (Formula presented.) points. For Steiner triple systems, (Formula presented.) -configurations are of particular interest. The smallest nontrivial such configuration is the Pasch configuration, which is a (Formula presented.) -configuration. A Steiner triple system of order (Formula presented.), an STS (Formula present
This article reports work-in-progress of a parallel kinematic robot development for construction with main focus on the concept phase. We suppose the weight distribution of the proposed structure enables integration of robotic components into construction equipment while enabling tailoring of important characteristics such as accuracy, stiffness and workspace toward application needs.We describe c
We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, thus answering the challenge to establish strong lower bounds in the regime between balanced constant-degree expanders as in [Ben-Sasson and Wigderson'01] and highly unbalanced, dense graphs as in [Raz'04] and [Razborov'03
We give a significantly simplified proof of the exponential separation between regular and general resolution of Alekhnovich et al. (2007) as a consequence of a general theorem lifting proof depth to regular proof length in resolution. This simpler proof then allows us to strengthen the separation further, and to construct families of theoretically very easy benchmarks that are surprisingly hard f
Building on [Clegg et al.’96], [Impagliazzo et al.’99] established that if an unsatisfiable k-CNF formula over n variables has a refutation of size S in the polynomial calculus resolution proof system, then this formula also has a refutation of degree k + O(n log S). The proof of this works by converting a small-size refutation into a small-degree one, but at the expense of increasing the proof si
Millimeter-wave (mmWave) frequencies are set to play an important role in fifth-generation (5G) wireless systems. A pre-requisite for the design and performance assessment of 5G wireless is the understanding of the involved propagation processes and derivation of insightful channel models. Unlike bands below 6 GHz, several additional modelling features need to be catered for at mmWaves. For dynami
