• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.57-69
• /
• 2005

This paper proposes a minimal workflow model as a feasible solution to the workflow process rediscovery problem. The minimal workflow model can be represented by the minimal workflow net. The process model is represented by ICN(Information Control Net) Modeling method, ICN can configure activity dependent net applying proper algorithm according to activity dependency among activities which configure the ICN, The proposed model is possible to develop with the application of minimal workflow net and with the application of the algorithm related to activity dependent net properties, Hence, it can solve the process rediscovery problem and can also be helpful on process improvement.

• International Journal of Knowledge Content Development & Technology
• /
• v.7 no.4
• /
• pp.27-50
• /
• 2017

The impact of social networking is varied from good to bad. Online activities have also been categorized into pros and cons of social networking, either as reported as hiding Internet activities among teenagers or killing loneliness among elderly. In terms of relationships, there have been argument over its closeness and quality of an online relationship in Internet settings. Looking at the contradiction in an innovative interaction between classic community communication and social media, there is an unknown scent of the future struggling and challenging both human communication and relationships in the presence of digital culture. This research uses Diffusion of Innovation to study the wide and continuous spread of digital culture in human communication; and, Media Dependency in learning and structuring the cognitive, affective and behavioral effects of social media on each person uses the media in different ways. This research will be using online survey to gain opinions from a social network site as an update of views and reflection of self-awareness to all levels of people. Social media like Facebook (FB) is perceived as a good tool of communication that it is able to bring closeness among the family members. The results show that social media like FB brings positive impact towards family members; it would help to build a better and harmonic society; and, relationships among family members and communication shall be improved and enhanced to the level of a united society.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.327-346
• /
• 2013

Researchers as well as network providers are increasingly interested in understanding how a network user's experience changes in relation to different quality of service (QoS) parameters, with many attempts being made to identify the general relationship between quality of experience (QoE) and QoS. Several relations in different function forms have been proposed. There are instances when this variety of proposed functions potentially results in one problem having completely dissimilar solutions at the same time. The question then is which function form is the one that can better explain this relationship. In this paper, three major existing quantitative relationships between QoE and QoS are investigated. After conducting a comprehensive comparative analysis between them, a new definition of QoE-QoS dependency appears. It then results in identifying a new mutual relationship between QoE and QoS. The newly proposed relationship improves the deficiency of previous QoE-QoS relationships along with solving the problem of diversity of simultaneous solutions for one problem.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.1
• /
• pp.101-108
• /
• 2004

As the dependency to network system and demands of efficient storage systems rapidly grows in every networking filed, the current trends initiated by explosive networked data grow due to the wide-spread of internet multimedia data and internet requires a paradigm shift from computing-centric to data-centric in storagesystems. Furthermore, the new environment of file systems such as NAS(Network Attached Storage) and SAN(Storage Area Network) is adopted to the existing storage paradigm for Providing high availability and efficient data access. We describe the design issues and system components of SANiqueTM, which is the cluster file system based on SAN environment. SANiqueTM has the capability of transferring the user data from the network-attached SAN disk to client applications directly We, especially, present the protocol and functionality of the global buffer manager in our cluster file system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5905-5926
• /
• 2017

Sentiments can profoundly affect individual behavior as well as decision-making. Confronted with the ever-increasing amount of review information available online, it is desirable to provide an effective sentiment model to both detect and organize the available information to improve understanding, and to present the information in a more constructive way for consumers. This study developed a unified phrase-based topic and sentiment detection model, combined with a tracking model using incremental hierarchical dirichlet allocation (PTSM_IHDP). This model was proposed to discover the evolutionary trend of topic-based sentiments from online reviews. PTSM_IHDP model firstly assumed that each review document has been composed by a series of independent phrases, which can be represented as both topic information and sentiment information. PTSM_IHDP model secondly depended on an improved time-dependency non-parametric Bayesian model, integrating incremental hierarchical dirichlet allocation, to estimate the optimal number of topics by incrementally building an up-to-date model. To evaluate the effectiveness of our model, we tested our model on a collected dataset, and compared the result with the predictions of traditional models. The results demonstrate the effectiveness and advantages of our model compared to several state-of-the-art methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.12
• /
• pp.3180-3199
• /
• 2013

While non-predefined object segmentation (NDOS) distinguishes an arbitrary self-assumed object from its background, predefined object segmentation (DOS) pre-specifies the target object. In this paper, a new and novel method to segment predefined objects is presented, by globally optimizing an orientation-based objective function that measures the fitness of the object boundary, in a discretized parameter space. A specific object is explicitly described by normalized discrete sets of boundary points and corresponding normal vectors with respect to its plane shape. The orientation factor provides robust distinctness for target objects. By considering the order of transformation elements, and their dependency on the derived over-segmentation outcome, the domain of translations and scales is efficiently discretized. A branch and bound algorithm is used to determine the transformation parameters of a shape model corresponding to a target object in an image. The results tested on the PASCAL dataset show a considerable achievement in solving complex backgrounds and unclear boundary images.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.91-99
• /
• 2001

Since roost of the program execution time is spent in the loop structure, the problem of extracting parallelism from sequential loop has been one of the most important research issues. However. roost programs have Implicit interprocedure parallelism. This paper presents a generalized method extracting parallelism in loops having the procedure calls. Most parallelization of loops having procedure calls focus on the uniform code where data dependency distance is constant. We present algorithms which can be applied to uniform code, nonuniform code, and complex code. The performance of the proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods have been evaluated using CRAY-T3E. The result shows the effective of the proposed algorithm.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.111-120
• /
• 2004

In order to increase the productivity of software, the research to reduce the total cost in software development environments is working, Considerable time is wasted waiting for a changed program in program development, however smell the change, to be edited and compiled and executed. In case of partial change, we need incremental interpreter for reexecuting the changed parts and its affected parts, In this paper, we implement the incremental interpreter by using analyzing dynamic semantics at execution time, We define a new IMPLO(IMPerative Language with Object) language using EBNF(Extended Backus Naur Form) notation and then, design and implement the incremental interpreter of this language by using action equations to describe the dynamic semantics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4026-4040
• /
• 2019

In this paper, we present an approach for detecting slide transitions in lecture videos by introducing the spatio-temporal residual networks. Given a lecture video which records the digital slides, the speaker, and the audience by multiple cameras, our goal is to find keyframes where slide content changes. Since temporal dependency among video frames is important for detecting slide changes, 3D Convolutional Networks has been regarded as an efficient approach to learn the spatio-temporal features in videos. However, 3D ConvNet will cost much training time and need lots of memory. Hence, we utilize ResNet to ease the training of network, which is easy to optimize. Consequently, we present a novel ConvNet architecture based on 3D ConvNet and ResNet for slide transition detection in lecture videos. Experimental results show that the proposed novel ConvNet architecture achieves the better accuracy than other slide progression detection approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.686-710
• /
• 2019

This work proposes a model to solve the problem of Network Coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.