Filter results

Results (703)

Sort by:

Select all Select all

Page 1

Xiao Zhao - Reactor network synthesis with guaranteed robust performance

Partial access

Select

Xiao Zhao

Reactor network synthesis with guaranteed robust performance

Series: Verfahrenstechnik

Volume 952 2017

Results in this title

Open-loop reactor network synthesis S. 30-46

„… reactor network, i.e., stability and response speed (cf. Chapter 2), can be formulated as αJnid(x, q, p …” „… ). (3.34) 41 3 Open-loop reactor network synthesis Table 3.4: A steady state P ∗ of the 2-reactor network …” „… steady-state P ∗ of the 2-rector network (3.23), in which reactor 1 is idle and reactor 2 is non-idle. We set …”

Case study of allyl chloride production S. 107-132

„… in the final design. A 2-reactor network model in open-loop is already presented in Eq. (3.23). This …” „… section of PFR i m 2 Tsys [300, 600] feed temperature K as: Crev = pBTyear[ysys]2, Craw = pATyear( ∑ j qN …” „… +1,j[psys]1 − [ysys]1) + pCTyear( ∑ j qN+1,j[psys]3 − [ysys]3), Csep = 10 5 · ([ysys]1 + [ysys]2 …”

Summary and outlook S. 133-140

„… is presented for open-loop and closed-loop reactor network design with guaranteed robust dynamic …” „… in the reactor network superstructure. A structured modeling procedure is proposed to formulate the …” „… open-loop model of the reactor network. Each reactor in the reactor network superstructure is modeled by a …”

Bibliography S. 158-176

„… biconvex programming. Mathematics of Operations Research, 8(2):273–286, 1983. [4] A. Andrew, K. Chu, and P …” „… Dynamical Systems, 7(2):461–490, 2008. [54] P. Gill, W. Murray, and M. Saunders. User’s guide for SNOPT 5.3 …” „… , 1994. [88] A. Kokossis and C. Floudas. Optimization of conplex reactor networks 2: Nonisothermal …”

Appendices S. 141-157

„… (Second-order sufficient conditions (SOSC) for a local isolated minimizing point of P (x̄), Lemma 2.1 in [40 …” „… , Theorem 2.1 in [40]). If (i) the SOSC in Theorem D.2 for a local minimum of P (x̄) holds at v∗ with …” „… Appendices 141 A Extension of the reactor network model to PFR Plug flow reactors (PFR) represent …”

Simultaneous design of reactor network and its decentralized control system S. 47-59

„… reactor network by u = (qT , uT1 , · · · , uTN , [psys]Nc+1)T ∈ Rnm . (4.2) Denote π as the vector π …” „… reactor network design and then formalize the definition of idle controllers. Definition 4.1.2 (Idle …” „… T p2) T . (4.25) up1 refers to the vector of candidate MV, which belong to at least one idle reactor …”

Solution methods S. 60-106

„… relaxation scheme yizi ≤ 2, ∀i = 1, · · · , p, (yi + t)(zi + t) ≥ 2, ∀i = 1, · · · , p. The provided …” „… , · · · , p. 70 5.2 Mathematical programs with complementarity constraints Recently, Steffensen and Ulbrich …” „… Theorem E.2.5, proved in Appendix E. Therefore, to locally identify the local minima of SIP P , one can …”

Some Preliminaries S. 17-29

„… ), · · · , λn(x) ∈ C, the polynomial can be represented by pM(x)(λ) = (λ1(x)− λ) · · · (λn(x)− λ). (2.3) λ1(x …” „… 2 Some Preliminaries This chapter introduces some theoretical concepts related to dynamic systems …” „… be presented at the end. 2.1 Dynamic systems Consider a nonlinear autonomous dynamic system …”

Titelei/Inhaltsverzeichnis S. I-XIV

„… αJnid(·) P ∗ steady state of the 2-reactor network example ϕ objective function in optimization πτ …” „… 3.1.1 A structured representation of reactor network models . . . . . . . 31 3.1.2 Models of Subsystem 1 …” „… networks . . . . . . . . . . . . . . 39 3.2 Problem formulation …”

doi.org/10.51202/9783186952035

Herwig Unger, Wolfgang A. Halang - Autonomous Systems 2016

Partial access

Select

Herwig Unger (ed.), Wolfgang A. Halang (ed.)

Autonomous Systems 2016

Series: Informatik/ Kommunikation

Volume 848 2016

Results in this title

Networks and Routing S. 70-103

„… Authentication between familiar Peers in P2P Networking Systems Fariborz Nassermostofi Chair of Communication …” „… the anonymity of peers in P2P networking systems and absence of a CA, the authentication of peers is …” „… communicate Toward Authentication between familiar Peers in P2P Networking Systems 89 with a server which can …”

Titelei/Inhaltsverzeichnis S. I-VIII

„… . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 79 Toward Authentication between familiar Peers in P2P Networking Systems F. Nassermostofi …” „… http://www.gartner.com/newsroom/id/3114217 2P. Mertens and D. Barbian: Digitalisierung und Industrie 4.0 – Trend mit modischer …” „… Networks-based Generalized Matrix Inversion with Applications in Stochastic Time-varying Systems A. Haj Mosa, K …”

Neural and Evolutionary Computing S. 133-166

„… Computation 47.2 (1992): 109-120. [7] Cichocki, Andrzej, and Rolf Unbehauen. :Neural networks for solving …” „… and computation 93.2 (1998): 195-205.APA [9] Ge, Shuzhi Sam, and Chang Chieh Hang. :Structural network …” „… Computer Engineering, Graduate School, Khon Kaen University. 144 Dual Echo State Networks-based Generalized …”

Short Contributions S. 219-226

„… web technologies, ubiquitous communication and social networks gave the initial impetus for new forms …” „… learning in a modern information society. In network technology, a hub is seen as a central instance in a …” „… communication environment, with which individual network nodes, in a central instance, connects and enables the …”

Natural Language Processing S. 167-194

„… co-occurrence graph is connected1) there is a shortest path p = (w1,w2), (w2,w3), .., (wk,wk + 1) with w1 = wa …” „… Networks (POLICY), pp. 34–36, 2012 [12] Song, P., Shu, A., Phipps, D.: Language Without Words: A …” „… Chair of Communication Networks FernUniversität in Hagen, Germany Abstract: The calculation of semantic …”

„… , p.17] and [2, p.22]): • Requirements to hardware and software components [B1], • Internal and …” „… life-cycle (compare [1], p.12 as well as [2], p.16) [C1], • Clarity, precision, unambiguity, verifiability …” „… , testability, maintainability, executability (compare [1], p.17) [C2]. The requirements, that have been …”

Education S. 195-218

„… speaking to his students” is not considered appropriate. But teachers at universities of applied sciences2 …” „… Lehrer. Welche Unverschämtheit!“[2] 2 Fachhochschulen in German 196 T. Tempelmeier new and “modern …” „… universities of applied sciences. Hopefully it will spur discussion. 2 Teaching Computer Science at …”

doi.org/10.51202/9783186848109

Herwig Unger, Mario M. Kubek - Theory and Application of Text-representing Centroids

Partial access

Select

Herwig Unger, Mario M. Kubek

Theory and Application of Text-representing Centroids

Series: Informatik/ Kommunikation

Volume 863 2019

Results in this title

M. M. Kubek, H. Unger The WebEngine – A Fully Integrated, Decentralised Web Search Engine S. 107-120

„… efficient search functions as well as approaches for the se-mantically induced P2P-network construction and …” „… semi-structured overlay P2P-network is built which comprises ofclusters of semantically similar peers …” „… cited above, the authors intend to build andmaintain a P2P-network whose structures are directly formed …”

H. Unger, M. M. Kubek Associative Ring Memory to Support Decentralised Search S. 91-106

„… replication in un-structured P2P networks, In: Proceedings of the 16th International Conferenceon Super …” „… of such structures, preferably on peers of a flexible peer-to-peer (P2P) system.After a short …” „… have been proposed to manage a large amount of contents withindecentralised, P2P systems [2]. In order …”

H. Unger, M. M. Kubek Concept Supporting a Resilient, Fault-tolerant and Decentralised Search S. 79-90

„… .: Cluster-building in P2P-Community Networks. In: Jour-nal on Parallel and Distributed Computing Systems and Networks …” „… beenworked out. It is based on a peer-to-peer (P2P) system similar to [4] or [3] whichis realised as an …” „… characterised by its weak con-nectivity, too.2 Handling of Random WalkersNow, a P2P-system is considered, which …”

M. M. Kubek, T. Böhme, H. Unger Spreading Activation: A Fast Calculation Method for Text Centroids S. 27-38

„… , Champaign, IL, USA, 1981.[4] H. Unger and M. Wulff. Cluster-building in p2p-community networks.In …” „… and Herwig Unger11Chair of Communication Networks, University of Hagen, Germany2Institute for …” „… p ={(wa, w2), (w2, w3), . . . , (wk, wb)} with (wi, wi+1) ∈ E is considered and thedistance is …”

M. M. Kubek, Herwig Unger Towards a Librarian of the Web S. 55-78

„… obtained clustersEntropy (E)/Purity (P):Alg. II Alg.IIaNaiveBayesDataset 2.1(100 doc. / 3 topics)E=0.61P …” „… =0.70E=0.55P=0.77E=0.98P=0.39Dataset 2.2(100 doc. / 3 topics)E=0.65P=0.69E=0.46P=0.82E=0.97P=0.37Dataset …” „… 2.3(100 doc. / 4 topics)E=0.41P=0.76E=0.35P=0.82E=0.49P=0.6276 M. M. Kubek and Herwig UngerAs previously …”

H. Unger, M. M. Kubek Evolving Text Centroids S. 121-130

„… is the length of the shortest path between π1 and π2along the s ≥ 1 intermediate nodes p1, p2 …” „… , . . . , ps ∈ X:d(π1, π2) = d(π1, p1) +s−1∑k=1d(pk, pk+1) + d(ps, π2)With these basic definitions, the concept …” „… shortest path {ξ(i)D , p1, p2, . . . , ps} with p1, . . . , ps ∈ X andps = wi+1 and determine its length …”

Authors S. 140-144

„… in Hagen and the headof the Chair of Communication Networks.His research interests lie in the areas …” „… - P o r t a l f ü r I n g e n i e u r e .Mit dem Gehaltstest für Ingenieure überprüfen Sie schnell …” „… Konstruktionstechnik/Maschinenelemente2 Fertigungstechnik3 Verfahrenstechnik4 Bauingenieurwesen5 Grund- und Werkstoffe/Kunststoffe6 …”

M. M. Kubek, H. Unger Centroid Terms as Text Representatives S. 7-26

„… thatthe co-occurrence graph is connected1) there is a shortest path p =(w1, w2), (w2, w3), . . . , (wk, wk …” „… Networks, University of Hagen, GermanyAbstract: The calculation of semantic similarities between text …” „… related terms, unsupervised topic modeling techniques such as LDA [2]have been successfully applied. This …”

M. M. Kubek, T. Böhme, H. Unger Empiric Experiments with Text-representing Centroids S. 39-54

„… Unger11Chair of Communication Networks, University of Hagen, Germany2Institute for Mathematics, Ilmenau …” „… 41d(wa, wb) =1g((wa, wb)). (1)Otherwise, the shortest path p = (w1, w2), (w2, w3), . . . , (wk, wk …” „… 39Empiric Experiments with Text-representing CentroidsMario M. Kubek1, Thomas Böhme2 and Herwig …”

doi.org/10.51202/9783186863102

Sun Danfeng - Distributed Edge Intelligence Enabled Wireless Communication Systems Serving Industrial Applications

No access

Select

Sun Danfeng

Distributed Edge Intelligence Enabled Wireless Communication Systems Serving Industrial Applications

Series: Mess-, Steuerungs- und Regelungstechnik

Volume 1278 2022

Results in this title

Spectral Efficiency Optimization S. 47-69

„… output of network 2, expressed as PkP ′k. Thereinto, P ′k means the upper bound of Pk, andthe final …” „… priority.484.2 Fully Connected Neural NetworkThe kth CU spectral efficiency (SE) in the proposed system …” „… neural network.From the above process, the constraint C1 can be met, and in general, C2 can be …”

Dependability Assessment S. 24-46

„… NetworksKnowledge-basedMethodsKnowledge-based ProcessSystem 1 StateDevice 1 StateSystem 2 StateDevice n StateSystem 3 StateDevice 2 StateLogical …” „… links and eachlogical link has N1,p, N2,p, and N3,p dependability parameters. Then xt is as follows:xt …” „… as:x1t = [x11,t,x12,t, ...,x1N1,p,t], (3.3)x2t = [x2N1,p+1,t,x2N1,p+2,t, ...,x2N1,p+N2,p,t], (3.4)x3t …”

Bibliography S. 87-108

„… Wireless NetworkREIHE 08 | NR. 1278ISBN 978-3-18-527808-2E-ISBN 978-3-18-627808-1Cyan Magenta …” „… , 2021.[115] G. Prem Kumar and P. Venkataram. Artificial intelligence approaches to network man-agement …” „… networks based on support vector machine.Chinese Journal of Electronics, 26(2):377–384, 2017.[158] Tao Liu …”

Distributed Edge Intelligence for Dependability Assessment and Spectral Efficiency Optimization S. 70-82

„… , namely, Sub-model 1 from the Data Initialization Network,Sub-model 2 from the Network 1, Sub-model 3 from …” „… DEI supports maximizing the performanceof neural networks under relevant constraints. Fig. 5.2 shows …” „… the Network 2, Sub-model 4 from theNetwork 3, Sub-model 5 from the last layer of the Results …”

Titelei/Inhaltsverzeichnis S. I-XII

„… REGELUNGS-TECHNIKSunIntelligent Industrial Wireless NetworkREIHE 08 | NR. 1278ISBN 978-3-18-527808-2E-ISBN 978-3-18-627808-1Cyan …” „… . . . . . . . . . . . . . . . . . . . . . 474.2 Fully Connected Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . 494.2 …” „… Network Model . . . . . . . . . 554.3.2 Network Structure …”

doi.org/10.51202/9783186278081

Roberto D. Henschel - Higher-Order Multiple Object Tracking

Partial access

Select

Roberto D. Henschel

Higher-Order Multiple Object Tracking

Series: Informatik/ Kommunikation

Volume 875 2021

Results in this title

Fundamentals S. 33-79

„… ] ∈ R1×m, X[:,k] := (xr,k)r∈[n] ∈ Rn×1 , (2.2) respectively. For a tensor X ∈ Rn×m×p and u ∈ [p], we …” „… terminologies and refer to Georgii [69] for further details. Definition 2.1. Let (Ω,A,P) be a probability space …” „… }). Definition 2.2. The expected value of a discrete random variable X : Ω→ R is given by E[X] := ∑ x∈X(Ω) xP …”

Lifted Disjoint Paths S. 130-164

„… . Formally, y̆vw = 1⇔ ∃P ∈ vw-paths(G) s.t. ∀ij ∈ PE : yij = 1 . (4.2) Optimization problem. Given edge costs …” „… reachable from another node v in the flow network. We define to this end the reachability relation R ⊂ V(2 …” „… Figure 4.3. There are four possible paths in G from v to either u1 or u2. They are P1 = (vv3, v3u1), P2 …”

Bibliography S. 172-196

„… ] Ravindra K Ahuja, Thomas L Magnanti, and James B Orlin. Network flows. Cambridge, Mass.: Alfred P. Sloan …” „… camera networks using wearable accelerometers”. In: Proceedings of the 2nd International Conference on …” „… paths in a network”. In: Networks 4.2 (1974), pp. 125– 145. [240] Tali Eilam-Tzoreff. “The disjoint …”

Titelei/Inhaltsverzeichnis S. I-XVIII

„… regression . . . . . . . . . . . . . . . . . . . . . . . . . 40 2.4.3 Neural networks …” „… _ 21 15 57 _R ei he _1 0_ 87 5_ C ov er .p df · S ei te 1 L_211557_Reihe_10_875_Cover.pdf · Seite 1 …” „… 1 1 I N K O O P E R A T I O N M I T V D I N A C H R I C H T E N J E T Z T R E I N H Ö R E N …”

Introduction S. 1-32

„… : Γ̂ = arg max Γ P(D | Γ)P(Γ) , (1.2) = arg max Γ nR∏ f=1 P(Df | Γ)P(Γ) , = arg max Γ ∏ d∈D1∪···∪DnR …” „… the complexity of Eq. (1.2), it is a common approach to assume that P(γ) can be computed based on …” „… chain rule and the Markov property is given by P(γ) = P(d1) M∏ i=2 P(di | di−1)P(dM) , (1.4) where we …”

HO-MOT with Signal Fusion S. 80-129

„… 1 + exp(−〈φv, θ〉) , (3.19) P(θj) = N (0, σ2) , (3.20) where σ ∈ R>0. The edge classification using …” „… vector xFW, number of iterations j 1 fmin ←∞ 2 j ← −1 3 repeat 4 j ← j + 1 5 a∗ ← arg mina∈P …” „… pixel p ∈ R2, we obtain barycentric coordinates λ(d,p) ∈ R3 ≥0 of p w.r.t. the corners of d such that p …”

doi.org/10.51202/9783186875105

1

2 3 ... 141