Filetype
Since the 1960s, product designers, architects, lighting planners, gamers and scientific visualizaiton specialists have craved the ability to work in real-time three-dimensional photorealistic virtual worlds. The authors, one specializing in making computer graphics more convincing and the other focusing on making them faster, present the achievements and challenges in the race for real-time photo
Hibernomas are benign tumors with morphological features resembling brown fat. They consistently display cytogenetic rearrangements, typically translocations, involving chromosome band 11q13. Here we demonstrate that these aberrations are associated with concomitant deletions of AIP and MEN1, tumor suppressor genes that are located 3 Mb apart and that underlie the hereditary syndromes pituitary ad
Using the metrics of channel capacity and multiplexing efficiency, the adaptive impedance matching (AIM) performances of two multiple-input multiple-output (MIMO) terminals with different antenna designs were evaluated and compared. The evaluation was performed in LTE Band 18 Downlink (860-875 MHz) under realistic usage conditions of two measured user handgrips and simulated propagation channels w
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
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
To systematically address non-technical engineering skills (NTES), six mandatory "Engineering Days" (Ing-dagar) were introduced in two bachelor programmes. The students were also allowed to perform voluntary activities leading to a Certification of Non-technical Engineering Competences, a certificate the students can attach to their CVs. To be certified, the student must have performed activities
Systems mixing Boolean logic and arithmetic have been a long-standing challenge for verification tools such as SAT-based bit-vector solvers. Though SAT solvers can be highly efficient for Boolean reasoning, they scale poorly once multiplication is involved. Algebraic methods using Gröbner basis reduction have recently been used to efficiently verify multiplier circuits in isolation, but generally
Sliding mode control (SMC) is to keep the system to a stable differential manifold. Model predictive control (MPC) calculates the control input by solving an optimization problem on receding horizon. The method of receding horizon sliding control (RHSC) includes the predicted information into the SMC design by combining SMC and MPC. Considering the modeling error and measurement noise, there are m
The min-sum (MS) and approximate-min* (a-min*) algorithms are alternatives of the belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. To lower the BP decoding complexity, both algorithms compute two magnitudes at each check node (CN) and pass them to the neighboring variable nodes (VNs).In this work we propose a new algorithm, ga-min*, that generalizes the MS
Conflict-driven pseudo-Boolean solvers optimize 0-1 integer linear programs by extending the conflict-driven clause learning (CDCL) paradigm from SAT solving. Though pseudo-Boolean solvers have the potential to be exponentially more efficient than CDCL solvers in theory, in practice they can sometimes get hopelessly stuck even when the linear programming (LP) relaxation is infeasible over the real
We see a potential for ESS to benefit from sharing alarm data for machine learning applications, by establishing data ecosystem. To achieve these goal, ESS must make a strategic decision to pursue data sharing, establish a technical platform to share a digital twin, continue advancing the data ecosystem, and work towards a standardized reference model.
One type of light source that remains largely unexplored in the field of light transport rendering is the light generated by superluminal particles, a phenomenon more commonly known as Cherenkov radiation. By re-purposing the Frank-Tamm equation for rendering, the energy output of these particles can be estimated and consequently mapped to photons, making it possible to visualize the brilliant blu
We establish an exactly tight relation between reversiblepebblings of graphs and Nullstellensatz refutations of pebbling formulas,showing that a graph G can be reversibly pebbled in time t and space s if and only if there is a Nullstellensatz refutation of the pebbling formulaover G in size t + 1 and degree s (independently of the field in whichthe Nullstellensatz refutation is made). We use this
In this paper we propose a design methodology to partition dataflow applications on a multi clock domain architecture. This work shows how starting from a high level dataflow representation of a dynamic program it is possible to reduce the overall power consumption without impacting the performances. Two different approaches are illustrated, both based on the post-processing and analysis of the ca
In this paper, we present a systematic approach to design a compact dual-mode monopole-like patch antenna using characteristic mode analysis (CMA). The modal analysis of a slotted circular patch structure incorporating a new shorting pin loading technique is presented. To achieve a compact monopole-like antenna with wideband operation, it is demonstrated that the first two significant modes with m
In this paper, a control-oriented soot model was developed for real-time soot prediction and combustion condition optimization in a gasoline Partially Premixed Combustion (PPC) Engine. PPC is a promising combustion concept that achieves high efficiency, low soot and NOx emissions simultaneously. However, soot emissions were found to be significantly increased with high EGR and pilot injection, the
This paper provides an initial investigation on the application of convolutional neural networks (CNNs) for fingerprint-based positioning using measured massive MIMO channels. When represented in appropriate domains, measured massive MIMO channels have a sparse structure which can be efficiently learned by CNNs for positioning purposes. We evaluate the positioning accuracy of state-of-the-art CNNs
With the advent of IoT and the associated variety of pervasive and context-aware applications, there is an increasing requirement to support the execution of these applications on devices with limited processing power. This is a cost-intensive process as this usually requires the deployment of centralized computing infrastructure accessible via a cloud interface. We envision a distributed executio
