Combinatorial Methods for String Processing

A mathematical model for job scheduling in a specified context is presented. The model uses both linear programming and combinatorial methods. While designed with a view toward optimization of scheduling of facility and plant operations at the Deep Space Network (DSN) Station at Goldstone, the context is sufficiently general to be widely applicable. The general scheduling problem including options for scheduling objectives is discussed and fundamental parameters identified. Mathematical algorithms for partitioning problems germaine to scheduling are presented. A more detailed description of algorithms and of operational aspects of the model is planned for a later report.

Download Full-text

Transient analysis of M/M/1 queues in discrete time by general server vacations

Journal of Applied Probability ◽

10.2307/3214952 ◽

1994 ◽

Vol 31 (A) ◽

pp. 115-129 ◽

Cited By ~ 6

Author(s):

W. Böhm ◽

S. G. Mohanty

Keyword(s):

Discrete Time ◽

Continuous Time ◽

Transient Analysis ◽

Queueing System ◽

Queueing Model ◽

Discrete Parameter ◽

Server Vacations ◽

Special Case ◽

Combinatorial Methods ◽

Transient And Steady State

In this contribution we consider an M/M/1 queueing model with general server vacations. Transient and steady state analysis are carried out in discrete time by combinatorial methods. Using weak convergence of discrete-parameter Markov chains we also obtain formulas for the corresponding continuous-time queueing model. As a special case we discuss briefly a queueing system with a T-policy operating.

Download Full-text

String Processing

Introduction to Assembly Language Programming ◽

10.1007/978-1-4757-2858-3_9 ◽

1998 ◽

pp. 343-376

Author(s):

Sivarama P. Dandamudi

Keyword(s):

String Processing

Download Full-text

Some Identities Involving the Fubini Polynomials and Euler Polynomials

Mathematics ◽

10.3390/math6120300 ◽

2018 ◽

Vol 6 (12) ◽

pp. 300 ◽

Cited By ~ 4

Author(s):

Guohui Chen ◽

Li Chen

Keyword(s):

Power Series ◽

Second Order ◽

Euler Polynomials ◽

Euler Numbers ◽

Non Linear ◽

Combinatorial Methods

In this paper, we first introduce a new second-order non-linear recursive polynomials U h , i ( x ) , and then use these recursive polynomials, the properties of the power series and the combinatorial methods to prove some identities involving the Fubini polynomials, Euler polynomials and Euler numbers.

Download Full-text

Testing embedded systems using test cases generated through combinatorial techniques

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i2.7.10282 ◽

2018 ◽

Vol 7 (2.7) ◽

pp. 146

Author(s):

Lakshmi Prasad Mudarakola ◽

J K.R. Sastry ◽

V Chandra Prakash

Keyword(s):

Embedded Systems ◽

Embedded System ◽

Traffic Control ◽

Nuclear Reactor ◽

Test Cases ◽

Critical Systems ◽

Daily Lives ◽

Intelligent Devices ◽

Wireless Infrastructure ◽

Combinatorial Methods

Thorough testing of embedded systems is required especially when the systems are related to monitoring and controlling the mission critical and safety critical systems. The embedded systems must be tested comprehensively which include testing hardware, software and both together. Embedded systems are highly intelligent devices that are infiltrating our daily lives such as the mobile in your pocket, and wireless infrastructure behind it, routers, home theatre system, the air traffic control station etc. Software now makes up 90% of the value of these devices. In this paper, authors present different methods to test an embedded system using test cases generated through combinatorial techniques. The experimental results for testing a TMCNRS (Temperature Monitoring and Controlling Nuclear Reactor System) using test cases generated from combinatorial methods are also shown.

Download Full-text