No abstract

No abstract

No abstract

: All-wheel steering (AWS) system is applied to articulated vehicles to reduce turning radius. The swing-out suppression algorithm is applied to AWS ECU, a key component of AWS system. The swing-out suppression algorithm applied to AWS ECU has a problem when velocity of vehicle is changed. In this paper, new algorithm based on moving distance that solve velocity problem is proposed. The HILS simulation and the test articulated bus is used to validate algorithm.

This paper suggests that implementation of the Simulink execution module controls Simulink simulation and shows simulation results by applying Automata theory. This module is composed of three independent systems that the main program to accept user commands, the thread to control a simulation of Simulink model and the Simulink model to execute simulation. This paper designs each module and entire system by applying Automata theory, and implements it with C# and MATLAB language. And the Simulink execution module implemented will be verified through the experiment.

DHT(Distributed Hash Table) networks such as Kademlia are vulnerable to the ID mapping attack caused by the voluntary DHT mapping structure where the location of a node is solely determined by itself on the network topology. This causes security problems such as eclipse, DRDoS and botnet C&C on DHT networks. To prevent ID mapping attacks, we propose a non-voluntary DHT mapping scheme and perform analysis on NAT compatibility, attack resistance, and network dynamicity. Analysis results show that our approach may have an equivalent level of attack resistance comparing with other defense mechanisms and overcome their limitations including NAT compatibility and network dynamicity.

ABSTRACT

When developing a complex system in an open platform setting, users need to compose and maintain a systematic requirement specification. This paper proposes a solution to guarantee a syntactically accurate requirement specification that minimizes the ambiguity caused by ungrammatical sentences. Our system has a set of standard jargon and templates that are used as a guideline to write grammatically correct sentences. Given a database of standard technical Korean (STK) templates, the system that we have designed and implemented divides a new sentence into a specific cluster. If the system finds an identical template in a cluster, it confirms the new sentence as a sound one. Otherwise, the system uses unsupervised clustering algorithms to return the template that most closely resembles the syntax of the inputted sentence. We tested our proposed system in the field of open platform development for a railway train. In the experiment, our system learned to partition templates into clusters while reducing null attributes of an instance using the autoencoding procedure. Given a set of clusters, the system was able to successfully recommend templates that were syntactically similar to the structure of the inputted sentence. Since the degree of similarity for 500 instances was 97.00% on average, we conclude that our robust system can provide an appropriate template that users can use to modify their syntactically incorrect sentences.