Haoqi Luo;Yangliang Li;Junyu Zhang;Hao Zhang;Yunlong Wu;Qing Ye
Current Optics and Photonics
/
v.8
no.4
/
pp.355-365
/
2024
Wavefront coding (WFC) imaging systems can redistribute the energy of an interference laser spot on an image plane sensor by wavefront phase modulation and reduce the peak intensity, realizing laser protection while maintaining imaging functionality by leveraging algorithmic post-processing. In this paper, a spiral axicon WFC imaging system is proposed, and the performance for laser protection is investigated by constructing a laser transmission model. An Airy disk on an image plane sensor is refactored into a symmetrical hollow ring by a spiral axicon phase mask, and the maximum intensity can be reduced to lower than 1% and single-pixel power to 1.2%. The spiral axicon phase mask exhibits strong robustness to the position of the interference laser source and can effectively reduce the risk of sensor damage for an almost arbitrary lase propagation distance. Moreover, we revealed that there is a sensor hazard distance for both conventional and WFC imaging systems where the maximum single-pixel power reaches a peak value under irradiation of a power-fixed laser source. Our findings can offer guidance for the anti-laser reinforcement design of photoelectric imaging systems, thereby enhancing the adaptability of imaging systems in a complex laser environment. The laser blinding-resistant imaging system has potential applications in security monitoring, autonomous driving, and intense-laser-pulse experiments.
This study proposes the recycling of MVS as a value-added product for the removal of phosphate from aqueous solutions. By comparing the phosphate adsorption capacity of each calcined adsorbent at each temperature of MVS, it was determined that the optimal heat treatment temperature of MVS to improve the phosphate adsorption capacity was 800 ℃. MVS-800 suggests an adsorption mechanism through calcium phosphate precipitation. Subsequent kinetic studies with MVS-800 showed that the PFO model was more appropriate than the PSO model. In the equilibrium adsorption experiment, through the analysis of Langmuir and Freundlich models, Langmuir can provide a more appropriate explanation for the phosphate adsorption of MVS-800. This means that the adsorption of phosphate by MVS-800 is uniform over all surfaces and the adsorption consists of a single layer. Thermodynamic analysis of thermally activated MVS-800 shows that phosphate adsorption is an endothermic and involuntary reaction. MVS-800 has the highest phosphate adsorption capacity under low pH conditions. The presence of anions in phosphate adsorption reduces the phosphate adsorption capacity of MVS-800 in the order of CO 3 2-, SO 4 2-, NO 3- and Cl-. Based on experimental data to date, MVS-800 is an environmentally friendly adsorbent for recycling waste resources and is considered to be an adsorbent with high adsorption capacity for removing phosphates from aqueous solutions. This paper combines the advantages of gray predictor and AI fuzzy. The gray predictor can be used to predict whether the bear point exceeds the allowable deviation range, and then perform appropriate control corrections to accelerate the bear point to return to the boundary layer and achieve.
Background and Purpose: The emotions of people at various stages of dementia need to be effectively utilized for prevention, early intervention, and care planning. With technology available for understanding and addressing the emotional needs of people, this study aims to develop speech emotion recognition (SER) technology to classify emotions for people at high risk of dementia. Methods: Speech samples from people at high risk of dementia were categorized into distinct emotions via human auditory assessment, the outcomes of which were annotated for guided deep-learning method. The architecture incorporated convolutional neural network, long short-term memory, attention layers, and Wav2Vec2, a novel feature extractor to develop automated speech-emotion recognition. Results: Twenty-seven kinds of Emotions were found in the speech of the participants. These emotions were grouped into 6 detailed emotions: happiness, interest, sadness, frustration, anger, and neutrality, and further into 3 basic emotions: positive, negative, and neutral. To improve algorithmic performance, multiple learning approaches were applied using different data sources-voice and text-and varying the number of emotions. Ultimately, a 2-stage algorithm-initial text-based classification followed by voice-based analysis-achieved the highest accuracy, reaching 70%. Conclusions: The diverse emotions identified in this study were attributed to the characteristics of the participants and the method of data collection. The speech of people at high risk of dementia to companion robots also explains the relatively low performance of the SER algorithm. Accordingly, this study suggests the systematic and comprehensive construction of a dataset from people with dementia.
This study proposes a new hybrid approach that utilizes post-earthquake survey data and numerical analysis results from an evolving finite element routing model to capture vulnerability processes. In order to achieve cost-effective evaluation and optimization, this study introduced an online data evolution data platform. The proposed method consists of four stages: 1) development of diagnostic sensitivity curve; 2) determination of probability distribution parameters of throughput threshold through optimization; 3) update of distribution parameters using smart evolution method; 4) derivation of updated diffusion parameters. Produce a blending curve. The analytical curves were initially obtained based on a finite element model used to represent a similar RC building with an estimated (previous) capacity height in the damaged area. The previous data are updated based on the estimated empirical failure probabilities from the post-earthquake survey data, and the mixed sensitivity curve is constructed using the update (subsequent) that best describes the empirical failure probabilities. The results show that the earthquake rupture estimate is close to the empirical rupture probability and corresponds very accurately to the real engineering online practical analysis. The objectives of this paper are to obtain adequate, safe and affordable housing and basic services, promote inclusive and sustainable urbanization and participation, implement sustainable and disaster-resilient buildings, sustainable human settlement planning and management. Therefore, with the continuous development of artificial intelligence and management strategy, this goal is expected to be achieved in the near future.
This paper discusses the study of concrete composite walls of algorithmic modeling, in which steel tubes are embedded. The load-bearing capacity of STHC composite walls increases with the increase of axial load coefficient, but its ductility decreases. The load-bearing capacity can be improved by increasing the strength of the steel pipes; however, the elasticity of STHC composite walls was found to be slightly reduced. As the shear stress coefficient increases, the load-bearing capacity of STHC composite walls decreases significantly, while the deformation resistance increases. By analyzing actual cases, we demonstrate the effectiveness of the research results in real situations and enhance the persuasiveness of the conclusions. The research results can provide a basis for future research, inspire more explorations on seismic design and construction, and further advance the development of this field. Emphasize the importance of research results, promote interdisciplinary cooperation in the fields of structural engineering, earthquake engineering, and materials science, and improve overall seismic resistance. The emphasis on these aspects will help highlight the practical impact of the research results, further strengthen the conclusions, and promote progress in the design and construction of earthquake-resistant structures. The goals of this work are access to adequate, safe and affordable housing and basic services, promotion of inclusive and sustainable urbanization and participation, implementation of sustainable and disaster-resilient architecture, sustainable planning and management of human settlements. Simulation results of linear and nonlinear structures show that this method can detect structural parameters and their changes due to damage and unknown disturbances. Therefore, it is believed that with the further development of fuzzy neural network artificial intelligence theory, this goal will be achieved in the near future.
KOSPI200 index is the Korean stock price index consisting of actively traded 200 stocks in the Korean stock market. Its base value of 100 was set on January 3, 1990. The Korea Exchange (KRX) developed derivatives markets on the KOSPI200 index. KOSPI200 index futures market, introduced in 1996, has become one of the most actively traded indexes markets in the world. Traders can make profit by entering a long position on the KOSPI200 index futures contract if the KOSPI200 index will rise in the future. Likewise, they can make profit by entering a short position if the KOSPI200 index will decline in the future. Basically, KOSPI200 index futures trading is a short-term zero-sum game and therefore most futures traders are using technical indicators. Advanced traders make stable profits by using system trading technique, also known as algorithm trading. Algorithm trading uses computer programs for receiving real-time stock market data, analyzing stock price movements with various technical indicators and automatically entering trading orders such as timing, price or quantity of the order without any human intervention. Recent studies have shown the usefulness of artificial intelligent systems in forecasting stock prices or investment risk. KOSPI200 index data is numerical time-series data which is a sequence of data points measured at successive uniform time intervals such as minute, day, week or month. KOSPI200 index futures traders use technical analysis to find out some patterns on the time-series chart. Although there are many technical indicators, their results indicate the market states among bull, bear and flat. Most strategies based on technical analysis are divided into trend following strategy and non-trend following strategy. Both strategies decide the market states based on the patterns of the KOSPI200 index time-series data. This goes well with Markov model (MM). Everybody knows that the next price is upper or lower than the last price or similar to the last price, and knows that the next price is influenced by the last price. However, nobody knows the exact status of the next price whether it goes up or down or flat. So, hidden Markov model (HMM) is better fitted than MM. HMM is divided into discrete HMM (DHMM) and continuous HMM (CHMM). The only difference between DHMM and CHMM is in their representation of state probabilities. DHMM uses discrete probability density function and CHMM uses continuous probability density function such as Gaussian Mixture Model. KOSPI200 index values are real number and these follow a continuous probability density function, so CHMM is proper than DHMM for the KOSPI200 index. In this paper, we present an artificial intelligent trading system based on CHMM for the KOSPI200 index futures system traders. Traders have experienced on technical trading for the KOSPI200 index futures market ever since the introduction of the KOSPI200 index futures market. They have applied many strategies to make profit in trading the KOSPI200 index futures. Some strategies are based on technical indicators such as moving averages or stochastics, and others are based on candlestick patterns such as three outside up, three outside down, harami or doji star. We show a trading system of moving average cross strategy based on CHMM, and we compare it to a traditional algorithmic trading system. We set the parameter values of moving averages at common values used by market practitioners. Empirical results are presented to compare the simulation performance with the traditional algorithmic trading system using long-term daily KOSPI200 index data of more than 20 years. Our suggested trading system shows higher trading performance than naive system trading.
KIM, Byung-Ju;KANG, Byoung-Ju;YOU, So-Young;KWON, Jay-Hyoun
Journal of the Korean Association of Geographic Information Studies
/
v.20
no.3
/
pp.67-79
/
2017
Increasing transportation dependence on the metro system has lead to the convenience of passengers becoming as important as the transportation capacity. In this study, a pedestrian simulator has been developed that can quantitatively assess the pedestrian environment in terms of attributes such as speed and distance. The simulator consists of modules designed for 3D indoor map authoring and algorithmic pedestrian modeling. Module functions for 3D indoor map authoring include 3D spatial modeling, network generation, and evaluation of obtained results. The pedestrian modeling algorithm executes functions such as conducting a path search, allocation of users, and evaluation of level of service (LOS). The primary objective behind developing the said functions is to apply and analyze various scenarios repeatedly, such as before and after the improvement of the pedestrian environment, and to integrate the spatial information database with the dynamic information database. Furthermore, to demonstrate the practical applicability of the proposed simulator in the future, a test-bed was constructed for a currently operational metro station and the quantitative index of the proposed improvement effect was calculated by analyzing the walking speed of pedestrians before and after the improvement of the passage. The possibility of database extension for further analysis has also been discussed in this study.
Journal of the Korean association of regional geographers
/
v.22
no.3
/
pp.681-702
/
2016
Two different modelling approaches to dune dynamics have been established thus far; continuous models that emphasize the precise representation of wind field, and feedback-based models that focus on the interactions between dunes, rather than aerodynamics. Though feedback-based models have proven their capability to capture the essence of dune dynamics, the compatibility issues on these models have less been addressed. This research investigated, mostly from the theoretical point of view, the algorithmic compatibility of three feedback-based dune models: sand slab models, Nishimori model, and de Castro model. Major findings are as follows. First, sand slab models and de Castro model are both compatible in terms of flux perspectives, whereas Nishimori model needs a tuning factor. Second, the algorithm of avalanching can be easily implemented via repetitive spatial smoothing, showing high compatibility between models. Finally, the wind shadow rule might not be a necessary component to reproduce dune patterns unlike the interpretation or assumption of previous studies. The wind shadow rule, rather, might be more important in understanding bedform-level interactions. Overall, three models show high compatibility between them, or seem to require relatively small modification, though more thorough investigation is needed.
Journal of The Korean Association of Information Education
/
v.20
no.3
/
pp.243-254
/
2016
This study has produced a checker of the shortest path search problem with a total of 19 questions as a web-based computer evaluation based on the 'TRAFFIC' questions of PISA 2012. It is because the computer has been settled as an indispensable and significant instrument in the process of solving the problems of everyday life and as a media that is underlying in assessment. Therefore, information gifted students should be able to solve the problem using the computer and give clear enough commands to the computer so that it can perform the procedure. In addition, since it is the age that the computational thinking is affecting every sectors, it should give students new educational stimuli. The relationship between the rate of correct answers and the time took to solve the problem through the shortest route search process showed a significant correlation the variable that affected the problem solving as the difficulty of the question rises due to the increase of nodes and edges turned out to be the node than the edge. It was revealed that information gifted students went through algorithmic thinking in the process of solving the shortest route search problem. And It could be confirmed cognitive characteristics of the information gifted students such as 'ability streamlining' and 'information structure memory'.
This study investigated the characteristics of verbal interactions of various small groups based on previous achievement in paired think-aloud problem solving. Two classes of a high school were assigned to the homogeneous and heterogeneous groups, and taught on chemistry. Students from homogeneous groups (high${\cdot}$high, mid?id) and heterogeneous groups (high${\cdot}$mid, high${\cdot}$low) were selected, and their algorithmic problem solving on chemical equation and stoichiometry were audio/video taped. In high${\cdot}$high group, solver's 'require agreement' and listener 'agree' were frequently exhibited. On the other hands, listener's 'point out' and solver's 'modify' were frequently exhibited in mid${\cdot}$mid group, which was also observed in the heterogeneous groups (high${\cdot}$mid, high${\cdot}$low). Many verbal interactions were analyzed to be in symmetrical type. In this type, 'require agreement-agree' of high${\cdot}$high group was the most frequent. 'problem solving-agree' of high${\cdot}$high group was the most frequent in the solver-dominant type, while 'point out-modify' of high${\cdot}$low group in the listener-dominant type. The verbal behaviors related to the solving stage were frequently observed, but there were few related to the reviewing stage.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.