A number of radar models exist at present. They corre- spond to different types of radars or are developed with spe- cific radar applications in consideration. One popular method of modeling radars is by Markovian processes. Visnevski et al  use a generalized semi-Markov process to model the emitter of a multi-function radar in application to electronic warfare. Watson and Blair  employ a Markov chain to mix state estimates from multiple models in their Interacting Multiple Model (IMM) algorithm. Ghosh et al  attempt to provide an integrated framework to optimize Quality of Service (QoS) and perform dynamic scheduling for radar systems with multiple resource constraints. A real-time dwell scheduling algorithm for a multifunction phased array radar using scheduling gain is presented by Ting et al . It uses a combination of heuristics and scheduling gain. All of these papers consider a single radar unit capable of performing multiple functions simultaneously. In previous work , a method of building Dynamic FiniteStateMachines and solving the optimal policy using a Dynamic Programming method was presented.
The paper demonstrates how a combination of ID-based encryption with biometrics can be effective and more suited to e-Government environments. Moreover, the new biometric- identity-based scheme can be integrated into e-Government systems as the main authentication method and for secure communication as well. The proposed scheme is aimed to initiate secure authentication and communication between the client and server by building a robust mechanism between communicating government parties. The presented protocol is described as a three-way handshake procedure to establish a reliable connection and ensure secure data sharing. Moreover, we have simulated and validated the behaviour of the proposed protocol by using finite-statemachines and Petri nets.
This work modelled different economic evolutions due to different political decisions, supported by the application of a FiniteStateMachines (FSM). In fact, political decisions are focused on maintaining popularity first, and insuring high economic value second. We demonstrated that the economy’s evolution may not always follow the best long-term result, being merely centered on periodic election cycles – this being, the key question that society must place as a whole is how to ensure that economic plans are made on the long-term while maintaining the democratic degree of freedom – this or a similar tool must be used by future decision-makers in order to ensure the best long-term decisions and results. In future works, a Markov mode (a stochastic model used to model randomly changing systems where it is assumed that future states depend only on the current state not on the events that occurred before it) will be assumed in order to account for uncertainty.
After the mapping of VMs to hosts, it is necessary to start the virtual machines in the selected hosts. This task is carried out by the AEF’s Deployer module (Figure 4.8). It receives the abstract representation of the virtual environment generated by the Mapper module and uses this information to trigger the process of creation of VMs, with the conﬁguration speciﬁed by the user, in the hosts. To make this module as independent as possible from speciﬁc deployment tools, and at same time to allow selection of the deployment tools to be used, the Deployer is composed of two components: the Converter and the Actor. The ﬁrst one is part of AEF and translates the internal representation of the distributed system, received from the Mapper, to the language of the speciﬁc Actor in use. The internal representation contains the machine speciﬁcations: name, amount of memory, relative amount of CPU, disk image to be loaded, and MAC address (required to allow IP conﬁguration though a virtual DHCP server that is part of the services oﬀered by the Network Manager module, as explained in the next section).
Kapodistria  studies a single server Markovian queue with impatient customers and considers the situations where customers abandon the system simultaneously. He considers two abandonment scenarios. In the ﬁrst one, all present customers become impatient and perform synchronized abandonments; while in the second scenario, the customer in service is excluded from the abandonment procedure. He extends this analysis to the M/M/c queue under the second abandonment scenario also. Kumar  investigates a correlated queuing problem with catastrophic and restorative effects with impatient customers which have special applications in agile broadband communication networks. Kumar and Sharma  apply M/M/1/N queuing model for modeling supply chain situations facing customer impatience. Queuing models where potential customers are discouraged by queue length are studied by many researchers in their research work. Natvig  studies the single server birth-death queuing process with state dependent parameters 1 , 0 , 1
Model checking technique has some different variations. Temporal logic model checking  represent the system as finitestate transition graph and a temporal logic  is used to specify properties about the system. Efficient algorithms search the state space to check if the model satisfies the properties. In automata approach, the system and the properties are represented as automata. Then, the system is compared to the properties to determine if they hold to the system. This comparison is accomplished by techniques such as language inclusion, refinement order- ings, and observational equivalence . Another approach is integer linear programming . The system and the properties are modeled as a linear inequality system. The inequalities rep- resent the necessary conditions for an execution of the system such that violates the properties. The inequality system is applied to an ILP method. If an integral solution is found then the nec- essary conditions for the violation of the properties hold. Hence, the system does not model the properties.
If inference from positive samples only is prefered, then further restrictions to the form of transition functions of finite transducers must be set. When comparing the concepts of deterministic finite transducers and almost ter- minal-fixed even linear grammars, we notice that although the underlying ideas are quite the same, the concepts do not match. Hence, in order to apply Theorems 3 and 4, we must modify the concept of deterministic finite transducers. We say that a length-preserving finite transducer is state-deterministic, if
well as in other aquifer systems, for real-time monitoring of hydraulic heads, water temperature and electric conductivity in pilot areas in order to analyse the reliability associated with the present and future schemes of long-term groundwater monitoring at the regional scale. Apart from this, regional finite element flow models were developed in the context of the referred project as well as in the context of past investigations carried out by the project’s investigation team to study the regional pattern of groundwater flow in Algarve.
As seen above, U and V are known from the steady-state solution. The simulated physical situation corresponds to the steady flow of a fluid through the cavity that suddenly becomes colored and starts to displace the colorless one. Obviously, if the physical property remains the same, so do the velocity and the pressure fields. For a given volume, F is equal to 0 when the volume has no colored fluid, but it is equal to 1 when the volume is completely filled with colored fluid. The interface has F values between 0 and 1.
The problem of cracked FG cylinders has also been analytically and numerically studied by few researchers. For example, Afsar and Anisuzzaman (Afsar & Anisuzzaman 2007) considered the problem of thick-walled pressurized FG cylinders with two diametrically-opposed edge cracks. They modeled the FG cylinder with an equivalent homogeneous cylinder with induced thermal strains as a result of cooling from sintering temperature and internal pressure. In another work, Afsar et al. (Afsar et al. 2009) identified the optimum material distribution for a thick-walled FG cylinder with two diametrically opposed internal cracks in order to obtain desired fracture characteristics. Nami and Eskandari (Nami & Eskandari 2012a; Nami & Eskandari 2012b) used three-dimensional finite element (FE) modeling to derive SIFs for FG cylinders with semi-elliptical circumferential surface cracks subject to thermal and mechanical loadings. They showed that the crack geometry and the material gradation have considerable effect on the SIF distribution in front of the crack.
In mining machines collision of cooperating machine components, which move against each other as well as required operational ranges, which result from kinematic relationships, are analyzed. Criterial models, which include only external geometrical features, are sufficient for such analyses. They can also include geometrical models of deformed structures. Functional tests of virtual prototype were carried out at KOMAG for the longwall system. Longwall shearer moves along entire longwall panel, changing direction at face ends, at drive end and return end of Armoured Face Conveyor (AFC). Position of drive end and return end requires using of so-called narrow shearer arms, which enable cutting of coal in the area of face ends. Operation of passing the arm and return end is critical, Fig. 2.
We have calculated the availability by assuming the subsystem cutter and die fail simultaneously .In this assumptions the subsystem extruder comes out as the sensitive subsystem,in fact ,these assumptions are provided by industry itself. Therefore , a more criticl analysis of this industry can further be carried out by assuming other subsystem being in failed state simultaneously and independently .
Abstract: This essay proposes to outline an assemblage of works of art that are related to the machines of Brazil: the colonialist world machine (Vera Cruz, Rosângela Rennó and Os Lusíadas, Luís de Camões); the mining world machine (A máquina do mundo, Carlos Drummond de Andrade); the control machine of Google Maps (Nunca é noite no mapa, Ernesto Carvalho); the Great Machine of the contemporary capitalism (Break S/A, Marcelo Pedroso and Arabia, Affonso Uchoa and João Dumans); the coup machine of the media (Lígia, Nuno Ramos) and the judiciary (O processo, Maria Augusta Ramos); and the re-existance in the machine (Action Lekking, Negro Leo). Our goal is not to analyse in thoroughness the works, but to draw a panorama of how art brings about, interprets and resists to the different machines of Brazil. One of the pivotal matters that has guided our text is the way art relates to itself and interferes aesthetically in the heat of the moment to the politics and history of our country. When we do not talk about contemporary works, we try to extract from works of the past such as Camões, Drummond and Leon Hirszman reflections that provide us elements to the interpretation of our present.
Leukemia is one of the most common cancer type, and its diagnosis and classification is becoming increasingly complex and important. Here, we used a gene expression dataset and adapted bagging support vector machines (bSVM) for leukemia classification. bSVM trains each SVM seperately using bootstrap technique, then aggregates the performances of each SVM by majority voting. bSVM showed accuracy between 87.5% - 92.5%, area under ROC curve between 98.0% - 99.2%, F-measure between 90.5% - 92.7% and outperformed single SVM and other classification methods. We also compared our results with other study results which used the same dataset for leukemia classification. Experimental results revealed that bSVM showed the best performance and can be used as a biomarker for the diagnose of leukemia disease.
This study focused on the dynamic analysis of Euler-Bernoulli beams using curvature and curvature derivative-based finite element methods. In curvature based finite element method (CFE) instead of interpolating displacement of Euler Bernoulli beam in usual displacement based finite element method (DFE), second derivative of displacement is interpolated. CFE method previously was used by a few researchers for dynamic analysis of clamped beams. In this research, CFE method was modified for static and dynamic analysis of beams with various boundary conditions.
An idiom is a string of words whose meaning is different from the meaning conveyed by its individual words. This project will study Persian idioms with the structure N0 C1 V, which are sentences with a free subject (N0), a frozen direct object (C1) and a verb (V). The purpose of this project is to build a database of Persian idioms in order to be used in the computational processing of this language. First, a selection of web sources was used for the collection of idioms; second, from this a database of Persian idioms was built; third, a set of finite-state tools was used to intersect the database with reference graphs and build FSTs (transducers) for corpus exploring; forth, these FSTs were then used to extract idiom candidates from a large subtitles Persian corpus; fifth, the resulting candidates lists was evaluated in order to: (a) estimate the scope of the database; (b) determine the precision of the task of identifying the idioms, using the finite-state tools; and (c) compare it with two association measures (t-test and chi-square). Results show chi-square to be an efficient association measures to retrieve idioms candidates; however, the finitestate tolls allow for a better precision. Attention should also give to the idioms´ main verb; namely, full verbs tend to yield more precise result than more grammaticalized verbs such as support verbs. The database, in its current state, contains 364 verbal idioms form a single formal class.
In this work the arrangement of machines are considered for line layout, loop layout, ladder layout and open field layout The input data required is number of machines, number of jobs, batch sizes, inter slot distance, load unload distances and unit transportation costs, Processing times for different jobs, processing sequence of jobs on different machines, loading unloading and transportation cost. The same was shown below in tables 1 to 10 for the above four layouts.