How airlines and airports recover from schedule perturbations: a survey

Abstract: The explosive growth in air traffic as well as the widespread adoption of Operations Research techniques in airline scheduling has given rise to tight flight schedules at major airports. An undesirable consequence of this is that a minor incident such as a delay in the arrival of a small number of flights can result in a chain reaction of events involving several flights and airports, causing disruption throughout the system. This paper reviews recent literature in the area of recovery from schedule disruptions. First we review how disturbances at a given airport could be handled, including the effects of runways and fixes. Then we study the papers on recovery from airline schedule perturbations, which involve adjustments in flight schedules, aircraft, and crew. The mathematical programming techniques used in ground holding are covered in some detail. We conclude the review with suggestions on how singular perturbation theory could play a role in analyzing disruptions to such highly sensitive schedules as those in the civil aviation industry

how airlin and airport recov from schedul perturb : a survey
 the explos growth in air traffic as well as the widespread adopt of oper research techniqu in airlin schedul ha given rise to tight flight schedul at major airport . an undesir consequ of thi is that a minor incid such as a delay in the arriv of a small number of flight can result in a chain reaction of event involv sever flight and airport , caus disrupt throughout the system . thi paper review recent literatur in the area of recoveri from schedul disrupt . first we review how disturb at a given airport could be handl , includ the effect of runway and fix . then we studi the paper on recoveri from airlin schedul perturb , which involv adjust in flight schedul , aircraft , and crew . the mathemat program techniqu use in ground hold are cover in some detail . we conclud the review with suggest on how singular perturb theori could play a role in analyz disrupt to such highli sensit schedul as those in the civil aviat industri

airports
schedule perturbation
operations research techniques
airline scheduling
tight flight schedules
recovery
schedule disruptions
runways
mathematical programming techniques
ground holding
singular perturbation theory
civil aviation industry
air traffic management
disturbance handling
flight schedule adjustments
aircraft adjustments
crew adjustments


Rapid Cauer filter design employing new filter model

Abstract: The exact three-dimensional (3D) design of a coaxial Cauer filter employing a new filter model, a 3D field simulator and a circuit simulator, is demonstrated. Only a few iterations between the field simulator and the circuit simulator are necessary to meet a given specification

rapid cauer filter design employ new filter model
 the exact three-dimension ( 3d ) design of a coaxial cauer filter employ a new filter model , a 3d field simul and a circuit simul , is demonstr . onli a few iter between the field simul and the circuit simul are necessari to meet a given specif

Cauer filter
filter design
filter model
field simulator
circuit simulator
iterations
3D design
coaxial filter
bandpass filters


Evaluating the best main battle tank using fuzzy decision theory with linguistic criteria evaluation

Abstract: In this paper, experts' opinions are described in linguistic terms which can be expressed in trapezoidal (or triangular) fuzzy numbers. To make the consensus of the experts consistent, we utilize the fuzzy Delphi method to adjust the fuzzy rating of every expert to achieve the consensus condition. For the aggregate of many experts' opinions, we take the operation of fuzzy numbers to get the mean of fuzzy rating, x/sub ij/ and the mean of weight, w/sub .j/. In multi-alternatives and multi-attributes cases, the fuzzy decision matrix X=[x/sub ij/]/sub m*n/ is constructed by means of the fuzzy rating, x/sub ij/. Then, we can derive the aggregate fuzzy numbers by multiplying the fuzzy decision matrix with the corresponding fuzzy attribute weights. The final results become a problem of ranking fuzzy numbers. We also propose an easy procedure of using fuzzy numbers to rank aggregate fuzzy numbers A/sub i/. In this way, we can obtain the best selection for evaluating the system. For practical application, we propose an algorithm for evaluating the best main battle tank by fuzzy decision theory and comparing it with other methods

evalu the best main battl tank use fuzzi decis theori with linguist criteria evalu
 in thi paper , expert ' opinion are describ in linguist term which can be express in trapezoid ( or triangular ) fuzzi number . to make the consensu of the expert consist , we util the fuzzi delphi method to adjust the fuzzi rate of everi expert to achiev the consensu condit . for the aggreg of mani expert ' opinion , we take the oper of fuzzi number to get the mean of fuzzi rate , x / sub ij/ and the mean of weight , w / sub .j/. in multi-altern and multi-attribut case , the fuzzi decis matrix x=[x / sub ij/]/sub m*n/ is construct by mean of the fuzzi rate , x / sub ij/. then , we can deriv the aggreg fuzzi number by multipli the fuzzi decis matrix with the correspond fuzzi attribut weight . the final result becom a problem of rank fuzzi number . we also propos an easi procedur of use fuzzi number to rank aggreg fuzzi number a / sub i/. in thi way , we can obtain the best select for evalu the system . for practic applic , we propos an algorithm for evalu the best main battl tank by fuzzi decis theori and compar it with other method

fuzzy decision theory
linguistic criteria evaluation
fuzzy Delphi method
fuzzy rating
consensus condition
fuzzy decision matrix
aggregate fuzzy numbers
fuzzy attribute weights
battle tank evaluation
fuzzy group decision making
multiple criteria problems
group decision making
subjective-objective backgrounds
trapezoidal fuzzy numbers
triangular fuzzy numbers
fuzzy number ranking


Identification of linear parameter varying models

Abstract: We consider identification of a certain class of discrete-time nonlinear systems known as linear parameter varying system. We assume that inputs, outputs and the scheduling parameters are directly measured, and a form of the functional dependence of the system coefficients on the parameters is known. We show how this identification problem can be reduced to a linear regression, and provide compact formulae for the corresponding least mean square and recursive least-squares algorithms. We derive conditions on persistency of excitation in terms of the inputs and scheduling parameter trajectories when the functional dependence is of polynomial type. These conditions have a natural polynomial interpolation interpretation, and do not require the scheduling parameter trajectories to vary slowly. This method is illustrated with a simulation example using two different parameter trajectories

identif of linear paramet vari model
 we consid identif of a certain class of discrete-tim nonlinear system known as linear paramet vari system . we assum that input , output and the schedul paramet are directli measur , and a form of the function depend of the system coeffici on the paramet is known . we show how thi identif problem can be reduc to a linear regress , and provid compact formula for the correspond least mean squar and recurs least-squar algorithm . we deriv condit on persist of excit in term of the input and schedul paramet trajectori when the function depend is of polynomi type . these condit have a natur polynomi interpol interpret , and do not requir the schedul paramet trajectori to vari slowli . thi method is illustr with a simul exampl use two differ paramet trajectori

identification
linear parameter varying models
discrete-time nonlinear systems
scheduling parameters
functional dependence
system coefficients
linear regression
recursive least-squares algorithms
scheduling parameter trajectories
parameter trajectories
polynomial interpolation interpretation
least mean square algorithms
persistency of excitation conditions
time-varying systems


HeLIN pilot mentoring scheme

Abstract: The health care libraries unit coordinates, facilitates, and promotes continuing personal development for all staff in the Health Libraries and Information Network (HeLIN) of the Oxford Deanery (UK). It supports the development of a culture of lifelong learning and recognizes that CPD should help deliver organizational objectives, as well as enabling all staff to expand and fulfill their potential. A major emphasis for 2000 was to investigate ways of improving support for individual learning within the workplace. The group identified a need to build on existing informal support networks in order to provide additional learning opportunities and decided to investigate the feasibility of piloting a mentoring scheme. The objectives of the pilot were to increase understanding and knowledge of mentoring as a tool for CPD; to investigate existing mentoring schemes and their applicability for HeLIN; to develop a pilot mentoring scheme for HeLIN incorporating a program for accreditation of mentors; and to evaluate the scheme and disseminate the results. In order to identify current practice in this area, a literature review was carried out, and colleagues with an interest in or existing knowledge of mentoring schemes were contacted where possible. In the absence of clearly defined appraisal tools, all abstracts were read, and articles that met the following criteria were obtained and distributed to the group for review

helin pilot mentor scheme
 the health care librari unit coordin , facilit , and promot continu person develop for all staff in the health librari and inform network ( helin ) of the oxford deaneri ( uk ) . it support the develop of a cultur of lifelong learn and recogn that cpd should help deliv organiz object , as well as enabl all staff to expand and fulfil their potenti . a major emphasi for 2000 wa to investig way of improv support for individu learn within the workplac . the group identifi a need to build on exist inform support network in order to provid addit learn opportun and decid to investig the feasibl of pilot a mentor scheme . the object of the pilot were to increas understand and knowledg of mentor as a tool for cpd ; to investig exist mentor scheme and their applic for helin ; to develop a pilot mentor scheme for helin incorpor a program for accredit of mentor ; and to evalu the scheme and dissemin the result . in order to identifi current practic in thi area , a literatur review wa carri out , and colleagu with an interest in or exist knowledg of mentor scheme were contact where possibl . in the absenc of clearli defin apprais tool , all abstract were read , and articl that met the follow criteria were obtain and distribut to the group for review


CherylAnn Silberer: all about process [accounting technologist]

Abstract: Silberer's company, CompLete, is making a specialty of workflow process analysis

cherylann silber : all about process [ account technologist ]
 silber 's compani , complet , is make a specialti of workflow process analysi

accounting technologist
CompLete
workflow process analysis


Hamiltonian modelling and nonlinear disturbance attenuation control of TCSC for improving power system stability

Abstract: To tackle the obstacle of applying passivity-based control (PBC) to power systems, an affine non-linear system widely existing in power systems is formulated as a standard Hamiltonian system using a pre-feedback method. The port controlled Hamiltonian with dissipation (PCHD) model of a thyristor controlled serial compensator (TCSC) is then established corresponding with a revised Hamiltonian function. Furthermore, employing the modified Hamiltonian function directly as the storage function, a non-linear adaptive L/sub 2/ gain control method is proposed to solve the problem of L/sub 2/ gain disturbance attenuation for this Hamiltonian system with parametric perturbations. Finally, simulation results are presented to verify the validity of the proposed controller

hamiltonian model and nonlinear disturb attenu control of tcsc for improv power system stabil
 to tackl the obstacl of appli passivity-bas control ( pbc ) to power system , an affin non-linear system wide exist in power system is formul as a standard hamiltonian system use a pre-feedback method . the port control hamiltonian with dissip ( pchd ) model of a thyristor control serial compens ( tcsc ) is then establish correspond with a revis hamiltonian function . furthermor , employ the modifi hamiltonian function directli as the storag function , a non-linear adapt l / sub 2/ gain control method is propos to solv the problem of l / sub 2/ gain disturb attenu for thi hamiltonian system with parametr perturb . final , simul result are present to verifi the valid of the propos control

port controlled Hamiltonian with dissipation model

nonlinear adaptive L/sub 2/ gain control method


Portfolio optimization and the random magnet problem

Abstract: Diversification of an investment into independently fluctuating assets reduces its risk. In reality, movements of assets are mutually correlated and therefore knowledge of cross-correlations among asset price movements are of great importance. Our results support the possibility that the problem of finding an investment in stocks which exposes invested funds to a minimum level of risk is analogous to the problem of finding the magnetization of a random magnet. The interactions for this "random magnet problem" are given by the cross-correlation matrix C of stock returns. We find that random matrix theory allows us to make an estimate for C which outperforms the standard estimate in terms of constructing an investment which carries a minimum level of risk

portfolio optim and the random magnet problem
 diversif of an invest into independ fluctuat asset reduc it risk . in realiti , movement of asset are mutual correl and therefor knowledg of cross-correl among asset price movement are of great import . our result support the possibl that the problem of find an invest in stock which expos invest fund to a minimum level of risk is analog to the problem of find the magnet of a random magnet . the interact for thi " random magnet problem " are given by the cross-correl matrix c of stock return . we find that random matrix theori allow us to make an estim for c which outperform the standard estim in term of construct an invest which carri a minimum level of risk

portfolio optimization
random magnet problem
magnetization
investment
fluctuating assets
cross-correlations
price movements
stocks
invested funds
cross-correlation matrix
minimum risk level
spin glasses


Agreeing with automated diagnostic aids: a study of users' concurrence strategies

Abstract: Automated diagnostic aids that are less than perfectly reliable often produce unwarranted levels of disuse by operators. In the present study, users' tendencies to either agree or disagree with automated diagnostic aids were examined under conditions in which: (1) the aids were less than perfectly reliable but aided-diagnosis was still more accurate that unaided diagnosis; and (2) the system was completely opaque, affording users no additional information upon which to base a diagnosis. The results revealed that some users adopted a strategy of always agreeing with the aids, thereby maximizing the number of correct diagnoses made over several trials. Other users, however, adopted a probability-matching strategy in which agreement and disagreement rates matched the rate of correct and incorrect diagnoses of the aids. The probability-matching strategy, therefore, resulted in diagnostic accuracy scores that were lower than was maximally possible. Users who adopted the maximization strategy had higher self-ratings of problem-solving and decision-making skills, were more accurate in estimating aid reliabilities, and were more confident in their diagnosis on trials in which they agreed with the aids. The potential applications of these findings include the design of interface and training solutions that facilitate the adoption of the most effective concurrence strategies by users of automated diagnostic aids

agre with autom diagnost aid : a studi of user ' concurr strategi
 autom diagnost aid that are less than perfectli reliabl often produc unwarr level of disus by oper . in the present studi , user ' tendenc to either agre or disagre with autom diagnost aid were examin under condit in which : ( 1 ) the aid were less than perfectli reliabl but aided-diagnosi wa still more accur that unaid diagnosi ; and ( 2 ) the system wa complet opaqu , afford user no addit inform upon which to base a diagnosi . the result reveal that some user adopt a strategi of alway agre with the aid , therebi maxim the number of correct diagnos made over sever trial . other user , howev , adopt a probability-match strategi in which agreement and disagr rate match the rate of correct and incorrect diagnos of the aid . the probability-match strategi , therefor , result in diagnost accuraci score that were lower than wa maxim possibl . user who adopt the maxim strategi had higher self-rat of problem-solv and decision-mak skill , were more accur in estim aid reliabl , and were more confid in their diagnosi on trial in which they agre with the aid . the potenti applic of these find includ the design of interfac and train solut that facilit the adopt of the most effect concurr strategi by user of autom diagnost aid

automated diagnostic aids
reliability
maximization
probability-matching
disagreement rates
problem-solving
user concurrence strategy
complex systems
fault diagnosis


The effect of a male-oriented computer gaming culture on careers in the computer industry

Abstract: If careers in the computer industry were viewed, it would be evident that there is a conspicuous gender gap between the number of male and female employees. The same gap can be observed at the college level where males are dominating females as to those who pursue and obtain a degree in computer science. The question that this research paper intends to show is: why are males so dominant when it comes to computer related matters? The author has traced this question back to the computer game. Computer games are a fun medium and provide the means for an individual to become computer literate through the engagement of spatial learning and cognitive processing abilities. Since such games are marketed almost exclusively to males, females have a distinct disadvantage. Males are more computer literate through the playing of computer games, and are provided with an easy lead-in to more advanced utilization of computers such as programming. Females tend to be turned off due to the male stereotypes and marketing associated with games and thus begins the gender gap

the effect of a male-ori comput game cultur on career in the comput industri
 if career in the comput industri were view , it would be evid that there is a conspicu gender gap between the number of male and femal employe . the same gap can be observ at the colleg level where male are domin femal as to those who pursu and obtain a degre in comput scienc . the question that thi research paper intend to show is : whi are male so domin when it come to comput relat matter ? the author ha trace thi question back to the comput game . comput game are a fun medium and provid the mean for an individu to becom comput liter through the engag of spatial learn and cognit process abil . sinc such game are market almost exclus to male , femal have a distinct disadvantag . male are more comput liter through the play of comput game , and are provid with an easi lead-in to more advanc util of comput such as program . femal tend to be turn off due to the male stereotyp and market associ with game and thu begin the gender gap

computer games
careers
computer industry
gender gap
female employees
spatial learning
cognitive processing
marketing
male stereotypes
computer science degree
computer literacy


Closed-loop model set validation under a stochastic framework

Abstract: Deals with probabilistic model set validation. It is assumed that the dynamics of a multi-input multi-output (MIMO) plant is described by a model set with unstructured uncertainties, and identification experiments are performed in closed loop. A necessary and sufficient condition has been derived for the consistency of the model set with both the stabilizing controller and closed-loop frequency domain experimental data (FDED). In this condition, only the Euclidean norm of a complex vector is involved, and this complex vector depends linearly on both the disturbances and the measurement errors. Based on this condition, an analytic formula has been derived for the sample unfalsified probability (SUP) of the model set. Some of the asymptotic statistical properties of the SUP have also been briefly discussed. A numerical example is included to illustrate the efficiency of the suggested method in model set quality evaluation

closed-loop model set valid under a stochast framework
 deal with probabilist model set valid . it is assum that the dynam of a multi-input multi-output ( mimo ) plant is describ by a model set with unstructur uncertainti , and identif experi are perform in close loop . a necessari and suffici condit ha been deriv for the consist of the model set with both the stabil control and closed-loop frequenc domain experiment data ( fded ) . in thi condit , onli the euclidean norm of a complex vector is involv , and thi complex vector depend linearli on both the disturb and the measur error . base on thi condit , an analyt formula ha been deriv for the sampl unfalsifi probabl ( sup ) of the model set . some of the asymptot statist properti of the sup have also been briefli discuss . a numer exampl is includ to illustr the effici of the suggest method in model set qualiti evalu


Computation of unmeasured third-generation VCT views from measured views

Abstract: We compute unmeasured cone-beam projections from projections measured by a third-generation helical volumetric computed tomography system by solving a characteristic problem for an ultrahyperbolic differential equation [John (1938)]. By working in the Fourier domain, we convert the second-order PDE into a family of first-order ordinary differential equations. A simple first-order integration is used to solve the ODES

comput of unmeasur third-gener vct view from measur view
 we comput unmeasur cone-beam project from project measur by a third-gener helic volumetr comput tomographi system by solv a characterist problem for an ultrahyperbol differenti equat [ john ( 1938 ) ] . by work in the fourier domain , we convert the second-ord pde into a famili of first-ord ordinari differenti equat . a simpl first-ord integr is use to solv the ode

unmeasured third-generation VCT views computation


Approximate relaxed descent method for optimal control problems

Abstract: We consider an optimal control problem for systems governed by ordinary differential equations with control constraints. Since no convexity assumptions are made on the data, the problem is reformulated in relaxed form. The relaxed state equation is discretized by the implicit trapezoidal scheme and the relaxed controls are approximated by piecewise constant relaxed controls. We then propose a combined descent and discretization method that generates sequences of discrete relaxed controls and progressively refines the discretization. Since here the adjoint of the discrete state equation is not defined, we use, at each iteration, an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation and the integral involved by appropriate trapezoidal schemes. It is proved that accumulation points of sequences constructed by this method satisfy the strong relaxed necessary conditions for optimality for the continuous problem. Finally, the computed relaxed controls can be easily approximated by piecewise constant classical controls

approxim relax descent method for optim control problem
 we consid an optim control problem for system govern by ordinari differenti equat with control constraint . sinc no convex assumpt are made on the data , the problem is reformul in relax form . the relax state equat is discret by the implicit trapezoid scheme and the relax control are approxim by piecewis constant relax control . we then propos a combin descent and discret method that gener sequenc of discret relax control and progress refin the discret . sinc here the adjoint of the discret state equat is not defin , we use , at each iter , an approxim deriv of the cost function defin by discret the continu adjoint equat and the integr involv by appropri trapezoid scheme . it is prove that accumul point of sequenc construct by thi method satisfi the strong relax necessari condit for optim for the continu problem . final , the comput relax control can be easili approxim by piecewis constant classic control

approximate relaxed descent method
optimal control problems
ordinary differential equations
implicit trapezoidal scheme
trapezoidal schemes
piecewise constant relaxed controls
discrete state equation
relaxed state equation discretization
relaxed control approximation
discrete relaxed control sequences
discretization refinement
cost functional approximate derivative


Chaos theory as a framework for studying information systems

Abstract: This paper introduces chaos theory as a means of studying information systems. It argues that chaos theory, combined with new techniques for discovering patterns in complex quantitative and qualitative evidence, offers a potentially more substantive approach to understand the nature of information systems in a variety of contexts. The paper introduces chaos theory concepts by way of an illustrative research design

chao theori as a framework for studi inform system
 thi paper introduc chao theori as a mean of studi inform system . it argu that chao theori , combin with new techniqu for discov pattern in complex quantit and qualit evid , offer a potenti more substant approach to understand the natur of inform system in a varieti of context . the paper introduc chao theori concept by way of an illustr research design

chaos theory
information systems
qualitative evidence
pattern discovery
complex quantitative evidence


Extending Kamp's theorem to model time granularity

Abstract: In this paper, a generalization of Kamp's theorem relative to the functional completeness of the until operator is proved. Such a generalization consists in showing the functional completeness of more expressive temporal operators with respect to the extension of the first-order theory of linear orders MFO[<] with an extra binary relational symbol. The result is motivated by the search of a modal language capable of expressing properties and operators suitable to model time granularity in omega -layered temporal structures

extend kamp 's theorem to model time granular
 in thi paper , a gener of kamp 's theorem rel to the function complet of the until oper is prove . such a gener consist in show the function complet of more express tempor oper with respect to the extens of the first-ord theori of linear order mfo [ < ] with an extra binari relat symbol . the result is motiv by the search of a modal languag capabl of express properti and oper suitabl to model time granular in omega -layer tempor structur

Kamp's theorem
model time granularity
functional completeness
until operator
temporal operators
first-order theory
linear orders
binary relational symbol
omega -layered temporal structures


A comparison theorem for the iterative method with the preconditioner (I + S/sub max/)

Abstract: A.D. Gunawardena et al. (1991) have reported the modified Gauss-Seidel method with a preconditioner (I + S). In this article, we propose to use a preconditioner (I + S/sub max/) instead of (I + S). Here, S/sub max/ is constructed by only the largest element at each row of the upper triangular part of A. By using the lemma established by M. Neumann and R.J. Plemmons (1987), we get the comparison theorem for the proposed method. Simple numerical examples are also given

a comparison theorem for the iter method with the precondition ( i + s / sub max/ )
 a.d. gunawardena et al . ( 1991 ) have report the modifi gauss-seidel method with a precondition ( i + s ) . in thi articl , we propos to use a precondition ( i + s / sub max/ ) instead of ( i + s ) . here , s / sub max/ is construct by onli the largest element at each row of the upper triangular part of a. by use the lemma establish by m. neumann and r.j. plemmon ( 1987 ) , we get the comparison theorem for the propos method . simpl numer exampl are also given

comparison theorem
iterative method
preconditioner
modified Gauss-Seidel method


Making it to the major leagues: career movement between library and archival professions and from small college to large university libraries

Abstract: Issues of career movement and change are examined between library and archival fields and from small colleges to large universities. Issues examined include professional education and training, initial career-planning and placement, continuing education, scouting and mentoring, job market conditions, work experience and personal skills, professional involvement, and professional association self-interest. This examination leads to five observations: 1. It is easier, in terms of career transitions, for a librarian to become an archivist than it is for an archivist to become a librarian; 2. The progression from a small college venue to a large research university is very manageable with the proper planning and experience; 3. At least three of the career elements-professional education, career-planning, and professional association self-interest-in their best moments provide a foundation that enables a future consideration of change between institutional types and professional areas and in their worst moments conspire against the midcareer professional in terms of change; 4. The elements of scouting, continuing education, work experience, and professional involvement offer the greatest assistance in career transitions; 5. The job market is the wildcard that either stymies or stimulates occupational development

make it to the major leagu : career movement between librari and archiv profess and from small colleg to larg univers librari
 issu of career movement and chang are examin between librari and archiv field and from small colleg to larg univers . issu examin includ profession educ and train , initi career-plan and placement , continu educ , scout and mentor , job market condit , work experi and person skill , profession involv , and profession associ self-interest . thi examin lead to five observ : 1 . it is easier , in term of career transit , for a librarian to becom an archivist than it is for an archivist to becom a librarian ; 2 . the progress from a small colleg venu to a larg research univers is veri manag with the proper plan and experi ; 3 . at least three of the career elements-profession educ , career-plan , and profession associ self-interest-in their best moment provid a foundat that enabl a futur consider of chang between institut type and profession area and in their worst moment conspir against the midcar profession in term of chang ; 4 . the element of scout , continu educ , work experi , and profession involv offer the greatest assist in career transit ; 5 . the job market is the wildcard that either stymi or stimul occup develop

career movement
archival profession
large university libraries
professional education
training
continuing education
job market
work experience
personal skills
librarian
midcareer
occupational development
library profession
small college library


Application of normal possibility decision rule to silence

Abstract: The paper presents the way of combining two decision problems concerning a single (or a common) dimension, so that an effective fuzzy decision rule can be obtained. Normality of the possibility distribution is assumed, leading to possibility of fusing the respective functions related to the two decision problems and their characteristics (decisions, states of nature, utility functions, etc.). The approach proposed can be applied in cases when the statement of the problem requires making of more refined distinctions rather than considering simply a bi-criterion or bi-utility two-decision problem

applic of normal possibl decis rule to silenc
 the paper present the way of combin two decis problem concern a singl ( or a common ) dimens , so that an effect fuzzi decis rule can be obtain . normal of the possibl distribut is assum , lead to possibl of fuse the respect function relat to the two decis problem and their characterist ( decis , state of natur , util function , etc . ) . the approach propos can be appli in case when the statement of the problem requir make of more refin distinct rather than consid simpli a bi-criterion or bi-util two-decis problem

normal possibility decision rule
silence
decision problems
conflicting objectives
conflicting utilities
cool head
warm heart
two-dimensional fuzzy events


Computing the frequency response of systems affinely depending on uncertain parameters

Abstract: The computation of the frequency response of systems depending affinely on uncertain parameters can be reduced to that of all its one-dimensional edge plants while the image of such an edge plant at a fixed frequency is an arc or a line segment in the complex plane. Based on this conclusion, four computational formulas of the maximal and minimal (maxi-mini) magnitudes and phases of an edge plant at a fixed frequency are given. The formulas, besides sharing a simpler form of expression, concretely display how the extrema of the frequency response of the edge plant relate to the typical characteristics of the arc and line segment such as the centre, radius and tangent points of the arc, the distance from the origin to the line segment etc. The direct application of the results is to compute the Bode-, Nichols- and Nyquist-plot collections of the systems which are needed in robustness analysis and design

comput the frequenc respons of system affin depend on uncertain paramet
 the comput of the frequenc respons of system depend affin on uncertain paramet can be reduc to that of all it one-dimension edg plant while the imag of such an edg plant at a fix frequenc is an arc or a line segment in the complex plane . base on thi conclus , four comput formula of the maxim and minim ( maxi-mini ) magnitud and phase of an edg plant at a fix frequenc are given . the formula , besid share a simpler form of express , concret display how the extrema of the frequenc respons of the edg plant relat to the typic characterist of the arc and line segment such as the centr , radiu and tangent point of the arc , the distanc from the origin to the line segment etc . the direct applic of the result is to comput the bode- , nichols- and nyquist-plot collect of the system which are need in robust analysi and design

frequency response
uncertain parameters
one-dimensional edge plants
arc
line segment
Nyquist-plot
robustness analysis
affine systems
Bode-plot
Nichols-plot
robustness design
frequency-domain design methods


Formal verification of human-automation interaction

Abstract: This paper discusses a formal and rigorous approach to the analysis of operator interaction with machines. It addresses the acute problem of detecting design errors in human-machine interaction and focuses on verifying the correctness of the interaction in complex and automated control systems. The paper describes a systematic methodology for evaluating whether the interface provides the necessary information about the machine to enable the operator to perform a specified task successfully and unambiguously. It also addresses the adequacy of information provided to the user via training materials (e.g., user manual) about the machine's behavior. The essentials of the methodology, which can be automated and applied to the verification of large systems, are illustrated by several examples and through a case study of pilot interaction with an autopilot aboard a modern commercial aircraft. The expected application of this methodology is an augmentation and enhancement, by formal verification, of human-automation interfaces

formal verif of human-autom interact
 thi paper discuss a formal and rigor approach to the analysi of oper interact with machin . it address the acut problem of detect design error in human-machin interact and focus on verifi the correct of the interact in complex and autom control system . the paper describ a systemat methodolog for evalu whether the interfac provid the necessari inform about the machin to enabl the oper to perform a specifi task success and unambigu . it also address the adequaci of inform provid to the user via train materi ( e.g. , user manual ) about the machin 's behavior . the essenti of the methodolog , which can be autom and appli to the verif of larg system , are illustr by sever exampl and through a case studi of pilot interact with an autopilot aboard a modern commerci aircraft . the expect applic of thi methodolog is an augment and enhanc , by formal verif , of human-autom interfac

formal verification
human-automation interaction
automated control systems
autopilot
commercial aircraft
man-machine interaction
user interface


The road to perpetual progress [retail inventory management]

Abstract: With annual revenues increasing 17.0% to 20.0% consistently over the last three years and more than 2,500 new stores opened from 1998 through 2001, Dollar General is on the fast track. However, the road to riches could have easily become the road to ruin had the retailer not exerted control over its inventory management

the road to perpetu progress [ retail inventori manag ]
 with annual revenu increas 17.0 % to 20.0 % consist over the last three year and more than 2,500 new store open from 1998 through 2001 , dollar gener is on the fast track . howev , the road to rich could have easili becom the road to ruin had the retail not exert control over it inventori manag

retailer
inventory management
Dollar General


Genetic algorithm for input/output selection in MIMO systems based on controllability and observability indices

Abstract: A time domain optimisation algorithm using a genetic algorithm in conjunction with a linear search scheme has been developed to find the smallest or near-smallest subset of inputs and outputs to control a multi-input-multi-output system. Experimental results have shown that this proposed algorithm has a very fast convergence rate and high computation efficiency

genet algorithm for input / output select in mimo system base on control and observ indic
 a time domain optimis algorithm use a genet algorithm in conjunct with a linear search scheme ha been develop to find the smallest or near-smallest subset of input and output to control a multi-input-multi-output system . experiment result have shown that thi propos algorithm ha a veri fast converg rate and high comput effici

genetic algorithm
input/output selection
MIMO systems
observability indices
time domain optimisation algorithm
linear search scheme
near-smallest subset
multi-input-multi-output system
very fast convergence
high computation efficiency
controllability indices
smallest subset
multivariable control systems


The impact of the product mix on the value of flexibility

Abstract: Product-mix flexibility is one of the major types of manufacturing flexibility, referring to the ability to produce a broad range of products or variants with presumed low changeover costs. The value of such a capability is important to establish for an industrial firm in order to ensure that the flexibility provided will be at the right level and used profitably rather than in excess of market requirements and consequently costly. We use option-pricing theory to analyse the impact of various product-mix issues on the value of flexibility. The real options model we use incorporates multiple products, capacity constraints as well as set-up costs. The issues treated here include the number of products, demand variability, correlation between products, and the relative demand distribution within the product mix. Thus, we are interested in the nature of the input data to analyse its effect on the value of flexibility. We also check the impact at different capacity levels. The results suggest that the value of flexibility (i) increases with an increasing number of products, (ii) decreases with increasing volatility of product demand, (iii) decreases the more positively correlated the demand is, and (iv) reduces for marginal capacity with increasing levels of capacity. Of these, the impact of positively correlated demand seems to be a major issue. However, the joint impact of the number of products and demand correlation showed some non-intuitive results

the impact of the product mix on the valu of flexibl
 product-mix flexibl is one of the major type of manufactur flexibl , refer to the abil to produc a broad rang of product or variant with presum low changeov cost . the valu of such a capabl is import to establish for an industri firm in order to ensur that the flexibl provid will be at the right level and use profit rather than in excess of market requir and consequ costli . we use option-pr theori to analys the impact of variou product-mix issu on the valu of flexibl . the real option model we use incorpor multipl product , capac constraint as well as set-up cost . the issu treat here includ the number of product , demand variabl , correl between product , and the rel demand distribut within the product mix . thu , we are interest in the natur of the input data to analys it effect on the valu of flexibl . we also check the impact at differ capac level . the result suggest that the valu of flexibl ( i ) increas with an increas number of product , ( ii ) decreas with increas volatil of product demand , ( iii ) decreas the more posit correl the demand is , and ( iv ) reduc for margin capac with increas level of capac . of these , the impact of posit correl demand seem to be a major issu . howev , the joint impact of the number of product and demand correl show some non-intuit result

product-mix flexibility
manufacturing flexibility
low changeover costs
industrial firm
option-pricing theory
real options model
multiple products
capacity constraints
set-up costs
demand variability
relative demand distribution
marginal capacity
positively correlated demand
demand correlation
flexible manufacturing
product correlation
product demand volatility
capital budgeting


Determinantal solutions of solvable chaotic systems

Abstract: It is shown that two solvable chaotic systems, the arithmetic-harmonic mean (ARM) algorithm and the Ulam-von Neumann (UvN) map, have determinantal solutions. An additional formula for certain determinants and Riccati difference equations play a key role in both cases. Two infinite hierarchies of solvable chaotic systems are presented which have determinantal solutions

determinant solut of solvabl chaotic system
 it is shown that two solvabl chaotic system , the arithmetic-harmon mean ( arm ) algorithm and the ulam-von neumann ( uvn ) map , have determinant solut . an addit formula for certain determin and riccati differ equat play a key role in both case . two infinit hierarchi of solvabl chaotic system are present which have determinant solut

determinantal solutions
determinants
solvable chaotic systems
Riccati difference equations
arithmetic-harmonic mean algorithm
Ulam-von Neumann map
Chebyshev polynomial


Dependence graphs: dependence within and between groups

Abstract: This paper applies the two-party dependence theory (Castelfranchi, Cesta and Miceli, 1992, in Y. Demazeau and E. Werner (Eds.) Decentralized AI-3, Elsevier, North Holland) to modelling multiagent and group dependence. These have theoretical potentialities for the study of emerging groups and collective structures, and more generally for understanding social and organisational complexity, and practical utility for both social-organisational and agent systems purposes. In the paper, the dependence theory is extended to describe multiagent links, with a special reference to group and collective phenomena, and is proposed as a framework for the study of emerging social structures, such as groups and collectives. In order to do so, we propose to extend the notion of dependence networks (applied to a single agent) to dependence graphs (applied to an agency). In its present version, the dependence theory is argued to provide (a) a theoretical instrument for the study of social complexity, and (b) a computational system for managing the negotiation process in competitive contexts and for monitoring complexity in organisational and other cooperative contexts

depend graph : depend within and between group
 thi paper appli the two-parti depend theori ( castelfranchi , cesta and mice , 1992 , in y. demazeau and e. werner ( ed . ) decentr ai-3 , elsevi , north holland ) to model multiag and group depend . these have theoret potenti for the studi of emerg group and collect structur , and more gener for understand social and organis complex , and practic util for both social-organis and agent system purpos . in the paper , the depend theori is extend to describ multiag link , with a special refer to group and collect phenomena , and is propos as a framework for the studi of emerg social structur , such as group and collect . in order to do so , we propos to extend the notion of depend network ( appli to a singl agent ) to depend graph ( appli to an agenc ) . in it present version , the depend theori is argu to provid ( a ) a theoret instrument for the studi of social complex , and ( b ) a comput system for manag the negoti process in competit context and for monitor complex in organis and other cooper context

dependence graphs
two-party dependence theory
group dependence
emerging groups
collective structures
organisational complexity
agent systems
dependence networks
social complexity
multiagent dependence
multiagent systems


Explicit matrix representation for NURBS curves and surfaces

Abstract: The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves and surfaces explicitly other than recursively. The two approaches are derived from the computation of divided difference and the Marsden identity respectively. The explicit coefficient matrix of B-spline with equally spaced knot and Bezier curves and surfaces can be obtained by these formulae. The coefficient formulae and the coefficient matrix formulae developed in this paper express non-uniform B-spline functions of arbitrary degree in explicit polynomial and matrix forms.. They are useful for the evaluation and the conversion of NURBS curves and surfaces, in CAD/CAM systems

explicit matrix represent for nurb curv and surfac
 the matrix form for curv and surfac were larg promot in cad / cam . in thi paper we have present two matrix represent formul for arbitrari degre nurb curv and surfac explicitli other than recurs . the two approach are deriv from the comput of divid differ and the marsden ident respect . the explicit coeffici matrix of b-spline with equal space knot and bezier curv and surfac can be obtain by these formula . the coeffici formula and the coeffici matrix formula develop in thi paper express non-uniform b-spline function of arbitrari degre in explicit polynomi and matrix form .. they are use for the evalu and the convers of nurb curv and surfac , in cad / cam system

explicit matrix representation
NURBS curves
CAD/CAM
matrix representation formulations
divided difference
Marsden identity
explicit coefficient matrix
B-spline
equally spaced knot
Bezier curves
coefficient formulae
coefficient matrix formulae
NURBS surfaces
Bezier surfaces
nonuniform B-spline functions
explicit polynomial forms
explicit matrix forms


Rate allocation for video transmission over lossy correlated networks

Abstract: A novel rate allocation algorithm for video transmission over lossy networks subject to bursty packet losses is presented. A Gilbert-Elliot model is used at the encoder to drive the selection of coding parameters. Experimental results using the H.26L test model show a significant performance improvement with respect to the assumption of independent packet losses

rate alloc for video transmiss over lossi correl network
 a novel rate alloc algorithm for video transmiss over lossi network subject to bursti packet loss is present . a gilbert-elliot model is use at the encod to drive the select of code paramet . experiment result use the h.26l test model show a signific perform improv with respect to the assumpt of independ packet loss

video transmission
lossy correlated networks
rate allocation algorithm
bursty packet losses
Gilbert-Elliot model
coding parameters
H.26L test model
video coding


Statistical analysis of nonlinearly reconstructed near-infrared tomographic images. I. Theory and simulations

Abstract: Near-infrared (NIR) diffuse tomography is an emerging method for imaging the interior of tissues to quantify concentrations of hemoglobin and exogenous chromophores noninvasively in vivo. It often exploits an optical diffusion model-based image reconstruction algorithm to estimate spatial property values from measurements of the light flux at the surface of the tissue. In this study, mean-squared error (MSE) over the image is used to evaluate methods for regularizing the ill-posed inverse image reconstruction problem in NIR tomography. Estimates of image bias and image standard deviation were calculated based upon 100 repeated reconstructions of a test image with randomly distributed noise added to the light flux measurements. It was observed that the bias error dominates at high regularization parameter values while variance dominates as the algorithm is allowed to approach the optimal solution. This optimum does not necessarily correspond to the minimum projection error solution, but typically requires further iteration with a decreasing regularization parameter to reach the lowest image error. Increasing measurement noise causes a need to constrain the minimum regularization parameter to higher values in order to achieve a minimum in the overall image MSE

statist analysi of nonlinearli reconstruct near-infrar tomograph imag . i. theori and simul
 near-infrar ( nir ) diffus tomographi is an emerg method for imag the interior of tissu to quantifi concentr of hemoglobin and exogen chromophor noninvas in vivo . it often exploit an optic diffus model-bas imag reconstruct algorithm to estim spatial properti valu from measur of the light flux at the surfac of the tissu . in thi studi , mean-squar error ( mse ) over the imag is use to evalu method for regular the ill-pos invers imag reconstruct problem in nir tomographi . estim of imag bia and imag standard deviat were calcul base upon 100 repeat reconstruct of a test imag with randomli distribut nois ad to the light flux measur . it wa observ that the bia error domin at high regular paramet valu while varianc domin as the algorithm is allow to approach the optim solut . thi optimum doe not necessarili correspond to the minimum project error solut , but typic requir further iter with a decreas regular paramet to reach the lowest imag error . increas measur nois caus a need to constrain the minimum regular paramet to higher valu in order to achiev a minimum in the overal imag mse

minimum regularization parameter constraint

ill-posed inverse image reconstruction problem regularization


The top cycle and uncovered solutions for weak tournaments

Abstract: We study axiomatic properties of the top cycle and uncovered solutions for weak tournaments. Subsequently, we establish its connection with the rational choice theory

the top cycl and uncov solut for weak tournament
 we studi axiomat properti of the top cycl and uncov solut for weak tournament . subsequ , we establish it connect with the ration choic theori

top cycle
uncovered solutions
weak tournaments
axiomatic properties
rational choice theory


User-appropriate tyre-modelling for vehicle dynamics in standard and limit situations

Abstract: When modelling vehicles for the vehicle dynamic simulation, special attention must be paid to the modelling of tyre forces and -torques, according to their dominant influence on the results. This task is not only about sufficiently exact representation of the effective forces but also about user-friendly and practical relevant applicability, especially when the experimental tyre-input-data is incomplete or missing. This text firstly describes the basics of the vehicle dynamic tyre model, conceived to be a physically based, semi-empirical model for application in connection with multi-body-systems (MBS). On the basis of tyres for a passenger car and a heavy truck the simulated steady state tyre characteristics are shown together and compared with the underlying experimental values. The possibility to link the tyre model TMeasy to any MBS-program is described, as far as it supports the 'Standard Tyre Interface'. As an example, the simulated and experimental data of a heavy truck doing a standardized driving manoeuvre are compared

user-appropri tyre-model for vehicl dynam in standard and limit situat
 when model vehicl for the vehicl dynam simul , special attent must be paid to the model of tyre forc and -torqu , accord to their domin influenc on the result . thi task is not onli about suffici exact represent of the effect forc but also about user-friendli and practic relev applic , especi when the experiment tyre-input-data is incomplet or miss . thi text firstli describ the basic of the vehicl dynam tyre model , conceiv to be a physic base , semi-empir model for applic in connect with multi-body-system ( mb ) . on the basi of tyre for a passeng car and a heavi truck the simul steadi state tyre characterist are shown togeth and compar with the underli experiment valu . the possibl to link the tyre model tmeasi to ani mbs-program is describ , as far as it support the ' standard tyre interfac ' . as an exampl , the simul and experiment data of a heavi truck do a standard drive manoeuvr are compar


Changes in the entropy and the Tsallis difference information during spontaneous decay and self-organization of nonextensive systems

Abstract: A theoretical-information description of self-organization processes during stimulated transitions between stationary states of open nonextensive systems is presented. S/sub q/- and I/sub q/-theorems on changes of the entropy and Tsallis difference information measures in the process of evolution in the space of control parameters are proved. The entropy and the Tsallis difference information are derived and their new extreme properties are discussed

chang in the entropi and the tsalli differ inform dure spontan decay and self-organ of nonextens system
 a theoretical-inform descript of self-organ process dure stimul transit between stationari state of open nonextens system is present . s / sub q/- and i / sub q/-theorem on chang of the entropi and tsalli differ inform measur in the process of evolut in the space of control paramet are prove . the entropi and the tsalli differ inform are deriv and their new extrem properti are discuss

entropy
Tsallis difference information
spontaneous decay
self-organization
nonextensive systems
stimulated transitions
information measures
control parameters
nonextensive statistical mechanics


Content all clear [workflow & content management]

Abstract: Graeme Muir of SchlumbergerSema cuts through the confusion between content, document and records management

content all clear [ workflow & content manag ]
 graem muir of schlumbergersema cut through the confus between content , document and record manag

content management
SchlumbergerSema
records management
document management


Parallel interior point schemes for solving multistage convex programming

Abstract: The predictor-corrector interior-point path-following algorithm is promising in solving multistage convex programming problems. Among many other general good features of this algorithm, especially attractive is that the algorithm allows the possibility to parallelise the major computations. The dynamic structure of the multistage problems specifies a block-tridiagonal system at each Newton step of the algorithm. A wrap-around permutation is then used to implement the parallel computation for this step

parallel interior point scheme for solv multistag convex program
 the predictor-corrector interior-point path-follow algorithm is promis in solv multistag convex program problem . among mani other gener good featur of thi algorithm , especi attract is that the algorithm allow the possibl to parallelis the major comput . the dynam structur of the multistag problem specifi a block-tridiagon system at each newton step of the algorithm . a wrap-around permut is then use to implement the parallel comput for thi step


Use of web technologies in construction project management: what are the critical success/failure factors?

Abstract: A concept of how the World Wide Web (WWW) and its associated technologies can be used to manage construction projects has been recognized by practitioners in the construction industry for quite sometime. This concept is often referred to as a Web-Based Project Management System (WPMS). It promises, to enhance construction project documentation and control, and to revolutionize the way construction project teams process and transmit project information. WPMS is an electronic project-management system conducted through the Internet. The system provides a centralized, commonly accessible, reliable means of transmitting and storing project information. Project information is stored on the server and a standard Web browser is used as the gateway to exchange this information, eliminating geographic and hardware platforms boundary

use of web technolog in construct project manag : what are the critic success / failur factor ?
 a concept of how the world wide web ( www ) and it associ technolog can be use to manag construct project ha been recogn by practition in the construct industri for quit sometim . thi concept is often refer to as a web-bas project manag system ( wpm ) . it promis , to enhanc construct project document and control , and to revolution the way construct project team process and transmit project inform . wpm is an electron project-manag system conduct through the internet . the system provid a central , commonli access , reliabl mean of transmit and store project inform . project inform is store on the server and a standard web browser is use as the gateway to exchang thi inform , elimin geograph and hardwar platform boundari

success
construction industry
Web-Based Project Management System
project documentation
Web browser
project control
implementation


MRP in a job shop environment using a resource constrained project scheduling model

Abstract: One of the most difficult tasks in a job shop manufacturing environment is to balance schedule and capacity in an ongoing basis. MRP systems are commonly used for scheduling, although their inability to deal with capacity constraints adequately is a severe drawback. In this study, we show that material requirements planning can be done more effectively in a job shop environment using a resource constrained project scheduling model. The proposed model augments MRP models by incorporating capacity constraints and using variable lead time lengths. The efficacy of this approach is tested on MRP systems by comparing the inventory carrying costs and resource allocation of the solutions obtained by the proposed model to those obtained by using a traditional MRP model. In general, it is concluded that the proposed model provides improved schedules with considerable reductions in inventory carrying costs

mrp in a job shop environ use a resourc constrain project schedul model
 one of the most difficult task in a job shop manufactur environ is to balanc schedul and capac in an ongo basi . mrp system are commonli use for schedul , although their inabl to deal with capac constraint adequ is a sever drawback . in thi studi , we show that materi requir plan can be done more effect in a job shop environ use a resourc constrain project schedul model . the propos model augment mrp model by incorpor capac constraint and use variabl lead time length . the efficaci of thi approach is test on mrp system by compar the inventori carri cost and resourc alloc of the solut obtain by the propos model to those obtain by use a tradit mrp model . in gener , it is conclud that the propos model provid improv schedul with consider reduct in inventori carri cost


Robustness evaluation of a minimal RBF neural network for nonlinear-data-storage-channel equalisation

Abstract: The authors present a performance-robustness evaluation of the recently developed minimal resource allocation network (MRAN) for equalisation in highly nonlinear magnetic recording channels in disc storage systems. Unlike communication systems, equalisation of signals in these channels is a difficult problem, as they are corrupted by data-dependent noise and highly nonlinear distortions. Nair and Moon (1997) have proposed a maximum signal to distortion ratio (MSDR) equaliser for data storage channels, which uses a specially designed neural network, where all the parameters of the neural network are determined theoretically, based on the exact knowledge of the channel model parameters. In the present paper, the performance of the MSDR equaliser is compared with that of the MRAN equaliser using a magnetic recording channel model, under Conditions that include variations in partial erasure, jitter, width and noise power, as well as model mismatch. Results from the study indicate that the less complex MRAN equaliser gives consistently better performance robustness than the MSDR equaliser in terms of signal to distortion ratios (SDRs)

robust evalu of a minim rbf neural network for nonlinear-data-storage-channel equalis
 the author present a performance-robust evalu of the recent develop minim resourc alloc network ( mran ) for equalis in highli nonlinear magnet record channel in disc storag system . unlik commun system , equalis of signal in these channel is a difficult problem , as they are corrupt by data-depend nois and highli nonlinear distort . nair and moon ( 1997 ) have propos a maximum signal to distort ratio ( msdr ) equalis for data storag channel , which use a special design neural network , where all the paramet of the neural network are determin theoret , base on the exact knowledg of the channel model paramet . in the present paper , the perform of the msdr equalis is compar with that of the mran equalis use a magnet record channel model , under condit that includ variat in partial erasur , jitter , width and nois power , as well as model mismatch . result from the studi indic that the less complex mran equalis give consist better perform robust than the msdr equalis in term of signal to distort ratio ( sdr )

maximum signal to distortion ratio equaliser


LR parsing for conjunctive grammars

Abstract: The generalized LR parsing algorithm for context-free grammars, introduced by Tomita in 1986, is a polynomial-time implementation of nondeterministic LR parsing that uses graph-structured stack to represent the contents of the nondeterministic parser's pushdown for all possible branches of computation at a single computation step. It has been specifically developed as a solution for practical parsing tasks arising in computational linguistics, and indeed has proved itself to be very suitable for natural language processing. Conjunctive grammars extend context-free grammars by allowing the use of an explicit intersection operation within grammar rules. This paper develops a new LR-style parsing algorithm for these grammars, which is based on the very same idea of a graph-structured pushdown, where the simultaneous existence of several paths in the graph is used to perform the mentioned intersection operation. The underlying finite automata are treated in the most general way: instead of showing the algorithm's correctness for some particular way of constructing automata, the paper defines a wide class of automata usable with a given grammar, which includes not only the traditional LR(k) automata, but also, for instance, a trivial automaton with a single reachable state. A modification of the SLR(k) table construction method that makes use of specific properties of conjunctive grammars is provided as one possible way of making finite automata to use with the algorithm

lr pars for conjunct grammar
 the gener lr pars algorithm for context-fre grammar , introduc by tomita in 1986 , is a polynomial-tim implement of nondeterminist lr pars that use graph-structur stack to repres the content of the nondeterminist parser 's pushdown for all possibl branch of comput at a singl comput step . it ha been specif develop as a solut for practic pars task aris in comput linguist , and inde ha prove itself to be veri suitabl for natur languag process . conjunct grammar extend context-fre grammar by allow the use of an explicit intersect oper within grammar rule . thi paper develop a new lr-style pars algorithm for these grammar , which is base on the veri same idea of a graph-structur pushdown , where the simultan exist of sever path in the graph is use to perform the mention intersect oper . the underli finit automata are treat in the most gener way : instead of show the algorithm 's correct for some particular way of construct automata , the paper defin a wide class of automata usabl with a given grammar , which includ not onli the tradit lr(k ) automata , but also , for instanc , a trivial automaton with a singl reachabl state . a modif of the slr(k ) tabl construct method that make use of specif properti of conjunct grammar is provid as one possibl way of make finit automata to use with the algorithm

conjunctive grammars
generalized LR parsing algorithm
context-free grammars
graph-structured stack
computation
computational linguistics
natural language processing
explicit intersection operation
grammar rules
finite automata
trivial automaton
single reachable state
nondeterministic parser pushdown
Boolean closure
deterministic context-free languages


A digital-driving system for smart vehicles

Abstract: In the wake of the computer and information technology revolutions, vehicles are undergoing dramatic changes in their capabilities and how they interact with drivers. Although some vehicles can decide to either generate warnings for the human driver or control the vehicle autonomously, they must usually make these decisions in real time with only incomplete information. So, human drivers must still maintain control over the vehicle. I sketch a digital driving behavior model. By simulating and analyzing driver behavior during different maneuvers such as lane changing, lane following, and traffic avoidance, researchers participating in the Beijing Institute of Technology's digital-driving project will be able to examine the possible correlations or causal relations between the smart vehicle, IVISs, the intelligent road-traffic-information network, and the driver. We aim to successfully demonstrate that a digital-driving system can provide a direction for developing human-centered smart vehicles

a digital-driv system for smart vehicl
 in the wake of the comput and inform technolog revolut , vehicl are undergo dramat chang in their capabl and how they interact with driver . although some vehicl can decid to either gener warn for the human driver or control the vehicl autonom , they must usual make these decis in real time with onli incomplet inform . so , human driver must still maintain control over the vehicl . i sketch a digit drive behavior model . by simul and analyz driver behavior dure differ maneuv such as lane chang , lane follow , and traffic avoid , research particip in the beij institut of technolog 's digital-driv project will be abl to examin the possibl correl or causal relat between the smart vehicl , iviss , the intellig road-traffic-inform network , and the driver . we aim to success demonstr that a digital-driv system can provid a direct for develop human-cent smart vehicl

intelligent road traffic information network


On bandlimited scaling function

Abstract: This paper discusses band-limited scaling function, especially the single interval band case and three interval band cases. Their relationship to oversampling property and weakly translation invariance are also studied. At the end, we propose an open problem

on bandlimit scale function
 thi paper discuss band-limit scale function , especi the singl interv band case and three interv band case . their relationship to oversampl properti and weakli translat invari are also studi . at the end , we propos an open problem

bandlimited scaling function
interval band case
oversampling property
weakly translation invariance


A phytography of WALDMEISTER

Abstract: The architecture of the WALDMEISTER prover for unit equational deduction is based on a strict separation of active and passive facts. After an inspection of the system's proof procedure, the representation of each of the central data structures is outlined, namely indexing for the active facts, compression for the passive facts, successor sets for the hypotheses, and minimal recording of inference steps for the proof object. In order to cope with large search spaces, specialized redundancy criteria are employed, and the empirically gained control knowledge is integrated to ease the use of the system. The paper concludes with a quantitative comparison of the WALDMEISTER versions over the years, and a view of the future prospects

a phytographi of waldmeist
 the architectur of the waldmeist prover for unit equat deduct is base on a strict separ of activ and passiv fact . after an inspect of the system 's proof procedur , the represent of each of the central data structur is outlin , name index for the activ fact , compress for the passiv fact , successor set for the hypothes , and minim record of infer step for the proof object . in order to cope with larg search space , special redund criteria are employ , and the empir gain control knowledg is integr to eas the use of the system . the paper conclud with a quantit comparison of the waldmeist version over the year , and a view of the futur prospect

phytography
WALDMEISTER
unit equational deduction
passive facts
data structures
indexing
active facts
hypotheses
inference
large search spaces
redundancy
future prospects
theorem prover
CADE ATP System Competition


Parcel boundary identification with computer-assisted boundary overlay process for Taiwan

Abstract: The study investigates the design of a process for parcel boundary identification with cadastral map overlay using the principle of least squares. The objective of this research is to provide an objective tool for boundary identification survey. The proposed process includes an adjustment model, a weighting scheme, and other related operations. A numerical example is included

parcel boundari identif with computer-assist boundari overlay process for taiwan
 the studi investig the design of a process for parcel boundari identif with cadastr map overlay use the principl of least squar . the object of thi research is to provid an object tool for boundari identif survey . the propos process includ an adjust model , a weight scheme , and other relat oper . a numer exampl is includ

computer assisted boundary overlay process


Abstract: D. Weisser (1981) proved that there are exactly four Galois cubic number fields with Hilbert modular threefolds of arithmetic genus one. In this paper, we extend Weisser's work to cover all cubic number fields. Our main result is that there are exactly 33 fields with Hilbert modular threefolds of arithmetic genus one. These fields are enumerated explicitly

hilbert modular threefold of arithmet genu one
 d. weisser ( 1981 ) prove that there are exactli four galoi cubic number field with hilbert modular threefold of arithmet genu one . in thi paper , we extend weisser 's work to cover all cubic number field . our main result is that there are exactli 33 field with hilbert modular threefold of arithmet genu one . these field are enumer explicitli

Hilbert modular threefolds
arithmetic genus one
Galois cubic number fields


Verifying concurrent systems with symbolic execution

Abstract: Current techniques for interactively proving temporal properties of concurrent systems translate transition systems into temporal formulas by introducing program counter variables. Proofs are not intuitive, because control flow is not explicitly considered. For sequential programs symbolic execution is a very intuitive, interactive proof strategy. In this paper we adopt this technique for parallel programs. Properties are formulated in interval temporal logic. An implementation in the interactive theorem prover KIV has shown that this technique offers a high degree of automation and allows simple, local invariants

verifi concurr system with symbol execut
 current techniqu for interact prove tempor properti of concurr system translat transit system into tempor formula by introduc program counter variabl . proof are not intuit , becaus control flow is not explicitli consid . for sequenti program symbol execut is a veri intuit , interact proof strategi . in thi paper we adopt thi techniqu for parallel program . properti are formul in interv tempor logic . an implement in the interact theorem prover kiv ha shown that thi techniqu offer a high degre of autom and allow simpl , local invari

concurrent systems
symbolic execution
temporal properties
transition systems
temporal formulas
program counter variables
sequential programs
parallel programs
interactive theorem prover KIV
local invariants
concurrent systems verification


Driving the NKK Smartswitch.2. Graphics and text

Abstract: Whether your message is one of workplace safety or world peace, the long nights of brooding over ways to tell the world are over. Part 1 described the basic interface to drive the Smartswitch. Part 2 adds the bells and whistles to allow both text and messages to be placed anywhere on the screen. It considers character generation, graphic generation and the user interface

drive the nkk smartswitch.2 . graphic and text
 whether your messag is one of workplac safeti or world peac , the long night of brood over way to tell the world are over . part 1 describ the basic interfac to drive the smartswitch . part 2 add the bell and whistl to allow both text and messag to be place anywher on the screen . it consid charact gener , graphic gener and the user interfac

text
messages
character generation
graphic generation
user interface
NKK Smartswitch
computer graphics


Computational challenges in cell simulation: a software engineering approach

Abstract: Molecular biology's advent in the 20th century has exponentially increased our knowledge about the inner workings of life. We have dozens of completed genomes and an array of high-throughput methods to characterize gene encodings and gene product operation. The question now is how we will assemble the various pieces. In other words, given sufficient information about a living cell's molecular components, can we predict its behavior? We introduce the major classes of cellular processes relevant to modeling, discuss software engineering's role in cell simulation, and identify cell simulation requirements. Our E-Cell project aims to develop the theories, techniques, and software platforms necessary for whole-cell-scale modeling, simulation, and analysis. Since the project's launch in 1996, we have built a variety of cell models, and we are currently developing new models that vary with respect to species, target subsystem, and overall scale

comput challeng in cell simul : a softwar engin approach
 molecular biolog 's advent in the 20th centuri ha exponenti increas our knowledg about the inner work of life . we have dozen of complet genom and an array of high-throughput method to character gene encod and gene product oper . the question now is how we will assembl the variou piec . in other word , given suffici inform about a live cell 's molecular compon , can we predict it behavior ? we introduc the major class of cellular process relev to model , discuss softwar engin 's role in cell simul , and identifi cell simul requir . our e-cel project aim to develop the theori , techniqu , and softwar platform necessari for whole-cell-scal model , simul , and analysi . sinc the project 's launch in 1996 , we have built a varieti of cell model , and we are current develop new model that vari with respect to speci , target subsystem , and overal scale

cell simulation
software engineering
molecular biology
E-Cell project
whole-cell-scale modeling
object-oriented design


Effects of the transition to a client-centred team organization in administrative surveying work

Abstract: A new work organization was introduced in administrative surveying work in Sweden during 1998. The new work organization implied a transition to a client-centred team-based organization and required a change in competence from specialist to generalist knowledge as well as a transition to a new information technology, implying a greater integration within the company. The aim of this study was to follow the surveyors for two years from the start of the transition and investigate how perceived consequences of the transition, job, organizational factors, well-being and effectiveness measures changed between 1998 and 2000. The Teamwork Profile and QPS Nordic questionnaire were used. The 205 surveyors who participated in all three study phases constituted the study group. The result showed that surveyors who perceived that they were working as generalists rated the improvements in job and organizational factors significantly higher than those who perceived that they were not yet generalists. Improvements were noted in 2000 in quality of service to clients, time available to handle a case and effectiveness of teamwork in a transfer to a team-based work organization group, cohesion and continuous improvement practices-for example, learning by doing, mentoring and guided delegation-were important to improve the social effectiveness of group work

effect of the transit to a client-centr team organ in administr survey work
 a new work organ wa introduc in administr survey work in sweden dure 1998 . the new work organ impli a transit to a client-centr team-bas organ and requir a chang in compet from specialist to generalist knowledg as well as a transit to a new inform technolog , impli a greater integr within the compani . the aim of thi studi wa to follow the surveyor for two year from the start of the transit and investig how perceiv consequ of the transit , job , organiz factor , well-b and effect measur chang between 1998 and 2000 . the teamwork profil and qp nordic questionnair were use . the 205 surveyor who particip in all three studi phase constitut the studi group . the result show that surveyor who perceiv that they were work as generalist rate the improv in job and organiz factor significantli higher than those who perceiv that they were not yet generalist . improv were note in 2000 in qualiti of servic to client , time avail to handl a case and effect of teamwork in a transfer to a team-bas work organ group , cohes and continu improv practices-for exampl , learn by do , mentor and guid delegation-wer import to improv the social effect of group work

client-centred team organization
administrative surveying work
information technology
company
job
organizational factors
effectiveness measures
Teamwork Profile
QPS Nordic questionnaire
social effectiveness
public administrative sector


The development and evaluation of a fuzzy logic expert system for renal transplantation assignment: Is this a useful tool?

Abstract: Allocating donor kidneys to patients is a complex, multicriteria decision-making problem which involves not only medical, but also ethical and political issues. In this paper, a fuzzy logic expert system approach was proposed as an innovative way to deal with the vagueness and complexity faced by medical doctors in kidney allocation decision making. A pilot fuzzy logic expert system for kidney allocation was developed and evaluated in comparison with two existing allocation algorithms: a priority sorting system used by multiple organ retrieval and exchange (MORE) in Canada and a point scoring systems used by united network for organ sharing (UNOS) in US. Our simulated experiment based on real data indicated that the fuzzy logic system can represent the expert's thinking well in handling complex tradeoffs, and overall, the fuzzy logic derived recommendations were more acceptable to the expert than those from the MORE and UNOS algorithms

the develop and evalu of a fuzzi logic expert system for renal transplant assign : is thi a use tool ?
 alloc donor kidney to patient is a complex , multicriteria decision-mak problem which involv not onli medic , but also ethic and polit issu . in thi paper , a fuzzi logic expert system approach wa propos as an innov way to deal with the vagu and complex face by medic doctor in kidney alloc decis make . a pilot fuzzi logic expert system for kidney alloc wa develop and evalu in comparison with two exist alloc algorithm : a prioriti sort system use by multipl organ retriev and exchang ( more ) in canada and a point score system use by unit network for organ share ( uno ) in us . our simul experi base on real data indic that the fuzzi logic system can repres the expert 's think well in handl complex tradeoff , and overal , the fuzzi logic deriv recommend were more accept to the expert than those from the more and uno algorithm

fuzzy logic expert system
renal transplantation assignment
donor kidneys
multicriteria decision-making problem
kidney allocation decision making
priority sorting system
point scoring systems
united network for organ sharing
simulated experiment
multiple organ retrieval exchange
complex tradeoff handling


Strong and weak points of the MUSCADET theorem prover-examples from CASC-JC

Abstract: MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001)

strong and weak point of the muscadet theorem prover-exampl from casc-jc
 muscadet is a knowledge-bas theorem prover base on natur deduct . it ha particip in cade autom theorem prove system competit . the result show it complementar with regard to resolution-bas prover . thi paper present some of it crucial method and give some exampl of muscadet proof from the last competit ( casc-jc in ijcar 2001 )


A formal model of correctness in a cadastre

Abstract: A key issue for cadastral systems is the maintenance of their correctness. Correctness is defined to be the proper correspondence between the valid legal situation and the content of the cadastre. This correspondence is generally difficult to achieve, since the cadastre is not a complete representation of all aspects influencing the legal situation in reality. The goal of the paper is to develop a formal model comprising representations of the cadastre and of reality that allows the simulation and investigation of cases where this correspondence is potentially violated. For this purpose the model consists of two parts, the first part represents the valid legal situation and the second part represents the cadastre. This makes it feasible to mark the differences between reality and the cadastre. The marking together with the two parts of the model facilitate the discussion of issues in "real-world" cadastral systems where incorrectness occurs. In order to develop a formal model, the paper uses the transfer of ownership of a parcel between two persons as minimal case study. The foundation for the formalization is a modern version of the situation calculus. The focus moves from the analysis of the cadastre to the preparation of a conceptual and a formalized model and the implementation of a prototype

a formal model of correct in a cadastr
 a key issu for cadastr system is the mainten of their correct . correct is defin to be the proper correspond between the valid legal situat and the content of the cadastr . thi correspond is gener difficult to achiev , sinc the cadastr is not a complet represent of all aspect influenc the legal situat in realiti . the goal of the paper is to develop a formal model compris represent of the cadastr and of realiti that allow the simul and investig of case where thi correspond is potenti violat . for thi purpos the model consist of two part , the first part repres the valid legal situat and the second part repres the cadastr . thi make it feasibl to mark the differ between realiti and the cadastr . the mark togeth with the two part of the model facilit the discuss of issu in " real-world " cadastr system where incorrect occur . in order to develop a formal model , the paper use the transfer of ownership of a parcel between two person as minim case studi . the foundat for the formal is a modern version of the situat calculu . the focu move from the analysi of the cadastr to the prepar of a conceptu and a formal model and the implement of a prototyp

formal model
formal model
cadastre
cadastral systems
legal situation
transfer of ownership
minimal case study
situation calculus
formal correctness model
correctness maintenance
formalized model


Examining children's reading performance and preference for different computer-displayed text

Abstract: This study investigated how common online text affects reading performance of elementary school-age children by examining the actual and perceived readability of four computer-displayed typefaces at 12- and 14-point sizes. Twenty-seven children, ages 9 to 11, were asked to read eight children's passages and identify erroneous/substituted words while reading. Comic Sans MS, Arial and Times New Roman typefaces, regardless of size, were found to be more readable (as measured by a reading efficiency score) than Courier New. No differences in reading speed were found for any of the typeface combinations. In general, the 14-point size and the examined sans serif typefaces were perceived as being the easiest to read, fastest, most attractive, and most desirable for school-related material. In addition, participants significantly preferred Comic Sans MS and 14-point Arial to 12-point Courier. Recommendations for appropriate typeface combinations for children reading on computers are discussed

examin children 's read perform and prefer for differ computer-display text
 thi studi investig how common onlin text affect read perform of elementari school-ag children by examin the actual and perceiv readabl of four computer-display typefac at 12- and 14-point size . twenty-seven children , age 9 to 11 , were ask to read eight children 's passag and identifi erron / substitut word while read . comic san ms , arial and time new roman typefac , regardless of size , were found to be more readabl ( as measur by a read effici score ) than courier new . no differ in read speed were found for ani of the typefac combin . in gener , the 14-point size and the examin san serif typefac were perceiv as be the easiest to read , fastest , most attract , and most desir for school-rel materi . in addit , particip significantli prefer comic san ms and 14-point arial to 12-point courier . recommend for appropri typefac combin for children read on comput are discuss

computer-displayed text
online text
elementary school-age children
computer-displayed typefaces
child reading performance
fonts
user interface
human factors
educational computing


An optimization approach to plan for reusable software components

Abstract: It is well acknowledged in software engineering that there is a great potential for accomplishing significant productivity improvements through the implementation of a successful software reuse program. On the other hand, such gains are attainable only by instituting detailed action plans at both the organizational and program level. Given this need, the paucity of research papers related to planning, and in particular, optimized planning is surprising. This research, which is aimed at this gap, brings out an application of optimization for the planning of reusable software components (SCs). We present a model that selects a set of SCs that must be built, in order to lower development and adaptation costs. We also provide implications to project management based on simulation, an approach that has been adopted by other cost models in the software engineering literature. Such a prescriptive model does not exist in the literature

an optim approach to plan for reusabl softwar compon
 it is well acknowledg in softwar engin that there is a great potenti for accomplish signific product improv through the implement of a success softwar reus program . on the other hand , such gain are attain onli by institut detail action plan at both the organiz and program level . given thi need , the pauciti of research paper relat to plan , and in particular , optim plan is surpris . thi research , which is aim at thi gap , bring out an applic of optim for the plan of reusabl softwar compon ( sc ) . we present a model that select a set of sc that must be built , in order to lower develop and adapt cost . we also provid implic to project manag base on simul , an approach that ha been adopt by other cost model in the softwar engin literatur . such a prescript model doe not exist in the literatur

optimization
reusable software components
software engineering
productivity improvements
software reuse program
action plans
optimized planning
adaptation costs
project management
simulation
development costs


Optimal time of switching between portfolios of securities

Abstract: Optimal time of switching between several portfolios of securities are found for the purpose of profit maximization. Two methods of their determination are considered. The cases with three and n portfolios are studied in detail

optim time of switch between portfolio of secur
 optim time of switch between sever portfolio of secur are found for the purpos of profit maxim . two method of their determin are consid . the case with three and n portfolio are studi in detail

optimal time
portfolios of securities
profit maximization


Using extended logic programming for alarm-correlation in cellular phone networks

Abstract: Alarm correlation is a necessity in large mobile phone networks, where the alarm bursts resulting from severe failures would otherwise overload the network operators. We describe how to realize alarm-correlation in cellular phone networks using extended logic programming. To this end, we describe an algorithm and system solving the problem, a model of a mobile phone network application, and a detailed solution for a specific scenario

use extend logic program for alarm-correl in cellular phone network
 alarm correl is a necess in larg mobil phone network , where the alarm burst result from sever failur would otherwis overload the network oper . we describ how to realiz alarm-correl in cellular phone network use extend logic program . to thi end , we describ an algorithm and system solv the problem , a model of a mobil phone network applic , and a detail solut for a specif scenario

extended logic programming
alarm-correlation
cellular phone networks
large mobile phone networks
network operators
fault diagnosis


Necessary conditions of optimality for impulsive systems on Banach spaces

Abstract: We present necessary conditions of optimality for optimal control problems arising in systems governed by impulsive evolution equations on Banach spaces. Basic notations and terminologies are first presented and necessary conditions of optimality are presented. Special cases are discussed and we present an application to the classical linear quadratic regulator problem

necessari condit of optim for impuls system on banach space
 we present necessari condit of optim for optim control problem aris in system govern by impuls evolut equat on banach space . basic notat and terminolog are first present and necessari condit of optim are present . special case are discuss and we present an applic to the classic linear quadrat regul problem

necessary conditions
optimality
impulsive systems
Banach spaces
optimal control
impulsive evolution equations
linear quadratic regulator


Neural networks for web content filtering

Abstract: With the proliferation of harmful Internet content such as pornography, violence, and hate messages, effective content-filtering systems are essential. Many Web-filtering systems are commercially available, and potential users can download trial versions from the Internet. However, the techniques these systems use are insufficiently accurate and do not adapt well to the ever-changing Web. To solve this problem, we propose using artificial neural networks to classify Web pages during content filtering. We focus on blocking pornography because it is among the most prolific and harmful Web content. However, our general framework is adaptable for filtering other objectionable Web material

neural network for web content filter
 with the prolifer of harm internet content such as pornographi , violenc , and hate messag , effect content-filt system are essenti . mani web-filt system are commerci avail , and potenti user can download trial version from the internet . howev , the techniqu these system use are insuffici accur and do not adapt well to the ever-chang web . to solv thi problem , we propos use artifici neural network to classifi web page dure content filter . we focu on block pornographi becaus it is among the most prolif and harm web content . howev , our gener framework is adapt for filter other objection web materi

pornographic/nonpornographic Web page differentiation


Cleared for take-off [Hummingbird Enterprise]

Abstract: A recent Gartner report identifies Hummingbird in the first wave of vendors as an early example of convergence in the 'smart enterprise suite' market. We spoke to Hummingbird's Marketing Director for Northern Europe

clear for take-off [ hummingbird enterpris ]
 a recent gartner report identifi hummingbird in the first wave of vendor as an earli exampl of converg in the ' smart enterpris suit ' market . we spoke to hummingbird 's market director for northern europ

Hummingbird Enterprise
smart enterprise suite
information content
knowledge content
collaboration


Vacuum-compatible vibration isolation stack for an interferometric gravitational wave detector TAMA300

Abstract: Interferometric gravitational wave detectors require a large degree of vibration isolation. For this purpose, a multilayer stack constructed of rubber and metal blocks is suitable, because it provides isolation in all degrees of freedom at once. In TAMA300, a 300 m interferometer in Japan, long-term dimensional stability and compatibility with an ultrahigh vacuum environment of about 10/sup -6/ Pa are also required. To keep the interferometer at its operating point despite ground strain and thermal drift of the isolation system, a thermal actuator was introduced. To prevent the high outgassing rate of the rubber from spoiling the vacuum, the rubber blocks were enclosed by gas-tight bellows. Using these techniques, we have successfully developed a three-layer stack which has a vibration isolation ratio of more than 10/sup 3/ at 300 Hz with control of drift and enough vacuum compatibility

vacuum-compat vibrat isol stack for an interferometr gravit wave detector tama300
 interferometr gravit wave detector requir a larg degre of vibrat isol . for thi purpos , a multilay stack construct of rubber and metal block is suitabl , becaus it provid isol in all degre of freedom at onc . in tama300 , a 300 m interferomet in japan , long-term dimension stabil and compat with an ultrahigh vacuum environ of about 10 / sup -6/ pa are also requir . to keep the interferomet at it oper point despit ground strain and thermal drift of the isol system , a thermal actuat wa introduc . to prevent the high outgass rate of the rubber from spoil the vacuum , the rubber block were enclos by gas-tight bellow . use these techniqu , we have success develop a three-lay stack which ha a vibrat isol ratio of more than 10 / sup 3/ at 300 hz with control of drift and enough vacuum compat

interferometric gravitational wave detectors


Bivariate fractal interpolation functions on rectangular domains

Abstract: Non-tensor product bivariate fractal interpolation functions defined on gridded rectangular domains are constructed. Linear spaces consisting of these functions are introduced. The relevant Lagrange interpolation problem is discussed. A negative result about the existence of affine fractal interpolation functions defined on such domains is obtained

bivari fractal interpol function on rectangular domain
 non-tensor product bivari fractal interpol function defin on grid rectangular domain are construct . linear space consist of these function are introduc . the relev lagrang interpol problem is discuss . a neg result about the exist of affin fractal interpol function defin on such domain is obtain