Ordinals I: Basic notions

At the end of the last century, Cantor generalized the notion of natural integer by considering the order structure of integers. According to the idea of counting more and more, he introduced transfinite numbers over natural numbers. Thus an ordinal may be simply defined as a natural number or a transfinite number, and ordinal arithmetic extends usual one. The ordinals up to ₀ can be described in an intuitive way (with 0, 1, and the sum, product and exponentiation operations). In contrast, it cannot be done for ordinals beyond ₀. In order to describe greater ordinals, Veblen introduced a normal functions hierarchy (i.e. strictly increasing and continuous) from ordinals into ordinals. This construction allows us to describe ordinals until ₀, using ordinals preceding ₀. Therefore, ₀ and ₀ have a similar role if Veblen functions are used for ₀ in addition to the previous operations.     

Transfer function approach to quantum Control-Part II: Control concepts and applications

Based on the stochastic differential equation of quantum mechanical feedback obtained in the first part of this paper, detailed control concepts and applications are discussed for quantum systems interacting with a noncommutative noise source. A feedback system in our framework is purely nonclassical in the sense that feedback control is performed via local operation and quantum communication through a quantum channel. The role of the controller is to alter the quantum dynamic characteristics of the plant through entanglement, shared between the plant and controller by sending quantum states, that is modulated by the Hamiltonian on the controller. The input-output relation of quantum systems provides a natural extension of control theory to the quantum domain. This enables one to present a control theoretical interpretation of some fundamental quantum mechanical notions such as the uncertainty principle, but also to find applications of ideas and tools of control theory. One of the most important applications is the production of squeezed states, which has been an important issue of quantum theory in relation to quantum computation and quantum communication. The method proposed here reduces the application to a conventional noise reduction problem with feedback. The H/sub /spl infin// control then leads to complete squeezing.     

An innovations approach to least-squares estimation--Part VII: Some applications of vector autoregressive-moving average models

We use the innovations method to solve some linear estimation problems for stochastic processes described as the solution of high-order linear difference equations driven by colored noise. Such models are often called vector or multivariable auto-regressive-moving average (ARMA) models. We illustrate how the use of ARMA models can provide some simplifications and some new results in the problem of state estimation in colored noise.     

Matrix interpolation: Some control applications

Matrix interpolation theory has provided a very useful and elegant mathematical tool to analyse the problems which could be translated into some matrix equations. It could also be applied to justify some convenient known results frequently used in many instances. In this paper, a brief review of this theory and some of its applications in control engineering are presented. Solutions of some matrix equations, Pole Placement Problems (PPP) for Multi-Input MultiOutput (MIMO) plants and Model Matching Problem (MMP) are outlined and the results are summarized in step by step algorithms. A new method profiting matrix interpolation is introduced for achieving Diagonal Dominance (DD) or almost decoupling of MIMO control plants. In the presented method we use matrix interpolation to reduce the computation order and to build confidence into some known simulation results obtained from similar methods. It is shown that this method provides considerable advantages compared with other existing methods from the point of computational order, uniqueness of solution and its clarity. Finally, a physical plant is controlled by direct Nyquist procedure using the presented method for achieving DD. Having less complexity than other references, the designed controller strongly satisfies the desired performances.     

Generating three-tier applications from relational databases: a formal and practical approach

This article describes a method for building applications with a three-tier structure (presentation, business, persistence) from an existing relational database. The method works as a transformation function that takes the relational schema as its input, producing three sets of classes (which depend on the actual system being reengineered) to represent the final application, as well as some additional auxiliary classes (which are ‘constant’ and always generated, such as an ‘About’ dialog, for example). All the classes generated are adequately placed along the three-tiers.The method is based on (1) the formalization of all the sets involved in the process, and (2) the mathematical formulation of the required functions to get the final application. For this second step, we have taken into account several well-known, widely used design and transformation patterns that produce high quality designs and highly maintainable software.The method is implemented in a tool that we have successfully used in several projects of medium size. Obviously, it is quite difficult for the obtained software to fulfill all the requirements desired by the customer, but the uniformity and understandability of its design makes very easy its modification.     

Multiple-server movie-retrieval strategies for distributed multimedia applications: a play-while-retrieve approach

In this paper, we present a generalized approach to retrieve a long-duration movie requested using a network-based video-on-demand service infrastructure employing multiple servers. We design and analyze a play-while-retrieve (PWR) playback strategy for this multiserver environment such that the access time (waiting time for the clients) is minimized. For this strategy, we use both the single-installment and multi-installment retrieval strategies to analyze the performance of the service system. For the above-mentioned retrieval strategies, we explicitly derive closed-form expressions for a minimum access time. For the case of multi-installment retrieval strategy, we conduct asymptotic performance analysis that quantifies the ultimate performance bounds of our strategy. We demonstrate analytically the impact of a large-scale network, as well as the impact of indefinitely increasing the number of installments, on the performance of such a multiserver service system. We then address the problem of buffer management at the client site, which is a closely related issue that has a significant influence on the performance of the strategy, and also serves as a key issue in making the service system attractive for clients. We derive relationships that quantify the minimum amount of buffer expected at the client site to have a smooth presentation with this multiserver service structure. Finally, we perform simulation experiments to verify all our theoretical findings. In the experiments, we compare the performance of PWR strategy with that of play-after-retrieve strategy, and discuss certain important points that are crucial for implementing a real-life working multiserver service system.     

Towards improving the navigability of Web applications: a model-driven approach

Navigability in use, defined as the efficiency, effectiveness and satisfaction with which a user navigates through the system in order to fulfil her goals under specific conditions, has a definite impact on the overall success of Web applications. This quality attribute can be measured based on the navigational model (NM) provided by Web engineering (WE) methodologies. Most of the measures currently defined for NMs are tightly coupled with particular WE methodologies, however. Furthermore, modifications to the design of the NM, carried out with the aim of improving navigability, are performed manually. Both practices have seriously hampered the reusability and adoption of proposed navigability measures and improvement techniques. In this paper, we present a Model-Driven Engineering approach to solving these problems. On the one hand, we propose a generic approach for the definition of navigability measurement models that can be integrated into any WE methodology. On the other hand, we present a model-driven improvement process for the NM design that incurs no increase in costs or in time-to-market of Web applications. This process is divided into two phases: evaluation (i.e. assessment of the model through objective measures) and evolution (i.e. transformation of the model when the measurement results do not fall inside the boundaries set by certain quality decision criteria that have been defined previously).     

Creation of small kinetic models for CFD applications: a meta-heuristic approach

This paper updates a method for generating small, accurate kinetic models for applications in computational fluid dynamics programs. This particular method first uses a time-integrated flux-based algorithm to generate the smallest possible skeletal model based on the detailed kinetic model. Then, it uses a multi-stage optimization process in which multiple runs of a genetic algorithm are used to optimize the rate constant parameters of the retained reactions. This optimization technique provides the user with the flexibility needed to balance the fidelity of the model with their time constraints. The updated method was applied to the reduction of a methane-air model under conditions meant to approximate the end of a compression stroke of an internal combustion engine. When compared to previous techniques, the results showed that this method could produce a more accurate model in considerably less time. The best model obtained in this study resulted in relative errors ranging from 0.22 to 1.14% on all six optimization targets. This reduced model was also able to adequately predict optimization targets for certain operating conditions, which were not included in the optimization process.

     

Resource provisioning for cloud applications: a 3-D,provident and flexible approach

The scalability feature of cloud computing attracts application service providers (ASPs) to use cloud application hosting. In cloud environments, resources can be dynamically provisioned on demand for ASPs. Autonomic resource provisioning for the purpose of preventing resources over-provisioning or under-provisioning is a widely investigated topic in cloud environments. There has been proposed a lot of resource-aware and/or service-level agreement (SLA)-aware solutions to handle this problem. However, intelligence solutions such as exploring the hidden knowledge on the Web users’ behavior are more effective in cost efficiency. Most importantly, with considering cloud service diversity, solutions should be flexible and customizable to fulfill ASPs’ requirements. Therefore, lack of a flexible resource provisioning mechanism is strongly felt. In this paper, we proposed an autonomic resource provisioning mechanism with resource-aware, SLA-aware, and user behavior-aware features, which is called three-dimensional mechanism. The proposed mechanism used radial basis function neural network in order to provide providence and flexibility features. The experimental results showed that the proposed mechanism reduces the cost while guarantees the quality of service.     

Some novel applications of a continuous system simulation language

The primary application of a continuous system simulation language involves simulation of dynamic systems described by a set of coupled nonlinear differential (or difference) equations. The built in integration capability in addition to a predefined library of macro operators makes them particularly attractive for a wide range of computationally intensive applications independent of dynamic systems analysis. The purpose of this study is to demonstrate the use of a block oriented continuous simulation language to implement solutions of problems in the field of applied math.     

A metalogic programming approach: language,semantics and applications

Abstract

This paper presents a logic programming language of novel conception, called Reflective Prolog, which allows declarative metaknowledge representation and metareasoning. The language is defined by augmenting pure Prolog (Horn clauses) with capabilities of self-reference and logical reflection. Self-reference is designed as a quotation device (a carefully defined naming relation) which allows the construction of metalevel terms that refer to object-level terms and atoms. Logical reflection is designed as an unquotation mechanism (a distinguished truth predicate) which relates names to what is named, thus extending the meaning of domain predicates. The reflection mechanism is embodied in an extended resolution procedure which automatically switches the context between levels. This implicit reflection relieves the programmer from having to explicitly deal with control aspects of the inference process. The declarative semantics of a Reflective Prolog definite program P is provided in terms of the least reflective Herbrand model of P, characterized by means of a suitable mapping defined over the Herbrand interpretations of P. The extended resolution is proved sound and complete with respect to the least reflective Herbrand model. By illustrating Reflective Prolog solutions to an organic set of problems, and by discussing the main differences with respect to other approaches to logic metaprogramming, we show that the proposed language deploys, within its field of action, greater expressive and inferential power than those available till now. The interpreter of the language has been fully implemented. Because of its enhanced power, logic semantics and working interpreter, Reflective Prolog is offered as a contribution toward making the declarative approach of logic programming applicable to the development of increasingly sophisticated knowledge-based systems.     

Nonlinear state estimation for suspension control applications: a Takagi-Sugeno Kalman filtering approach

A new nonlinear state estimation approach, which combines classical Kalman filter theory and Takagi-Sugeno (TS) modeling, is proposed in this paper. To ensure convergence of the TS observer, conditions are derived that explicitly account for the TS model's confined region of validity. Thereby, the secured domain of attraction (DA) of the TS error dynamics is maximized within given bounds. The TS Kalman filtering concept is then applied to a hybrid vehicle suspension configuration, whose nonlinear dynamics are exactly represented by a continuous-time TS system. The benefit of the novel estimation technique is analyzed in comparison with the well-known EKF and UKF variants in simulations and experiments of a passive and an actively controlled suspension configuration in a quarter-car set-up. Employing a real road profile as disturbance input, the TS Kalman filter shows the highest estimation quality of the concepts studied. Moreover, as its computational complexity adds up to only one third of the one involved with the classical methods, the new approach operates remarkably efficient.     

From objects to services: toward a stepwise migration approach for Java applications

Migrating legacy applications toward service-oriented systems is a hard task complicated by the lack of appropriate approaches and tools. In this paper, a stepwise approach is proposed to migrate a Java application into an equivalent application composed of a set of Web services invoked by an orchestrator. In each migration step, a portion of the target application is identified and migrated into a Web service. In this approach, the role of testing is central since after each migration step the new service-oriented application is tested with the aim of checking “its equivalence” with the original version. An experiment based on four Java applications has been conducted to tune the approach and evaluate applicability and effort involved in the migration process. The obtained results confirm the viability of the proposed approach and highlight some encountered SOA migration difficulties.     

II. Supporting models and applications

Baaed on TOC (Task Operating Characteristic) and ROC (Resource Operating Characteristic) curves (Braswell 1971), P(t) and R(t), a family of feasible curves are experimentally selected with parameter specifications for a and S. Additional models are developed for activity progress and resource utilization monitoring and control. A resource allocation method is developed and a Best 1'ath (JJP) strategy is presented to reprogramme progress of assignments and rates of resource expending. Task Progress (TP) and Rosource Depletion (RD) models are developed. Examples, and figures illustrate applications.     

Fuzzy subgroups: Some characterizations. II

We consider an analysis of fuzzy subgroups in terms of the corresponding family of level subgroups. Given a finite chain of subgroups of a group G, we prove that there exists a fuzzy subgroup of G whose level subgroups are exactly the subgroups of this chain. As a corollary we obtain an interpretation of the number of chains of subgroups of a group G in which a subgroup H is a member. When the group G is a supersolvable group, some further interpretation of this number is obtained.     

GUIDE: an interactive and incremental approach for crawling Web applications

The Journal of Supercomputing - The Internet, having a sea of Web applications, is one of the largest data stores for big data analysis. To explore and retrieve the states (pages) from Web...     

Location-based IoT applications on campus: The IoTtalk approach

The National Chiao Tung University is deploying several location-based IoT applications on campus based on an IoT device management platform called IoTtalk. The applications include dog tracking, emergency buttons, and indoor/outdoor environment conditions monitoring (PM2.5, temperature, CO₂, and so on). Some of the IoT devices for these applications have simple hardware structures to save energy, and therefore are not equipped with the positioning sensors (e.g., GPS or iBeacon). To support mobility management for these simple IoT devices, we develop a location finding mechanism in IoTtalk. By introducing the locator device in IoTtalk, we can effectively support mobility management for simple IoT devices that does not have location positioning capability. We describe how to develop the device applications to accommodate the location update feature, and show how to configure the location finding mechanism through the IoTtalk GUI. Then we conduct analytic analysis and simulation to investigate the accuracy of location tracking and power consumption for the dog tracking application.