Search results
Filter
Filetype
Your search for "how to get to the dark web on phone 【Visit Sig8.com】9ZP42K8.qweG" yielded 58401 hits
Microporous polymer electrolyte membranes
Comparison of the BPA model to DIC measurements of polycarbonate
Study of precessing vortex core during vortex breakdown using LES and POD
Education in Motivation and Teamwork
Influence of the degree of sulfonation on the water uptake and proton conductivity for acrylamide copolymers
Large Eddy Simulation of an unsteady lifted flame
Stability and change in the development of knowledge
This contribution is about an entirely new approach to the study of knowledge. As an introductory remark, the classical research operations in the field of cognition are reviewed. Against this background, an application of David Hestenes theory of rotational dynamics is demonstrated with particular reference to text processing. Based on the mechanism of joints and links of the AaO machine, angular
VHDL vs. Bluespec System Verilog: A case study on a Java embedded architecture
This paper compares two hardware design flows, based on the classic VHDL on one side and the relatively new Bluespec System Verilog (BSV) on the other side. The comparison is based on a case study of a Java embedded architecture, comprising a Java native processor and a memory management unit. The processor is a micro-programmed, pipelined, Java-optimized processor (JOP), initially written in VHDL
Counting Thin Subgraphs via Packings Faster Than Meet-in-the-Middle Time
Vassilevska and Williams (STOC 2009) showed how to count simple paths on k vertices and matchings on k/2 edges in an n-vertex graph in time n^{k/2+O(1)}. In the same year, two different algorithms with the same runtime were given by Koutis and Williams (ICALP 2009), and Björklund et al. (ESA 2009), via nst/2+O(1)-time algorithms for counting t-tuples of pairwise disjoint sets drawn from a given fa
Finding a heaviest triangle is not harder than matrix multiplication
We show that for any ε > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(nω + n2+ε), where ω is the exponent of fastest matrix multiplication algorithm. By the currently best bound on ω, the running time of our algorithm is O(n2.376). Our algorithm substantially improves the previous time-bounds for this problem recen
Numerical Computation of the Acoustical Field around Wind-Turbines
On adaptive deterministic gossiping in ad hoc radio networks
We study deterministic algorithms for gossiping problem in ad hoc radio networks. The gossiping problem is a communication task in which each node of the network possesses a unique single message that is to be communicated to all other nodes in the network. The efficiency of a communication algorithm in radio networks is very often expressed in terms of: max-eccentricity D, max-indegree Δ, and siz
Observer Backstepping and Control Design of Linear Systems
We show that the observer-backstepping technique applied to linear control object and combined with linear control system design gives rise to a non-standard composition of control object, observer and controller. The resultant system is characterized by a full-order observer and a reduced-order control system design which in its complexity does not go beyond the `relative degree' of the control o
A multi window technique for EEG analysis
Estimation of single evoked potentials
Visual Product Identity: Understanding identity perceptions conveyed by visual product design
Soft Skills Demand and Supply Through the Lens of Higher Education Students
Soft skills are becoming equally crucial as hard skills in today's labour market. In contrast to hard skills which are teachable typically through formal education, soft skills are non-technical and interpersonal, allowing individuals to be able to find and succeed in their studies, jobs, and professional life. Despite the increasing emphasis on soft skills, many university students are either una
Stability Analysis of Adaptive Output Feedback Systems
This paper presents stability theory of adaptive systems using an extension of the Yakubovich-Kalman-Popov (YKP) lemma. Adaptive stability analysis is relevant for observer-based feedback control systems. Relaxation of the controllability and observability conditions imposed in the YKP lemma can be made for a class of adaptive systems described by a linear time-invariant system (LTI) with adaptive
25MOD_Flipped_artikel
25MOD_Flipped_artikel LTH:s 12:e Pedagogiska Inspirationskonferens, 7 december 2023 Abstrakt—Under 2021 och 2022 gavs kursen FMAB65 Endimensionell Analys B1 med två olika pedagogiska metoder: en traditionell metod, där den lärarledda undervisningen bestod av föreläsningar och räkneövningar, och en experimen- tell metod med aktivt lärande, där fokus var på grupp- seminarier, i vilka studenterna eft
https://www.lth.se/fileadmin/cee/genombrottet/konferens2023/B4_Hartman_etal.pdf - 2026-05-29
