Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Learning Discriminative Representations for Malware Family Classification

    The increasing number of data breaches and cyberattacks in recent years highlights the importance of malware detection research. It is common for malware to have many mutations to evade signature-based detecti...

    Ayman El Aassal, Shou-Hsuan Stephen Huang in Hybrid Intelligent Systems (2023)

  2. No Access

    Chapter and Conference Paper

    Host-Based Intrusion Detection: A Behavioral Approach Using Graph Model

    Data breach incidents are becoming a global threat, costing companies millions with each attack. Most host-based intrusion approaches analyze system logs, such as the system call log, to monitor host network t...

    Zechun Cao, Shou-Hsuan Stephen Huang in Hybrid Intelligent Systems (2023)

  3. Article

    Open Access

    Automatic B cell lymphoma detection using flow cytometry data

    Flow cytometry has been widely used for the diagnosis of various hematopoietic diseases. Although there have been advances in the number of biomarkers that can be analyzed simultaneously and technologies that ...

    Ming-Chih Shih, Shou-Hsuan Stephen Huang, Rachel Donohue, Chung-Che Chang in BMC Genomics (2013)

  4. No Access

    Chapter and Conference Paper

    Step**-Stone Intrusion Detection Using Neural Networks Approach

    -Attackers on the Internet typically launch network intrusions indirectly by creating a long connection via intermediary hosts, called step**-stones. One way to detect such intrusion is to check the number o...

    Han-Ching Wu, Shou-Hsuan Stephen Huang in Novel Algorithms and Techniques In Telecom… (2008)

  5. No Access

    Chapter and Conference Paper

    Packet Fluctuation Approach For Step**-Stone Detection

    To evade detection, network attackers usually launch intrusions through step**-stones by building a long connection via intermediary hosts. In order to detect long connection chains, we first need to identif...

    Han-Ching Wu, Shou-Hsuan Stephen Huang in Novel Algorithms and Techniques In Telecom… (2008)

  6. No Access

    Chapter and Conference Paper

    Resistance Analysis to Intruders’ Evasion of Detecting Intrusion

    Most network intruders launch their attacks through a chain of compromised hosts (step**-stones) to reduce the risks of being detected or captured. Detecting such kind of attacks is important and difficult b...

    Jianhua Yang, Yongzhong Zhang, Shou-Hsuan Stephen Huang in Information Security (2006)

  7. No Access

    Chapter and Conference Paper

    Improved Thumbprint and Its Application for Intrusion Detection

    This paper proposes RTT-thumbprint to traceback intruders, and to detect step**-stone intrusion; RTT-thumbprint is a sequence of timestamp pairs of a send packet and its corresponding echoed packets. Each pa...

    Jianhua Yang, Shou-Hsuan Stephen Huang in Networking and Mobile Computing (2005)

  8. No Access

    Article

    On the construction of weighted time-optimal B-trees

    B-trees have been popular data structures since their definition. Their success is due to the fact that a B-tree containingn keys is “balanced” with a height ofO(logn). However, for a given set of elements and th...

    Shou-Hsuan Stephen Huang, Venkatraman Viswanathan in BIT (1990)

  9. No Access

    Article

    AVLSI partition algorithm

    A VLSI sorter of sizeO(n) can sortn elements in linear time when the input and output time are taken into account. If the input contains more thann elements, some prepocessing has to be performed. A VLSI partitio...

    Shou-Hsuan Stephen Huang in BIT Numerical Mathematics (1988)

  10. No Access

    Article

    Ordered priority queues

    A new data structure called ordered priority queue is introduced in this paper. Elements stored in the data structure have a primary order (key) and a secondary order (priority) associated with them. An ordere...

    Shou-Hsuan Stephen Huang in BIT Numerical Mathematics (1986)

  11. No Access

    Article

    Multidimensional extendible hashing for partial-match queries

    Hashing is a well-known technique for organizing direct access files. Extendible hashing removes the restriction on the expansion of the file and thus allows dynamic files. We generalize the technique to store...

    Shou-Hsuan Stephen Huang in International Journal of Computer & Information Sciences (1985)

  12. No Access

    Article

    Average number of rotations and access cost in iR-trees

    iR trees are parameterized binary search trees which rebalance themselves locally. In our previous work the cases fori=1, 2 were studied. This note extends the result to arbitraryi. In particular, we derive a fo...

    Shou-Hsuan Stephen Huang, C. K. Wong in BIT Numerical Mathematics (1984)

  13. No Access

    Article

    Generalized binary split trees

    The definition of binary split trees is generalized by removing the condition of decreasing frequency. It is shown that the access time of generalized split trees is less than that of split trees in general. T...

    Shou -Hsuan Stephen Huang, C. K. Wong in Acta Informatica (1984)

  14. No Access

    Article

    Binary search trees with limited rotation

    A parameterized binary search tree callediR tree is defined in this paper. A user is allowed to select a level of balance he desires. SR tree is a special case ofiR tree wheni=1. There are two new concepts in SR ...

    Shou-Hsuan Stephen Huang, C. K. Wong in BIT Numerical Mathematics (1983)