• Title/Summary/Keyword: pseudo-points

Search Result 100, Processing Time 0.033 seconds

Memory-Efficient Time-Memory Trade-Off Cryptanalysis (메모리 효율적인 TMTO 암호 해독 방법)

  • Kim, Young-Sik;Lim, Dae-Woon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1C
    • /
    • pp.28-36
    • /
    • 2009
  • Time-memory trade-off (TMTO) cryptanalysis proposed by Hellman can be applied for the various crypto-systems such as block ciphers, stream ciphers, and hash functions. In this paper, we propose a novel method to reduce memory size for storing TMTO tables. The starting points in a TMTO table can be substituted by the indices of n-bit samples from a sequence in a family of pseudo-random sequences with good cross-correlation, which results in the reduction of memory size for the starting points. By using this method, it is possible to reduce the memory size by the factor of 1/10 at the cost of the slightly increasing of operation time in the online phase. Because the memory is considered as more expensive resource than the time, the TMTO cryptanalysis will be more feasible for many real crypto systems.

An Al Approach with Tabu Search to solve Multi-level Knapsack Problems:Using Cycle Detection, Short-term and Long-term Memory

  • Ko, Il-Sang
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.22 no.3
    • /
    • pp.37-58
    • /
    • 1997
  • An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

  • PDF

Visualizing sphere-contacting areas on automobile parts for ECE inspection

  • Inui, Masatomo;Umezun, Nobuyuki;Kitamura, Yuuki
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.1
    • /
    • pp.55-66
    • /
    • 2015
  • To satisfy safety regulations of Economic Commission for Europe (ECE), the surface regions of automobile parts must have a sufficient degree of roundness if there is any chance that they could contact a sphere of 50.0 mm radius (exterior parts) or 82.5 mm radius (interior parts). In this paper, a new offset-based method is developed to automatically detect the possible sphere-contacting shape of such parts. A polyhedral model that precisely approximates the part shape is given as input, and the offset shape of the model is obtained as the Boolean union of the expanded shapes of all surface triangles. We adopt a triple-dexel representation of the 3D model to enable stable and precise Boolean union computations. To accelerate the dexel operations in these Boolean computations, a new parallel processing method with a pseudo-list structure and axis-aligned bounding box is developed. The possible sphere-contacting shape of the part surface is then extracted from the offset shape as a set of points or a set of polygons.

타부탐색, 메모리, 싸이클 탐지를 이용한 배낭문제 풀기

  • 고일상
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.514-517
    • /
    • 1996
  • In solving multi-level knapsack problems, conventional heuristic approaches often assume a short-sighted plan within a static decision enviornment to find a near optimal solution. These conventional approaches are inflexible, and lack the ability to adapt to different problem structures. This research approaches the problem from a totally different viewpoint, and a new method is designed and implemented. This method performs intelligent actions based on memories of historic data and learning. These actions are developed not only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal solution, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The method intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this method uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. A side effect of so-called "pseudo moves", similar to "aspirations", supports these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied for intensification. To avoid redundant moves, short-term (tabu-lists), intermediate-term (cycle detection), and long-term (recording frequency and significant solutions for diversification) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

  • PDF

Research on Numerical Calculation of Normal Modes in Nonlinear Vibrating Systems (비선형 진동계 정규모드의 수치적 계산 연구)

  • Lee, Kyoung-Hyun;Han, Hyung-Suk;Park, Sungho;Jeon, Soohong
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.26 no.7
    • /
    • pp.795-805
    • /
    • 2016
  • Nonlinear normal modes(NNMs) is a branch of periodic solution of nonlinear dynamic systems. Determination of stable periodic solution is very important in many engineering applications since the stable periodic solution can be an attractor of such nonlinear systems. Periodic solutions of nonlinear system are usually calculated by perturbation methods and numerical methods. In this study, numerical method is used in order to calculate the NNMs. Iteration of the solution is presented by multiple shooting method and continuation of solution is presented by pseudo-arclength continuation method. The stability of the NNMs is analyzed using Floquet multipliers, and bifurcation points are calculated using indirect method. Proposed analyses are applied to two nonlinear numerical models. In the first numerical model nonlinear spring-mass system is analyzed. In the second numerical model Jeffcott rotor system which has unstable equilibria is analyzed. Numerical simulation results show that the multiple shooting method can be applied to self excited system as well as the typical nonlinear system with stable equilibria.

ILL-VERSUS WELL-POSED SINGULAR LINEAR SYSTEMS: SCOPE OF RANDOMIZED ALGORITHMS

  • Sen, S.K.;Agarwal, Ravi P.;Shaykhian, Gholam Ali
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.621-638
    • /
    • 2009
  • The linear system Ax = b will have (i) no solution, (ii) only one non-trivial (trivial) solution, or (iii) infinity of solutions. Our focus will be on cases (ii) and (iii). The mathematical models of many real-world problems give rise to (a) ill-conditioned linear systems, (b) singular linear systems (A is singular with all its linearly independent rows are sufficiently linearly independent), or (c) ill-conditioned singular linear systems (A is singular with some or all of its strictly linearly independent rows are near-linearly dependent). This article highlights the scope and need of a randomized algorithm for ill-conditioned/singular systems when a reasonably narrow domain of a solution vector is specified. Further, it stresses that with the increasing computing power, the importance of randomized algorithms is also increasing. It also points out that, for many optimization linear/nonlinear problems, randomized algorithms are increasingly dominating the deterministic approaches and, for some problems such as the traveling salesman problem, randomized algorithms are the only alternatives.

  • PDF

Predicting the Invasion Potential of Pink Muhly (Muhlenbergia capillaris) in South Korea

  • Park, Jeong Soo;Choi, Donghui;Kim, Youngha
    • Proceedings of the National Institute of Ecology of the Republic of Korea
    • /
    • v.1 no.1
    • /
    • pp.74-82
    • /
    • 2020
  • Predictions of suitable habitat areas can provide important information pertaining to the risk assessment and management of alien plants at early stage of their establishment. Here, we predict the invasion potential of Muhlenbergia capillaris (pink muhly) in South Korea using five bioclimatic variables. We adopt four models (generalized linear model, generalized additive model, random forest (RF), and artificial neural network) for projection based on 630 presence and 600 pseudo-absence data points. The RF model yielded the highest performance. The presence probability of M. capillaris was highest within an annual temperature range of 12 to 24℃ and with precipitation from 800 to 1,300 mm. The occurrence of M. capillaris was positively associated with the precipitation of the driest quarter. The projection map showed that suitable areas for M. capillaris are mainly concentrated in the southern coastal regions of South Korea, where temperatures and precipitation are higher than in other regions, especially in the winter season. We can conclude that M. capillaris is not considered to be invasive based on a habitat suitability map. However, there is a possibility that rising temperatures and increasing precipitation levels in winter can accelerate the expansion of this plant on the Korean Peninsula.

Topology Optimization for Large-displacement Compliant Mechanisms Using Element Free Galerkin Method

  • Du, Yixian;Chen, Liping
    • International Journal of CAD/CAM
    • /
    • v.8 no.1
    • /
    • pp.1-10
    • /
    • 2009
  • This paper presents a topology optimization approach using element-free Galerkin method (EFGM) for the optimal design of compliant mechanisms with geometrically non-linearity. Meshless method has an advantage over the finite element method(FEM) because it is more capable of handling large deformation resulted from geometrical nonlinearity. Therefore, in this paper, EFGM is employed to discretize the governing equations and the bulk density field. The sensitivity analysis of the optimization problem is performed by incorporating the adjoint approach with the meshless method. The Lagrange multipliers method adjusted for imposition of both the concentrated and continuous essential boundary conditions in the EFGM is proposed in details. The optimization mathematical formulation is developed to convert the multi-criteria problem to an equivalent single-objective problem. The popularly applied interpolation scheme, solid isotropic material with penalization (SIMP), is used to indicate the dependence of material property upon on pseudo densities discretized to the integration points. A well studied numerical example has been applied to demonstrate the proposed approach works very well and the non-linear EFGM can obtain the better topologies than the linear EFGM to design large-displacement compliant mechanisms.

Separation and flux characteristics in cross-flow ultrafiltration of bovine serum albumin and bovine hemoglobin solutions

  • Hsiao, Ruey-Chang;Hung, Chia-Lin;Lin, Su-Hsia;Juang, Ruey-Shin
    • Membrane and Water Treatment
    • /
    • v.2 no.2
    • /
    • pp.91-103
    • /
    • 2011
  • The flux behavior in the separation of equimolar bovine serum albumin (BSA) and bovine hemoglobin (HB) in aqueous solutions by cross-flow ultrafiltration (UF) was investigated, in which polyacylonitrile membrane with a molecular weight cut-off (MWCO) of 100 kDa was used. BSA and HB have comparable molar mass (67,000 vs. 68,000) but different isoelectric points (4.7 vs. 7.1). The effects of process variables including solution pH (6.5, 7.1, and 7.5), total protein concentration (1.48 and 7.40 ${\mu}M$), transmembrane pressure (69, 207, and 345 kPa), and solution ionic strength (with or without 0.01 M NaCl) on the separation were examined. It was shown that the ionic strength had a negligible effect on separation performance under the conditions studied. Although BSA and HB are not rigid bodies, the flux decline in the present cross-flow UF did not result from the mechanism of cake filtration with compression. In this regard, the specific cake resistance when pseudo steady-state was reached was evaluated and discussed.

A Study on the Application of U-SAT System for the Indoor Positioning Technology of Ubiquitous Computing (유비쿼터스 컴퓨팅의 실내 측위 기술을 위한 U-SAT 시스템의 적용에 관한 연구)

  • Lee, Dong-Hwal;Park, Jong-Jin;Kim, Su-Yong;Mun, Young-Song;Lee, Man-Hyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.9
    • /
    • pp.876-882
    • /
    • 2006
  • This study presents an ultrasonic location awareness system for the ubiquitous computing with absolute position. The flight time of ultrasonic waves is determined by a period detecting technique which is able to extend the sensing range compared with traditional methods. For location awareness, ultrasonic waves are sent successively from each ultrasonic transmitter and synchronized by radio frequency (RF) signal, where the transmitting part is fixed and the receiving part is movable. To expand the recognizing range, cell matching technique and coded ultrasonic technique are introduced. The experimentation for various distances is accomplished to verify the used period detecting technique of U-SAT system. The positioning accuracy by using cell matching is also verified by finding the locations of settled points and the usability of coded ultrasonic technique is verified. As a result, the possibility of ultrasonic location awareness system for the ubiquitous computing can be discussed as a pseudo-satellite system with low cost, a high update rate, and relatively high precision, in the places where CPS is not available.