• Kyungpook Mathematical Journal
• /
• v.58 no.4
• /
• pp.733-746
• /
• 2018

The concept of f-statistical convergence which is, in fact, a generalization of statistical convergence, has been introduced recently by Aizpuru et al. (Quaest. Math. 37: 525-530, 2014). The main object of this paper is to prove an f-statistical analog of the classical Korovkin type approximation theorem of Boyanov and Veselinov. It is shown that the f-statistical analog is intermediate between the classical theorem and its statistical analog. As an application, we estimate the rate of f-statistical convergence of the sequence of positive linear operators defined from $C^*[0,{\infty})$ into itself.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.5
• /
• pp.543-552
• /
• 1999

The iterator technique which is used for implementing physical operators of the query executor is known for its efficiency and extensibility. The most widely used technique for processing an operator on spatial objects is to process by dividing it into the filter step and the refinement step. Recently, there was a research for an optimizer which can generate more efficient query execution plans than those of traditional methods by separating a spatial operator into filter and refinement steps in the level of the object algebra. But, traditional query executors were not designed considering such query execution plans. So they have no function of transmitting the result of the filter operation between operators. We propose two methods, the probe technique and the tag technique, which transmit the result of the filter operator when using the iterator in the query execution plan in which operators are separated by filter/refinement steps and other operators can be allowed between the steps. Whereas the probe technique extends the state record within an operator, the tag technique stores the result of a filter step in an intermediate result in the form of the tag. Based on the comparison of these methods, we design and implement a query executor using the tag technique that is superior in extensibility. The implemented query executor can execute operations defined in the Spatial Object Algebra(SOA) to process an extended OQL for spatial queries.

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.24 no.2
• /
• pp.65-77
• /
• 2018

Purpose: By identifying the contents of the "Empty Home Utilization & Community Revitalization Model Project" which is a pilot project of empty homes back into use in Kyoto City and analyzing the characteristics of the case housing, the purpose of this study is to find out implications and suggest improvements for the domestic empty home utilization project. Methods: The scope of the survey covers seven project sites in the period from 2014 to 2016. The research method is to derive the physical and operational characteristics of the project, through the literature reviews related to bringing empty homes back into use in Kyoto City and the field survey including the space measurement and the operator interview. Results: First, in order to succeed in bringing empty homes back into use for community revitalization, the selection process of the project and the role of the public in and after supporting the project are important. Second, the important features that are required as a physical characteristic of the project are an advantage in location and an interactive space that is available at all time like a community cafe at the entrance. Third, as an operational characteristic of the empty home utilization project, it is advantageous for the local residents to participate as a business actor or an operator, and it is the continuous use of residents and outsiders by implementing an operating program that is suitable for the characteristics of the local community. Implications: The physical and operational activation factors to bring empty homes back into use need to be included as the project screening standards. And it is necessary for the public to develop the Intermediate Support Organization and to participate in linking with residents in order to carry out the empty homes utilization project effectively.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.479-486
• /
• 2014

MapReduce is a programing model used for parallelly processing a large amount of data. To analyze a large amount data, the data cube is widely used, which is an operator that computes group-bys for all possible combinations of given dimension attributes. When the number of dimension attributes is n, the data cube computes $2^n$ group-bys. In this paper, we propose an efficient method for computing data cubes using MapReduce. The proposed method partitions $2^n$ group-bys into $_nC_{{\lceil}n/2{\rceil}}$ batches, and computes those batches in stages using ${\lceil}n/2{\rceil}$ MapReduce jobs. Compared to the existing methods, the proposed method significantly reduces the amount of intermediate data generated by mappers, so that the cost of sorting and transferring those intermediate data is reduced significantly. Consequently, the total processing time for computing a data cube is reduced. Through experiments, we show the efficiency of the proposed method over the existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3C
• /
• pp.281-292
• /
• 2008

A main application of sensor networks are to monitor and to send information about a possibly hostile environment to a powerful base station connected to a wired network. To conserve power from each sensor, intermediate network nodes should aggregate results from individual sensors. However, it can make it that a single compromised sensor can render the network useless, or worse, mislead the operator into trusting a false reading. In this paper, we propose a protocol to give us a key aggregation mechanism that intermediate network nodes could aggregate data more safely. The proposed protocol is more helpful at multi-tier network architecture in secure sessions established between sensor nodes and gateways. From simulation study, we compare the amount of the energy consumption overhead, the time of key transmission and the ratio of of key process between the proposed method and LHA-SP. The simulation result of proposed protocol is low 3.5% a lord of energy consumption than LHA-SP, the time of key transmission and the ration of key process is get improved result of each 0.3% and 0.6% than LHA-SP.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.217-228
• /
• 2009

Data analysis applications typically aggregate data across many dimensions looking for unusual patterns in data. Even though such applications are usually possible with standard structured query language (SQL) queries, the queries may become very complex. A complex query may result in many scans of the base table, leading to poor performance. Because online analytical processing (OLAP) queries are usually complex, it is desired to define a new operator for aggregation, called the data cube or simply cube. Data cube supports OLAP tasks like aggregation and sub-totals. Many aggregate functions can be used to construct a data cube. Those functions can be classified into three categories, the distributive, the algebraic, and the holistic. It has been thought that the distributive functions such as SUM, COUNT, MAX, and MIN can be used to construct a data cube, and also the algebraic function such as AVG can be used if the function is replaced to an intermediate function. It is believed that even though AVG is not distributive, but the intermediate function (SUM, COUNT) is distributive, and AVG can certainly be computed from (SUM, COUNT). In this paper, however, it is found that the intermediate function (SUM COUNT) cannot be applied to OLAP cubes, and consequently the function leads to erroneous conclusions and decisions. The objective of this study is to identify some problems in applying aggregate function AVG to OLAP cubes, and to design a process for solving these problems.

• Smart Structures and Systems
• /
• v.14 no.6
• /
• pp.1131-1150
• /
• 2014

One of the issues in extending the range of applicable problems of real-time hybrid simulation is the computation speed of the simulator when large-scale computational models with a large number of DOF are used. In this study, functionality of real-time dynamic simulation of MDOF systems is achieved by creating a logic circuit that performs the step-by-step numerical time integration of the equations of motion of the system. The designed logic circuit can be implemented to an FPGA-based system; FPGA (Field Programmable Gate Array) allows large-scale parallel computing by implementing a number of arithmetic operators within the device. The operator splitting method is used as the numerical time integration scheme. The logic circuit consists of blocks of circuits that perform numerical arithmetic operations that appear in the integration scheme, including addition and multiplication of floating-point numbers, registers to store the intermediate data, and data busses connecting these elements to transmit various information including the floating-point numerical data among them. Case study on several types of linear and nonlinear MDOF system models shows that use of resource sharing in logic synthesis is crucial for effective application of FPGA to real-time dynamic simulation of structural response with time step interval of 1 ms.

• Journal of Distribution Science
• /
• v.17 no.11
• /
• pp.47-52
• /
• 2019

Purpose: This study specifically discusses why coffee shop customers want to revisit coffee shops. In addition, we would like to verify the mediated effect of the emotional reaction in relation to the influence of the experience values of the Chinese coffee shop on the re-visit of the coffee shop. Research design, data and methodology: Regression and reliability analyses were conducted. Simple regression was used for stock price verification, and the bootstrap method of model4 of Hayes was performed for the intermediate hypothesis verification. Results: This study confirmed that the experience values of coffee shops (entertainment, aesthetic, economic efficiency, and service excellence) have a significant influence on customers' intention to revisit coffee shops. Conclusions: Managers can check that the level of revisit by customers is increased by increasing the elements of experience value. In addition, studies have shown that the customer's emotional reactions play a significant mediating role in the relationship between the value of the experience and the customer's intention to revisit the coffee shop. This suggests that the coffee shop operator should focus on the emotional response of its customers and devise strategies to ensure that the value of the experience is connected to the intent of revisiting.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.10
• /
• pp.1062-1070
• /
• 2009

The strip shape for the stainless steel process has made an issue of the strip quality, and hence the shape control method is developed at the Sendzimir rolling mill (ZRM). ZRM is a stainless cold rolling mill and has actuators for the shape control. They are first intermediate rolls and top crown rolls, which are controlled horizontally and vertically, respectively. The shape control of the stainless steel rolling process has difficulty in obtaining the symmetrical shape. The objective of the shape control is to minimize the shape deviation and to maintain stable state, which keeps symmetrical shape pattern in the lateral direction. The method of the shape recognition employs a least squares method and neural network. The shape deviation is the difference between the target shape and actual shape and is controlled by the fuzzy shape control. The fuzzy shape control using operator's informative knowledge is proposed in this paper. The experiments are carried out online for various stainless materials and sizes. The productivity of the rolling process has increased from 9.0 to 9.4 tons per hour.

• Language and Information
• /
• v.13 no.1
• /
• pp.127-143
• /
• 2009

Tough-construction is, undoubtedly, one of the most puzzling syntactic problems in the history of transformational grammar. Various approaches have been proposed including Deletion approaches (Akmajian, 1972; Lasnik and Fiengo, 1974) and movement approaches. Among the movement approaches, Chomsky (1977; 1981) argues for movement of null Operator, and Hornstein (2001) argues for a two-step movement equipped with Sideward movement. Most recently, Schueler (2004) and Hartman (2009) each have also argued for a kind of movement approach. With the development of the Minimalist syntax (Chomsky, 1995; Chomsky, 2000; Chomsky, 2001), tough-construction, an age old problem in the description of grammar, turns into another round toward to a more satisfactory answer. By examining the most recent competing analyses of tough-constructions, this paper defends and extends Schueler's (2004) analysis, rather than Hartman's (2009) two step movement approach. Furthermore, this paper proposes that tough-subject originates from the intermediate CP internal Spec-TopicP position rather than from the iterated CP layer (Authier, 1992). This approach has more descriptive power than it was originally argued for in Schueler (2004) and is a step closer toward Minimalism insofar as the conception of government is no longer utilized.