• Title, Summary, Keyword: Assignment Test

Search Result 148, Processing Time 0.036 seconds

RAS: Request Assignment Simulator for Cloud-Based Applications

  • Rajan, R. Arokia Paul;Francis, F. Sagayaraj
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2035-2049
    • /
    • 2015
  • Applications deployed in cloud receive a huge volume of requests from geographically distributed users whose satisfaction with the cloud service is directly proportional to the efficiency with which the requests are handled. Assignment of user requests based on appropriate load balancing principles significantly improves the performance of such cloud-based applications. To study the behavior of such systems, there is a need for simulation tools that will help the designer to set a test bed and evaluate the performance of the system by experimenting with different load balancing principles. In this paper, a novel architecture for cloud called Request Assignment Simulator (RAS) is proposed. It is a customizable, visual tool that simulates the request assignment process based on load balancing principles with a set of parameters that impact resource utilization. This simulator will help to ascertain the best possible resource allocation technique by facilitating the designer to apply and test different load balancing principles for a given scenario.

An Analysis on Brand Awareness of Western-style Family Restaurants (서양식 패밀리 레스토랑의 브랜드 인지도에 관한 분석)

  • Kim, Yung-Chan
    • Culinary science and hospitality research
    • /
    • v.13 no.4
    • /
    • pp.31-44
    • /
    • 2007
  • The verified results of this study on the selected study assignments are as follows: Brand awareness of the western-style family restaurants in both study assignment One and Two is examined by showing and comparing the restaurants ranked from first to third. The ranking is based on the survey response rate only. And the familiarity of family restaurants' logos is investigated by statistical techniques such as T-test Anova, Duncan's Multiple Range Test, etc. Firstly, the analytical result of study assignment One shows that the brand awareness of the family restaurants can vary depending on how often customers use the restaurants. Secondly, the analytical result of study assignment Two shows that the familiarity and the preference of the restaurants ranked from first to third are identical each other depending on customers' sex, marital status, and income. Besides, the result shows that the brand awareness shows different rankings depending on customers' age, educational background, and occupation. Thirdly, the analytical result of study assignment Three indicates that the familiarity is different depending on customers' age, educational background, occupation, and annual income.

  • PDF

Metaheuristics for reliable server assignment problems

  • Jang, Kil-Woong;Kim, Jae-Hwan
    • Journal of the Korean Society of Marine Engineering
    • /
    • v.38 no.10
    • /
    • pp.1340-1346
    • /
    • 2014
  • Previous studies of reliable server assignment considered only to assign the same cost of server, that is, homogeneous servers. In this paper, we generally deal with reliable server assignment with different server costs, i.e., heterogeneous servers. We formulate this problem as a nonlinear integer programming mathematically. Our problem is defined as determining a deployment of heterogeneous servers to maximize a measure of service availability. We propose two metaheuristic algorithms (tabu search and particle swarm optimization) for solving the problem of reliable server assignment. From the computational results, we notice that our tabu search outstandingly outperforms particle swarm optimization for all test problems. In terms of solution quality and computing time, the proposed method is recommended as a promising metaheuristic for a kind of reliability optimization problems including reliable sever assignment and e-Navigation system.

OPTIMIZATION OF THE TEST INTERVALS OF A NUCLEAR SAFETY SYSTEM BY GENETIC ALGORITHMS, SOLUTION CLUSTERING AND FUZZY PREFERENCE ASSIGNMENT

  • Zio, E.;Bazzo, R.
    • Nuclear Engineering and Technology
    • /
    • v.42 no.4
    • /
    • pp.414-425
    • /
    • 2010
  • In this paper, a procedure is developed for identifying a number of representative solutions manageable for decision-making in a multiobjective optimization problem concerning the test intervals of the components of a safety system of a nuclear power plant. Pareto Front solutions are identified by a genetic algorithm and then clustered by subtractive clustering into "families". On the basis of the decision maker's preferences, each family is then synthetically represented by a "head of the family" solution. This is done by introducing a scoring system that ranks the solutions with respect to the different objectives: a fuzzy preference assignment is employed to this purpose. Level Diagrams are then used to represent, analyze and interpret the Pareto Fronts reduced to the head-of-the-family solutions.

Design and Implementation of e-Learn ing System with Dynamic Learn ing Contents Provision and Real-Time Assignment Evaluation (동적인 학습 내용 구성과 실시간 과제물 평가 기능을 가진 e-Learning 시스템의 설계 및 구현)

  • Kim Jung-Sook;Lee Hee-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5
    • /
    • pp.323-332
    • /
    • 2005
  • In this Paper, we design and implement an e-Learning system with dynamic learning contents Providing and re-time assignment system. The learner can select the dynamic learning contents Providing environments with test and Quiz Phase according to the learners' characters and interest to improve the learning effects. Also, we develop the real-time assignment system which is composed of multiple choice and essay test and can provide the interaction between teacher and learner immediately.

  • PDF

A Code Assignment Algorithm for Microinstructions (마이크로 명령어의 코드 할당 알고리즘)

  • Kim, H.R.;Kim, C.S.;Hong, I.S.;Lim, J.Y.;Lim, I.C.
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.587-590
    • /
    • 1988
  • In the case of VLSI computer system control unit design using PLA, optimal state code assignment algorithm to minimize the PLA area is proposed. An optimal state code assignment algorithm which considers output state and logic minimization simultaneously is proposed, and by means of this, algorithm product term is minimized. Also, by means of this algorithm running time and memory capacitance is decreased as against heuristic state code assignment algorithm which uses matrix calculation and considers the constraint relation only. This algorithm is implemented on VAX 11/750 (UNIX4.3BSD). Through the various test example applied proposed algorithm, the efficiency of this algorithm is shown.

  • PDF

A Study on Modeling and Algorithm for WDM VWP Network Design (WDM VWP 네트워크 설계 모형 및 알고리즘 연구)

  • Lee, Hee-Sang;Hong, Sung-Pil;Song, Hae-Goo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.4
    • /
    • pp.296-305
    • /
    • 2000
  • Virtual wavelength path (VWP) is the optical path when a wavelength conversion is possible in a wavelength division multiplexing (WDM) network that is transmission infrastructure for the next generation high speed backbone networks. To achieve efficient design for VWP networks, we must consider VWP routing, wavelength assignment, and wavelength conversion while satisfying many technical constraints of the WDM networks. In this study we propose an integrated model for efficient VWP design in WDM networks. We also develope a 3-phase algorithm, each of which deals with routing, wavelength assignment and route and wavelength reassignment, respectively. In our computational experiments, phase 1 algorithm can solve the problem to the optimality for medium size test networks. Phase 2 algorithm is an efficient heuristic based on a reduced layered network and can give us an effective wavelength assignment. Finally, phase 3 algorithm reconfigure VWP routing and its wavelength assignment to concentrate wavelength conversion nodes in the suggested VWP network.

  • PDF

A ROUTE-BASED SOLUTION ALGORITHM FOR DYNAMIC USER EQUILIBRIUM ASSIGNMENT (경로기반 해법알고리즘을 이용한 동적통행배분모형의 개발)

  • Sangjin Han
    • Proceedings of the KOR-KST Conference
    • /
    • /
    • pp.97-139
    • /
    • 2002
  • The aim of the present study is to find a good quality user equilibrium assignments under time varying condition. For this purpose, this study introduces a dynamic network loading method that can maintain correct flow propagation as well as flow conservation, and it develops a novel solution algorithm that does not need evaluation of the objective function by modifying the Schittenhelm (1990)'s algorithm. This novel algorithm turns out to be efficient and convenient compared to the conventional Frank-Wolfe (1956) algorithm because the former finds solutions based on routes rather than links so that it can maintain correct flow propagation intrinsically in the time-varying network conditions. The application of dynamic user equilibrium (DUE) assignment model with this novel solution algorithm to test networks including medium-sized one shows that the present DUE assignment model gives rise to high quality discrete time solutions when we adopt the deterministic queuing model for a link performance function, and we associate flows and costs in a proper way.

  • PDF

A Study of the Degree of Duty Satisfaction According to the Nurses's Characteristics (간호사의 특성이 직무만족도에 미치는 영향)

  • Lee, Hei-Jin;Kim, Sook-Nyung;Sohn, In-Soon;Han, Sang-Suk
    • Journal of Korean Academy of Nursing Administration
    • /
    • v.6 no.1
    • /
    • pp.5-18
    • /
    • 2000
  • This study was conducted to analyze the degree of department satisfaction and correlation accordng to nurses's clinical characteristics. Data fors tudy were selected August, 1999. The sample coisted of 512 nurses working in K university hosptal in Seoul. The collected materials have been alyzed by percentage, average, t-test, ANOVA, arson Correlation Coefficiency using SPSS window 8.0 program. The result were as the follows ; 1. Fifty-one percent answered to be satisfactory in current department of work, and nurses who had been experienced the transfer are fifty percent, and nurse specialist is eight point two percent. 2. The order of the degree of department duty satisfaction was mutual action, professinal position, autonomy, assignment desire, relation between the doctor and nurses, wage, administration. 3. The result of the degree of department duty satisfaction according to the age has shown significant differences in administration and assignment desire, and the result of the degree of department duty satisfaction according to the education and religion has shown significant differences in administration, and the result of the degree of department duty satisfaction according to marital status has shown significant differences in wage and administration. 4. The result of the degree of department duty satisfaction according La the position has shown significant differences in administration, assignment desire and the sum of duty satisfaction, and the result of the degree of department duty satisfaction according to the nurse specialist has shown no significant differences in total areas, and the result of the degree of department duty satisfaction according to the transfer has shown significant differences in relation between the doctor and nurses, administration, autonomy and the sum of duty satisfaction. 5. The result of the degree of department duty satisfaction according to the nursing career and present assignment career has shown no significant differences in total areas, and the result of degree of department duty satisfaction according to the present assignment has shown significant differences in relation between doctor and nurses, administration, assignment desire and the sum of duty satisfaction. 6. The result of the degree of department duty satisfaction according to the request and experiences of trasfer has shown significant differences in wage, administration, assignment desire and the sum of duty satisfaction 7. The result of the degree of department duty satisfaction according to the degree of satisfaction of present assignment has shown no significant difference in professional position 8. The result of relation of nurses'a clinical characteristics and the degree of department duty satisfaction and the sum of duty satisfaction has shown no significant differences in age, present assignment career, but the result of nursing career has shown significant differences in relation between doctor and nurse, administration, autonomy, assignment desire and the sum of duty satisfaction. and the satisfaction of present assignment which was very effective on duty satisfaction was as significant correlation with wage, professinal position, relation between doctor and nurses, administration, autonomy assignment desire, mutual action and the sum of duty satisfaction. The above result show us that the degree of wage is effected on marital status, experience of transfer, degree of satisfaction of present assignment, request of transfef and the relation between doctor and nurses is effected on experience of transfer, present assignment, degree of satisfaction of present assignment and the administration is effected on age, education, marital status position, experiences of transfer, request of transfer, degree of satisfaction of present assignment and the autonomy is effected on experience of transfer, degree of satisfaction of present assignment and the assignment desire is effected on position, pre sent assignment, degree of satisfaction of present assignment, request of transfer and the mutual action is effected on present assignment. and the sum of duty satisfaction is effected on marital status, position, experience of transfer, request of transfer, present assignment, degree of satisfaction of present assignment.

  • PDF

Test Sequence Generation Using Multiple Unique State Signature(MUSS)

  • Jung, Yoon-Hee;Hong, Beom-Kee
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.43-47
    • /
    • 1997
  • A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

  • PDF