• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.210-215
• /
• 1998

To design a space frame structure by the conventional method is not easy in practical sense since it is generally a three-dimensional complicated form, and stability and nonlinear problems are not easily checked in the design process. This paper describes two modules, the Model Generator which is based on PATRAN user interface that enables users to generate a complicated finite element model; the Optimum Design Module which analyzes output results of analysis program, and designs members of a space frame. The Model Generator is based on PCL while C++ language is used in the Optimum Design Module. Structural analysis is performed by using ABAQUS. All of these modules constitute Space Frame Integrated Design System. The Core of the system is PATRAN database, in which the Model Generator creates information of a finite element model. Then, PATRAN creates input files needed for the analysis program from the information of the finite element model in the database, and in turn, imports output results of analysis program to the database. Finally, the Optimum Design Module processes member grouping of a space frame based on the output results, and performs optimal member selection of a space frame. This process is repeated until the desired optimum structural members are obtained.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.151-160
• /
• 2012

In this paper, a database method for Wind Power Plant SCADA system based on IEC61400-25 was designed. To manage big data, which is produced by the introduction of international standards and large/grouping of wind power plant, database should be systematically designed. As identify the characteristics of the wind power data and reflect the requirements of a user, it would be decreasing the waste of data space and managing efficiently the system. As a result, it is expected to reduce cost and effort in development and maintenance of Wind Power Plant.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.243-251
• /
• 2004

Most programs of bioinformatics provide biochemists and biologists retrieve and analysis services of gene and protein database. As these services retrieve database for each arrival of user's request, it takes a long time and increases server's load and response time. In this paper. by utilizing database retrieval patterns of sequence alignment programs in bioinformatics, grouping method is proposed to share database retrieval between many requests. Carpool method is also proposed to reduce response time as well as to increase system expandability by combining new arriving requests with the previous on going requests. The performance of our two proposed schemes is verified by mathematic analysis and simulation.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1250-1258
• /
• 2017

The multigroup transport theory is the basis for many neutronics modules. A significant point of the cross-section (XS) generation procedure is the choice of the energy groups' boundaries in the XS libraries, which must be carefully selected as an unsuitable energy meshing can easily lead to inaccurate results. This decision can require considerable effort and is particularly difficult for the common user, especially if not well-versed in reactor physics. This work investigates a genetic algorithm-based tool which selects an appropriate XS energy structure (ES) specific for the considered problem, to be used for the condensation of a fine multigroup library. The procedure is accelerated by results storage and fitness calculation speedup and can be easily parallelized. The extension is applied to the coupled code SIMMER and tested on the European Sustainable Nuclear Industrial Initiative (ESNII+) Advanced Sodium Technological Reactor for Industrial Demonstration (ASTRID)-like reactor system with different fitness functions. The results show that, when the libraries are condensed based on the ESs suggested by the algorithm, the code actually returns the correct multiplication factor, in both reference and voided conditions. The computational effort reduction obtained by using the condensed library rather than the fine one is assessed and is much higher than the time required for the ES search.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.10
• /
• pp.185-198
• /
• 2021

With the development of Internet technology, because traditional recommendation algorithms cannot learn the in-depth characteristics of users or items, this paper proposed a recommendation algorithm based on the AMITI(attention mechanism and improved TF-IDF) to solve this problem. By introducing the two-layer attention mechanism into the CNN, the feature extraction ability of the CNN is improved, and different preference weights are assigned to item features, recommendations that are more in line with user preferences are achieved. When recommending items to target users, the scoring data and item type data are combined with TF-IDF to complete the grouping of the recommendation results. In this paper, the experimental results on the MovieLens-1M data set show that the AMITI algorithm improves the accuracy of recommendation to a certain extent and enhances the orderliness and selectivity of presentation methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3723-3737
• /
• 2022

Google Play is one of the largest Android phone app markets and it contains both free and paid apps. It provides a variety of categories for every target user who has different needs and purposes. The customer's rate every product based on their experience of apps and based on the average rating the position of an app in these arch varies. Fraudulent behaviors emerge in those apps which incorporate search rank maltreatment and malware proliferation. To distinguish the fraudulent behavior, a novel framework is structured that finds and uses follows left behind by fraudsters, to identify both malware and applications exposed to the search rank fraud method. This strategy correlates survey exercises and remarkably joins identified review relations with semantic and behavioral signals produced from Google Play application information, to distinguish dubious applications. The proposed model accomplishes 90% precision in grouping gathered informational indexes of malware, fakes, and authentic apps. It finds many fraudulent applications that right now avoid Google Bouncers recognition technology. It also helped the discovery of fake reviews using the reviewer relationship amount of reviews which are forced as positive reviews for each reviewed Google play the android app.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.85-97
• /
• 2005

In this paper, we construct the traffic information database by using the acquired data from the traffic information devices installed in road network, and, by referring to this database, propose the intersection simulation system which can dynamically manage the real-time traffic flow for each section of road from the intersections, This system consists of hierarchical 3 parts, The lower layer is the physical layer where the traffic information is acquired on an actual road. The traffic flow control framework exists in the middle layer. The framework supports the grouping of intersection, the collection of real-time traffic flow information, and the remote monitoring and control by using the traffic information of the lower layer, This layer is designed by extending the distributed object group framework we developed. In upper layer, the intersection simulator applications controlling the traffic flow by grouping the intersections exist. The components of the intersection application in our system are composed of the implementing objects based on the Time-triggered Message-triggered Object(TMO) scheme, The intersection simulation system considers the each intersection on road as an application group, and can apply the control models of dynamic traffic flow by the road's status. At this time, we use the real-time traffic information collected through inter-communication among intersections. For constructing this system, we defined the system architecture and the interaction of components on the traffic flow control framework which supports the TMO scheme and the TMO Support Middleware(TMOSM), and designed the application simulator and the user interface to the monitoring and the controlling of traffic flow.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.4
• /
• pp.27-35
• /
• 2011

Multicarrier-Direct Sequence/Code Division Multiple Access(MC-DS/ CDMA) which is a combination of Orthogonal Frequency Division Multiplexing(OFDM) and DS/CDMA has been of significant interest as a means to take such advantages as bandwidth efficiency, high bit rate and robustness against multipath fading. In this paper we study a reduced-complexity multiuser detection aided multirate MC-DS/CDMA with time(T)-domain and frequency(F)-domain spreading. The one- dimensional orthogonal variable spreading factor(1D OVSF) code extracted from 2D OVSF code are used as a spreading code in T/F-domain. The proposed system will use code grouping interference cancellation(CGIC) receiver to reduce Multiuser Interference(MUI). The CGIC receiver uses code grouping by the correlation properties of 1D OVSF code and dose not requires the code information and activity of other user. The multiuser detector with CGIC receiver will be analyzed in Time- and Frequency-domain separately(jointly). The system performance is analytically derived in Additive White Gaussian Noise(AWGN) channel and we also compare the system performance between proposed system and T/F spreaded single(multi) rate multiuser MC-DS/CDMA system. In the computer simulation results, the proposed receiver of demonstrated huge performance improvement over conventional matched filter receiver.

• Journal of Internet Computing and Services
• /
• v.10 no.3
• /
• pp.113-129
• /
• 2009

Abstract Corporate activities are composed of numerous working processes and during the working flow, various business processes are being created and completed simultaneously. Enterprise Resources Planning (ERP) makes the working process simple, yet creates more complicated work structure and therefore, there is an absolute need of efficient management for business processes. The workflow literature has been looking for efficient and effective ways of rediscovering and mining workflow intelligence and knowledge from their enactment histories and event logs. As part of studies to analyze and improve the process, the concepts of 'Process Mining', 'Process re-discovery', 'BPR (Business Process Reengineering)' have appeared and the studies for practical implementation are proactively being done. However, these studies normally follow the approach throughout data warehousing for log data of process instances. It is very hard for these approaches to reflect user's intention to the rediscovering and mining activities. The process instances designed based on the consideration of analysis can make groupings effectively and when the analysis demand of user changes within the analysis domain can also reduce the cost of analysis. Therefore, the thesis proposes a special type of workflow model, which is called a colored workflow model, that is extended from the ICN (information control net) modeling methodology by reinforcing the concept of colored token. The colored tokens represent the conceptual types of constraints and criteria that can be used to classifying and grouping the workflow intelligence and knowledge extracted from the corresponding workflow models' enactment histories and event logs. Through the runtime information of process instances, it makes possible to analyze proactive and user-oriented process with the goal of deriving business knowledge from the beginning of process definition.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.1-11
• /
• 2009

A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.