• Title/Summary/Keyword: Time slice

Search Result 238, Processing Time 0.022 seconds

A Scheduling Analysis of FMS Using TPM Unfolding (타임 패트리넷 Unfolding을 이용한 FMS의 스케쥴링 분석)

  • Lee, Jong-Geun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.4
    • /
    • pp.344-350
    • /
    • 2001
  • In this paper, we are focused on the analysis of acyclic schedule for the determination of the opti-mal cycle time and minimization of work in process. Especially, this paper deals with the product ratio-driven cyclic scheduling problem in FMS with different products and ratio using the TPN(Time Petri Nets)un-folding.

  • PDF

Evaluation of Cerebral Aneurysm with High Resolution MR Angiography using Slice Interpolation Technique: Correlation wity Digital Subtraction Angiography(DSA) and MR Angiography(MRA) (Slice Interpolation기법의 고해상도 자기공명혈관조영술을 이용한 뇌동맥류의 진단 : 디지탈 감산 혈관조영술과 자기공명 혈관조영술의 비교)

  • ;;;Daisy Chien;Gerhard Laub
    • Investigative Magnetic Resonance Imaging
    • /
    • v.1 no.1
    • /
    • pp.94-102
    • /
    • 1997
  • Purpose: There have been some efforts to diagnose intracranial aneurysm through a non-invasive method using MRA, although the process may be difficult when the lesion is less than 3mm. The present study prospectively compares the results of high resolution, fast speed slice interpolation MRA and DSA thereby examing the potentiality of primary non-invasive screening test. Materials and Methods: A total of 26 cerebral aneurysm lesions from 14 patients with subarachnoid hemorrhage from ruptured aneurysm (RA) and 5 patients with unruptured aneurysm(UA). In all subjects, MRA was taken to confirm the vessel of origin, definition of aneurysm neck and the relationship of the aneurysm to nearby small vessels, and the results were compared with the results of DSA. The images were obtained with 1.5T superconductive machine (Vision, Siemens, Erlangen, Germany) on 4 slabs of MRA using slice interpolation. The settings include TR/TE/FA=30/6.4/25, matrix $160{\times}512$, FOV $150{\times}200$, 7minutes 42 seconds of scan time, effective thickness of 0.7 mm and an entire thickness of 102. 2mm. The images included structures from foramen magnum to A3 portion of anterior cerebral artery. MIP was used for the image analysis, and multiplanar reconstruction (MPR) technique was used in cases of intracranial aneurysm. Results: A total of 26 intracranial aneurysm lesions from 19 patients with 2 patients having 3 lesion, 3 patients having 2 lesions and the rest of 14 patients having 1 lesion each were examined. Among those, 14 were RA and 12 were UA. Eight lesions were less than 2mm in size, 9 lesions were 3-5mm, 7 were 6-9mm and 2 were larger than IOmm. On initial exams, 25 out of 26 aneurysm lesions were detected in either MRA or DSA showing 96% sensitivity. Specificity cannot be estimated since there was no true negative of false positive findings. When MRA and MPR were used concurrently for the confirmation of size and shape, the results were equivalent to those of DSA, while in the confirmation of aneurysm neck and parent vessels, the concurrent use of MRA and MPR was far superior to the sole use of either MRA or DSA. Conclusion: High resolution MRA using slice interpolation technique showed equal results as those of DSA for the detection of intracranial aneurysm, and may be used as a primary non-invasive screening test in the future.

  • PDF

CPU Scheduling with a Round Robin Algorithm Based on an Effective Time Slice

  • Tajwar, Mohammad M.;Pathan, Md. Nuruddin;Hussaini, Latifa;Abubakar, Adamu
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.941-950
    • /
    • 2017
  • The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching.

Resource Allocation Method using Credit Value in 5G Core Networks (5G 코어 네트워크에서 Credit Value를 이용한 자원 할당 방안)

  • Park, Sang-Myeon;Mun, Young-Song
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.4
    • /
    • pp.515-521
    • /
    • 2020
  • Recently, data traffic has exploded due to development of various industries, which causes problems about losing of efficiency and overloaded existing networks. To solve these problems, network slicing, which uses a virtualization technology and provides a network optimized for various services, has received a lot of attention. In this paper, we propose a resource allocation method using credit value. In the method using the clustering technology, an operation for selecting a cluster is performed whenever an allocation request for various services occurs. On the other hand, in the proposed method, the credit value is set by using the residual capacity and balancing so that the slice request can be processed without performing the operation required for cluster selection. To prove proposed method, we perform processing time and balancing simulation. As a result, the processing time and the error factor of the proposed method are reduced by about 13.72% and about 7.96% compared with the clustering method.

A Unified Gradient Shape on the Slice-Selection Axis for Flow Compensation (스핀에코 펄스 시퀀스의 슬라이스 선택방향에서 혈류 보상을 위한 통일 경사자장법 연구)

  • Pickup, Stephen;Jahng, Geon-Ho
    • Investigative Magnetic Resonance Imaging
    • /
    • v.10 no.2
    • /
    • pp.70-80
    • /
    • 2006
  • Spin echo gradient moment nulling pulse sequences were designed and implemented on a clinical magnetic resonance imaging system. A new technique was introduced for flow compensation that minimized echo time and effectively suppresses unwanted echoes on the slice selection gradient axis in spin echo sequences. A unified gradient shape was used in all orders of flow compensation up to the third order. A dual-purpose gradient was applied for flow compensation and to reduce unwanted artifacts. The sequences were used to generate images of phantoms and/or human brains. This technique was especially good at reducing eddy currents and artifacts related to imperfection of the refocusing pulse. The developed sequences were found to have shorter echo times and better flow compensation in through-plane flow than those of the previous models that were used by other investigators.

  • PDF

Duplicate Video Packet Transmission for Packet Loss-resilience (패킷 손실에 강인한 중복 비디오 패킷 전송 기법)

  • Seo Man-keon;Jeong Yo-won;Seo Kwang-deok;Kim Jae-Kyoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8C
    • /
    • pp.810-823
    • /
    • 2005
  • The transmission of duplicate packets provides a great loss-resilience without undue time-delay in the video transmission over packet loss networks. But this method generally deteriorates the problem of traffic congestion because of the increased bit-rate required for duplicate transmission. In this paper, we propose an efficient packetization and duplicate transmission of video packets. The proposed method transmits only the video signal with high priority for each video macroblock that is quite small in volume but very important for the reconstruction of the video. The proposed method significantly reduces the required bit-rate for duplicate transmission. An efficient packetization method is also proposed to reduce additional packet overhead which is required for transmitting the duplicate data. The duplicated high priority data of the Previous video slice is transmitted as a Piggyback to the data Packet of the current video slice. It is shown by simulations that the proposed method remarkably improves the packet loss-resilience for video transmission only with small increase of redundant duplicated data for each slice.

VGG-based BAPL Score Classification of 18F-Florbetaben Amyloid Brain PET

  • Kang, Hyeon;Kim, Woong-Gon;Yang, Gyung-Seung;Kim, Hyun-Woo;Jeong, Ji-Eun;Yoon, Hyun-Jin;Cho, Kook;Jeong, Young-Jin;Kang, Do-Young
    • Biomedical Science Letters
    • /
    • v.24 no.4
    • /
    • pp.418-425
    • /
    • 2018
  • Amyloid brain positron emission tomography (PET) images are visually and subjectively analyzed by the physician with a lot of time and effort to determine the ${\beta}$-Amyloid ($A{\beta}$) deposition. We designed a convolutional neural network (CNN) model that predicts the $A{\beta}$-positive and $A{\beta}$-negative status. We performed 18F-florbetaben (FBB) brain PET on controls and patients (n=176) with mild cognitive impairment and Alzheimer's Disease (AD). We classified brain PET images visually as per the on the brain amyloid plaque load score. We designed the visual geometry group (VGG16) model for the visual assessment of slice-based samples. To evaluate only the gray matter and not the white matter, gray matter masking (GMM) was applied to the slice-based standard samples. All the performance metrics were higher with GMM than without GMM (accuracy 92.39 vs. 89.60, sensitivity 87.93 vs. 85.76, and specificity 98.94 vs. 95.32). For the patient-based standard, all the performance metrics were almost the same (accuracy 89.78 vs. 89.21), lower (sensitivity 93.97 vs. 99.14), and higher (specificity 81.67 vs. 70.00). The area under curve with the VGG16 model that observed the gray matter region only was slightly higher than the model that observed the whole brain for both slice-based and patient-based decision processes. Amyloid brain PET images can be appropriately analyzed using the CNN model for predicting the $A{\beta}$-positive and $A{\beta}$-negative status.

The Development of A Dynamic Traffic Assignment Technique using the Cell Transmission Theory (Cell Transmission 이론을 이용한 동적통행배정기법 개발에 관한 연구)

  • 김주영;이승재;손의영
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.4
    • /
    • pp.71-84
    • /
    • 1999
  • The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

  • PDF

Application-Centric, Energy-Efficient Network Architecture ACTION, Based on Virtual Optical Slice Core and Deterministic Optical Access Network

  • Ashizawa, Kunitaka;Okamoto, Satoru;Yamanaka, Naoaki;Oki, Eiji;Fumagalli, Andrea;Veeraraghavan, Malathi
    • Journal of the Optical Society of Korea
    • /
    • v.19 no.4
    • /
    • pp.340-345
    • /
    • 2015
  • The Internet traffic is forecasted to grow at a compound annual rate of 21 % from 2013 to 2018, according to surveys carried out by Cisco [1]. Network resources are significantly over-provisioned in today's networks, and it is quite common to see link utilization in the 30-40% range [2]. Additionally, the multi-media services have widely divergent bandwidth and Quality of Experience (QoE) requirements. Unfortunately, the huge transmission capacity will increase the power consumption of network equipment [3]. Applications Coordinated with Transport, Internet Protocol and Optical Networks (ACTION) [4] has been proposed to realize a multi-QoE, application-centric, and highly energy-efficient network that leverages flexible elastic optical network technologies [5-7]. This paper provides key network technologies for realizing the ACTION, which are a virtual optical slice core network and a Time Division Multiplexing (TDM)-based deterministic active optical access network.

A Digital Audio Respose System Based on the RELP Algorithm (RELP 방식을 이용한 디지털 음성 응답기)

  • 김상용;은종관
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.6
    • /
    • pp.7-16
    • /
    • 1984
  • This paper describes the overall procedure of the development of a digital audio response system. It has been developed specifically as an answering system to the inquiries of telephone numbers from subscribers. The system has been realized based on the residual excited linear prediction (RELP) algorithm that incorporates a pitch predictive loop. Its major advantage over other similar systems is that it produces high quality of synthetic speech, although its memory size is relatively small. The hardware which consists of a speech synthesizer, a controller and an I/O part has been constructed using 2900 series bit-slice microprocessors and an INTEL 8085 microprocessor. The system is capable of real time processing, reliable, and adaptable to other applications.

  • PDF