Abstract: Introduction: Obesity is a major health risk issue in
the present day of life for one and all globally. Obesity is one of the
major concerns for public health according to recent increasing trends
in obesity-related diseases such as Type 2 diabetes. ( Kazuya,
1994).and hyperlipidemia, (Sakata,1990) .which are more prevalent
in Japanese adults with body mass index (BMI) values Z25 kg/m2.(
Japanese Ministry of Health and Welfare,1997). The purpose of the
study was to assess the effect of twelve weeks of brisk walking on
blood pressure and body mass index, anthropometric measurements
of obese males. Method: Thirty obese (BMI= above 30) males, aged
18 to 22 years, were selected from King Fahd University of
Petroleum & Minerals, Saudi Arabia. The subject-s height (cm) was
measured using a stadiometer and body mass (kg) was measured with
a electronic weighing machine. BMI was subsequently calculated
(kg/m2). The blood pressure was measured with standardized
sphygmomanometer in mm of Hg. All the measurements were taken
twice before and twice after the experimental period. The pre and
post anthropometric measurements of waist and hip circumference
were measured with the steel tape in cm. The subjects underwent
walking schedule two times in a week for 12 weeks. The 45 minute
sessions of brisk walking were undertaken at an average intensity of
65% to 85% of maximum HR (HRmax; calculated as 220-age).
Results & Discussion: Statistical findings revealed significant
changes from pre test to post test in case of both systolic blood
pressure and diastolic blood pressure in the walking group. Results
also showed significant decrease in their body mass index and
anthropometric measurements i.e. (waist & hip circumference).
Conclusion: It was concluded that twelve weeks brisk walking is
beneficial for lowering of blood pressure, body mass index, and
anthropometric circumference of obese males.
Abstract: Grid computing is growing rapidly in the distributed
heterogeneous systems for utilizing and sharing large-scale resources
to solve complex scientific problems. Scheduling is the most recent
topic used to achieve high performance in grid environments. It aims
to find a suitable allocation of resources for each job. A typical
problem which arises during this task is the decision of scheduling. It
is about an effective utilization of processor to minimize tardiness
time of a job, when it is being scheduled. This paper, therefore,
addresses the problem by developing a general framework of grid
scheduling using dynamic information and an ant colony
optimization algorithm to improve the decision of scheduling. The
performance of various dispatching rules such as First Come First
Served (FCFS), Earliest Due Date (EDD), Earliest Release Date
(ERD), and an Ant Colony Optimization (ACO) are compared.
Moreover, the benefit of using an Ant Colony Optimization for
performance improvement of the grid Scheduling is also discussed. It
is found that the scheduling system using an Ant Colony
Optimization algorithm can efficiently and effectively allocate jobs
to proper resources.
Abstract: Bluetooth is a personal wireless communication
technology and is being applied in many scenarios. It is an emerging
standard for short range, low cost, low power wireless access
technology. Current existing MAC (Medium Access Control)
scheduling schemes only provide best-effort service for all masterslave
connections. It is very challenging to provide QoS (Quality of
Service) support for different connections due to the feature of
Master Driven TDD (Time Division Duplex). However, there is no
solution available to support both delay and bandwidth guarantees
required by real time applications. This paper addresses the issue of
how to enhance QoS support in a Bluetooth piconet. The Bluetooth
specification proposes a Round Robin scheduler as possible solution
for scheduling the transmissions in a Bluetooth Piconet. We propose
an algorithm which will reduce the bandwidth waste and enhance the
efficiency of network. We define token counters to estimate traffic of
real-time slaves. To increase bandwidth utilization, a back-off
mechanism is then presented for best-effort slaves to decrease the
frequency of polling idle slaves. Simulation results demonstrate that
our scheme achieves better performance over the Round Robin
scheduling.
Abstract: Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.
Abstract: Optimal reactive power flow is an optimization problem
with one or more objective of minimizing the active power losses for
fixed generation schedule. The control variables are generator bus
voltages, transformer tap settings and reactive power output of the
compensating devices placed on different bus bars. Biogeography-
Based Optimization (BBO) technique has been applied to solve
different kinds of optimal reactive power flow problems subject
to operational constraints like power balance constraint, line flow
and bus voltages limits etc. BBO searches for the global optimum
mainly through two steps: Migration and Mutation. In the present
work, BBO has been applied to solve the optimal reactive power
flow problems on IEEE 30-bus and standard IEEE 57-bus power
systems for minimization of active power loss. The superiority of the
proposed method has been demonstrated. Considering the quality of
the solution obtained, the proposed method seems to be a promising
one for solving these problems.
Abstract: In this paper an average number of re-handlings
analysis is proposed to solve the problem of finding bays
configuration in small container terminal in Gliwice, Poland.
Rehandlings in this terminal can be performed only by reachstackers.
The goal of the heuristic is to plan the reachstacter moves in the
terminal, assuming that the target containers are reached and the
number of re-handings is minimized. The real situation requires also
to take into account the model of the problem environment
uncertainty caused by the fact that many containers are not delivered
to the terminal on time, or can not be sent on scheduled time. To
enable this, the heuristic uses some assumptions to simplify problem
analysis.
Abstract: The intermittent nature of solar energy and the energy
requirements of buildings necessitate the storage of thermal energy.
In this paper a hybrid system of storing solar energy has been
analyzed. Adding a LHS medium to a commercial solar water heater,
the required energy for heating a small room was obtained in
addition to preparing hot water. In other words, the suggested hybrid
storage system consists of two tanks: a water tank as a SHS medium;
and a paraffin tank as a LHS medium. A computing program was
used to find the optimized time schedule of charging the storage
tanks during each day, according to the solar radiation conditions.
The results show that the use of such system can improve the
capability of energy gathering comparing to the individual water
storage tank during the cold months of the year. Of course, because
of the solar radiation angles and shorten daylight in December &
January, the performance will be the same as the simple solar water
heaters (in the northern hemisphere). But the extra energy stored in
November, February, March & April, can be useful for heating a
small room for 3 hours during the cold days.
Abstract: In this paper, we address the problem of adaptive radio
resource allocation (RRA) and packet scheduling in the downlink of a
cellular OFDMA system, and propose a downlink multi-carrier
proportional fair (MPF) scheduler and its joint with adaptive RRA
algorithm to distribute radio resources among multiple users according
to their individual QoS requirements. The allocation and scheduling
objective is to maximize the total throughput, while at the same time
maintaining the fairness among users. The simulation results
demonstrate that the methods presented provide for user more explicit
fairness relative to RRA algorithm, but the joint scheme achieves the
higher sum-rate capacity with flexible parameters setting compared
with MPF scheduler.
Abstract: In this paper, we investigate the study of techniques
for scheduling users for resource allocation in the case of multiple
input and multiple output (MIMO) packet transmission systems. In
these systems, transmit antennas are assigned to one user or
dynamically to different users using spatial multiplexing. The
allocation of all transmit antennas to one user cannot take full
advantages of multi-user diversity. Therefore, we developed the case
when resources are allocated dynamically. At each time slot users
have to feed back their channel information on an uplink feedback
channel. Channel information considered available in the schedulers
is the zero forcing (ZF) post detection signal to interference plus
noise ratio. Our analysis study concerns the round robin and the
opportunistic schemes.
In this paper, we present an overview and a complete capacity
analysis of these schemes. The main results in our study are to give
an analytical form of system capacity using the ZF receiver at the
user terminal. Simulations have been carried out to validate all
proposed analytical solutions and to compare the performance of
these schemes.
Abstract: System is using multiple processors for computing and information processing, is increasing rapidly speed operation of these systems compared with single processor systems, very significant impact on system performance is increased .important differences to yield a single multi-processor cpu, the scheduling policies, to reduce the implementation time of all processes. Notwithstanding the famous algorithms such as SPT, LPT, LSPT and RLPT for scheduling and there, but none led to the answer are not optimal.In this paper scheduling using genetic algorithms and innovative way to finish the whole process faster that we do and the result compared with three algorithms we mentioned.
Abstract: Estimation time and cost of work completion in a
project and follow up them during execution are contributors to
success or fail of a project, and is very important for project
management team. Delivering on time and within budgeted cost
needs to well managing and controlling the projects. To dealing with
complex task of controlling and modifying the baseline project
schedule during execution, earned value management systems have
been set up and widely used to measure and communicate the real
physical progress of a project. But it often fails to predict the total
duration of the project. In this paper data mining techniques is used
predicting the total project duration in term of Time Estimate At
Completion-EAC (t). For this purpose, we have used a project with
90 activities, it has updated day by day. Then, it is used regular
indexes in literature and applied Earned Duration Method to
calculate time estimate at completion and set these as input data for
prediction and specifying the major parameters among them using
Clem software. By using data mining, the effective parameters on
EAC and the relationship between them could be extracted and it is
very useful to manage a project with minimum delay risks. As we
state, this could be a simple, safe and applicable method in prediction
the completion time of a project during execution.
Abstract: Grid computing is a high performance computing
environment to solve larger scale computational applications. Grid
computing contains resource management, job scheduling, security
problems, information management and so on. Job scheduling is a
fundamental and important issue in achieving high performance in
grid computing systems. However, it is a big challenge to design an
efficient scheduler and its implementation. In Grid Computing, there
is a need of further improvement in Job Scheduling algorithm to
schedule the light-weight or small jobs into a coarse-grained or
group of jobs, which will reduce the communication time,
processing time and enhance resource utilization. This Grouping
strategy considers the processing power, memory-size and
bandwidth requirements of each job to realize the real grid system.
The experimental results demonstrate that the proposed scheduling
algorithm efficiently reduces the processing time of jobs in
comparison to others.
Abstract: Developing a university course schedule is
difficult. This is due to the limitations in the resources
available. The process is made even harder with different
faculties or departments having different ways of stating their
schedule requirements. The person in charge of taking the
schedule requirements and turning them into a proper course
schedule is not only burden with the task of allocating the
appropriate classes and time to lecturers and students, they
also need to understand the schedule requirements. Therefore
a scheduling support system named SATA is developed to
assist ICRESS in the course scheduling process. SATA has
been put to use for several semesters and the results have been
encouraging. It won a bronze medal in the 2008 Invention,
Innovation and Design competition (IID-08) and has been
submitted to be patented in October 2008
Abstract: This study proposes a hybrid minimal repair policy
which combines periodic maintenance policy with age-based maintenance policy for a serial production system. Parameters of such policy are defined as and which indicate as hybrid minimal
repair time and planned preventive maintenance time
respectively . Under this hybrid policy, the system is
repaired minimally if it fails during , . A perfect repair is
conducted on the first failure after at any machines. At the same time, we take opportunity to advance the preventive maintenance of
other machines simultaneously. If the system is still operating
properly up to , then the preventive maintenance is carried out as its
predetermined schedule. For a given , we obtain the optimal value which minimizes the expected cost per time unit. Numerical
example is presented to illustrate the properties of the optimal solution.
Abstract: In this paper, we provide complete end-to-end delay analyses including the relay nodes for instant messages. Message Session Relay Protocol (MSRP) is used to provide congestion control for large messages in the Instant Messaging (IM) service. Large messages are broken into several chunks. These chunks may traverse through a maximum number of two relay nodes before reaching destination according to the IETF specification of the MSRP relay extensions. We discuss the current solutions of sending large instant messages and introduce a proposal to reduce message flows in the IM service. We consider virtual traffic parameter i.e., the relay nodes are stateless non-blocking for scalability purpose. This type of relay node is also assumed to have input rate at constant bit rate. We provide a new scheduling policy that schedules chunks according to their previous node?s delivery time stamp tags. Validation and analysis is shown for such scheduling policy. The performance analysis with the model introduced in this paper is simple and straight forward, which lead to reduced message flows in the IM service.
Abstract: A nonlinear optimal controller with a fuzzy gain
scheduler has been designed and applied to a Line-Of-Sight (LOS)
stabilization system. Use of Linear Quadratic Regulator (LQR)
theory is an optimal and simple manner of solving many control
engineering problems. However, this method cannot be utilized
directly for multigimbal LOS systems since they are nonlinear in
nature. To adapt LQ controllers to nonlinear systems at least a
linearization of the model plant is required. When the linearized
model is only valid within the vicinity of an operating point a gain
scheduler is required. Therefore, a Takagi-Sugeno Fuzzy Inference
System gain scheduler has been implemented, which keeps the
asymptotic stability performance provided by the optimal feedback
gain approach. The simulation results illustrate that the proposed
controller is capable of overcoming disturbances and maintaining a
satisfactory tracking performance.
Abstract: Software crisis refers to the situation in which the developers are not able to complete the projects within time and budget constraints and moreover these overscheduled and over budget projects are of low quality as well. Several methodologies have been adopted form time to time to overcome this situation and now in the focus is component based software engineering. In this approach, emphasis is on reuse of already existing software artifacts. But the results can not be achieved just by preaching the principles; they need to be practiced as well. This paper highlights some of the very basic elements of this approach, which has to be in place to get the desired goals of high quality, low cost with shorter time-to-market software products.
Abstract: In a competitive energy market, system reliability
should be maintained at all times. Power system operation being of
online in nature, the energy balance requirements must be satisfied to
ensure reliable operation the system. To achieve this, information
regarding the expected status of the system, the scheduled
transactions and the relevant inputs necessary to make either a
transaction contract or a transmission contract operational, have to be
made available in real time. The real time procedure proposed,
facilitates this. This paper proposes a quadratic curve learning
procedure, which enables a generator-s contribution to the retailer
demand, power loss of transaction in a line at the retail end and its
associated losses for an oncoming operating scenario to be predicted.
Matlab program was used to test in on a 24-bus IEE Reliability Test
System, and the results are found to be acceptable.
Abstract: This study suggests how an order-receiving company
can avoid disclosing schedule information on unit tasks to the
order-placing company when carrying out a collaborative project on
the value chain in an order-oriented industry. Specifically, it suggests
methods for keeping schedule information confidential, and
categorizes potential situations by inter-task dependency. Lastly, an
approach to select the most optimal non-disclosure method is
discussed. With the methods for not disclosing work-related
information suggested in the study, order-receiving companies can
logically deal with political issues relating to the question of whether
or not to disclose information upon the execution of a collaborative
project in cooperation with an order-placing firm. Moreover,
order-placing companies can monitor undistorted information, while
respecting the legitimate rights of an order-receiving company.
Therefore, it is fair to say that the suggestions made in this study will
contribute to the smooth operation of collaborative intercompany
projects.
Abstract: The increasing competitiveness in manufacturing
industry is forcing manufacturers to seek effective processing
schedules. The paper presents an optimization manufacture
scheduling approach for dependent details processing with given
processing sequences and times on multiple machines. By defining
decision variables as start and end moments of details processing it is
possible to use straightforward variables restrictions to satisfy
different technological requirements and to formulate easy to
understand and solve optimization tasks for multiple numbers of
details and machines. A case study example is solved for seven base
moldings for CNC metalworking machines processed on five
different machines with given processing order among details and
machines and known processing time-s duration. As a result of linear
optimization task solution the optimal manufacturing schedule
minimizing the overall processing time is obtained. The
manufacturing schedule defines the moments of moldings delivery
thus minimizing storage costs and provides mounting due-time
satisfaction. The proposed optimization approach is based on real
manufacturing plant problem. Different processing schedules variants
for different technological restrictions were defined and implemented
in the practice of Bulgarian company RAIS Ltd. The proposed
approach could be generalized for other job shop scheduling
problems for different applications.