A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Power levels and packet lengths in random multiple access with multiple-packet reception capability
2006
IEEE Transactions on Information Theory
Preserved Fulltext
Given a minimum throughput requirement, under the same condition on , the single-power-level system also achieves the maximum average packet capture probability as well as the optimum energy usage efficiency ...
We prove that, compared with a multiple-power-level system, the single-power-level system in which all nodes transmit at the maximum allowable power level achieves optimal throughput, under a condition ...
APPENDIX B PROOF OF PROPOSITION 3
A. ...
doi:10.1109/tit.2005.862076
fatcat:ji2m3r6h7jdzbgs3nidzeoy4uq
Power levels and packet lengths in random multiple access
2002
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Given a minimum throughput requirement, under the same condition on , the single-power-level system also achieves the maximum average packet capture probability as well as the optimum energy usage efficiency ...
We prove that, compared with a multiple-power-level system, the single-power-level system in which all nodes transmit at the maximum allowable power level achieves optimal throughput, under a condition ...
APPENDIX B PROOF OF PROPOSITION 3
A. ...
doi:10.1109/18.971738
fatcat:cgxfmfgyi5fbzjceu6jppbxfzi
Resolution of Max-Product Fuzzy Relation Equation with Interval-Valued Parameter
2019
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Considering the application background on P2P network system, we investigate the max-product fuzzy relation equation with interval-valued parameter in this paper. ...
Besides, the solution set is compared to that of the classical max-T fuzzy relation equations system. ...
The rest of the proof is evident based on cases 1, 2, and 3.
Proposition 11. ...
doi:10.1155/2019/8179763
fatcat:zjm7a5sfnna6vf6c5oariwhmbq
Parity Systems and the Delta-Matroid Intersection Problem
1999
Electronic Journal of Combinatorics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the problem of determining when two delta-matroids on the same ground-set have a common base. ...
Examples of parity systems may be obtained by combining either, two delta-matroids, or two orthogonal 2-polymatroids, on the same ground-sets. ...
Proposition 7. 1 1 If P is a tight parity system then ν(P ) ≡ sgn(P ) + |Ω| mod 2.Proof. Let ν(P ) = ν and M be a maximum matching in P . ...
doi:10.37236/1492
fatcat:nyyqyrpmsffhrcyz4yagal5axm
A note on the existence of the maximum likelihood estimate in variance components models
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Errors in the proof of Theorem 3.1 in the article of Demidenko and Massam (Sankhy\=a 61, 1999), giving a necessary and sufficient condition for the existence of the maximum likelihood estimate in this ...
In the paper, the problem of the existence of the maximum likelihood estimate and the REML estimate in the variance components model is considered. ...
Unfortunately, the proof of this fact, stated as Proposition 3.2 in [1], is not quite correct.Comments on Demidenko and Massam's proof We will restate Proposition 3.2 in [1] as the following
Proposition ...
arXiv:1410.4787v2
fatcat:mup5ifbnbjba7o2z2jhiaikisu
Maximum Realizability for Linear Temporal Logic Specifications
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A common specification pattern in such applications consists of an LTL formula describing the requirements on the behaviour of the system, together with a set of additional desirable properties. ...
We evaluate our algorithm on scenarios from robotics and power distribution networks. ...
The approach to maximum realizability that we develop is based on the bounded synthesis technique. ...
arXiv:1804.00415v1
fatcat:ofmete4uord3rnf5krtccp6b7y
Distributed model predictive control of nonlinear systems with input constraints
2009
2009 American Control Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
time in which the loop is open is shorter than a given constant that depends on the parameters of the system and the Lyapunov-based controller that is used to formulate the optimization problem. ...
In this work, we focus on model predictive control of nonlinear systems subject to data losses. ...
processing, particulate processes, biological systems, water systems and fluid flows. ...
doi:10.1109/acc.2009.5160095
dblp:conf/amcc/LiuPC09
fatcat:balbk4bernfp3knibj2yk4la4e
Mixed Initiative Control of Autonomous Vehicles
2007
Engineering of Complex Computer Systems (ICECCS), Proceedings of the IEEE International Conference on
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed controller is based on a new class of navigation function based controllers that posses weak Input-to-State stability properties. ...
The resulting system has analytically guaranteed safety and convergence properties. The feasibility of the proposed methodology is demonstrated through simulation examples and hardware experiments. ...
In view of Proposition 2 we can state the following: Proposition 5: System (15) is aISS Proof: See Appendix F Corollary 1: System 15 is safe, i.e. its trajectories for any measurable u satisfy: z(t, z ...
doi:10.1109/robot.2007.363185
dblp:conf/icra/LoizouK07
fatcat:kve3mh5turd7tpz53hog6u32ra
A model for deadlock detection based on automata and languages theory
1993
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The periodical algorithm for deadlock detection based on this FA has a linear time complexity O(N). ...
The abstraction allows one to model the wait-for-relations between processes as a string of symbols. ...
Strings w E fl satisfy the following fundamental propositions. Propositions 1 and 2 are necessary for allowing a precise model of the wait-for-relations occurring in real systems. ...
doi:10.1016/0898-1221(93)90298-a
fatcat:fu3iw4f325bifn32i2z5nem2fq
The Outcomes of Logic-Based Argumentation Systems under Preferred Semantics
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes the first study on the outcomes under preferred semantics of logic-based argumentation systems that satisfy basic rationality postulates. ...
It focuses on systems that are grounded on Tarskian logics, and delimits the number of preferred extensions they may have. ...
Proposition 2 Let T = (Arg(Σ), R) be an AS s.t. R is conflict-dependent and T satisfies consistency and closure under sub-arguments. For all E ∈ Ext p (T ), Base(E) is consistent. Proof. ...
doi:10.1007/978-3-642-33362-0_6
fatcat:7coflllwgzbtphkqjc6udmqtqa
(s, S) Optimality in Joint Inventory-Pricing Control: An Alternate Approach
2008
Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Our analysis is constructive and is based on a condition that we identify as being key to proving the s S structure. ...
This condition is entirely based on the single-period profit function and the demand model. Our optimality results complement the existing results in this area. ...
This assumption holds, for example, under the additive demand model with backordering in which revenues are received based on total demand and not on demand satisfied. ...
doi:10.1287/opre.1070.0462
fatcat:7d7b3vsyazgrvlxcrqlud4ejoa
Stability Analysis of a Feedback-linearization-based Controller with Saturation: A Tilt Vehicle with the Penguin-inspired Gait Plan
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Saturations in control signal can challenge the stability proof of a feedback-linearization-based controller, even leading the system unstable [1]. ...
Since saturations exist in the control signals, we study the stability based on Lyapunov theory. ...
Proof We will determine based on Equation ( 12 ), ( 23 ) and (24) . ...
arXiv:2111.14456v1
fatcat:lj27lqyhw5bttjp4afkxjqcmgy
Linear non-degeneracy of the 1d blow-up limit in the phase segregation of Bose-Einstein condensates
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This useful non-degeneracy property was previously known only in one and two dimensions. ...
We show that the kernel of the linearization of the blow-up problem at the regular part of the interface that separates segregated BECs is one-dimensional, generated by translations in the normal direction ...
As in [4] , the maximum principle will be applied to the system satisfied by (φ, −ψ) which is cooperative, where (φ, ψ) satisfies (6). ...
arXiv:1802.04754v1
fatcat:a2jn2byujbdk7fafjuhgvhbczm
Differently implicational universal triple I method of (1, 2, 2) type
2010
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Lastly, the response functions of fuzzy systems via universal triple I method are discussed, which demonstrates that the universal triple I method can provide bigger choosing space and get better fuzzy ...
Then, we put emphasis on the FMP-solutions, in which the unified forms of FMP-solutions w.r.t. strongly residual operators and a new idea for getting FMP-solutions w.r.t. infimum are achieved. ...
Similar to the induction process of previous propositions in the present paper and Algorithm 4.4.3 (the triple I method based on R Z ) in [17] , we can prove Proposition 4.6. ...
doi:10.1016/j.camwa.2009.11.016
fatcat:kvl2w2rdcndpfjkhkdsxuk3hye
Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions
2007
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our result is based on a reduction from a multi-prover proof system for MAX-3-COLORING. ...
In the case when the utility of each player is a monotone submodular function, we prove that there is no polynomial time approximation algorithm which approximates the maximum social welfare by a factor ...
In Section 4 we present the hardness of 1 − 1/e based on the k-prover proof system of [11] . ...
doi:10.1007/s00453-007-9105-7
fatcat:jo7odecozrbb7ikluyqsz2se4u
« Previous
Showing results 1 — 15 out of 168,041 results