본문 바로가기

카테고리 없음

2021-01-14 22시 개발자 글 모음 | "[알고리즘] 2018 KAKAO BL" 외 12개 이야기

[XAI] Explainable Artificial Intelligence (XAI) - 2 by 장지수

  • intelligibility) denotes the characteristic of a model to make a human understand its function – how the model works – without any need for explaining its internal structure or the algorithmic means by which the model processes data internally [18]
  • the amount of papers stating that the ability of rendering a model explainable is to better understand the concepts needed to reuse it or to improve its performance is the second most used reason for pursuing model explainability
  • The main constraint for algorithmically transparent models is that the model has to be fully explorable by means of mathematical analysis and methods


[알고리즘] 최단 경로 - 벨먼포드 알고리즘 by 김우경 about Node,Algorithm

  • readline INF = int ( 1e9 ) def bf ( start ) : dist [ start ] = 0 for i in range ( n ) : for j in range ( m ) : now = edges [ j ] [ 0 ] next_node = edges [ j ] [ 1 ] cost = edges [ j ] [ 2 ] if dist [ now ] != INF and dist [ next_node ] > dist [ now ] + cost : dist [ next_node ] = dist [ now ] + cost if i == n - 1 : return True return False n
  • split ( ) ) edges = [ ] dist = [ INF ] * ( n + 1 ) for _ in range ( m ) : a
  • n + 1 ) : if dist [ i ] == INF : print ( "-1" ) else : print ( dist [ i ] )


뉴스 및 SNS가 투자에 미치는 영향 by 김형준

  • today’s net investments of followers in the shared trading strategy increase by about 6% compared to the average daily net investments for the same portfolio (and higher activity lasts for about 3 weeks)
  • a one standard deviation increase in the fraction of positive words is associated with a significant increase in net investments of followers by about 4% on average
  • We develop a classification methodology for the context and content of news articles to predict risk and return in stock markets in 51 developed and emerging economies


vue.js(1) 기초 by 김영재 about Vue


    [BOJ] 1865 - 웜홀 by 김우경

    • readline INF = int ( 1e9 ) def bf ( start ) : dist [ start ] = 0 pre = dist [ start ] for i in range ( n ) : for j in range ( len ( edges ) ) : now = edges [ j ] [ 0 ] next_node = edges [ j ] [ 1 ] cost = edges [ j ] [ 2 ] if dist [ now ] != INF and dist [ next_node ] > dist [ now ] + cost : dist [ next_node ] = dist [ now ] + cost if dist [ start ] < pre : return True pre = dist [ start ] return False tc = int ( input ( ) ) answer = [ ] for _ in range ( tc ) : n
    • def bf ( ) : dist [ 1 ] = 0 for i in range ( n ) : for now
    • cost in edges : if dist [ next_node ] > dist [ now ] + cost : dist [ next_node ] = dist [ now ] + cost if i == n - 1 : return True return False tc = int ( input ( ) ) answer = [ ] for _ in range ( tc ) : n


    Vue.js(2) Component/Router by 김영재 about Vue


      Vue.js(3) Axios/CLI by 김영재 about Vue


        비전공자의 임베디드학습 준비 by 장윤수

        • 이 제품을 구매한 이유는 Atmega128 단독으로 USB연결은 매우 힘들기 때문이다
        • 나는 그 중 CodeVisionAVR이란 프로그램을 사용하기로 결정하였다
        • 다음 글은 Atmega128과 ISP 그리고 이 작업환경으로 LED를 제어해볼것이다


        [Live-Study] 자바 데이터 타입, 변수 그리고 배열 by 김태정 about Java

        • int b ) { int c = 0 ; num1 = a ; num2 = b ; return a + b ; } public static void main ( String args [ ] ) { scope_and_lifetime ob = new scope_and_lifetime ( ) ; result = ob
        • public class scope_and_lifetime { public static void main ( String args [ ] ) { int a = 10 ; { int x = a ; { int y = x ; } } System
        • class Test { public static void main ( String args [ ] ) { byte b = 42 ; char c = 'a' ; short s = 1024 ; int i = 50000 ; float f = 5


        영어 문장 구조 분석 12 by 김이삭

        • <주어와 동사 사이에 쉼표를 가지고 들어와서 주어를 꾸미는 동격 명사구>
        • <주어와 동사 사이에 쉼표를 가지고 들어와서 주어를 꾸미는 현재분사구>
        • <주어와 동사 사이에 쉼표를 가지고 들어와서 주어를 꾸미는 동격 명사구>


        2020년 디지털 헬스케어 투자 동향과 판데믹 이후의 ‘새로운 균형’ by 최윤섭


          이제와서 쓰는 2020년 회고 by 허전진


            [알고리즘] 2018 KAKAO BLIND RECRUITMENT - [1차] 프렌즈4블록 by 김지용 about Algorithm

            • board): deleted_count = 0 my_board = make_board(board) while True: candidates_set = set() # 겹치는 부분 찾기 for i in range(1
            • j) # 겹치는 블록 개수 == 삭제된 블록 개수 deleted_count += len(candidates_set) # 겹치는 블록 없을 경우 탈출 if not candidates_set: break # 겹치는 블록 제거 및 판(board) 조정 delete_candidates_set(my_board
            • j): if board[i-1][j-1] == board[i-1][j] == board[i][j-1] == board[i][j] != " ": return True return False def make_board(board): my_board = [] for row in board: my_board


            태그