On deciding stability of constrained homogeneous random walks and queueing systems

Abstract: We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certain generalized priority policy and prove that the stability of this policy is algorithmically undecidable. We also prove that stability of a homogeneous random walk in L/sub +//sup d/ is undecidable. Finally, we show that the problem of computing a fluid limit of a queueing system or of a constrained homogeneous random walk is undecidable. To the best of our knowledge these are the first undecidability results in the area of stability of queueing systems and random walks in L/sub +//sup d/. We conjecture that stability of common policies like First-In-First-Out and priority policy is also an undecidable problem

on decid stabil of constrain homogen random walk and queue system
 we investig stabil of schedul polici in queue system . to thi day no algorithm character exist for check stabil of a given polici in a given queue system . in thi paper we introduc a certain gener prioriti polici and prove that the stabil of thi polici is algorithm undecid . we also prove that stabil of a homogen random walk in l / sub + //sup d/ is undecid . final , we show that the problem of comput a fluid limit of a queue system or of a constrain homogen random walk is undecid . to the best of our knowledg these are the first undecid result in the area of stabil of queue system and random walk in l / sub + //sup d/. we conjectur that stabil of common polici like first-in-first-out and prioriti polici is also an undecid problem

constrained homogeneous random walks
queueing systems
generalized priority policy
priority policy
undecidability results
undecidable problem
scheduling policy stability
homogeneous random walk stability
fluid limit computation
first-in-first-out policy


Marble cutting with single point cutting tool and diamond segments

Abstract: An investigation has been undertaken into the frame sawing with diamond blades. The kinematic behaviour of the frame sawing process is discussed. Under different cutting conditions, cutting and indenting-cutting tests are carried out by single point cutting tools and single diamond segments. The results indicate that the depth of cut per diamond grit increases as the blades move forward. Only a few grits per segment can remove the material in the cutting process. When the direction of the stroke changes, the cutting forces do not decrease to zero because of the residual plastic deformation beneath the diamond grits. The plastic deformation and fracture chipping of material are the dominant removal processes, which can be explained by the fracture theory of brittle material indentation

marbl cut with singl point cut tool and diamond segment
 an investig ha been undertaken into the frame saw with diamond blade . the kinemat behaviour of the frame saw process is discuss . under differ cut condit , cut and indenting-cut test are carri out by singl point cut tool and singl diamond segment . the result indic that the depth of cut per diamond grit increas as the blade move forward . onli a few grit per segment can remov the materi in the cut process . when the direct of the stroke chang , the cut forc do not decreas to zero becaus of the residu plastic deform beneath the diamond grit . the plastic deform and fractur chip of materi are the domin remov process , which can be explain by the fractur theori of brittl materi indent

marble cutting
single point cutting tool
diamond segments
frame sawing
kinematic behaviour
indenting-cutting tests
residual plastic deformation
fracture chipping
removal processes
fracture theory
brittle material indentation
cutting tests


The Advanced Encryption Standard - implementation and transition to a new cryptographic benchmark

Abstract: Cryptography is the science of coding information to create unintelligible ciphers that conceal or hide messages. The process that achieves this goal is commonly referred to as encryption. Although encryption processes of various forms have been employed for centuries to protect the exchange of messages, the advent of the information age has underscored the importance of strong cryptography as a process to secure data exchanged through electronic means, and has accentuated the demand for products offering these services. This article describes the process that has led to the development of the latest cryptographic benchmark; the Advanced Encryption Standard (AES). The article briefly examines the requirements set forth for its development, defines how the new standard is implemented, and describes how government, business, and industry can transition to AES with minimum impact to operations

the advanc encrypt standard - implement and transit to a new cryptograph benchmark
 cryptographi is the scienc of code inform to creat unintellig cipher that conceal or hide messag . the process that achiev thi goal is commonli refer to as encrypt . although encrypt process of variou form have been employ for centuri to protect the exchang of messag , the advent of the inform age ha underscor the import of strong cryptographi as a process to secur data exchang through electron mean , and ha accentu the demand for product offer these servic . thi articl describ the process that ha led to the develop of the latest cryptograph benchmark ; the advanc encrypt standard ( ae ) . the articl briefli examin the requir set forth for it develop , defin how the new standard is implement , and describ how govern , busi , and industri can transit to ae with minimum impact to oper

Advanced Encryption Standard
cryptographic benchmark
coding
unintelligible ciphers
data exchange
AES
government
business
industry


Compatibility comparison and performance evaluation for Japanese HPF compilers using scientific applications

Abstract: The lack of compatibility of High-Performance Fortran (HPF) between vender implementations has been disheartening scientific application users so as to hinder the development of portable programs. Thus parallel computing is still unpopular in the computational science community, even though parallel programming is common to the computer science community. As users would like to run the same source code on parallel machines with different architectures as fast as possible, we have investigated the compatibility of source codes for Japanese HPF compilers (NEC, Fujitsu and Hitachi) with two real-world applications: a 3D fluid code and a 2D particle code. We have found that the source-level compatibility between Japanese HPF compilers is almost preserved, but more effort will be needed to sustain complete compatibility. We have also evaluated parallel performance and found that HPF can achieve good performance for the 3D fluid code with almost the same source code. For the 2D particle code, good results have also been obtained with a small number of processors, but some changes in the original source code and the addition of interface blocks is required

compat comparison and perform evalu for japanes hpf compil use scientif applic
 the lack of compat of high-perform fortran ( hpf ) between vender implement ha been dishearten scientif applic user so as to hinder the develop of portabl program . thu parallel comput is still unpopular in the comput scienc commun , even though parallel program is common to the comput scienc commun . as user would like to run the same sourc code on parallel machin with differ architectur as fast as possibl , we have investig the compat of sourc code for japanes hpf compil ( nec , fujitsu and hitachi ) with two real-world applic : a 3d fluid code and a 2d particl code . we have found that the source-level compat between japanes hpf compil is almost preserv , but more effort will be need to sustain complet compat . we have also evalu parallel perform and found that hpf can achiev good perform for the 3d fluid code with almost the same sourc code . for the 2d particl code , good result have also been obtain with a small number of processor , but some chang in the origin sourc code and the addit of interfac block is requir

HPF
compilers
High-Performance Fortran
portable programs
parallel programming
parallel performance
source compatability


Towards an ontology of approximate reason

Abstract: This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an agent. Agents are designed to classify information granules derived from sensors that respond to stimuli in the environment of an agent or received from other agents. Classification of information granules is carried out in the context of parameterized approximation spaces and a calculus of granules. Judgment in agents is a faculty of thinking about (classifying) the particular relative to decision rules derived from data. Judgment in agents is reflective, but not in the classical philosophical sense (e.g., the notion of judgment in Kant). In an agent, a reflective judgment itself is an assertion that a particular decision rule derived from data is applicable to an object (input). That is, a reflective judgment by an agent is an assertion that a particular vector of attribute (sensor) values matches to some degree the conditions for a particular rule. In effect, this form of judgment is an assertion that a vector of sensor values reflects a known property of data expressed by a decision rule. Since the reasoning underlying a reflective judgment is inductive and surjective (not based on a priori conditions or universals), this form of judgment is reflective, but not in the sense of Kant. Unlike Kant, a reflective judgment is surjective in the sense that it maps experimental attribute values onto the most closely matching descriptors (conditions) in a derived rule. Again, unlike Kant's notion of judgment, a reflective judgment is not the result of searching for a universal that pertains to a particular set of values of descriptors. Rather, a reflective judgment by an agent is a form of recognition that a particular vector of sensor values pertains to a particular rule in some degree. This recognition takes the form of an assertion that a particular descriptor vector is associated with a particular decision rule. These considerations can be repeated for other forms of classifiers besides those defined by decision rules

toward an ontolog of approxim reason
 thi articl introduc structur aspect in an ontolog of approxim reason . the basic assumpt in thi ontolog is that approxim reason is a capabl of an agent . agent are design to classifi inform granul deriv from sensor that respond to stimuli in the environ of an agent or receiv from other agent . classif of inform granul is carri out in the context of parameter approxim space and a calculu of granul . judgment in agent is a faculti of think about ( classifi ) the particular rel to decis rule deriv from data . judgment in agent is reflect , but not in the classic philosoph sens ( e.g. , the notion of judgment in kant ) . in an agent , a reflect judgment itself is an assert that a particular decis rule deriv from data is applic to an object ( input ) . that is , a reflect judgment by an agent is an assert that a particular vector of attribut ( sensor ) valu match to some degre the condit for a particular rule . in effect , thi form of judgment is an assert that a vector of sensor valu reflect a known properti of data express by a decis rule . sinc the reason underli a reflect judgment is induct and surject ( not base on a priori condit or univers ) , thi form of judgment is reflect , but not in the sens of kant . unlik kant , a reflect judgment is surject in the sens that it map experiment attribut valu onto the most close match descriptor ( condit ) in a deriv rule . again , unlik kant 's notion of judgment , a reflect judgment is not the result of search for a univers that pertain to a particular set of valu of descriptor . rather , a reflect judgment by an agent is a form of recognit that a particular vector of sensor valu pertain to a particular rule in some degre . thi recognit take the form of an assert that a particular descriptor vector is associ with a particular decis rule . these consider can be repeat for other form of classifi besid those defin by decis rule

ontology
approximate reason
information granules
granules
parameterized approximation spaces
decision rules
reflective judgment
pattern recognition
rough sets


Approximate confidence intervals for one proportion and difference of two proportions

Abstract: Constructing a confidence interval for a binomial proportion or the difference of two proportions is a routine exercise in daily data analysis. The best-known method is the Wald interval based on the asymptotic normal approximation to the distribution of the observed sample proportion, though it is known to have bad performance for small to medium sample sizes. Agresti et al. (1998, 2000) proposed an Adding-4 method: 4 pseudo-observations are added with 2 successes and 2 failures and then the resulting (pseudo-)sample proportion is used. The method is simple and performs extremely well. Here we propose an approximate method based on a t-approximation that takes account of the uncertainty in estimating the variance of the observed (pseudo-)sample proportion. It follows the same line of using a t-test, rather than z-test, in testing the mean of a normal distribution with an unknown variance. For some circumstances our proposed method has a higher coverage probability than the Adding-4 method

approxim confid interv for one proport and differ of two proport
 construct a confid interv for a binomi proport or the differ of two proport is a routin exercis in daili data analysi . the best-known method is the wald interv base on the asymptot normal approxim to the distribut of the observ sampl proport , though it is known to have bad perform for small to medium sampl size . agresti et al . ( 1998 , 2000 ) propos an adding-4 method : 4 pseudo-observ are ad with 2 success and 2 failur and then the result ( pseudo-)sampl proport is use . the method is simpl and perform extrem well . here we propos an approxim method base on a t-approxim that take account of the uncertainti in estim the varianc of the observ ( pseudo-)sampl proport . it follow the same line of use a t-test , rather than z-test , in test the mean of a normal distribut with an unknown varianc . for some circumst our propos method ha a higher coverag probabl than the adding-4 method

approximate confidence intervals
difference of two proportions
binomial proportion
data analysis
t-approximation
uncertainty
t-test
normal distribution
coverage probability
variance estimation
pseudo-sample proportion


Efficient tracking of the cross-correlation coefficient

Abstract: In many (audio) processing algorithms, involving manipulation of discrete-time signals, the performance can vary strongly over the repertoire that is used. This may be the case when the signals from the various channels are allowed to be strongly positively or negatively correlated. We propose and analyze a general formula for tracking the (time-dependent) correlation between two signals. Some special cases of this formula lead to classical results known from the literature, others are new. This formula is recursive in nature, and uses only the instantaneous values of the two signals, in a low-cost and low-complexity manner; in particular, there is no need to take square roots or to carry out divisions. Furthermore, this formula can be modified with respect to the occurrence of the two signals so as to further decrease the complexity, and increase ease of implementation. The latter modification comes at the expense that not the actual correlation is tracked, but, rather, a somewhat deformed version of it. To overcome this problem, we propose, for a number of instances of the tracking formula, a simple warping operation on the deformed correlation. Now we obtain, at least for sinusoidal signals, the correct value of the correlation coefficient. Special attention is paid to the convergence behavior of the algorithm for stationary signals and the dynamic behavior if there is a transition to another stationary state; the latter is considered to be important to study the tracking abilities to nonstationary signals. We illustrate tracking algorithm by using it for stereo music fragments, obtained from a number of digital audio recordings

effici track of the cross-correl coeffici
 in mani ( audio ) process algorithm , involv manipul of discrete-tim signal , the perform can vari strongli over the repertoir that is use . thi may be the case when the signal from the variou channel are allow to be strongli posit or neg correl . we propos and analyz a gener formula for track the ( time-depend ) correl between two signal . some special case of thi formula lead to classic result known from the literatur , other are new . thi formula is recurs in natur , and use onli the instantan valu of the two signal , in a low-cost and low-complex manner ; in particular , there is no need to take squar root or to carri out divis . furthermor , thi formula can be modifi with respect to the occurr of the two signal so as to further decreas the complex , and increas eas of implement . the latter modif come at the expens that not the actual correl is track , but , rather , a somewhat deform version of it . to overcom thi problem , we propos , for a number of instanc of the track formula , a simpl warp oper on the deform correl . now we obtain , at least for sinusoid signal , the correct valu of the correl coeffici . special attent is paid to the converg behavior of the algorithm for stationari signal and the dynam behavior if there is a transit to anoth stationari state ; the latter is consid to be import to studi the track abil to nonstationari signal . we illustr track algorithm by use it for stereo music fragment , obtain from a number of digit audio record

efficient tracking
cross-correlation coefficient
discrete-time signals
warping operation
deformed correlation
sinusoidal signals
convergence behavior
stationary signals
dynamic behavior
stationary state
nonstationary signals
tracking algorithm
stereo music fragments
digital audio recording
audio processing algorithms
time-dependent correlation
recursive formula


The road ahead [supply chains]

Abstract: Executive supply chain managers, says David Metcalfe of Forrester Research, need the skills and precision of Mongolian archers on horseback. They must be able to hit their target, in this case customer demand, while moving at great speed. But what is wrong with the supply chains companies have in place already? According to Metcalfe, current manufacturing models are too inflexible. A recent survey conducted by Forrester Research supports this claim. It found that 42% of respondents could not transfer production from one plant to another in the event of a glitch in the supply chain. A further 32% said it would be possible, but extremely costly

the road ahead [ suppli chain ]
 execut suppli chain manag , say david metcalf of forrest research , need the skill and precis of mongolian archer on horseback . they must be abl to hit their target , in thi case custom demand , while move at great speed . but what is wrong with the suppli chain compani have in place alreadi ? accord to metcalf , current manufactur model are too inflex . a recent survey conduct by forrest research support thi claim . it found that 42 % of respond could not transfer product from one plant to anoth in the event of a glitch in the suppli chain . a further 32 % said it would be possibl , but extrem costli

supply chains
Forrester Research
manufacturing
survey
business networks


Pairwise thermal entanglement in the n-qubit (n <or= 5) Heisenberg XX chain

Abstract: We have calculated the concurrence of the pairwise thermal entanglement for the four-qubit and five-qubit Heisenberg XX chain. It is found that there is a great difference between the even-qubit and the odd-qubit chain in the aspect of the critical temperature and of the existence of the entanglement for the case of the qubit number n no more than 5

pairwis thermal entangl in the n-qubit ( n < or= 5 ) heisenberg xx chain
 we have calcul the concurr of the pairwis thermal entangl for the four-qubit and five-qubit heisenberg xx chain . it is found that there is a great differ between the even-qubit and the odd-qubit chain in the aspect of the critic temperatur and of the exist of the entangl for the case of the qubit number n no more than 5

pairwise thermal entanglement
five-qubit Heisenberg XX chain
odd-qubit chain
critical temperature
four-qubit Heisenberg XX chain
even-qubit chain


Government budget and accounting information policy and practice in Taiwan

Abstract: The principal government budget and accounting information policies in Taiwan are founded on the ability to provide integrated, consistent, and timely information for government managers to make more rational decisions concerning national resource allocation and evaluation. A specific accounting organization system has been designed for this purpose. This paper analyzes information policies and practices according to the relevant laws and regulations, identifies issues regarding the policies, and presents strategies to resolve the issues

govern budget and account inform polici and practic in taiwan
 the princip govern budget and account inform polici in taiwan are found on the abil to provid integr , consist , and time inform for govern manag to make more ration decis concern nation resourc alloc and evalu . a specif account organ system ha been design for thi purpos . thi paper analyz inform polici and practic accord to the relev law and regul , identifi issu regard the polici , and present strategi to resolv the issu

Generally Accepted Accounting Principles


ICANN and Internet governance: leveraging technical coordination to realize global public policy

Abstract: The Internet Corporation for Assigned Names and Numbers (ICANN) was created in 1998 to perform technical coordination of the Internet. ICANN also lays the foundations for governance, creating capabilities for promulgating and enforcing global regulations on Internet use. ICANN leverages the capabilities in the Internet domain name system (DNS) to implement four mechanisms of governance: authority, law, sanctions, and jurisdictions. These governance-related features are embodied in seemingly technical features of ICANN's institutional design. Recognition of ICANN's governance mechanisms allows us to better understand the Internet's emerging regulatory regime

icann and internet govern : leverag technic coordin to realiz global public polici
 the internet corpor for assign name and number ( icann ) wa creat in 1998 to perform technic coordin of the internet . icann also lay the foundat for govern , creat capabl for promulg and enforc global regul on internet use . icann leverag the capabl in the internet domain name system ( dn ) to implement four mechan of govern : author , law , sanction , and jurisdict . these governance-rel featur are embodi in seemingli technic featur of icann 's institut design . recognit of icann 's govern mechan allow us to better understand the internet 's emerg regulatori regim


Novel approach to super-resolution pits readout

Abstract: We proposed a novel method to realize the readout of super-resolution pits by using a super-resolution reflective film to replace the reflective layer of the conventional ROM. At the same time, by using Sb as the super-resolution reflective layer and SiN as a dielectric layer, the super-resolution pits with diameters of 380 nm were read out by a setup whose laser wavelength is 632.8 nm and numerical aperture is 0.40. In addition, the influence of the Sb thin film thickness on the readout signal was investigated, the results showed that the optimum Sb thin film thickness is 28 to 30 nm, and the maximum CNR is 38 to 40 dB

novel approach to super-resolut pit readout
 we propos a novel method to realiz the readout of super-resolut pit by use a super-resolut reflect film to replac the reflect layer of the convent rom . at the same time , by use sb as the super-resolut reflect layer and sin as a dielectr layer , the super-resolut pit with diamet of 380 nm were read out by a setup whose laser wavelength is 632.8 nm and numer apertur is 0.40 . in addit , the influenc of the sb thin film thick on the readout signal wa investig , the result show that the optimum sb thin film thick is 28 to 30 nm , and the maximum cnr is 38 to 40 db

super-resolution pits readout
super-resolution reflective film
380 nm
632.8 nm
numerical aperture
Sb thin film thickness
readout signal
28 to 30 nm
maximum CNR
Sb super-resolution reflective layer
SiN dielectric layer
Sb-SiN


On the contractivity of implicit-explicit linear multistep methods

Abstract: This paper is concerned with the class of implicit-explicit linear multistep methods for the numerical solution of initial value problems for ordinary differential equations which are composed of stiff and nonstiff parts. We study the contractivity of such methods, with regard to linear autonomous systems of ordinary differential equations and a (scaled) Euclidean norm. In addition, we derive a strong stability result based on the stability regions of these methods

on the contract of implicit-explicit linear multistep method
 thi paper is concern with the class of implicit-explicit linear multistep method for the numer solut of initi valu problem for ordinari differenti equat which are compos of stiff and nonstiff part . we studi the contract of such method , with regard to linear autonom system of ordinari differenti equat and a ( scale ) euclidean norm . in addit , we deriv a strong stabil result base on the stabil region of these method


Handles and exception safety, Part 1. A simple handle class

Abstract: Every C++ program that uses inheritance must manage memory somehow. The most obvious way to do so is directly, but programmers who create complicated data structures often have trouble figuring out what parts of those data structures are safe to delete when. The classical method of dealing with such complexity is to hide it in a class. Such classes are typically called handles; the idea is to attach a handle object to another object that contains the actual data. The simplest form of a handle, which we have discussed in this article, is one in which each handle object corresponds to a single object from the inheritance hierarchy. Such handles are straightforward to use and to implement and tend to be intrinsically exception safe in almost all respects. The one exception hazard in such a class is typically the assignment operator. Assignment operators often test for self-assignment to avoid aliasing problems. As Herb Sutter has observed (2000), programs that need such tests are almost always exception unsafe. By rewriting the assignment operator, we ensure that we do not do anything irrevocable until the possibility of throwing an exception has passed. This strategy ensures that if an exception occurs while our assignment operator is executing, we do not corrupt the rest of our system

handl and except safeti , part 1 . a simpl handl class
 everi c++ program that use inherit must manag memori somehow . the most obviou way to do so is directli , but programm who creat complic data structur often have troubl figur out what part of those data structur are safe to delet when . the classic method of deal with such complex is to hide it in a class . such class are typic call handl ; the idea is to attach a handl object to anoth object that contain the actual data . the simplest form of a handl , which we have discuss in thi articl , is one in which each handl object correspond to a singl object from the inherit hierarchi . such handl are straightforward to use and to implement and tend to be intrins except safe in almost all respect . the one except hazard in such a class is typic the assign oper . assign oper often test for self-assign to avoid alias problem . as herb sutter ha observ ( 2000 ) , program that need such test are almost alway except unsaf . by rewrit the assign oper , we ensur that we do not do anyth irrevoc until the possibl of throw an except ha pass . thi strategi ensur that if an except occur while our assign oper is execut , we do not corrupt the rest of our system

handles
exception
C++ program
inheritance hierarchy
assignment operator
self-assignment
aliasing problems


Creating the right mail model

Abstract: If you know your post room is not as efficiently organised as it might be, but you are not sure how best to go about making improvements, then consider this advice from John Edgar of consultant MCS

creat the right mail model
 if you know your post room is not as effici organis as it might be , but you are not sure how best to go about make improv , then consid thi advic from john edgar of consult mc


eLeaders make the Web work

Abstract: Some companies are making the most of back-office/Web integration. Here are some winners

elead make the web work
 some compani are make the most of back-offic / web integr . here are some winner

back-office/Web integration
e-commerce
Visual Integrator
Accpac eTransact


Leveraging an alternative source of computer scientists: reentry programs

Abstract: Much has been written about the leaky pipeline of women in computer science (CS), with the percentage of women decreasing as one moves from lower levels, such as college, to higher levels, culminating in full professorship. While significant attention focused on keeping women from leaving the pipeline, there is also an opportunity to bring women into the pipeline through non-traditional programs, instead of requiring that everyone enter at the undergraduate level. Both Mills College, a small liberal arts institution for women, and UC Berkeley, a large research university, established programs in the 80's to increase the number of women in computer science by tapping non-traditional students. Both programs share the core value of accommodating older students lacking technical backgrounds. The two programs have produced similar results: graduate degrees earned in computer science by students who would not have qualified without these programs, professional employment in the computer science field by women and minorities, and a recognition that this population represents a rich source of talent for our nation

leverag an altern sourc of comput scientist : reentri program
 much ha been written about the leaki pipelin of women in comput scienc ( cs ) , with the percentag of women decreas as one move from lower level , such as colleg , to higher level , culmin in full professorship . while signific attent focus on keep women from leav the pipelin , there is also an opportun to bring women into the pipelin through non-tradit program , instead of requir that everyon enter at the undergradu level . both mill colleg , a small liber art institut for women , and uc berkeley , a larg research univers , establish program in the 80 's to increas the number of women in comput scienc by tap non-tradit student . both program share the core valu of accommod older student lack technic background . the two program have produc similar result : graduat degre earn in comput scienc by student who would not have qualifi without these program , profession employ in the comput scienc field by women and minor , and a recognit that thi popul repres a rich sourc of talent for our nation

reentry programs
women
computer science
Mills College
UC Berkeley
students
graduate degrees
professional employment
minorities


Disposable mobiles

Abstract: After many delays, the reusable, recyclable, disposable mobile phone is finally going on sale in the US. But with a business model largely dependent on niche markets, Elizabeth Biddlecombe asks if these simplified handsets will be good enough to survive a brutal market

dispos mobil
 after mani delay , the reusabl , recycl , dispos mobil phone is final go on sale in the us . but with a busi model larg depend on nich market , elizabeth biddlecomb ask if these simplifi handset will be good enough to surviv a brutal market

reusable
recyclable
disposable mobile phone
simplified handsets


PageFlex + MediaRich = PageRich

Abstract: Layout and graphics innovators collaborate on fully variable combination. Pageflex and Equilibrium have melded their respective EDIT and MediaRich technologies to make a variable-data composition engine with a Web interface. Though a first-generation effort, it shows substantial promise

pageflex + mediarich = pagerich
 layout and graphic innov collabor on fulli variabl combin . pageflex and equilibrium have meld their respect edit and mediarich technolog to make a variable-data composit engin with a web interfac . though a first-gener effort , it show substanti promis

PageFlex
MediaRich
PageRich
layout
graphics
composition
software houses


An entanglement measure based on the capacity of dense coding

Abstract: An asymptotic entanglement measure for any bipartite states is derived in the light of the dense coding capacity optimized with respect to local quantum operations and classical communications. General properties and some examples with explicit forms of this entanglement measure are investigated

an entangl measur base on the capac of dens code
 an asymptot entangl measur for ani bipartit state is deriv in the light of the dens code capac optim with respect to local quantum oper and classic commun . gener properti and some exampl with explicit form of thi entangl measur are investig

entanglement measure
asymptotic entanglement measure
bipartite states
dense coding capacity
optimization
local quantum operations
classical communications


Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems

Abstract: OpenMP is emerging as a viable high-level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache-coherent Non-Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop-level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high-performance computation on an important class of modern architectures

achiev perform under openmp on ccnuma and softwar distribut share memori system
 openmp is emerg as a viabl high-level program model for share memori parallel system . it wa conceiv to enabl easi , portabl applic develop on thi rang of system , and it ha also been implement on cache-coher non-uniform memori access ( ccnuma ) architectur . unfortun , it is hard to obtain high perform on the latter architectur , particularli when larg number of thread are involv . in thi paper , we discuss the difficulti face when write openmp program for ccnuma system , and explain how the vendor have attempt to overcom them . we focu on one such system , the sgi origin 2000 , and perform a varieti of experi design to illustr the impact of the vendor 's effort . we compar code written in a standard , loop-level parallel style under openmp with altern version written in a singl program multipl data ( spmd ) fashion , also realiz via openmp , and show that the latter consist provid superior perform . a care chosen set of languag extens can help us translat program from the former style to the latter ( or to compil directli , but in a similar manner ) . syntax for these extens can be borrow from hpf , and some aspect of hpf compil technolog can help the translat process . it is our expect that an extend languag , if well compil , would improv the attract of openmp as a languag for high-perform comput on an import class of modern architectur


Verification of non-functional properties of a composable architecture with Petri nets

Abstract: In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with time-extended Petrinets. As a result, the first step of a proof of composability is presented as well as a new kind of Petri net, which is more suitable for modeling architectures like MSS

verif of non-funct properti of a compos architectur with petri net
 in thi paper , we introduc our concept of compos and present the mss architectur as an exampl for a compos architectur . mss claim to be compos with respect to time properti . we discuss , how to model and prove properti in such an architectur with time-extend petrinet . as a result , the first step of a proof of compos is present as well as a new kind of petri net , which is more suitabl for model architectur like mss

composable architecture
Petri nets
MSS architecture
timing properties
proof of composability
non-functional properties verification


A hybrid ML-EM algorithm for calculation of maximum likelihood estimates in semiparametric shared frailty models

Abstract: This paper describes a generalised hybrid ML-EM algorithm for the calculation of maximum likelihood estimates in semiparametric shared frailty models, the Cox proportional hazard models with hazard functions multiplied by a (parametric) frailty random variable. This hybrid method is much faster than the standard EM method and faster than the standard direct maximum likelihood method (ML, Newton-Raphson) for large samples. We have previously applied this method to semiparametric shared gamma frailty models, and verified by simulations the asymptotic and small sample statistical properties of the frailty variance estimates. Let theta /sub 0/ be the true value of the frailty variance parameter. Then the asymptotic distribution is normal for theta /sub 0/>0 while it is a 50-50 mixture between a point mass at zero and a normal random variable on the positive axis for theta /sub 0/=0. For small samples, simulations suggest that the frailty variance estimates are approximately distributed as an x-(100-x)% mixture, 0<or=x<or=50, between a point mass at zero and a normal random variable on the positive axis even for theta /sub 0/>0. We apply this method and verify by simulations these statistical results for semiparametric shared log-normal frailty models. We also apply the semiparametric shared gamma and log-normal frailty models to Busselton Health Study coronary heart disease data

a hybrid ml-em algorithm for calcul of maximum likelihood estim in semiparametr share frailti model
 thi paper describ a generalis hybrid ml-em algorithm for the calcul of maximum likelihood estim in semiparametr share frailti model , the cox proport hazard model with hazard function multipli by a ( parametr ) frailti random variabl . thi hybrid method is much faster than the standard em method and faster than the standard direct maximum likelihood method ( ml , newton-raphson ) for larg sampl . we have previous appli thi method to semiparametr share gamma frailti model , and verifi by simul the asymptot and small sampl statist properti of the frailti varianc estim . let theta /sub 0/ be the true valu of the frailti varianc paramet . then the asymptot distribut is normal for theta /sub 0/>0 while it is a 50 - 50 mixtur between a point mass at zero and a normal random variabl on the posit axi for theta /sub 0/=0 . for small sampl , simul suggest that the frailti varianc estim are approxim distribut as an x-(100-x)% mixtur , 0 < or = x < or=50 , between a point mass at zero and a normal random variabl on the posit axi even for theta /sub 0/>0 . we appli thi method and verifi by simul these statist result for semiparametr share log-norm frailti model . we also appli the semiparametr share gamma and log-norm frailti model to busselton health studi coronari heart diseas data


All change [agile business]

Abstract: What does it take for an organisation to become an agile business? Its employees probably need to adhere to new procurement policies, work more closely with colleagues in other departments, meet more exacting sales targets, and offer higher standards of customer service and support. In short, they need to change the way they work. Implementing technologies to support agile business models and underpin new practices is a complex task in itself. But getting employees to adopt new practices is far harder, and one that requires careful handling, says Barry O'Connell, general manager of business-to-employee (B2E) solutions at systems vendor Hewlett-Packard (HP)

all chang [ agil busi ]
 what doe it take for an organis to becom an agil busi ? it employe probabl need to adher to new procur polici , work more close with colleagu in other depart , meet more exact sale target , and offer higher standard of custom servic and support . in short , they need to chang the way they work . implement technolog to support agil busi model and underpin new practic is a complex task in itself . but get employe to adopt new practic is far harder , and one that requir care handl , say barri o'connel , gener manag of business-to-employe ( b2e ) solut at system vendor hewlett-packard ( hp )

agile business
corporate transformation
organisational change


A combinatorial, graph-based solution method for a class of continuous-time optimal control problems

Abstract: The paper addresses a class of continuous-time, optimal control problems whose solutions are typically characterized by both bang-bang and "singular" control regimes. Analytical study and numerical computation of such solutions are very difficult and far from complete when only techniques from control theory are used. This paper solves optimal control problems by reducing them to the combinatorial search for the shortest path in a specially constructed graph. Since the nodes of the graph are weighted in a sequence-dependent manner, we extend the classical, shortest-path algorithm to our case. The proposed solution method is currently limited to single-state problems with multiple control functions. A production planning problem and a train operation problem are optimally solved to illustrate the method

a combinatori , graph-bas solut method for a class of continuous-tim optim control problem
 the paper address a class of continuous-tim , optim control problem whose solut are typic character by both bang-bang and " singular " control regim . analyt studi and numer comput of such solut are veri difficult and far from complet when onli techniqu from control theori are use . thi paper solv optim control problem by reduc them to the combinatori search for the shortest path in a special construct graph . sinc the node of the graph are weight in a sequence-depend manner , we extend the classic , shortest-path algorithm to our case . the propos solut method is current limit to single-st problem with multipl control function . a product plan problem and a train oper problem are optim solv to illustr the method


Upper bound analysis of oblique cutting with nose radius tools

Abstract: A generalized upper bound model for calculating the chip flow angle in oblique cutting using flat-faced nose radius tools is described. The projection of the uncut chip area on the rake face is divided into a number of elements parallel to an assumed chip flow direction. The length of each of these elements is used to find the length of the corresponding element on the shear surface using the ratio of the shear velocity to the chip velocity. The area of each element is found as the cross product of the length and its width along the cutting edge. Summing up the area of the elements along the shear surface, the total shear surface area is obtained. The friction area is calculated using the similarity between orthogonal and oblique cutting in the 'equivalent' plane that includes both the cutting velocity and chip velocity. The cutting power is obtained by summing the shear power and the friction power. The actual chip flow angle and chip velocity are obtained by minimizing the cutting power with respect to both these variables. The shape of the curved shear surface, the chip cross section and the cutting force obtained from this model are presented

upper bound analysi of obliqu cut with nose radiu tool
 a gener upper bound model for calcul the chip flow angl in obliqu cut use flat-fac nose radiu tool is describ . the project of the uncut chip area on the rake face is divid into a number of element parallel to an assum chip flow direct . the length of each of these element is use to find the length of the correspond element on the shear surfac use the ratio of the shear veloc to the chip veloc . the area of each element is found as the cross product of the length and it width along the cut edg . sum up the area of the element along the shear surfac , the total shear surfac area is obtain . the friction area is calcul use the similar between orthogon and obliqu cut in the ' equival ' plane that includ both the cut veloc and chip veloc . the cut power is obtain by sum the shear power and the friction power . the actual chip flow angl and chip veloc are obtain by minim the cut power with respect to both these variabl . the shape of the curv shear surfac , the chip cross section and the cut forc obtain from thi model are present

upper bound analysis
oblique cutting
nose radius tools
chip flow angle
uncut chip area
shear surface
shear velocity
chip velocity
friction area


Citizen centric identity management: chip tricks?

Abstract: Accelerating and harmonizing the diffusion and acceptance of electronic services in Europe in a secure and practical way has become a priority of several initiatives in the past few years and a critical factor for citizen and business information society services. As identification and authentication is a critical element in accessing public services the combination of public key infrastructure (PKI) and smart cards emerges as the solution of choice for eGovernment in Europe. National governments and private initiatives alike vouch their support for this powerful combination to deliver an essential layer of reliable electronic services and address identity requirements in a broad range of application areas. A recent study suggests that several eGovernment implementations point to the direction of electronic citizen identity management as an up and coming challenge. The paper discusses the eGovernment needs for user identification applicability and the need for standardization

citizen centric ident manag : chip trick ?
 acceler and harmon the diffus and accept of electron servic in europ in a secur and practic way ha becom a prioriti of sever initi in the past few year and a critic factor for citizen and busi inform societi servic . as identif and authent is a critic element in access public servic the combin of public key infrastructur ( pki ) and smart card emerg as the solut of choic for egovern in europ . nation govern and privat initi alik vouch their support for thi power combin to deliv an essenti layer of reliabl electron servic and address ident requir in a broad rang of applic area . a recent studi suggest that sever egovern implement point to the direct of electron citizen ident manag as an up and come challeng . the paper discuss the egovern need for user identif applic and the need for standard

citizen centric identity management
electronic services
authentication
public key infrastructure
smart cards
government
user identification
standardization
business information services
legal framework
public information services


The visible cement data set

Abstract: With advances in x-ray microtomography, it is now possible to obtain three-dimensional representations of a material's microstructure with a voxel size of less than one micrometer. The Visible Cement Data Set represents a collection of 3-D data sets obtained using the European Synchrotron Radiation Facility in Grenoble, France in September 2000. Most of the images obtained are for hydrating portland cement pastes, with a few data sets representing hydrating Plaster of Paris and a common building brick. All of these data sets are being made available on the Visible Cement Data Set website at http://visiblecement.nist.gov. The website includes the raw 3-D datafiles, a description of the material imaged for each data set, example two-dimensional images and visualizations for each data set, and a collection of C language computer programs that will be of use in processing and analyzing the 3-D microstructural images. This paper provides the details of the experiments performed at the ESRF, the analysis procedures utilized in obtaining the data set files, and a few representative example images for each of the three materials investigated

the visibl cement data set
 with advanc in x-ray microtomographi , it is now possibl to obtain three-dimension represent of a materi 's microstructur with a voxel size of less than one micromet . the visibl cement data set repres a collect of 3-d data set obtain use the european synchrotron radiat facil in grenobl , franc in septemb 2000 . most of the imag obtain are for hydrat portland cement past , with a few data set repres hydrat plaster of pari and a common build brick . all of these data set are be made avail on the visibl cement data set websit at http://visiblecement.nist.gov . the websit includ the raw 3-d datafil , a descript of the materi imag for each data set , exampl two-dimension imag and visual for each data set , and a collect of c languag comput program that will be of use in process and analyz the 3-d microstructur imag . thi paper provid the detail of the experi perform at the esrf , the analysi procedur util in obtain the data set file , and a few repres exampl imag for each of the three materi investig

X-ray microtomography
microstructure
voxel size
European Synchrotron Radiation Facility
hydrating portland cement pastes
Plaster of Paris
building brick
two-dimensional images
microstructural images
ESRF
3D representations
cement hydration


A model of periodic oscillation for genetic regulatory systems

Abstract: In this paper, we focus on modeling and explaining periodic oscillations in gene-protein systems with a simple nonlinear model and on analyzing effects of time delay on the stability of oscillations. Our main model of genetic regulation comprises of a two-gene system with an autoregulatory feedback loop. We exploit multiple time scales and hysteretic properties of the model to construct periodic oscillations with jumping dynamics and analyze the possible mechanism according to the singular perturbation theory. As shown in this paper, periodic oscillations are mainly generated by nonlinearly negative and positive feedback loops in gene regulatory systems, whereas the jumping dynamics is generally caused by time scale differences among biochemical reactions. This simple model may actually act as a genetic oscillator or switch in gene-protein networks because the dynamics are robust for parameter perturbations or environment variations. We also explore effects of time delay on the stability of the dynamics, showing that the time delay generally increases the stability region of the oscillations, thereby making the oscillations robust to parameter changes. Two examples are also provided to numerically demonstrate our theoretical results

a model of period oscil for genet regulatori system
 in thi paper , we focu on model and explain period oscil in gene-protein system with a simpl nonlinear model and on analyz effect of time delay on the stabil of oscil . our main model of genet regul compris of a two-gen system with an autoregulatori feedback loop . we exploit multipl time scale and hysteret properti of the model to construct period oscil with jump dynam and analyz the possibl mechan accord to the singular perturb theori . as shown in thi paper , period oscil are mainli gener by nonlinearli neg and posit feedback loop in gene regulatori system , wherea the jump dynam is gener caus by time scale differ among biochem reaction . thi simpl model may actual act as a genet oscil or switch in gene-protein network becaus the dynam are robust for paramet perturb or environ variat . we also explor effect of time delay on the stabil of the dynam , show that the time delay gener increas the stabil region of the oscil , therebi make the oscil robust to paramet chang . two exampl are also provid to numer demonstr our theoret result

modeling
periodic oscillations
genetic regulation
genetic regulatory system
gene-protein systems
nonlinear model
time delay
two-gene system
autoregulatory feedback loop
hysteretic properties
jumping dynamics
singular perturbation theory
biochemical reactions
stability region
oscillations stability
nonlinearly negative feedback loops
nonlinearly positive feedback loops
bifurcation
circadian rhythm
relaxation oscillator


Behavior of Runge-Kutta discretizations near equilibria of index 2 differential algebraic systems

Abstract: We analyze Runge-Kutta discretizations applied to index 2 differential algebraic equations (DAE's) near equilibria. We compare the geometric properties of the numerical and the exact solutions. It is shown that projected and half-explicit Runge-Kutta methods reproduce the qualitative features of the continuous system in the vicinity of an equilibrium correctly. The proof combines cut-off and scaling techniques for index 2 differential algebraic equations with some invariant manifold results of Schropp (Geometric properties of Runge-Kutta discretizations for index 2 differential algebraic equations, Konstanzer Schriften in Mathematik und Informatik 128) and classical results for discretized ordinary differential equations

behavior of runge-kutta discret near equilibria of index 2 differenti algebra system
 we analyz runge-kutta discret appli to index 2 differenti algebra equat ( dae 's ) near equilibria . we compar the geometr properti of the numer and the exact solut . it is shown that project and half-explicit runge-kutta method reproduc the qualit featur of the continu system in the vicin of an equilibrium correctli . the proof combin cut-off and scale techniqu for index 2 differenti algebra equat with some invari manifold result of schropp ( geometr properti of runge-kutta discret for index 2 differenti algebra equat , konstanz schriften in mathematik und informatik 128 ) and classic result for discret ordinari differenti equat


Modeling of torsional vibration induced by extension-twisting coupling of anisotropic composite laminates with piezoelectric actuators

Abstract: In this paper we present a dynamic analytical model for the torsional vibration of an anisotropic piezoelectric laminate induced by the extension-twisting coupling effect. In the present approach, we use the Hamilton principle and a reduced bending stiffness method for the derivation of equations of motion. As a result, the in-plane displacements are not involved and the out-of-plane displacement of the laminate is the only quantity to be calculated. Therefore, the proposed method turns the twisting of a laminate with structural coupling into a simplified problem without losing its features. We give analytical solutions of the present model with harmonic excitation. A parametric study is performed to demonstrate the present approach

model of torsion vibrat induc by extension-twist coupl of anisotrop composit lamin with piezoelectr actuat
 in thi paper we present a dynam analyt model for the torsion vibrat of an anisotrop piezoelectr lamin induc by the extension-twist coupl effect . in the present approach , we use the hamilton principl and a reduc bend stiff method for the deriv of equat of motion . as a result , the in-plan displac are not involv and the out-of-plan displac of the lamin is the onli quantiti to be calcul . therefor , the propos method turn the twist of a lamin with structur coupl into a simplifi problem without lose it featur . we give analyt solut of the present model with harmon excit . a parametr studi is perform to demonstr the present approach

torsional vibration
twisting
anisotropic composite laminates
composite laminate
piezoelectric actuators
dynamic analytical model
anisotropic piezoelectric laminate
extension-twisting coupling effect
Hamilton principle
reduced bending stiffness
equations of motion
in-plane displacements
out-of-plane displacement
structural coupling
harmonic excitation
parametric study
extension -twisting coupling
material anisotropy
PZT


High-level language support for user-defined reductions

Abstract: The optimized handling of reductions on parallel supercomputers or clusters of workstations is critical to high performance because reductions are common in scientific codes and a potential source of bottlenecks. Yet in many high-level languages, a mechanism for writing efficient reductions remains surprisingly absent. Further, when such mechanisms do exist, they often do not provide the flexibility a programmer needs to achieve a desirable level of performance. In this paper, we present a new language construct for arbitrary reductions that lets a programmer achieve a level of performance equal to that achievable with the highly flexible, but low-level combination of Fortran and MPI. We have implemented this construct in the ZPL language and evaluate it in the context of the initialization of the NAS MG benchmark. We show a 45 times speedup over the same code written in ZPL without this construct. In addition, performance on a large number of processors surpasses that achieved in the NAS implementation showing that our mechanism provides programmers with the needed flexibility

high-level languag support for user-defin reduct
 the optim handl of reduct on parallel supercomput or cluster of workstat is critic to high perform becaus reduct are common in scientif code and a potenti sourc of bottleneck . yet in mani high-level languag , a mechan for write effici reduct remain surprisingli absent . further , when such mechan do exist , they often do not provid the flexibl a programm need to achiev a desir level of perform . in thi paper , we present a new languag construct for arbitrari reduct that let a programm achiev a level of perform equal to that achiev with the highli flexibl , but low-level combin of fortran and mpi . we have implement thi construct in the zpl languag and evalu it in the context of the initi of the na mg benchmark . we show a 45 time speedup over the same code written in zpl without thi construct . in addit , perform on a larg number of processor surpass that achiev in the na implement show that our mechan provid programm with the need flexibl

reductions
parallel supercomputers
clusters of workstations
language construct
parallel programming
scientific computing


Regression testing of database applications

Abstract: Database applications features such as Structured Query Language or SQL, exception programming, integrity constraints, and table triggers pose difficulties for maintenance activities; especially for regression testing that follows modifications to database applications. In this work, we address these difficulties and propose a two phase regression testing methodology. In phase 1, we explore control flow and data flow analysis issues of database applications. Then, we propose an impact analysis technique that is based on dependencies that exist among the components of database applications. This analysis leads to selecting test cases from the initial test suite for regression testing the modified application. In phase 2, further reduction in the regression test cases is performed by using reduction algorithms. We present two such algorithms. The Graph Walk algorithm walks through the control flow graph of database modules and selects a safe set of test cases to retest. The Call Graph Firewall algorithm uses a firewall for the inter procedural level. Finally, a maintenance environment for database applications is described. Our experience with this regression testing methodology shows that the impact analysis technique is adequate for selecting regression tests and that phase 2 techniques can be used for further reduction in the number of theses tests

regress test of databas applic
 databas applic featur such as structur queri languag or sql , except program , integr constraint , and tabl trigger pose difficulti for mainten activ ; especi for regress test that follow modif to databas applic . in thi work , we address these difficulti and propos a two phase regress test methodolog . in phase 1 , we explor control flow and data flow analysi issu of databas applic . then , we propos an impact analysi techniqu that is base on depend that exist among the compon of databas applic . thi analysi lead to select test case from the initi test suit for regress test the modifi applic . in phase 2 , further reduct in the regress test case is perform by use reduct algorithm . we present two such algorithm . the graph walk algorithm walk through the control flow graph of databas modul and select a safe set of test case to retest . the call graph firewal algorithm use a firewal for the inter procedur level . final , a mainten environ for databas applic is describ . our experi with thi regress test methodolog show that the impact analysi techniqu is adequ for select regress test and that phase 2 techniqu can be use for further reduct in the number of these s test


Wavelet-based image segment representation

Abstract: An efficient representation method for arbitrarily shaped image segments is proposed. This method includes a smart way to select a wavelet basis to approximate the given image segment, with improved image quality and reduced computational load

wavelet-bas imag segment represent
 an effici represent method for arbitrarili shape imag segment is propos . thi method includ a smart way to select a wavelet basi to approxim the given imag segment , with improv imag qualiti and reduc comput load

image segment representation
arbitrarily shaped image segments
wavelet basis
improved image quality
reduced computational load
discrete wavelet transform
DWT


On-line robust processing techniques for elimination of measurement drop-out

Abstract: When processing measurement data, it is usually assumed that some amount of normally distributed measurement noise is present. In some situations, outliers are present in the measurements and consequently the noise is far from normally distributed. In this case classical least-squares procedures for estimating Fourier spectra (or derived quantities like the frequency response function) can give results which are inaccurate or even useless. In this paper, a novel technique for the on-line processing of measurement outliers will be proposed. Both the computation speed and the accuracy of the technique presented will be compared with different classical approaches for handling outliers in measurement data (i.e. filtering techniques, outlier rejection techniques and robust regression techniques). In particular, all processing techniques will be validated by applying them to the problem of speckle drop-out in optical vibration measurements (performed with a laser Doppler vibrometer), which typically causes outliers in the measurements

on-lin robust process techniqu for elimin of measur drop-out
 when process measur data , it is usual assum that some amount of normal distribut measur nois is present . in some situat , outlier are present in the measur and consequ the nois is far from normal distribut . in thi case classic least-squar procedur for estim fourier spectra ( or deriv quantiti like the frequenc respons function ) can give result which are inaccur or even useless . in thi paper , a novel techniqu for the on-lin process of measur outlier will be propos . both the comput speed and the accuraci of the techniqu present will be compar with differ classic approach for handl outlier in measur data ( i.e. filter techniqu , outlier reject techniqu and robust regress techniqu ) . in particular , all process techniqu will be valid by appli them to the problem of speckl drop-out in optic vibrat measur ( perform with a laser doppler vibromet ) , which typic caus outlier in the measur

on-line robust processing techniques
normally distributed measurement noise
classical least-squares procedures
Fourier spectra
frequency response function
measurement outliers
computation speed
robust regression
optical vibration measurements
laser Doppler vibrometer
measurement dropout elimination
speckle dropout
laser interferometer
modal analysis
vibration velocity
iterative technique
low-pass filtering
median filtering
signal sampling
order statistics
sinusoidal excitation
broadband excitation
frequency spectra

P P P P P P P P P P M M M U M M M M U U U U R


Mothball mania [3G licences]

Abstract: Telefonica Moviles has frozen its 3G operations in Germany, Austria, Italy and Switzerland. With other 3G licence holders questioning the logic of entering already saturated markets with unproven technology, Emma McClune asks if the mothball effect is set to snowball any further

mothbal mania [ 3 g licenc ]
 telefonica movil ha frozen it 3 g oper in germani , austria , itali and switzerland . with other 3 g licenc holder question the logic of enter alreadi satur market with unproven technolog , emma mcclune ask if the mothbal effect is set to snowbal ani further

mothball
3G licence holders
saturated markets
mobile telephony


Multicell converters: active control and observation of flying-capacitor voltages

Abstract: The multicell converters introduced more than ten years ago make it possible to distribute the voltage constraints among series-connected switches and to improve the output waveforms (increased number of levels and apparent frequency). The balance of the constraints requires an appropriate distribution of the flying voltages. This paper presents some solutions for the active control of the voltages across the flying capacitors in the presence of rapid variation of the input voltage. The latter part of this paper is dedicated to the observation of these voltages using an original modeling of the converter

multicel convert : activ control and observ of flying-capacitor voltag
 the multicel convert introduc more than ten year ago make it possibl to distribut the voltag constraint among series-connect switch and to improv the output waveform ( increas number of level and appar frequenc ) . the balanc of the constraint requir an appropri distribut of the fli voltag . thi paper present some solut for the activ control of the voltag across the fli capacitor in the presenc of rapid variat of the input voltag . the latter part of thi paper is dedic to the observ of these voltag use an origin model of the convert

multicell converters
active control
flying-capacitor voltages
series-connected switches
input voltage
Kalman filtering
multilevel systems
nonlinear systems
power electronics
power systems harmonics
output waveforms improvement


Analytic PCA construction for theoretical analysis of lighting variability in images of a Lambertian object

Abstract: We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. We analytically construct the principal component analysis for images of a convex Lambertian object, explicitly taking attached shadows into account, and find the principal eigenmodes and eigenvalues with respect to lighting variability. Our analysis makes use of an analytic formula for the irradiance in terms of spherical-harmonic coefficients of the illumination and shows, under appropriate assumptions, that the principal components or eigenvectors are identical to the spherical harmonic basis functions evaluated at the surface normal vectors. Our main contribution is in extending these results to the single-viewpoint case, showing how the principal eigenmodes and eigenvalues are affected when only a limited subset (the upper hemisphere) of normals is available and the spherical harmonics are no longer orthonormal over the restricted domain. Our results are very close, both qualitatively and quantitatively, to previous empirical observations and represent the first essentially complete theoretical explanation of these observations

analyt pca construct for theoret analysi of light variabl in imag of a lambertian object
 we analyz theoret the subspac best approxim imag of a convex lambertian object taken from the same viewpoint , but under differ distant illumin condit . we analyt construct the princip compon analysi for imag of a convex lambertian object , explicitli take attach shadow into account , and find the princip eigenmod and eigenvalu with respect to light variabl . our analysi make use of an analyt formula for the irradi in term of spherical-harmon coeffici of the illumin and show , under appropri assumpt , that the princip compon or eigenvector are ident to the spheric harmon basi function evalu at the surfac normal vector . our main contribut is in extend these result to the single-viewpoint case , show how the princip eigenmod and eigenvalu are affect when onli a limit subset ( the upper hemispher ) of normal is avail and the spheric harmon are no longer orthonorm over the restrict domain . our result are veri close , both qualit and quantit , to previou empir observ and repres the first essenti complet theoret explan of these observ

lighting variability
convex Lambertian object
principal eigenmodes
irradiance
spherical harmonics
surface normal vectors
analytic principal component analysis
five-dimensional subspace
principal eigenvalues
radiance


Multi-timescale Internet traffic engineering

Abstract: The Internet is a collection of packet-based hop-by-hop routed networks. Internet traffic engineering is the process of allocating resources to meet the performance requirements of users and operators for their traffic. Current mechanisms for doing so, exemplified by TCP's congestion control or the variety of packet marking disciplines, concentrate on allocating resources on a per-packet basis or at data timescales. This article motivates the need for traffic engineering in the Internet at other timescales, namely control and management timescales, and presents three mechanisms for this. It also presents a scenario to show how these mechanisms increase the flexibility of operators' service offerings and potentially also ease problems of Internet management

multi-timescal internet traffic engin
 the internet is a collect of packet-bas hop-by-hop rout network . internet traffic engin is the process of alloc resourc to meet the perform requir of user and oper for their traffic . current mechan for do so , exemplifi by tcp 's congest control or the varieti of packet mark disciplin , concentr on alloc resourc on a per-packet basi or at data timescal . thi articl motiv the need for traffic engin in the internet at other timescal , name control and manag timescal , and present three mechan for thi . it also present a scenario to show how these mechan increas the flexibl of oper ' servic offer and potenti also eas problem of internet manag

multi-timescale Internet traffic engineering


Optimization of advertising expenses in the functioning of an insurance company

Abstract: With the use of Pontryagin's maximum principle, a problem of optimal time distribution of advertising expenses in the functioning of an insurance company is solved

optim of advertis expens in the function of an insur compani
 with the use of pontryagin 's maximum principl , a problem of optim time distribut of advertis expens in the function of an insur compani is solv

optimization
advertising expenses
insurance company
optimal time distribution
Pontryagin maximum principle
differential equations


Secrets of the Glasgow Haskell compiler inliner

Abstract: Higher-order languages such as Haskell encourage the programmer to build abstractions by composing functions. A good compiler must inline many of these calls to recover an efficiently executable program. In principle, inlining is dead simple: just replace the call of a function by an instance of its body. But any compiler-writer will tell you that inlining is a black art, full of delicate compromises that work together to give good performance without unnecessary code bloat. The purpose of this paper is, therefore, to articulate the key lessons we learned from a full-scale "production" inliner, the one used in the Glasgow Haskell compiler. We focus mainly on the algorithmic aspects, but we also provide some indicative measurements to substantiate the importance of various aspects of the inliner

secret of the glasgow haskel compil inlin
 higher-ord languag such as haskel encourag the programm to build abstract by compos function . a good compil must inlin mani of these call to recov an effici execut program . in principl , inlin is dead simpl : just replac the call of a function by an instanc of it bodi . but ani compiler-writ will tell you that inlin is a black art , full of delic compromis that work togeth to give good perform without unnecessari code bloat . the purpos of thi paper is , therefor , to articul the key lesson we learn from a full-scal " product " inlin , the one use in the glasgow haskel compil . we focu mainli on the algorithm aspect , but we also provid some indic measur to substanti the import of variou aspect of the inlin

Glasgow Haskell compiler inliner
higher-order languages
abstractions
executable program
performance
algorithmic aspects
functional programming
functional language
optimising compiler


Scalable techniques from nonparametric statistics for real time robot learning

Abstract: Locally weighted learning (LWL) is a class of techniques from nonparametric statistics that provides useful representations and training algorithms for learning about complex phenomena during autonomous adaptive control of robotic systems. The paper introduces several LWL algorithms that have been tested successfully in real-time learning of complex robot tasks. We discuss two major classes of LWL, memory-based LWL and purely incremental LWL that does not need to remember any data explicitly. In contrast to the traditional belief that LWL methods cannot work well in high-dimensional spaces, we provide new algorithms that have been tested on up to 90 dimensional learning problems. The applicability of our LWL algorithms is demonstrated in various robot learning examples, including the learning of devil-sticking, pole-balancing by a humanoid robot arm, and inverse-dynamics learning for a seven and a 30 degree-of-freedom robot. In all these examples, the application of our statistical neural networks techniques allowed either faster or more accurate acquisition of motor control than classical control engineering

scalabl techniqu from nonparametr statist for real time robot learn
 local weight learn ( lwl ) is a class of techniqu from nonparametr statist that provid use represent and train algorithm for learn about complex phenomena dure autonom adapt control of robot system . the paper introduc sever lwl algorithm that have been test success in real-tim learn of complex robot task . we discuss two major class of lwl , memory-bas lwl and pure increment lwl that doe not need to rememb ani data explicitli . in contrast to the tradit belief that lwl method can not work well in high-dimension space , we provid new algorithm that have been test on up to 90 dimension learn problem . the applic of our lwl algorithm is demonstr in variou robot learn exampl , includ the learn of devil-stick , pole-balanc by a humanoid robot arm , and inverse-dynam learn for a seven and a 30 degree-of-freedom robot . in all these exampl , the applic of our statist neural network techniqu allow either faster or more accur acquisit of motor control than classic control engin

scalable techniques
nonparametric statistics
real time robot learning
locally weighted learning
training algorithms
complex phenomena
autonomous adaptive control
devil-sticking
pole-balancing
humanoid robot arm
inverse-dynamics learning
statistical neural networks techniques
memory-based learning
purely incremental learning
nonparametric regression


Reachability in contextual nets

Abstract: Contextual nets, or Petri nets with read arcs, are models of concurrent systems with context dependent actions. The problem of reachability in such nets consists in finding a sequence of transitions that leads from the initial marking of a given contextual net to a given goal marking. The solution to this problem that is presented in this paper consists in constructing a finite complete prefix of the unfolding of the given contextual net, that is a finite prefix in which all the markings that are reachable from the initial marking are present, and in searching in each branch of this prefix for the goal marking by solving an appropriate linear programming problem

reachabl in contextu net
 contextu net , or petri net with read arc , are model of concurr system with context depend action . the problem of reachabl in such net consist in find a sequenc of transit that lead from the initi mark of a given contextu net to a given goal mark . the solut to thi problem that is present in thi paper consist in construct a finit complet prefix of the unfold of the given contextu net , that is a finit prefix in which all the mark that are reachabl from the initi mark are present , and in search in each branch of thi prefix for the goal mark by solv an appropri linear program problem

Petri nets
concurrent systems
context dependent actions
goal marking
finite prefix
linear programming
contextual nets reachability


Marketing in CSIR libraries and information centres: a study on promotional efforts

Abstract: This paper examines the attitudes of librarians towards the promotional aspects in several CSIR libraries and information centres of India. The issues related to promotional activities of these libraries have been evaluated to determine the extent to which they are being practised. Librarians hold positive attitudes about promotional aspects of libraries and often practise them without knowing they are practising marketing concepts. Suggestions and strategies for improving the promotional activities in libraries and information services are put forth so as to meet the information needs and demands of clientele

market in csir librari and inform centr : a studi on promot effort
 thi paper examin the attitud of librarian toward the promot aspect in sever csir librari and inform centr of india . the issu relat to promot activ of these librari have been evalu to determin the extent to which they are be practis . librarian hold posit attitud about promot aspect of librari and often practis them without know they are practis market concept . suggest and strategi for improv the promot activ in librari and inform servic are put forth so as to meet the inform need and demand of clientel

marketing
CSIR libraries
information centres
India
promotional activities
information needs


A switching synchronization scheme for a class of chaotic systems

Abstract: In this Letter, we propose an observer-based synchronization scheme for a class of chaotic systems. This class of systems are given by piecewise-linear dynamics. By using some properties of such systems, we give a procedure to construct the gain of the observer. We prove various stability results and comment on the robustness of the proposed scheme. We also present some simulation results

a switch synchron scheme for a class of chaotic system
 in thi letter , we propos an observer-bas synchron scheme for a class of chaotic system . thi class of system are given by piecewise-linear dynam . by use some properti of such system , we give a procedur to construct the gain of the observ . we prove variou stabil result and comment on the robust of the propos scheme . we also present some simul result

switching synchronization scheme
chaotic systems
piecewise-linear dynamics
robustness
state observers


Take it to the next level [law firm innovation]

Abstract: It's called innovating. Our clients do it. Our culture worships it. Our future hinges on it. Why is it so difficult in law firms? How can we make it easier? Viva la difference!

take it to the next level [ law firm innov ]
 it 's call innov . our client do it . our cultur worship it . our futur hing on it . whi is it so difficult in law firm ? how can we make it easier ? viva la differ !


Attribute generation based on association rules

Abstract: A decision tree is considered to be appropriate (1) if the tree can classify the unseen data accurately, and (2) if the size of the tree is small. One of the approaches to induce such a good decision tree is to add new attributes and their values to enhance the expressiveness of the training data at the data pre-processing stage. There are many existing methods for attribute extraction and construction, but constructing new attributes is still an art. These methods are very time consuming, and some of them need a priori knowledge of the data domain. They are not suitable for data mining dealing with large volumes of data. We propose a novel approach that the knowledge on attributes relevant to the class is extracted as association rules from the training data. The new attributes and the values are generated from the association rules among the originally given attributes. We elaborate on the method and investigate its feature. The effectiveness of our approach is demonstrated through some experiments

attribut gener base on associ rule
 a decis tree is consid to be appropri ( 1 ) if the tree can classifi the unseen data accur , and ( 2 ) if the size of the tree is small . one of the approach to induc such a good decis tree is to add new attribut and their valu to enhanc the express of the train data at the data pre-process stage . there are mani exist method for attribut extract and construct , but construct new attribut is still an art . these method are veri time consum , and some of them need a priori knowledg of the data domain . they are not suitabl for data mine deal with larg volum of data . we propos a novel approach that the knowledg on attribut relev to the class is extract as associ rule from the train data . the new attribut and the valu are gener from the associ rule among the origin given attribut . we elabor on the method and investig it featur . the effect of our approach is demonstr through some experi

attribute generation
association rules
decision tree
training data
attribute extraction
data mining
experiments
large database


Hybrid fuzzy modeling of chemical processes

Abstract: Fuzzy models have been proved to have the ability of modeling all plants without any priori information. However, the performance of conventional fuzzy models can be very poor in the case of insufficient training data due to their poor extrapolation capacity. In order to overcome this problem, a hybrid grey-box fuzzy modeling approach is proposed in this paper to combine expert experience, local linear models and historical data into a uniform framework. It consists of two layers. The expert fuzzy model constructed from linguistic information, the local linear model and the T-S type fuzzy model constructed from data are all put in the first layer. Layer 2 is a fuzzy decision module that is used to decide which model in the first layer should be employed to make the final prediction. The output of the second layer is the output of the hybrid fuzzy model. With the help of the linguistic information, the poor extrapolation capacity problem caused by sparse training data for conventional fuzzy models can be overcome. Simulation result for pH neutralization process demonstrates its modeling ability over the linear models, the expert fuzzy model and the conventional fuzzy model

hybrid fuzzi model of chemic process
 fuzzi model have been prove to have the abil of model all plant without ani priori inform . howev , the perform of convent fuzzi model can be veri poor in the case of insuffici train data due to their poor extrapol capac . in order to overcom thi problem , a hybrid grey-box fuzzi model approach is propos in thi paper to combin expert experi , local linear model and histor data into a uniform framework . it consist of two layer . the expert fuzzi model construct from linguist inform , the local linear model and the t- type fuzzi model construct from data are all put in the first layer . layer 2 is a fuzzi decis modul that is use to decid which model in the first layer should be employ to make the final predict . the output of the second layer is the output of the hybrid fuzzi model . with the help of the linguist inform , the poor extrapol capac problem caus by spars train data for convent fuzzi model can be overcom . simul result for ph neutral process demonstr it model abil over the linear model , the expert fuzzi model and the convent fuzzi model

fuzzy modeling
chemical processes
expert fuzzy model
fuzzy decision module
process modeling


New methods for oscillatory problems based on classical codes

Abstract: The numerical integration of differential equations with oscillatory solutions is a very common problem in many fields of the applied sciences. Some methods have been specially devised for this kind of problem. In most of them, the calculation of the coefficients needs more computational effort than the classical codes because such coefficients depend on the step-size in a not simple manner. On the contrary, in this work we present new algorithms specially designed for perturbed oscillators whose coefficients have a simple dependence on the step-size. The methods obtained are competitive when comparing with classical and special codes

new method for oscillatori problem base on classic code
 the numer integr of differenti equat with oscillatori solut is a veri common problem in mani field of the appli scienc . some method have been special devis for thi kind of problem . in most of them , the calcul of the coeffici need more comput effort than the classic code becaus such coeffici depend on the step-siz in a not simpl manner . on the contrari , in thi work we present new algorithm special design for perturb oscil whose coeffici have a simpl depend on the step-siz . the method obtain are competit when compar with classic and special code

oscillatory problems
classical codes
numerical integration
differential equations
oscillatory solutions
perturbed oscillators


An efficient algorithm for sequential generation of failure states in a network with multi-mode components

Abstract: In this work, a new algorithm for the sequential generation of failure states in a network with multi-mode components is proposed. The algorithm presented in the paper transforms the state enumeration problem into a K-shortest paths problem. Taking advantage of the inherent efficiency of an algorithm for shortest paths enumeration and also of the characteristics of the reliability problem in which it will be used, an algorithm with lower complexity than the best algorithm in the literature for solving this problem, was obtained. Computational results will be presented for comparing the efficiency of both algorithms in terms of CPU time and for problems of different size

an effici algorithm for sequenti gener of failur state in a network with multi-mod compon
 in thi work , a new algorithm for the sequenti gener of failur state in a network with multi-mod compon is propos . the algorithm present in the paper transform the state enumer problem into a k-shortest path problem . take advantag of the inher effici of an algorithm for shortest path enumer and also of the characterist of the reliabl problem in which it will be use , an algorithm with lower complex than the best algorithm in the literatur for solv thi problem , wa obtain . comput result will be present for compar the effici of both algorithm in term of cpu time and for problem of differ size

sequential failure states generation algorithm


Steinmetz system design under unbalanced conditions

Abstract: This paper studies and develops general analytical expressions to obtain three-phase current symmetrization under unbalanced voltage conditions. It proposes two procedures for this symmetrization: the application of the traditional expressions assuming symmetry conditions and the use of optimization methods based on the general analytical equations. Specifically, the paper applies and evaluates these methods to analyze the Steinmetz system design. Several graphics evaluating the error introduced by assumption of balanced voltage in the design are plotted and an example is studied to compare both procedures. In the example the necessity to apply the optimization techniques in highly unbalanced conditions is demonstrated

steinmetz system design under unbalanc condit
 thi paper studi and develop gener analyt express to obtain three-phas current symmetr under unbalanc voltag condit . it propos two procedur for thi symmetr : the applic of the tradit express assum symmetri condit and the use of optim method base on the gener analyt equat . specif , the paper appli and evalu these method to analyz the steinmetz system design . sever graphic evalu the error introduc by assumpt of balanc voltag in the design are plot and an exampl is studi to compar both procedur . in the exampl the necess to appli the optim techniqu in highli unbalanc condit is demonstr

Steinmetz system design
three-phase current symmetrization
unbalanced voltage conditions
optimization methods
general analytical equations
power system control design
balanced voltage assumption


Robotically enhanced placement of left ventricular epicardial electrodes during implantation of a biventricular implantable cardioverter defibrillator system

Abstract: Biventricular pacing has gained increasing acceptance in advanced heart failure patients. One major limitation of this therapy is positioning the left ventricular stimulation lead via the coronary sinus. This report demonstrates the feasibility of totally endoscopic direct placement of an epicardial stimulation lead on the left ventricle using the daVinci surgical system

robot enhanc placement of left ventricular epicardi electrod dure implant of a biventricular implant cardiovert defibril system
 biventricular pace ha gain increas accept in advanc heart failur patient . one major limit of thi therapi is posit the left ventricular stimul lead via the coronari sinu . thi report demonstr the feasibl of total endoscop direct placement of an epicardi stimul lead on the left ventricl use the davinci surgic system

biventricular implantable cardioverter defibrillator system implantation

left ventricular stimulation lead positioning


Development of visual design steering as an aid in large-scale multidisciplinary design optimization. II. Method validation

Abstract: For pt. I see ibid., pp. 412-24. Graph morphing, the first concept developed under the newly proposed paradigm of visual design steering (VDS), is applied to optimal design problems. Graph morphing, described in Part I of this paper, can be used to provide insights to a designer to improve efficiency, reliability, and accuracy of an optimal design in less cycle time. It is demonstrated in this part of the paper that graph morphing can be used to provide insights into design variable impact, constraint redundancy, reasonable values for constraint allowable limits, and function smoothness, that otherwise might not be attainable

develop of visual design steer as an aid in large-scal multidisciplinari design optim . ii . method valid
 for pt . i see ibid . , pp . 412 - 24 . graph morph , the first concept develop under the newli propos paradigm of visual design steer ( vd ) , is appli to optim design problem . graph morph , describ in part i of thi paper , can be use to provid insight to a design to improv effici , reliabl , and accuraci of an optim design in less cycl time . it is demonstr in thi part of the paper that graph morph can be use to provid insight into design variabl impact , constraint redund , reason valu for constraint allow limit , and function smooth , that otherwis might not be attain


Inhibiting decoherence via ancilla processes

Abstract: General conditions are derived for preventing the decoherence of a single two-state quantum system (qubit) in a thermal bath. The employed auxiliary systems required for this purpose are merely assumed to be weak for the general condition while various examples such as extra qubits and extra classical fields are studied for applications in quantum information processing. The general condition is confirmed by well known approaches toward inhibiting decoherence. An approach to decoherence-free quantum memories and quantum operations is presented by placing the qubit into the center of a sphere with extra qubits on its surface

inhibit decoher via ancilla process
 gener condit are deriv for prevent the decoher of a singl two-stat quantum system ( qubit ) in a thermal bath . the employ auxiliari system requir for thi purpos are mere assum to be weak for the gener condit while variou exampl such as extra qubit and extra classic field are studi for applic in quantum inform process . the gener condit is confirm by well known approach toward inhibit decoher . an approach to decoherence-fre quantum memori and quantum oper is present by place the qubit into the center of a sphere with extra qubit on it surfac

decoherence
ancilla processes
general condition
single two-state quantum system
qubit
thermal bath
auxiliary systems
extra qubits
extra classical fields
quantum information processing
decoherence-free quantum memories
quantum operations
decoherence inhibition
sphere surface


Noise-constrained hyperspectral data compression

Abstract: Storage and transmission requirements for hyperspectral data sets are significant. To reduce hardware costs, well-designed compression techniques are needed to preserve information content while maximizing compression ratios. Lossless compression techniques maintain data integrity, but yield small compression ratios. We present a slightly lossy compression algorithm that uses the noise statistics of the data to preserve information content while maximizing compression ratios. The adaptive principal components analysis (APCA) algorithm uses noise statistics to determine the number of significant principal components and selects only those that are required to represent each pixel to within the noise level. We demonstrate the effectiveness of these methods with airborne visible/infrared spectrometer (AVIRIS), hyperspectral digital imagery collection experiment (HYDICE), hyperspectral mapper (HYMAP), and Hyperion datasets

noise-constrain hyperspectr data compress
 storag and transmiss requir for hyperspectr data set are signific . to reduc hardwar cost , well-design compress techniqu are need to preserv inform content while maxim compress ratio . lossless compress techniqu maintain data integr , but yield small compress ratio . we present a slightli lossi compress algorithm that use the nois statist of the data to preserv inform content while maxim compress ratio . the adapt princip compon analysi ( apca ) algorithm use nois statist to determin the number of signific princip compon and select onli those that are requir to repres each pixel to within the nois level . we demonstr the effect of these method with airborn visibl / infrar spectromet ( aviri ) , hyperspectr digit imageri collect experi ( hydic ) , hyperspectr mapper ( hymap ) , and hyperion dataset

noise-constrained hyperspectral data compression

adaptive principal components analysis algorithm

airborne visible/infrared spectrometer hyperspectral digital imagery collection experiment


ClioWeb, ClioRequest, and Clio database: enhancing patron and staff satisfaction

Abstract: Faced with increased demand from students and faculty for a speedier and more user-friendly method of obtaining materials from other institutions, the interlibrary loan (ILL) department sought to implement a management system which would accomplish the task. Students wanted remote interconnectivity to the system and staff wanted increased workflow efficiency, reduced paper work, and better data management. This paper focuses on Washington College's experience in selecting and implementing an interlibrary loan system, which would enhance student satisfaction as well as that of the library staff

clioweb , cliorequest , and clio databas : enhanc patron and staff satisfact
 face with increas demand from student and faculti for a speedier and more user-friendli method of obtain materi from other institut , the interlibrari loan ( ill ) depart sought to implement a manag system which would accomplish the task . student want remot interconnect to the system and staff want increas workflow effici , reduc paper work , and better data manag . thi paper focus on washington colleg 's experi in select and implement an interlibrari loan system , which would enhanc student satisfact as well as that of the librari staff

ClioWeb
ClioRequest
Clio database
staff satisfaction
students
faculty
user-friendly method
management system
remote interconnectivity
workflow efficiency
data management
Washington College
patron satisfaction
interlibrary loan department