• Title/Summary/Keyword: update rate

Search Result 285, Processing Time 0.021 seconds

An update on immunotherapy with PD-1 and PD-L1 blockade

  • Koh, Sung Ae
    • Journal of Yeungnam Medical Science
    • /
    • v.38 no.4
    • /
    • pp.308-317
    • /
    • 2021
  • Cancer is the leading cause of death and is on the rise worldwide. Until 2010, the development of targeted treatment was mainly focused on the growth mechanisms of cancer. Since then, drugs with mechanisms related to tumor immunity, especially immune checkpoint inhibitors, have proven effective, and most pharmaceutical companies are striving to develop related drugs. Programmed cell death-1 and programmed cell death ligand-1 inhibitors have shown great success in various cancer types. They showed durable and sustainable responses and were approved by the U.S. Food and Drug Administration. However, the response to inhibitors showed low percentages of cancer patients; 15% to 20%. Therefore, combination strategies with immunotherapy and conventional treatments were used to overcome the low response rate. Studies on combination therapy have typically reported improvements in the response rate and efficacy in several cancers, including non-small cell lung cancer, small cell lung cancer, breast cancer, and urogenital cancers. The combination of chemotherapy or targeted agents with immunotherapy is one of the leading pathways for cancer treatment.

A Fast-Loaming Algorithm for MLP in Pattern Recognition (패턴인식의 MLP 고속학습 알고리즘)

  • Lee, Tae-Seung;Choi, Ho-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.3
    • /
    • pp.344-355
    • /
    • 2002
  • Having a variety of good characteristics against other pattern recognition techniques, Multilayer Perceptron (MLP) has been used in wide applications. But, it is known that Error Backpropagation (EBP) algorithm which MLP uses in learning has a defect that requires relatively long leaning time. Because learning data in pattern recognition contain abundant redundancies, in order to increase learning speed it is very effective to use online-based teaming methods, which update parameters of MLP pattern by pattern. Typical online EBP algorithm applies fixed learning rate for each update of parameters. Though a large amount of speedup with online EBP can be obtained by choosing an appropriate fixed rate, fixing the rate leads to the problem that the algorithm cannot respond effectively to different leaning phases as the phases change and the learning pattern areas vary. To solve this problem, this paper defines learning as three phases and proposes a Instant Learning by Varying Rate and Skipping (ILVRS) method to reflect only necessary patterns when learning phases change. The basic concept of ILVRS is as follows. To discriminate and use necessary patterns which change as learning proceeds, (1) ILVRS uses a variable learning rate which is an error calculated from each pattern and is suppressed within a proper range, and (2) ILVRS bypasses unnecessary patterns in loaming phases. In this paper, an experimentation is conducted for speaker verification as an application of pattern recognition, and the results are presented to verify the performance of ILVRS.

Robust Generalized Labeled Multi-Bernoulli Filter and Smoother for Multiple Target Tracking using Variational Bayesian

  • Li, Peng;Wang, Wenhui;Qiu, Junda;You, Congzhe;Shu, Zhenqiu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.3
    • /
    • pp.908-928
    • /
    • 2022
  • Multiple target tracking mainly focuses on tracking unknown number of targets in the complex environment of clutter and missed detection. The generalized labeled multi-Bernoulli (GLMB) filter has been shown to be an effective approach and attracted extensive attention. However, in the scenarios where the clutter rate is high or measurement-outliers often occur, the performance of the GLMB filter will significantly decline due to the Gaussian-based likelihood function is sensitive to clutter. To solve this problem, this paper presents a robust GLMB filter and smoother to improve the tracking performance in the scenarios with high clutter rate, low detection probability, and measurement-outliers. Firstly, a Student-T distribution variational Bayesian (TDVB) filtering technology is employed to update targets' states. Then, The likelihood weight in the tracking process is deduced again. Finally, a trajectory smoothing method is proposed to improve the integrative tracking performance. The proposed method are compared with recent multiple target tracking filters, and the simulation results show that the proposed method can effectively improve tracking accuracy in the scenarios with high clutter rate, low detection rate and measurement-outliers. Code is published on GitHub.

Real-Time Haptic Rendering of Slowly Deformable Bodies Based on Two Dimensional Visual Information for Telemanipulation (원격조작을 위한 2차원 영상정보에 기반한 저속 변형체의 실시간 햅틱 렌더링)

  • Kim, Jung-Sik;Kim, Young-Jin;Kim, Jung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.8
    • /
    • pp.855-861
    • /
    • 2007
  • Haptic rendering is a process providing force feedback during interactions between a user and a virtual object. This paper presents a real-time haptic rendering technique for deformable objects based on visual information of intervention between a tool and a real object in a remote place. A user can feel the artificial reaction force through a haptic device in real-time when a slave system exerts manipulation tasks on a deformable object. The models of the deformable object and the manipulator are created from the captured image obtained with a CCD camera and the recognition of objects is achieved using image processing techniques. The force at a rate of 1 kHz for stable haptic interaction is deduced using extrapolation of forces at a low update rate. The rendering algorithm developed was tested and validated on a test platform consisting of a one-dimensional indentation device and an off-the shelf force feedback device. This software system can be used in a cellular manipulation system providing artificial force feedback to enhance a success rate of operations.

An Adaptive Transform Code for Images (적응 변환코드를 이용한 영상신호 압축)

  • Kim, Dong-Youn;Lee, Kyung-Joung;Yoon, Hyung-Ro
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1991 no.11
    • /
    • pp.44-47
    • /
    • 1991
  • There exists a transform trellis code that is optimal for stationary Gaussian sources and the squared-error distortion measure at all rates. In this paper, we train an asymptotically optimal version of such a code to obtain one which is matched better to the statistics of real world data. The training algorithm uses the M-algorithm to search the trellis codebook and the LBG-algorithm to update the trellis codebook. To adapt the codebook for the varying input data. we use two gain-adaptive methods. The gain-adaptive scheme 1, which normalizes input block data by its gain factor, is applied to images at rate 0.5 bits/pixel. When each block is encoded at the same rate, the nonstationarity among the block variances leads to a variation in the resulting distortion from one block to another. To alleviate the non-uniformity among the encoded image, we design four clusters from the block power, in which each cluster has its own trellis codebook and different rates. The rate of each cluster is assigned through requiring a constant distortion per-letter. This gain-adaptive scheme 2 produces good visual and measurable quality at low rates.

  • PDF

Performance Models of Multi-stage Bernoulli Lines with Multiple Product and Dedicated Buffers (다품종 제품과 전용 대기공간을 고려한 다단계 베르누이 라인을 위한 성능 모델)

  • Park, Kyungsu;Han, Jun-Hee;Kim, Woo-Sung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.3
    • /
    • pp.22-32
    • /
    • 2021
  • To meet rapidly changing market demands, manufacturers strive to increase both of productivity and diversity at the same time. As a part of those effort, they are applying flexible manufacturing systems that produce multiple types and/or options of products at a single production line. This paper studies such flexible manufacturing system with multiple types of products, multiple Bernoulli reliability machines and dedicated buffers between them for each of product types. As one of the prevalent control policies, priority based policy is applied at each machines to select the product to be processed. To analyze such system and its performance measures exactly, Markov chain models are applied. Because it is too complex to define all relative transient and its probabilities for each state, an algorithm to update transient state probability are introduced. Based on the steady state probability, some performance measures such as production rate, WIP-based measures, blocking probability and starvation probability are derived. Some system properties are also addressed. There is a property of non-conservation of flow, which means the product ratio at the input flow is not conserved at the succeeding flows. In addition, it is also found that increased buffer capacity does not guarantee improved production rate in this system.

Gamma Knife Radiosurgery for Trigeminal Neuralgia : Review and Update

  • Lee, Seunghoon;Lee, Jung-Il
    • Journal of Korean Neurosurgical Society
    • /
    • v.65 no.5
    • /
    • pp.633-639
    • /
    • 2022
  • Accurate diagnosis of trigeminal neuralgia (TN) is the starting point for optimal treatment. Gamma knife radiosurgery (GKRS) is currently regarded as one of the first-line treatment options for medically refractory TN. GKRS is a less invasive treatment with a low risk of complications than other surgical procedures that provides a favorable pain control Barrow Neurological Institute (BNI) I-IIIb rate of >75% at short-term follow-up. Drawbacks of GKRS include the latency period before pain relief and higher recurrence rate compared with microvascular decompression. Therefore, repeat treatment is necessary if the initial GKRS was effective but followed by recurrence. The concept of dose rate and the biologically effective dose of radiation has been actively studied in radiation oncology and is also applied in GKRS for TN to achieve high safety and efficacy by prescribing the optimal dose. Recent progress in functional imaging, such as diffusion tensor imaging, enables us to understand the pathophysiology of TN and predict the clinical outcome after GKRS. Here, we review TN, GKRS, and recent updates, especially in the concepts of radiation dose, diffusion tensor imaging studies, and repeat treatment in GKRS for TN.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Asymmetric Joint Scheduling and Rate Control under Reliability Constraints in Cognitive Radio Networks (전파인지 네트워크에서 신뢰성 보장 비대칭 스케줄-데이터율 결합제어)

  • Nguyen, Hung Khanh;Song, Ju-Bin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.7
    • /
    • pp.23-31
    • /
    • 2012
  • Resource allocation, such as joint rate control and scheduling, is an important issue in cognitive radio networks. However, it is difficult to jointly consider the rate control and scheduling problem due to the stochastic behavior of channel availability in cognitive radio networks. In this paper, we propose an asymmetric joint rate control and scheduling technique under reliability constraints in cognitive radio networks. The joint rate control and scheduling problem is formulated as a convex optimization problem and substantially decomposed into several sub-problems using a dual decomposition method. An algorithm for secondary users to locally update their rate that maximizes the utility of the overall system is also proposed. The results of simulations revealed that the proposed algorithm converges to a globally optimal solution.

Recognition of Go Game Positions using Obstacle Analysis and Background Update (방해물 분석 및 배경 영상 갱신을 이용한 바둑 기보 기록)

  • Kim, Min-Seong;Yoon, Yeo-Kyung;Rhee, Kwang-Jin;Lee, Yun-Gu
    • Journal of Broadcast Engineering
    • /
    • v.22 no.6
    • /
    • pp.724-733
    • /
    • 2017
  • Conventional methods of automatically recording Go game positions do not properly consider obstacles (hand or object) on a Go board during the Go game. If the Go board is blocked by obstacles, the position of a Go stone may not be correctly recognized, or the sequences of moves may be stored differently from the actual one. In the proposed algorithm, only the complete Go board image without obstacles is stored as a background image and the obstacle is recognized by comparing the background image with the current input image. To eliminate the phenomenon that the shadow is mistaken as obstacles, this paper proposes the new obstacle detection method based on the gradient image instead of the simple differential image. When there is no obstacle on the Go board, the background image is updated. Finally, the successive background images are compared to recognize the position and type of the Go stone. Experimental results show that the proposed algorithm has more than 95% recognition rate in general illumination environment.