• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.6034-6056
• /
• 2018

This paper describes two user studies in remote collaboration between two users with a video conferencing system where a remote user can draw annotations on the live video of the local user's workspace. In these two studies, the local user had the control of the view when sharing the first-person view, but our interfaces provided instant control of the shared view to the remote users. The first study investigates methods for assisting drawing annotations. The auto-freeze method, a novel solution for drawing annotations, is compared to a prior solution (manual freeze method) and a baseline (non-freeze) condition. Results show that both local and remote users preferred the auto-freeze method, which is easy to use and allows users to quickly draw annotations. The manual-freeze method supported precise drawing, but was less preferred because of the need for manual input. The second study explores visual notification for better local user awareness. We propose two designs: the red-box and both-freeze notifications, and compare these to the baseline, no notification condition. Users preferred the less obtrusive red-box notification that improved awareness of when annotations were made by remote users, and had a significantly lower level of interruption compared to the both-freeze condition.

• Journal of East Asia Management
• /
• 제3권2호
• /
• pp.1-19
• /
• 2022

This study suggests an integrated theoretical framework for the relationship between political risk and multinational corporation (MNC) subsidiary's performance in the emerging market. The political risk would have a negative impact on MNC subsidiary's performance in the emerging countries that are developing in Asia, the Commonwealth of Independent States, Africa, and South America. The major reason is that political risks could generate a loss of benefit or a loss of control for MNC's subsidiary. In this study, I suggest that corporate social responsibility (CSR) strategy would be a solution to overcome various political risks. Specifically, the affiliated firms with diversified industries or greater financial resources could mitigate the negative impact of political risk than unaffiliated firms. Because they can use their tangible or nontangible asset such as information, technology, and construction in order to gain legitimacy and trust from local government, local community, and local firms in the emerging market. Finally, I claimed the costs of the affiliated firms would exceed the benefits at the initial stages, while the benefits of affiliated firms would exceed the costs over time when political risks become higher. The reason is that the trust gained from local stakeholders accumulates over time and the impact of CSR strategy would become an important solution to overcome the risks in and unstable context.

• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.511-527
• /
• 2014

This paper provides a new application similar to the Local Defect Correction (LDC) technique to solve Poisson problem -u"(x) = f(x) with Dirichlet boundary conditions. The exact solution is supposed to have high activity in some region of the domain. LDC is combined with a fourth order compact scheme which is recently developed in Abbas (Num. Meth. Partial differential equations, 2013). Numerical tests illustrate the interest of this application.

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.83-92
• /
• 2021

This paper studies approximate solutions for a class of nonlinear diffusion population models. Our methods are to use the fundamental solution of heat equations to construct integral forms of the models and the well-known Banach compression map theorem to prove the existence of positive solutions of integral equations. Non-steady-state local approximate solutions for suitable harvest functions are obtained by utilizing the approximation theorem of multivariate continuous functions.

• East Asian mathematical journal
• /
• 제25권4호
• /
• pp.425-431
• /
• 2009

We provide a local convergence analysis for Newton-like methods for the solution of generalized equations in a Banach space setting. Using some ideas of ours introduced in [2] for nonlinear equations we show that under weaker hypotheses and computational cost than in [7] a larger convergence radius and finer error bounds on the distances involved can be obtained.

• International Journal of Internet, Broadcasting and Communication
• /
• 제10권4호
• /
• pp.31-36
• /
• 2018

Living Lab is one of open movements regarding social innovation, which mainly utilizes scientific technology to improve local residents' life value. Even though various attempts have been made, Living Lab projects that deal with actual life-related problems of local communities are not sufficiently being made. This study aims at organizing existing Living Lab studies and to draw political issues in perspective of solving regional problems and developing local communities. Above all, policies should be proceeded in a way that fully understands and reflects local problem since communication with local residents or end-users will be increased. It is required to support certain products or solution development that fits specific local situation based on their resource and demands. In addition, local small businesses or start-up companies should be given opportunities to conduct experiment and revise new technology, product or service on the spot. It would be a useful example to utilize ICT technology and contents such as local cable TV network, for Living Lab. Living Lab can establish itself as an effective reformation process only if it remains to function for the sake of solving issues of local community and residents. Practical undertones would be able to be obtained once this exploratory study turns into empirical case study.

• Bulletin of the Korean Chemical Society
• /
• 제32권5호
• /
• pp.1640-1644
• /
• 2011

Water-soluble mutant of intrinsically insoluble protein, crambin, was produced by mutagenesis based on the sequence analysis with homologous proteins. Thr1, Phe13, and Lys33 of crambin were substituted for Lys, Tyr, and Lys, respectively. The resultant mutant was soluble in aqueous buffer as well as in dodecylphosphocholine (DPC) micelle solution. The $^1H-^{15}N$ spectrum of the mutant crambin showed spectral similarity to that of the wild-type protein except for local regions proximal to the sites of mutation. Solution structure of water-soluble mutant crambin was determined in aqueous buffer by NMR spectroscopy. The structure was almost identical to the wild-type structure determined in non-aqueous solvent. Subtle difference in structure was very local and related to the change of the intra- and inter-protein hydrophobic interaction of crambin. The structural details for the enhanced solubility of crambin in aqueous solvent by the mutation were provided and discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권1호
• /
• pp.5-21
• /
• 2008

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.

• 한국컴퓨터정보학회논문지
• /
• 제20권7호
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• 대한기계학회논문집A
• /
• 제29권10호
• /
• pp.1369-1376
• /
• 2005

In structural design, the design variables are frequently selected from certain discrete values. Various optimization algorithms have been developed fDr discrete design. It is well known that many function evaluations are needed in such optimization. Recently, sequential algorithm with orthogonal arrays (SOA), which is a search algorithm for a local minimum in a discrete space, has been developed. It considerably reduces the number of function evaluations. However, it only finds a local minimum and the final solution depends on the initial values of the design variables. A new algorithm is proposed to adopt a genetic algorithm (GA) in SOA. The GA can find a solution in a global sense. The solution from the GA is used as the initial design of SOA. A sequential usage of the GA and SOA is carried out in an iterative manner until the convergence criteria are satisfied. The performance of the algorithm is evaluated by various examples.