• ETRI Journal
• /
• 제45권1호
• /
• pp.45-59
• /
• 2023

In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

• Journal of Electrical Engineering and Technology
• /
• 제7권5호
• /
• pp.681-688
• /
• 2012

This paper presents the application of Differential Evolution (DE) algorithm to obtain a solution for Bid Based Dynamic Economic Dispatch (BBDED) problem including the transmission losses and to maximize the social profit in a deregulated power system. The IEEE-30 bus test system with six generators, two customers and two trading periods are considered under various bidding strategies in a day-ahead electricity market. By matching the bids received from supplying and distributing entities, the Independent System Operator (ISO) maximize the social profit, (with the choices available). The simulation results of DE are compared with the results of Particle swarm optimization (PSO). The results demonstrate the potential of DE algorithm and show its effectiveness to solve BBDED.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.549-550
• /
• 2021

본 논문에서는 다양한 돌연변이 전략을 인식하기 위해 MUDE (Uniform Local Search)를 사용한 다중 인구 차등 진화 알고리즘을 제안한다. MUDE에서 집단은 진화 비율(DE/rand/1 및 DE/current-to-rand/1)에 따라 서로 다른 돌연변이 전략을 수행하는 다른 집단 크기를 가진 여러 하위 집단으로 나뉜다. 인구의 다양성을 개선하기 위해 정보는 소프트 아일랜드 모델에 의해 하위 인구 간에 마이그레이션된다.

• 전기전자학회논문지
• /
• 제7권2호
• /
• pp.197-209
• /
• 2003

현행 TV 신호는 HDTV나 컴퓨터 모니터에서 사용하는 encoding 기술과는 완전히 다르다. 다시 말하면 기존의 아날로그 TV에서는 Interlace 방식을 사용하는 반면 HDTV 및 컴퓨터 모니터에서는 Interlace 방식 대신 Progressive 방식을 사용한다. 따라서 Interlace 방식을 사용하는 미디어의 신호를 Progressive 방식을 사용하는 미디어에서 사용하기 위해서는 보간 알고리즘이 필요하다. 보간 알고리즘으로는 ELA(Edge-Based Line Average) 알고리즘이 보편적으로 사용된다. 본 논문에서는 ELA 알고리즘의 수평 및 수직 윤곽선 복원 단점을 개선시킨 ADI(Adaptive De-interlacing Interpolation) 알고리즘을 사용하여 Interlace 방식의 YUV 디지털 신호를 Progressive 방식의 RGB 디지털 신호로 변환시켜 주는 주사선 변환 ASIC 칩을 설계하였다. 설계 언어로는 VHDL이 사용되었다.

• Archives of Plastic Surgery
• /
• 제50권1호
• /
• pp.17-25
• /
• 2023

A variety of reduction labiaplasty techniques have been introduced to date, but no single technique will offer the optimal solution for every patient. Rather, the technique should be chosen based on anatomical, configurational, and technical considerations, as well as on patients' personal preferences regarded maintenance of the labial rim, maintenance of labial sensitivity, and prevention of iatrogenic thickening of the labium. We reviewed, defined, and assessed labial configurational variety, neurovascular supply, reduction techniques, and patient's preferences as the considerations relevant to the choice of labiaplasty technique. Based on this review, an algorithm was constructed that leads to a choice of reduction technique through five decisions to be made regarding (1) resection or (partial) retention of the labial free rim, (2) the measure of required labial width reduction, (3) labial vascular status, (4) prevention of iatrogenic labial thickening, and (5) preservation of labial sensibility. The choice of techniques includes edge trimming, central spindle form de-epithelialization or full-thickness resection, and three modifications of the wedge resection or de-epithelialization technique. These three modifications comprised a modified anterior resection or de-epithelialization combined with posterior flap transposition, a custom flask resection or de-epithelialization, and a modified posterior wedge resection or de-epithelialization combined with anterior flap transposition. Use of the five decisional steps and the inclusion of modifications of all three conventional reduction techniques offer an improved algorithm for the choice of labioplasty technique.

• 대한전자공학회논문지SP
• /
• 제44권5호
• /
• pp.94-102
• /
• 2007

잠음감소에 있어서 웨이브렛 임계처리 알고리즘은 미니맥스 관점에서 거의 최적의 성능을 보이는 것으로 알려져 있다. 그러나 웨이브렛 임계처리 알고리즘은 웨이브렛 함수의 복잡성으로 인해 FPGA와 같은 하드웨어 상에 구현이 어렵다. 본 논문에서는 이진트리 구조 필터뱅크에서 전체 신호전력에 대한 각 부밴드 신호 전력비에 기반한 새로운 잡음감소 기법을 제안한다. 그리고 이 기법을 FPGA 상에 구현한다. 간단한 구현을 위해 필터뱅크는 하다마드 변환 계수로 설계된다. 시뮬레이션과 하드웨어 실험결과 제안방법이 간단하지만 웨이브렛에 기반한 소프트 임계처리 잡음감소 알고리즘과 성능이 유사함을 보인다.

• Computers and Concrete
• /
• 제16권2호
• /
• pp.329-342
• /
• 2015

The present paper aims at developing a method to accommodate multi-surface concrete plasticity from the point of view of a consistency concept applied to general tangent operators. The idea is based on a Taylor series expansion of the actual effective stress at the stress point corresponding to the previous accumulated true stresses plus the current increment values, initially taken to be elastic. The proposed algorithm can be generalized for any multi-surface criteria combination and has been tested here for typical cement-based materials. A few examples of application are presented to demonstrate the effectiveness of the multi-surface technique as used to a combination of Rankine and Drucker-Prager yield criteria.

• Journal of Electrical Engineering and Technology
• /
• 제4권3호
• /
• pp.323-329
• /
• 2009

This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems since it is restricted to continuous-valued spaces. This paper proposes binary differential evolution (BDE), which enables the DE to operate in binary spaces and applies the proposed BDE to UC problems. Furthermore, this paper includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in UC problems. Since excessive spinning reserves can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BDE, it is applied to largescale power systems of up to 100-units with a 24-hour demand horizon.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5731-5754
• /
• 2019

In this paper, we redesign, implement, and evaluate ShareSafe (Based on SecGraph), an open-source secure graph data sharing/publishing platform. Within ShareSafe, we propose De-anonymization Quantification Module and Recommendation Module. Besides, we model the attackers' background knowledge and evaluate the relation between graph data privacy and the structure of the graph. To the best of our knowledge, ShareSafe is the first platform that enables users to perform data perturbation, utility evaluation, De-A evaluation, and Privacy Quantification. Leveraging ShareSafe, we conduct a more comprehensive and advanced utility and privacy evaluation. The results demonstrate that (1) The risk of privacy leakage of anonymized graph increases with the attackers' background knowledge. (2) For a successful de-anonymization attack, the seed mapping, even relatively small, plays a much more important role than the auxiliary graph. (3) The structure of graph has a fundamental and significant effect on the utility and privacy of the graph. (4) There is no optimal anonymization/de-anonymization algorithm. For different environment, the performance of each algorithm varies from each other.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 제38회 하계학술대회
• /
• pp.848-849
• /
• 2007

This paper presents an efficient approach for solving the economic dispatch (ED) problems with valve-point effects using differential evolution (DE). A DE, one of the evolutionary algorithms (EAs), is a novel optimization method capable of handling nonlinear, non-differentiable, and nonconvex functions. And an efficient constraints treatment method (CTM) is applied to handle the equality and inequality constraints. The resultant DE-CTM algorithm is very effective in solving the ED problems with nonconvex cost functions. To verify the superiority of the proposed method, a sample ED problem with valve-point effects is tested and its results are compared with those of previous works. The simulation results clearly show that the proposed DE-CTM algorithm outperforms other state-of-the-art algorithms in solving ED problems with valve-point effects