**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**702

# Search results for: non-negative integer sampling.

##### 702 Dynamic Slope Scaling Procedure for Stochastic Integer Programming Problem

**Authors:**
Takayuki Shiina

**Abstract:**

**Keywords:**
stochastic programming problem with recourse,
simple
integer recourse,
dynamic slope scaling procedure

##### 701 On the Integer Solutions of the Pell Equation x2 - dy2 = 2t

**Authors:**
Ahmet Tekcan,
Betül Gezer,
Osman Bizim

**Abstract:**

Let k ≥ 1 and t ≥ 0 be two integers and let d = k2 + k be a positive non-square integer. In this paper, we consider the integer solutions of Pell equation x2 - dy2 = 2t. Further we derive a recurrence relation on the solutions of this equation.

**Keywords:**
Pell equation,
Diophantine equation.

##### 700 The Pell Equation x2 − Py2 = Q

**Authors:**
Ahmet Tekcan,
Arzu Özkoç,
Canan Kocapınar,
Hatice Alkan

**Abstract:**

**Keywords:**
Pell equation,
solutions of Pell equation.

##### 699 Accelerating Integer Neural Networks On Low Cost DSPs

**Authors:**
Thomas Behan,
Zaiyi Liao,
Lian Zhao,
Chunting Yang

**Abstract:**

**Keywords:**
Digital Signal Processor (DSP),
Integer Neural Network(INN),
Low Cost Neural Network,
Integer Neural Network DSPImplementation.

##### 698 The Inverse Eigenvalue Problem via Orthogonal Matrices

**Authors:**
A. M. Nazari,
B. Sepehrian,
M. Jabari

**Abstract:**

In this paper we study the inverse eigenvalue problem for symmetric special matrices and introduce sufficient conditions for obtaining nonnegative matrices. We get the HROU algorithm from [1] and introduce some extension of this algorithm. If we have some eigenvectors and associated eigenvalues of a matrix, then by this extension we can find the symmetric matrix that its eigenvalue and eigenvectors are given. At last we study the special cases and get some remarkable results.

**Keywords:**
Householder matrix,
nonnegative matrix,
Inverse eigenvalue problem.

##### 697 Some New Inequalities for Eigenvalues of the Hadamard Product and the Fan Product of Matrices

**Authors:**
Jing Li,
Guang Zhou

**Abstract:**

Let A and B be nonnegative matrices. A new upper bound on the spectral radius ρ(A◦B) is obtained. Meanwhile, a new lower bound on the smallest eigenvalue q(AB) for the Fan product, and a new lower bound on the minimum eigenvalue q(B ◦A−1) for the Hadamard product of B and A−1 of two nonsingular M-matrices A and B are given. Some results of comparison are also given in theory. To illustrate our results, numerical examples are considered.

**Keywords:**
Hadamard product,
Fan product; nonnegative matrix,
M-matrix,
Spectral radius,
Minimum eigenvalue,
1-path cover.

##### 696 Relative Injective Modules and Relative Flat Modules

**Authors:**
Jianmin Xing,
Rufeng Xing

**Abstract:**

Let R be a ring, n a fixed nonnegative integer. The concepts of (n, 0)-FI-injective and (n, 0)-FI-flat modules, and then give some characterizations of these modules over left n-coherent rings are introduced . In addition, we investigate the left and right n-FI-resolutions of R-modules by left (right) derived functors Extn(−,−) (Torn(−,−) ) over a left n-coherent ring, where n-FI stands for the categories of all (n, 0)- injective left R-modules. These modules together with the left or right derived functors are used to study the (n, 0)-injective dimensions of modules and rings.

**Keywords:**
(n,
0)-injective module,
(n,
0)-injective dimension,
(n,
0)-FI-injective(flat) module,
(Pre)cover,
(Pre)envelope.

##### 695 Modern Method for Solving Pure Integer Programming Models

**Authors:**
G. Shojatalab

**Abstract:**

**Keywords:**
Integer,
Programming,
Operation Research,
Variables of decision.

##### 694 Comparative Study on Recent Integer DCTs

**Authors:**
Sakol Udomsiri,
Masahiro Iwahashi

**Abstract:**

**Keywords:**
DCT,
sensitivity,
lossless,
wordlength.

##### 693 A Special Algorithm to Approximate the Square Root of Positive Integer

**Authors:**
Hsian Ming Goo

**Abstract:**

The paper concerns a special approximate algorithm of the square root of the specific positive integer, which is built by the use of the property of positive integer solution of the Pell’s equation, together with using some elementary theorems of matrices, and then takes it to compare with general used the Newton’s method and give a practical numerical example and error analysis; it is unexpected to find its special property: the significant figure of the approximation value of the square root of positive integer will increase one digit by one. It is well useful in some occasions.

**Keywords:**
Special approximate algorithm,
square root,
Pell’s
equation,
Newton’s method,
error analysis.

##### 692 The Spanning Laceability of k-ary n-cubes when k is Even

**Authors:**
Yuan-Kang Shih,
Shu-Li Chang,
Shin-Shin Kao

**Abstract:**

**Keywords:**
container,
Hamiltonian,
k-ary n-cube,
m*-connected.

##### 691 Multi-Objective Optimization of Combined System Reliability and Redundancy Allocation Problem

**Authors:**
Vijaya K. Srivastava,
Davide Spinello

**Abstract:**

This paper presents established 3** ^{n}** enumeration procedure for mixed integer optimization problems for solving multi-objective reliability and redundancy allocation problem subject to design constraints. The formulated problem is to find the optimum level of unit reliability and the number of units for each subsystem. A number of illustrative examples are provided and compared to indicate the application of the superiority of the proposed method.

**Keywords:**
Integer programming,
mixed integer programming,
multi-objective optimization,
reliability redundancy allocation.

##### 690 Stochastic Programming Model for Power Generation

**Authors:**
Takayuki Shiina

**Abstract:**

**Keywords:**
electric power capacity expansion problem,
integerprogramming,
L-shaped method,
stochastic programming

##### 689 A New Integer Programming Formulation for the Chinese Postman Problem with Time Dependent Travel Times

**Authors:**
Jinghao Sun,
Guozhen Tan,
Guangjian Hou

**Abstract:**

**Keywords:**
Chinese Postman Problem,
Time Dependent,
Integer Programming,
Upper Bound Analysis.

##### 688 Robot Path Planning in 3D Space Using Binary Integer Programming

**Authors:**
Ellips Masehian,
Golnaz Habibi

**Abstract:**

**Keywords:**
3D C-space,
Binary Integer Programming (BIP),
Delaunay Tessellation,
Robot Motion Planning.

##### 687 Generic Model for Timetabling Problems by Integer Linear Programming Approach

**Authors:**
N. A. H. Aizam,
V. Uvaraja

**Abstract:**

The agenda of showing the scheduled time for performing certain tasks is known as timetabling. It is widely used in many departments such as transportation, education, and production. Some difficulties arise to ensure all tasks happen in the time and place allocated. Therefore, many researchers invented various programming models to solve the scheduling problems from several fields. However, the studies in developing the general integer programming model for many timetabling problems are still questionable. Meanwhile, this thesis describes about creating a general model which solves different types of timetabling problems by considering the basic constraints. Initially, the common basic constraints from five different fields are selected and analyzed. A general basic integer programming model was created and then verified by using the medium set of data obtained randomly which is much similar to realistic data. The mathematical software, AIMMS with CPLEX as a solver has been used to solve the model. The model obtained is significant in solving many timetabling problems easily since it is modifiable to all types of scheduling problems which have same basic constraints.

**Keywords:**
AIMMS mathematical software,
integer linear
programming,
scheduling problems,
timetabling.

##### 686 Estimating the Population Mean by Using Stratified Double Extreme Ranked Set Sample

**Authors:**
Mahmoud I. Syam,
Kamarulzaman Ibrahim,
Amer I. Al-Omari

**Abstract:**

Stratified double extreme ranked set sampling (SDERSS) method is introduced and considered for estimating the population mean. The SDERSS is compared with the simple random sampling (SRS), stratified ranked set sampling (SRSS) and stratified simple set sampling (SSRS). It is shown that the SDERSS estimator is an unbiased of the population mean and more efficient than the estimators using SRS, SRSS and SSRS when the underlying distribution of the variable of interest is symmetric or asymmetric.

**Keywords:**
Double extreme ranked set sampling,
Extreme
ranked set sampling,
Ranked set sampling,
Stratified double extreme
ranked set sampling.

##### 685 Optimal ECG Sampling Frequency for Multiscale Entropy-Based HRV

**Authors:**
Manjit Singh

**Abstract:**

**Keywords:**
ECG,
heart rate variability,
HRV,
multiscale entropy,
sampling frequency.

##### 684 Lower Bounds of Some Small Ramsey Numbers

**Authors:**
Decha Samana,
Vites Longani

**Abstract:**

**Keywords:**
Lower bound,
Ramsey numbers,
Graphs,
Distance line.

##### 683 Efficient Secured Lossless Coding of Medical Images– Using Modified Runlength Coding for Character Representation

**Authors:**
S. Annadurai,
P. Geetha

**Abstract:**

**Keywords:**
EZW algorithm,
lifting scheme,
losslesscompression,
reversible integer wavelet transform,
securetransmission,
selective bit scrambling,
modified runlength coding .

##### 682 Modified Diffie-Hellman Protocol By Extend The Theory of The Congruence

**Authors:**
Rand Alfaris,
Mohamed Rushdan MD Said,
Mohamed Othman,
Fudziah Ismail

**Abstract:**

**Keywords:**
Extended theory of the congruence,
modified Diffie-
Hellman protocol.

##### 681 Airport Check-In Optimization by IP and Simulation in Combination

**Authors:**
Ahmad Thanyan Al-Sultan

**Abstract:**

The check-in area of airport terminal is one of the busiest sections at airports at certain periods. The passengers are subjected to queues and delays during the check-in process. These delays and queues are due to constraints in the capacity of service facilities. In this project, the airport terminal is decomposed into several check-in areas. The airport check-in scheduling problem requires both a deterministic (integer programming) and stochastic (simulation) approach. Integer programming formulations are provided to minimize the total number of counters in each check-in area under the realistic constraint that counters for one and the same flight should be adjacent and the desired number of counters remaining in each area should be fixed during check-in operations. By using simulation, the airport system can be modeled to study the effects of various parameters such as number of passengers on a flight and check-in counter opening and closing time.

**Keywords:**
Airport terminal,
Integer programming,
Scheduling,
Simulation.

##### 680 The Pell Equation x2 − (k2 − k)y2 = 2t

**Authors:**
Ahmet Tekcan

**Abstract:**

**Keywords:**
Pell equation,
solutions of Pell equation.

##### 679 Modeling Hybrid Systems with MLD Approach and Analysis of the Model Size and Complexity

**Authors:**
H. Mahboubi,
B. Moshiri,
A. Khaki Seddigh

**Abstract:**

**Keywords:**
Hybrid systems,
mixed-integer inequalities,
mixed
logical dynamical systems,
multi-tank system.

##### 678 A Novel Estimation Method for Integer Frequency Offset in Wireless OFDM Systems

**Authors:**
Taeung Yoon,
Youngpo Lee,
Chonghan Song,
Na Young Ha,
Seokho Yoon

**Abstract:**

**Keywords:**
Orthogonal frequency division multiplexing,
integer frequency offset,
estimation,
training symbol

##### 677 Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing

**Authors:**
Taehan Lee

**Abstract:**

**Keywords:**
Integer programming,
multicommodity network
design,
routing,
shortest path.

##### 676 K-best Night Vision Devices by Multi-Criteria Mixed-Integer Optimization Modeling

**Authors:**
Daniela I. Borissova,
Ivan C. Mustakerov

**Abstract:**

The paper describes an approach for defining of k-best night vision devices based on multi-criteria mixed-integer optimization modeling. The parameters of night vision devices are considered as criteria that have to be optimized. Using different user preferences for the relative importance between parameters different choice of k-best devices can be defined. An ideal device with all of its parameters at their optimum is used to determine how far the particular device from the ideal one is. A procedure for evaluation of deviation between ideal solution and k-best solutions is presented. The applicability of the proposed approach is numerically illustrated using real night vision devices data. The proposed approach contributes to quality of decisions about choice of night vision devices by making the decision making process more certain, rational and efficient.

**Keywords:**
K-best devices,
mixed-integer model,
multi-criteria problem,
night vision devices.

##### 675 A Mixed Integer Linear Programming Model for Flexible Job Shop Scheduling Problem

**Authors:**
Mohsen Ziaee

**Abstract:**

**Keywords:**
Scheduling,
flexible job shop,
makespan,
mixed integer linear programming.

##### 674 Timetabling Communities’ Demands for an Effective Examination Timetabling Using Integer Linear Programming

**Authors:**
N. F. Jamaluddin,
N. A. H. Aizam

**Abstract:**

This paper explains the educational timetabling problem, a type of scheduling problem that is considered as one of the most challenging problem in optimization and operational research. The university examination timetabling problem (UETP), which involves assigning a set number of exams into a set number of timeslots whilst fulfilling all required conditions, has been widely investigated. The limitation of available timeslots and resources with the increasing number of examinations are the main reasons in the difficulty of solving this problem. Dynamical change in the examination scheduling system adds up the complication particularly in coping up with the demand and new requirements by the communities. Our objective is to investigate these demands and requirements with subjects taken from Universiti Malaysia Terengganu (UMT), through questionnaires. Integer linear programming model which reflects the preferences obtained to produce an effective examination timetabling was formed.

**Keywords:**
Demands,
educational timetabling,
integer linear programming,
scheduling,
university examination timetabling problem.

##### 673 Minimizing Energy Consumption in Wireless Sensor Networks using Binary Integer Linear Programming

**Authors:**
Chompunut Jantarasorn,
Chutima Prommak

**Abstract:**

The important issue considered in the widespread deployment of Wireless Sensor Networks (WSNs) is an efficiency of the energy consumption. In this paper, we present a study of the optimal relay station planning problems using Binary Integer Linear Programming (BILP) model to minimize the energy consumption in WSNs. Our key contribution is that the proposed model not only ensures the required network lifetime but also guarantees the radio connectivity at high level of communication quality. Specially, we take into account effects of noise, signal quality limitation and bit error rate characteristics. Numerical experiments were conducted in various network scenarios. We analyzed the effects of different sensor node densities and distribution on the energy consumption.

**Keywords:**
Binary Integer Linear Programming,
BILP,
Energy
consumption,
Optimal node placement and Wireless sensor networks.