• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4930-4951
• /
• 2018

The deep learning based speech enhancement has shown considerable success. However, it still suffers performance degradation under mismatch conditions. In this paper, an adaptation method is proposed to improve the performance under noise mismatch conditions. Firstly, we advise a noise aware training by supplying identity vectors (i-vectors) as parallel input features to adapt deep neural network (DNN) acoustic models with the target noise. Secondly, given a small amount of adaptation data, the noise-dependent DNN is obtained by using $L_2$ regularization from a noise-independent DNN, and forcing the estimated masks to be close to the unadapted condition. Finally, experiments were carried out on different noise and SNR conditions, and the proposed method has achieved significantly 0.1%-9.6% benefits of STOI, and provided consistent improvement in PESQ and segSNR against the baseline systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5563-5582
• /
• 2016

Parametric min-cuts is an object proposal algorithm, which can be used for accurate image segmentation. In parametric min-cuts, foreground seeds generation plays an important role since the number and quality of foreground seeds have great effect on its efficiency and accuracy. To improve the performance of parametric min-cuts, this paper proposes a new framework for foreground seeds generation. First, to increase the odds of finding objects, saliency detection at multiple scales is used to generate a large set of diverse candidate seeds. Second, to further select good-quality seeds, a two-stage cascaded ranking classifier is used to filter and rank the candidates based on their appearance features. Experimental results show that parametric min-cuts using our seeding strategy can obtain a relative small pool of proposals with high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3511-3532
• /
• 2019

Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.6098-6122
• /
• 2018

Cache-based side-channel attacks have achieved more attention along with the development of cloud computing technologies. However, current host-based mitigation methods either provide bad compatibility with current cloud infrastructure, or turn out too application-specific. Besides, they are defending blindly without any knowledge of on-going attacks. In this work, we present CacheSCDefender, a framework that provides a (Virtual Machine Monitor) VMM-based comprehensive defense framework against all levels of cache attacks. In designing CacheSCDefender, we make three key contributions: (1) an attack-aware framework combining our novel dynamic remapping and traditional cache cleansing, which provides a comprehensive defense against all three cases of cache attacks that we identify in this paper; (2) a new defense method called dynamic remapping which is a developed version of random permutation and is able to deal with two cases of cache attacks; (3) formalization and quantification of security improvement and performance overhead of our defense, which can be applicable to other defense methods. We show that CacheSCDefender is practical for deployment in normal virtualized environment, while providing favorable security guarantee for virtual machines.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권5호
• /
• pp.1891-1908
• /
• 2021

Cyber deception defense mitigates Advanced Persistent Threats (APTs) with deploying deceptive entities, such as the Honeyfile. The Honeyfile distracts attackers from valuable digital documents and attracts unauthorized access by deliberately exposing fake content. The effectiveness of distraction and trap lies in the enticement of fake content. However, existing studies on the Honeyfile focus less on this perspective. In this work, we seek to improve the enticement of fake text content through enhancing its readability, indistinguishability, and believability. Hence, an enticing deceptive-content generator, EDGE, is presented. The EDGE is constructed with three steps: extracting key concepts with a semantics-aware K-means clustering algorithm, searching for candidate deceptive concepts within the Word2Vec model, and generating deceptive text content under the Integrated Readability Index (IR). Furthermore, the readability and believability performance analyses are undertaken. The experimental results show that EDGE generates indistinguishable deceptive text content without decreasing readability. In all, EDGE proves effective to generate enticing deceptive text content as deception defense against APTs.

• World Technopolis Review
• /
• 제4권3호
• /
• pp.157-167
• /
• 2015

Innovation system is a framework concept that can be classified in many ways, namely-national, regional, sectoral and technological. Regardless of classification, all these systems have some common features and characteristics as a system. Before the innovation system concept, Mongolia developed and implemented a system to maintain nation's capacity to acquire, absorb and disseminate technologies like other countries. There were two important practices in the system development. Firstly, Mongolia modified and implemented a system "ShBOS" (meant "Invention and Innovative Idea System") that met its unique features to create innovative culture in the nation. Secondly, newly emerged ICT sector was quickly scaled up to be able to export technological products. The main objective of this article is to study modern experience of developing the national innovation system in Mongolia, assess current state of the system, innovation awareness and readiness, and carry out recommendations on its improvement with particular focus on the capacity of ICT sector as a pilot sector. The paper suggests that the above mentioned two achievements can be applied for developing the national innovation system through technological innovation system approach.

• Structural Engineering and Mechanics
• /
• 제13권1호
• /
• pp.1-16
• /
• 2002

This paper presents the findings of an investigation carried out to determine the most appropriate connections, in terms of rotational stiffness, to use for the optimum design of cold-formed Zed section sleeve joint purlin system. Experiments and parametric studies were conducted to investigate the effects of geometric variables on the behavior of the sleeve-purlin and cleat-purlin connections of the sleeve joint purlin system. The variables considered were purlin size and thickness, sleeve size, thickness, length and bolt position. The test results were used to verify the empirical expressions, developed herein, employed to determine the rotational stiffness of connections. With the predicted connection stiffness, the most suitable sleeve-purlin and cleat-purlin connections can be selected so as to produce an optimum condition for the sleeve joint purlin system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.377-382
• /
• 2005

This paper presents a new method for the attitude control of planar space robots. In order to control highly constrained non-linear system such as a 3D space robot, the analytical formulation for the system with complex dynamics and effective control methodology based on the formulation, are not always obtainable. In the proposed method, correspondingly, a non-analytical but effective self-organizing modeling method for controlling a highly constrained system is proposed based on a polynomial data mining algorithm. In order to control the attitude of a planar space robot, it is well known to require inputs characterized by a special pattern in time series with a non-deterministic length. In order to correspond to this type of control paradigm, we adopt the Model Predictive Control (MPC) scheme where the length of the non-deterministic horizon is determined based on implementation cost and control performance. The optimal solution to finding the size of the input pattern is found by a solving two-stage programming problem.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2006년도 추계학술대회 논문집
• /
• pp.354-358
• /
• 2006

In addition to documents or technologies at working place, the importance of technology management riese through increasing know-hows. In particular, in the field of construction, a variety of management systems including ERP and PMIS have been introduced since 90's. Therefore, the range of shared information extends to construction grounds, headquarters or even to collaborating companies. It means that the competitiveness of companies depends on the efficient management of technological documents in the field of construction. Accordingly, this study shows the purpose to develop the construction system which save, search and share technological information in order to improve any problem of current construction systems. The construction system offers you both the searching function and the viewing function for various information. In addition, the system contains the highlighting function to know if any information is available. The Construction system is possible to be used with current systems at the same time because is is designed to make up for them. In addition, it is expected to solve their problems and supplement their defects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3747-3765
• /
• 2017

Existing authentication mechanisms in cellular mobile communication networks are realized in the upper layer by employing cryptographic techniques. Authentication data are broadcasted over the air in plaintext, enabling attackers to completely eavesdrop on the authentication and get some information about the shared secret key between legitimate nodes. Therefore, reusing the same secret key to authenticate several times results in the secret key's information leakage and high attacking rate. In this paper, we consider the most representative authentication mechanism, Authentication and Key Agreement (AKA), in cellular communication networks and propose an enhanced AKA scheme based on Physical Layer Authentication (AKA-PLA). Authentication responses generated by AKA are no longer transmitted in plaintext but masked by wireless channel characteristics, which are not available to adversaries, to generate physical layer authentication responses by a fault-tolerant hash method. The authenticator sets the threshold according to the authentication requirement and channel condition, further verifies the identity of the requester based on the matching result of the physical layer authentication responses. The performance analyses show that the proposed scheme can achieve lower false alarm rate and missing rate, which are a pair of contradictions, than traditional AKA. Besides, it is well compatible with AKA.