نتایج جستجو برای: matching process

تعداد نتایج: 1399144  

Journal: Iranian Economic Review 2005

In this paper various ARCH models and relevant news impact curves including a partially nonparametric (PNP) one are compared and estimated with daily Iran stock return data. Diagnostic tests imply the asymmetry of the volatility response to news. The EGARCH model, which passes all the tests and appears relatively matching with the asymmetry in the data, seems to be the most adequate characteriz...

2006
René Fahr Uwe Sunde IZA Bonn

Did the Hartz Reforms Speed-Up Job Creation? A Macro-Evaluation Using Empirical Matching Functions Starting in January 2003, Germany implemented the first two so-called Hartz reforms, followed by the third and fourth packages of Hartz reforms in January 2004 and January 2005, respectively. The aim of these reforms was to accelerate labor market flows and reduce unemployment duration. Without at...

2013
DanFeng WU GuangPing ZENG JingYing YAN

In this paper, we focus on the optimization of the Rete algorithm on aspects of memory consumption and time-consuming in matching process. Facing the problem of requirement of limited memory and quick response from users in the rule pattern matching process of dynamic evolution of software system,on the basis of the classic Rete algorithm and from the perspective of the complexity of algorithm ...

2005
Daniela Grigori Verónika Peralta Mokrane Bouzeghoub

The capability to easily find useful services becomes increasingly critical in several fields. In this paper we argue that, in many situations, the service discovery process should be based on both behavior specification (that is the process model which describes each composite service) and quality features of services. The idea behind is to develop matching techniques that operate on process m...

2005
Rocco De Nicola Daniele Gorla Rosario Pugliese

In this paper, we present recent work carried on μK, a core calculus that retains most of the features of K: explicit process distribution, remote operations, process mobility and asynchronous communication via distributed tuple spaces. Communication in μK is based on a simple form of pattern matching that enables withdrawal from shared data spaces of matching tuples and binds the m...

2015
K. R. Uthayan G. S. Anandha Mala

Ontology is the process of growth and elucidation of concepts of an information domain being common for a group of users. Establishing ontology into information retrieval is a normal method to develop searching effects of relevant information users require. Keywords matching process with historical or information domain is significant in recent calculations for assisting the best match for spec...

Journal: :CoRR 2010
Chow Kok Kent Naomie Salim

As the Internet help us cross cultural border by providing different information, plagiarism issue is bound to arise. As a result, plagiarism detection becomes more demanding in overcoming this issue. Different plagiarism detection tools have been developed based on various detection techniques. Nowadays, fingerprint matching technique plays an important role in those detection tools. However, ...

2012
Djelloul Bouchiha Mimoun Malki

Web services are the latest attempt to revolutionize large scale distributed computing. They are based on standards which operate at the syntactic level and lack semantic representation capabilities. Semantics provide better qualitative and scalable solutions to the areas of service interoperation, service discovery, service composition, and process orchestration. SAWSDL defines a mechanism to ...

In this paper, a new voltage controlled first order all-pass filter is presented. The proposed circuit employs a single differential voltage dual-X second generation current conveyor (DV-DXCCII) and a grounded capacitor only. The proposed all-pass filter provides both inverting and non inverting voltage-mode outputs from the same configuration simultaneously without any matching condition. Non-...

1997
Mark L. Williams Richard C. Wilson Edwin R. Hancock

This paper describes the development of a Bayesian framework for multiple graph matching. The study is motivated by the plethora of multi-sensor fusion problems which can be abstracted as multiple graph matching tasks. The study uses as its starting point the Bayesian consistency measure recently developed by Wilson and Hancock. Hitherto , the consistency measure has been used exclusively in th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید