Agent-based product-support logistics system using XML and RDF

Abstract: The capability of the timely provision of maintenance services and service parts is critical to the competitiveness of industrial systems. To enhance the timely operations in a product-support logistics chain, business partners (equipment manufacturers, parts distributors, customers) may have to collaborate for the efficient exchange of relevant information. We propose the architecture of an agent-based product-support logistics system. Emphasis is placed on the problems of sharing and exchanging information through agent communication. We adopt the Resource Description Framework (RDF) schema for information modelling in product-support logistics domain. The eXtensible Markup Language (XML) serialization generates messages for agent communication. The use of XML and RDF enables software agents to understand the contents of messages correctly and consistently. We demonstrate the feasibility of our agent architecture using a scenario in logistical support processes. We believe that the approach can provide a promising way to the automation of business processes in product-support logistics through seamless communication among the partners

agent-bas product-support logist system use xml and rdf
 the capabl of the time provis of mainten servic and servic part is critic to the competit of industri system . to enhanc the time oper in a product-support logist chain , busi partner ( equip manufactur , part distributor , custom ) may have to collabor for the effici exchang of relev inform . we propos the architectur of an agent-bas product-support logist system . emphasi is place on the problem of share and exchang inform through agent commun . we adopt the resourc descript framework ( rdf ) schema for inform model in product-support logist domain . the extens markup languag ( xml ) serial gener messag for agent commun . the use of xml and rdf enabl softwar agent to understand the content of messag correctli and consist . we demonstr the feasibl of our agent architectur use a scenario in logist support process . we believ that the approach can provid a promis way to the autom of busi process in product-support logist through seamless commun among the partner


On abelian branched coverings of the sphere

Abstract: We obtain an enumeration formula for the number of weak equivalence classes of the branched (A * B)-covering of the sphere with m-branch points, when A and B are finite abelian groups with (|A|, |B|) = 1. From this, we can deduce an explicit formula for enumerating the weak equivalence classes of pseudofree spherical (Zp * Zq)-actions on a given surface, when p and q are distinct primes

on abelian branch cover of the sphere
 we obtain an enumer formula for the number of weak equival class of the branch ( a * b)-cover of the sphere with m-branch point , when a and b are finit abelian group with ( |a| , |b| ) = 1 . from thi , we can deduc an explicit formula for enumer the weak equival class of pseudofre spheric ( zp * zq)-action on a given surfac , when p and q are distinct prime

Abelian branched coverings
enumeration formula
weak equivalence classes
finite abelian groups
explicit formula
pseudofree spherical


Frontier between separability and quantum entanglement in a many spin system

Abstract: We discuss the critical point x/sub c/ separating the quantum entangled and separable states in two series of N spins S in the simple mixed state characterized by the matrix operator rho = x| phi >< phi |+1-x/D/sup N/I/sub D/N, where x in [0, 1], D = 2S + 1, I/sub D/N is the D/sup N/ * D/sup N/ unity matrix and | phi > is a special entangled state. The cases x = 0 and x = 1 correspond respectively to fully random spins and to a fully entangled state. In the first of these series we consider special states | phi > invariant under charge conjugation, that generalizes the N = 2 spin S = 1/2 Einstein-Podolsky-Rosen state, and in the second one we consider generalizations of the Werner (1989) density matrices. The evaluation of the critical point x/sub c/ was done through bounds coming from the partial transposition method of Peres (1996) and the conditional nonextensive entropy criterion. Our results suggest the conjecture that whenever the bounds coming from both methods coincide the result of x/sub c/ is the exact one. The results we present are relevant for the discussion of quantum computing, teleportation and cryptography

frontier between separ and quantum entangl in a mani spin system
 we discuss the critic point x / sub c/ separ the quantum entangl and separ state in two seri of n spin s in the simpl mix state character by the matrix oper rho = x| phi > < phi |+1-x / d / sup n / i / sub d / n , where x in [ 0 , 1 ] , d = 2s + 1 , i / sub d / n is the d / sup n/ * d / sup n/ uniti matrix and | phi > is a special entangl state . the case x = 0 and x = 1 correspond respect to fulli random spin and to a fulli entangl state . in the first of these seri we consid special state | phi > invari under charg conjug , that gener the n = 2 spin s = 1/2 einstein-podolsky-rosen state , and in the second one we consid gener of the werner ( 1989 ) densiti matric . the evalu of the critic point x / sub c/ wa done through bound come from the partial transposit method of pere ( 1996 ) and the condit nonextens entropi criterion . our result suggest the conjectur that whenev the bound come from both method coincid the result of x / sub c/ is the exact one . the result we present are relev for the discuss of quantum comput , teleport and cryptographi

separability
quantum entanglement
many spin system
critical point
separable states
matrix operator
unity matrix
entangled state
random spin
charge conjugation
Einstein-Podolsky-Rosen state
partial transposition method
nonextensive entropy criterion
quantum computing
teleportation
cryptography
Werner density matrices


From the DOS dog days to e-filing [law firms]

Abstract: The poster child for a successful e-filing venture is the Case Management and Electronic Case File system now rolling through the district and bankruptcy courts. A project of the Administrative Office of the United States Courts, CM/ECF is a loud proponent of the benefits of the PDF approach and it has a full head of steam. Present plans are for all federal courts to implement CM/ECF by 2005. That means a radical shift in methodology and tools for a lot of lawyers. It also means that you should get cozy with Acrobat real soon

from the do dog day to e-fil [ law firm ]
 the poster child for a success e-fil ventur is the case manag and electron case file system now roll through the district and bankruptci court . a project of the administr offic of the unit state court , cm / ecf is a loud propon of the benefit of the pdf approach and it ha a full head of steam . present plan are for all feder court to implement cm / ecf by 2005 . that mean a radic shift in methodolog and tool for a lot of lawyer . it also mean that you should get cozi with acrobat real soon


Control of a heavy-duty robotic excavator using time delay control with integral sliding surface

Abstract: The control of a robotic excavator is difficult from the standpoint of the following problems: parameter variations in mechanical structures, various nonlinearities in hydraulic actuators and disturbance due to the contact with the ground. In addition, the more the size of robotic excavators increases, the more the length and mass of the excavator links; the more the parameters of a heavy-duty excavator vary. A time-delay control with switching action (TDCSA) using an integral sliding surface is proposed in this paper for the control of a 21-ton robotic excavator. Through analysis and experiments, we show that using an integral sliding surface for the switching action of TDCSA is better than using a PD-type sliding surface. The proposed controller is applied to straight-line motions of a 21-ton robotic excavator with a speed level at which skillful operators work. Experiments, which were designed for surfaces with various inclinations and over broad ranges of joint motions, show that the proposed controller exhibits good performance

control of a heavy-duti robot excav use time delay control with integr slide surfac
 the control of a robot excav is difficult from the standpoint of the follow problem : paramet variat in mechan structur , variou nonlinear in hydraul actuat and disturb due to the contact with the ground . in addit , the more the size of robot excav increas , the more the length and mass of the excav link ; the more the paramet of a heavy-duti excav vari . a time-delay control with switch action ( tdcsa ) use an integr slide surfac is propos in thi paper for the control of a 21-ton robot excav . through analysi and experi , we show that use an integr slide surfac for the switch action of tdcsa is better than use a pd-type slide surfac . the propos control is appli to straight-lin motion of a 21-ton robot excav with a speed level at which skill oper work . experi , which were design for surfac with variou inclin and over broad rang of joint motion , show that the propos control exhibit good perform

robotic excavator
integral sliding surface
time-delay control
robust control
motion control
trajectory control
dynamics
tracking
pressure control


Optimal estimation of a finite sample of a discrete chaotic process

Abstract: The synthesis of optimal algorithms for estimating discrete chaotic processes specified by a finite sample is considered; various possible approaches are discussed. Expressions determining the potential accuracy in estimating a single value of the chaotic process are derived. An example of the application of the general equations obtained is given

optim estim of a finit sampl of a discret chaotic process
 the synthesi of optim algorithm for estim discret chaotic process specifi by a finit sampl is consid ; variou possibl approach are discuss . express determin the potenti accuraci in estim a singl valu of the chaotic process are deriv . an exampl of the applic of the gener equat obtain is given

optimal estimation
finite sample
discrete chaotic process
optimal algorithm synthesis
space-time filtering


Construction of two-sided bounds for initial-boundary value problems

Abstract: This paper extends the bounding operator approach developed for boundary value problems to the case of initial-boundary value problems (IBVPs). Following the general principle of bounding operators enclosing methods for the case of partial differential equations are discussed. In particular, continuous discretization methods with an appropriate error bound controlled shift and monotone extensions of Rothe's method for parabolic problems are investigated

construct of two-sid bound for initial-boundari valu problem
 thi paper extend the bound oper approach develop for boundari valu problem to the case of initial-boundari valu problem ( ibvp ) . follow the gener principl of bound oper enclos method for the case of partial differenti equat are discuss . in particular , continu discret method with an appropri error bound control shift and monoton extens of roth 's method for parabol problem are investig

two-sided bounds
initial-boundary value problems
bounding operator approach
bounding operators
partial differential equations
parabolic problems


Knowledge management

Abstract: The article defines knowledge management, discusses its role, and describes its functions. It also explains the principles of knowledge management, enumerates the strategies involved in knowledge management, and traces its history in brief. The focus is on its interdisciplinary nature. The steps involved in knowledge management i.e. identifying, collecting and capturing, selecting, organizing and storing, sharing, applying, and creating, are explained. The pattern of knowledge management initiatives is also considered

knowledg manag
 the articl defin knowledg manag , discuss it role , and describ it function . it also explain the principl of knowledg manag , enumer the strategi involv in knowledg manag , and trace it histori in brief . the focu is on it interdisciplinari natur . the step involv in knowledg manag i.e. identifi , collect and captur , select , organ and store , share , appli , and creat , are explain . the pattern of knowledg manag initi is also consid


Truss topology optimization by a modified genetic algorithm

Abstract: This paper describes the use of a stochastic search procedure based on genetic algorithms for developing near-optimal topologies of load-bearing truss structures. Most existing cases these publications express the truss topology as a combination of members. These methods, however, have the disadvantage that the resulting topology may include needless members or those which overlap other members. In addition to these problems, the generated structures are not necessarily structurally stable. A new method, which resolves these problems by expressing the truss topology as a combination of triangles, is proposed in this paper. Details of the proposed methodology are presented as well as the results of numerical examples that clearly show the effectiveness and efficiency of the method

truss topolog optim by a modifi genet algorithm
 thi paper describ the use of a stochast search procedur base on genet algorithm for develop near-optim topolog of load-bear truss structur . most exist case these public express the truss topolog as a combin of member . these method , howev , have the disadvantag that the result topolog may includ needless member or those which overlap other member . in addit to these problem , the gener structur are not necessarili structur stabl . a new method , which resolv these problem by express the truss topolog as a combin of triangl , is propos in thi paper . detail of the propos methodolog are present as well as the result of numer exampl that clearli show the effect and effici of the method

truss topology optimization
modified genetic algorithm
stochastic search procedure
near-optimal topologies
load-bearing truss structures
triangles


Taxonomy's role in content management

Abstract: A taxonomy is simply a way of classifying things. Still, there is a rapidly growing list of vendors offering taxonomy software and related applications. They promise many benefits, especially to enterprise customers: Content management will be more efficient. Corporate portals will be enhanced by easily created Yahoo!-like directories of internal information. And the end-user experience will be dramatically improved by more successful content retrieval and more effective knowledge discovery. But today's taxonomy products represent emerging technologies. They are not out-of-the-box solutions. And even the most automated systems require some manual assistance from people who know how to classify content

taxonomi 's role in content manag
 a taxonomi is simpli a way of classifi thing . still , there is a rapidli grow list of vendor offer taxonomi softwar and relat applic . they promis mani benefit , especi to enterpris custom : content manag will be more effici . corpor portal will be enhanc by easili creat yahoo!-lik directori of intern inform . and the end-us experi will be dramat improv by more success content retriev and more effect knowledg discoveri . but today 's taxonomi product repres emerg technolog . they are not out-of-the-box solut . and even the most autom system requir some manual assist from peopl who know how to classifi content

content management
taxonomy software
enterprise customers
corporate portals
internal information
effective knowledge discovery
taxonomy applications


Commerce Department plan eases 3G spectrum crunch

Abstract: The federal government made its first move last week toward cleaning up a spectrum allocation system that was in shambles just a year ago and had some, spectrum-starved wireless carriers fearing they wouldn't be able to compete in third-generation services. The move, however, is far from complete and leaves numerous details unsettled

commerc depart plan eas 3 g spectrum crunch
 the feder govern made it first move last week toward clean up a spectrum alloc system that wa in shambl just a year ago and had some , spectrum-starv wireless carrier fear they would n't be abl to compet in third-gener servic . the move , howev , is far from complet and leav numer detail unsettl

3G spectrum
federal government
spectrum allocation system
wireless carriers


Priming the pipeline [women in computer science careers]

Abstract: In 1997 The Backyard Project, a pilot program of the Garnett Foundation, was instituted to encourage high school girls to explore careers in the computer industry. At that time, the Garnett Foundation commissioned the Global Strategy Group to execute a survey of 652 college-bound high school students (grades 9 through 12), to help discover directions that The Backyard Project might take to try to move toward the mission of the pilot program. It conducted the study by telephone between March 25 and April 8, 1997 in the Silicon Valley, Boston, and Austin metropolitan areas. It conducted all interviews using a random digit dialing methodology, derived from a file of American households with high incidences of adolescent children. The top six answers from girls to the survey question "why are girls less likely to pursue computer science careers?" in order of perceived importance by the girls were: not enough role models; women have other interests; didn't know about the industry; limited opportunity; negative media; and too nerdy. These responses are discussed

prime the pipelin [ women in comput scienc career ]
 in 1997 the backyard project , a pilot program of the garnett foundat , wa institut to encourag high school girl to explor career in the comput industri . at that time , the garnett foundat commiss the global strategi group to execut a survey of 652 college-bound high school student ( grade 9 through 12 ) , to help discov direct that the backyard project might take to tri to move toward the mission of the pilot program . it conduct the studi by telephon between march 25 and april 8 , 1997 in the silicon valley , boston , and austin metropolitan area . it conduct all interview use a random digit dial methodolog , deriv from a file of american household with high incid of adolesc children . the top six answer from girl to the survey question " whi are girl less like to pursu comput scienc career ? " in order of perceiv import by the girl were : not enough role model ; women have other interest ; did n't know about the industri ; limit opportun ; neg media ; and too nerdi . these respons are discuss

The Backyard Project
high school girls
college-bound high school students
computer industry careers


Closed loop finite-element modeling of active constrained layer damping in the time domain analysis

Abstract: A three-dimensional finite-element closed-loop model has been developed to predict the effects of active-passive damping on a vibrating structure. The Golla-Hughes-McTavish method is employed to capture the viscoelastic material behavior in a time domain analysis. The parametric study includes the different control gains as well as geometric parameters related to the active constrained layer damping (ACLD) treatment. Comparisons are made among several ACLD models, the passive constrained model and the active damping model. The results obtained here reiterate that ACLD is somewhat better for vibration suppression than either the purely passive or the active system and provides higher structural damping with less control gain when compared to the purely active system. Since the ACLD performance can be reduced by the viscoelastic layer, the design of the ACLD model must be given a careful consideration in order to optimize the effect of passive damping

close loop finite-el model of activ constrain layer damp in the time domain analysi
 a three-dimension finite-el closed-loop model ha been develop to predict the effect of active-pass damp on a vibrat structur . the golla-hughes-mctavish method is employ to captur the viscoelast materi behavior in a time domain analysi . the parametr studi includ the differ control gain as well as geometr paramet relat to the activ constrain layer damp ( acld ) treatment . comparison are made among sever acld model , the passiv constrain model and the activ damp model . the result obtain here reiter that acld is somewhat better for vibrat suppress than either the pure passiv or the activ system and provid higher structur damp with less control gain when compar to the pure activ system . sinc the acld perform can be reduc by the viscoelast layer , the design of the acld model must be given a care consider in order to optim the effect of passiv damp


TCRM: diagnosing tuple inconsistency for granulized datasets

Abstract: Many approaches to granularization have been presented for knowledge discovery. However, the inconsistent tuples that exist in granulized datasets are hardly ever revealed. We developed a model, tuple consistency recognition model (TCRM) to help efficiently detect inconsistent tuples for datasets that are granulized. The main outputs of the developed model include explored inconsistent tuples and consumed processing time. We further conducted an empirical test where eighteen continuous real-life datasets granulized by the equal width interval technique that embedded S-plus histogram binning algorithm (SHBA) and largest binning size algorithm (LBSA) binning algorithms were diagnosed. Remarkable results: almost 40% of the granulized datasets contain inconsistent tuples and 22% have the amount of inconsistent tuples more than 20%

tcrm : diagnos tupl inconsist for granul dataset
 mani approach to granular have been present for knowledg discoveri . howev , the inconsist tupl that exist in granul dataset are hardli ever reveal . we develop a model , tupl consist recognit model ( tcrm ) to help effici detect inconsist tupl for dataset that are granul . the main output of the develop model includ explor inconsist tupl and consum process time . we further conduct an empir test where eighteen continu real-lif dataset granul by the equal width interv techniqu that embed s-plu histogram bin algorithm ( shba ) and largest bin size algorithm ( lbsa ) bin algorithm were diagnos . remark result : almost 40 % of the granul dataset contain inconsist tupl and 22 % have the amount of inconsist tupl more than 20 %

TCRM
tuple inconsistency
granulized datasets
granularization
knowledge discovery
tuple consistency recognition model
processing time
equal width interval technique
S-plus histogram binning algorithm
largest binning size algorithm
relational database
large database
SQL


Definition of a similarity measure between cases based on auto/cross-fuzzy thesauri

Abstract: A similarity measure between cases is needed in order to evaluate the degree of similarity when using past similar cases in order to resolve current problems. In similar case retrieval, multiple indices are set up in order to characterize the queries and individual cases, then terms are given as values to each. The similarity measure between cases commonly used is defined using the rate at which the values provided from the corresponding indices match. In practice, however, values cannot be expected to be mutually exclusive. As a result, a natural expansion of this approach is to have relationships in which mutually similar meanings are reflected in the similarity measure between cases. In this paper the authors consider an auto-fuzzy thesaurus which gives the relationship for values between corresponding indices and a cross-fuzzy thesaurus which gives the relationship for values between mutually distinct indices, then defines a similarity measure between cases which considers the relationship of index values based on these thesauri. This definition satisfies the characteristics required for the operation of case-based retrieval even when one value is not necessarily given in the index. Finally, using a test similar case retrieval system, the authors perform a comparative analysis of the proposed similarity measure between cases and a conventional approach

definit of a similar measur between case base on auto / cross-fuzzi thesauri
 a similar measur between case is need in order to evalu the degre of similar when use past similar case in order to resolv current problem . in similar case retriev , multipl indic are set up in order to character the queri and individu case , then term are given as valu to each . the similar measur between case commonli use is defin use the rate at which the valu provid from the correspond indic match . in practic , howev , valu can not be expect to be mutual exclus . as a result , a natur expans of thi approach is to have relationship in which mutual similar mean are reflect in the similar measur between case . in thi paper the author consid an auto-fuzzi thesauru which give the relationship for valu between correspond indic and a cross-fuzzi thesauru which give the relationship for valu between mutual distinct indic , then defin a similar measur between case which consid the relationship of index valu base on these thesauri . thi definit satisfi the characterist requir for the oper of case-bas retriev even when one valu is not necessarili given in the index . final , use a test similar case retriev system , the author perform a compar analysi of the propos similar measur between case and a convent approach

similar case retrieval
corresponding indices
auto-fuzzy thesaurus
cross-fuzzy thesaurus
mutually distinct indices
case-based retrieval
case similarity measure
relationship indices
decision making support system
problem solving


Image fusion between /sup 18/FDG-PET and MRI/CT for radiotherapy planning of oropharyngeal and nasopharyngeal carcinomas

Abstract: Accurate diagnosis of tumor extent is important in three-dimensional conformal radiotherapy. This study reports the use of image fusion between (18)F-fluoro-2-deoxy-D-glucose positron emission tomography (/sup 18/FDG-PET) and magnetic resonance imaging/computed tomography (MRI/CT) for better targets delineation in radiotherapy planning of head-and-neck cancers. The subjects consisted of 12 patients with oropharyngeal carcinoma and 9 patients with nasopharyngeal carcinoma (NPC) who were treated with radical radiotherapy between July 1999 and February 2001. Image fusion between /sup 18/FDG-PET and MRI/CT was performed using an automatic multimodality image registration algorithm, which used the brain as an internal reference for registration. Gross tumor volume (GTV) was determined based on clinical examination and /sup 18/FDG uptake on the fusion images. Clinical target volume (CTV) was determined following the usual pattern of lymph node spread for each disease entity along with the clinical presentation of each patient. Except for 3 cases with superficial tumors, all the other primary tumors were detected by /sup 18/FDG-PET. The GTV volumes for primary tumors were not changed by image fusion in 19 cases (89%), increased by 49% in one NPC, and decreased by 45% in another NPC. Normal tissue sparing was more easily performed based on clearer GTV and CTV determination on the fusion images. In particular, parotid sparing became possible in 15 patients (71%) whose upper neck areas near the parotid glands were tumor-free by /sup 18/FDG-PET. Within a mean follow-up period of 18 months, no recurrence occurred in the areas defined as CTV, which was treated prophylactically, except for 1 patient who experienced nodal recurrence in the CTV and simultaneous primary site recurrence. In conclusion, this preliminary study showed that image fusion between /sup 18/FDG-PET and MRI/CT was useful in GTV and CTV determination in conformal RT, thus sparing normal tissues

imag fusion between /sup 18 / fdg-pet and mri / ct for radiotherapi plan of oropharyng and nasopharyng carcinoma
 accur diagnosi of tumor extent is import in three-dimension conform radiotherapi . thi studi report the use of imag fusion between ( 18)f-fluoro-2-deoxy-d-glucos positron emiss tomographi ( /sup 18 / fdg-pet ) and magnet reson imag / comput tomographi ( mri / ct ) for better target delin in radiotherapi plan of head-and-neck cancer . the subject consist of 12 patient with oropharyng carcinoma and 9 patient with nasopharyng carcinoma ( npc ) who were treat with radic radiotherapi between juli 1999 and februari 2001 . imag fusion between /sup 18 / fdg-pet and mri / ct wa perform use an automat multimod imag registr algorithm , which use the brain as an intern refer for registr . gross tumor volum ( gtv ) wa determin base on clinic examin and /sup 18 / fdg uptak on the fusion imag . clinic target volum ( ctv ) wa determin follow the usual pattern of lymph node spread for each diseas entiti along with the clinic present of each patient . except for 3 case with superfici tumor , all the other primari tumor were detect by /sup 18 / fdg-pet . the gtv volum for primari tumor were not chang by imag fusion in 19 case ( 89 % ) , increas by 49 % in one npc , and decreas by 45 % in anoth npc . normal tissu spare wa more easili perform base on clearer gtv and ctv determin on the fusion imag . in particular , parotid spare becam possibl in 15 patient ( 71 % ) whose upper neck area near the parotid gland were tumor-fre by /sup 18 / fdg-pet . within a mean follow-up period of 18 month , no recurr occur in the area defin as ctv , which wa treat prophylact , except for 1 patient who experienc nodal recurr in the ctv and simultan primari site recurr . in conclus , thi preliminari studi show that imag fusion between /sup 18 / fdg-pet and mri / ct wa use in gtv and ctv determin in conform rt , thu spare normal tissu

image fusion
/sup 18/FDG-PET
MRI/CT
radiotherapy planning
nasopharyngeal carcinomas
oropharyngeal carcinomas
superficial tumors
primary tumors
normal tissues sparing
parotid glands
simultaneous primary site recurrence
F


Experimental design methodology and data analysis technique applied to optimise an organic synthesis

Abstract: The study was aimed at maximising the yield of a Michaelis-Becker dibromoalkane monophosphorylation reaction. In order to save time and money, we first applied a full factorial experimental design to search for the optimum conditions while performing a small number of experiments. We then used the principal component analysis (PCA) technique to evidence two uncontrolled factors. Lastly, a special experimental design that took into account all the influential factors allowed us to determine the maximum-yield experimental conditions. This study also evidenced the complementary nature of experimental design methodology and data analysis techniques

experiment design methodolog and data analysi techniqu appli to optimis an organ synthesi
 the studi wa aim at maximis the yield of a michaelis-beck dibromoalkan monophosphoryl reaction . in order to save time and money , we first appli a full factori experiment design to search for the optimum condit while perform a small number of experi . we then use the princip compon analysi ( pca ) techniqu to evid two uncontrol factor . lastli , a special experiment design that took into account all the influenti factor allow us to determin the maximum-yield experiment condit . thi studi also evidenc the complementari natur of experiment design methodolog and data analysi techniqu


Evaluating the performance of a distributed database of repetitive elements in complete genomes

Abstract: The original version of the Repeat Sequence Database (RSDB) was created based on centralized database systems (CDBSs). RSDB presently includes an enormous amount of data, with the amount of biological data increasing rapidly. Distributed RSDB (DRSDB) is developed to yield better performance. This study proposed many approaches to data distribution and experimentally determines the best approach to obtain good performance of our database. Experimental results indicate that DRSDB performs well for particular types of query

evalu the perform of a distribut databas of repetit element in complet genom
 the origin version of the repeat sequenc databas ( rsdb ) wa creat base on central databas system ( cdbss ) . rsdb present includ an enorm amount of data , with the amount of biolog data increas rapidli . distribut rsdb ( drsdb ) is develop to yield better perform . thi studi propos mani approach to data distribut and experiment determin the best approach to obtain good perform of our databas . experiment result indic that drsdb perform well for particular type of queri

repetitive elements
complete genomes
biological data
data distribution
queries
distributed Repeat Sequence Database
performance evaluation


Word spotting based on a posterior measure of keyword confidence

Abstract: In this paper, an approach of keyword confidence estimation is developed that well combines acoustic layer scores and syllable-based statistical language model (LM) scores. An a posteriori (AP) confidence measure and its forward-backward calculating algorithm are deduced. A zero false alarm (ZFA) assumption is proposed for evaluating relative confidence measures by word spotting task. In a word spotting experiment with a vocabulary of 240 keywords, the keyword accuracy under the AP measure is above 94%, which well approaches its theoretical upper limit. In addition, a syllable lattice Hidden Markov Model (SLHMM) is formulated and a unified view of confidence estimation, word spotting, optimal path search, and N-best syllable re-scoring is presented. The proposed AP measure can be easily applied to various speech recognition systems as well

word spot base on a posterior measur of keyword confid
 in thi paper , an approach of keyword confid estim is develop that well combin acoust layer score and syllable-bas statist languag model ( lm ) score . an a posteriori ( ap ) confid measur and it forward-backward calcul algorithm are deduc . a zero fals alarm ( zfa ) assumpt is propos for evalu rel confid measur by word spot task . in a word spot experi with a vocabulari of 240 keyword , the keyword accuraci under the ap measur is abov 94 % , which well approach it theoret upper limit . in addit , a syllabl lattic hidden markov model ( slhmm ) is formul and a unifi view of confid estim , word spot , optim path search , and n-best syllabl re-scor is present . the propos ap measur can be easili appli to variou speech recognit system as well

syllable-based statistical language model scores


Favorable noise uniformity properties of Fourier-based interpolation and reconstruction approaches in single-slice helical computed tomography

Abstract: Volumes reconstructed by standard methods from single-slice helical computed tomography (CT) data have been shown to have noise levels that are highly nonuniform relative to those in conventional CT. These noise nonuniformities can affect low-contrast object detectability and have also been identified as the cause of the zebra artifacts that plague maximum intensity projection (MIP) images of such volumes. While these spatially variant noise levels have their root in the peculiarities of the helical scan geometry, there is also a strong dependence on the interpolation and reconstruction algorithms employed. In this paper, we seek to develop image reconstruction strategies that eliminate or reduce, at its source, the nonuniformity of noise levels in helical CT relative to that in conventional CT. We pursue two approaches, independently and in concert. We argue, and verify, that Fourier-based longitudinal interpolation approaches lead to more uniform noise ratios than do the standard 360LI and 180LI approaches. We also demonstrate that a Fourier-based fan-to-parallel rebinning algorithm, used as an alternative to fanbeam filtered backprojection for slice reconstruction, also leads to more uniform noise ratios, even when making use of the 180LI and 360LI interpolation approaches

favor nois uniform properti of fourier-bas interpol and reconstruct approach in single-slic helic comput tomographi
 volum reconstruct by standard method from single-slic helic comput tomographi ( ct ) data have been shown to have nois level that are highli nonuniform rel to those in convent ct . these nois nonuniform can affect low-contrast object detect and have also been identifi as the caus of the zebra artifact that plagu maximum intens project ( mip ) imag of such volum . while these spatial variant nois level have their root in the peculiar of the helic scan geometri , there is also a strong depend on the interpol and reconstruct algorithm employ . in thi paper , we seek to develop imag reconstruct strategi that elimin or reduc , at it sourc , the nonuniform of nois level in helic ct rel to that in convent ct . we pursu two approach , independ and in concert . we argu , and verifi , that fourier-bas longitudin interpol approach lead to more uniform nois ratio than do the standard 360li and 180li approach . we also demonstr that a fourier-bas fan-to-parallel rebin algorithm , use as an altern to fanbeam filter backproject for slice reconstruct , also lead to more uniform nois ratio , even when make use of the 180li and 360li interpol approach


Estimation of blocking probabilities in cellular networks with dynamic channel assignment

Abstract: Blocking probabilities in cellular mobile communication networks using dynamic channel assignment are hard to compute for realistic sized systems. This computational difficulty is due to the structure of the state space, which imposes strong coupling constraints amongst components of the occupancy vector. Approximate tractable models have been proposed, which have product form stationary state distributions. However, for real channel assignment schemes, the product form is a poor approximation and it is necessary to simulate the actual occupancy process in order to estimate the blocking probabilities. Meaningful estimates of the blocking probability typically require an enormous amount of CPU time for simulation, since blocking events are usually rare. Advanced simulation approaches use importance sampling (IS) to overcome this problem. We study two regimes under which blocking is a rare event: low-load and high cell capacity. Our simulations use the standard clock (SC) method. For low load, we propose a change of measure that we call static ISSC, which has bounded relative error. For high capacity, we use a change of measure that depends on the current state of the network occupancy. This is the dynamic ISSC method. We prove that this method yields zero variance estimators for single clique models, and we empirically show the advantages of this method over naive simulation for networks of moderate size and traffic loads

estim of block probabl in cellular network with dynam channel assign
 block probabl in cellular mobil commun network use dynam channel assign are hard to comput for realist size system . thi comput difficulti is due to the structur of the state space , which impos strong coupl constraint amongst compon of the occup vector . approxim tractabl model have been propos , which have product form stationari state distribut . howev , for real channel assign scheme , the product form is a poor approxim and it is necessari to simul the actual occup process in order to estim the block probabl . meaning estim of the block probabl typic requir an enorm amount of cpu time for simul , sinc block event are usual rare . advanc simul approach use import sampl ( is ) to overcom thi problem . we studi two regim under which block is a rare event : low-load and high cell capac . our simul use the standard clock ( sc ) method . for low load , we propos a chang of measur that we call static issc , which ha bound rel error . for high capac , we use a chang of measur that depend on the current state of the network occup . thi is the dynam issc method . we prove that thi method yield zero varianc estim for singl cliqu model , and we empir show the advantag of thi method over naiv simul for network of moder size and traffic load


Real-time quasi-2-D inversion of array resistivity logging data using neural network

Abstract: We present a quasi-2-D real-time inversion algorithm for a modern galvanic array tool via dimensional reduction and neural network simulation. Using reciprocity and superposition, we apply a numerical focusing technique to the unfocused data. The numerically focused data are much less subject to 2-D and layering effects and can be approximated as from a cylindrical 1-D Earth. We then perform 1-D inversion on the focused data to provide approximate information about the 2-D resistivity structure. A neural network is used to perform forward modeling in the 1-D inversion, which is several hundred times faster than conventional numerical forward solutions. Testing our inversion algorithm on both synthetic and field data shows that this fast inversion algorithm is useful for providing formation resistivity information at a well site

real-tim quasi-2-d invers of array resist log data use neural network
 we present a quasi-2-d real-tim invers algorithm for a modern galvan array tool via dimension reduct and neural network simul . use reciproc and superposit , we appli a numer focus techniqu to the unfocus data . the numer focus data are much less subject to 2-d and layer effect and can be approxim as from a cylindr 1-d earth . we then perform 1-d invers on the focus data to provid approxim inform about the 2-d resist structur . a neural network is use to perform forward model in the 1-d invers , which is sever hundr time faster than convent numer forward solut . test our invers algorithm on both synthet and field data show that thi fast invers algorithm is use for provid format resist inform at a well site

real-time quasi-2-D inversion
array resistivity logging data
neural network
real-time inversion algorithm
galvanic array tool
dimensional reduction
reciprocity
superposition
numerical focusing technique
unfocused data
focused data
1-D inversion
forward modeling
formation resistivity
well site


Image reconstruction of simulated specimens using convolution back projection

Abstract: This paper reports the reconstruction of cross-sections of composite structures. The convolution back projection (CBP) algorithm has been used to capture the attenuation field over the specimen. Five different test cases have been taken up for evaluation. These cases represent varying degrees of complexity. In addition, the role of filters on the nature of the reconstruction errors has also been discussed. Numerical results obtained in the study reveal that CBP algorithm is a useful tool for qualitative as well as quantitative assessment of composite regions encountered in engineering applications

imag reconstruct of simul specimen use convolut back project
 thi paper report the reconstruct of cross-sect of composit structur . the convolut back project ( cbp ) algorithm ha been use to captur the attenu field over the specimen . five differ test case have been taken up for evalu . these case repres vari degre of complex . in addit , the role of filter on the natur of the reconstruct error ha also been discuss . numer result obtain in the studi reveal that cbp algorithm is a use tool for qualit as well as quantit assess of composit region encount in engin applic

image reconstruction
simulated specimens
convolution back projection
composite structures
attenuation field
filters
reconstruction errors
CBP algorithm
composite regions
engineering applications
computerised tomography


Stochastic optimization of acoustic response - a numerical and experimental comparison

Abstract: The objective of the work presented is to compare results from numerical optimization with experimental data and to highlight and discuss the differences between two fundamentally different optimization methods. The problem domain is minimization of acoustic emission and the structure used in the work is a closed cylinder with forced vibration of one end. The optimization method used in this paper is simulated annealing (SA), a stochastic method. The results are compared with those from a gradient-based method used on the same structure in an earlier paper (Tinnsten, 2000)

stochast optim of acoust respons - a numer and experiment comparison
 the object of the work present is to compar result from numer optim with experiment data and to highlight and discuss the differ between two fundament differ optim method . the problem domain is minim of acoust emiss and the structur use in the work is a close cylind with forc vibrat of one end . the optim method use in thi paper is simul anneal ( sa ) , a stochast method . the result are compar with those from a gradient-bas method use on the same structur in an earlier paper ( tinnsten , 2000 )

stochastic optimization
acoustic response
numerical optimization
structure
closed cylinder
forced vibration
simulated annealing
gradient-based method
acoustic emission minimization


Revisiting Hardy's paradox: Counterfactual statements, real measurements, entanglement and weak values

Abstract: Hardy's (1992) paradox is revisited. Usually the paradox is dismissed on grounds of counterfactuality, i.e., because the paradoxical effects appear only when one considers results of experiments which do not actually take place. We suggest a new set of measurements in connection with Hardy's scheme, and show that when they are actually performed, they yield strange and surprising outcomes. More generally, we claim that counterfactual paradoxes point to a deeper structure inherent to quantum mechanics

revisit hardi 's paradox : counterfactu statement , real measur , entangl and weak valu
 hardi 's ( 1992 ) paradox is revisit . usual the paradox is dismiss on ground of counterfactu , i.e. , becaus the paradox effect appear onli when one consid result of experi which do not actual take place . we suggest a new set of measur in connect with hardi 's scheme , and show that when they are actual perform , they yield strang and surpris outcom . more gener , we claim that counterfactu paradox point to a deeper structur inher to quantum mechan

counterfactual statements
real measurements
entanglement
weak values
paradoxical effects
quantum mechanics
Hardy paradox
gedanken-experiments


How to drive strategic innovation [law firms]

Abstract: Innovation. It has everything to do with organization and attitude. Marginal improvement isn't enough anymore. Convert your problem-solving skills into a new value for the entire firm. 10 initiatives

how to drive strateg innov [ law firm ]
 innov . it ha everyth to do with organ and attitud . margin improv is n't enough anymor . convert your problem-solv skill into a new valu for the entir firm . 10 initi

strategic innovation
law firms
management
change
clients
experiments


A knowledge management framework for the support of decision making in humanitarian assistance/disaster relief

Abstract: The major challenge in current humanitarian assistance/disaster relief (HA/DR) efforts is that diverse information and knowledge are widely distributed and owned by different organizations. These resources are not efficiently organized and utilized during HA/DR operations. We present a knowledge management framework that integrates multiple information technologies to collect, analyze, and manage information and knowledge for supporting decision making in HA/DR. The framework will help identify the information needs, be aware of a disaster situation, and provide decision-makers with useful relief recommendations based on past experience. A comprehensive, consistent and authoritative knowledge base within the framework will facilitate knowledge sharing and reuse. This framework can also be applied to other similar real-time decision-making environments, such as crisis management and emergency medical assistance

a knowledg manag framework for the support of decis make in humanitarian assist / disast relief
 the major challeng in current humanitarian assist / disast relief ( ha / dr ) effort is that divers inform and knowledg are wide distribut and own by differ organ . these resourc are not effici organ and util dure ha / dr oper . we present a knowledg manag framework that integr multipl inform technolog to collect , analyz , and manag inform and knowledg for support decis make in ha / dr . the framework will help identifi the inform need , be awar of a disast situat , and provid decision-mak with use relief recommend base on past experi . a comprehens , consist and authorit knowledg base within the framework will facilit knowledg share and reus . thi framework can also be appli to other similar real-tim decision-mak environ , such as crisi manag and emerg medic assist

knowledge management framework
humanitarian assistance
disaster relief
organizations
information technology
information needs
knowledge sharing
real-time decision-making environments
crisis management
emergency medical assistance
decision support system
knowledge reuse
case-based reasoning


A strategy for a payoff-switching differential game based on fuzzy reasoning

Abstract: In this paper, a new concept of a payoff-switching differential game is introduced. In this new game, any one player at any time may have several choices of payoffs for the future. Moreover, the payoff-switching process, including the time of payoff switching and the outcome payoff, of any one player is unknown to the other. Indeed, the overall payoff, which is a sequence of several payoffs, is unknown until the game ends. An algorithm for determining a reasoning strategy based on fuzzy reasoning is proposed. In this algorithm, the fuzzy theory is used to estimate the behavior of one player during a past time interval. By deriving two fuzzy matrices GSM, game similarity matrix, and VGSM, variation of GSM, the behavior of the player can be quantified. Two weighting vectors are selected to weight the relative importance of the player's behavior at each past time instant. Finally a simple fuzzy inference rule is adopted to generate a linear reasoning strategy. The advantage of this algorithm is that it provides a flexible way for differential game specialists to convert their knowledge into a "reasonable" strategy. A practical example of guarding three territories is given to illustrate our main ideas

a strategi for a payoff-switch differenti game base on fuzzi reason
 in thi paper , a new concept of a payoff-switch differenti game is introduc . in thi new game , ani one player at ani time may have sever choic of payoff for the futur . moreov , the payoff-switch process , includ the time of payoff switch and the outcom payoff , of ani one player is unknown to the other . inde , the overal payoff , which is a sequenc of sever payoff , is unknown until the game end . an algorithm for determin a reason strategi base on fuzzi reason is propos . in thi algorithm , the fuzzi theori is use to estim the behavior of one player dure a past time interv . by deriv two fuzzi matric gsm , game similar matrix , and vgsm , variat of gsm , the behavior of the player can be quantifi . two weight vector are select to weight the rel import of the player 's behavior at each past time instant . final a simpl fuzzi infer rule is adopt to gener a linear reason strategi . the advantag of thi algorithm is that it provid a flexibl way for differenti game specialist to convert their knowledg into a " reason " strategi . a practic exampl of guard three territori is given to illustr our main idea

payoff-switching differential game
differential game
fuzzy reasoning
payoff switching
outcome payoff
reasoning strategy
fuzzy matrices
game similarity matrix
weighting vectors
fuzzy inference


Multiple shooting using a dichotomically stable integrator for solving differential-algebraic equations

Abstract: In previous work by the first author, it has been established that a dichotomically stable discretization is needed when solving a stiff boundary-value problem in ordinary differential equations (ODEs), when sharp boundary layers may occur at each end of the interval. A dichotomically stable implicit Runge-Kutta method, using the 3-stage, fourth-order, Lobatto IIIA formulae, has been implemented in a variable step-size initial-value integrator, which could be used in a multiple-shooting approach. In the case of index-one differential-algebraic equations (DAEs) the use of the Lobatto IIIA formulae has an advantage, over a comparable Gaussian method, that the order is the same for both differential and algebraic variables, and there is no need to treat them separately. The ODE integrator has been adapted for the solution of index-one DAEs, and the resulting integrator (SYMDAE) has been inserted into the multiple-shooting code (MSHDAE) previously developed by R. Lamour for differential-algebraic boundary-value problems. The standard version of MSHDAE uses a BDF integrator, which is not dichotomically stable, and for some stiff test problems this fails to integrate across the interval of interest, while the dichotomically stable integrator SYMDAE encounters no difficulty. Indeed, for such problems, the modified version of MSHDAE produces an accurate solution, and within limits imposed by computer word length, the efficiency of the solution process improves with increasing stiffness. For some nonstiff problems, the solution is also entirely satisfactory

multipl shoot use a dichotom stabl integr for solv differential-algebra equat
 in previou work by the first author , it ha been establish that a dichotom stabl discret is need when solv a stiff boundary-valu problem in ordinari differenti equat ( ode ) , when sharp boundari layer may occur at each end of the interv . a dichotom stabl implicit runge-kutta method , use the 3-stage , fourth-ord , lobatto iiia formula , ha been implement in a variabl step-siz initial-valu integr , which could be use in a multiple-shoot approach . in the case of index-on differential-algebra equat ( dae ) the use of the lobatto iiia formula ha an advantag , over a compar gaussian method , that the order is the same for both differenti and algebra variabl , and there is no need to treat them separ . the ode integr ha been adapt for the solut of index-on dae , and the result integr ( symda ) ha been insert into the multiple-shoot code ( mshdae ) previous develop by r. lamour for differential-algebra boundary-valu problem . the standard version of mshdae use a bdf integr , which is not dichotom stabl , and for some stiff test problem thi fail to integr across the interv of interest , while the dichotom stabl integr symda encount no difficulti . inde , for such problem , the modifi version of mshdae produc an accur solut , and within limit impos by comput word length , the effici of the solut process improv with increas stiff . for some nonstiff problem , the solut is also entir satisfactori

multiple shooting
dichotomically stable integrator
differential-algebraic equations
stiff boundary-value problem
ordinary differential equations
implicit Runge-Kutta method
Lobatto IIIA formulae
initial-value integrator


Edison's direct current influenced "Broadway" show lighting

Abstract: During the early decades of the 20 th century, midtown Manhattan in New York City developed an extensive underground direct current (DC) power distribution system. This was a result of the original introduction of direct current by Thomas Edison's pioneering Pearl Street Station in 1882. The availability of DC power in the theater district, led to the perpetuation of an archaic form of stage lighting control through nearly three-quarters of the 20 th century. This control device was known as a "resistance dimmer." It was essentially a series-connected rheostat, but it was wound with a special resistance "taper" so as to provide a uniform change in the apparent light output of typical incandescent lamps throughout the travel of its manually operated arm. The development and use of DC powered stage lighting is discussed in this article

edison 's direct current influenc " broadway " show light
 dure the earli decad of the 20 th centuri , midtown manhattan in new york citi develop an extens underground direct current ( dc ) power distribut system . thi wa a result of the origin introduct of direct current by thoma edison 's pioneer pearl street station in 1882 . the avail of dc power in the theater district , led to the perpetu of an archaic form of stage light control through nearli three-quart of the 20 th centuri . thi control devic wa known as a " resist dimmer . " it wa essenti a series-connect rheostat , but it wa wound with a special resist " taper " so as to provid a uniform chang in the appar light output of typic incandesc lamp throughout the travel of it manual oper arm . the develop and use of dc power stage light is discuss in thi articl

underground direct current power distribution system


Quantum computation for physical modeling

Abstract: One of the most famous American physicists of the twentieth century, Richard Feynman, in 1982 was the first to propose using a quantum mechanical computing device to efficiently simulate quantum mechanical many-body dynamics, a task that is exponentially complex in the number of particles treated and is completely intractable by any classical computing means for large systems of many particles. In the two decades following his work, remarkable progress has been made both theoretically and experimentally in the new field of quantum computation

quantum comput for physic model
 one of the most famou american physicist of the twentieth centuri , richard feynman , in 1982 wa the first to propos use a quantum mechan comput devic to effici simul quantum mechan many-bodi dynam , a task that is exponenti complex in the number of particl treat and is complet intract by ani classic comput mean for larg system of mani particl . in the two decad follow hi work , remark progress ha been made both theoret and experiment in the new field of quantum comput

quantum computation
physical modeling
quantum mechanical computing
quantum mechanical many-body dynamics


Updating systems for monitoring and controlling power equipment on the basis of the firmware system SARGON

Abstract: The economic difficulties experienced by the power industry of Russia has considerably retarded the speed of commissioning new capacities and reconstructing equipment in service. The increasing deterioration of the equipment at power stations makes the problem of its updating very acute. The main efforts of organizations working in the power industry are now focused on updating all kinds of equipment installed at power installations. The necessary condition for the efficient operation of power equipment is to carry out serious modernization of systems for monitoring and control (SMC) of technological processes. The specialists at ZAO NVT-Avtomatika have developed efficient technology for updating the SMC on the basis of the firmware system SARGON which ensures the fast introduction of high-quality systems of automation with a minimal payback time of the capital outlay. This paper discusses the updating of equipment using SARGON

updat system for monitor and control power equip on the basi of the firmwar system sargon
 the econom difficulti experienc by the power industri of russia ha consider retard the speed of commiss new capac and reconstruct equip in servic . the increas deterior of the equip at power station make the problem of it updat veri acut . the main effort of organ work in the power industri are now focus on updat all kind of equip instal at power instal . the necessari condit for the effici oper of power equip is to carri out seriou modern of system for monitor and control ( smc ) of technolog process . the specialist at zao nvt-avtomatika have develop effici technolog for updat the smc on the basi of the firmwar system sargon which ensur the fast introduct of high-qual system of autom with a minim payback time of the capit outlay . thi paper discuss the updat of equip use sargon

power industry
Russia
ZAO NVT-Avtomatika
SARGON firmware system
monitoring systems
control systems
power equipment monitoring
power equipment control


Open hypermedia for product support

Abstract: As industrial systems become increasingly more complex, the maintenance and operating information increases both in volume and complexity. With the current pressures on manufacturing, the management of information resources has become a critical issue. In particular, ensuring that personnel can access current information quickly and effectively when undertaking a specific task. This paper discusses some of the issues involved in, and the benefits of using, open hypermedia to manage and deliver a diverse range of information. While the paper concentrates on the problems specifically associated with manufacturing organizations, the problems are generic across other business sectors such as healthcare, defence and finance. The open hypermedia approach to information management and delivery allows a multimedia resource base to be used for a range of applications and it permits a user to have controlled access to the required information in an easily accessible and structured manner. Recent advancement in hypermedia also permits just-in-time support in the most appropriate format for all users. Our approach is illustrated by the discussion of a case study in which an open hypermedia system delivers maintenance and process information to factory-floor users to support the maintenance and operation of a very large manufacturing cell

open hypermedia for product support
 as industri system becom increasingli more complex , the mainten and oper inform increas both in volum and complex . with the current pressur on manufactur , the manag of inform resourc ha becom a critic issu . in particular , ensur that personnel can access current inform quickli and effect when undertak a specif task . thi paper discuss some of the issu involv in , and the benefit of use , open hypermedia to manag and deliv a divers rang of inform . while the paper concentr on the problem specif associ with manufactur organ , the problem are gener across other busi sector such as healthcar , defenc and financ . the open hypermedia approach to inform manag and deliveri allow a multimedia resourc base to be use for a rang of applic and it permit a user to have control access to the requir inform in an easili access and structur manner . recent advanc in hypermedia also permit just-in-tim support in the most appropri format for all user . our approach is illustr by the discuss of a case studi in which an open hypermedia system deliv mainten and process inform to factory-floor user to support the mainten and oper of a veri larg manufactur cell

open hypermedia
product support
maintenance
operating information
information resources
just-in-time support


Personal cards for on-line purchases

Abstract: Buying presents over the Web has advantages for a busy person: lots of choices, 24-hour accessibility, quick delivery, and you don't even have to wrap the gift. But many people like to select a card or write a personal note to go with their presents, and the options for doing that have been limited. Two companies have seen this limitation as an opportunity: 4YourSoul.com and CardintheBox.com

person card for on-lin purchas
 buy present over the web ha advantag for a busi person : lot of choic , 24-hour access , quick deliveri , and you do n't even have to wrap the gift . but mani peopl like to select a card or write a person note to go with their present , and the option for do that have been limit . two compani have seen thi limit as an opportun : 4yoursoul.com and cardinthebox.com


Delayed-choice entanglement swapping with vacuum-one-photon quantum states

Abstract: We report the experimental realization of a recently discovered quantum-information protocol by Peres implying an apparent nonlocal quantum mechanical retrodiction effect. The demonstration is carried out by a quantum optical method by which each singlet entangled state is physically implemented by a two-dimensional subspace of Fock states of a mode of the electromagnetic field, specifically the space spanned by the vacuum and the one-photon state, along lines suggested recently by E. Knill et al. [Nature (London) 409, 46 (2001)] and by M. Duan et al. [ibid. 414, 413 (2001)]

delayed-choic entangl swap with vacuum-one-photon quantum state
 we report the experiment realiz of a recent discov quantum-inform protocol by pere impli an appar nonloc quantum mechan retrodict effect . the demonstr is carri out by a quantum optic method by which each singlet entangl state is physic implement by a two-dimension subspac of fock state of a mode of the electromagnet field , specif the space span by the vacuum and the one-photon state , along line suggest recent by e. knill et al . [ natur ( london ) 409 , 46 ( 2001 ) ] and by m. duan et al . [ ibid . 414 , 413 ( 2001 ) ]


Optical two-step modified signed-digit addition based on binary logic gates

Abstract: A new modified signed-digit (MSD) addition algorithm based on binary logic gates is proposed for parallel computing. It is shown that by encoding each of the input MSD digits and flag digits into a pair of binary bits, the number of addition steps can be reduced to two. The flag digit is introduced to characterize the next low order pair (NLOP) of the input digits in order to suppress carry propagation. The rules for two-step addition of binary coded MSD (BCMSD) numbers are formulated that can be implemented using optical shadow-casting logic system

optic two-step modifi signed-digit addit base on binari logic gate
 a new modifi signed-digit ( msd ) addit algorithm base on binari logic gate is propos for parallel comput . it is shown that by encod each of the input msd digit and flag digit into a pair of binari bit , the number of addit step can be reduc to two . the flag digit is introduc to character the next low order pair ( nlop ) of the input digit in order to suppress carri propag . the rule for two-step addit of binari code msd ( bcmsd ) number are formul that can be implement use optic shadow-cast logic system

optical two-step modified signed-digit addition

modified signed-digit addition algorithm


Speech enhancement using a mixture-maximum model

Abstract: We present a spectral domain, speech enhancement algorithm. The new algorithm is based on a mixture model for the short time spectrum of the clean speech signal, and on a maximum assumption in the production of the noisy speech spectrum. In the past this model was used in the context of noise robust speech recognition. In this paper we show that this model is also effective for improving the quality of speech signals corrupted by additive noise. The computational requirements of the algorithm can be significantly reduced, essentially without paying performance penalties, by incorporating a dual codebook scheme with tied variances. Experiments, using recorded speech signals and actual noise sources, show that in spite of its low computational requirements, the algorithm shows improved performance compared to alternative speech enhancement algorithms

speech enhanc use a mixture-maximum model
 we present a spectral domain , speech enhanc algorithm . the new algorithm is base on a mixtur model for the short time spectrum of the clean speech signal , and on a maximum assumpt in the product of the noisi speech spectrum . in the past thi model wa use in the context of nois robust speech recognit . in thi paper we show that thi model is also effect for improv the qualiti of speech signal corrupt by addit nois . the comput requir of the algorithm can be significantli reduc , essenti without pay perform penalti , by incorpor a dual codebook scheme with tie varianc . experi , use record speech signal and actual nois sourc , show that in spite of it low comput requir , the algorithm show improv perform compar to altern speech enhanc algorithm

mixture-maximum model
spectral domain
speech enhancement algorithm
mixture model
short time spectrum
clean speech signal
noisy speech spectrum
noise robust speech recognition
additive noise
performance penalties
dual codebook
tied variances
recorded speech signals
noise sources
low computational requirements
speech signal quality
Gaussian mixture model
MIXMAX model
speech intelligibility


Design of 1-D and 2-D variable fractional delay allpass filters using weighted least-squares method

Abstract: In this paper, a weighted least-squares method is presented to design one-dimensional and two-dimensional variable fractional delay allpass filters. First, each coefficient of the variable allpass filter is expressed as the polynomial of the fractional delay parameter. Then, the nonlinear phase error is approximated by a weighted equation error such that the cost function can be converted into a quadratic form. Next, by minimizing the weighted equation error, the optimal polynomial coefficients can be obtained iteratively by solving a set of linear simultaneous equations at each iteration. Finally, the design examples are demonstrated to illustrate the effectiveness of the proposed approach

design of 1-d and 2-d variabl fraction delay allpass filter use weight least-squar method
 in thi paper , a weight least-squar method is present to design one-dimension and two-dimension variabl fraction delay allpass filter . first , each coeffici of the variabl allpass filter is express as the polynomi of the fraction delay paramet . then , the nonlinear phase error is approxim by a weight equat error such that the cost function can be convert into a quadrat form . next , by minim the weight equat error , the optim polynomi coeffici can be obtain iter by solv a set of linear simultan equat at each iter . final , the design exampl are demonstr to illustr the effect of the propos approach


Algebraic conditions for high-order convergent deferred correction schemes based on Runge-Kutta-Nystrom methods for second order boundary value problems

Abstract: In [T. Van Hecke, M. Van Daele, J. Comp. Appl. Math., vol. 132, p. 107-125, (2001)] the investigation of high-order convergence of deferred correction schemes for the numerical solution of second order nonlinear two-point boundary value problems not containing the first derivative, is made. The derivation of the algebraic conditions to raise the increase of order by the deferred correction scheme was based on Taylor series expansions. In this paper we describe a more elegant way by means of P-series to obtain this necessary conditions and generalize this idea to equations of the form y" = f (t, y, y')

algebra condit for high-ord converg defer correct scheme base on runge-kutta-nystrom method for second order boundari valu problem
 in [ t. van heck , m. van dael , j. comp . appl . math . , vol . 132 , p. 107 - 125 , ( 2001 ) ] the investig of high-ord converg of defer correct scheme for the numer solut of second order nonlinear two-point boundari valu problem not contain the first deriv , is made . the deriv of the algebra condit to rais the increas of order by the defer correct scheme wa base on taylor seri expans . in thi paper we describ a more eleg way by mean of p-seri to obtain thi necessari condit and gener thi idea to equat of the form y " = f ( t , y , y ' )


NARX-based technique for the modelling of magneto-rheological damping devices

Abstract: This paper presents a methodology for identifying variable-structure nonlinear models of magneto-rheological dampers (MRD) and similar devices. Its peculiarity with respect to the mainstream literature is to be especially conceived for obtaining models that are structurally simple, easy to estimate and well suited for model-based control. This goal is pursued by adopting linear-in-the-parameters NARX models, for which an identification method is developed based on the minimization of the simulation error. This method is capable of selecting the model structure together with the parameters, thus it does not require a priori structural information. A set of validation tests is reported, with the aim of demonstrating the technique's efficiency by comparing it to a widely accepted MRD modelling approach

narx-bas techniqu for the model of magneto-rheolog damp devic
 thi paper present a methodolog for identifi variable-structur nonlinear model of magneto-rheolog damper ( mrd ) and similar devic . it peculiar with respect to the mainstream literatur is to be especi conceiv for obtain model that are structur simpl , easi to estim and well suit for model-bas control . thi goal is pursu by adopt linear-in-the-paramet narx model , for which an identif method is develop base on the minim of the simul error . thi method is capabl of select the model structur togeth with the paramet , thu it doe not requir a priori structur inform . a set of valid test is report , with the aim of demonstr the techniqu 's effici by compar it to a wide accept mrd model approach

modelling
identification
model-based control
NARX models
minimization
simulation error
validation
MRD modelling
magnetorheological damping


A new merging algorithm for constructing suffix trees for integer alphabets

Abstract: A new approach for constructing a suffix tree T/sub s/ for a given string S is to construct recursively a suffix tree T/sub o/ for odd positions, construct a suffix, tree T/sub e/ for even positions from T/sub o/ and then merge T/sub o/ and T/sub e/ into T/sub s/. To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets. The hardest part of Farach's algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search). Our merging algorithm is more intuitive than Farach's coupled DFS (depth-first search) merging, and thus it can be easily extended to other applications

a new merg algorithm for construct suffix tree for integ alphabet
 a new approach for construct a suffix tree t / sub s/ for a given string s is to construct recurs a suffix tree t / sub o/ for odd posit , construct a suffix , tree t / sub e/ for even posit from t / sub o/ and then merg t / sub o/ and t / sub e/ into t / sub s/. to construct suffix tree for integ alphabet in linear time had been a major open problem on index data structur . farach use thi approach and gave the first linear-tim algorithm for integ alphabet . the hardest part of farach 's algorithm is the merg step . in thi paper we present a new and simpler merg algorithm base on a coupl bf ( breadth-first search ) . our merg algorithm is more intuit than farach 's coupl df ( depth-first search ) merg , and thu it can be easili extend to other applic

merging algorithm
suffix trees
integer alphabets
linear time
index data structures
coupled BFS
breadth-first search
recursive construction


Radianz and Savvis look to expand service in wake of telecom scandals [finance]

Abstract: With confidence in network providers waning, Radianz and Savvis try to prove their stability. Savvis and Radianz, which both specialize in providing the data-extranet components of telecommunication infrastructures, may see more networking doors open at investment banks, brokerage houses, exchanges and alternative-trading systems

radianz and savvi look to expand servic in wake of telecom scandal [ financ ]
 with confid in network provid wane , radianz and savvi tri to prove their stabil . savvi and radianz , which both special in provid the data-extranet compon of telecommun infrastructur , may see more network door open at invest bank , brokerag hous , exchang and alternative-trad system

Radianz
Savvis
network providers
data-extranet
telecommunication infrastructures
investment banks
brokerage houses
exchanges
alternative-trading systems


Algorithms for improving the quality of R-trees

Abstract: A novel approach to operation with a structure for spatial indexing of extended objects shaped as R-trees is considered. It consists of the initial global construction of an efficient R-tree structure and the subsequent operation with it using conventional dynamic algorithms. A global strategy for constructing an R-tree reduced to a problem of dividing a set of rectangular objects into K parts with minimum mutual overlay is suggested. Base, box, and "Divide and Conquer" algorithms are suggested. The results of experimental modeling of the execution of various algorithms are discussed

algorithm for improv the qualiti of r-tree
 a novel approach to oper with a structur for spatial index of extend object shape as r-tree is consid . it consist of the initi global construct of an effici r-tree structur and the subsequ oper with it use convent dynam algorithm . a global strategi for construct an r-tree reduc to a problem of divid a set of rectangular object into k part with minimum mutual overlay is suggest . base , box , and " divid and conquer " algorithm are suggest . the result of experiment model of the execut of variou algorithm are discuss

R-trees
spatial indexing
extended objects
dynamic algorithms
rectangular objects
minimum mutual overlay
graphical search
computational geometry


Developing a high-performance web server in Concurrent Haskell

Abstract: Server applications, and in particular network-based server applications, place a unique combination of demands on a programming language: lightweight concurrency, high I/O throughput, and fault tolerance are all important. This paper describes a prototype Web server written in Concurrent Haskell (with extensions), and presents two useful results: firstly, a conforming server could be written with minimal effort, leading to an implementation in less than 1500 lines of code, and secondly the naive implementation produced reasonable performance. Furthermore, making minor modifications to a few time-critical components improved performance to a level acceptable for anything but the most heavily loaded Web servers

develop a high-perform web server in concurr haskel
 server applic , and in particular network-bas server applic , place a uniqu combin of demand on a program languag : lightweight concurr , high i / o throughput , and fault toler are all import . thi paper describ a prototyp web server written in concurr haskel ( with extens ) , and present two use result : firstli , a conform server could be written with minim effort , lead to an implement in less than 1500 line of code , and secondli the naiv implement produc reason perform . furthermor , make minor modif to a few time-crit compon improv perform to a level accept for anyth but the most heavili load web server

high-performance Web server
Concurrent Haskell
network-based server applications
lightweight concurrency
high I/O throughput
fault tolerance
conforming server
time-critical components


Searching a scalable approach to cerebellar based control

Abstract: Decades of research into the structure and function of the cerebellum have led to a clear understanding of many of its cells, as well as how learning might take place. Furthermore, there are many theories on what signals the cerebellum operates on, and how it works in concert with other parts of the nervous system. Nevertheless, the application of computational cerebellar models to the control of robot dynamics remains in its infant state. To date, few applications have been realized. The currently emerging family of light-weight robots poses a new challenge to robot control: due to their complex dynamics traditional methods, depending on a full analysis of the dynamics of the system, are no longer applicable since the joints influence each other dynamics during movement. Can artificial cerebellar models compete here?

search a scalabl approach to cerebellar base control
 decad of research into the structur and function of the cerebellum have led to a clear understand of mani of it cell , as well as how learn might take place . furthermor , there are mani theori on what signal the cerebellum oper on , and how it work in concert with other part of the nervou system . nevertheless , the applic of comput cerebellar model to the control of robot dynam remain in it infant state . to date , few applic have been realiz . the current emerg famili of light-weight robot pose a new challeng to robot control : due to their complex dynam tradit method , depend on a full analysi of the dynam of the system , are no longer applic sinc the joint influenc each other dynam dure movement . can artifici cerebellar model compet here ?

scalable approach
cerebellar based control
nervous system
computational cerebellar models
light-weight robots
robot control


Local satellite

Abstract: Consumer based mobile satellite phone services went from boom to burn up in twelve months despite original forecasts predicting 10 million to 40 million users by 2005. Julian Bright wonders what prospects the technology has now and if going regional might be one answer

local satellit
 consum base mobil satellit phone servic went from boom to burn up in twelv month despit origin forecast predict 10 million to 40 million user by 2005 . julian bright wonder what prospect the technolog ha now and if go region might be one answer


Enhancing the reliability of modular medium-voltage drives

Abstract: A method to increase the reliability of modular medium-voltage induction motor drives is discussed, by providing means to bypass a failed module. The impact on reliability is shown. A control, which maximizes the output voltage available after bypass, is described, and experimental results are given

enhanc the reliabl of modular medium-voltag drive
 a method to increas the reliabl of modular medium-voltag induct motor drive is discuss , by provid mean to bypass a fail modul . the impact on reliabl is shown . a control , which maxim the output voltag avail after bypass , is describ , and experiment result are given


Generalized spatio-chromatic diffusion

Abstract: A framework for diffusion of color images is presented. The method is based on the theory of thermodynamics of irreversible transformations which provides a suitable basis for designing correlations between the different color channels. More precisely, we derive an equation for color evolution which comprises a purely spatial diffusive term and a nonlinear term that depends on the interactions among color channels over space. We apply the proposed equation to images represented in several color spaces, such as RGB, CIELAB, Opponent colors, and IHS

gener spatio-chromat diffus
 a framework for diffus of color imag is present . the method is base on the theori of thermodynam of irrevers transform which provid a suitabl basi for design correl between the differ color channel . more precis , we deriv an equat for color evolut which compris a pure spatial diffus term and a nonlinear term that depend on the interact among color channel over space . we appli the propos equat to imag repres in sever color space , such as rgb , cielab , oppon color , and ih

generalized spatio-chromatic diffusion
diffusion
color images
thermodynamics
irreversible transformations
color channels
color evolution
spatial diffusive term
nonlinear term
RGB
CIELAB
Opponent colors
IHS
vector-valued diffusion
scale-space


Understanding Internet traffic streams: dragonflies and tortoises

Abstract: We present the concept of network traffic streams and the ways they aggregate into flows through Internet links. We describe a method of measuring the size and lifetime of Internet streams, and use this method to characterize traffic distributions at two different sites. We find that although most streams (about 45 percent of them) are dragonflies, lasting less than 2 seconds, a significant number of streams have lifetimes of hours to days, and can carry a high proportion (50-60 percent) of the total bytes on a given link. We define tortoises as streams that last longer than 15 minutes. We point out that streams can be classified not only by lifetime (dragonflies and tortoises) but also by size (mice and elephants), and note that stream size and lifetime are independent dimensions. We submit that ISPs need to be aware of the distribution of Internet stream sizes, and the impact of the difference in behavior between short and long streams. In particular, any forwarding cache mechanisms in Internet routers must be able to cope with a high volume of short streams. In addition ISPs should realize that long-running streams can contribute a significant fraction of their packet and byte volumes-something they may not have allowed for when using traditional "flat rate user bandwidth consumption" approaches to provisioning and engineering

understand internet traffic stream : dragonfli and tortois
 we present the concept of network traffic stream and the way they aggreg into flow through internet link . we describ a method of measur the size and lifetim of internet stream , and use thi method to character traffic distribut at two differ site . we find that although most stream ( about 45 percent of them ) are dragonfli , last less than 2 second , a signific number of stream have lifetim of hour to day , and can carri a high proport ( 50 - 60 percent ) of the total byte on a given link . we defin tortois as stream that last longer than 15 minut . we point out that stream can be classifi not onli by lifetim ( dragonfli and tortois ) but also by size ( mice and eleph ) , and note that stream size and lifetim are independ dimens . we submit that isp need to be awar of the distribut of internet stream size , and the impact of the differ in behavior between short and long stream . in particular , ani forward cach mechan in internet router must be abl to cope with a high volum of short stream . in addit isp should realiz that long-run stream can contribut a signific fraction of their packet and byte volumes-someth they may not have allow for when use tradit " flat rate user bandwidth consumpt " approach to provis and engin

Internet traffic streams
dragonflies
tortoises
network traffic streams
traffic distributions
mice
elephants
ISP
forwarding cache mechanisms
Internet routers
long-running streams
Internet stream size measurement
Internet stream lifetime measurement
packet volume
byte volume
traffic provisioning
traffic engineering


Two quantum analogues of Fisher information from a large deviation viewpoint of quantum estimation

Abstract: We discuss two quantum analogues of the Fisher information, the symmetric logarithmic derivative Fisher information and Kubo-Mori-Bogoljubov Fisher information from a large deviation viewpoint of quantum estimation and prove that the former gives the true bound and the latter gives the bound of consistent superefficient estimators. As another comparison, it is shown that the difference between them is characterized by the change of the order of limits

two quantum analogu of fisher inform from a larg deviat viewpoint of quantum estim
 we discuss two quantum analogu of the fisher inform , the symmetr logarithm deriv fisher inform and kubo-mori-bogoljubov fisher inform from a larg deviat viewpoint of quantum estim and prove that the former give the true bound and the latter give the bound of consist supereffici estim . as anoth comparison , it is shown that the differ between them is character by the chang of the order of limit


Ride quality evaluation of an actively-controlled stretcher for an ambulance

Abstract: This study considers the subjective evaluation of ride quality during ambulance transportation using an actively-controlled stretcher (ACS). The ride quality of a conventional stretcher and an assistant driver's seat is also compared. Braking during ambulance transportation generates negative foot-to-head acceleration in patients and causes blood pressure to rise in the patient's head. The ACS absorbs the foot-to-head acceleration by changing the angle of the stretcher, thus reducing the blood pressure variation. However, the ride quality of the ACS should be investigated further because the movement of the ACS may cause motion sickness and nausea. Experiments of ambulance transportation, including rapid acceleration and deceleration, are performed to evaluate the effect of differences in posture of the transported subject on the ride quality; the semantic differential method and factor analysis are used in the investigations. Subjects are transported using a conventional stretcher with head forward, a conventional stretcher with head backward, the ACS, and an assistant driver's seat for comparison with transportation using a stretcher. Experimental results show that the ACS gives the most comfortable transportation when using a stretcher. Moreover, the reduction of the negative foot-to-head acceleration at frequencies below 0.2 Hz and the small variation of the foot-to-head acceleration result in more comfortable transportation. Conventional transportation with the head forward causes the worst transportation, although the characteristics of the vibration of the conventional stretcher seem to be superior to that of the ACS

ride qualiti evalu of an actively-control stretcher for an ambul
 thi studi consid the subject evalu of ride qualiti dure ambul transport use an actively-control stretcher ( ac ) . the ride qualiti of a convent stretcher and an assist driver 's seat is also compar . brake dure ambul transport gener neg foot-to-head acceler in patient and caus blood pressur to rise in the patient 's head . the ac absorb the foot-to-head acceler by chang the angl of the stretcher , thu reduc the blood pressur variat . howev , the ride qualiti of the ac should be investig further becaus the movement of the ac may caus motion sick and nausea . experi of ambul transport , includ rapid acceler and deceler , are perform to evalu the effect of differ in postur of the transport subject on the ride qualiti ; the semant differenti method and factor analysi are use in the investig . subject are transport use a convent stretcher with head forward , a convent stretcher with head backward , the ac , and an assist driver 's seat for comparison with transport use a stretcher . experiment result show that the ac give the most comfort transport when use a stretcher . moreov , the reduct of the neg foot-to-head acceler at frequenc below 0.2 hz and the small variat of the foot-to-head acceler result in more comfort transport . convent transport with the head forward caus the worst transport , although the characterist of the vibrat of the convent stretcher seem to be superior to that of the ac

ride quality evaluation
actively-controlled stretcher
ambulance
subjective evaluation
ambulance transportation
conventional stretcher
braking
negative foot-to-head acceleration
blood pressure variation
motion sickness
nausea
rapid acceleration
transported subject
semantic differential method
factor analysis
head forward
head backward
comfortable transportation
vibration
assistant driver seat
patient head
stretcher angle
rapid deceleration
posture differences

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


C and C++: a case for compatibility

Abstract: Modern C and C++ are sibling languages descended from Classic C. In many people's minds, they are (wrongly, but understandably) fused into the mythical C/C++ programming language. There is no C/C++ language, but there is a C/C++ community. Previously the author described some of the incompatibilities that complicate the work of developers within that C/C++ community. In this article, he discusses some of the underlying myths that help perpetuate these incompatibilities. He also shows why more compatibility (ideally, full compatibility) is in the best interest of the C/C++ community. In the next paper, he presents some examples of how the incompatibilities in C and C++ might be resolved

c and c++ : a case for compat
 modern c and c++ are sibl languag descend from classic c. in mani peopl 's mind , they are ( wrongli , but understand ) fuse into the mythic c / c++ program languag . there is no c / c++ languag , but there is a c / c++ commun . previous the author describ some of the incompat that complic the work of develop within that c / c++ commun . in thi articl , he discuss some of the underli myth that help perpetu these incompat . he also show whi more compat ( ideal , full compat ) is in the best interest of the c / c++ commun . in the next paper , he present some exampl of how the incompat in c and c++ might be resolv

C++ language
incompatibilities
C language
object-oriented programming
class hierarchies
low-level programming
C++ libraries


Bluetooth bites back

Abstract: It is now more than four years since we started to hear about Bluetooth, and from the user's point of view very little seems to have happened since then. Paul Haddlesey looks at the progress, and the role Bluetooth may eventually play in your firm's communications strategy

bluetooth bite back
 it is now more than four year sinc we start to hear about bluetooth , and from the user 's point of view veri littl seem to have happen sinc then . paul haddlesey look at the progress , and the role bluetooth may eventu play in your firm 's commun strategi

Bluetooth
communications strategy
wireless connection
mobile


Oracle's Suite grows up

Abstract: Once a low-cost Web offering, Oracle's Small Business Suite now carries a price tag to justify VAR interest

oracl 's suit grow up
 onc a low-cost web offer , oracl 's small busi suit now carri a price tag to justifi var interest

Oracle Small Business Suite
NetLedger
accounting
resellers


Support communities for women in computing

Abstract: This article highlights the many activities provided by the support communities available for women in computing. Thousands of women actively participate in these programs and they receive many benefits including networking and professional support. In addition, the organizations and associations help promote the accomplishments of women computer scientists and disseminate valuable information. This article surveys some of these organizations and concludes with a list of suggestions for how faculty members can incorporate the benefits of these organizations in their own institutions

support commun for women in comput
 thi articl highlight the mani activ provid by the support commun avail for women in comput . thousand of women activ particip in these program and they receiv mani benefit includ network and profession support . in addit , the organ and associ help promot the accomplish of women comput scientist and dissemin valuabl inform . thi articl survey some of these organ and conclud with a list of suggest for how faculti member can incorpor the benefit of these organ in their own institut

support communities
women
computing
networking
professional support
faculty members
information dissemination


ERP systems implementation: Best practices in Canadian government organizations

Abstract: ERP (Enterprise resource planning) systems implementation is a complex exercise in organizational innovation and change management. Government organizations are increasing their adoption of these systems for various benefits such as integrated real-time information, better administration, and result-based management. Government organizations, due to their social obligations, higher legislative and public accountability, and unique culture face many specific challenges in the transition to enterprise systems. This motivated the authors to explore the key considerations and typical activities in government organizations adopting ERP systems. The article adopts the innovation process theory framework as well as the (Markus & Tanis, 2000) model as a basis to delineate the ERP adoption process. Although, each adopting organization has a distinct set of objectives for its systems, the study found many similarities in motivations, concerns, and strategies across organizations

erp system implement : best practic in canadian govern organ
 erp ( enterpris resourc plan ) system implement is a complex exercis in organiz innov and chang manag . govern organ are increas their adopt of these system for variou benefit such as integr real-tim inform , better administr , and result-bas manag . govern organ , due to their social oblig , higher legisl and public account , and uniqu cultur face mani specif challeng in the transit to enterpris system . thi motiv the author to explor the key consider and typic activ in govern organ adopt erp system . the articl adopt the innov process theori framework as well as the ( marku & tani , 2000 ) model as a basi to delin the erp adopt process . although , each adopt organ ha a distinct set of object for it system , the studi found mani similar in motiv , concern , and strategi across organ

ERP systems implementation
best practices
Canadian government organizations
enterprise resource planning
integrated real-time information
administration
result-based management
social obligations
public accountability
innovation process theory framework
higher legislative accountability


The network society as seen from Italy

Abstract: Italy was behind the European average in Internet development for many years, but a new trend, which has brought considerable change, emerged at the end of 1998 and showed its effects in 2000 and the following years. Now Italy is one of the top ten countries worldwide in Internet hostcount and the fourth largest in Europe. The density of Internet activity in Italy in proportion to the population is still below the average in the European Union, but is growing faster than Germany, the UK and France, and faster than the worldwide or European average. From the point of view of media control there are several problems. Italy has democratic institutions and freedom of speech, but there is an alarming concentration in the control of mainstream media (especially broadcast). There are no officially declared restrictions in the use of the Internet, but several legal and regulatory decisions reveal a desire to limit freedom of opinion and dialogue and/or gain centralized control of the Net

the network societi as seen from itali
 itali wa behind the european averag in internet develop for mani year , but a new trend , which ha brought consider chang , emerg at the end of 1998 and show it effect in 2000 and the follow year . now itali is one of the top ten countri worldwid in internet hostcount and the fourth largest in europ . the densiti of internet activ in itali in proport to the popul is still below the averag in the european union , but is grow faster than germani , the uk and franc , and faster than the worldwid or european averag . from the point of view of media control there are sever problem . itali ha democrat institut and freedom of speech , but there is an alarm concentr in the control of mainstream media ( especi broadcast ) . there are no offici declar restrict in the use of the internet , but sever legal and regulatori decis reveal a desir to limit freedom of opinion and dialogu and/or gain central control of the net

network society
Italy
European average
Europe
Internet development
Internet hostcount
Internet activity
European Union
Germany
UK
France
media control
democratic institutions
freedom of speech
mainstream media
regulatory decisions
centralized control
worldwide average
broadcast media
legal decisions