• Journal of Biomedical Engineering Research
• /
• v.35 no.5
• /
• pp.151-159
• /
• 2014

Computed tomography (CT) is one of the most widely used medical imaging modality. However, substantial x-ray dose exposed to the human subject during the CT scan is a great concern. Region-of-interest (ROI) CT is considered to be a possible solution for its potential to reduce the x-ray dose to the human subject. In most of ROI-CT scans, the ROI is set to a circular shape whose diameter is often considerably smaller than the full field-of-view (FOV). However, an arbitrarily shaped ROI is very desirable to reduce the x-ray dose more than the circularly shaped ROI can do. We propose a new method to make a non-circular convex-shaped ROI along with the image reconstruction method. To make a ROI with an arbitrary convex shape, dynamic collimations are necessary to minimize the x-ray dose at each angle of view. In addition to the dynamic collimation, we get the ROI projection data with slightly lower sampling rate in the view direction to further reduce the x-ray dose. We reconstruct images from the ROI projection data in the compressed sensing (CS) framework assisted by the exterior projection data acquired from the pilot scan to set the ROI. To validate the proposed method, we used the experimental micro-CT projection data after truncating them to simulate the dynamic collimation. The reconstructed ROI images showed little errors as compared to the images reconstructed from the full-FOV scan data as well as little artifacts inside the ROI. We expect the proposed method can significantly reduce the x-ray dose in CT scans if the dynamic collimation is realized in real CT machines.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.4
• /
• pp.259-267
• /
• 2018

The subset-sum problem is to find out whether or not the element sum of a subset within a finite set of numbers is equal to a given value. The problem is a well-known NP-complete problem, which is difficult to solve within a polynomial time. Genetic algorithm is a method for finding the optimal solution of a given problem through operations such as selection, crossover, and mutation. Dynamic programming is a method of solving a given problem from one or several subproblems. In this paper, we design and implement a genetic algorithm that solves the subset-sum problem, and experimentally compared the time performance to find the answer with the case of dynamic programming method. We selected a total of 17 test cases considering the difficulty in a set with 63 elements of positive number, and compared the performance of the two algorithms. The presented genetic algorithms showed time performance improved by 84% on 13 of 17 problems when compared with dynamic programming.

• Journal of Korea Game Society
• /
• v.9 no.6
• /
• pp.105-116
• /
• 2009

The motives of human beings provide reasons to set goals and carry them out. Accordingly, to realize the behaviors of agents similar to human beings, research using motives has been actively conducted. However, it is difficult for this research to cope with unexpected situations in a dynamic environment as does the research in a static environment. Agents can set goals by themselves in the dynamic environment. Furthermore, the goals that are finally selected shall be quickly and definitely set. This study suggests how to determine motives using them in order to enable agents to set goals by themselves. The suggested method compares motives generated by recognizing the environment by phase in real time and identifies the appropriateness of this method. The identified motives are used to set up the goals of agents and to practice the goals. For the appropriateness of the suggested method, the experiment to compare the behaviors of agents with different features in a virtual environment was conducted. The results of the experiment indicate that when several motives are generated, the agents found the most appropriate motive in the present situation. Accordingly, the agents were able to set up optimum goals so that they could cope with dynamic environments using the final motives identified by the determination of motives.

• Korean Journal of Construction Engineering and Management
• /
• v.7 no.3 s.31
• /
• pp.45-55
• /
• 2006

This study aims need set of mind to construction manager built a theory logic conceive decision making system and principles designed to create the administrative procedures that a company needs to integrate management and environmental concerns into its daily business practices. Integrate considerations of risk reduction and wise resource management into daily business decision making environmental that includes performance and cost. Seek to make better Dynamic time solutions that promote competitiveness set of management mind provide business with tools and methodologies management participation, psychology, philosophy effects of resource flows. A last of understand use of the decision making element principal as a guideline for evaluating and ranking approaches. The result of this study are summarized as follows; (1) setting for approach decision making of manager police, (2) dynamic of time and management mind (3) a primary factor out environment to decision making (4) methodologies of set up system for management mind (5) expectation effect of management mind.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.2
• /
• pp.453-461
• /
• 2010

This paper presents a branch prediction algorithm and a 4-way set-associative cache for performance improvement of embedded RISC core and a clock-gating algorithm using ODC (Observability Don't Care) operation to improve the power consumption of the core. The branch prediction algorithm has a structure using BTB(Branch Target Buffer) and 4-way set associative cache has lower miss rate than direct-mapped cache. Pseudo-LRU Policy, which is one of the Line Replacement Policies, is used for decreasing the number of bits that store LRU value. The clock gating algorithm reduces dynamic power consumption. As a result of estimation of performance and dynamic power, the performance of the OpenRISC core applied the proposed architecture is improved about 29% and dynamic power of the core using Chartered $0.18{\mu}m$ technology library is reduced by 16%.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.10
• /
• pp.503-510
• /
• 2016

FsGr model, which has been proposed recently, is an approach of accelerometer-based gesture recognition by applying DTW algorithm in two steps, which improved recognition success rate. In FsGr model, sets of similar gestures will be produced through training phase, in order to define the notion of a set of similar gestures. At the 1st attempt of gesture recognition, if the result turns out to belong to a set of similar gestures, it makes the 2nd recognition attempt to feature-strengthened parts extracted from the set of similar gestures. However, since a same gesture show drastically different characteristics according to physical traits such as body size, age, and sex, FsGr model may not be good enough to apply to multi-user environments. In this paper, we propose FsGrM model that extends FsGr model for multi-user environment and present a program which controls channel and volume of smart TV using FsGrM model.

• Journal of Information Processing Systems
• /
• v.12 no.1
• /
• pp.46-56
• /
• 2016

Dynamic textures are videos that exhibit a stationary property with respect to time (i.e., they have patterns that repeat themselves over a large number of frames). These patterns can easily be tracked by a linear dynamic system. In this paper, a model that identifies the underlying linear dynamic system using wavelet coefficients, rather than a raw sequence, is proposed. Content based threshold filtering based on Set Partitioning in a Hierarchical Tree (SPIHT) helps to get another representation of the same frames that only have low frequency components. The main idea of this paper is to apply SPIHT based threshold filtering on different bands of wavelet transform so as to have more significant information in fewer parameters for singular value decomposition (SVD). In this case, more flexibility is given for the component selection, as SVD is independently applied to the different bands of frames of a dynamic texture. To minimize the time complexity, the proposed model is implemented on a graphics processing unit (GPU). Test results show that the proposed dynamic system, along with a discrete wavelet and SPIHT, achieve a highly compact model with better visual quality, than the available LDS, Fourier descriptor model, and higher-order SVD (HOSVD).

• The Journal of Asian Finance, Economics and Business
• /
• v.7 no.9
• /
• pp.527-536
• /
• 2020

International business research presents a broad consensus on the importance of dynamic capabilities in the internationalization of SMEs. However, there is a lack of research on assessing the impact of dynamic capabilities and the level of SMEs' internationalization operating in a turbulent and dynamic business environment. This study examines the impact of environmental dynamism and three sets of dynamic capabilities, namely, sensing, seizing, and reconfiguring capabilities on internationalized SMEs' geographic scope. In addition, this research examines the association between internationalized SMEs' characteristics: SME's age, size, and SME owner/manager's international experience and SMEs' geographic scope. This study used a quantitative research and employed survey questionnaires to collect data from 305 internationalized Malaysian manufacturing SMEs. Anova tests and Chi Square tests were employed to analyze data collected from respondents using SPSS. Research findings revealed that environmental dynamism and dynamic capabilities have a significant impact on internationalized SMEs' geographic scope, however, none of the internationalized SMEs' characteristics had a significant relationship with their geographic scope. The result of this research suggest internationalized SMEs owner/managers need to possess sensing, seizing and reconfiguring capabilities, and monitor business environmental dynamism to increase their geographic scope. This paper ends with drawing a set of concluding remarks and recommendations.

• Structural Engineering and Mechanics
• /
• v.13 no.2
• /
• pp.211-230
• /
• 2002

The objective of this study is to investigate the dynamic behavior of elastic beams subjected to moving loads. Although analytical methods are available, they have limitations with respect to complicated structures. The use of computer technology in recent years is an effective way to solve the problem; thus using the latest technology this study establishes a finite-element solution procedure to investigate dynamic behaviors of a typical elastic beam having a set of constant geometric properties and various span lengths. Both the dead load of the beam and traffic load are applied in which the traffic load is considered a concentrated moving force with various traveling passage speeds on the beam. Dynamic behaviors including deflection, shear, and bending moment due to moving loads are obtained by both analytical and finite element methods; for simple structures, they have an excellent agreement. The numerical results show that based on analytical methods the fundamental mode is good enough to estimate the dynamic deflection along the beam, but is not sufficient to simulate the total response of the shear force or the bending moment. The linear dynamic behavior of the elastic beams subjected to multiple exciting loads can easily be found by linear superposition, and the geometric nonlinear results caused by large deformation and axial force of the beam are always underestimated with only a few exceptions which are indicated. In order to make the results useful, they have been nondimensionalized and presented in graphical form.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.2060-2073
• /
• 2022

Cloud Computing permits users to access vast amounts of services of computing power in a virtualized environment. Providing secure services is essential. There are several problems to real-world optimization that are dynamic which means they tend to change over time. For these types of issues, the goal is not always to identify one optimum but to keep continuously adapting to the solution according to the change in the environment. The problem of scheduling in Cloud where new tasks keep coming over time is unique in terms of dynamic optimization problems. Until now, there has been a large majority of research made on the application of various Evolutionary Algorithms (EAs) to address the issues of dynamic optimization, with the focus on the maintenance of population diversity to ensure the flexibility for adapting to the changes in the environment. Generally, trust refers to the confidence or assurance in a set of entities that assure the security of data. In this work, a dynamic optimization technique is proposed to find an optimal trust weights in cloud during scheduling.