• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.502-510
• /
• 2007

Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1C
• /
• pp.1-8
• /
• 2005

In this paper, we present a novel LDPC code construction called as semi-algebra low density parity check(LDPC) codes which is one kind of deterministic LDPC code based on dual-diagonal sub-matrix. The constructing method results in a class of high rate LDPC codes. Codes in this class have a large girth and good minimum distances. Furthermore, they can be implemented by simple parallel array architecture using cyclic shift register and perform well with the iterative decoding.

• Structural Engineering and Mechanics
• /
• v.67 no.5
• /
• pp.439-455
• /
• 2018

Within a probabilistic framework, this paper addresses the determination of the static structural response of beams and frames with partially restrained (semi-rigid) connections. The flexibility of the nodal connections is incorporated via an idealized linear-elastic behavior of the beam constraints through the use of rotational springs, which are here considered uncertain for taking into account the largely scattered results observed in experimental findings. The analysis is conducted via the Probabilistic Transformation Method, by modelling the spring stiffness terms (or equivalently, the fixity factors of the beam) as uniformly distributed random variables. The limit values of the Eurocode 3 fixity factors for steel semi-rigid connections are assumed. The exact probability density function of a few indicators of the structural response is derived and discussed in order to identify to what extent the uncertainty of the beam constraints affects the resulting beam response. Some design considerations arise which point out the paramount importance of probability-based approaches whenever a comprehensive experimental background regarding the stiffness of the beam connection is lacking, for example in steel frames with semi-rigid connections or in precast reinforced concrete framed structures. Indeed, it is demonstrated that resorting to deterministic approaches may lead to misleading (and in some cases non-conservative) outcomes from a design viewpoint.

• Structural Engineering and Mechanics
• /
• v.31 no.5
• /
• pp.621-624
• /
• 2009

The time delay in active and semi-active controls is an important research subject. Many researches on the time-delay control for deterministic systems have been made (Hu and Wang 2002, Yang et al. 1990, Abdel-Mooty and Roorda 1991, Pu 1998, Cai and Huang 2002), while the study on that for stochastic systems is very limited. The effects of the time delay on the control of nonlinear systems under Gaussian white noise excitations have been studied by Bilello et al. (2002). The controlled linear systems with deterministic and random time delay subjected to Gaussian white noise excitations have been treated by Grigoriu (1997). Recently, a stochastic averaging method for quasi-integrable Hamiltonian systems with time delay has been proposed (Liu and Zhu 2007). In the present paper, a stochastic optimal time-delay control method for stochastically excited nonlinear structural systems is proposed based on the stochastic averaging method for quasi Hamiltonian systems with time delay and the stochastic dynamical programming principle. An example of stochastically excited and controlled hysteretic column is given to illustrate the proposed control method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.484-489
• /
• 2006

Private Matching은 각기 다른 두 참여자 (two-party)가 가진 데이터의 교집합 (intersection)을 구하는 문제이다. Private matching은 보험사기 방지시스템 (insurance fraud detection system), 의료정보 검색, 항공기 탐승 금지자 목록 (Do-not-fly list) 검색 등에 이용될 수 있으며 다자간의 계산 (multiparty computation)으로 확장하면 전자투표, 온라인 게임 등에도 이용될 수 있다. 2004년 Freedman 등은 이 문제를 확률적 (probabilistic)으로 해결하는 프로토콜 (protocol) [1]을 제안하고 악의적인 공격자 (malicious adversary) 모델과 다자간 계산으로 확장하였다. 이 논문에서는 기존의 프로토콜을 결정적 (deterministic) 방법으로 개선하여 Semi-Honest 모델에서 결과의 정확성을 보장하는 한편, 이를 악의적인 공격자 모델에 확장하여 신뢰도와 연산속도를 향상시키는 새로운 프로토콜을 제안한다.

• International Journal of CAD/CAM
• /
• v.9 no.1
• /
• pp.1-16
• /
• 2010

When Deterministic Design Optimization (DDO) methods are used, deterministic optimum designs are frequently pushed to the design constraint boundary, leaving little or no room for tolerances (or uncertainties) in design, manufacture, and operating processes. In the Reliability-Based Design Optimization (RBDO) model for robust system design, the mean values of uncertain system variables are usually used as design variables, and the cost is optimized subject to prescribed probabilistic constraints as defined by a nonlinear mathematical programming problem. Therefore, a RBDO solution that reduces the structural weight in uncritical regions does not only provide an improved design but also a higher level of confidence in the design. In this work, we seek to improve the quality of RBDO processes using efficient optimization techniques with object of improving the resulting objective function and satisfying the required constraints. Our recent RBDO developments show its efficiency and applicability in this context. So we present some recent structural engineering applications demonstrate the efficiency of these developed RBDO methods.

• Journal of Korean Association for Spatial Structures
• /
• v.21 no.2
• /
• pp.41-48
• /
• 2021

A smart tuned mass damper (TMD) is widely studied for seismic response reduction of various structures. Control algorithm is the most important factor for control performance of a smart TMD. This study used a Deep Deterministic Policy Gradient (DDPG) among reinforcement learning techniques to develop a control algorithm for a smart TMD. A magnetorheological (MR) damper was used to make the smart TMD. A single mass model with the smart TMD was employed to make a reinforcement learning environment. Time history analysis simulations of the example structure subject to artificial seismic load were performed in the reinforcement learning process. Critic of policy network and actor of value network for DDPG agent were constructed. The action of DDPG agent was selected as the command voltage sent to the MR damper. Reward for the DDPG action was calculated by using displacement and velocity responses of the main mass. Groundhook control algorithm was used as a comparative control algorithm. After 10,000 episode training of the DDPG agent model with proper hyper-parameters, the semi-active control algorithm for control of seismic responses of the example structure with the smart TMD was developed. The simulation results presented that the developed DDPG model can provide effective control algorithms for smart TMD for reduction of seismic responses.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1680-1686
• /
• 1996

The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.