All public logs

Combined display of all available logs of CS Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)

• 18:46, 27 February 2025 AlanTuring talk contribs created page 특성 방정식 (Created page with "'''특성 방정식'''(Characteristic Equation)은 점화식이나 선형 상미분 방정식의 해를 구하기 위해 사용되는 방정식이다. 점화식에서 특성 방정식은 수열의 일반해를 구하는 데 중요한 역할을 한다. ==정의== 특성 방정식은 동차 점화식의 일반해를 찾기 위해 다음과 같이 정의된다. *점화식: **a_n + c₁a_n-1 + c₂a_n-2 + ... + c_ka<...") Tag: Visual edit
• 18:44, 27 February 2025 AlanTuring talk contribs created page 비동차 점화식 (Created page with "'''비동차 점화식'''(Non-Homogeneous Recurrence Relation)은 동차 점화식과 달리, 점화식의 오른쪽에 상수항 또는 독립적인 함수가 포함되는 점화식을 의미한다. 즉, 항들이 이전 항들의 선형 결합뿐만 아니라 추가적인 항을 포함하는 경우이다. ==정의== 비동차 점화식은 일반적으로 다음과 같이 표현된다. *a_n + c₁a_n-1 + c₂a_n-2 + ......") Tag: Visual edit
• 18:44, 27 February 2025 AlanTuring talk contribs created page 동차 점화식 (Created page with "'''동차 점화식'''(Homogeneous Recurrence Relation)은 항들이 동일한 점화식을 따르며, 특정한 항들이 이전 항들의 선형 결합으로 표현되는 점화식을 의미한다. ==정의== 동차 점화식은 일반적으로 다음과 같이 표현된다. *a_n + c₁a_n-1 + c₂a_n-2 + ... + c_ka_n-k = 0 여기서, *a_n은 점화식의 n번째 항 *c₁, c<sub>2<...") Tag: Visual edit
• 15:13, 27 February 2025 User account Tylerthase talk contribs was created
• 01:04, 27 February 2025 AlanTuring talk contribs created page File:B 트리 구조.png
• 01:04, 27 February 2025 AlanTuring talk contribs uploaded File:B 트리 구조.png
• 00:54, 27 February 2025 AlanTuring talk contribs created page 이진 탐색 (새 문서: '''이진 탐색'''(Binary Search)은 정렬된 배열에서 원하는 값을 효율적으로 찾는 탐색 알고리즘이다. 이진 탐색은 탐색 범위를 절반씩 줄여 O(log n)의 시간 복잡도를 가진다. ==알고리즘 개요== *정렬된 배열에서만 적용 가능하다. *탐색 범위를 절반씩 줄이며, 중간 값을 기준으로 비교한다. ==이진 탐색 과정== #배열의 중간 요소를 선택한다. #찾고자 하는 값과 비교한다. #...) Tag: Visual edit
• 00:51, 27 February 2025 Itwiki talk contribs deleted page Category:Information Science (113.165.147.154님이 추가한 문서를 대량 삭제함)
• 00:51, 27 February 2025 Itwiki talk contribs blocked 113.165.147.154 talk with an expiration time of indefinite (account creation disabled)
• 21:56, 26 February 2025 113.165.147.154 talk created page Category:Information Science (새 문서: Hi. We run a YouTube growth service, which increases your number of subscribers both safety and practically. - We guarantee to gain you new 700 subscribers per month - People subscribe because they are interested in your videos/channel, increasing video likes, comments and interaction. - All actions are made manually by our team. We do not use any bots. The price is just $60 (USD) per month, and we can start immediately. If you are interested and would like to see some of our...)
• 18:59, 26 February 2025 AlanTuring talk contribs created page Kruskal’s Algorithm (Created page with "'''Kruskal’s Algorithm''' is a greedy algorithm used to find a '''Minimum Spanning Tree (MST)''' for a weighted, connected, and undirected graph. It works by sorting all edges by weight and adding them one by one while ensuring no cycles are formed. ==Concept== Kruskal’s Algorithm follows these principles: #'''Sort all edges''' in non-decreasing order of weight. #'''Select the smallest edge''' that does not form a cycle. #'''Repeat''' until the MST contains exactly (...") Tag: Visual edit
• 18:55, 26 February 2025 AlanTuring talk contribs created page Prim's Algorithm (Created page with "'''Prim's Algorithm''' is a greedy algorithm used to find a Minimum Spanning Tree (MST) for a weighted, connected, and undirected graph. The algorithm builds the MST by starting from an arbitrary vertex and iteratively adding the smallest edge that connects a vertex in the tree to a vertex outside the tree. ==Definition== Given a weighted, connected, undirected graph '''G = (V, E)''', Prim's Algorithm constructs a spanning tree '''T''' such that the total weight of the e...") Tag: Visual edit
• 18:53, 26 February 2025 AlanTuring talk contribs created page Generic Greedy Minimum Spanning Tree Algorithm (Created page with "'''Generic Greedy Minimum Spanning Tree Algorithm''' is a fundamental approach for constructing a Minimum Spanning Tree (MST) by iteratively selecting the smallest available edge that does not form a cycle. It is the basis for well-known MST algorithms such as Kruskal’s and Prim’s algorithms. ==Concept== The generic greedy MST algorithm follows a greedy strategy: #'''Initialize''' an empty set to store the MST edges. #'''Sort''' all edges by weight (if not already so...") Tag: Visual edit
• 18:46, 26 February 2025 AlanTuring talk contribs created page Minimum Spanning Tree (Created page with "'''Minimum Spanning Tree (MST)''' is a subset of edges in a weighted, connected, and undirected graph that connects all the vertices with the minimum possible total edge weight, without forming any cycles. ==Definition== Given an undirected graph '''G = (V, E)''', where: *'''V''' is the set of vertices. *'''E''' is the set of edges with weights. A minimum spanning tree satisfies: *It includes all vertices from '''V'''. *It forms a tree (i.e., a connected acyclic subgraph...") Tag: Visual edit
• 18:43, 26 February 2025 AlanTuring talk contribs created page Bin Packing Problem (Created page with "'''Bin Packing Problem''' is a combinatorial optimization problem that involves packing objects of varying sizes into a finite number of bins with a fixed capacity while minimizing the number of bins used. ==Definition== Given: *A set of '''n''' items, each with a weight '''w_i'''. *A set of bins, each with a fixed capacity '''C'''. The objective is to pack all items into the smallest number of bins such that: *The total weight of items in any bin does not exce...") Tag: Visual edit
• 18:40, 26 February 2025 AlanTuring talk contribs created page NP-hard Problem (Created page with "'''NP-hard problem''' refers to a class of problems in computational complexity theory that are at least as hard as the hardest problems in NP (nondeterministic polynomial time). NP-hard problems do not necessarily belong to NP, meaning they may not have a polynomial-time verification process. ==Definition== A problem is '''NP-hard''' if: *Every problem in NP can be reduced to it in polynomial time. *It does not have to be in NP itself (i.e., it may not be decidable in p...") Tag: Visual edit
• 18:35, 26 February 2025 AlanTuring talk contribs created page Huffman Code (Created page with "'''Huffman Code''' is a lossless data compression algorithm that assigns variable-length binary codes to input characters based on their frequency. It is widely used in data compression applications such as file compression and encoding. ==Concept== Huffman coding works by assigning shorter codes to more frequent characters and longer codes to less frequent characters, minimizing the total number of bits used to represent the data. ==Algorithm== The Huffman coding algori...") Tag: Visual edit
• 18:34, 26 February 2025 Itwiki talk contribs deleted page Category:Information Science (Mass deletion of pages added by 165.231.70.104)
• 13:58, 26 February 2025 Slack talk contribs created page Sortino Ratio (새 문서: '''Sortino Ratio''' is a financial metric used to measure the risk-adjusted return of an investment, similar to the Sharpe Ratio. However, unlike the Sharpe Ratio, the Sortino Ratio only considers downside risk, making it a more precise tool for evaluating investments where investors are primarily concerned with losses. ==Definition== The Sortino Ratio is calculated as: *Sortino Ratio = (R_p - R_f) / σ_d where: *'''R_p''' – Return o...) Tag: Visual edit
• 13:56, 26 February 2025 Itwiki talk contribs blocked 162.158.107.67 talk with an expiration time of indefinite (anonymous users only, account creation disabled)
• 13:55, 26 February 2025 Itwiki talk contribs deleted page MartheHendrickson760 (162.158.107.67님이 추가한 문서를 대량 삭제함)
• 13:55, 26 February 2025 Itwiki talk contribs blocked 162.158.106.24 talk with an expiration time of indefinite (account creation disabled)
• 13:55, 26 February 2025 Itwiki talk contribs deleted page KrystalleOgburn969 (162.158.106.24님이 추가한 문서를 대량 삭제함)
• 13:54, 26 February 2025 Itwiki talk contribs blocked 43.242.177.106 talk with an expiration time of indefinite (account creation disabled)
• 13:53, 26 February 2025 Itwiki talk contribs deleted page User:MartheHendrickson760 (43.242.177.106님이 추가한 문서를 대량 삭제함)
• 13:53, 26 February 2025 Itwiki talk contribs deleted page User:KrystalleOgburn969 (43.242.177.106님이 추가한 문서를 대량 삭제함)
• 13:52, 26 February 2025 Itwiki talk contribs blocked 162.158.94.161 talk with an expiration time of indefinite (anonymous users only, account creation disabled)
• 13:52, 26 February 2025 Itwiki talk contribs deleted page Нагиса Шиота: глубина персонажа и влияние на аниме (162.158.94.161님이 추가한 문서를 대량 삭제함)
• 13:51, 26 February 2025 Itwiki talk contribs blocked 92.222.249.55 talk with an expiration time of indefinite (account creation disabled)
• 13:51, 26 February 2025 Itwiki talk contribs deleted page Девушки в снегу: миф или реальность? (92.222.249.55님이 추가한 문서를 대량 삭제함)
• 17:23, 25 February 2025 Slack talk contribs created page Open-High-Low-Close (Created page with "'''Open-High-Low-Close (OHLC)''' refers to the four key price points recorded for a financial instrument during a specific time period. These values are used in technical analysis to assess price movement and market trends. ==Components== An OHLC data point consists of: *'''Open (O)''' – The price at which the asset starts trading in a given time period. *'''High (H)''' – The highest price reached during the time period. *'''Low (L)''' – The lowest price reached du...") Tag: Visual edit
• 16:04, 25 February 2025 Slack talk contribs created page Range Breakout System (Created page with "'''Range Breakout System''' is a trading strategy that identifies and trades price breakouts from a predefined range. Traders use this system to capture momentum when an asset moves beyond a support or resistance level. ==Concept== The strategy is based on the assumption that when the price breaks above or below a well-defined range, it is likely to continue moving in that direction. The range is typically defined by: *'''High and low prices over a period''' – Example:...") Tag: Visual edit
• 15:59, 25 February 2025 Slack talk contribs created page 1-200 Moving Average System (Created page with "'''1-200 Moving Average System''' is a trend-following trading strategy that uses the interaction between the 1-day and 200-day moving averages to generate buy and sell signals. This system is widely used in technical analysis to capture long-term trends and avoid false signals. ==Concept== The strategy relies on: *'''1-day moving average (1MA)''' – Represents the most recent closing price. *'''200-day moving average (200MA)''' – Represents the long-term trend. Trade...") Tag: Visual edit
• 15:54, 25 February 2025 Slack talk contribs created page Hindsight Bias (Created page with "'''Hindsight Bias''' is a cognitive bias that leads people to perceive past events as having been more predictable than they actually were. This bias distorts memory and judgment, making individuals believe they "knew it all along" after an event has occurred. ==Definition== Hindsight bias occurs when people: *Overestimate their ability to predict an outcome after knowing what happened. *View past events as more obvious than they were at the time. *Misremember their prev...") Tag: Visual edit
• 15:49, 25 February 2025 Slack talk contribs created page Trend Following Strategy (Created page with "'''Trend Following Strategy''' is a trading approach that seeks to capitalize on market trends by buying assets in an uptrend and selling (or shorting) assets in a downtrend. It is widely used in stocks, commodities, forex, and futures markets. ==Concept== Trend following strategies operate on the principle that markets tend to move in sustained trends rather than random fluctuations. Traders using this approach do not attempt to predict price movements but instead react...") Tag: Visual edit
• 15:48, 25 February 2025 Slack talk contribs created page Behind the Eight Ball (Created page with "'''Behind the Eight Ball''' is an idiomatic expression meaning to be in a difficult, disadvantageous, or losing situation. The phrase originates from the game of pool, where being positioned behind the 8-ball can leave a player without a clear shot. ==Origin== The expression comes from '''Kelly Pool''', a variation of pocket billiards. In this game: *Players are assigned specific balls. *The 8-ball is often an obstacle. *If a player's cue ball is positioned behind the 8-...") Tag: Visual edit
• 15:38, 25 February 2025 User account Slack talk contribs was created
• 06:21, 25 February 2025 92.222.249.55 talk created page Девушки в снегу: миф или реальность? (새 문서: == Девушки в снегу: миф или реальность? == Снег – это волшебство, которое преображает мир вокруг нас и наполняет его особым шармом. А девушки в снегу? Это просто воплощение нежности, красоты и сказочности. Виды снежной стихии создают неповторимый фон для женской изя...)
• 06:21, 25 February 2025 User account Ybarowyh talk contribs was created
• 00:47, 25 February 2025 User account Yhs133 talk contribs was created
• 19:22, 23 February 2025 162.158.94.161 talk created page Нагиса Шиота: глубина персонажа и влияние на аниме (새 문서: == Нагиса Шиота: глубина персонажа и влияние на аниме == она искренне стремится сделать мир лучше и заботится о благополучии тех, кого любит. Своей силой Нагиса не только защищает близких, но и пытается понять себя. Её способность управлять водой символизирует ее в...)
• 19:21, 23 February 2025 User account Uziqy talk contribs was created
• 15:15, 20 February 2025 165.231.70.104 talk created page Category:Information Science (Created page with "Hi there, We run a YouTube growth service, which increases your number of subscribers both safely and practically. - We guarantee to gain you 700-1500+ subscribers per month. - People subscribe because they are interested in your channel/videos, increasing likes, comments and interaction. - All actions are made manually by our team. We do not use any 'bots'. The price is just $60 (USD) per month, and we can start immediately. If you have any questions, let me know, a...")
• 17:47, 19 February 2025 AlanTuring talk contribs created page 트리 순회 (새 문서: '''트리 순회'''(Tree Traversal)는 트리(Tree) 구조에서 모든 노드를 특정한 순서에 따라 방문하는 방법이다. 트리 순회는 탐색, 정렬, 표현식 계산 등 다양한 응용에서 사용된다. ==순회의 종류== 트리 순회는 크게 '''깊이 우선 탐색(DFS, Depth-First Search)'''과 '''너비 우선 탐색(BFS, Breadth-First Search)'''으로 구분된다. ===깊이 우선 탐색 (DFS)=== DFS는 트리의 한쪽 끝까지 탐색한 후...) Tag: Visual edit
• 17:43, 19 February 2025 AlanTuring talk contribs created page 경로 (새 문서: '''경로'''(Path)는 그래프 이론에서 한 정점에서 다른 정점까지 이동할 수 있는 정점과 간선의 연속된 연결을 의미한다. 경로는 여러 분야에서 활용되며, 최단 경로 문제, 네트워크 라우팅, 교통 시스템 등에서 중요한 개념이다. ==정의== *그래프 '''G = (V, E)'''에서 '''경로 P'''는 정점들의 시퀀스로 정의된다. *수학적으로, 경로 P는 다음과 같이 표현된다. **P = (v₁...) Tag: Visual edit
• 17:36, 19 February 2025 AlanTuring talk contribs created page 인접 리스트 (새 문서: '''인접 리스트'''(Adjacency List)는 그래프를 표현하는 방법 중 하나로, 각 정점이 연결된 이웃 정점들을 리스트 형태로 저장하는 방식이다. 이 방법은 간선이 적은 '''희소 그래프(Sparse Graph)'''에 적합하며, 메모리 효율성이 높다. ==정의== 인접 리스트는 그래프 G = (V, E)에 대해 다음과 같이 정의된다. *각 정점 V_i는 자신과 연결된 정점들의 리스트를 갖는다. *간...) Tag: Visual edit
• 17:35, 19 February 2025 AlanTuring talk contribs created page 인접 행렬 (새 문서: '''인접 행렬'''(Adjacency Matrix)은 그래프를 표현하는 방법 중 하나로, 정점 간의 연결 관계를 2차원 행렬 형태로 나타낸다. 인접 행렬은 그래프의 저장과 연산을 효율적으로 수행하는 데 사용된다. ==정의== 인접 행렬 A는 그래프 G = (V, E)에 대해 다음과 같이 정의된다. *'''A_ij = 1''' (i에서 j로 간선이 존재하면 1) *'''A_ij = 0''' (i에서 j로 간선이 없으면 0) 무...) Tag: Visual edit
• 17:34, 19 February 2025 AlanTuring talk contribs created page 평면 그래프 (새 문서: '''평면 그래프'''(Planar Graph)는 간선이 교차하지 않고 평면(2차원 공간) 상에 그릴 수 있는 그래프를 의미한다. 그래프 이론에서 평면 그래프는 위상 기하학 및 전기 회로 설계, 네트워크 분석 등 다양한 분야에서 활용된다. ==정의== *평면 그래프 G는 평면 위에서 간선이 교차하지 않도록 그릴 수 있는 그래프이다. *평면 그래프가 아닌 그래프는 '''비평면 그래프(Non-Pla...) Tag: Visual edit
• 12:25, 19 February 2025 리눅스마스터 talk contribs created page 리눅스 DBus (새 문서: '''DBus'''(Desktop Bus)는 리눅스 및 유닉스 계열 운영 체제에서 애플리케이션 간 통신(IPC, Inter-Process Communication)을 위한 메시지 버스 시스템이다. 프리데스크톱(freedesktop.org)에서 개발하였으며, 데스크톱 환경뿐만 아니라 시스템 서비스에서도 널리 사용된다. ==개요== DBus는 프로세스 간 데이터를 교환하기 위한 메시지 버스 시스템으로, 두 개의 주요 버스를 제공한다. *''...) Tag: Visual edit
• 18:59, 18 February 2025 175.123.96.40 talk created page 린 스타트업 (속도,피드백,반복)

(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)