Innovative DigiTech Enabled Applications and Services Institute
Innovative DigiTech Enabled Applications and Services Institute
Lee C.-S.,National University of Tainan |
Wang M.-H.,National University of Tainan |
Acampora G.,University of Salerno |
Hsu C.-Y.,Innovative Digitech Enabled Applications and Services Institute |
Hagras H.,University of Essex
International Journal of Intelligent Systems | Year: 2010
Nowadays most people can get enough energy to maintain one-day activity, while few people know whether they eat healthily or not. It is quite important to analyze nutritional facts for foods eaten for those who are losing weight or suffering chronic diseases such as diabetes. This paper proposes a novel type-2 fuzzy ontology, including a type-2 fuzzy food ontology and a type-2 fuzzy markup language (FML)-based ontology, for diet assessment. In addition, we also present a type-2 FML (FML2) to describe the type-2 fuzzy ontology and the FML2-based diet assessment agent, including a type-2 knowledge engine, a type-2 fuzzy inference engine, a diet assessment engine, and a semantic analysis engine. In the proposed approach, first, the nutrition facts of various kinds of food are collected from the Internet and the convenience stores. Next, the domain experts construct the type-2 fuzzy ontology, and then the involved subjects are requested to input the different food eaten. Finally, the proposed FML2-based diet assessment agent displays the diet assessment of the food eaten based on the constructed type-2 fuzzy ontology. Using the generated semantic analysis, people can obtain health information about what they eat, which can lead to a healthy lifestyle and healthy diet. Experimental results show that the proposed approach works effectively where the proposed system can provide a diet health status, which can act as a reference to promote healthy living. © 2010 Wiley Periodicals, Inc.
Hong C.-F.,Aletheia University |
Lin M.-H.,Innovative DigiTech Enabled Applications and Services Institute
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2017
The purpose of this study is to explore the innovative use value created by early adopters existing on the Internet world. It is to affect the purchasing intention of the early majority when there is no social relationship network between early adopters and early majority so as to build a new innovative diffusion model. In order to achieve this, the innovative use value created in the Internet by the early adopters was designed as commercial fliers to directly stimulate the early majority. It is used to observe whether new products are accepted by the early majority, and to predict the new product’s diffusion chance. The experimental results proved that this method surely can move the early majority toward groups with high intention and observe how many social networks of early majority will work to influence late majority. © Springer International Publishing AG 2017.
Li H.-C.,National Taiwan University |
Liang P.-H.,National Chengchi University |
Yang J.-M.,National Chengchi University |
Chen S.-J.,Innovative DigiTech Enabled Applications and Services Institute
Proceedings - IEEE International Conference on E-Business Engineering, ICEBE 2010 | Year: 2010
Cloud computing delivery model can significantly reduce enterprise IT costs and complexities. This technology can handle the rapidly gowning environment and provide more flexible resources sharing and hence it has become as a new information technology infrastructure recently. In contrast to traditional enterprise IT solution, cloud computing moves the application software and databases to the servers in large datacenters which raise many security challenges. The business model now allows the users to purchase the capacity they require when they require it. The providers can maximize the utilization by multiplexing customer virtual machines (VMs) across a shared physical infrastructure. In the shared cloud environment, it would be possible to launch an attack cross VMs. How to define the policies for individual virtual firewall becomes more important. In this paper, we investigate the different security vulnerability assessments among the cloud environments. Experiment shows there are more vulnerability happened if vulnerability tools and the servers are in the same LAN. In other word, the hackers can find an easier way to get the target information if sit on the same LAN. This experimental result can be used to analysis the risk in third party compute clouds. © 2010 IEEE.
Hung Y.-S.,Macau University of Science and Technology |
Chen K.-L.B.,Innovative DigiTech Enabled Applications and Services Institute |
Yang C.-T.,Innovative DigiTech Enabled Applications and Services Institute |
Deng G.-F.,Innovative DigiTech Enabled Applications and Services Institute
Expert Systems with Applications | Year: 2013
The rapid growth of the elderly population has increased the need to support elders in maintaining independent and healthy lifestyles in their homes rather than through more expensive and isolated care facilities. Self-care can improve the competence of elderly participants in managing their own health conditions without leaving home. This main purpose of this study is to understand the self-care behavior of elderly participants in a developed self-care service system that provides self-care service and to analyze the daily self-care activities and health status of elders who live at home alone. To understand elder self-care patterns, log data from actual cases of elder self-care service were collected and analysed by Web usage mining. This study analysed 3391 sessions of 157 elders for the month of March, 2012. First, self-care use cycle, time, function numbers, and the depth and extent (range) of services were statistically analysed. Association rules were then used for data mining to find relationship between these functions of self-care behavior. Second, data from interest-based representation schemes were used to construct elder sessions. The ART2-enhance K-mean algorithm was then used to mine cluster patterns. Finally, sequential profiles for elder self-care behavior patterns were captured by applying sequence-based representation schemes in association with Markov models and ART2-enhanced K-mean clustering algorithms for sequence behavior mining cluster patterns for the elders. The analysis results can be used for research in medicine, public health, nursing and psychology and for policy-making in the health care domain. © 2012 Elsevier Ltd. All rights reserved.
Tseng F.S.C.,National Kaohsiung First University of Science and Technology |
Kuo Y.-H.,Innovative DigiTech Enabled Applications and Services Institute |
Huang Y.-M.,National Cheng Kung University
Information Sciences | Year: 2010
Existing parallel algorithms for association rule mining have a large inter-site communication cost or require a large amount of space to maintain the local support counts of a large number of candidate sets. This study proposes a de-clustering approach for distributed architectures, which eliminates the inter-site communication cost, for most of the influential association rule mining algorithms. To de-cluster the database into similar partitions, an efficient algorithm is developed to approximate the shortest spanning path (SSP) to link transaction data together. The SSP obtained is then used to evenly de-cluster the transaction data into subgroups. The proposed approach guarantees that all subgroups are similar to each other and to the original group. Experiment results show that data size and the number of items are the only two factors that determine the performance of de-clustering. Additionally, based on the approach, most of the influential association rule mining algorithms can be implemented in a distributed architecture to obtain a drastic increase in speed without losing any frequent itemsets. Furthermore, the data distribution in each de-clustered participant is almost the same as that of a single site, which implies that the proposed approach can be regarded as a sampling method for distributed association rule mining. Finally, the experiment results prove that the original inadequate mining results can be improved to an almost perfect level. © 2010 Elsevier B.V. All rights reserved.
Yeh Y.-H.,Innovative DigiTech Enabled Applications and Services Institute |
Chen B.,Innovative DigiTech Enabled Applications and Services Institute |
Wu N.-C.,Industrial Technology Research Institute of Taiwan
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015
Mobile apps have attracted a substantial amount of attention in mobile commerce. Usage behavior of consumers is always an important issue in this research area. The objective of this study is to explore what factors will affect an individual’s continuance intention to use mobile apps. We proposes a research model that integrates the Task-Technology Fit (TTF) and Theory of Reasoned Action (TRA), which are augmented with concepts of affective factors. We conduct an online survey and the results show that a higher degree of TTF and VTF (Value-Technology Fit) resulted in a more positive attitude towards using the mobile app. SN and attitude had strong significant impacts on users’ continuance intention to use the app. However, TTF and VTF had no significant effect on the continuance intention to use the app. © Springer International Publishing Switzerland 2015.
Chen C.-Y.,Innovative DigiTech Enabled Applications and Services Institute |
Chang K.-C.,Innovative DigiTech Enabled Applications and Services Institute |
Chang K.-C.,National Sun Yat - sen University |
Ho S.-H.,Innovative DigiTech Enabled Applications and Services Institute
Expert Systems with Applications | Year: 2011
The work and contribution of this study is not only to devise an improved PSO framework that is capable of wider search area and better fitness values, but also to realize a system that possesses the particle swarm intelligence via high diversity preserving and individual random walking. The purpose of this study is to interpret the processes of how to approach this framework, which consists of bilateral objective function (BOF) and random walking swarm intelligence (RW-PSO), and to provide the distinction from the current problems of PSO technique. Hence, this paper will present the ability of particles escaping from local optimum can be greatly improved because of the increase of exploration stage and scope and the global optimum can be obtained easily with the hybrid of BOF and RWSI, which may involve in searching for the solution from a more complicated test function. Subsequently, the results revealed the advantages of the proposed framework for improving the particle swarm optimization: (a) preserving the simple spirit of the conventional PSO; (b) achieving effective solutions for benchmark functions efficiently; (c) increasing no additional parameters to gain fitness improvement. Moreover, the superiority of the proposed framework has also been demonstrated the results via seven test functions defined to simulate some of complicated real-world problems and the better performance according to the experimental results with several benchmark functions. © 2010 Elsevier Ltd. All rights reserved.
Peng Y.-H.,Innovative DigiTech Enabled Applications and Services Institute |
Yang C.-B.,National Sun Yat - sen University
Information and Computation | Year: 2014
The longest common subsequence (LCS) problem with gap constraints (or the gapped LCS), which has applications to genetics and molecular biology, is an interesting and useful variant to the LCS problem. In previous work, this problem is solved in O(nm) time when the gap constraints are fixed to a single integer, where n and m denote the lengths of the two input sequences A and B, respectively. In this paper, we first generalize the problem from fixed gaps to variable gap constraints. Then, we devise an optimal approach for the incremental suffix maximum query (ISMQ), which helps us obtain an efficient algorithm with O(nm) time for finding LCS with variable gap constraints. In addition, our technique for ISMQ can be applied to solve one of the block edit problems on strings, reducing the time complexity from O(nmlogm+m2) to O(nm+m2). Hence, the result of this paper is beneficial to related research on sequence analysis and stringology. © 2014 Elsevier Ltd. All rights reserved.
Chen H.-H.,National Sun Yat - sen University |
Yang C.-B.,National Sun Yat - sen University |
Peng Y.-H.,Innovative DigiTech Enabled Applications and Services Institute
Applied Soft Computing Journal | Year: 2014
The aim of this paper is to combine several techniques together to provide one systematic method for guiding the investment in mutual funds. Many researches focus on the prediction of a single asset time series, or focus on portfolio management to diversify the investment risk, but they do not generate explicit trading rules. Only a few researches combine these two concepts together, but they adjust trading rules manually. Our method combines the techniques for generating observable and profitable trading rules, managing portfolio and allocating capital. First, the buying timing and selling timing are decided by the trading rules generated by gene expression programming. The trading rules are suitable for the constantly changing market. Second, the funds with higher Sortino ratios are selected into the portfolio. Third, there are two models for capital allocation, one allocates the capital equally (EQ) and the other allocates the capital with the mean variance (MV) model. Also, we perform superior predictive ability test to ensure that our method can earn positive returns without data snooping. To evaluate the return performance of our method, we simulate the investment on mutual funds from January 1999 to September 2012. The training duration is from 1999/1/1 to 2003/12/31, while the testing duration is from 2004/1/1 to 2012/9/11. The best annualized return of our method with EQ and MV capital allocation models are 12.08% and 12.85%, respectively. The latter also lowers the investment risk. To compare with the method proposed by Tsai et al., we also perform testing from January 2004 to December 2008. The experimental results show that our method can earn annualized return 9.07% and 11.27%, which are better than the annualized return 6.89% of Tsai et al. © 2013 Elsevier B.V. All rights reserved.
Liang P.-H.,Innovative DigiTech Enabled Applications and Services Institute |
Liang P.-H.,National Chengchi University |
Yang J.-M.,National Chengchi University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011
With the virtualization technology maturity and the growing up fast of the cloud computing services, the application service providers have changed the way to server customers. Meanwhile, the new service model let users access the resource with the browser of their thin devices. By the way, the application service providers do not need to buy many machines for the uncertain backup or expanded requirement. Because the Cloud Service can provision the computing resources for customers dynamically, the users also pay as their use. The innovation of information science and technology drives e-learning system to produce a new type of service and the personalization requirements of the users are fast growing up. This paper presents a solution for building a virtual and personalized learning environment which combines the technology of Cloud Infrastructure as a Service (IaaS) and Cloud Software as a Service (SaaS) to create a service oriented model for the application service providers and the learners. The proposed environment "Virtual Personalized Learning Environment" is intended for subscribing and excising of the selected learning resources as well as creating a personalized virtual classroom. This VPLE system allows the learning content providers to registry their applications in the server and the learners integrate other internet learning resources to their learning application pools. © 2011 Springer-Verlag.