• 제목/요약/키워드: Concurrent user

Search Result 79, Processing Time 0.029 seconds

A Design of Multi-Call Control of Integrated IP-PBX System of Multiple User's a Concurrent-Call (다중 가입자의 동시 통화 설정을 위한 통합형 IP-PBX 시스템의 복수 호 제어 설계)

  • 백승범;최준원;최재원
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.168-171
    • /
    • 2003
  • 교환시스템에서 핵심중 하나가 호 제어이다. 호 제어중 다중 가입자의 동시 통화를 설정하기 위한 복수 호 제어가 필요하다. 단말기와 단말기 간의 호를 교환기 내에서 처리함으로써 복수의 단말기들의 통신을 보다 효율적으로 제어가 가능한 교환시스템을 설계하였다. 본 논문에서는 단말의 CRV(Call Refrence Value)의 값을 교환기에서 설정하고 해지함으로써 단말기들의 변화를 모두 관리 할 수 있다.

  • PDF

TOUSE: A Fair User Selection Mechanism Based on Dynamic Time Warping for MU-MIMO Networks

  • Tang, Zhaoshu;Qin, Zhenquan;Zhu, Ming;Fang, Jian;Wang, Lei;Ma, Honglian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4398-4417
    • /
    • 2017
  • Multi-user Multiple-Input and Multiple-Output (MU-MIMO) has potential for prominently enhancing the capacity of wireless network by simultaneously transmitting to multiple users. User selection is an unavoidable problem which bottlenecks the gain of MU-MIMO to a great extent. Major state-of-the-art works are focusing on improving network throughput by using Channel State Information (CSI), however, the overhead of CSI feedback becomes unacceptable when the number of users is large. Some work does well in balancing tradeoff between complexity and achievable throughput but is lack of consideration of fairness. Current works universally ignore the rational utilizing of time resources, which may lead the improvements of network throughput to a standstill. In this paper, we propose TOUSE, a scalable and fair user selection scheme for MU-MIMO. The core design is dynamic-time-warping-based user selection mechanism for downlink MU-MIMO, which could make full use of concurrent transmitting time. TOUSE also presents a novel data-rate estimation method without any CSI feedback, providing supports for user selections. Simulation result shows that TOUSE significantly outperforms traditional contention-based user selection schemes in both throughput and fairness in an indoor condition.

A Study on Object-Oriented Preprocessing Program for Finite Element Structural Analysis (유한요소 구조해석을 위한 객체지향 전처리 프로그램에 관한 연구)

  • 신영식;서진국;송준엽;우광성
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1994.04a
    • /
    • pp.25-32
    • /
    • 1994
  • The pre-processor for finite to element structural analysis considering the user-friendly device is developed by using GUI. This can be used on WINDOWS' environment which is realized the multi-tasking and the concurrency by object-oriented paradigm. Data input can be done easily through menu, dialog box, automatic stepwise input and concurrent representation with the structural geometry on multiple windows. It in designed to control integratedly the pre-processing, execution and the post-processing of the finite element structural analysis program on multiple windows, and input data can be seen with result outputs at the same time. In addition, the object-oriented programming environment makes convenient revision and addition of the program components for expanding the scope of analysis and making better user environment.

  • PDF

Implementation of Integrated Control Environment for Biped Robot(IWR-III) (이족보행로봇(IWR-III)의 통합 저어 환경 구축)

  • Noh, Gyeong-Gon;Seo, Yeong-Seop;Kim, Jin-Geol
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.3089-3091
    • /
    • 1999
  • To control IWR-III Biped Waking Robot, those complex modules are necessary that concurrent control multi-axes servo motors, PID & Feedforward gain tuning, initial value calibration, display current status of system, user interface for emergency safety and three-dimensional rendering graphic visualization. It is developed for various-type gait $data^{[1]}$ and for control modes (i.e open/closed loop and pulse/velocity/torque control) that Integrated Control Enviroment with GUI( Graphic User Interface) consist of time-buffered control part using MMC (Multi-Motion Controller) and 3D simulation part using DirectX graphic library.

  • PDF

Mobile Volume Rendering System for Client-Server Environment (클라이언트 서버 기반 모바일 볼륨 가시화 시스템)

  • Lee, Woongkyu;Kye, Heewon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.3
    • /
    • pp.17-26
    • /
    • 2015
  • In this paper, we explain a volume rendering system for client-server environment. A single GPU-equipped PC works as a server which is based on the ideas that only a few concurrent users use a volume rendering system in a small hospital. As the clients, we used Android mobile devices such as smart phones. User events are transformed to rendering requests by the client application. When the server receives a rendering request, it renders the volume using the GPU. The rendered image is compressed to JPEG or PNG format so that we can save network bandwidth and reduce transfer time. In addition, we perform an event pruning method while a user is dragging the touch to enhance latency. The server compensates the pruning by interpolating the touch positions. As the result, real-time volume rendering is possible for 5 concurrent users on single GPU-equipped commodity hardware.

Development of Internet-based Basic Planning System for Ships (인터넷 기반의 선박 기본계획 지원시스템 개발)

  • Lee S.-S.;Lee J.-K.;Lee K.-H.;Park J.-W.;Kim S.-Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.9 no.4
    • /
    • pp.406-415
    • /
    • 2004
  • The industrial environment for shipbuilding in 21st century requires increase in few type of ships and marine structures, international cooperation and globalization, while virtual enterprise environment is rapidly establishing. On the other hand, more and more efforts will be spent on internet based distributed and collaborative environment rather than being spent on unit level automations such as CAD, CAM and CAE, and the link between them. Recent internet technology and information technology in heterogeneous environment are being applied in shipbuilding industry as well as in other industries. While these technology are rapidly adopted in major shipyards, many small and medium-sized shipyards does not have enough resources to introduce system designed for large enterprise. In this paper, a prototype of Internet technology based basic planning system is implemented for the small and medium sized shipyards based on the internet technology and concurrent engineering concept. First, the system is designed from the user requirements. Then standardized development environment and tools are selected. These tools are used for defining and evaluating core application technologies for the system development. This can guarantee the survival of small and medium-sized shipyards in 21st century industrial environment.

A new FPGA routing method by concurrent maze routing (동시 미로 배선 방법에 의한 새로운 FPGA 배선 방법)

  • 최진영;임종석
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.10
    • /
    • pp.119-131
    • /
    • 1994
  • In this paper, we first propose a new FPGA routing method in which seversal netw are routed concurrently by applying the readitional maze routing method. We then introduce CMRF (concurrent maze Router for FPGA) which can be used for the routing of FpGAs of symmetrical array type by applying our new routing method. Given a set of nets, the proposed routing method performas the maze propagation and backtracing independently for each net and determines the routing paths concurrently by competition among nets. In CMRF, using this routing method, q nets are selected from the nets to be routed and they are routed concurrently, where q is the user given parameter determined by considering the computing environment. This process is repeated until either all the nets are routed or the remaining unrouted nets fail to their maze propagations. The routing of these nets are completed using the rip-up and rerouting technique. We apply our routing method to ten randomly generated test examples in order to check its routing performance. The results show taht as we increase the value of q, the routing completion rate increases for all the examples. Note that when q=1, our method is similar to the conventinal maze routing method. We also compare CMRF with the CGE method which has been proposed by Brown et.al. For the five benchmark examples, CMRF complete the routing with less wire segments in each connection block than the wire segments needed in the CGE method of 100% routing.

  • PDF

A Heuristic Approach Solving for the Complex Design Process in the Quality Function Deployment

  • Park, Tae-Hyung;Cho, Moon-Soo
    • Journal of Korean Society for Quality Management
    • /
    • v.30 no.4
    • /
    • pp.137-153
    • /
    • 2002
  • Viewed as a more systematic approach of creating high quality products and bringing them into market at a lower cost and in significantly less time, it attracts the attention of quality designers to quality function deployment (QFD) approach. In attempt to reduce the design cycle, the industry has responded with concurrent design effort. In a sense, concurrent engineering refers to the integration of various activities within the broad scope of the product life cycle [17]. Over the last ten years, much has been written about QFD but little has been available in terms of the underlying guide methodology. The methodology of QFD is quite simple and many will say that they have done it in the past but just have not formalized it into the form that this discipline requires. QFD ties the product, user, value, and manufacturing viewpoints together in a continuous process of defining the product design and manufacturing requirements. The value viewpoint recognizes the cost to obtain certain functionality, and the manufacturing viewpoint addresses conformance to requirements, but in a broader sense, the variability in production. In this paper, the QFD system acquisitions are described, and two heuristic approaches solving for the complex design process, especially the size reduction of design process and precedence-constrained relationship in QFD are proposed, and the empirical example is illustrated.

A Genetic Algorithm for Trip Distribution and Traffic Assignment from Traffic Counts in a Stochastic User Equilibrium

  • Sung, Ki-Seok;Rakha, Hesham
    • Management Science and Financial Engineering
    • /
    • v.15 no.1
    • /
    • pp.51-69
    • /
    • 2009
  • A network model and a Genetic Algorithm (GA) is proposed to solve the simultaneous estimation of the trip distribution and traffic assignment from traffic counts in the congested networks in a logit-based Stochastic User Equilibrium (SUE). The model is formulated as a problem of minimizing a non-linear objective function with the linear constraints. In the model, the flow-conservation constraints are utilized to restrict the solution space and to force the link flows become consistent to the traffic counts. The objective of the model is to minimize the discrepancies between two sets of link flows. One is the set of link flows satisfying the constraints of flow-conservation, trip production from origin, trip attraction to destination and traffic counts at observed links. The other is the set of link flows those are estimated through the trip distribution and traffic assignment using the path flow estimator in the logit-based SUE. In the proposed GA, a chromosome is defined as a real vector representing a set of Origin-Destination Matrix (ODM), link flows and route-choice dispersion coefficient. Each chromosome is evaluated by the corresponding discrepancies. The population of the chromosome is evolved by the concurrent simplex crossover and random mutation. To maintain the feasibility of solutions, a bounded vector shipment technique is used during the crossover and mutation.

Multiple Asynchronous Requests on a Client-based Mashup Page (클라이언트 기반 매시업 페이지에서 다중 비동기 서비스 호출)

  • Lee, Eun-Jung
    • The KIPS Transactions:PartD
    • /
    • v.17D no.1
    • /
    • pp.9-16
    • /
    • 2010
  • Web service mashup bacomes one of the important web application development methods. This paper considers a client based mashup, where a page interfaces many service methods asynchronously. Browser systems execute callbacks when the corresponding reply arrives, possibly concurrent to user interface actions. In this case, callbacks and user interface actions share data memory and screen. Moreover, when the user is able to send another request before the previous ones have replied, the shared resource problem becomes more complicated. In order to solve the multiple requests problem, our contributions are as follows. First, we modeled a mashup page with user actions and callbacks, and we presented several types of callbacks. Secondly, concurrency condition is defined between callbacks and user actions in terms of shared resources, and the test method is presented. Also, we proposed the serialization approach to guarantee the safe execution of callbacks. Finally, we applied the proposed concurrency condition on XForms language and extended the XForms browser to implement the proposed approach. The prototype implementation showed that the proposed approach helps enhancing user experience on mashup pages.