New developments in inductive learning

Abstract: Any intelligent system, whether natural or artificial, must have three characteristics: knowledge, reasoning, and learning. Artificial intelligence (AI) studies these three aspects in artificial systems. Briefly, we could say that knowledge refers to the system's world model, and reasoning to the manipulation of this knowledge. Learning is slightly more complex; the system interacts with the world and as a consequence it builds onto and modifies its knowledge. This process of self-building and self-modifying is known as learning. This thesis is set within the field of artificial intelligence and focuses on learning. More specifically, it deals with the inductive learning of decision trees

new develop in induct learn
 ani intellig system , whether natur or artifici , must have three characterist : knowledg , reason , and learn . artifici intellig ( ai ) studi these three aspect in artifici system . briefli , we could say that knowledg refer to the system 's world model , and reason to the manipul of thi knowledg . learn is slightli more complex ; the system interact with the world and as a consequ it build onto and modifi it knowledg . thi process of self-build and self-modifi is known as learn . thi thesi is set within the field of artifici intellig and focus on learn . more specif , it deal with the induct learn of decis tree

new developments
inductive learning
intelligent system
knowledge
reasoning
artificial intelligence
decision trees


Mid-market accounting systems

Abstract: Welcome to our fourth annual survey of accounting systems and enterprise resource planning (ERP) systems. Last September, we concentrated on financial and distribution systems for medium-sized businesses (mid market) and included 22 products in our charts. This year, we extended the products to include manufacturing and added 34 products to the list

mid-market account system
 welcom to our fourth annual survey of account system and enterpris resourc plan ( erp ) system . last septemb , we concentr on financi and distribut system for medium-s busi ( mid market ) and includ 22 product in our chart . thi year , we extend the product to includ manufactur and ad 34 product to the list

mid-market accounting systems
survey
enterprise resource planning
manufacturing


Electromagnetics computations using the MPI parallel implementation of the steepest descent fast multipole method (SDFMM)

Abstract: The computational solution of large-scale linear systems of equations necessitates the use of fast algorithms but is also greatly enhanced by employing parallelization techniques. The objective of this work is to demonstrate the speedup achieved by the MPI (message passing interface) parallel implementation of the steepest descent fast multipole method (SDFMM). Although this algorithm has already been optimized to take advantage of the structure of the physics of scattering problems, there is still the opportunity to speed up the calculation by dividing tasks into components using multiple processors and solve them in parallel. The SDFMM has three bottlenecks ordered as (1) filling the sparse impedance matrix associated with the near-field method of moments interactions (MoM), (2) the matrix vector multiplications associated with this sparse matrix and (3) the far field interactions associated with the fast multipole method. The parallel implementation task is accomplished using a thirty-one node Intel Pentium Beowulf cluster and is also validated on a 4-processor Alpha workstation. The Beowulf cluster consists of thirty-one nodes of 350 MHz Intel Pentium IIs with 256 MB of RAM and one node of a 4*450 MHz Intel Pentium II Xeon shared memory processor with 2 GB of RAM with all nodes connected to a 100 BaseTX Ethernet network. The Alpha workstation has a maximum of four 667 MHz processors. Our numerical results show significant linear speedup in filling the sparse impedance matrix. Using the 32-processors on the Beowulf cluster lead to a 7.2 overall speedup while a 2.5 overall speedup is gained using the 4-processors on the Alpha workstation

electromagnet comput use the mpi parallel implement of the steepest descent fast multipol method ( sdfmm )
 the comput solut of large-scal linear system of equat necessit the use of fast algorithm but is also greatli enhanc by employ parallel techniqu . the object of thi work is to demonstr the speedup achiev by the mpi ( messag pass interfac ) parallel implement of the steepest descent fast multipol method ( sdfmm ) . although thi algorithm ha alreadi been optim to take advantag of the structur of the physic of scatter problem , there is still the opportun to speed up the calcul by divid task into compon use multipl processor and solv them in parallel . the sdfmm ha three bottleneck order as ( 1 ) fill the spars imped matrix associ with the near-field method of moment interact ( mom ) , ( 2 ) the matrix vector multipl associ with thi spars matrix and ( 3 ) the far field interact associ with the fast multipol method . the parallel implement task is accomplish use a thirty-on node intel pentium beowulf cluster and is also valid on a 4-processor alpha workstat . the beowulf cluster consist of thirty-on node of 350 mhz intel pentium ii with 256 mb of ram and one node of a 4 * 450 mhz intel pentium ii xeon share memori processor with 2 gb of ram with all node connect to a 100 basetx ethernet network . the alpha workstat ha a maximum of four 667 mhz processor . our numer result show signific linear speedup in fill the spars imped matrix . use the 32-processor on the beowulf cluster lead to a 7.2 overal speedup while a 2.5 overal speedup is gain use the 4-processor on the alpha workstat

electromagnetics computations
MPI parallel implementation
steepest descent fast multipole method
large-scale linear systems
fast algorithms
message passing interface
physics
scattering problems
multiple processors
sparse impedance matrix
method of moments
matrix vector multiplications
Intel Pentium Beowulf cluster
4-processor Alpha workstation
350 MHz
Intel Pentium II
RAM
450 MHz
Xeon shared memory processor
100 BaseTX Ethernet network
667 MHz
near-field MoM
scattered electric field
scattered magnetic field
256 MByte
2 GByte

P P P P P P P P P P P P P P P P P P P P P R M M M M


The BLISS programming language: a history

Abstract: The BLISS programming language was invented by William A. Wulf and others at Carnegie-Mellon University in 1969, originally for the DEC PDP-10. BLISS-10 caught the interest of Ronald F. Brender of DEC (Digital Equipment Corporation). After several years of collaboration, including the creation of BLISS-11 for the PDP-11, BLISS was adopted as DEC's implementation language for use on its new line of VAX computers in 1975. DEC developed a completely new generation of BLISSs for the VAX, PDP-10 and PDP-11, which became widely used at DEC during the 1970s and 1980s. With the creation of the Alpha architecture in the early 1990s, BLISS was extended again, in both 32- and 64-bit flavors. BLISS support for the Intel IA-32 architecture was introduced in 1995 and IA-64 support is now in progress. BLISS has a number of unusual characteristics: it is typeless, requires use of an explicit contents of operator (written as a period or 'dot'), takes an algorithmic approach to data structure definition, has no goto, is an expression language, and has an unusually rich compile-time language. This paper reviews the evolution and use of BLISS over its three decade lifetime. Emphasis is on how the language evolved to facilitate portable programming while retaining its initial highly machine-specific character. Finally, the success of its characteristics are assessed

the bliss program languag : a histori
 the bliss program languag wa invent by william a. wulf and other at carnegie-mellon univers in 1969 , origin for the dec pdp-10 . bliss-10 caught the interest of ronald f. brender of dec ( digit equip corpor ) . after sever year of collabor , includ the creation of bliss-11 for the pdp-11 , bliss wa adopt as dec 's implement languag for use on it new line of vax comput in 1975 . dec develop a complet new gener of blisss for the vax , pdp-10 and pdp-11 , which becam wide use at dec dure the 1970 and 1980 . with the creation of the alpha architectur in the earli 1990 , bliss wa extend again , in both 32- and 64-bit flavor . bliss support for the intel ia-32 architectur wa introduc in 1995 and ia-64 support is now in progress . bliss ha a number of unusu characterist : it is typeless , requir use of an explicit content of oper ( written as a period or ' dot ' ) , take an algorithm approach to data structur definit , ha no goto , is an express languag , and ha an unusu rich compile-tim languag . thi paper review the evolut and use of bliss over it three decad lifetim . emphasi is on how the languag evolv to facilit portabl program while retain it initi highli machine-specif charact . final , the success of it characterist are assess

BLISS programming language
data structure definition
compile-time language
portable programming
machine-oriented language
system implementation language


Quadratic interpolation on spheres

Abstract: Riemannian quadratics are C/sup 1/ curves on Riemannian manifolds, obtained by performing the quadratic recursive deCastlejeau algorithm in a Riemannian setting. They are of interest for interpolation problems in Riemannian manifolds, such as trajectory-planning for rigid body motion. Some interpolation properties of Riemannian quadratics are analysed when the ambient manifold is a sphere or projective space, with the usual Riemannian metrics

quadrat interpol on sphere
 riemannian quadrat are c / sup 1/ curv on riemannian manifold , obtain by perform the quadrat recurs decastlejeau algorithm in a riemannian set . they are of interest for interpol problem in riemannian manifold , such as trajectory-plan for rigid bodi motion . some interpol properti of riemannian quadrat are analys when the ambient manifold is a sphere or project space , with the usual riemannian metric

quadratic interpolation
Riemannian manifolds
trajectory-planning
rigid body motion
ambient manifold
corner-cutting
parallel translation
approximation theory


Quasi-Newton algorithm for adaptive minor component extraction

Abstract: An adaptive quasi-Newton algorithm is first developed to extract a single minor component corresponding to the smallest eigenvalue of a stationary sample covariance matrix. A deflation technique instead of the commonly used inflation method is then applied to extract the higher-order minor components. The algorithm enjoys the advantage of having a simpler computational complexity and a highly modular and parallel structure for efficient implementation. Simulation results are given to demonstrate the effectiveness of the proposed algorithm for extracting multiple minor components adaptively

quasi-newton algorithm for adapt minor compon extract
 an adapt quasi-newton algorithm is first develop to extract a singl minor compon correspond to the smallest eigenvalu of a stationari sampl covari matrix . a deflat techniqu instead of the commonli use inflat method is then appli to extract the higher-ord minor compon . the algorithm enjoy the advantag of have a simpler comput complex and a highli modular and parallel structur for effici implement . simul result are given to demonstr the effect of the propos algorithm for extract multipl minor compon adapt

quasi-Newton algorithm
adaptive minor component extraction
eigenvalue
stationary sample covariance matrix
deflation technique
higher-order minor components
computational complexity
parallel structure
simulation results
modular structure
adaptive estimation
DOA estimation
ROOT-MUSIC estimator


Quantized-State Systems: A DEVS-approach for continuous system simulation

Abstract: A new class of dynamical systems, Quantized State Systems or QSS, is introduced in this paper. QSS are continuous time systems where the input trajectories are piecewise constant functions and the state variable trajectories - being themselves piecewise linear functions - are converted into piecewise constant functions via a quantization function equipped with hysteresis. It is shown that QSS can be exactly represented and simulated by a discrete event model, within the framework of the DEVS-approach. Further, it is shown that QSS can be used to approximate continuous systems, thus allowing their discrete-event simulation in opposition to the classical discrete-time simulation. It is also shown that in an approximating QSS, some stability properties of the original system are conserved and the solutions of the QSS go to the solutions of the original system when the quantization goes to zero

quantized-st system : a devs-approach for continu system simul
 a new class of dynam system , quantiz state system or qss , is introduc in thi paper . qss are continu time system where the input trajectori are piecewis constant function and the state variabl trajectori - be themselv piecewis linear function - are convert into piecewis constant function via a quantiz function equip with hysteresi . it is shown that qss can be exactli repres and simul by a discret event model , within the framework of the devs-approach . further , it is shown that qss can be use to approxim continu system , thu allow their discrete-ev simul in opposit to the classic discrete-tim simul . it is also shown that in an approxim qss , some stabil properti of the origin system are conserv and the solut of the qss go to the solut of the origin system when the quantiz goe to zero

dynamical systems
Quantized State Systems
continuous time systems
piecewise constant functions
discrete event model
discrete-event simulation


Gossip is synteny: Incomplete gossip and the syntenic distance between genomes

Abstract: The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip problem. In this problem, there are n gossipers, each with a unique piece of initial information; they communicate by phone calls in which the two participants exchange all their information. The goal is to minimize the total number of phone calls necessary to inform each gossiper of his set of relevant gossip which he desires to learn. As an application of the connection between syntenic distance and incomplete gossip, we derive an O(2/sup O(n log n)/) algorithm to exactly compute the syntenic distance between two genomes with at most n chromosomes each. Our algorithm requires O(n/sup 2/+2/sup O(d log d)/) time when this distance is d, improving the O(n/sup 2/+2(O(d//sup 2/))) running time of the best previous exact algorithm

gossip is synteni : incomplet gossip and the synten distanc between genom
 the synten distanc between two genom is given by the minimum number of fusion , fission , and transloc requir to transform one into the other , ignor the order of gene within chromosom . comput thi distanc is np-hard . in the present work , we give a tight connect between synten distanc and the incomplet gossip problem , a novel gener of the classic gossip problem . in thi problem , there are n gossip , each with a uniqu piec of initi inform ; they commun by phone call in which the two particip exchang all their inform . the goal is to minim the total number of phone call necessari to inform each gossip of hi set of relev gossip which he desir to learn . as an applic of the connect between synten distanc and incomplet gossip , we deriv an o(2 / sup o(n log n)/ ) algorithm to exactli comput the synten distanc between two genom with at most n chromosom each . our algorithm requir o(n / sup 2/+2 / sup o(d log d)/ ) time when thi distanc is d , improv the o(n / sup 2/+2(o(d//sup 2/ ) ) ) run time of the best previou exact algorithm

syntenic distance
genomes
chromosomes
NP-hard
incomplete gossip problem
running time
comparative genomics


Global comparison of stages of growth based on critical success factors

Abstract: With increasing globalization of business, the management of IT in international organizations is faced with the complex task of dealing with the difference between local and international IT needs. This study evaluates, and compares, the level of IT maturity and the critical success factors (CSFs) in selected geographic regions, namely, Norway, Australia/New Zealand, North America, Europe, Asia/Pacific, and India. The results show that significant differences in the IT management needs in these geographic regions exist, and that the IT management operating in these regions must balance the multiple critical success factors for achieving an optimal local-global mix for business success

global comparison of stage of growth base on critic success factor
 with increas global of busi , the manag of it in intern organ is face with the complex task of deal with the differ between local and intern it need . thi studi evalu , and compar , the level of it matur and the critic success factor ( csf ) in select geograph region , name , norway , australia / new zealand , north america , europ , asia / pacif , and india . the result show that signific differ in the it manag need in these geograph region exist , and that the it manag oper in these region must balanc the multipl critic success factor for achiev an optim local-glob mix for busi success

critical success factors
international IT needs
IT maturity
Norway
Australia
New Zealand
North America
Europe
Asia/Pacific
India
IT management
optimal local-global mix
business success
business globalization
local IT needs


Advanced aerostatic stability analysis of cable-stayed bridges using finite-element method

Abstract: Based on the concept of limit point instability, an advanced nonlinear finite-element method that can be used to analyze the aerostatic stability of cable-stayed bridges is proposed. Both geometric nonlinearity and three components of wind loads are considered in this method. The example bridge is the second Santou Bay cable-stayed bridge with a main span length of 518 m built in China. Aerostatic stability of the example bridge is investigated using linear and proposed methods. The effect of pitch moment coefficient on the aerostatic stability of the bridge has been studied. The results show that the aerostatic instability analyses of cable-stayed bridges based on the linear method considerably overestimate the wind-resisting capacity of cable-stayed bridges. The proposed method is highly accurate and efficient. Pitch moment coefficient has a major effect on the aerostatic stability of cable-stayed bridges. Finally, the aerostatic failure mechanism of cable-stayed bridges is explained by tracing the aerostatic instability path

advanc aerostat stabil analysi of cable-stay bridg use finite-el method
 base on the concept of limit point instabl , an advanc nonlinear finite-el method that can be use to analyz the aerostat stabil of cable-stay bridg is propos . both geometr nonlinear and three compon of wind load are consid in thi method . the exampl bridg is the second santou bay cable-stay bridg with a main span length of 518 m built in china . aerostat stabil of the exampl bridg is investig use linear and propos method . the effect of pitch moment coeffici on the aerostat stabil of the bridg ha been studi . the result show that the aerostat instabl analys of cable-stay bridg base on the linear method consider overestim the wind-resist capac of cable-stay bridg . the propos method is highli accur and effici . pitch moment coeffici ha a major effect on the aerostat stabil of cable-stay bridg . final , the aerostat failur mechan of cable-stay bridg is explain by trace the aerostat instabl path

advanced nonlinear finite element method


Data mining business intelligence for competitive advantage

Abstract: Organizations have lately realized that just processing transactions and/or information faster and more efficiently no longer provides them with a competitive advantage vis-a-vis their competitors for achieving business excellence. Information technology (IT) tools that are oriented towards knowledge processing can provide the edge that organizations need to survive and thrive in the current era of fierce competition. Enterprises are no longer satisfied with business information system(s); they require business intelligence system(s). The increasing competitive pressures and the desire to leverage information technology techniques have led many organizations to explore the benefits of new emerging technology, data warehousing and data mining. The paper discusses data warehouses and data mining tools and applications

data mine busi intellig for competit advantag
 organ have late realiz that just process transact and/or inform faster and more effici no longer provid them with a competit advantag vis-a-vi their competitor for achiev busi excel . inform technolog ( it ) tool that are orient toward knowledg process can provid the edg that organ need to surviv and thrive in the current era of fierc competit . enterpris are no longer satisfi with busi inform system( ) ; they requir busi intellig system( ) . the increas competit pressur and the desir to leverag inform technolog techniqu have led mani organ to explor the benefit of new emerg technolog , data wareh and data mine . the paper discuss data warehous and data mine tool and applic

data mining
business intelligence
competitive advantage
organizations
information technology
knowledge processing
data warehouses
business information system


Numerical validation of solutions of complementarity problems: the nonlinear case

Abstract: This paper proposes a validation method for solutions of nonlinear complementarity problems. The validation procedure performs a computational test. If the result of the test is positive, then it is guaranteed that a given multi-dimensional interval either includes a solution or excludes all solutions of the nonlinear complementarity problem

numer valid of solut of complementar problem : the nonlinear case
 thi paper propos a valid method for solut of nonlinear complementar problem . the valid procedur perform a comput test . if the result of the test is posit , then it is guarante that a given multi-dimension interv either includ a solut or exclud all solut of the nonlinear complementar problem

numerical validation
nonlinear complementarity problem
computational test
optimization


Fault diagnosis and fault tolerant control of linear stochastic systems with unknown inputs

Abstract: This paper presents an integrated robust fault detection and isolation (FDI) and fault tolerant control (FTC) scheme for a fault in actuators or sensors of linear stochastic systems subjected to unknown inputs (disturbances). As usual in this kind of works, it is assumed that single fault occurs at a time and the fault treated is of random bias type. The FDI module is constructed using banks of robust two-stage Kalman filters, which simultaneously estimate the state and the fault bias, and generate residual sets decoupled from unknown disturbances. All elements of residual sets are evaluated by using a hypothesis statistical test, and the fault is declared according to the prepared decision logic. The FTC module is activated based on the fault indicator, and additive compensation signal is computed using the fault bias estimate and combined to the nominal control law for compensating the fault's effect on the system. Simulation results for the simplified longitudinal flight control system with parameter variations, process and measurement noises demonstrate the effectiveness of the approach proposed

fault diagnosi and fault toler control of linear stochast system with unknown input
 thi paper present an integr robust fault detect and isol ( fdi ) and fault toler control ( ftc ) scheme for a fault in actuat or sensor of linear stochast system subject to unknown input ( disturb ) . as usual in thi kind of work , it is assum that singl fault occur at a time and the fault treat is of random bia type . the fdi modul is construct use bank of robust two-stag kalman filter , which simultan estim the state and the fault bia , and gener residu set decoupl from unknown disturb . all element of residu set are evalu by use a hypothesi statist test , and the fault is declar accord to the prepar decis logic . the ftc modul is activ base on the fault indic , and addit compens signal is comput use the fault bia estim and combin to the nomin control law for compens the fault 's effect on the system . simul result for the simplifi longitudin flight control system with paramet variat , process and measur nois demonstr the effect of the approach propos

fault tolerant control
stochastic systems
fault detection
two-stage Kalman filters
longitudinal flight control system
fault isolation
linear systems
state estimation
robust control
discrete-time system


Estimation of the gradient of the solution of an adjoint diffusion equation by the Monte Carlo method

Abstract: For the case of isotropic diffusion we consider the representation of the weighted concentration of trajectories and its space derivatives in the form of integrals (with some weights) of the solution to the corresponding boundary value problem and its directional derivative of a convective velocity. If the convective velocity at the domain boundary is degenerate and some other additional conditions are imposed this representation allows us to construct an efficient 'random walk by spheres and balls' algorithm. When these conditions are violated, transition to modelling the diffusion trajectories by the Euler scheme is realized, and the directional derivative of velocity is estimated by the dependent testing method, using the parallel modelling of two closely-spaced diffusion trajectories. We succeeded in justifying this method by statistically equivalent transition to modelling a single trajectory after the first step in the Euler scheme, using a suitable weight. This weight also admits direct differentiation with respect to the initial coordinate along a given direction. The resulting weight algorithm for calculating concentration derivatives is especially efficient if the initial point is in the subdomain in which the coefficients of the diffusion equation are constant

estim of the gradient of the solut of an adjoint diffus equat by the mont carlo method
 for the case of isotrop diffus we consid the represent of the weight concentr of trajectori and it space deriv in the form of integr ( with some weight ) of the solut to the correspond boundari valu problem and it direct deriv of a convect veloc . if the convect veloc at the domain boundari is degener and some other addit condit are impos thi represent allow us to construct an effici ' random walk by sphere and ball ' algorithm . when these condit are violat , transit to model the diffus trajectori by the euler scheme is realiz , and the direct deriv of veloc is estim by the depend test method , use the parallel model of two closely-spac diffus trajectori . we succeed in justifi thi method by statist equival transit to model a singl trajectori after the first step in the euler scheme , use a suitabl weight . thi weight also admit direct differenti with respect to the initi coordin along a given direct . the result weight algorithm for calcul concentr deriv is especi effici if the initi point is in the subdomain in which the coeffici of the diffus equat are constant

random walk by spheres and balls algorithm

P P P P P P P P P P P P P P P P P P P R R R


A note on multi-index polynomials of Dickson type and their applications in quantum optics

Abstract: We discuss the properties of a new family of multi-index Lucas type polynomials, which are often encountered in problems of intracavity photon statistics. We develop an approach based on the integral representation method and show that this class of polynomials can be derived from recently introduced multi-index Hermite like polynomials

a note on multi-index polynomi of dickson type and their applic in quantum optic
 we discuss the properti of a new famili of multi-index luca type polynomi , which are often encount in problem of intracav photon statist . we develop an approach base on the integr represent method and show that thi class of polynomi can be deriv from recent introduc multi-index hermit like polynomi

multi-index polynomials
quantum optics
Lucas type polynomials
intracavity photon statistics
integral representation
generating functions


Product development: using a 3D computer model to optimize the stability of the Rocket TM powered wheelchair

Abstract: A three-dimensional (3D) lumped-parameter model of a powered wheelchair was created to aid the development of the Rocket prototype wheelchair and to help explore the effect of innovative design features on its stability. The model was developed using simulation software, specifically Working Model 3D. The accuracy of the model was determined by comparing both its static stability angles and dynamic behavior as it passed down a 4.8-cm (1.9") road curb at a heading of 45 degrees with the performance of the actual wheelchair. The model's predictions of the static stability angles in the forward, rearward, and lateral directions were within 9.3, 7.1, and 3.8% of the measured values, respectively. The average absolute error in the predicted position of the wheelchair as it moved down the curb was 2.2 cm/m (0.9" per 3'3") traveled. The accuracy was limited by the inability to model soft bodies, the inherent difficulties in modeling a statically indeterminate system, and the computing time. Nevertheless, it was found to be useful in investigating the effect of eight design alterations on the lateral stability of the wheelchair. Stability was quantified by determining the static lateral stability angles and the maximum height of a road curb over which the wheelchair could successfully drive on a diagonal heading. The model predicted that the stability was more dependent on the configuration of the suspension system than on the dimensions and weight distribution of the wheelchair. Furthermore, for the situations and design alterations studied, predicted improvements in static stability were not correlated with improvements in dynamic stability

product develop : use a 3d comput model to optim the stabil of the rocket tm power wheelchair
 a three-dimension ( 3d ) lumped-paramet model of a power wheelchair wa creat to aid the develop of the rocket prototyp wheelchair and to help explor the effect of innov design featur on it stabil . the model wa develop use simul softwar , specif work model 3d. the accuraci of the model wa determin by compar both it static stabil angl and dynam behavior as it pass down a 4.8-cm ( 1.9 " ) road curb at a head of 45 degre with the perform of the actual wheelchair . the model 's predict of the static stabil angl in the forward , rearward , and later direct were within 9.3 , 7.1 , and 3.8 % of the measur valu , respect . the averag absolut error in the predict posit of the wheelchair as it move down the curb wa 2.2 cm / m ( 0.9 " per 3'3 " ) travel . the accuraci wa limit by the inabl to model soft bodi , the inher difficulti in model a static indetermin system , and the comput time . nevertheless , it wa found to be use in investig the effect of eight design alter on the later stabil of the wheelchair . stabil wa quantifi by determin the static later stabil angl and the maximum height of a road curb over which the wheelchair could success drive on a diagon head . the model predict that the stabil wa more depend on the configur of the suspens system than on the dimens and weight distribut of the wheelchair . furthermor , for the situat and design alter studi , predict improv in static stabil were not correl with improv in dynam stabil

product development
3D computer model
Rocket TM powered wheelchair
innovative design features
average absolute error
predicted position
statically indeterminate system
computing time
diagonal heading
weight distribution
suspension system configuration
dynamic stability improvements
soft bodies modeling
design alterations effect
4.8 cm


Natural language from artificial life

Abstract: This article aims to show that linguistics, in particular the study of the lexico-syntactic aspects of language, provides fertile ground for artificial life modeling. A survey of the models that have been developed over the last decade and a half is presented to demonstrate that ALife techniques have a lot to offer an explanatory theory of language. It is argued that this is because much of the structure of language is determined by the interaction of three complex adaptive systems: learning, culture, and biological evolution. Computational simulation, informed by theoretical linguistics, is an appropriate response to the challenge of explaining real linguistic data in terms of the processes that underpin human language

natur languag from artifici life
 thi articl aim to show that linguist , in particular the studi of the lexico-syntact aspect of languag , provid fertil ground for artifici life model . a survey of the model that have been develop over the last decad and a half is present to demonstr that alif techniqu have a lot to offer an explanatori theori of languag . it is argu that thi is becaus much of the structur of languag is determin by the interact of three complex adapt system : learn , cultur , and biolog evolut . comput simul , inform by theoret linguist , is an appropri respons to the challeng of explain real linguist data in term of the process that underpin human languag

natural language
artificial life
linguistics
lexico-syntactic aspects
ALife
adaptive systems
learning
culture
biological evolution
computational simulation


A parallelized indexing method for large-scale case-based reasoning

Abstract: Case-based reasoning (CBR) is a problem solving methodology commonly seen in artificial intelligence. It can correctly take advantage of the situations and methods in former cases to find out suitable solutions for new problems. CBR must accurately retrieve similar prior cases for getting a good performance. In the past, many researchers proposed useful technologies to handle this problem. However, the performance of retrieving similar cases may be greatly influenced by the number of cases. In this paper, the performance issue of large-scale CBR is discussed and a parallelized indexing architecture is then proposed for efficiently retrieving similar cases in large-scale CBR. Several algorithms for implementing the proposed architecture are also described. Some experiments are made and the results show the efficiency of the proposed method

a parallel index method for large-scal case-bas reason
 case-bas reason ( cbr ) is a problem solv methodolog commonli seen in artifici intellig . it can correctli take advantag of the situat and method in former case to find out suitabl solut for new problem . cbr must accur retriev similar prior case for get a good perform . in the past , mani research propos use technolog to handl thi problem . howev , the perform of retriev similar case may be greatli influenc by the number of case . in thi paper , the perform issu of large-scal cbr is discuss and a parallel index architectur is then propos for effici retriev similar case in large-scal cbr . sever algorithm for implement the propos architectur are also describ . some experi are made and the result show the effici of the propos method

parallelized indexing method
large-scale case-based reasoning
problem solving methodology
artificial intelligence
performance
experiments
bitwise indexing
similar prior case retrieval


Property testers for dense Constraint Satisfaction programs on finite domains

Abstract: Many NP-hard languages can be "decided" in subexponential time if the definition of "decide" is relaxed only slightly. Rubinfeld and Sudan introduced the notion of property testers, probabilistic algorithms that can decide, with high probability, if a function has a certain property or if it is far from any function having this property. Goldreich, Goldwasser, and Ron constructed property testers with constant query complexity for dense instances of a large class of graph problems. Since many graph problems can be viewed as special cases of the Constraint Satisfaction Problem on Boolean domains, it is natural to try to construct property testers for more general cases of the Constraint Satisfaction Problem. In this paper, we give explicit constructions of property testers using a constant number of queries for dense instances of Constraint Satisfaction Problems where the constraints have constant arity and the variables assume values in some domain of finite size

properti tester for dens constraint satisfact program on finit domain
 mani np-hard languag can be " decid " in subexponenti time if the definit of " decid " is relax onli slightli . rubinfeld and sudan introduc the notion of properti tester , probabilist algorithm that can decid , with high probabl , if a function ha a certain properti or if it is far from ani function have thi properti . goldreich , goldwass , and ron construct properti tester with constant queri complex for dens instanc of a larg class of graph problem . sinc mani graph problem can be view as special case of the constraint satisfact problem on boolean domain , it is natur to tri to construct properti tester for more gener case of the constraint satisfact problem . in thi paper , we give explicit construct of properti tester use a constant number of queri for dens instanc of constraint satisfact problem where the constraint have constant ariti and the variabl assum valu in some domain of finit size

property testers
constraint satisfaction
NP-hard languages
subexponential time
probabilistic algorithms
constant query complexity
dense instances
graph problems
Constraint Satisfaction Problem
randomized sampling


Multiple comparison methods for means

Abstract: Multiple comparison methods (MCMs) are used to investigate differences between pairs of population means or, more generally, between subsets of population means using sample data. Although several such methods are commonly available in statistical software packages, users may be poorly informed about the appropriate method(s) to use and/or the correct way to interpret the results. This paper classifies the MCMs and presents the important methods for each class. Both simulated and real data are used to compare the methods, and emphasis is placed on a correct application and interpretation. We include suggestions for choosing the best method. Mathematica programs developed by the authors are used to compare MCMs. By taking the advantage of Mathematica's notebook structure, all interested student can use these programs to explore the subject more deeply

multipl comparison method for mean
 multipl comparison method ( mcm ) are use to investig differ between pair of popul mean or , more gener , between subset of popul mean use sampl data . although sever such method are commonli avail in statist softwar packag , user may be poorli inform about the appropri method( ) to use and/or the correct way to interpret the result . thi paper classifi the mcm and present the import method for each class . both simul and real data are use to compar the method , and emphasi is place on a correct applic and interpret . we includ suggest for choos the best method . mathematica program develop by the author are use to compar mcm . by take the advantag of mathematica 's notebook structur , all interest student can use these program to explor the subject more deepli

population means
multiple comparison procedures
error rate
single-step procedures
step-down procedures
sales management
pack-age design


Convergence of finite element approximations and multilevel linearization for Ginzburg-Landau model of d-wave superconductors

Abstract: In this paper, we consider the finite element approximations of a recently proposed Ginzburg-Landau-type model for d-wave superconductors. In contrast to the conventional Ginzburg-Landau model the scalar complex valued order-parameter is replaced by a multicomponent complex order-parameter and the free energy is modified according to the d-wave paring symmetry. Convergence and optimal error estimates and some super-convergent estimates for the derivatives are derived. Furthermore, we propose a multilevel linearization procedure to solve the nonlinear systems. It is proved that the optimal error estimates and super-convergence for the derivatives are preserved by the multi-level linearization algorithm

converg of finit element approxim and multilevel linear for ginzburg-landau model of d-wave superconductor
 in thi paper , we consid the finit element approxim of a recent propos ginzburg-landau-typ model for d-wave superconductor . in contrast to the convent ginzburg-landau model the scalar complex valu order-paramet is replac by a multicompon complex order-paramet and the free energi is modifi accord to the d-wave pare symmetri . converg and optim error estim and some super-converg estim for the deriv are deriv . furthermor , we propos a multilevel linear procedur to solv the nonlinear system . it is prove that the optim error estim and super-converg for the deriv are preserv by the multi-level linear algorithm

multilevel linearization
Ginzburg-Landau model
d-wave
free energy
error estimation
nonlinear systems
superconductivity
finite element method
two-grid method


Supply chain optimisation in the paper industry

Abstract: We describe the formulation and development of a supply-chain optimisation model for Fletcher Challenge Paper Australasia (FCPA). This model, known as the paper industry value optimisation tool (PIVOT), is a large mixed integer program that finds an optimal allocation of supplier to mill, product to paper machine, and paper machine to customer, while at the same time modelling many of the supply chain details and nuances which are peculiar to FCPA. PIVOT has assisted FCPA in solving a number of strategic and tactical decision problems, and provided significant economic benefits for the company

suppli chain optimis in the paper industri
 we describ the formul and develop of a supply-chain optimis model for fletcher challeng paper australasia ( fcpa ) . thi model , known as the paper industri valu optimis tool ( pivot ) , is a larg mix integ program that find an optim alloc of supplier to mill , product to paper machin , and paper machin to custom , while at the same time model mani of the suppli chain detail and nuanc which are peculiar to fcpa . pivot ha assist fcpa in solv a number of strateg and tactic decis problem , and provid signific econom benefit for the compani

supply chain optimisation
Fletcher Challenge Paper Australasia
paper industry value optimisation tool
PIVOT
large mixed integer program
optimal allocation
tactical decision problems
economic benefits
strategic decision problems


Social presence in telemedicine

Abstract: We studied consultations between a doctor, emergency nurse practitioners (ENPs) and their patients in a minor accident and treatment service (MATS). In the conventional consultations, all three people were located at the main hospital. In the teleconsultations, the doctor was located in a hospital 6 km away from the MATS and used a videoconferencing link connected at 384 kbit/s. There were 30 patients in the conventional group and 30 in the telemedical group. The presenting problems were similar in the two groups. The mean duration of teleconsultations was 951 s and the mean duration of face-to-face consultations was 247 s. In doctor-nurse communication there was a higher rate of turn taking in teleconsultations than in face-to-face consultations; there were also more interruptions, more words and more `backchannels' (e.g. `mhm', `uh-huh') per teleconsultation. In doctor-patient communication there was a higher rate of turn taking, more words, more interruptions and more backchannels per teleconsultation. In patient-nurse communication there was. relatively little difference between the two modes of consulting the doctor. Telemedicine appeared to empower the patient to ask more questions of the doctor. It also seemed that the doctor took greater care in a teleconsultation to achieve coordination of beliefs with the patient than in a face-to-face consultation

social presenc in telemedicin
 we studi consult between a doctor , emerg nurs practition ( enp ) and their patient in a minor accid and treatment servic ( mat ) . in the convent consult , all three peopl were locat at the main hospit . in the teleconsult , the doctor wa locat in a hospit 6 km away from the mat and use a videoconferenc link connect at 384 kbit / s. there were 30 patient in the convent group and 30 in the telemed group . the present problem were similar in the two group . the mean durat of teleconsult wa 951 s and the mean durat of face-to-fac consult wa 247 s. in doctor-nurs commun there wa a higher rate of turn take in teleconsult than in face-to-fac consult ; there were also more interrupt , more word and more ` backchannel ' ( e.g. ` mhm ' , ` uh-huh ' ) per teleconsult . in doctor-pati commun there wa a higher rate of turn take , more word , more interrupt and more backchannel per teleconsult . in patient-nurs commun there wa . rel littl differ between the two mode of consult the doctor . telemedicin appear to empow the patient to ask more question of the doctor . it also seem that the doctor took greater care in a teleconsult to achiev coordin of belief with the patient than in a face-to-fac consult

social presence
telemedicine
doctor
emergency nurse practitioners
patients
minor accident and treatment service
teleconsultations
videoconferencing link
951 s
face-to-face consultations
doctor-nurse communication
turn taking
interruptions
words
backchannels
patient-nurse communication
belief coordination
384 kbit/s
247 s


A work journal [librarianship]

Abstract: Keeping a work journal can be useful in exploring one's thoughts and feelings about work challenges and work decisions. It can help bring about greater fulfillment in one's work life by facilitating self-renewal, change, the search for new meaning, and job satisfaction. One example of a work journal which I kept in 1998 is considered. It touches on several issues of potential interest to midlife career librarians including the challenge of technology, returning to work at midlife after raising a family, further education, professional writing, and job exchange

a work journal [ librarianship ]
 keep a work journal can be use in explor one 's thought and feel about work challeng and work decis . it can help bring about greater fulfil in one 's work life by facilit self-renew , chang , the search for new mean , and job satisfact . one exampl of a work journal which i kept in 1998 is consid . it touch on sever issu of potenti interest to midlif career librarian includ the challeng of technolog , return to work at midlif after rais a famili , further educ , profession write , and job exchang

work journal
work challenges
work decisions
self-renewal
change
job satisfaction
midlife career librarians
technology
further education
professional writing
job exchange


Hit the road, Jack

Abstract: Going freelance offers the potential of higher earnings, variety and independence - but also removes the benefits of permanent employment and can mean long distance travel and periods out of work. The author looks at the benefits and drawbacks - and how to get started as an IT contractor

hit the road , jack
 go freelanc offer the potenti of higher earn , varieti and independ - but also remov the benefit of perman employ and can mean long distanc travel and period out of work . the author look at the benefit and drawback - and how to get start as an it contractor


Dousing terrorist funding: mission possible? [banks]

Abstract: The government is tightening its grip on terrorist money flows. But as the banking industry continues to expand its Patriot Act compliance activities, it is with the realization that a great deal of work remains to be done before the American financial system can become truly airtight. Identification instruments, especially drivers licenses, represent a significant weak spot

dous terrorist fund : mission possibl ? [ bank ]
 the govern is tighten it grip on terrorist money flow . but as the bank industri continu to expand it patriot act complianc activ , it is with the realiz that a great deal of work remain to be done befor the american financi system can becom truli airtight . identif instrument , especi driver licens , repres a signific weak spot

terrorist funding
banking
Patriot Act
identification


Relation between glare and driving performance

Abstract: The present study investigated the effects of discomfort glare on driving behavior. Participants (old and young; US and Europeans) were exposed to a simulated low- beam light source mounted on the hood of an instrumented vehicle. Participants drove at night in actual traffic along a track consisting of urban, rural, and highway stretches. The results show that the relatively low glare source caused a significant drop in detecting simulated pedestrians along the roadside and made participants drive significantly slower on dark and winding roads. Older participants showed the largest drop in pedestrian detection performance and reduced their driving speed the most. The results indicate that the de Boer rating scale, the most commonly used rating scale for discomfort glare, is practically useless as a predictor of driving performance. Furthermore, the maximum US headlamp intensity (1380 cd per headlamp) appears to be an acceptable upper limit

relat between glare and drive perform
 the present studi investig the effect of discomfort glare on drive behavior . particip ( old and young ; us and european ) were expos to a simul low- beam light sourc mount on the hood of an instrument vehicl . particip drove at night in actual traffic along a track consist of urban , rural , and highway stretch . the result show that the rel low glare sourc caus a signific drop in detect simul pedestrian along the roadsid and made particip drive significantli slower on dark and wind road . older particip show the largest drop in pedestrian detect perform and reduc their drive speed the most . the result indic that the de boer rate scale , the most commonli use rate scale for discomfort glare , is practic useless as a predictor of drive perform . furthermor , the maximum us headlamp intens ( 1380 cd per headlamp ) appear to be an accept upper limit

glare
driving performance
discomfort glare
highway
simulated low-beam light source
road traffic
urban road
rural road
deBoer rating scale


A geometric process equivalent model for a multistate degenerative system

Abstract: In this paper, a monotone process model for a one-component degenerative system with k+1 states (k failure states and one working state) is studied. We show that this model is equivalent to a geometric process (GP) model for a two-state one component system such that both systems have the same long-run average cost per unit time and the same optimal policy. Furthermore, an explicit expression for the determination of an optimal policy is derived

a geometr process equival model for a multist degen system
 in thi paper , a monoton process model for a one-compon degen system with k+1 state ( k failur state and one work state ) is studi . we show that thi model is equival to a geometr process ( gp ) model for a two-stat one compon system such that both system have the same long-run averag cost per unit time and the same optim polici . furthermor , an explicit express for the determin of an optim polici is deriv

geometric process equivalent model
multistate degenerative system
monotone process model
one-component degenerative system
failure states
working state
two-state one component system
long-run average cost
optimal policy
replacement policy
renewal reward process


Predictive control of a high temperature-short time pasteurisation process

Abstract: Modifications on the dynamic matrix control (DMC) algorithm are presented to deal with transfer functions with varying parameters in order to control a high temperature-short time pasteurisation process. To control processes with first order with pure time delay models whose parameters present an exogenous variable dependence, a new method of free response calculation, using multiple model information, is developed. Two methods, to cope with those nonlinear models that allow a generalised Hammerstein model description, are proposed. The proposed methods have been tested, both in simulation and in real cases, in comparison with PID and DMC classic controllers, showing important improvements on reference tracking and disturbance rejection

predict control of a high temperature-short time pasteuris process
 modif on the dynam matrix control ( dmc ) algorithm are present to deal with transfer function with vari paramet in order to control a high temperature-short time pasteuris process . to control process with first order with pure time delay model whose paramet present an exogen variabl depend , a new method of free respons calcul , use multipl model inform , is develop . two method , to cope with those nonlinear model that allow a generalis hammerstein model descript , are propos . the propos method have been test , both in simul and in real case , in comparison with pid and dmc classic control , show import improv on refer track and disturb reject


Mathematical modelling of the work of the system of wells in a layer with the exponential law of permeability variation and the mobile liquid interface

Abstract: We construct and study a two-dimensional model of the work of the system of wells in a layer with the mobile boundary between liquids of various viscosity. We use a 'plunger' displacement model of liquids. The boundaries of the filtration region of these liquids are modelled by curves of the Lyapunov class. Unlike familiar work, we solve two-dimensonal problems in an inhomogeneous layer when the mobile boundary and the boundaries of the filtration region are modelled by curves of the Lyapunov class. We show the practical convergence of the numerical solution of the problems studied

mathemat model of the work of the system of well in a layer with the exponenti law of permeabl variat and the mobil liquid interfac
 we construct and studi a two-dimension model of the work of the system of well in a layer with the mobil boundari between liquid of variou viscos . we use a ' plunger ' displac model of liquid . the boundari of the filtrat region of these liquid are model by curv of the lyapunov class . unlik familiar work , we solv two-dimenson problem in an inhomogen layer when the mobil boundari and the boundari of the filtrat region are model by curv of the lyapunov class . we show the practic converg of the numer solut of the problem studi

mathematical modelling
work
exponential law
permeability variation
mobile liquid interface
mobile boundary
viscosity
inhomogeneous layer
convergence
numerical solution
2D model
well system
plunger displacement model
filtration region boundaries
Lyapunov class curves


Non-asymptotic confidence ellipsoids for the least-squares estimate

Abstract: We consider the finite sample properties of least-squares system identification, and derive non-asymptotic confidence ellipsoids for the estimate. The shape of the confidence ellipsoids is similar to the shape of the ellipsoids derived using asymptotic theory, but unlike asymptotic theory, they are valid for a finite number of data points. The probability that the estimate belongs to a certain ellipsoid has a natural dependence on the volume of the ellipsoid, the data generating mechanism, the model order and the number of data points available

non-asymptot confid ellipsoid for the least-squar estim
 we consid the finit sampl properti of least-squar system identif , and deriv non-asymptot confid ellipsoid for the estim . the shape of the confid ellipsoid is similar to the shape of the ellipsoid deriv use asymptot theori , but unlik asymptot theori , they are valid for a finit number of data point . the probabl that the estim belong to a certain ellipsoid ha a natur depend on the volum of the ellipsoid , the data gener mechan , the model order and the number of data point avail

least-squares estimate
finite sample properties
least-squares system identification
data points
probability
data generating mechanism
model order
nonasymptotic confidence ellipsoids


A dynamic method for weighted linear least squares problems

Abstract: A new method for solving the weighted linear least squares problems with full rank is proposed. Based on the theory of Liapunov's stability, the method associates a dynamic system with a weighted linear least squares problem, whose solution we are interested in and integrates the former numerically by an A-stable numerical method. The numerical tests suggest that the new method is more than comparative with current conventional techniques based on the normal equations

a dynam method for weight linear least squar problem
 a new method for solv the weight linear least squar problem with full rank is propos . base on the theori of liapunov 's stabil , the method associ a dynam system with a weight linear least squar problem , whose solut we are interest in and integr the former numer by an a-stabl numer method . the numer test suggest that the new method is more than compar with current convent techniqu base on the normal equat

dynamic method
weighted linear least squares problems
A-stable numerical method
Lyapunov stability


Information-processing and computing systems at thermal power stations in China

Abstract: The development and commissioning of information-processing and computing systems (IPCSs) at four power units, each of 500 MW capacity at the thermal power stations Tszisyan' and Imin' in China, are considered. The functional structure and the characteristics of the functions of the IPCSs are presented as is information on the technology of development and experience in adjustments. Ways of using the experience gained in creating a comprehensive functional firmware system are shown

information-process and comput system at thermal power station in china
 the develop and commiss of information-process and comput system ( ipcss ) at four power unit , each of 500 mw capac at the thermal power station tszisyan ' and imin ' in china , are consid . the function structur and the characterist of the function of the ipcss are present as is inform on the technolog of develop and experi in adjust . way of use the experi gain in creat a comprehens function firmwar system are shown

computing systems
thermal power stations
China
development
commissioning
500 MW
functional structure
firmware system
information-processing systems
functions characteristics


A characterization of generalized Pareto distributions by progressive censoring schemes and goodness-of-fit tests

Abstract: In this paper we generalize a characterization property of generalized Pareto distributions, which is known for ordinary order statistics, to arbitrary schemes of progressive type-II censored order statistics. Various goodness-of-fit tests for generalized Pareto distributions based on progressively censored data statistics are discussed

a character of gener pareto distribut by progress censor scheme and goodness-of-fit test
 in thi paper we gener a character properti of gener pareto distribut , which is known for ordinari order statist , to arbitrari scheme of progress type-ii censor order statist . variou goodness-of-fit test for gener pareto distribut base on progress censor data statist are discuss


Linear complexity of polyphase power residue sequences

Abstract: The well known family of binary Legendre or quadratic residue sequences can be generalised to the multiple-valued case by employing a polyphase representation. These p-phase sequences, with p prime, also have prime length L, and can be constructed from the index sequence of length L or, equivalently, from the cosets of pth power residues and non-residues modulo-L. The linear complexity of these polyphase sequences is derived and shown to fall into four classes depending on the value assigned to b/sub 0/, the initial digit of the sequence, and on whether p belongs to the set of pth power residues or not. The characteristic polynomials of the linear feedback shift registers that generate these sequences are also derived

linear complex of polyphas power residu sequenc
 the well known famili of binari legendr or quadrat residu sequenc can be generalis to the multiple-valu case by employ a polyphas represent . these p-phase sequenc , with p prime , also have prime length l , and can be construct from the index sequenc of length l or , equival , from the coset of pth power residu and non-residu modulo-l. the linear complex of these polyphas sequenc is deriv and shown to fall into four class depend on the valu assign to b / sub 0/ , the initi digit of the sequenc , and on whether p belong to the set of pth power residu or not . the characterist polynomi of the linear feedback shift regist that gener these sequenc are also deriv

linear complexity
polyphase power residue sequences
quadratic residue sequences
multiple-valued case
p-phase sequences
polynomials
linear feedback shift registers
binary Legendre sequences
cryptographic applications
key stream ciphers
binary sequences


Evaluation of videoconferenced grand rounds

Abstract: We evaluated various aspects of grand rounds videoconferenced from a tertiary care hospital to a regional hospital in Nova Scotia. During a five-month study period, 29 rounds were broadcast (19 in medicine and 10 in cardiology). The total recorded attendance at the remote site was 103, comprising 70 specialists, nine family physicians and 24 other health-care professionals. We received 55 evaluations, a response rate of 53%. On a five-point Likert scale (on which higher scores indicated better quality), mean ratings by remote-site participants of the technical quality of the videoconference were 3.0-3.5, with the lowest ratings being for ability to hear the discussion (3.0) and to see visual aids (3.1). Mean ratings for content, presentation, discussion and educational value were 3.8 or higher. Of the 49 physicians who presented the rounds, we received evaluations from 41, a response rate of 84%. The presenters rated all aspects of the videoconference and interaction with remote sites at 3.8 or lower. The lowest ratings were for ability to see the remote sites (3.0) and the usefulness of the discussion (3.4). We received 278 evaluations from participants at the presenting site, an estimated response rate of about 55%. The results indicated no adverse opinions of the effect of videoconferencing (mean scores 3.1-3.3). The estimated costs of videoconferencing one grand round to one site and four sites were C$723 and C$1515, respectively. The study confirmed that videoconferenced rounds can provide satisfactory continuing medical education to community specialists, which is an especially important consideration as maintenance of certification becomes mandatory

evalu of videoconferenc grand round
 we evalu variou aspect of grand round videoconferenc from a tertiari care hospit to a region hospit in nova scotia . dure a five-month studi period , 29 round were broadcast ( 19 in medicin and 10 in cardiolog ) . the total record attend at the remot site wa 103 , compris 70 specialist , nine famili physician and 24 other health-car profession . we receiv 55 evalu , a respons rate of 53 % . on a five-point likert scale ( on which higher score indic better qualiti ) , mean rate by remote-sit particip of the technic qualiti of the videoconfer were 3.0 - 3.5 , with the lowest rate be for abil to hear the discuss ( 3.0 ) and to see visual aid ( 3.1 ) . mean rate for content , present , discuss and educ valu were 3.8 or higher . of the 49 physician who present the round , we receiv evalu from 41 , a respons rate of 84 % . the present rate all aspect of the videoconfer and interact with remot site at 3.8 or lower . the lowest rate were for abil to see the remot site ( 3.0 ) and the use of the discuss ( 3.4 ) . we receiv 278 evalu from particip at the present site , an estim respons rate of about 55 % . the result indic no advers opinion of the effect of videoconferenc ( mean score 3.1 - 3.3 ) . the estim cost of videoconferenc one grand round to one site and four site were c$ 723 and c$ 1515 , respect . the studi confirm that videoconferenc round can provid satisfactori continu medic educ to commun specialist , which is an especi import consider as mainten of certif becom mandatori

videoconferenced grand rounds
tertiary care hospital
regional hospital
cardiology
remote sites
health-care professionals
five-point Likert scale
continuing medical education
certification
telemedicine


Semantic B2B integration: issues in ontology-based approaches

Abstract: Solving queries to support e-commerce transactions can involve retrieving and integrating information from multiple information resources. Often, users don't care which resources are used to answer their query. In such situations, the ideal solution would be to hide from the user the details of the resources involved in solving a particular query. An example would be providing seamless access to a set of heterogeneous electronic product catalogues. There are many problems that must be addressed before such a solution can be provided. In this paper, we discuss a number of these problems, indicate how we have addressed these and go on to describe the proof-of-concept demonstration system we have developed

semant b2b integr : issu in ontology-bas approach
 solv queri to support e-commerc transact can involv retriev and integr inform from multipl inform resourc . often , user do n't care which resourc are use to answer their queri . in such situat , the ideal solut would be to hide from the user the detail of the resourc involv in solv a particular queri . an exampl would be provid seamless access to a set of heterogen electron product catalogu . there are mani problem that must be address befor such a solut can be provid . in thi paper , we discuss a number of these problem , indic how we have address these and go on to describ the proof-of-concept demonstr system we have develop


Copyright of electronic publishing

Abstract: With the spreading of the Internet and the wide use of computers, electronic publishing is becoming an indispensable measure to gain knowledge and skills. Meanwhile, copyright is facing much more infringement than ever in this electronic environment. So, it is a key factor to effectively protect copyright of electronic publishing to foster the new publication fields. The paper analyzes the importance of copyright, the main causes for copyright infringement in electronic publishing, and presents viewpoints on the definition and application of fair use of a copyrighted work and thinking of some means to combat breach of copyright

copyright of electron publish
 with the spread of the internet and the wide use of comput , electron publish is becom an indispens measur to gain knowledg and skill . meanwhil , copyright is face much more infring than ever in thi electron environ . so , it is a key factor to effect protect copyright of electron publish to foster the new public field . the paper analyz the import of copyright , the main caus for copyright infring in electron publish , and present viewpoint on the definit and applic of fair use of a copyright work and think of some mean to combat breach of copyright

Internet
electronic environment
copyright infringement
fair use
copyrighted work
electronic publishing copyright
copyright protection


Generic simulation approach for multi-axis machining. Part 1: modeling methodology

Abstract: This paper presents a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces. A generalized approach is developed for representing an arbitrary cutting edge design, and the local surface topology of a complex sculptured surface. A NURBS curve is used to represent the cutting edge profile. This approach offers the advantages of representing any arbitrary cutting edge design in a generic way, as well as providing standardized techniques for manipulating the location and orientation of the cutting edge. The local surface topology of the part is defined as those surfaces generated by previous tool paths in the vicinity of the current tool position. The local surface topology of the part is represented without using a computationally expensive CAD system. A systematic prediction technique is then developed to determine the instantaneous tool/part interaction during machining. The methodology employed here determines the cutting edge in-cut segments by determining the intersection between the NURBS curve representation of the cutting edge and the defined local surface topology. These in-cut segments are then utilized for predicting instantaneous chip load, static and dynamic cutting forces, and tool deflection. Part 1 of this paper details the modeling methodology and demonstrates the capabilities of the simulation for machining a complex surface

gener simul approach for multi-axi machin . part 1 : model methodolog
 thi paper present a new methodolog for analyt simul multi-axi machin of complex sculptur surfac . a gener approach is develop for repres an arbitrari cut edg design , and the local surfac topolog of a complex sculptur surfac . a nurb curv is use to repres the cut edg profil . thi approach offer the advantag of repres ani arbitrari cut edg design in a gener way , as well as provid standard techniqu for manipul the locat and orient of the cut edg . the local surfac topolog of the part is defin as those surfac gener by previou tool path in the vicin of the current tool posit . the local surfac topolog of the part is repres without use a comput expens cad system . a systemat predict techniqu is then develop to determin the instantan tool / part interact dure machin . the methodolog employ here determin the cut edg in-cut segment by determin the intersect between the nurb curv represent of the cut edg and the defin local surfac topolog . these in-cut segment are then util for predict instantan chip load , static and dynam cut forc , and tool deflect . part 1 of thi paper detail the model methodolog and demonstr the capabl of the simul for machin a complex surfac

complex sculptured surfaces
surface topology
NURBS curve
cutting edge profile
systematic prediction
multiple axis machining
generic modeling
tool path specification
complex surface machining


The simulated emergence of distributed environmental control in evolving microcosms

Abstract: This work continues investigation into Gaia theory (Lovelock, The ages of Gaia, Oxford University Press, 1995) from an artificial life perspective (Downing, Proceedings of the 7th International Conference on Artificial Life, p. 90-99, MIT Press, 2000), with the aim of assessing the general compatibility of emergent distributed environmental control with conventional natural selection. Our earlier system, GUILD (Downing and Zvirinsky, Artificial Life, 5, p.291-318, 1999), displayed emergent regulation of the chemical environment by a population of metabolizing agents, but the chemical model underlying those results was trivial, essentially admitting all possible reactions at a single energy cost. The new model, METAMIC, utilizes abstract chemistries that are both (a) constrained to a small set of legal reactions, and (b) grounded in basic fundamental relationships between energy, entropy, and biomass synthesis/breakdown. To explore the general phenomena of emergent homeostasis, we generate 100 different chemistries and use each as the basis for several METAMIC runs, as part of a Gaia hunt. This search discovers 20 chemistries that support microbial populations capable of regulating a physical environmental factor within their growth-optimal range, despite the extra metabolic cost. Case studies from the Gaia hunt illustrate a few simple mechanisms by which real biota might exploit the underlying chemistry to achieve some control over their physical environment. Although these results shed little light on the question of Gaia on Earth, they support the possibility of emergent environmental control at the microcosmic level

the simul emerg of distribut environment control in evolv microcosm
 thi work continu investig into gaia theori ( lovelock , the age of gaia , oxford univers press , 1995 ) from an artifici life perspect ( down , proceed of the 7th intern confer on artifici life , p. 90 - 99 , mit press , 2000 ) , with the aim of assess the gener compat of emerg distribut environment control with convent natur select . our earlier system , guild ( down and zvirinski , artifici life , 5 , p.291 - 318 , 1999 ) , display emerg regul of the chemic environ by a popul of metabol agent , but the chemic model underli those result wa trivial , essenti admit all possibl reaction at a singl energi cost . the new model , metam , util abstract chemistri that are both ( a ) constrain to a small set of legal reaction , and ( b ) ground in basic fundament relationship between energi , entropi , and biomass synthesi / breakdown . to explor the gener phenomena of emerg homeostasi , we gener 100 differ chemistri and use each as the basi for sever metam run , as part of a gaia hunt . thi search discov 20 chemistri that support microbi popul capabl of regul a physic environment factor within their growth-optim rang , despit the extra metabol cost . case studi from the gaia hunt illustr a few simpl mechan by which real biota might exploit the underli chemistri to achiev some control over their physic environ . although these result shed littl light on the question of gaia on earth , they support the possibl of emerg environment control at the microcosm level


Electronic books: reports of their death have been exaggerated

Abstract: E-books will survive, but not in the consumer market - at least not until reading devices become much cheaper and much better in quality (which is not likely to happen soon). Library Journal's review of major events of the year 2001 noted that two requirements for the success of E-books were development of a sustainable business model and development of better reading devices. The E-book revolution has therefore become more of an evolution. We can look forward to further developments and advances in the future

electron book : report of their death have been exagger
 e-book will surviv , but not in the consum market - at least not until read devic becom much cheaper and much better in qualiti ( which is not like to happen soon ) . librari journal 's review of major event of the year 2001 note that two requir for the success of e-book were develop of a sustain busi model and develop of better read devic . the e-book revolut ha therefor becom more of an evolut . we can look forward to further develop and advanc in the futur

electronic books
E-books
Library Journal


Simple...But complex

Abstract: FlexPro 5.0, from Weisang and Co., is one of those products which aim to serve an often ignored range of data users: those who, in FlexPro's words, are interested in documenting, analysing and archiving data in the simplest way possible. The online help system is clearly designed to promote the product in this market segment, with a very clear introduction from first principles and a hands-on tutorial, and the live project to which it was applied was selected with this in mind

simpl ... but complex
 flexpro 5.0 , from weisang and co. , is one of those product which aim to serv an often ignor rang of data user : those who , in flexpro 's word , are interest in document , analys and archiv data in the simplest way possibl . the onlin help system is clearli design to promot the product in thi market segment , with a veri clear introduct from first principl and a hands-on tutori , and the live project to which it wa appli wa select with thi in mind

FlexPro 5.0
online help system
hands-on tutorial
data archiving
data analysis
data documentation


An integrated optimization model for train crew management

Abstract: Train crew management involves the development of a duty timetable for each of the drivers (crew) to cover a given train timetable in a rail transport organization. This duty timetable is spread over a certain period, known as the roster planning horizon. Train crew management may arise either from the planning stage, when the total number of crew and crew distributions are to be determined, or from the operating stage when the number of crew at each depot is known as input data. In this paper, we are interested in train crew management in the planning stage. In the literature, train crew management is decomposed into two stages: crew scheduling and crew rostering which are solved sequentially. We propose an integrated optimization model to solve both crew scheduling and crew rostering. The model enables us to generate either cyclic rosters or non-cyclic rosters. Numerical experiments are carried out over data sets arising from a practical application

an integr optim model for train crew manag
 train crew manag involv the develop of a duti timet for each of the driver ( crew ) to cover a given train timet in a rail transport organ . thi duti timet is spread over a certain period , known as the roster plan horizon . train crew manag may aris either from the plan stage , when the total number of crew and crew distribut are to be determin , or from the oper stage when the number of crew at each depot is known as input data . in thi paper , we are interest in train crew manag in the plan stage . in the literatur , train crew manag is decompos into two stage : crew schedul and crew roster which are solv sequenti . we propos an integr optim model to solv both crew schedul and crew roster . the model enabl us to gener either cyclic roster or non-cycl roster . numer experi are carri out over data set aris from a practic applic

integrated optimization model
train crew management
duty timetable
rail transport organization
roster planning horizon
crew scheduling
crew rostering
cyclic rosters
noncyclic rosters
integer programming


Database technology in digital libraries

Abstract: Database technology advancements have provided many opportunities for libraries. These advancements can bring the world closer together through information accessibility. Digital library projects have been established worldwide to, ultimately, fulfil the needs of end users through more efficiency and convenience. Resource sharing will continue to be the trend for libraries. Changes often create issues which need to be addressed. Issues relating to database technology and digital libraries are reviewed. Some of the major challenges in digital libraries and managerial issues are identified as well

databas technolog in digit librari
 databas technolog advanc have provid mani opportun for librari . these advanc can bring the world closer togeth through inform access . digit librari project have been establish worldwid to , ultim , fulfil the need of end user through more effici and conveni . resourc share will continu to be the trend for librari . chang often creat issu which need to be address . issu relat to databas technolog and digit librari are review . some of the major challeng in digit librari and manageri issu are identifi as well

database technology
digital libraries
information accessibility
digital library projects
end users
resource sharing
managerial issues
data quality
interoperability
metadata
user interface
query processing


Least load dispatching algorithm for parallel Web server nodes

Abstract: A least load dispatching algorithm for distributing requests to parallel Web server nodes is described. In this algorithm, the load offered to a node by a request is estimated based on the expected transfer time of the corresponding reply through the Internet. This loading information is then used by the algorithm to identify the least load node of the Web site. By using this algorithm, each request will always be sent for service at the earliest possible time. Performance comparison using NASA and ClarkNet access logs between the proposed algorithm and commonly used dispatching algorithms is performed. The results show that the proposed algorithm gives 10% higher throughput than that of the commonly used random and round-robin dispatching algorithms

least load dispatch algorithm for parallel web server node
 a least load dispatch algorithm for distribut request to parallel web server node is describ . in thi algorithm , the load offer to a node by a request is estim base on the expect transfer time of the correspond repli through the internet . thi load inform is then use by the algorithm to identifi the least load node of the web site . by use thi algorithm , each request will alway be sent for servic at the earliest possibl time . perform comparison use nasa and clarknet access log between the propos algorithm and commonli use dispatch algorithm is perform . the result show that the propos algorithm give 10 % higher throughput than that of the commonli use random and round-robin dispatch algorithm

least load dispatching algorithm
parallel Web server nodes
transfer time
Internet
ClarkNet access logs
throughput
round-robin dispatching algorithms
NASA access logs
random dispatching algorithms
World Wide Web server


Research into telehealth applications in speech-language pathology

Abstract: A literature review was conducted to investigate the extent to which telehealth has been researched within the domain of speech-language pathology and the outcomes of this research. A total of 13 studies were identified. Three early studies demonstrated that telehealth was feasible, although there was no discussion of the cost-effectiveness of this process in terms of patient outcomes. The majority of the subsequent studies indicated positive or encouraging outcomes resulting from telehealth. However, there were a number of shortcomings in the research, including a lack of cost-benefit information, failure to evaluate the technology itself, an absence of studies of the educational and informational aspects of telehealth in relation to speech-language pathology, and the use of telehealth in a limited range of communication disorders. Future research into the application of telehealth to speech-language pathology services must adopt a scientific approach, and have a well defined development and evaluation framework that addresses the effectiveness of the technique, patient outcomes and satisfaction, and the cost-benefit relationship

research into telehealth applic in speech-languag patholog
 a literatur review wa conduct to investig the extent to which telehealth ha been research within the domain of speech-languag patholog and the outcom of thi research . a total of 13 studi were identifi . three earli studi demonstr that telehealth wa feasibl , although there wa no discuss of the cost-effect of thi process in term of patient outcom . the major of the subsequ studi indic posit or encourag outcom result from telehealth . howev , there were a number of shortcom in the research , includ a lack of cost-benefit inform , failur to evalu the technolog itself , an absenc of studi of the educ and inform aspect of telehealth in relat to speech-languag patholog , and the use of telehealth in a limit rang of commun disord . futur research into the applic of telehealth to speech-languag patholog servic must adopt a scientif approach , and have a well defin develop and evalu framework that address the effect of the techniqu , patient outcom and satisfact , and the cost-benefit relationship

telehealth applications
speech-language pathology
literature review
cost-effectiveness
patient outcomes
communication disorders
telemedicine
cost-benefit analysis
patient satisfaction


A multi-agent system infrastructure for software component marketplace: an ontological perspective

Abstract: In this paper, we introduce a multi-agent system architecture and an implemented prototype for a software component marketplace. We emphasize the ontological perspective by discussing ontology modeling for the component marketplace, UML extensions for ontology modeling, and the idea of ontology transfer which makes the multi-agent system adapt itself to dynamically changing ontologies

a multi-ag system infrastructur for softwar compon marketplac : an ontolog perspect
 in thi paper , we introduc a multi-ag system architectur and an implement prototyp for a softwar compon marketplac . we emphas the ontolog perspect by discuss ontolog model for the compon marketplac , uml extens for ontolog model , and the idea of ontolog transfer which make the multi-ag system adapt itself to dynam chang ontolog

software component marketplace
multi-agent system architecture
ontology modeling
UML extensions
ontology transfer
adaptation
dynamically changing ontologies


What's best practice for open access?

Abstract: The business of publishing journals is in transition. Nobody knows exactly how it will work in the future, but everybody knows that the electronic publishing revolution will ensure it won't work as it does now. This knowledge has provoked a growing sense of nervous anticipation among those concerned, some edgy and threatened by potential changes to their business, others excited by the prospect of change and opportunity. The paper discusses the open publishing model for dissemination of research

what 's best practic for open access ?
 the busi of publish journal is in transit . nobodi know exactli how it will work in the futur , but everybodi know that the electron publish revolut will ensur it wo n't work as it doe now . thi knowledg ha provok a grow sens of nervou anticip among those concern , some edgi and threaten by potenti chang to their busi , other excit by the prospect of chang and opportun . the paper discuss the open publish model for dissemin of research

open access
business
electronic publishing
open publishing model
journal publishing
research dissemination


Two issues in setting call centre staffing levels

Abstract: Motivated by a problem facing the Police Communication Centre in Auckland, New Zealand, we consider the setting of staffing levels in a call centre with priority customers. The choice of staffing level over any particular time period (e.g., Monday from 8 am-9 am) relies on accurate arrival rate information. The usual method for identifying the arrival rate based on historical data can, in some cases, lead to considerable errors in performance estimates for a given staffing level. We explain why, identify three potential causes of the difficulty, and describe a method for detecting and addressing such a problem

two issu in set call centr staf level
 motiv by a problem face the polic commun centr in auckland , new zealand , we consid the set of staf level in a call centr with prioriti custom . the choic of staf level over ani particular time period ( e.g. , monday from 8 am-9 am ) reli on accur arriv rate inform . the usual method for identifi the arriv rate base on histor data can , in some case , lead to consider error in perform estim for a given staf level . we explain whi , identifi three potenti caus of the difficulti , and describ a method for detect and address such a problem

call centre staffing levels
police communication centre
Auckland
New Zealand
priority customers
arrival rate information
performance estimates
forecast error
nonstationarity
conditional Poisson process


Connection management for QoS service on the Web

Abstract: The current Web service model treats all requests equivalently, both while being processed by servers and while being transmitted over the network. For some uses, such as multiple priority schemes, different levels of service are desirable. We propose application-level TCP connection management mechanisms for Web servers to provide two different levels of Web service, high and low service, by setting different time-outs for inactive TCP connections. We evaluated the performance of the mechanism under heavy and light loading conditions on the Web server. Our experiments show that, though heavy traffic saturates the network, high level class performance is improved by as much as 25-28%. Therefore, this mechanism can effectively provide QoS guaranteed services even in the absence of operating system and network supports

connect manag for qo servic on the web
 the current web servic model treat all request equival , both while be process by server and while be transmit over the network . for some use , such as multipl prioriti scheme , differ level of servic are desir . we propos application-level tcp connect manag mechan for web server to provid two differ level of web servic , high and low servic , by set differ time-out for inact tcp connect . we evalu the perform of the mechan under heavi and light load condit on the web server . our experi show that , though heavi traffic satur the network , high level class perform is improv by as much as 25 - 28 % . therefor , thi mechan can effect provid qo guarante servic even in the absenc of oper system and network support

connection management
Web service model
TCP connections
time-outs
Internet
quality of service
telecommunication traffic
client server system
Web transaction


Boolean operators and the naive end-user: moving to AND

Abstract: Since so few end-users make use of Boolean searching, it is obvious that any effective solution needs to take this reality into account. The most important aspect of a technical solution should be that it does not require any effort on the part of users. What is clearly needed is for search engine designers and programmers to take account of the information-seeking behavior of Internet users. Users must be able to enter a series of words at random and have those words automatically treated as a carefully constructed Boolean AND search statement

boolean oper and the naiv end-us : move to and
 sinc so few end-us make use of boolean search , it is obviou that ani effect solut need to take thi realiti into account . the most import aspect of a technic solut should be that it doe not requir ani effort on the part of user . what is clearli need is for search engin design and programm to take account of the information-seek behavior of internet user . user must be abl to enter a seri of word at random and have those word automat treat as a care construct boolean and search statement

Boolean operators
Boolean searching
search engine design
information-seeking behavior
Internet
AND operator


An ACL for a dynamic system of agents

Abstract: In this article we present the design of an ACL for a dynamic system of agents. The ACL includes a set of conversation performatives extended with operations to register, create, and terminate agents. The main design goal at the agent-level is to provide only knowledge-level primitives that are well integrated with the dynamic nature of the system. This goal has been achieved by defining an anonymous interaction protocol which enables agents to request and supply knowledge without considering symbol-level issues concerning management of agent names, routing, and agent reachability. This anonymous interaction protocol exploits a distributed facilitator schema which is hidden at the agent-level and provides mechanisms for registering capabilities of agents and delivering requests according to the competence of agents. We present a formal specification of the ACL and of the underlying architecture, exploiting an algebra of actors, and illustrate it with the help of a graphical notation. This approach provides the basis for discussing dynamic primitives in ACL and for studying properties of dynamic multi agent systems, for example concerning the behavior of agents and the correctness of their conversation policies

an acl for a dynam system of agent
 in thi articl we present the design of an acl for a dynam system of agent . the acl includ a set of convers perform extend with oper to regist , creat , and termin agent . the main design goal at the agent-level is to provid onli knowledge-level primit that are well integr with the dynam natur of the system . thi goal ha been achiev by defin an anonym interact protocol which enabl agent to request and suppli knowledg without consid symbol-level issu concern manag of agent name , rout , and agent reachabl . thi anonym interact protocol exploit a distribut facilit schema which is hidden at the agent-level and provid mechan for regist capabl of agent and deliv request accord to the compet of agent . we present a formal specif of the acl and of the underli architectur , exploit an algebra of actor , and illustr it with the help of a graphic notat . thi approach provid the basi for discuss dynam primit in acl and for studi properti of dynam multi agent system , for exampl concern the behavior of agent and the correct of their convers polici

ACL
dynamic system of agents
dynamic system
system of agents
agents
anonymous interaction protocol
distributed facilitator
actors
Agent Communication Languages


On the distribution of Lachlan nonsplitting bases

Abstract: We say that a computably enumerable (c.e.) degree b is a Lachlan nonsplitting base (LNB), if there is a computably enumerable degree a such that a>b, and for any c.e. degrees w, v<or=a, if a<or=wVvV b then either a<or=wV b or a<or=vV b. In this paper we investigate the relationship between bounding and nonbounding of Lachlan nonsplitting bases and the high/low hierarchy. We prove that there is a non-Low/sub 2/ c.e. degree which bounds no Lachlan nonsplitting base

on the distribut of lachlan nonsplit base
 we say that a comput enumer ( c.e . ) degre b is a lachlan nonsplit base ( lnb ) , if there is a comput enumer degre a such that a > b , and for ani c.e . degre w , v < or = a , if a < or = wvvv b then either a < or = wv b or a < or = vv b. in thi paper we investig the relationship between bound and nonbound of lachlan nonsplit base and the high / low hierarchi . we prove that there is a non-low / sub 2/ c.e . degre which bound no lachlan nonsplit base

computably enumerable degree
Lachlan nonsplitting bases distribution
Turing degrees


Non-nested multi-level solvers for finite element discretisations of mixed problems

Abstract: We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconforming type. As a basic new feature. our approach allows to use different finite element discretisations on each level of the multi-grid hierarchy. Thus, in our multi-level approach, accurate higher order finite element discretisations can be combined with fast multi-level solvers based on lower order (nonconforming) finite element discretisations. This leads to the design of efficient multi-level solvers for higher order finite element discretisations

non-nest multi-level solver for finit element discretis of mix problem
 we consid a gener framework for analys the converg of multi-grid solver appli to finit element discretis of mix problem , both of conform and nonconform type . as a basic new featur . our approach allow to use differ finit element discretis on each level of the multi-grid hierarchi . thu , in our multi-level approach , accur higher order finit element discretis can be combin with fast multi-level solver base on lower order ( nonconform ) finit element discretis . thi lead to the design of effici multi-level solver for higher order finit element discretis


Responding to market trends with predictive segmentation [health care]

Abstract: Technology and technological advances have always been a part of healthcare, but often it's advances in treatment machinery and materials that get the attention. However, technology gains also occur behind the scenes in operations. One of the less glamorous but powerful technological advances available today is predictive segmentation, a phrase that means "a new way to assess and view individuals in the market based on their health status and health needs." Sophisticated databases, data mining, neural networks and statistical capabilities have enabled the development of predictive segmentation techniques. These predictive models for healthcare can identify who is likely to need certain services and who is likely to become ill. They are a significant departure from various geographical and attitudinal segmentation methods that healthcare strategists have used in the past to gain a better understanding of their customers

respond to market trend with predict segment [ health care ]
 technolog and technolog advanc have alway been a part of healthcar , but often it 's advanc in treatment machineri and materi that get the attent . howev , technolog gain also occur behind the scene in oper . one of the less glamor but power technolog advanc avail today is predict segment , a phrase that mean " a new way to assess and view individu in the market base on their health statu and health need . " sophist databas , data mine , neural network and statist capabl have enabl the develop of predict segment techniqu . these predict model for healthcar can identifi who is like to need certain servic and who is like to becom ill . they are a signific departur from variou geograph and attitudin segment method that healthcar strategist have use in the past to gain a better understand of their custom

market trends
predictive segmentation
healthcare
data mining
neural networks