Tien-Hsiung Weng

Providence University · Computer Science and Information Engineering

WSNs (Wireless Sensor Networks) are critical components of the Internet of Things (IoT). With the internationalization of the IoT and the widespread use of apps, it is crucial to increase WSNs localization algorithms' accuracy and their flexibility to dynamic and changing surroundings. To this end, it is proposed in this article a wireless sensor n...

With the development of international trade, the core position of port transportation progressively emerges. However, most current port supply chain systems adopt a centralized data management mode. Each operator in the supply chain has its platform and data set, which is prone to form information islands and can create trust issues, resulting in t...

People are easily duped by fake news and start to share it on their networks. With high frequency, fake news causes panic and forces people to engage in unethical behavior such as strikes, roadblocks, and similar actions. Thus, counterfeit news detection is highly needed to secure people from misinformation threats on social platforms. Filtering fa...

Large-scale production is always associated with more and more development and interaction among peers, and many fields achieve higher economic benefits through project cooperation. However, project managers in the traditional centralized approach cannot rearrange their activities to cross-organizational project management. Thanks to its characteri...

IoT era and its ubiquitous sensing raise serious security challenges such as wormhole attacks. Given that these attacks may affect the location determination of the employed sensors, security can be seriously compromised. The most common and severe attack is the single wormhole one, which is the focus of this paper. One of the most employed algorit...

Federated learning (FL) is a promising decentralized deep learning technology, which allows users to update models cooperatively without sharing their data. FL is reshaping existing industry paradigms for mathematical modeling and analysis, enabling an increasing number of industries to build privacy-preserving, secure distributed machine learning...

Entity and relation extraction has been widely studied in natural language processing, and some joint methods have been proposed in recent years. However, existing studies still suffer from two problems. Firstly, the token space information has been fully utilized in those studies, while the label space information is underutilized. However, a few...

Large-scale production is always associated with more and more development and interaction among peers, and many fields achieve higher economic benefits through project cooperation. However, project managers in the traditional centralized approach cannot rearrange their activities to cross-organizational project management. Thanks to its characteri...

Massive Open Online Courses (MOOCs) have become a paramount online learning approach for flexible learning methods and extensive learning courses. Different from the traditional method of learning, MOOCs advocate completing the learning process through online devices. Electronic Learning Records (ELRs) are vital for learners as compelling evidence...

Wireless sensor networks (WSNs) have actively been considered in vast amount of applications in fields of science and engineering. The node location technology is one of the most critical technologies of WSNs. Aiming at the problem of distance vector‐hop (DV‐HOP) algorithm's excessive estimation error, we propose in this article a multi‐objective D...

Stocks price prediction is a current hot spot with great promise and challenges. Recently, there have been many stock price prediction methods. However, the prediction accuracy of these methods is still far from satisfactory. In this paper, we propose a stock price prediction method that incorporates multiple data sources and the investor sentiment...

To enhance the consensus performance of Blockchain in the Green Internet of Things (G-IoT) and improve the static network structure and communication overheads in the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm, in this paper, we propose a Credit Reinforce Byzantine Fault Tolerance (CRBFT) consensus algorithm by using reinforceme...

The number of confirmed cases of COVID-19 is increasing exponentially day by day across the world because of its super spreading nature. It was started in China and took a very less time to spread all over the globe. Due to its mortality rate, spreading nature, and unavailability of proper medicine and vaccination, it is declared as a pandemic by t...

Network coding remarkably improves network performance and transmission efficiency for multi-cast. Nevertheless, as its inherent defect, it is vulnerable to pollution attacks, bringing in a severe decrease of the network performance. In the proposed work, a novel approach is put forwarded, which can rapidly identify and isolate the malicious nodes...

Selecting suitable web services based on the quality-of-service (QoS) is essential for developing high-quality service-oriented applications. A critical step in this direction is acquiring accurate, personalised QoS values of web services. As the number of web services is enormous and the QoS data are highly sparse, improving the accuracy of QoS pr...

Clustering ensemble, also referred to as consensus clustering, has emerged as a method of combining an ensemble of different clusterings to derive a final clustering that is of better quality and robust than any single clustering in the ensemble. Normally clustering ensemble algorithms in the literature combine all the clusterings without learning...

Online social networks (OSNs) are nowadays an important field of applications thanks to the recent surge in online interaction. However, the illegal disclosure of user's private data can cause damaging consequences and even threaten the safety of users' life. The privacy issues of OSNs have become a matter of great concern for many people. In recen...

Task scheduling is one of the key techniques for effective and reliable resource usage in cloud computing. In this paper, we designed a hybrid heuristic scheduling that employed particle swarm optimisation (PSO) and least accumulated slack time to respectively address the problem of assigning tasks to servers and the problem of the task scheduling...

In Cloud computing the user requests are passaged to data centers (DCs) to accommodate resources. It is essential to select the suitable DCs as per the user requests so that other requests should not be penalized in terms of time and cost. The searching strategies consider the execution time rather than the related penalties while searching DCs. In...

Image matting separates the foreground object from a given image by estimating the alpha values. It has been one crucial step in computer vision, as well as an essential technique in visual effects in the modern filmmaking industry. Due to its time complexity being proportional to the size of the unknown region, the computational speed for processi...

This research mainly proposes a system design for virtual stores, which offers game and AR scenes to improve the business sales of general merchandising stores. By 3D game aspect, customers always control a virtual character inside game scenes to look for some items, hence a virtual store is designed to include the scenes with fictitious furnishing...

In complex vehicular cyber physical systems (CPS) network environment, there exist trust-based recommendation schemes that could effectively filter most of the false data. Though, these schemes may exhaust vehicular network resources, including energy, computation ability, and storage, causing a network outage. To ensure real-time data transmission...

Rapid advances of IC (Integrated Circuit) technology make the security be widely concerned. Traditional identity authentication protocols depend on binary secret key and encryption algorithm, and issues of complex computation and high cost exist in previous protocols. To realize a low-cost RFID (Radio Frequency Identification) identity authenticati...

In order to increase parallelism via memory width in scalable memory systems, a straightforward approach is to employ larger number of memory controllers (MCs). Nevertheless, a number of researches have pointed out that, even executing bandwidth-bound applications in systems with larger number of MCs, the number of transaction queue entries is unde...

Recommendation mechanisms offer an effective way to utilize user observations and ratings. The cold-start problem is most prevalent to affect the accuracy and reasoning of recommendation tasks, since new users or items have no side information in recommendation domains. A common architecture of keyword-aware recommender systems is proposed to impro...

In this paper, we present our learning experience on the design and implementation of image dehazing parallel code with OpenMP developed from existing fast sequential version. The aim of this work is to present an analysis of a case study showing the development of parallel haze removal with practical and efficient use of shared memory multi-core s...

Hadoop is a well-designed approach for handling massive amount of data. Comprised at the core of the Hadoop File System and MapReduce, it schedules the processing by orchestrating the distributed servers, providing redundancy and fault tolerance. In terms of performance, Hadoop is still behind high performance capacity due to CPUs’ limited parallel...

MapReduce is a popular data-parallel processing model encompassed with recent advances in computing technology and has been widely exploited for large-scale data analysis. The high demand on MapReduce has stimulated the investigation of MapReduce implementations with different architectural models and computing paradigms, such as multi-core cluster...

In this chapter, we propose a parallel algorithm for sparse matrix transposition using CSR format to run on many-core GPUs, utilizing the tremendous computational power and memory bandwidth of the GPU offered by parallel programming in CUDA. Our code is run on a quad-core Intel Xeon64 CPU E5507 platform and a NVIDIA GPU GTX 470 card. We measure the...

The ability to deploy resources and services in cloud computing utilizing virtualization technologies in a timely and cost-effective manner is important, bringing with it significant economical gain and business performance, yet accelerating the pace of innovation. Services in cloud platforms are scheduled and executed in optimized and on-demand re...

In this research, we target at the investigation of a dynamic energy-aware management framework on the execution of independent workloads (e.g., bag-of-tasks) in hybrid CPU-GPU PARA-computing platforms, aiming at optimizing the execution of workloads in appropriate computing resources concurrently while balancing the use of solely virtual or physic...

In this chapter, we propose two parallel algorithms for sparse matrix transposition and vector multiplication using CSR format: with and without actual matrix transposition. Both algorithms are parallelized using OpenMP. Experimentations are run on a quad-core Intel Xeon64 CPU E5507. We measure and compare the performance of our algorithms with tha...

With an enlarging community using electronic design automation, it is a prominent challenge to provide simulation program with integrated circuit emphasis (SPICE) users with sophisticated integrated circuit (IC) models, since many analog IC manufacturers provide software models in SPICE format. Multi-core technology-based processors deliver better...

Bit-reversal is widely known being an important program, as essential part of Fast Fourier Transform. If not carefully and well designed, it may easily take large portion of FFT application’s total execution time. In this paper, we present a parallel implementation of Bit-reversal for FFT using Cilk and UPC. Based on our previous work of creating p...

In this paper, we introduce a parallel version of the Fast Fourier Transform that was created using OpenMP in SPMD style. Our implementation is non-recursive and is based on the conventional Cooley-Tukey algorithm written in C. The aim of this work is show the potential benefit of writing our FFT algorithm in SPMD style which enabled an efficient u...

In this paper, we describe our experience of creating an OpenMP implementation of Bit-reversal for Fast Fourier Transform programs from the existing un-parallelizable sequential algorithm. The aim of this work is to present an analysis of a case study showing the development of a shared memory parallel Bit-reversal for the FFT parallel code with p...

Advances in computer technology, encompassed with fast emerging of multicore processor technology, have made the many-core personal computers available and more affordable. The availability of network of workstations and cluster of many-core SMPs have made them an attractive solution for high performance computing by providing computational power e...

Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 <= w <= k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w*-container if it contains all the vertices of G. A graph G is w*-connected if there exists a w*-container between any...

This paper presents the multithreaded programming techniques used in parallelizing SPICE3 circuit simulator. Two approaches in multithread programming are proposed to parallelize SPICE3 simulator program in multi-core SMP systems. We have used OpenMP and Pthreads, two shared memory programming-interface standards, to realize our approaches, in orde...

Parallel and distributed computing environments are essential and utilized to meet the needs of a wide variety of high-throughput applications. Scheduling strategies are important in order to efficiently utilize resources and to improve response times, throughput and utilization of computing platforms. In this paper, we present a two-level hierarch...

In this paper, we describe our experience of creating an OpenMP implementation of the SPICE3 circuit simulator program. The aim of this work is to present a case study showing the development of a shared memory parallel code with minimum effort and minimal code modification. We present our implementation and discuss the results of the case study in...

In this paper, we describe our experience of creating an OpenMP implementation of the SPICE3 circuit simulator program. Given the irregular patterns of access to dynamic data structures in the SPICE code, a parallelization using current standard OpenMP directives is impossible without major rewriting of the original program. The aim of this work is...

The low cost and wide availability of PC-based clusters have made them excellent alternatives to supercomputing. However, while Network of Workstations are readily available, there is an increasing need for performance tools that support these computing platforms in order to achieve even higher performance. Strategies that may be considered toward...

This paper discusses an approach to implement OpenMP on clusters by translating it to Global Arrays (GA). The basic translation strategy from OpenMP to GA is described. GA requires a data distribution; we do not expect the user to supply this; rather, we show how we perform data distribution and work distribution according to OpenMP static loop sch...

Abstract Inthis paper, we present the compiler transformation of OpenMP code to an ordered collection of tasks, and the compile-time as well as runtime mapping of the resulting task graph to threads for data reuse. The ordering ,of tasks ,is relaxed ,where ,possible so that ,the code may ,be executed ,in a ,more ,loosely synchronous,fashion. Our cu...

A program analysis tool can play an important role in helping users understand and improve large application codes. Dragon is a robust interactive program analysis tool based on the Open64 compiler, which is an Open source C/C++/Fortran77/90 compiler for Intel Itanium systems. We designed and developed the Dragon analysis tool to support manual opt...

A so-called SPMD style OpenMP program can achieve scalability on ccNUMA systems by means of array privatization, and earlier research has shown good performance under this approach. Since it is hard to write SPMD OpenMP code, we showed a strategy for the automatic translation of many OpenMP constructs into SPMD style in our previous work. In this p...

This paper presents the transformation of OpenMP source code to a Macro-Task Graph, an internal representation of the parallel program as a collection of tasks, which later can be asynchronously scheduled for out-of-order execution and optimized for locality reuse. The transformation is based on array region analysis. We also show the potential ben...

Not Available

The scalability of an OpenMP program in a ccNUMA system with a large number of processors suffers from remote memory accesses, cache misses and false sharing. Good data locality is needed to overcome these problems whereas OpenMP offers limited capabilities to control it on ccNUMA architec- ture. A so-called SPMD style OpenMP program can achieve da...

Cougar Compiler is a tool designed to help the programmer understand the structure of a sequential or parallel Fortran program. We support the de facto standards OpenMP and MPI, as well as the mixed mode OpenMP/MPI model, which can be used to write programs for executions on SMP clusters. The user may query the system interactively and view the res...

In this paper, we present the compiler transformation of OpenMP code to an ordered collection of tasks, and the compile time as well as runtime mapping of the resulting task graph to threads for data reuse. The ordering of tasks is relaxed where possible so that the code may be executed in a more loosely synchronous fashion. Our current implementat...

Thesis (Ph. D.)--University of Houston, 2003. Degree granted by Dept. of Computer Science. Includes bibliographical references (leaves 106-111).