• 제목/요약/키워드: time based strategy

검색결과 1,881건 처리시간 0.026초

외식산업의 경영전략에 관한 연구 (A Study on the Strategy Management in the Foodservice Industry)

  • 정찬희;홍철희;최혜경
    • 한국조리학회지
    • /
    • 제5권2호
    • /
    • pp.261-279
    • /
    • 1999
  • In order to meet competitive power, foodservice should aim to satisfy customers through distinguished quality and service as well as speciality and know-how. Especially, in coming 2000 year will be openned ASEM, 2001 will be the "Year to visit Korea", 2002 will be openned Korea-Japan Soccer World Cup, with these event as a momentum the domestic foodservice industry would be continuously increased and improved. Foodservice industry is the tertiary industry with the potentiality, tremendous popularity, premanancy and future-orient, it is gradually taking root as a basic industry after going through the industrialization. Furthermore, foodservice industry aim to satisfy customer based on quality, services, cleanliness, atmosphere, timing and value, besides, it is customer closeby service which to supply value and satisfaction through systemization, being manual, being technological renovation. Strategic management of foodservice industry is as following: Firstly, marketing strategy requires positing strategy to recongnize self-brand to the customer, thus requires to get hold how to take firm in customers′ mind. And then distingushed strategy requires. So somehow it is important to secure competitive in customers′ mind. Secondaryly, it requires strategy of competive advantegy. It is not to improve unique core competence of industry which is developed and studies for a long time but to pursuit diversfication based on core of industry Thirdly, it requires strategy of customer satisfaction. In these modern days it is important how much to satisfy customer, as it could be not expect continuous frowth and development without strategy of customer satisfaction. Therefore strategy of customer satisfaction is a necessary condition for the foodservice industry.

  • PDF

A Study on The Marketing Strategy of IoT (Internet of Things)-based Smart Home Service Companies Focusing on The Case of Xiaomi

  • Liang, Jinle;Kang, Min Jung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제13권1호
    • /
    • pp.20-25
    • /
    • 2021
  • In the background of the rapid development of the IoT, smart home work is becoming more and more important to each science and technology company. Smart home provides a safe, comfortable, high-quality, high-performance smart home living space compared to general homes, and at the same time It is responding to the low-carbon, eco-friendly global trend. Growth drivers driving the smart home market are increasing the number of Internet users, increasing disposable income in developing countries, increasing the importance of remote home monitoring, and increasing the need for energy saving and low carbon. In 2013-2014, Xiaomi launched a series of smart routers and smart home hardware devices. In 2015, it announced the latest product of the Xiaomi Ecological Chain, the "Smart Home Package," and in 2016 launched the MIJIA brand to invest in various smart product companies. In 2017, Xiaomi announced a plan to build an open smart hardware MIOT platform. We investigated the management strategy of Xiaomi home smart service based on IOT. The management strategy was divided into cost lead strategy, differentiation strategy of Xiaomi home service, and AIOT strategy of Xiaomi smart home.

Dynamic Fog-Cloud Task Allocation Strategy for Smart City Applications

  • Salim, Mikail Mohammed;Kang, Jungho;Park, Jong Hyuk
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2021년도 추계학술발표대회
    • /
    • pp.128-130
    • /
    • 2021
  • Smart cities collect data from thousands of IoT-based sensor devices for intelligent application-based services. Centralized cloud servers support application tasks with higher computation resources but introduce network latency. Fog layer-based data centers bring data processing at the edge, but fewer available computation resources and poor task allocation strategy prevent real-time data analysis. In this paper, tasks generated from devices are distributed as high resource and low resource intensity tasks. The novelty of this research lies in deploying a virtual node assigned to each cluster of IoT sensor machines serving a joint application. The node allocates tasks based on the task intensity to either cloud-computing or fog computing resources. The proposed Task Allocation Strategy provides seamless allocation of jobs based on process requirements.

Synchronous PI Decoupling Control Scheme for DVR against a Voltage Sag in the Power System

  • Kim, Myung-Bok;Lee, Seung-Hoon;Moon, Gun-Woo;Youn, Myung-Joong
    • Journal of Power Electronics
    • /
    • 제4권3호
    • /
    • pp.180-187
    • /
    • 2004
  • This paper proposes a new control strategy for the dynamic voltage restorer (DVR). It is based on a synchronous PI decoupling control strategy which features fast response time and low steady state error. Therefore, the proposed control strategy produces faster action time against voltage sag and guarantees more than enough compensation for reduced supply voltage. Experimental results, implemented with the TMS320C3${\times}$DSP control unit, are shown to validate the effectiveness of the proposed control strategy.

Half-Duplex Relaying Strategy Suitable for a Relay with Mobility

  • Hwang, Inho;Lee, Jeong Woo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.108-125
    • /
    • 2015
  • We propose a new time-division half-duplex estimate-and-forward (EF) relaying strategy suitable for a relay with mobility. We reconfigure EF relaying to guarantee a strong relay-destination link which is required to achieve a high rate using EF relaying. Based on the reconfigured model, we optimize the relaying strategy to attain a high rate irrespective of the relay position with preserving the total transmit bandwidth and energy. The proposed relaying strategy achieves high communication reliability for any relay position, which differs from conventional EF and decode-and-forward (DF) relaying schemes.

'관측 시간'개념을 이용한 로보트의 시변 장애물 회피 동작 계획 (Robot motion planning for time-varying obstacle avoidance using view-time concept)

  • 고낙용;이범희;고명삼;남윤석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.1040-1045
    • /
    • 1991
  • An approach to time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in Cartesian space and in joint space. To deal with the time-varying obstacles, view-time is introduced. A view-time is the time interval viewing the time-varying obstacles to model equivalent stationary obstacles. For the analysis of the properties of the view-time, avoidability measure is defined as a measure of easiness for a robot to avoid obstacles. Based on the properties, a motion planning strategy to avoid time-varying obstacles is derived. An application of the strategy to the collision-free motion planning of two SCARA robots and the simulation on the application are given.

  • PDF

A Novel High-Performance Strategy for A Sensorless AC Motor Drive

  • Lee, Dong-Hee;Kwon, Young-Ahn
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • 제2B권3호
    • /
    • pp.81-89
    • /
    • 2002
  • The sensorless AC motor drive is a popular topic of study due to the cost and reliability of speed and position sensors. Most sensorless algorithms are based on the mathematical modeling of motors including electrical variables such as phase current and voltage. Therefore, the accuracy of such variables largely affects the performance of the sensorless AC motor drive. However, the output voltage of the SVPWM-VSI, which is widely used in sensorless AC motor drives, has considerable errors. In particular, the SVPWM-VSI is error-prone in the low speed range because the constant DC link voltage causes poor resolution in a low output voltage command and the output voltage is distorted due to dead time and voltage drop. This paper investigates a novel high-performance strategy for overcoming these problems in a sensorless ac motor drive. In this paper, a variation of the DC link voltage and a direct compensation for dead time and voltage drop are proposed. The variable DC link voltage leads to an improved resolution of the inverter output voltage, especially in the motor's low speed range. The direct compensation for dead time and voltage drop directly calculates the duration of the switching voltage vector without the modification of the reference voltage and needs no additional circuits. In addition, the proposed strategy reduces a current ripple, which deteriorates the accuracy of a monitored current and causes torque ripple and additional loss. Simulation and experimentation have been performed to verify the proposed strategy.

Time Series Data Cleaning Method Based on Optimized ELM Prediction Constraints

  • Guohui Ding;Yueyi Zhu;Chenyang Li;Jinwei Wang;Ru Wei;Zhaoyu Liu
    • Journal of Information Processing Systems
    • /
    • 제19권2호
    • /
    • pp.149-163
    • /
    • 2023
  • Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

Multi Objective Vehicle and Drone Routing Problem with Time Window

  • Park, Tae Joon;Chung, Yerim
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권1호
    • /
    • pp.167-178
    • /
    • 2019
  • In this paper, we study the multi-objectives vehicle and drone routing problem with time windows, MOVDRPTW for short, which is defined in an urban delivery network. We consider the dual modal delivery system consisting of drones and vehicles. Drones are used as a complement to the vehicle and operate in a point to point manner between the depot and the customer. Customers make various requests. They prefer to receive delivery services within the predetermined time range and some customers require fast delivery. The purpose of this paper is to investigate the effectiveness of the delivery strategy of using drones and vehicles together with a multi-objective measures. As experiment datasets, we use the instances generated based on actual courier delivery data. We propose a hybrid multi-objective evolutionary algorithm for solving MOVDRPTW. Our results confirm that the vehicle-drone mixed strategy has 30% cost advantage over vehicle only strategy.

Scratchpad Memory Architectures and Allocation Algorithms for Hard Real-Time Multicore Processors

  • Liu, Yu;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • 제9권2호
    • /
    • pp.51-72
    • /
    • 2015
  • Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.