Uniprocessor Feasibility of Sporadic Tasks with Constrained Deadlines is Strongly conp-complete
|
|
- Sibyl Ball
- 5 years ago
- Views:
Transcription
1 Uniprocessor Feasibiity of Sporadic Tasks with Constrained Deadines is Strongy conp-compete Pontus Ekberg and Wang Yi Uppsaa University, Sweden Emai: {pontus.ekberg Abstract Deciding the feasibiity of a sporadic task system on a preemptive uniprocessor is a centra probem in rea-time scheduing theory. The computationa compexity of this probem has been a ong-standing open question. We show that it is conp-compete in the strong sense, even when deadines are constrained. This is achieved by means of a pseudo-poynomia transformation from the strongy NP-hard Simutaneous Congruences Probem to the compement of the feasibiity probem. I. INTRODUCTION We et a sporadic task system be ined as a finite mutiset T of tasks, where each task is a tripe (e, d, p) N 3 +, representing its worst-case execution time, reative deadine and minimum inter-arriva separation (or period), respectivey. A sporadic task generates potentiay unbounded sequences of jobs. A job is an instance of the task s workoad, characterized by a reease time, an execution time and an absoute deadine. A job from task (e, d, p) has execution time not arger than e time units and absoute deadine exacty d time units after its reease time. Reease times of two consecutive jobs from (e, d, p) are separated by at east p time units. A sporadic task system T generates any intereaving of job sequences that can be generated by each of the tasks (e, d, p) T. For a sequence of jobs to be successfuy schedued, every job must be executed for a tota duration equa to its execution time, between its reease time and its absoute deadine. In the foowing we assume a preemptive uniprocessor, meaning that ony one job can be executed at a time, but a job can be paused and resumed at a ater time at no additiona cost. Definition I.1 (Feasibiity). A task system T is feasibe if and ony if there is some scheduing agorithm that wi successfuy schedue a job sequences that can be generated by T. A task system T is said to have impicit deadines if d p for a (e, d, p) T, and said to have constrained deadines if d p for a (e, d, p) T. The utiization U(T) of a task system T is ined as U(T) (e,d,p) T e/p. Liu and Layand [1] showed that a task system T with impicit deadines is feasibe if and ony if U(T) 1, but this is not a sufficient condition with constrained deadines. Dertouzos [] showed that Eariest Deadine First (EDF) is an optima scheduing agorithm on preemptive uniprocessors, which means that the terms feasibiity and EDFscheduabiity can be used interchangeaby here. Theorem I. ([]). A task system T is feasibe if and ony if it is EDF-scheduabe. A reated workoad mode is that of (stricty) periodic tasks, where each task is a quadrupe (s, e, d, p) N N 3 +. The difference to the sporadic task mode is that the reease times of two consecutive jobs from task (s, e, d, p) must be exacty p time units apart, and the reease time of the first job is fixed at time point s. A periodic task system is synchronous if s for a tasks (s, e, d, p), and asynchronous otherwise. It is known [3] that feasibiity testing of sporadic tasks is equay hard as that of synchronous periodic tasks, which means that the terms sporadic and synchronous periodic can be used interchangeaby for the resuts in this paper as we. Theorem I.3 ([3]). A sporadic task system T is feasibe if and ony if the synchronous periodic task system {(, e, d, p) (e, d, p) T} is feasibe. A cassic resut is that the feasibiity probem for asynchronous periodic task systems with constrained deadines is strongy conp-compete [], [5]. Baruah et a. [5], [3] aso deveoped a pseudo-poynomia time agorithm for the specia case of synchronous periodic (or sporadic) task systems with utiization a priori bounded by some constant c < 1. However, the compexity of the genera synchronous case remained open for many years. It was isted as one of five open probems in rea-time scheduing by Baruah and Pruhs [6]. Shorty thereafter it was partiay resoved by Eisenbrand and Rothvoß [7] who showed it to be weaky conp-hard, but the question remained if it aowed a pseudo-poynomia time soution ike the specia case with bounded utiization. Eisenbrand and Rothvoß conjectured that it did, but we show that the feasibiity probem for synchronous periodic task systems with constrained deadines is strongy conp-compete, and thus that it can have no pseudo-poynomia time soution uness P NP. Figure 1 summarizes the current knowedge. Asynchronous periodic tasks Synchronous periodic tasks (or sporadic) Genera case conp-compete in the strong sense. [5] conp-compete in the strong sense (from this work). Utiization bounded by a constant c < 1 conp-compete in the strong sense. [5] There exists a pseudo-poynomia agorithm. [5], [3] Fig. 1. The current knowedge on the feasibiity probem of periodic tasks with constrained deadines on preemptive uniprocessors.
2 II. PRELIMINARIES A. The Simutaneous Congruences Probem The Simutaneous Congruences Probem (SCP) is a number-theoretic decision probem that has been used to estabish severa compexity resuts in rea-time scheduing theory. Definition II.1 (The Simutaneous Congruences Probem). An instance is ined by a mutiset A {(a 1, b 1 ),..., (a n, b n )} and an integer k, such that k n and (a i, b i ) N N + for a i {1,..., n}. The simutaneous congruences probem asks whether there exists a subset A A of at east k eements and an x N, such that x a i (mod b i ) for a (a i, b i ) A. In the remainder of this paper we assume, without oss of generaity, that a i < b i for a (a i, b i ) A. SCP was first shown to be weaky NP-compete by Leung and Whitehead [] via a reduction from CLIQUE, and then used by them to show various hardness resuts concerning fixed-priority scheduing. Leung and Merri [] reduced SCP to the compement of the asynchronous periodic feasibiity probem on uniprocessors, thus showing that probem to be weaky conp-hard. Baruah et a. [5] ater showed that SCP is in fact strongy NP-compete via an aternative reduction from 3-SAT, which then impied the strong conp-hardness of the asynchronous periodic feasibiity probem. Theorem II. ([5]). SCP is strongy NP-compete. B. The Theory of Demand Bound Functions The hardness proof we present in the next section reies heaviy on demand bound functions, and in particuar the foowing, we-known theorem due to Baruah et a. Theorem II.3 ([3], [5]). A sporadic task system T is feasibe on a preemptive uniprocessor if and ony if U(T) 1 and where, dbf(t, ), (1) dbf(t, ) (e,d,p) T ( d p ) + 1 e () is the demand bound function of T in interva engths. As a notationa convenience, et dbf(τ, ) dbf({τ}, ) for any task τ (e, d, p). One of the things that Baruah et a. [3] show using this theorem is that the sporadic feasibiity probem is in conp. A witness to the infeasibiity of a task system is simpy an such that the formua in Eq. (1) is fase (if there exists a witness, we are guaranteed that there is aso one in N representabe with poynomiay many bits). A simiar argument can be made for asynchronous periodic tasks. Theorem II. ([3], [5]). The feasibiity probem for periodic tasks, both synchronous and asynchronous, is in conp. III. THE HARDNESS OF SPORADIC FEASIBILITY Here we wi show the strong conp-hardness of the feasibiity probem for sporadic tasks on preemptive uniprocessors. This is achieved by means of a pseudo-poynomia transformation (as ined by Garey and Johnson [9]) from SCP to the compement of the feasibiity probem. A. Overview of the Transformation First we describe the intuition behind the transformation. In Figure we have marked aong a number ine the x N such that x a i (mod b i ), for four exampe pairs (a i, b i ). (, ) (, 6) (3, ) (, 3) Fig.. Congruence casses a i moduo b i for the four different pairs (a i, b i ) A, where A {(, ), (, 6), (3, ), (, 3)}. It is cear from the figure that there are severa x N beonging to two congruence casses simutaneousy, but it can be shown that there is no x beonging to three. Thus, (A, ) is a yes-instance and (A, 3) is a no-instance of SCP. We woud ike to somehow match the structure of these congruence casses with demand bound functions. For each pair (a i, b i ) we want to create a demand bound function (in interva engths ) that is highy reguar, but has hard points of sighty increased demand at those that in some given way are reated to the congruence cass of a i moduo b i. If we have two such functions, their hard points shoud aign at exacty those reated to both congruences casses. Figure 3 iustrates this basic idea. The goa is to take any instance (A, k) of SCP and create A such functions that, when summed, resut in a vioation of Eq. (1) at some if and ony if at east k of them aign such hard points at. (, ) (, 6) Locay increased demand at a reated to the congruence cass of moduo. Asymptotic utiization of 1/ A Hard points aign at a reated to both congruence casses Fig. 3. Conceptua demand bound functions corresponding to the two pairs (, ) and (, 6) from A. The marked areas are where we want sighty increased demand. Note that these functions do not match exacty those that we wi get from the transformation. x
3 B. Encoding into Task Systems We now show how the high-eve idea for a transformation that was presented in the ast section is encoded with actua task systems. It does not appear possibe to capture the structure of a congruence cass in a way that achieves our goas using ony a singe sporadic task. We can, however, create a set of tasks that have the sought structure in its (joint) demand bound function. The detais of this foow. Definition III.1 (Transformation from SCP to (in-)feasibiity). The transformation takes an arbitrary instance (A, k) of SCP, where A {(a 1, b 1 ),..., (a n, b n )}, and produces a sporadic task system T (A,k). For each (a i, b i ) A, we create the foowing set of b i constrained-deadine sporadic tasks: { } τ y (a y {1,..., b i,b i) i}, where τ y (a i,b i) T (ai,b i) The mutiset (1, a i n + k 1, ), if y a i + 1, (1, yn, ), otherwise. T (A,k) is the produced task system. (3) T (ai,b i) () Each task set T (ai,b i) has a highy reguar demand bound function, where the hard points are encoded in the sighty shorter deadine of the task τ ai+1 (a i,b i). Figure shows the demand bound function of a generated set of tasks T (ai,b i), corresponding to some (a i, b i ) A. It can be noted that it has the same genera structure as the conceptua functions shown in Figure 3. Note that the number of tasks in T (A,k), as we as the vaues of their parameters, are bounded by some two-variabe poynomia in the size and the maximum numerica vaue found in the corresponding SCP instance (A, k). Aso, the transformation can triviay be computed in time bounded by such a poynomia. To estabish that the above is a vaid pseudo-poynomia transformation, what remains to be shown is that T (A,k) is a no-instance of the feasibiity probem if and ony if (A, k) is a yes-instance of SCP. We show this in the next section. C. Correctness of the Transformation Before showing that the transformation in Definition III.1 is correct, we need to prove two auxiiary emmas about the characteristics of the demand bound functions of the generated task systems. The first of the emmas is about the identity property of the demand bound functions at a points {, n, n, 3n,...}. 6 dbf(τ(,) 1, ) n 1n n 3n n 5n 6n 7n n 9n a in b in (a i + b i)n b in 6 dbf(τ(,), ) n 1n n 3n n 5n 6n 7n n 9n a in b in (a i + b i)n b in 6 dbf(τ(,) 3, ) n 1n n 3n n 5n 6n 7n n 9n a in b in (a i + b i)n b in 6 dbf(τ(,), ) n 1n n 3n n 5n 6n 7n n 9n a in b in (a i + b i)n b in 1 dbf(t (,), ) 6 k 1 n 1n n 3n n 5n 6n 7n n 9n a in b in (a i + b i)n b in Fig.. The demand bound functions for the tasks in T (,), generated from an SCP instance (A, k) where A n and k 3. The top four functions are the demand bound functions for the individua tasks. The dotted function is for the task τ(,) 3, which is ined by the specia case in Eq. (3). At the bottom is the sum of their demand bound functions, dbf(t (,), ). Note that dbf(t (,), ) has fixed size steps of width n, except for those corresponding to steps of dbf(τ(,) 3, ), which occur ony k 1 points away from the preceding steps. These shorter steps make up the hard points that we envisioned earier. Lemma III. (Identity of demand). Let (A, k) be any SCP instance, where A {(a 1, b 1 ),... (a n, b n )}, and et x N be any natura number. Then, dbf(t (A,k), xn) xn. Proof: Consider any pair (a i, b i ) A. By construction, a tasks (e, d, p) T (ai,b i) have e 1 and p. By putting these vaues in Eq. () we get ( ) xn d dbf(t (ai,b i), xn) + 1. (e,d,p) T (ai,b i )
4 Let ω be the remainder of x divided by b i, ω x x/b i b i. Now, take any of the tasks (e, d, p) T (ai,b i), and observe that because d p, we have xn d x + 1 d + 1 b i x + ω d + 1 b i b i x + ωn d + 1 b i x/b i + 1, if d ωn, x/b i, otherwise. How many of the tasks (e, d, p) T (ai,b i) have d ωn? From Eq. (3) it is cear that the ony tasks (e, d, p) T (ai,b i) with d ωn are the tasks τ y (a i,b i) for which y {1,..., ω}. Hence, ω out of the b i tasks in T (ai,b i) have d ωn, and dbf(t (ai,b i), xn) x/b i (b i ω) + ( x/b i + 1) ω x/b i b i + ω (5) x/b i b i + x x/b i b i x. From Eq. (), () and (5) we concude that dbf(t (A,k), xn) dbf(t (ai,b i), xn) xn, which is the caim of the emma. The second auxiiary emma is about the increased demand of task sets T (ai,b i) for a interva engths that are reated to the congruence cass of a i moduo b i. In particuar, for a xn + k 1, where x a i (mod b i ). Lemma III.3 (Increased demand at congruences). Let (A, k) be any SCP instance, where A {(a 1, b 1 ),... (a n, b n )}, and et x N be any natura number. Then, x + 1, if x a i (mod b i ), dbf(t (ai,b i), xn + k 1) x, otherwise, for a (a i, b i ) A. Proof: Let xn + k 1. Again, by construction we have e 1 and p for a (e, d, p) T (ai,b i), and therefore ( dbf(t (ai,b i), ) d ) + 1. (e,d,p) T (ai,b i ) Let ω x x/b i b i be ined as before. Take any (e, d, p) T (ai,b i) and note that d k + 1 p. Hence, d xn (d k + 1) x/b i, if d k + 1 ωn, x/b i 1, otherwise. We rewrite this to obtain d x/b i + 1, if d ωn + k 1, + 1 x/b i, otherwise. From Eq. (3) it is cear that if ω a i, then d ωn + k 1 hods for a the tasks τ y (a T i,b i) (a i,b i), such that y ω. However, if ω a i, then d ωn + k 1 additionay hods for τ ai+1 (a i,b i). Hence, if we et α denote the number of tasks (e, d, p) T (ai,b i) for which d ωn + k 1 hods, then ω + 1, if ω a i, α ω, otherwise. By the inition of ω as the remainder of x divided by b i, we have ω a i if and ony if x a i (mod b i ). Thus, we can rewrite the above as x x/b i b i + 1, if x a i (mod b i ), α x x/b i b i, otherwise. By appying simiar steps as in Eq. (5), we concude that dbf(t (ai,b i), ) x/b i (b i α) + ( x/b i + 1) α from which the emma foows. x/b i b i + α x + 1, if x a i (mod b i ), x, otherwise, We can now prove the correctness of the transformation. Lemma III. (Vaidity of transformation). For any SCP instance (A, k), the corresponding task system T (A,k) is infeasibe if and ony if (A, k) is a yes-instance. Proof: Let A {(a 1, b 1 ),..., (a n, b n )}. First we note that U(T (ai,b i)) 1/n for any (a i, b i ) A, and consequenty that U(T (A,k) ) 1. By Theorem II.3 it foows that the feasibiity of T (A,k) is exacty decided by the truth vaue of the formua in Eq. (1). We prove the two directions of the emma separatey, beginning with the if-case. Figure 5 serves as an iustration. (A, k) is a yes-instance T (A,k) is infeasibe: By assumption, there is a subset A A of size at east k and an x N, such that x a i (mod b i ) for a (a i, b i ) A. Without oss of generaity, et that A be the argest such subset.
5 Let assumptions, we have xn + k 1. By Lemma III.3 and the above dbf(t (ai,b i), ) x + 1, if (a i, b i ) A, x, otherwise. Because A k, it foows that dbf(t (A,k), ) dbf(t (ai,b i), ) xn + k >, and T (A,k) is infeasibe by Theorem II.3. (A, k) is a no-instance T (A,k) is feasibe: From Eq. () it is cear that dbf(t (A,k), ) is a rightcontinuous, non-decreasing step function in. Let be the set of points at which this function changes vaue, incuding point : { dbf(t (A,k), ) is discontinuous at } {} It is easiy seen that if there exists some such that dbf(t (A,k), ) >, then there must exist some such that dbf(t (A,k), ) >. Hence, by showing that dbf(t (A,k), ) for a, we can concude that there exists no such that dbf(t (A,k), ) >. In order to do so we need to find a more concrete characterization of. Note that from Eq. (3) we know that for a tasks (e, d, p) T (A,k) we have p bn, for some b N, d {yn, yn + k 1}, for some y N. By the inition of demand bound functions given in Eq. (), it foows that the points at which dbf(t (A,k), ) is discontinuous are of the form xn or xn + k 1 for some x N, and therefore {xn x N} {xn + k 1 x N}. From Lemma III. we directy have dbf(t (A,k), ), for a {xn x N}. Consider instead any xn + k 1, where x N. By Lemma III.3, we know that for any (a i, b i ) A, dbf(t (ai,b i), x + 1, if x a i (mod b i ), ) x, otherwise, Now, by assumption, (A, k) is a no-instance of SCP. It foows that there are at most k 1 pairs (a i, b i ) A such that x a i (mod b i ). Hence, dbf(t (A,k), ) dbf(t (ai,b i), ) xn + k 1, for a {xn + k 1 x N}. 1 1n + 1 n n n 6n n 1n 1n 1n 1 dbf(t (,), ) n n n 6n n 1n 1n 1n 1 dbf(t (,6), ) n n n 6n n 1n 1n 1n 1 dbf(t (3,), ) dbf(t (,3), ) n n n 6n n 1n 1n 1n Fig. 5. Demand bound functions for task sets generated from an SCP instance (A, k), where A {(, ), (, 6), (3, ), (, 3)} and k. As we have seen in Figure, (A, ) is a yes-instance of SCP and therefore T (A,) shoud be infeasibe. Indeed, for any x beonging to two of A s congruence casses (such as x 1) we have two eary steps in the corresponding demand bound functions aigning at xn + 1, and dbf(t (A,), ) + 1. If instead k 3, then the eary steps woud move one unit to the right in the figures, and two such steps aigning at some xn is no onger enough to witness infeasibiity, because dbf(t (A,3), ). In concusion, we have shown that dbf(t (A,k), ) for a, and consequenty for a. The feasibiity of T (A,k) is ensured by Theorem II.3. Our main theorem foows. Theorem III.5 (Intractabiity). Deciding whether a sporadic task system with constrained deadines is feasibe on a preemptive uniprocessor is conp-compete in the strong sense. Proof: There is a pseudo-poynomia transformation from SCP to the compement of the feasibiity probem. By Theorems II. and II. we know that SCP is strongy NP-hard and that the feasibiity probem is in conp.
6 IV. CONCLUSIONS We have showed that there can be no pseudo-poynomia time agorithm for deciding the feasibiity of constraineddeadine sporadic task systems on a preemptive uniprocessor, uness P NP. This highights the inherent practica importance of the specia case where the utiization of the task system is a priori bounded by some constant c < 1, for which Baruah et a. [3] have described a pseudo-poynomia time feasibiity test. This test (or variations thereof) is widey used in the iterature and has proven to be quite tractabe, at east for off-ine anaysis, even for arge c such as.9 or.95. An important outstanding question is whether this specia case aso has a poynomia time soution. REFERENCES [1] C. L. Liu and J. W. Layand, Scheduing agorithms for mutiprogramming in a hard-rea-time environment, Journa of the ACM, vo., no. 1, pp. 6 61, [] M. L. Dertouzos, Contro robotics: The procedura contro of physica processes, in Proceedings of the IFIP congress, vo. 7, 197, pp [3] S. Baruah, A. Mok, and L. Rosier, Preemptivey scheduing hard-reatime sporadic tasks on one processor, in Proceedings of the Rea-Time Systems Symposium (RTSS), 199, pp [] J. Y.-T. Leung and M. Merri, A note on preemptive scheduing of periodic, rea-time tasks, Information Processing Letters, vo. 11, no. 3, pp , 19. [5] S. K. Baruah, L. E. Rosier, and R. R. Howe, Agorithms and compexity concerning the preemptive scheduing of periodic, rea-time tasks on one processor, Rea-Time Systems, vo., no., pp. 31 3, 199. [6] S. Baruah and K. Pruhs, Open probems in rea-time scheduing, Journa of Scheduing, vo. 13, no. 6, pp , 1. [7] F. Eisenbrand and T. Rothvoß, EDF-scheduabiity of synchronous periodic task systems is conp-hard, in Proceedings of the ACM-SIAM Symposium on Discrete Agorithms (SODA), 1, pp [] J. Y.-T. Leung and J. Whitehead, On the compexity of fixed-priority scheduing of periodic, rea-time tasks, Performance Evauation, vo., no., pp. 37 5, 19. [9] M. R. Garey and D. S. Johnson, Strong NP-competeness resuts: Motivation, exampes, and impications, Journa of the ACM, vo. 5, no. 3, pp. 99 5, 197.
Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources (WSU-CS Technical Report Version)
Approximate Bandwidth Aocation for Fixed-Priority-Schedued Periodic Resources WSU-CS Technica Report Version) Farhana Dewan Nathan Fisher Abstract Recent research in compositiona rea-time systems has focused
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea-Time Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process
More informationXSAT of linear CNF formulas
XSAT of inear CN formuas Bernd R. Schuh Dr. Bernd Schuh, D-50968 Kön, Germany; bernd.schuh@netcoogne.de eywords: compexity, XSAT, exact inear formua, -reguarity, -uniformity, NPcompeteness Abstract. Open
More informationSchedulability Analysis of Deferrable Scheduling Algorithms for Maintaining Real-Time Data Freshness
1 Scheduabiity Anaysis of Deferrabe Scheduing Agorithms for Maintaining Rea- Data Freshness Song Han, Deji Chen, Ming Xiong, Kam-yiu Lam, Aoysius K. Mok, Krithi Ramamritham UT Austin, Emerson Process Management,
More informationA Schedulability Analysis of Deferrable Scheduling Using Patterns
Euromicro Conference on Rea- Systems A Scheduabiity Anaysis of Deferrabe Scheduing Using Patterns Song Han The University of Texas at Austin shan@cs.utexas.edu Deji Chen Emerson Process Management Deji.Chen@Emerson.com
More informationComplexity of Uniprocessor Scheduling Analysis
Complexity of Uniprocessor Scheduling Analysis Pontus Ekberg and Wang Yi Abstract When designing a real-time system, a schedulability problem must be solved in order to show that it will meet all timing
More informationMultiprocessor Extensions to Real-Time Calculus
Noname manuscript No. (wi be inserted by the editor) Mutiprocessor Extensions to Rea-Time Cacuus Hennadiy Leontyev Samarjit Chakraborty James H. Anderson the date of receipt and acceptance shoud be inserted
More informationA Brief Introduction to Markov Chains and Hidden Markov Models
A Brief Introduction to Markov Chains and Hidden Markov Modes Aen B MacKenzie Notes for December 1, 3, &8, 2015 Discrete-Time Markov Chains You may reca that when we first introduced random processes,
More informationTHE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES
THE REACHABILITY CONES OF ESSENTIALLY NONNEGATIVE MATRICES by Michae Neumann Department of Mathematics, University of Connecticut, Storrs, CT 06269 3009 and Ronad J. Stern Department of Mathematics, Concordia
More informationExplicit overall risk minimization transductive bound
1 Expicit overa risk minimization transductive bound Sergio Decherchi, Paoo Gastado, Sandro Ridea, Rodofo Zunino Dept. of Biophysica and Eectronic Engineering (DIBE), Genoa University Via Opera Pia 11a,
More informationCryptanalysis of PKP: A New Approach
Cryptanaysis of PKP: A New Approach Éiane Jaumes and Antoine Joux DCSSI 18, rue du Dr. Zamenhoff F-92131 Issy-es-Mx Cedex France eiane.jaumes@wanadoo.fr Antoine.Joux@ens.fr Abstract. Quite recenty, in
More informationComponentwise Determination of the Interval Hull Solution for Linear Interval Parameter Systems
Componentwise Determination of the Interva Hu Soution for Linear Interva Parameter Systems L. V. Koev Dept. of Theoretica Eectrotechnics, Facuty of Automatics, Technica University of Sofia, 1000 Sofia,
More informationCS 331: Artificial Intelligence Propositional Logic 2. Review of Last Time
CS 33 Artificia Inteigence Propositiona Logic 2 Review of Last Time = means ogicay foows - i means can be derived from If your inference agorithm derives ony things that foow ogicay from the KB, the inference
More informationarxiv:quant-ph/ v3 6 Jan 1995
arxiv:quant-ph/9501001v3 6 Jan 1995 Critique of proposed imit to space time measurement, based on Wigner s cocks and mirrors L. Diósi and B. Lukács KFKI Research Institute for Partice and Nucear Physics
More informationMinimizing Total Weighted Completion Time on Uniform Machines with Unbounded Batch
The Eighth Internationa Symposium on Operations Research and Its Appications (ISORA 09) Zhangiaie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 402 408 Minimizing Tota Weighted Competion
More informationCS229 Lecture notes. Andrew Ng
CS229 Lecture notes Andrew Ng Part IX The EM agorithm In the previous set of notes, we taked about the EM agorithm as appied to fitting a mixture of Gaussians. In this set of notes, we give a broader view
More informationMARKOV CHAINS AND MARKOV DECISION THEORY. Contents
MARKOV CHAINS AND MARKOV DECISION THEORY ARINDRIMA DATTA Abstract. In this paper, we begin with a forma introduction to probabiity and expain the concept of random variabes and stochastic processes. After
More informationMath 124B January 31, 2012
Math 124B January 31, 212 Viktor Grigoryan 7 Inhomogeneous boundary vaue probems Having studied the theory of Fourier series, with which we successfuy soved boundary vaue probems for the homogeneous heat
More informationOn the Goal Value of a Boolean Function
On the Goa Vaue of a Booean Function Eric Bach Dept. of CS University of Wisconsin 1210 W. Dayton St. Madison, WI 53706 Lisa Heerstein Dept of CSE NYU Schoo of Engineering 2 Metrotech Center, 10th Foor
More informationLecture Note 3: Stationary Iterative Methods
MATH 5330: Computationa Methods of Linear Agebra Lecture Note 3: Stationary Iterative Methods Xianyi Zeng Department of Mathematica Sciences, UTEP Stationary Iterative Methods The Gaussian eimination (or
More informationOn colorings of the Boolean lattice avoiding a rainbow copy of a poset arxiv: v1 [math.co] 21 Dec 2018
On coorings of the Booean attice avoiding a rainbow copy of a poset arxiv:1812.09058v1 [math.co] 21 Dec 2018 Baázs Patkós Afréd Rényi Institute of Mathematics, Hungarian Academy of Scinces H-1053, Budapest,
More informationCONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION
CONJUGATE GRADIENT WITH SUBSPACE OPTIMIZATION SAHAR KARIMI AND STEPHEN VAVASIS Abstract. In this paper we present a variant of the conjugate gradient (CG) agorithm in which we invoke a subspace minimization
More informationarxiv: v1 [math.co] 17 Dec 2018
On the Extrema Maximum Agreement Subtree Probem arxiv:1812.06951v1 [math.o] 17 Dec 2018 Aexey Markin Department of omputer Science, Iowa State University, USA amarkin@iastate.edu Abstract Given two phyogenetic
More informationThe Price of Bounded Preemption
The Price of Bounded Preemption ABSTRACT Noga Aon * Te-Aviv University Te-Aviv, Israe Princeton University Princeton, New Jersey, USA nogaa@post.tau.ac.i In this paper we provide a tight bound for the
More informationThe Group Structure on a Smooth Tropical Cubic
The Group Structure on a Smooth Tropica Cubic Ethan Lake Apri 20, 2015 Abstract Just as in in cassica agebraic geometry, it is possibe to define a group aw on a smooth tropica cubic curve. In this note,
More informationShort Circuit Detection Utilization Analysis under Uniprocessor EDF Scheduling
Short Circuit Detection Utiization Anaysis under Uniprocessor EDF Scheduing Aaron Wicock Department of Computer Science Wayne State University Detroit, Michigan 48202 aaron.wicock@wayne.edu Abstract Accounting
More informationCombining reaction kinetics to the multi-phase Gibbs energy calculation
7 th European Symposium on Computer Aided Process Engineering ESCAPE7 V. Pesu and P.S. Agachi (Editors) 2007 Esevier B.V. A rights reserved. Combining reaction inetics to the muti-phase Gibbs energy cacuation
More informationStochastic Complement Analysis of Multi-Server Threshold Queues. with Hysteresis. Abstract
Stochastic Compement Anaysis of Muti-Server Threshod Queues with Hysteresis John C.S. Lui The Dept. of Computer Science & Engineering The Chinese University of Hong Kong Leana Goubchik Dept. of Computer
More informationIntegrating Factor Methods as Exponential Integrators
Integrating Factor Methods as Exponentia Integrators Borisav V. Minchev Department of Mathematica Science, NTNU, 7491 Trondheim, Norway Borko.Minchev@ii.uib.no Abstract. Recenty a ot of effort has been
More informationMaximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problem
1 Maximum ikeihood decoding of treis codes in fading channes with no receiver CSI is a poynomia-compexity probem Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department
More informationSeparation of Variables and a Spherical Shell with Surface Charge
Separation of Variabes and a Spherica She with Surface Charge In cass we worked out the eectrostatic potentia due to a spherica she of radius R with a surface charge density σθ = σ cos θ. This cacuation
More informationOn Bounded Nondeterminism and Alternation
On Bounded Nondeterminism and Aternation Mathias Hauptmann May 4, 2016 Abstract We continue our work on the combination of variants of McCreight and Meyer s Union Theorem with separation resuts aong the
More informationConvergence Property of the Iri-Imai Algorithm for Some Smooth Convex Programming Problems
Convergence Property of the Iri-Imai Agorithm for Some Smooth Convex Programming Probems S. Zhang Communicated by Z.Q. Luo Assistant Professor, Department of Econometrics, University of Groningen, Groningen,
More informationPrimal and dual active-set methods for convex quadratic programming
Math. Program., Ser. A 216) 159:469 58 DOI 1.17/s117-15-966-2 FULL LENGTH PAPER Prima and dua active-set methods for convex quadratic programming Anders Forsgren 1 Phiip E. Gi 2 Eizabeth Wong 2 Received:
More informationEfficiently Generating Random Bits from Finite State Markov Chains
1 Efficienty Generating Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationMat 1501 lecture notes, penultimate installment
Mat 1501 ecture notes, penutimate instament 1. bounded variation: functions of a singe variabe optiona) I beieve that we wi not actuay use the materia in this section the point is mainy to motivate the
More informationThe ordered set of principal congruences of a countable lattice
The ordered set of principa congruences of a countabe attice Gábor Czédi To the memory of András P. Huhn Abstract. For a attice L, et Princ(L) denote the ordered set of principa congruences of L. In a
More informationFirst-Order Corrections to Gutzwiller s Trace Formula for Systems with Discrete Symmetries
c 26 Noninear Phenomena in Compex Systems First-Order Corrections to Gutzwier s Trace Formua for Systems with Discrete Symmetries Hoger Cartarius, Jörg Main, and Günter Wunner Institut für Theoretische
More informationOnline Load Balancing on Related Machines
Onine Load Baancing on Reated Machines ABSTRACT Sungjin Im University of Caifornia at Merced Merced, CA, USA sim3@ucmerced.edu Debmaya Panigrahi Duke University Durham, NC, USA debmaya@cs.duke.edu We give
More informationHonors Thesis Bounded Query Functions With Limited Output Bits II
Honors Thesis Bounded Query Functions With Limited Output Bits II Daibor Zeený University of Maryand, Batimore County May 29, 2007 Abstract We sove some open questions in the area of bounded query function
More informationCONSISTENT LABELING OF ROTATING MAPS
CONSISTENT LABELING OF ROTATING MAPS Andreas Gemsa, Martin Nöenburg, Ignaz Rutter Abstract. Dynamic maps that aow continuous map rotations, for exampe, on mobie devices, encounter new geometric abeing
More informationSome Measures for Asymmetry of Distributions
Some Measures for Asymmetry of Distributions Georgi N. Boshnakov First version: 31 January 2006 Research Report No. 5, 2006, Probabiity and Statistics Group Schoo of Mathematics, The University of Manchester
More informationProblem set 6 The Perron Frobenius theorem.
Probem set 6 The Perron Frobenius theorem. Math 22a4 Oct 2 204, Due Oct.28 In a future probem set I want to discuss some criteria which aow us to concude that that the ground state of a sef-adjoint operator
More informationC. Fourier Sine Series Overview
12 PHILIP D. LOEWEN C. Fourier Sine Series Overview Let some constant > be given. The symboic form of the FSS Eigenvaue probem combines an ordinary differentia equation (ODE) on the interva (, ) with a
More informationStatistical Inference, Econometric Analysis and Matrix Algebra
Statistica Inference, Econometric Anaysis and Matrix Agebra Bernhard Schipp Water Krämer Editors Statistica Inference, Econometric Anaysis and Matrix Agebra Festschrift in Honour of Götz Trenker Physica-Verag
More informationAdvanced Hierarchical Event-Stream Model
Advanced Hierarchica Event-Stream Mode Karsten Abers, Frank Bodmann and Frank Somka Embedded Systems / Rea-ime Systems, Um University name.surname}@uni-um.de Abstract Anayzing future distributed rea-time
More informationMONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES
MONOCHROMATIC LOOSE PATHS IN MULTICOLORED k-uniform CLIQUES ANDRZEJ DUDEK AND ANDRZEJ RUCIŃSKI Abstract. For positive integers k and, a k-uniform hypergraph is caed a oose path of ength, and denoted by
More informationNew Efficiency Results for Makespan Cost Sharing
New Efficiency Resuts for Makespan Cost Sharing Yvonne Beischwitz a, Forian Schoppmann a, a University of Paderborn, Department of Computer Science Fürstenaee, 3302 Paderborn, Germany Abstract In the context
More informationAn Algorithm for Pruning Redundant Modules in Min-Max Modular Network
An Agorithm for Pruning Redundant Modues in Min-Max Moduar Network Hui-Cheng Lian and Bao-Liang Lu Department of Computer Science and Engineering, Shanghai Jiao Tong University 1954 Hua Shan Rd., Shanghai
More informationOptimal Control of Assembly Systems with Multiple Stages and Multiple Demand Classes 1
Optima Contro of Assemby Systems with Mutipe Stages and Mutipe Demand Casses Saif Benjaafar Mohsen EHafsi 2 Chung-Yee Lee 3 Weihua Zhou 3 Industria & Systems Engineering, Department of Mechanica Engineering,
More informationMATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES
MATH 172: MOTIVATION FOR FOURIER SERIES: SEPARATION OF VARIABLES Separation of variabes is a method to sove certain PDEs which have a warped product structure. First, on R n, a inear PDE of order m is
More informationEfficient Generation of Random Bits from Finite State Markov Chains
Efficient Generation of Random Bits from Finite State Markov Chains Hongchao Zhou and Jehoshua Bruck, Feow, IEEE Abstract The probem of random number generation from an uncorreated random source (of unknown
More informationAsynchronous Control for Coupled Markov Decision Systems
INFORMATION THEORY WORKSHOP (ITW) 22 Asynchronous Contro for Couped Marov Decision Systems Michae J. Neey University of Southern Caifornia Abstract This paper considers optima contro for a coection of
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 2, FEBRUARY
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO. 2, FEBRUARY 206 857 Optima Energy and Data Routing in Networks With Energy Cooperation Berk Gurakan, Student Member, IEEE, OmurOze,Member, IEEE,
More informationIN MODERN embedded systems, the ever-increasing complexity
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 37, NO., JANUARY 208 2 Muticore Mixed-Criticaity Systems: Partitioned Scheduing and Utiization Bound Jian-Jun Han, Member,
More informationA. Distribution of the test statistic
A. Distribution of the test statistic In the sequentia test, we first compute the test statistic from a mini-batch of size m. If a decision cannot be made with this statistic, we keep increasing the mini-batch
More informationORTHOGONAL MULTI-WAVELETS FROM MATRIX FACTORIZATION
J. Korean Math. Soc. 46 2009, No. 2, pp. 281 294 ORHOGONAL MLI-WAVELES FROM MARIX FACORIZAION Hongying Xiao Abstract. Accuracy of the scaing function is very crucia in waveet theory, or correspondingy,
More informationVALIDATED CONTINUATION FOR EQUILIBRIA OF PDES
VALIDATED CONTINUATION FOR EQUILIBRIA OF PDES SARAH DAY, JEAN-PHILIPPE LESSARD, AND KONSTANTIN MISCHAIKOW Abstract. One of the most efficient methods for determining the equiibria of a continuous parameterized
More informationRecursive Constructions of Parallel FIFO and LIFO Queues with Switched Delay Lines
Recursive Constructions of Parae FIFO and LIFO Queues with Switched Deay Lines Po-Kai Huang, Cheng-Shang Chang, Feow, IEEE, Jay Cheng, Member, IEEE, and Duan-Shin Lee, Senior Member, IEEE Abstract One
More informationIntegrality ratio for Group Steiner Trees and Directed Steiner Trees
Integraity ratio for Group Steiner Trees and Directed Steiner Trees Eran Haperin Guy Kortsarz Robert Krauthgamer Aravind Srinivasan Nan Wang Abstract The natura reaxation for the Group Steiner Tree probem,
More informationChapter 4. Moving Observer Method. 4.1 Overview. 4.2 Theory
Chapter 4 Moving Observer Method 4.1 Overview For a compete description of traffic stream modeing, one woud reuire fow, speed, and density. Obtaining these parameters simutaneousy is a difficut task if
More informationDistributed average consensus: Beyond the realm of linearity
Distributed average consensus: Beyond the ream of inearity Usman A. Khan, Soummya Kar, and José M. F. Moura Department of Eectrica and Computer Engineering Carnegie Meon University 5 Forbes Ave, Pittsburgh,
More informationThe Partition Function and Ramanujan Congruences
The Partition Function and Ramanujan Congruences Eric Bucher Apri 7, 010 Chapter 1 Introduction The partition function, p(n), for a positive integer n is the number of non-increasing sequences of positive
More informationII. PROBLEM. A. Description. For the space of audio signals
CS229 - Fina Report Speech Recording based Language Recognition (Natura Language) Leopod Cambier - cambier; Matan Leibovich - matane; Cindy Orozco Bohorquez - orozcocc ABSTRACT We construct a rea time
More informationVALIDATED CONTINUATION FOR EQUILIBRIA OF PDES
SIAM J. NUMER. ANAL. Vo. 0, No. 0, pp. 000 000 c 200X Society for Industria and Appied Mathematics VALIDATED CONTINUATION FOR EQUILIBRIA OF PDES SARAH DAY, JEAN-PHILIPPE LESSARD, AND KONSTANTIN MISCHAIKOW
More informationTHINKING IN PYRAMIDS
ECS 178 Course Notes THINKING IN PYRAMIDS Kenneth I. Joy Institute for Data Anaysis and Visuaization Department of Computer Science University of Caifornia, Davis Overview It is frequenty usefu to think
More informationAST 418/518 Instrumentation and Statistics
AST 418/518 Instrumentation and Statistics Cass Website: http://ircamera.as.arizona.edu/astr_518 Cass Texts: Practica Statistics for Astronomers, J.V. Wa, and C.R. Jenkins, Second Edition. Measuring the
More informationAPPENDIX C FLEXING OF LENGTH BARS
Fexing of ength bars 83 APPENDIX C FLEXING OF LENGTH BARS C.1 FLEXING OF A LENGTH BAR DUE TO ITS OWN WEIGHT Any object ying in a horizonta pane wi sag under its own weight uness it is infinitey stiff or
More informationLinear Network Coding for Multiple Groupcast Sessions: An Interference Alignment Approach
Linear Network Coding for Mutipe Groupcast Sessions: An Interference Aignment Approach Abhik Kumar Das, Siddhartha Banerjee and Sriram Vishwanath Dept. of ECE, The University of Texas at Austin, TX, USA
More informationKing Fahd University of Petroleum & Minerals
King Fahd University of Petroeum & Mineras DEPARTMENT OF MATHEMATICAL SCIENCES Technica Report Series TR 369 December 6 Genera decay of soutions of a viscoeastic equation Saim A. Messaoudi DHAHRAN 3161
More informationOn the evaluation of saving-consumption plans
On the evauation of saving-consumption pans Steven Vanduffe Jan Dhaene Marc Goovaerts Juy 13, 2004 Abstract Knowedge of the distribution function of the stochasticay compounded vaue of a series of future
More informationu(x) s.t. px w x 0 Denote the solution to this problem by ˆx(p, x). In order to obtain ˆx we may simply solve the standard problem max x 0
Bocconi University PhD in Economics - Microeconomics I Prof M Messner Probem Set 4 - Soution Probem : If an individua has an endowment instead of a monetary income his weath depends on price eves In particuar,
More informationA Comparison Study of the Test for Right Censored and Grouped Data
Communications for Statistica Appications and Methods 2015, Vo. 22, No. 4, 313 320 DOI: http://dx.doi.org/10.5351/csam.2015.22.4.313 Print ISSN 2287-7843 / Onine ISSN 2383-4757 A Comparison Study of the
More informationReichenbachian Common Cause Systems
Reichenbachian Common Cause Systems G. Hofer-Szabó Department of Phiosophy Technica University of Budapest e-mai: gszabo@hps.ete.hu Mikós Rédei Department of History and Phiosophy of Science Eötvös University,
More informationThreshold-Based Admission Control Policies for Multimedia Servers
Threshod-Based Admission Contro Poicies for Mutimedia Servers ING-RAY CHEN AND CHI-MING CHEN Institute of Information Engineering, Nationa Cheng Kung University, Tainan, Taiwan, ROC Emai: irchen@iie.ncku.edu.tw
More information4 Separation of Variables
4 Separation of Variabes In this chapter we describe a cassica technique for constructing forma soutions to inear boundary vaue probems. The soution of three cassica (paraboic, hyperboic and eiptic) PDE
More information8 Digifl'.11 Cth:uits and devices
8 Digif'. Cth:uits and devices 8. Introduction In anaog eectronics, votage is a continuous variabe. This is usefu because most physica quantities we encounter are continuous: sound eves, ight intensity,
More informationRobust Sensitivity Analysis for Linear Programming with Ellipsoidal Perturbation
Robust Sensitivity Anaysis for Linear Programming with Eipsoida Perturbation Ruotian Gao and Wenxun Xing Department of Mathematica Sciences Tsinghua University, Beijing, China, 100084 September 27, 2017
More informationMath 124B January 17, 2012
Math 124B January 17, 212 Viktor Grigoryan 3 Fu Fourier series We saw in previous ectures how the Dirichet and Neumann boundary conditions ead to respectivey sine and cosine Fourier series of the initia
More informationY Y Y Y EC(; Y ) T(; Y ) T?1 (; Y ) Y Y Y Y DC(; Y ) PO(; Y ) EQ(; Y ) NT(; Y ) NT?1 (; Y ) Figure 1: Two-dimensiona exampes for the eight base reatio
To appear in Proc. 15th Internationa Joint Conference on Articia Inteigence (IJCAI'97), Nagoya, Japan, August 1997 On the Compexity of Quaitative Spatia Reasoning: A Maxima Tractabe Fragment of the Region
More informationFeasible Itemset Distributions in Data Mining: Theory and Application
Feasibe Itemset Distributions in Data Mining: Theory and Appication Ganesh Ramesh Dept. of Computer Science University at Abany, SUNY Abany, NY 12222, USA ganesh@cs.abany.edu Wiiam A. Maniatty Dept. of
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Approximated MLC shape matrix decomposition with intereaf coision constraint Thomas Kainowski Antje Kiese Abstract Shape matrix decomposition is a subprobem in radiation therapy panning. A given fuence
More informationBiometrics Unit, 337 Warren Hall Cornell University, Ithaca, NY and. B. L. Raktoe
NONISCMORPHIC CCMPLETE SETS OF ORTHOGONAL F-SQ.UARES, HADAMARD MATRICES, AND DECCMPOSITIONS OF A 2 4 DESIGN S. J. Schwager and w. T. Federer Biometrics Unit, 337 Warren Ha Corne University, Ithaca, NY
More informationTranscendence of stammering continued fractions. Yann BUGEAUD
Transcendence of stammering continued fractions Yann BUGEAUD To the memory of Af van der Poorten Abstract. Let θ = [0; a 1, a 2,...] be an agebraic number of degree at east three. Recenty, we have estabished
More informationApproximation and Fast Calculation of Non-local Boundary Conditions for the Time-dependent Schrödinger Equation
Approximation and Fast Cacuation of Non-oca Boundary Conditions for the Time-dependent Schrödinger Equation Anton Arnod, Matthias Ehrhardt 2, and Ivan Sofronov 3 Universität Münster, Institut für Numerische
More informationWeek 6 Lectures, Math 6451, Tanveer
Fourier Series Week 6 Lectures, Math 645, Tanveer In the context of separation of variabe to find soutions of PDEs, we encountered or and in other cases f(x = f(x = a 0 + f(x = a 0 + b n sin nπx { a n
More informationDIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM
DIGITAL FILTER DESIGN OF IIR FILTERS USING REAL VALUED GENETIC ALGORITHM MIKAEL NILSSON, MATTIAS DAHL AND INGVAR CLAESSON Bekinge Institute of Technoogy Department of Teecommunications and Signa Processing
More informationNEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION
NEW DEVELOPMENT OF OPTIMAL COMPUTING BUDGET ALLOCATION FOR DISCRETE EVENT SIMULATION Hsiao-Chang Chen Dept. of Systems Engineering University of Pennsyvania Phiadephia, PA 904-635, U.S.A. Chun-Hung Chen
More informationMultilayer Kerceptron
Mutiayer Kerceptron Zotán Szabó, András Lőrincz Department of Information Systems, Facuty of Informatics Eötvös Loránd University Pázmány Péter sétány 1/C H-1117, Budapest, Hungary e-mai: szzoi@csetehu,
More informationAn approximate method for solving the inverse scattering problem with fixed-energy data
J. Inv. I-Posed Probems, Vo. 7, No. 6, pp. 561 571 (1999) c VSP 1999 An approximate method for soving the inverse scattering probem with fixed-energy data A. G. Ramm and W. Scheid Received May 12, 1999
More informationApproximated MLC shape matrix decomposition with interleaf collision constraint
Agorithmic Operations Research Vo.4 (29) 49 57 Approximated MLC shape matrix decomposition with intereaf coision constraint Antje Kiese and Thomas Kainowski Institut für Mathematik, Universität Rostock,
More informationIterative Decoding Performance Bounds for LDPC Codes on Noisy Channels
Iterative Decoding Performance Bounds for LDPC Codes on Noisy Channes arxiv:cs/060700v1 [cs.it] 6 Ju 006 Chun-Hao Hsu and Achieas Anastasopouos Eectrica Engineering and Computer Science Department University
More informationarxiv: v1 [cs.db] 25 Jun 2013
Communication Steps for Parae Query Processing Pau Beame, Paraschos Koutris and Dan Suciu {beame,pkoutris,suciu}@cs.washington.edu University of Washington arxiv:1306.5972v1 [cs.db] 25 Jun 2013 June 26,
More informationRelated Topics Maxwell s equations, electrical eddy field, magnetic field of coils, coil, magnetic flux, induced voltage
Magnetic induction TEP Reated Topics Maxwe s equations, eectrica eddy fied, magnetic fied of cois, coi, magnetic fux, induced votage Principe A magnetic fied of variabe frequency and varying strength is
More informationDiscrete Techniques. Chapter Introduction
Chapter 3 Discrete Techniques 3. Introduction In the previous two chapters we introduced Fourier transforms of continuous functions of the periodic and non-periodic (finite energy) type, as we as various
More informationIntuitionistic Fuzzy Optimization Technique for Nash Equilibrium Solution of Multi-objective Bi-Matrix Games
Journa of Uncertain Systems Vo.5, No.4, pp.27-285, 20 Onine at: www.jus.org.u Intuitionistic Fuzzy Optimization Technique for Nash Equiibrium Soution of Muti-objective Bi-Matri Games Prasun Kumar Naya,,
More informationConvergence of the spectral measure of non normal matrices
Convergence of the spectra measure of non norma matrices Aice Guionnet Phiip Wood Ofer Zeitouni October, 2 Abstract We discuss reguarization by noise of the spectrum of arge random non- Norma matrices.
More informationCopyright information to be inserted by the Publishers. Unsplitting BGK-type Schemes for the Shallow. Water Equations KUN XU
Copyright information to be inserted by the Pubishers Unspitting BGK-type Schemes for the Shaow Water Equations KUN XU Mathematics Department, Hong Kong University of Science and Technoogy, Cear Water
More informationPartial permutation decoding for MacDonald codes
Partia permutation decoding for MacDonad codes J.D. Key Department of Mathematics and Appied Mathematics University of the Western Cape 7535 Bevie, South Africa P. Seneviratne Department of Mathematics
More informationInvestigation on spectrum of the adjacency matrix and Laplacian matrix of graph G l
Investigation on spectrum of the adjacency matrix and Lapacian matrix of graph G SHUHUA YIN Computer Science and Information Technoogy Coege Zhejiang Wani University Ningbo 3500 PEOPLE S REPUBLIC OF CHINA
More information