hyowong Goto Github PK

docker-tutorial

매우 쉽고 간단한 docker 사용법 정리

doma

DAO oriented database mapping framework for Java 8+

elastic-book

책에서 사용하는 샘플 예제

elasticsearch

Open Source, Distributed, RESTful Search Engine

examples

Home for Elasticsearch examples available to everyone. It's a great way to get started.

excel-parser-spring-boot-starter

Excel Parser

faiss

A library for efficient similarity search and clustering of dense vectors.

fih_hiding_algorithm

A problem that has been the focus of much recent research in privacy preserving data-mining is the frequent itemset hiding (FIH) problem. Identifying itemsets that appear together frequently in customer transactions is a common task in association rule mining. Organizations that share data with business partners may consider some of the frequent itemsets sensitive and aim to hide such sensitive itemsets by removing items from certain transactions. Since such modifications adversely affect the utility of the database for data mining applications, the goal is to remove as few items as possible. Since the frequent itemset hiding problem is NP-hard and practical instances of this problem are too large to be solved optimally, there is a need for heuristic methods that provide good solutions. This dissertation developed a new method called Min_Items_Removed, using the Frequent Pattern Tree (FP-Tree) that outperforms extant methods for the FIH problem. The FP-Tree enables the compression of large databases into significantly smaller data structures. As a result of this compression, a search may be performed with increased speed and efficiency. To evaluate the effectiveness and performance of the Min_Items_Removed algorithm, eight experiments were conducted. The results showed that the Min_Items_Removed algorithm yields better quality solutions than extant methods in terms of minimizing the number of removed items. In addition, the results showed that the newly introduced metric (normalized number of leaves) is a very good indicator of the problem size or difficulty of the problem instance that is independent of the number of sensitive itemsets.

file-upload

This project illustrates how to upload files and display them

fileupload

fileupload(util) drag&drop

file_converter

pdf, rtf, docx, hwp를 html로 변환하는 모듈입니다

financedatareader

Financial data reader

gateleen

Gateleen is a RESTful middleware toolkit for building API gateways

gluon-nlp

NLP made easy

googlesheets

Google Spreadsheets R API

gpt-neox

An implementation of model parallel autoregressive transformers on GPUs, based on the DeepSpeed library.

gravitee-gateway

Gravitee.io - API Management - OpenSource API Gateway

gravitee-management-rest-api

Gravitee.io - API Management - Management Rest API

guava

Google core libraries for Java

hnswlib

Header-only C++/python library for fast approximate nearest neighbors

https---github.com-kimsq-rb

hwplib

hwp library for java

hystrix

Hystrix is a latency and fault tolerance library designed to isolate points of access to remote systems, services and 3rd party libraries, stop cascading failure and enable resilience in complex distributed systems where failure is inevitable.

hystrix-vertx-metrics-stream

Vert.x implementation of a Hystrix Events Metrics Stream

i7j-pdfsweep

Remove content from your digital documents irretrievably instead of just covering it up. Redact text, images, parts of images or drawings for complete confidentiality. iText pdfSweep complies with GDPR for data redaction.

incubator-mxnet

Lightweight, Portable, Flexible Distributed/Mobile Deep Learning with Dynamic, Mutation-aware Dataflow Dep Scheduler; for Python, R, Julia, Scala, Go, Javascript and more

ipython-notebooks

jackrabbit

Mirror of Apache Jackrabbit

jackrabbit-oak

Mirror of Apache Jackrabbit Oak

java-concurrency

java concurrency 예제 정리