Fast solution of large N×N matrix equations in an MIMD–SIMD Hybrid System

In this paper, we propose a new high-speed computation algorithm for solving a large N×N matrix system using the MIMD–SIMD Hybrid System. The MIMD–SIMD Hybrid System (also denoted as Hybrid System in this paper) is a new parallel architecture consisting of a combination of Cluster of Workstations (COWs) and SIMD systems working concurrently to produce an optimal parallel computation. We first introduce our prototype SIMD system and our Hybrid System setup before presenting how it can be implemented to find the unknowns in a large N×N linear matrix equation system using the Gauss–LU algorithm. This algorithm basically performs the ‘Divide and Conquer’ approach by breaking down the large N×N matrix system into a manageable 32 × 32 matrix for fast computation.     

Similarity measures of bipolar neutrosophic sets and their application to multiple criteria decision making

In this paper, we introduced some similarity measures for bipolar neutrosophic sets such as; Dice similarity measure, weighted Dice similarity measure, Hybrid vector similarity measure and weighted Hybrid vector similarity measure. Also we examine the propositions of the similarity measures. Furthermore, a multi-criteria decision-making method for bipolar neutrosophic set is developed based on these given similarity measures. Then, a practical example is shown to verify the feasibility of the new method. Finally, we compare the proposed method with the existing methods in order to demonstrate the practicality and effectiveness of the developed method in this paper.

     

A global security architecture for operated hybrid WLAN mesh networks

Hybrid Wireless Mesh Network (HWMN) is a new wireless networking paradigm. Unlike traditional wireless networks, in HWMNs, hosts may rely on each other to keep the network connected. Operators and wireless internet service providers are choosing HWMNs to offer Internet connectivity, as it allows fast, easy and affordable network deployments. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we investigate the main security issues focusing on the most vulnerable part of the hybrid WLAN mesh infrastructure which concerns the ad hoc network part. Through our proposed architecture, Security Architecture for Operator’s Hybrid WLAN Mesh Network (SATHAME), we identify the new challenges and opportunities posed by this emerging networking environment and explore approaches to secure users, data and communications. From the analysis of strengths and weaknesses of secured routing protocols, we designed a new robust routing structure called MacroGraph (MG). MG structure is extracted from the mesh ad hoc network for each communication to be established between a source and a destination. Especially, MG is a robust structure based on node-disjoint path routing scheme and dynamic trust management that can be adapted to respond to applications’ security requirements. We present a performance analysis of our efficient, robust and scalable multipath reactive secured routing protocol. We investigate the behavior of our proposed scheme under two attack scenarios: Packet Dropping and Route Error attacks in dense network configurations.     

Hybrid

Combining higher-order abstract syntax and (co)-induction in a logical framework is well known to be problematic. We describe the theory and the practice of a tool called Hybrid, within Isabelle/HOL and Coq, which aims to address many of these difficulties. It allows object logics to be represented using higher-order abstract syntax, and reasoned about using tactical theorem proving and principles of (co)induction. Moreover, it is definitional, which guarantees consistency within a classical type theory. The idea is to have a de Bruijn representation of λ-terms providing a definitional layer that allows the user to represent object languages using higher-order abstract syntax, while offering tools for reasoning about them at the higher level. In this paper we describe how to use Hybrid in a multi-level reasoning fashion, similar in spirit to other systems such as Twelf and Abella. By explicitly referencing provability in a middle layer called a specification logic, we solve the problem of reasoning by (co)induction in the presence of non-stratifiable hypothetical judgments, which allow very elegant and succinct specifications of object logic inference rules. We first demonstrate the method on a simple example, formally proving type soundness (subject reduction) for a fragment of a pure functional language, using a minimal intuitionistic logic as the specification logic. We then prove an analogous result for a continuation-machine presentation of the operational semantics of the same language, encoded this time in an ordered linear logic that serves as the specification layer. This example demonstrates the ease with which we can incorporate new specification logics, and also illustrates a significantly more complex object logic whose encoding is elegantly expressed using features of the new specification logic.     

Model Checking for Hybrid Logic

We consider the model checking problem for Hybrid Logic. Known algorithms so far are global in the sense that they compute, inductively, in every step the set of all worlds of a Kripke structure that satisfy a subformula of the input. Hence, they always exploit the entire structure. Local model checking tries to avoid this by only traversing necessary parts of the input in order to establish or refute the satisfaction relation between a given world and a formula. We present a framework for local model checking of Hybrid Logic based on games. We show that these games are simple reachability games for ordinary Hybrid Logic and weak Büchi games for Hybrid Logic with operators interpreted over the transitive closure of the accessibility relation of the underlying Kripke frame, and show how to solve these games thus solving the local model checking problem. Since the first-order part of Hybrid Logic is inherently hard to localise in model checking, we give examples, in the end, of how global model checkers can be optimised in certain special cases using well-established techniques like fixpoint approximations and divide-and-conquer algorithms.     

An algebra of hybrid systems

Hybrid systems are heterogeneous systems characterised by the interaction of discrete and continuous dynamics. We present a trajectory-based algebraic model for describing hybrid systems; the trajectories used are closely related to streams. The algebra is based on left quantales and left semirings and provides a new application for these algebraic structures. We show that hybrid automata, which are probably the standard tool for describing hybrid systems, can conveniently be embedded into our algebra. Moreover we point out some important advantages of the algebraic approach. In particular, we show how to handle Zeno effects, which are excluded by most other authors. The development of the theory is illustrated by a running example and a larger case study.     

Decidability results in First–Order Hybrid Petri Nets

In this paper we tackle the decidabilityof marking reachability for a hybrid formalism based on Petrinets. The model we consider is the untimed version of First–OrderHybrid Petri Nets: it combines a discrete Petri net and a continuousPetri net, the latter being a fluid version of a usual discretePetri net. It is suggested that the decidability results shouldbe pursued exploiting a hierarchy of models as it has been donein the framework of Hybrid Automata. In this paper we definethe class of Single–Rate Hybrid Petri Nets: the continuousdynamics of these nets is such that the vector of the markingderivatives of the continuous places is constant but for a scalarfactor. This class of nets can be seen as the counterpart oftimed automata with skewed clocks. We prove that the reachabilityproblem for this class can be reduced to the reachability problemof an equivalent discrete net and thus it is decidable.     

Hybrid chaos optimization and affine scaling search algorithm for solving linear programming problems

In this study, we addressed Single Objective Linear Programming (SOLP). This article proposed a new combination of Chaos Optimization Algorithm (COA) with Affine Scaling Search (AFS) to be used as a Hybrid COA and AFS algorithm (Chaos AFS) for solving SOLP. The potential of COA as an emerging optimization algorithm to improve efficiency and effectiveness of AFS is investigated. Chaos AFS method is so-called numerical search algorithm that searches through the domain of decision variables of SOLP to obtain final feasible solution. An initial solution point, obtained from COA, will be used as starting solution point in AFS algorithm to improve the performance of AFS algorithm. The result shows that Hybrid COA and AFS for solving SOLP problems significantly improves the results of objective value compared to pure AFS and reduces the number of iteration steps compared to simplex and pure AFS.     

A generalized taxonomy of explanations styles for traditional and social recommender systems

Recommender systems usually provide explanations of their recommendations to better help users to choose products, activities or even friends. Up until now, the type of an explanation style was considered in accordance to the recommender system that employed it. This relation was one-to-one, meaning that for each different recommender systems category, there was a different explanation style category. However, this kind of one-to-one correspondence can be considered as over-simplistic and non generalizable. In contrast, we consider three fundamental resources that can be used in an explanation: users, items and features and any combination of them. In this survey, we define (i) the Human style of explanation, which provides explanations based on similar users, (ii) the Item style of explanation, which is based on choices made by a user on similar items and (iii) the Feature style of explanation, which explains the recommendation based on item features rated by the user beforehand. By using any combination of the aforementioned styles we can also define the Hybrid style of explanation. We demonstrate how these styles are put into practice, by presenting recommender systems that employ them. Moreover, since there is inadequate research in the impact of social web in contemporary recommender systems and their explanation styles, we study new emerged social recommender systems i.e. Facebook Connect explanations (HuffPo, Netflix, etc.) and geo-social explanations that combine geographical with social data (Gowalla, Facebook Places, etc.). Finally, we summarize the results of three different user studies, to support that Hybrid is the most effective explanation style, since it incorporates all other styles.     

一种求解优化问题的新型混合遗传算法

论文在标准遗传算法中引入新的交叉运算和变异运算,针对优化问题提出了一类新型混合遗传算法。具体算例验证了算法的有效性和相对于标准遗传算法及某些混合遗传算法的优越性。     

Hybrid Quantum Cloning Machine

In this work, we introduce a special kind of quantum cloning machine called Hybrid quantum cloning machine. The introduced Hybrid quantum cloning machine or transformation is nothing but a combination of pre-existing quantum cloning transformations. In this sense it creates its own identity in the field of quantum cloners. Hybrid quantum cloning machine can be of two types: (i) State dependent and (ii) State independent or Universal. We study here the above two types of Hybrid quantum cloning machines. Later we will show that the state dependent hybrid quantum-cloning machine can be applied on only four input states. We will also find in this paper another asymmetric universal quantum cloning machine constructed from the combination of optimal universal B–H quantum cloning machine and universal anti-cloning machine. The fidelities of the two outputs are different and their values lie in the neighborhood of .      

从DTD映射到关系模式方法Hybrid Inlining的改进

XML正迅速成为互联网上数据表示和交抉的标准,用关系数据库存储XML数据是XML存储策略之一。为了将XML数据存储到关系数据库中,人们研究了很多从DTD到关系模式的映射方法。Hybrid Inlining方法是一种比较常用的映射方法,此方法将多个元素内联到一个表中,从而可以降低查询时连接操作的次数,但同时也存在一些诸如删除异常、插入异常的问题。本文将Hybria Inlining方法运用在从Schema到关系模式的转抉中,同时在Hybrid Inlining方法的基础上做进一步改进,从而解决删除、插入异常等问题。最后给出其具有无损连接性以及锨持函数依赖的证明。     

A hybrid mobile object tracker based on the modified Cuckoo Search algorithm and the Kalman Filter

Most revolutionary algorithms are inspired from the behavior of natural species. This inspiration can be drawn from their reproductive behavior, flying mode, or even their ways of communication. One of the most efficient metaheuristics in a discrete search space is the Cuckoo Search algorithm, inspired by the Cuckoo?s reproductive behavior and combined with the Lévy flight pattern adopted by many animals and insects. In this paper, we present a new tracking approach, the Hybrid Kalman Cuckoo Search tracker, using a modified version of the Cuckoo Search algorithm combined with the well-known Kalman Filter. The Cuckoo Search algorithm is combined with the prediction step adopted by the Kalman Filter to enhance the initial population?s quality. Using the Hybrid Kalman Cuckoo Search tracker, we can efficiently explore the search space in order to locate an object?s position from one frame to the next. The Lévy flight model is also modified in order to re-adapt the Lévy step size as the algorithm approaches the desired solution. The Hybrid Kalman Cuckoo Search tracker is tested on a variety of datasets including one where we incorporated different situations, as well as some videos from the CAVIAR, SPEVI, and other datasets. The comparative study results show that the proposed algorithm outperforms the Particle Swarm Optimization based tracker, especially in terms of computation time.     

Synthesis and Viability of Minimally Interventive Legal Controllers for Hybrid Systems

In this paper, we study the control of Composite Hybrid Machines (CHMs) subject to safety specifications. CHMs are a fairly general class of hybrid systems modeled in modular fashion as the concurrent operation of Elementary Hybrid Machines (EHMs). The formalism has a well-defined synchronous-composition operation that permits the introduction of the controller as a component of the system. The task of a legal (safety) controller is to ensure that the system never exits a set of specified legal configurations. Among the legal controllers, we are particularly interested in designing a minimally-interventive (or minimally-restrictive) one, which interferes in the system's operation only when constraint violation is otherwise inevitable. Thus, a minimally interventive safety controller provides maximum flexibility in embedding additional controllers designed for other control objectives to operate concurrently, while eliminating the need to re-investigate or re-verify the legality of the composite controller with respect to the safety specification. We describe in detail an algorithm for controller synthesis and examine the viability of a synthesized controller as related to the possibility of Zenoness, where the system can undergo an unbounded number of transitions in a bounded length of time.     

Modeling and simulation of cardiac tissue using hybrid I/O automata

We propose a new biological framework based on the Lynch et al. theory of Hybrid I/O Automata (HIOAs) for modeling and simulating excitable tissue. Within this framework, we view an excitable tissue as a composition of two main kinds of component: a diffusion medium and a collection of cells, both modeled as an HIOA. This approach yields a notion of decomposition that allows us to describe a tissue as the parallel composition of several interacting tissues, a property that could be exploited to parallelize, and hence improve, the efficiency of the simulation process.We also demonstrate the feasibility of our HIOA-based framework to capture and mimic different kinds of wave-propagation behavior in 2D isotropic cardiac tissue, including normal wave propagation along the tissue; the creation of spiral waves; the break-up of spiral waves into more complex patterns such as fibrillation; and the recovery of the tissue to the rest via electrical defibrillation.     

一种基于混合压缩感知的WSN能耗优化方法

网络节点能耗是影响无线传感器网络生命周期的重要因素。提出了一种基于混合压缩感知(Hybrid-CS)的网络能耗优化方法。首先,为保证数据重构精度,根据参加数据收集节点数的不同,确定合理的观测矩阵维数范围。然后,通过分析不同维数观测矩阵对Hybrid-CS发送数据量的影响,求出较优的观测矩阵维数,从而使所设计的方法达到降低网络能耗的目的。仿真结果表明,该方法在节约网络能耗的同时还保证了数据重构精度。     

Hybrid bio-inspired techniques for land cover feature extraction: A remote sensing perspective

Recent advances in the theoretical and practical implementations of biogeography have led to the exploration of new bio-inspired techniques which can prove to be the building blocks of hybrid bio-inspired techniques. This aspect was discovered while considering the exploration of bio-inspired intelligence for developing generic optimization algorithms that can be adapted for performing the given land cover feature extraction task at hand. Certain bio-inspired techniques when integrated with the existing optimization techniques can drastically improve their optimization capability hence leading to better feature extraction. In this paper, we propose a generic architectural framework of a hybrid biologically inspired technique that is characterized by its capability to adapt according to the database of expert knowledge for a more efficient, focused and refined feature extraction. Since our hybrid feature extractor possesses intelligence for selective cluster identification for application of either of the constituent techniques which is in turn based on an inefficiency analysis, we term our classifier as the hybrid bio-inspired pattern analysis based intelligent classifier. Our hybrid classifier combines the strengths of the modified BBO Technique for land cover feature extraction with the Hybrid ACO2/PSO Technique for a more refined land cover feature extraction. The algorithm has been tested for for the remote sensing application of land cover feature extraction where we have applied it to the 7-Band carto-set satellite image of size 472 × 546 of the Alwar area in Rajasthan and gives far better feature extraction results than the original biogeography based land cover feature extractor [20] and the other soft computing techniques such as ACO, Hybrid PSO-ACO2, Hybrid ACO-BBO Classifier, Fuzzy sets, Rough-Fuzzy Tie up etc.. The 7-band Alwar Image is a benchmark image for testing the performance of a bio-inspired classifier on multi-spectral satellite images since this image is a complete image in the sense that it contains all the land cover features that we need to extract and hence land cover feature extraction results are demonstrated and compared using this image as the standard image.     

Using hybrid scheduling for the semi-autonomous formation of expert teams

Selecting and scheduling human experts to cooperatively solve a problem can be a highly complex task, given various constraints (such as what expertise is needed and when) and preferences (such as which expertise an expert most prefers to exercise). Computational agents can thus greatly help users form and schedule expert teams. This paper introduces a new formulation of the team formation and scheduling problem as a Hybrid Scheduling Problem (HSP) and compares the performance of an agent using the HSP formulation to a prior agent-based approach. We empirically demonstrate the promise of the HSP formulation and highlight how the application of HSP techniques to this problem has led us to identify important modifications to mechanisms that improve HSP solving. Finally, we summarize how the HSP formulation can support human-agent collaboration during the process of forming and scheduling expert teams.     

A Virtual World Grammar for automatic generation of virtual worlds

Hybrid systems such as those that combine 3D virtual worlds and organization based multiagent systems add new visual and communication features for multiuser applications. The design of such hybrid and dynamic systems is a challenging task. In this paper, we propose a system that can automatically generate a 3D virtual world (VW) from an organization based multiagent system (MAS) specification that establishes the activities participants can engage on. Both shape grammar and virtual world paradigms inspired us to propose a Virtual World Grammar (VWG) to support the generation process of a virtual world design. A VWG includes semantic information about both MAS specification and shape grammar elements. This information, along with heuristics and validations, guides the VW generation producing functional designs. To support the definition and execution of a Virtual World Grammar, we have developed a so named Virtual World Builder Toolkit (VWBT). We illustrate this process by generating a 3D visualization of a virtual institution from its specification.     

A hybrid approach for movie recommendation

Collaborative and content-based filtering are the major methods in recommender systems that predict new items that users would find interesting. Each method has advantages and shortcomings of its own and is best applied in specific situations. Hybrid approaches use elements of both methods to improve performance and overcome shortcomings. In this paper, we propose a hybrid approach based on content-based and collaborative filtering, implemented in MoRe, a movie recommendation system. We also provide empirical comparison of the hybrid approach to the base methods of collaborative and content-based filtering and draw useful conclusions upon their performance.