• Title/Summary/Keyword: bound form

Search Result 406, Processing Time 0.045 seconds

Automatic False-Alarm Labeling for Sensor Data

  • Adi, Taufik Nur;Bae, Hyerim;Wahid, Nur Ahmad
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.2
    • /
    • pp.139-147
    • /
    • 2019
  • A false alarm, which is an incorrect report of an emergency, could trigger an unnecessary action. The predictive maintenance framework developed in our previous work has a feature whereby a machine alarm is triggered based on sensor data evaluation. The sensor data evaluator performs three essential evaluation steps. First, it evaluates each sensor data value based on its threshold (lower and upper bound) and labels the data value as "alarm" when the threshold is exceeded. Second, it calculates the duration of the occurrence of the alarm. Finally, in the third step, a domain expert is required to assess the results from the previous two steps and to determine, thereby, whether the alarm is true or false. There are drawbacks of the current evaluation method. It suffers from a high false-alarm ratio, and moreover, given the vast amount of sensor data to be assessed by the domain expert, the process of evaluation is prolonged and inefficient. In this paper, we propose a method for automatic false-alarm labeling that mimics how the domain expert determines false alarms. The domain expert determines false alarms by evaluating two critical factors, specifically the duration of alarm occurrence and identification of anomalies before or while the alarm occurs. In our proposed method, Hierarchical Temporal Memory (HTM) is utilized to detect anomalies. It is an unsupervised approach that is suitable to our main data characteristic, which is the lack of an example of the normal form of sensor data. The result shows that the technique is effective for automatic labeling of false alarms in sensor data.

Energy-Efficiency of Distributed Antenna Systems Relying on Resource Allocation

  • Huang, Xiaoge;Zhang, Dongyu;Dai, Weipeng;Tang, She
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1325-1344
    • /
    • 2019
  • Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.

Educational Implications of the Use of 'a gente' in Portuguese (포르투갈어 a gente 사용의 교육적 의미)

  • Kim, Han-Chul
    • Iberoamérica
    • /
    • v.23 no.1
    • /
    • pp.1-31
    • /
    • 2021
  • The main purpose of this study is to examine the use of 'a gente' in Portuguese, and to discuss what to consider educationally. We examined the origin and style of 'a gente', grammaticalization process phase, personalization level, and variations in use in terms of linguistic and social aspects, and confirmed that 'a gente' is showing an increasingly high frequency of use in Brazil. And in order to find educational considerations, we observed how 'a gente' was handled in Portuguese textbooks for foreigners, and analyzed data obtained through interviews with three Korean students studying Portuguese in Brazil. Considering the importance and frequency of use of 'a gente', which is used in the third-person singular form, the section about 'a gente' in grammar and textbooks seems to be very insufficient. Therefore, the contents of textbooks that do not correspond to the actual use of language should be actively revised according to changes in the reality of language use. In addition, the instructor should not be bound by traditional use, but must include 'a gente' in the personal pronoun section of the textbook for efficient education, and actively reflect the more practical usage to educate.

A Study on the Chimi of Hwangnyongsa Temple and the Building Condition of Chimi Installed (황룡사 치미와 사용처의 건축조건 연구)

  • Kim, Sookyung
    • Journal of architectural history
    • /
    • v.31 no.6
    • /
    • pp.59-68
    • /
    • 2022
  • This paper is an architectural historical study on Chimi of Hwangnyongsa Temple. In this research, the shape and cross-section of the chimi are reviewed. The results of the study are as follows. The chimi is a form in which the head part facing the maru is omitted, and the upper and lower body are separated. The upper and lower bonds are assembled into a two types of joint throughout the side of the torso, and then bound with an iron strap. Because of the absence of ridge line in the front, and the narrow curved surface which makes the side plate close to the plane, the entire cross-section is triangular, and the rear plate maintains the shape of the chimi. The naerimmaru connected to the side of the chimi has a slope, so it is clear that the chimi was used on the woojingak-jibung(hipped-roof), and the wing part and back of the chimi are erected on the side roof. The height of the yongmaru and chunyeomaru is about the same and the roofing tiles of those are in contact. The roofing tiles of chunyemaru should be cut to fit the angle of the contacting part. The maru is 30 stories high of roofing tiles as a result of the on-board survey. Based on reference on the shape and timing of the production of chimi, the height of chimi, and the maru is believed to have been built before the Unified Silla Period and used in buildings with at least seven-kan frontage. Buildings corresponding to these construction conditions can be seen as Central hall and East hall in Hwangnyongsa temple.

Color-Tuning Mechanism of the Lit Form of Orange Carotenoid Protein

  • Man-Hyuk Han;Hee Wook Yang;Jungmin Yoon;Yvette Villafani;Ji-Young Song;Cheol Ho Pan;Keunwan Park;Youngmoon Cho;Ji-Joon Song;Seung Joong Kim;Youn-Il Park;Jiyong Park
    • Molecules and Cells
    • /
    • v.46 no.8
    • /
    • pp.513-525
    • /
    • 2023
  • Orange carotenoid protein (OCP) of photosynthetic cyanobacteria binds to ketocarotenoids noncovalently and absorbs excess light to protect the host organism from light-induced oxidative damage. Herein, we found that mutating valine 40 in the α3 helix of Gloeocapsa sp. PCC 7513 (GlOCP1) resulted in blue- or red-shifts of 6-20 nm in the absorption maxima of the lit forms. We analyzed the origins of absorption maxima shifts by integrating X-ray crystallography, homology modeling, molecular dynamics simulations, and hybrid quantum mechanics/molecular mechanics calculations. Our analysis suggested that the single residue mutations alter the polar environment surrounding the bound canthaxanthin, thereby modulating the degree of charge transfer in the photoexcited state of the chromophore. Our integrated investigations reveal the mechanism of color adaptation specific to OCPs and suggest a design principle for color-specific photoswitches.

Simple and Sensitive Electrochemical Sandwich-type Immunosensing of Human Chorionic Gonadotropin based on b-cyclodextrin Functionalized Graphene

  • Linfen Xu;Ling liu;Xiaoyan Zhao;Jinyu Lin;Shaohan Xu;Jinlian He;Debin Jiang;Yong Xia
    • Journal of Electrochemical Science and Technology
    • /
    • v.14 no.1
    • /
    • pp.51-58
    • /
    • 2023
  • The effective detection of human chorionic gonadotropin (HCG) is considerably important for the clinical diagnosis of both of early pregnancy and nonpregnancy-related diseases. In this work, a simple and sensitive electrochemical sandwich-type immunosensing platform was designed by synthesizing b-cyclodextrin (CD) functionalized graphene (CD/GN) hybrid as simultaneously sensing platform and signal transducer coupled with rhodamine b (RhB) as probe. In brief, GN offers large surface area and high conductivity, while CD exhibits superior host-guest recognition capability, thus the primary antibody (Ab1) of HCG can be bound into the cavities of CD/GN to form stable Ab1/CD/GN inclusion complex; meanwhile, the secondary antibody (Ab2) and RhB can also enter into the cavities, producing RhB/Ab2/CD/GN complex. Then, by using Ab1/CD/GN as sensing platform and RhB/Ab2/CD/GN as signal transducer (in which RhB was signal probe), a simple sandwich-type immunosensor was constructed. Under the optimum parameters, the designed immunosensor exhibited a considerable low analytical detection of 1.0 pg mL-1 and a wide linearity of 0.002 to 10.0 ng mL-1 for HCG, revealing the developed sandwich-type electrochemical immunosensing platform offered potential real applications for the determination of HCG.

Stability Condition for Discrete Interval Time-Varying System with Unstructured Uncertainty and Time-Varying Delay Time (비구조화된 불확실성과 시변 지연시간을 갖는 이산 시변 구간 시스템의 안정조건)

  • Hyung-seok Han
    • Journal of Advanced Navigation Technology
    • /
    • v.26 no.6
    • /
    • pp.504-509
    • /
    • 2022
  • In this paper, we deal with the stability condition of linear time-varying interval discrete systems with time-varying delays and unstructured uncertainty. For the time-varying interval discrete system which has interval matrix as its system matrices, time-varying delay time within some interval value and unstructured uncertainty which can include non-linearity and be expressed by only its magnitude, the stability condition is proposed. Compared with the previous result derived by using a upper bound solution of the Lyapunov equation, the new result is derived by the form of simple inequality based on Lyapunov stability condition and has the advantage of being more effective in checking stability. Furthermore, the proposed condition is very comprehensive, powerful and inclusive the previously published conditions of various linear discrete systems, and can be expressed by the terms of magnitudes of the time-varying delay time and uncertainty, and bounds of interval matrices. The superiority of the new condition is shown in the derivation, and the usefulness and advantage of the proposed condition are examined through numerical example.

Stability Condition for Discrete Interval System with Unstructured Uncertainty and Time-Varying Delay Time (비구조화된 불확실성과 시변 지연 시간을 갖는 이산 구간 시스템의 안정조건)

  • Hyung-seok Han
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.6
    • /
    • pp.551-556
    • /
    • 2021
  • In this paper, we deal with the stability condition of linear interval discrete systems with time-varying delays and unstructured uncertainty. For the interval discrete system which has interval matrix as its system matrices, time-varying delay time within some interval value and unstructured uncertainty which can include non-linearity and be expressed by only its magnitude, the stability condition is proposed. Compared with the previous result derived by using a upper bound solution of the Lyapunov equation, the new results are derived by the form of simple inequality based on Lyapunov stability condition and have the advantage of being more effective in stability application. Furthermore, the proposed stable conditions are very comprehensive and powerful, including the previously published stable conditions of various linear discrete systems. The superiority of the new condition is proven in the derivation process, and the utility and superiority of the proposed condition are examined through numerical example.

Stability Bounds of Unstructured and Time-Varying Delayed State Uncertainties for Discrete Interval Time-Varying System (이산 시변 구간 시스템의 비구조화된 불확실성과 시변 지연시간 상태변수 불확실성의 안정범위)

  • Hyung-seok Han
    • Journal of Advanced Navigation Technology
    • /
    • v.27 no.6
    • /
    • pp.871-876
    • /
    • 2023
  • In this paper, we deal with the stable conditions when two uncertainties exist simultaneously in a linear discrete time-varying interval system with time-varying delay time. The interval system is a system in which system matrices are given in the form of an interval matrix, and this paper targets the system in which the delay time of these interval system matrices and state variables is time-varying. We propose the system stability condition when there is simultaneous unstructured uncertainty that includes nonlinearity and only its magnitude and uncertainty in the system matrix of delayed state variables. The stable bounds for two types of uncertainty are derived as an analytical equation. The proposed stability condition and bounds can include previous stability condition for various linear discrete systems, and the values such as time-varying delay time variation size, uncertainty size, and range of interval matrix are all included in the conditional equation. The new bounds of stability are compared with previous results through numerical example, and its effectiveness and excellence are verified.

Pruning Algorithm for Spokes Puzzle (수레바퀴 살 퍼즐에 관한 전정 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.24 no.4
    • /
    • pp.89-97
    • /
    • 2024
  • The problem of the spokes puzzle(SP), which connects the spokes(edges) required by the wheel axis (hub, vertex) without intersection to form a network in which all the hubs are connected, can be said to be a wasteland of research. For this problem, there is no algorithm that presents a brute-force search or branch-and-bound method that takes exponential time. This paper proposes an algorithm to plot a lattice graph with cross-diagonal lines of m×n for a given SP and to pruning(delete) the surplus edges(spokes). The proposed algorithm is a simple way to select an edge of a hub whose number of edges matches the hub requirement and delete the edge crossing it. If there is no hub with an edge that meets the hub requirement, a strategy was adopted to preferentially delete(pruning) the edge of the hub with the maximum amount of spare. As a result of applying the proposed algorithm to 20 benchmarking experimental data, it was shown that a solution that minimizes the number of trials and errors can be obtained for all problems.