Entity

Time filter

Source Type

West Jerusalem, Israel

Azrieli College of Engineering Jerusalem is an Israeli academic college that trains engineers. It is located in the Ramat Beit HaKerem neighborhood of Jerusalem, between Jerusalem's two major high-tech industrial areas, Har Hotzvim and the Jerusalem Technology Park. Wikipedia.


Albagli S.,Ben - Gurion University of the Negev | Albagli S.,Technion - Israel Institute of Technology | Ben-Eliyahu-Zohary R.,Jerusalem College of Engineering | Shimony S.E.,Ben - Gurion University of the Negev
Journal of Computer and System Sciences | Year: 2012

Ontology matching is a vital step whenever there is a need to integrate and reason about overlapping domains of knowledge. Systems that automate this task are of a great need. iMatch is a probabilistic scheme for ontology matching based on Markov networks, which has several advantages over other probabilistic schemes. First, it handles the high computational complexity by doing approximate reasoning, rather then by ad-hoc pruning. Second, the probabilities that it uses are learned from matched data. Finally, iMatch naturally supports interactive semi-automatic matches. Experiments using the standard benchmark tests that compare our approach with the most promising existing systems show that iMatch is one of the top performers. © 2011 Elsevier Inc. All rights reserved. Source


Rosenfeld A.,Jerusalem College of Engineering | Kraus S.,Bar - Ilan University
Autonomous Agents and Multi-Agent Systems | Year: 2012

Creating agents that realistically simulate and interact with people is an important problem. In this paper we present strong empirical evidence that such agents should be based on bounded rationality, and specifically on key elements from Aspiration Adaptation Theory (AAT). First, we analyzed the strategies people described they would use to solve two relatively basic optimization problems involving one and two parameters. Second, we studied the agents a different group of people wrote to solve these same problems. We then studied two realistic negotiation problems involving five and six parameters. Again, first we studied the negotiation strategies people used when interacting with other people. Then we studied two state of the art automated negotiation agents and negotiation sessions between these agents and people. We found that in both the optimizing and negotiation problems the overwhelming majority of automated agents and people used key elements from AAT, even when optimal solutions, machine learning techniques for solving multiple parameters, or bounded techniques other than AAT could have been implemented. We discuss the implications of our findings including suggestions for designing more effective agents for game and simulation environments. © 2010 The Author(s). Source


Yu T.,Memorial University of Newfoundland | Ben-Av R.,Jerusalem College of Engineering
Quantum Information Processing | Year: 2013

In game theory, an Evolutionarily Stable Set (ES set) is a set of Nash Equilibrium (NE) strategies that give the same payoffs. Similar to an Evolutionarily Stable Strategy (ES strategy), an ES set is also a strict NE. This work investigates the evolutionary stability of classical and quantum strategies in the quantum penny flip games. In particular, we developed an evolutionary game theory model to conduct a series of simulations where a population of mixed classical strategies from the ES set of the game were invaded by quantum strategies. We found that when only one of the two players' mixed classical strategies were invaded, the results were different. In one case, due to the interference phenomenon of superposition, quantum strategies provided more payoff, hence successfully replaced the mixed classical strategies in the ES set. In the other case, the mixed classical strategies were able to sustain the invasion of quantum strategies and remained in the ES set. Moreover, when both players' mixed classical strategies were invaded by quantum strategies, a new quantum ES set was emerged. The strategies in the quantum ES set give both players payoff 0, which is the same as the payoff of the strategies in the mixed classical ES set of this game. © Springer Science+Business Media New York 2012. Source


Exman I.,Jerusalem College of Engineering
Communications in Computer and Information Science | Year: 2013

UML statecharts are a widely accepted standard for modeling software behavior. But, despite the increasing importance of semantics for software behavior, semantics has been treated within UML as mere reasoning add-ons. We propose fully integration of UML statecharts with behavioral knowledge obtained from novel behavioral ontologies into a Unified Software-Knowledge model. These unified models have two important characteristics: first, misbehaviors are explicitly represented; second, behavioral ontologies generate graphs isomorphic to UML statecharts, by construction. This approach is applicable to run time measurements, to check the actual software behavior correctness and efficiency. Measurement discrepancies may trigger knowledge discovery mechanisms to update the unified models. The approach is illustrated with statechart examples from the domain of GOF software design patterns. © Springer-Verlag Berlin Heidelberg 2013. Source


Exman I.,Jerusalem College of Engineering
Communications in Computer and Information Science | Year: 2013

Modularity is essential to obtain well-composed software systems from COTS (Commercial Off-The-Shelf) components. But COTS components do not necessarily match the modules of the designed software system. A clear-cut procedure is needed for the choice of the necessary and sufficient components providing the required functionalities. Linear Software Models are rigorous theoretical standards of modularity. These models are proposed as formal criteria for well-composed software systems. The paper lays down theoretical foundations - upon linear independence and reducible matrix concepts - providing precise meanings to familiar software concepts, such as coupling and the single responsibility theorem. The theory uses a Modularity Matrix - linking linearly independent software structors to composable software functionals. The theory has been tested by applying it to small canonical systems and to large software systems found in the literature. © Springer-Verlag Berlin Heidelberg 2013. Source

Discover hidden collaborations