Search results for: Tran Trong Thang

Authors: Quoc-Nam Tran

Abstract:

The theory of Groebner Bases, which has recently been honored with the ACM Paris Kanellakis Theory and Practice Award, has become a crucial building block to computer algebra, and is widely used in science, engineering, and computer science. It is wellknown that Groebner bases computation is EXP-SPACE in a general polynomial ring setting. However, for many important applications in computer science such as satisfiability and automated verification of hardware and software, computations are performed in a Boolean ring. In this paper, we give an algorithm to show that Groebner bases computation is PSPACE in Boolean rings. We also show that with this discovery, the Groebner bases method can theoretically be as efficient as other methods for automated verification of hardware and software. Additionally, many useful and interesting properties of Groebner bases including the ability to efficiently convert the bases for different orders of variables making Groebner bases a promising method in automated verification.

Keywords: Algorithm, Complexity, Groebner basis, Applications of Computer Science.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1913

Authors: Wanli Ma, Dat Tran, Dharmendra Sharma

Abstract:

The temporal nature of negative selection is an under exploited area. In a negative selection system, newly generated antibodies go through a maturing phase, and the survivors of the phase then wait to be activated by the incoming antigens after certain number of matches. These without having enough matches will age and die, while these with enough matches (i.e., being activated) will become active detectors. A currently active detector may also age and die if it cannot find any match in a pre-defined (lengthy) period of time. Therefore, what matters in a negative selection system is the dynamics of the involved parties in the current time window, not the whole time duration, which may be up to eternity. This property has the potential to define the uniqueness of negative selection in comparison with the other approaches. On the other hand, a negative selection system is only trained with “normal" data samples. It has to learn and discover unknown “abnormal" data patterns on the fly by itself. Consequently, it is more appreciate to utilize negation selection as a system for pattern discovery and recognition rather than just pattern recognition. In this paper, we study the potential of using negative selection in discovering unknown temporal patterns.

Keywords: Artificial Immune Systems, ComputationalIntelligence, Negative Selection, Pattern Discovery.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1625

Authors: M. F. R. Zuthi, H. H. Ngo, W. S. Guo, S. S. Chen, N. C. Nguyen, L. J. Deng, T. D. C. Tran

Abstract:

Sustaining a desired rate of oxygen transfer for microbial activity is a matter of major concern for biological wastewater treatment (MBR). The study reported in the paper was aimed at assessing the effects of microbial products on the specific oxygen uptake rate (SOUR) in a conventional membrane bioreactor (CMBR) and that in a sponge submerged MBR (SSMBR). The production and progressive accumulation of soluble microbial products (SMP) and bound-extracellular polymeric substances (bEPS) were affecting the SOUR of the microorganisms which varied at different stages of operation of the MBR systems depending on the variable concentrations of the SMP/bEPS. The effect of bEPS on the SOUR was stronger in the SSMBR compared to that of the SMP, while relative high concentrations of SMP had adverse effects on the SOUR of the CMBR system. Of the different mathematical correlations analyzed in the study, logarithmic mathematical correlations could be established between SOUR and bEPS in SSMBR, and similar correlations could also be found between SOUR and SMP concentrations in the CMBR.

Keywords: Microbial products, Microbial activity, Specific oxygen uptake rate, Membrane bioreactor.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1843

Authors: T.V. Tran, S. Teramoto, M. Kimura, T. Boonyatee, Le Ba Vinh

Abstract:

In this paper, two centrifugal model tests (case 1: raft foundation, case 2: 2x2 piled raft foundation) were conducted in order to evaluate the effect of ground subsidence on load sharing among piles and raft and settlement of raft and piled raft foundations. For each case, two conditions consisting of undrained (without groundwater pumping) and drained (with groundwater pumping) conditions were considered. Vertical loads were applied to the models after the foundations were completely consolidated by selfweight at 50g. The results show that load sharing by the piles in piled raft foundation (piled load share) for drained condition decreases faster than that for undrained condition. Settlement of both raft and piled raft foundations for drained condition increases more quickly than that for undrained condition. In addition, the settlement of raft foundation increases more largely than the settlement of piled raft foundation for drained condition.

Keywords: Ground subsidence, Piled raft, Load sharing, Centrifugal model test.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2884

Authors: Gergely Treplan, Long Tran-Thanh, Janos Levendovszky

Abstract:

In this paper, a reliable cooperative multipath routing algorithm is proposed for data forwarding in wireless sensor networks (WSNs). In this algorithm, data packets are forwarded towards the base station (BS) through a number of paths, using a set of relay nodes. In addition, the Rayleigh fading model is used to calculate the evaluation metric of links. Here, the quality of reliability is guaranteed by selecting optimal relay set with which the probability of correct packet reception at the BS will exceed a predefined threshold. Therefore, the proposed scheme ensures reliable packet transmission to the BS. Furthermore, in the proposed algorithm, energy efficiency is achieved by energy balancing (i.e. minimizing the energy consumption of the bottleneck node of the routing path) at the same time. This work also demonstrates that the proposed algorithm outperforms existing algorithms in extending longevity of the network, with respect to the quality of reliability. Given this, the obtained results make possible reliable path selection with minimum energy consumption in real time.

Keywords: wireless sensor networks, reliability, cooperativerouting, Rayleigh fading model, energy balancing

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1564

Authors: Daniel Gonzales, Zev Winkelman, Trung Tran, Ricardo Sanchez, Dulani Woods, John Hollywood

Abstract:

We have developed a distributed computing capability, Digital Forensics Compute Cluster (DFORC2) to speed up the ingestion and processing of digital evidence that is resident on computer hard drives. DFORC2 parallelizes evidence ingestion and file processing steps. It can be run on a standalone computer cluster or in the Amazon Web Services (AWS) cloud. When running in a virtualized computing environment, its cluster resources can be dynamically scaled up or down using Kubernetes. DFORC2 is an open source project that uses Autopsy, Apache Spark and Kafka, and other open source software packages. It extends the proven open source digital forensics capabilities of Autopsy to compute clusters and cloud architectures, so digital forensics tasks can be accomplished efficiently by a scalable array of cluster compute nodes. In this paper, we describe DFORC2 and compare it with a standalone version of Autopsy when both are used to process evidence from hard drives of different sizes.

Keywords: Cloud computing, cybersecurity, digital forensics, Kafka, Kubernetes, Spark.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1593

Authors: Manpreet Singh, V. P. Agrawal, Gurmanjot Singh Bhatti

Abstract:

From the last decades, there is a significant technological advancement in the field of robotics, and a number of modular self-reconfigurable robots were introduced that can help in space exploration, bucket to stuff, search, and rescue operation during earthquake, etc. As there are numbers of self-reconfigurable robots, choosing the optimum one is always a concern for robot user since there is an increase in available features, facilities, complexity, etc. The objective of this research work is to present a multiple attribute decision making based methodology for coding, evaluation, comparison ranking and selection of modular self-reconfigurable robots using a technique for order preferences by similarity to ideal solution approach. However, 86 attributes that affect the structure and performance are identified. A database for modular self-reconfigurable robot on the basis of different pertinent attribute is generated. This database is very useful for the user, for selecting a robot that suits their operational needs. Two visual methods namely linear graph and spider chart are proposed for ranking of modular self-reconfigurable robots. Using five robots (Atron, Smores, Polybot, M-Tran 3, Superbot), an example is illustrated, and raking of the robots is successfully done, which shows that Smores is the best robot for the operational need illustrated, and this methodology is found to be very effective and simple to use.

Keywords: Self-reconfigurable robots, MADM, TOPSIS, morphogenesis, scalability.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 837

Authors: Dinh-Ha Tran, Chung-Ruey Yen, Yu-Kuang H. Chen

Abstract:

A collection of thirty cultivars/clones of a red pitaya was used to investigate flowering response to lighting supplementation in the winter season of 2013-2014 in southern Taiwan. The night-breaking treatment was conducted during the period of 10 Oct. 2013 to 5 Mar. 2014 with 4-continuous hours (22.00 – 02.00 hrs) of additional lighting daily using incandescent bulbs (100W). Among cultivars and clones tested, twenty-three genotypes, most belonging to the red-magenta flesh type, were found to have positively flowering response to the lighting treatment. The duration of night-breaking treatment for successful flowering initiation varied from 33- 48 days. The lighting-sensitive genotypes bore 1-2 flowering flushes. Floral and fruiting stages took 21-26 and 46-59 days, respectively. Among sixteen fruiting genotypes, the highest fruit set rates were found in Damao 9, D4, D13, Chaozou large, Chaozhou 5, Small Nick and F22. Five cultivars and clones (Orejona, D4, Chaozhou large, Chaozhou 5 and Small Nick) produced fruits with an average weight of more than 300 g per fruit which were higher than those of the fruits formed in the summer of 2013. Fruits produced during off-season containing total soluble solids (TSS) from 17.5 to 20.7oBrix, which were higher than those produced inseason.

Keywords: Flowering response, long-day plant, night-breaking treatment, off-season production, pitaya.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3901