Judgmental subtyping systems with intersection types and modal types

We study how to extend modal type systems based on intuitionistic modal logic S4 or S5 with a subtyping system based on intersection types. In the presence of four type constructors ${\!}\!\rightarrow \!{\!},\,{\!}\wedge {\!},\,\square {}$ , and $\Diamond {}$ , the traditional approach using a binary subtyping relation does not work well because of lack of orthogonality in subtyping rules and presence of a transitivity rule. We adopt the idea from the judgmental formulation of modal logic (Pfenning and Davies in Math Struct Comput Sci 11(4):511–540, 2001) and use subtyping judgments whose definitions express those notions internalized into type constructors directly at the level of judgments. The resultant judgmental subtyping systems admit cut rules similarly to a sequent calculus for intuitionistic logic and play a key role in designing and verifying the relational subtyping systems based on the binary subtyping relation. We use the proof assistant Coq to prove the admissibility of the cut rules and the equivalence between the two kinds of subtyping systems. The lesson from our study is that by using subtyping judgments instead of the binary subtyping relation, we can overcome the limitation usually associated with the syntactic approach to formulating subtyping systems.     

Robust and reliable H infinity controllers for discrete-time systems with parameter uncertainty and actuator failure

New robust and reliable H infinity control algorithms are suggested for discrete-time uncertain systems with time-varying norm-bounded parameter uncertainty in the state matrix as well as with actuator failure among a pre-specified subset of actuators. State feedback controllers can be obtained by deriving and solving modified parameter-dependent Riccati equations, which can stabilize the plant and guarantee a given H infinity-norm bound on attenuation of augmented disturbances - all admissible uncertainties as well as actuator failure. Two robust and reliable H infinity whether the process of fault accommodation is used or not. Performances of two controllers are evaluated through simulation studies for various failures. controllers are derived according to     

Landmark transfer with minimal graph

We present an efficient and robust algorithm for the landmark transfer on 3D meshes that are approximately isometric. Given one or more custom landmarks placed by the user on a source mesh, our method efficiently computes corresponding landmarks on a family of target meshes. The technique is useful when a user is interested in characterization and reuse of application-specific landmarks on meshes of similar shape (for example, meshes coming from the same class of objects). Consequently, across a set of multiple meshes consistency is assured among landmarks, regardless of landmark geometric distinctiveness. The main advantage of our method over existing approaches is its low computation time. Differently from existing non-rigid registration techniques, our method detects and uses a minimum number of geometric features that are necessary to accurately locate the user-defined landmarks and avoids performing unnecessary full registration. In addition, unlike previous techniques that assume strict consistency with respect to geodesic distances, we adopt histograms of geodesic distance to define feature point coordinates, in order to handle the deviation of isometric deformation. This allows us to accurately locate the landmarks with only a small number of feature points in proximity, from which we build what we call a minimal graph. We demonstrate and evaluate the quality of transfer by our algorithm on a number of Tosca data sets.     

Providing security vertical handoff in SARAH for heterogeneous networks

Vertical handoff is one of the most important issues in the heterogeneous networks. While Lee et al. introduced a selective advance reservations and resource-aware handoff direction (SARAH) mechanism in order to provide a fast and efficient handoff with combination of layer 2 (L2) and layer 3 (L3) communications, there was a drawback that there was no consideration of handoff between heterogeneous network. In this paper, we improve the mechanism by providing security functions such as the neighbor-mapping server that binds IP address and MAC address with security support. At first, we discuss security issues in SARAH and proposed enhanced protocol. Finally, we show simple implementation results of our design in order to verify the practical aspects of our design.     

Fast high-quality volume ray-casting with virtual samplings

Volume ray-casting with a higher order reconstruction filter and/or a higher sampling rate has been adopted in direct volume rendering frameworks to provide a smooth reconstruction of the volume scalar and/or to reduce artifacts when the combined frequency of the volume and transfer function is high. While it enables high-quality volume rendering, it cannot support interactive rendering due to its high computational cost. In this paper, we propose a fast high-quality volume ray-casting algorithm which effectively increases the sampling rate. While a ray traverses the volume, intensity values are uniformly reconstructed using a high-order convolution filter. Additional samplings, referred to as virtual samplings, are carried out within a ray segment from a cubic spline curve interpolating those uniformly reconstructed intensities. These virtual samplings are performed by evaluating the polynomial function of the cubic spline curve via simple arithmetic operations. The min max blocks are refined accordingly for accurate empty space skipping in the proposed method. Experimental results demonstrate that the proposed algorithm, also exploiting fast cubic texture filtering supported by programmable GPUs, offers renderings as good as a conventional ray-casting algorithm using high-order reconstruction filtering at the same sampling rate, while delivering 2.5x to 3.3x rendering speed-up.     

A directionally transparent energy bounding approach for multiple degree-of-freedom haptic interaction

This paper presents a multiple degree-of-freedom (DOF) energy bounding approach (EBA) for enhancing directional transparency while concurrently guaranteeing stability during multi-DOF haptic interactions. It was observed that the passivity condition for multiple ports may lead to oscillatory limit cycle behavior in some coordinate directions even though the total sum of energy flow-in is positive, meaning that the system is passive. The passivity condition, therefore, needs to be applied to each coordinate in order to avoid oscillatory behavior by ensuring that each energy flow-in is always positive. The EBA is applied to guarantee passivity. For multi-DOF haptic interaction, however, the EBA in each coordinate may distort the direction of the rendered force vector since the EBA may reduce the magnitude of the rendered force and torque vectors. To resolve this problem, a simple projection method is subsequently proposed. The validity of the proposed algorithm is then experimentally confirmed, and a comparative study with previous research is presented.     

High-payload climbing and transitioning by compliant locomotion with magnetic adhesion

This paper presents a new climbing robotic mechanism for high-payload climbing and wall-to-wall transitioning. Payload capacity and transition ability are very important in climbing-robot applications for heavy industries and construction industries. The proposed robotic platform consists of three magnetic tread-wheel modules that are connected by links with two compliant joints. The front compliant joints are passive type with a torsion spring, and the rear compliant joints are active type with torque-controlled motors. A torque-controlled tail is attached at the end of the third module. Various transitions are achieved by the compliant joints, which change shape depending on the external conditions. High payloads are achieved by the large contact area of three magnetic tread-wheel modules. Detailed design issues are presented with analyses of the design parameters. The robot can perform two internal and two external transitions against gravity and every possible transition in the side surface driving direction. The robot can carry 10 kg payloads on vertical surfaces and on a ceiling. The ability to overcome a 30 mm diameter obstacle on vertical surfaces is also verified by experiments. The proposed robotic platform is going to be used in heavy industries.     

FSH scheme for high-speed handover and anti-MITM on mobile computing

As an IEEE 802.11-based mobile computing system has been established as the base structure of high-speed wireless network, interest in mobility and security of mobile terminal has increased. To reinforce security, 802.1x and 802.11i using EAP were used in standardized instrument. But it was found to be unsuitable for real time multimedia service because of the time delay. In this paper, we suggest Fast and Secure Handover (FSH) scheme which minimizes time delay in handover authentication process and prevents MITM (Man in the Middle) attack. This scheme carries out re-association process which is necessary for high-speed handover using Inter Access Point Protocol (IAPP) and Old_MSK. To make existing 802.1x-based user certification procedure suitable for high-speed handover, the terminal and pre-handover-accessed Old_AP make Rough_AP to prevent MITM. To do this, Old_AP uses the Old_MSK-used encrypted method which was used to encrypt MAC information of the mobile terminal and Old_AP. Hereby, FSH has been developed to become high-speed handover which has the 802.1x-supported security level and the skill of preventing MITM. In this paper, by simulation (NS-2), we confirmed the superiority in streaming service such as decreased handover time delay and VoIP.     

Effectiveness Analysis of DVFS and DPM in Mobile Devices

The demand for high-performance embedded processors in multimedia mobile electronics is growing and their power consumption thus increasingly threatens battery lifetime.It is usually believed that the dynamic voltage and frequency scaling (DVFS) feature saves significant energy by changing the performance levels of processors to match the performance demands of applications on the fly.However,because the energy efficiency of embedded processors is rapidly improving,the effectiveness of DVFS is expected to change.In this paper,we analyze the benefit of DVFS in state-of-the-art mobile embedded platforms in comparison to those in servers or PCs.To obtain a clearer view of the relationship between power and performance,we develop a measurement methodology that can synchronize time series for power consumption with those for processor utilization.The results show that DVFS hardly improves the energy efficiency of mobile multimedia electronics,and can even significantly worsen energy efficiency and performance in some cases.According to this observation,we suggest that power management for mobile electronics should concentrate on adaptive and intelligent power management for peripheral devices.As a preliminary design,we implement an adaptive network interface card (NIC) speed control that reduces power consumption by 10% when NIC is not heavily used.Our results provide valuable insights into the design of power management schemes for future mobile embedded systems.     

Polynomial Fuzzy Observer Designs: A Sum-of-Squares Approach

This paper presents a sum-of-squares (SOS) approach to polynomial fuzzy observer designs for three classes of polynomial fuzzy systems. The proposed SOS-based framework provides a number of innovations and improvements over the existing linear matrix inequality (LMI)-based approaches to Takagi-Sugeno (T-S) fuzzy controller and observer designs. First, we briefly summarize previous results with respect to a polynomial fuzzy system that is a more general representation of the well-known T-S fuzzy system. Next, we propose polynomial fuzzy observers to estimate states in three classes of polynomial fuzzy systems and derive SOS conditions to design polynomial fuzzy controllers and observers. A remarkable feature of the SOS design conditions for the first two classes (Classes I and II) is that they realize the so-called separation principle, i.e., the polynomial fuzzy controller and observer for each class can be separately designed without lack of guaranteeing the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. Although, for the last class (Class III), the separation principle does not hold, we propose an algorithm to design polynomial fuzzy controller and observer satisfying the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. All the design conditions in the proposed approach can be represented in terms of SOS and are symbolically and numerically solved via the recently developed SOSTOOLS and a semidefinite-program solver, respectively. To illustrate the validity and applicability of the proposed approach, three design examples are provided. The examples demonstrate the advantages of the SOS-based approaches for the existing LMI approaches to T-S fuzzy observer designs.