An efficient DIPIE algorithm for CAD of electrostatically actuated MEMS devices

Abstract: Pull-in parameters are important properties of electrostatic actuators. Efficient and accurate analysis tools that can capture these parameters for different design geometries, are therefore essential. Current simulation tools approach the pull-in state by iteratively adjusting the voltage applied across the actuator electrodes. The convergence rate of this scheme gradually deteriorates as the pull-in state is approached. Moreover, the convergence is inconsistent and requires many mesh and accuracy refinements to assure reliable predictions. As a result, the design procedure of electrostatically actuated MEMS devices can be time-consuming. In this paper a novel Displacement Iteration Pull-In Extraction (DIPIE) scheme is presented. The DIPIE scheme is shown to converge consistently and far more rapidly than the Voltage Iterations (VI) scheme (>100 times faster!). The DIPIE scheme requires separate mechanical and electrostatic field solvers. Therefore, it can be easily implemented in existing MOEMS CAD packages. Moreover, using the DIPIE scheme, the pull-in parameters extraction can be performed in a fully automated mode, and no user input for search bounds is required

an effici dipi algorithm for cad of electrostat actuat mem devic
 pull-in paramet are import properti of electrostat actuat . effici and accur analysi tool that can captur these paramet for differ design geometri , are therefor essenti . current simul tool approach the pull-in state by iter adjust the voltag appli across the actuat electrod . the converg rate of thi scheme gradual deterior as the pull-in state is approach . moreov , the converg is inconsist and requir mani mesh and accuraci refin to assur reliabl predict . as a result , the design procedur of electrostat actuat mem devic can be time-consum . in thi paper a novel displac iter pull-in extract ( dipi ) scheme is present . the dipi scheme is shown to converg consist and far more rapidli than the voltag iter ( vi ) scheme ( > 100 time faster ! ) . the dipi scheme requir separ mechan and electrostat field solver . therefor , it can be easili implement in exist moem cad packag . moreov , use the dipi scheme , the pull-in paramet extract can be perform in a fulli autom mode , and no user input for search bound is requir

displacement iteration pull-in extraction scheme


A dynamic checkpoint scheduling scheme for fault tolerant distributed computing systems

Abstract: The selection of the optimal checkpointing interval has been a very critical issue in implementing checkpointing-recovery schemes for fault tolerant distributed systems. This paper presents a new scheme that allows a process to select the proper checkpointing interval dynamically. A process in the system evaluates the cost of checkpointing and possible rollback for each checkpointing interval and selects the proper time interval for the next checkpointing. Unlike the other schemes, the overhead incurred by both the checkpointing and rollback activities are considered for the cost evaluation, and the current communication pattern is reflected in the selection of the checkpointing interval. Moreover, the proposed scheme requires no extra message communication for the checkpointing interval selection and can easily be incorporated into the existing checkpointing coordination schemes

a dynam checkpoint schedul scheme for fault toler distribut comput system
 the select of the optim checkpoint interv ha been a veri critic issu in implement checkpointing-recoveri scheme for fault toler distribut system . thi paper present a new scheme that allow a process to select the proper checkpoint interv dynam . a process in the system evalu the cost of checkpoint and possibl rollback for each checkpoint interv and select the proper time interv for the next checkpoint . unlik the other scheme , the overhead incur by both the checkpoint and rollback activ are consid for the cost evalu , and the current commun pattern is reflect in the select of the checkpoint interv . moreov , the propos scheme requir no extra messag commun for the checkpoint interv select and can easili be incorpor into the exist checkpoint coordin scheme

dynamic checkpoint scheduling scheme
distributed computing systems
optimal checkpointing interval
cost evaluation
communication pattern
fault tolerant computing
rollback recovery


Automating the compliance and supervision process

Abstract: New technology enables large broker/dealers to supervise and ensure compliance across multiple branches and managers

autom the complianc and supervis process
 new technolog enabl larg broker / dealer to supervis and ensur complianc across multipl branch and manag

compliance
supervision
brokers
risk management


Influence of advertising expenses on the characteristics of functioning of an insurance company

Abstract: The basic characteristics of the functioning of an insurance company, including the average capital, ruin and survival probabilities, and the conditional time before ruin, are examined with allowance for advertising expenses

influenc of advertis expens on the characterist of function of an insur compani
 the basic characterist of the function of an insur compani , includ the averag capit , ruin and surviv probabl , and the condit time befor ruin , are examin with allow for advertis expens

insurance company functioning characteristics


Yet some more complexity results for default logic

Abstract: We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter's default logic. The majority of our findings are related to brave reasoning. By making some intuitive observations, most classes that we identify can be derived quite easily from some subsets of default logic already known in the literature. Some of the subsets we discuss are subclasses of the so-called "extended logic programs". All the tractable subsets presented in this paper can be recognized in linear time

yet some more complex result for default logic
 we identifi sever new tractabl subset and sever new intract simpl case for reason in the proposit version of reiter 's default logic . the major of our find are relat to brave reason . by make some intuit observ , most class that we identifi can be deriv quit easili from some subset of default logic alreadi known in the literatur . some of the subset we discuss are subclass of the so-cal " extend logic program " . all the tractabl subset present in thi paper can be recogn in linear time

complexity results
default logic
tractable subsets
reasoning
extended logic programs
complexity classes
nonmonotonic reasoning


Setup cost and lead time reductions on stochastic inventory models with a service level constraint

Abstract: The stochastic inventory models analyzed in this paper explore the problem of lead time associated with setup cost reductions for the continuous review and periodic review inventory models. For these two models with a mixture of backorders and lost sales, we respectively assume that their mean and variance of the lead time demand and protection interval (i.e., lead time plus review period) demand are known, but their probability distributions are unknown. We develop a minimax distribution free procedure to find the optimal solution-for each case

setup cost and lead time reduct on stochast inventori model with a servic level constraint
 the stochast inventori model analyz in thi paper explor the problem of lead time associ with setup cost reduct for the continu review and period review inventori model . for these two model with a mixtur of backord and lost sale , we respect assum that their mean and varianc of the lead time demand and protect interv ( i.e. , lead time plu review period ) demand are known , but their probabl distribut are unknown . we develop a minimax distribut free procedur to find the optim solution-for each case

lead time reductions
stochastic inventory models
service level constraint
setup cost reductions
periodic review inventory models
backorders
lost sales
lead time demand
protection interval
probability distributions
minimax distribution free procedure
continuous review inventory models


Modelling tomographic cone-beam projection data from a polyhedral phantom

Abstract: Analytical phantoms are used to generate projection data for testing reconstruction accuracy in computed axial tomography. A circular source locus (equivalent to rotating specimen with a fixed source) provides insufficient data for 'exact' reconstruction in cone-beam transmission tomography, thus phantom data are useful for studying the consequent errors and also for investigating alternative scanning loci and reconstruction techniques. We present an algorithm that can compute phantom cone-beam projection data from a phantom comprising geometrically defined polyhedra. Each polyhedron is defined as a set of polygons enclosing a volume of fixed linear attenuation coefficient. The algorithm works by projecting each polygon in turn onto the modelled detector array, which accumulates the product of source to polygon intersection distance (for the rays intersecting each detector element), linear attenuation coefficient and sign of projected polygon area (indicating whether rays enter or exit the polyhedron at this face). The phantom data are rotated according to the projection angle, whilst the source location and detector plane remain fixed. Polyhedra can be of simple geometric form, or complex surfaces derived from 3D images of real specimens. This algorithm is illustrated using a phantom comprising 989 238 polygons, representing an iso-surface generated from a microtomographic reconstruction of a piece of walrus tusk

model tomograph cone-beam project data from a polyhedr phantom
 analyt phantom are use to gener project data for test reconstruct accuraci in comput axial tomographi . a circular sourc locu ( equival to rotat specimen with a fix sourc ) provid insuffici data for ' exact ' reconstruct in cone-beam transmiss tomographi , thu phantom data are use for studi the consequ error and also for investig altern scan loci and reconstruct techniqu . we present an algorithm that can comput phantom cone-beam project data from a phantom compris geometr defin polyhedra . each polyhedron is defin as a set of polygon enclos a volum of fix linear attenu coeffici . the algorithm work by project each polygon in turn onto the model detector array , which accumul the product of sourc to polygon intersect distanc ( for the ray intersect each detector element ) , linear attenu coeffici and sign of project polygon area ( indic whether ray enter or exit the polyhedron at thi face ) . the phantom data are rotat accord to the project angl , whilst the sourc locat and detector plane remain fix . polyhedra can be of simpl geometr form , or complex surfac deriv from 3d imag of real specimen . thi algorithm is illustr use a phantom compris 989 238 polygon , repres an iso-surfac gener from a microtomograph reconstruct of a piec of walru tusk

tomographic cone-beam projection data
polyhedral phantom
reconstruction accuracy
computed axial tomography
cone-beam transmission tomography
alternative scanning loci
geometrically defined polyhedra
linear attenuation coefficient
microtomographic reconstruction
walrus tusk
reconstruction software accuracy
X-ray attenuation
cumulative pixel array
interpolation
geometry file


On Implicit Euler for high-order high-index DAEs

Abstract: The Implicit Euler method is seldom used to solve differential-algebraic equations (DAEs) of differential index r >or= 3, since the method in general fails to converge in the first r - 2 steps after a change of stepsize. However, if the differential equation is of order d = r - 1 >or= 1, an alternative variable-step version of the Euler method can be shown uniformly convergent. For d = r - 1, this variable-step method is equivalent to the Implicit Euler except for the first r - 2 steps after a change of stepsize. Generalization to DAEs with differential equations of order d > r - 1 >or= 1, and to variable-order formulas is discussed

on implicit euler for high-ord high-index dae
 the implicit euler method is seldom use to solv differential-algebra equat ( dae ) of differenti index r > or= 3 , sinc the method in gener fail to converg in the first r - 2 step after a chang of stepsiz . howev , if the differenti equat is of order d = r - 1 > or= 1 , an altern variable-step version of the euler method can be shown uniformli converg . for d = r - 1 , thi variable-step method is equival to the implicit euler except for the first r - 2 step after a chang of stepsiz . gener to dae with differenti equat of order d > r - 1 > or= 1 , and to variable-ord formula is discuss

Implicit Euler method
differential-algebraic equations
differential index
convergence
variable-step method
variable-order formulas
stepsize change
linear multistep method
backward differentiation formula
initial value problem


An overview of modems

Abstract: This paper describes cursory glance of different types of modems classified for application, range, line type, operating mode, synchronizing mode, modulation, etc., highly useful for all engineering students of communication, electrical, computer science and information technology students. This paper also describes the standards and protocols used and the future trend

an overview of modem
 thi paper describ cursori glanc of differ type of modem classifi for applic , rang , line type , oper mode , synchron mode , modul , etc . , highli use for all engin student of commun , electr , comput scienc and inform technolog student . thi paper also describ the standard and protocol use and the futur trend

modems
line type
operating mode
synchronizing mode
modulation
engineering students
information technology students
standards
protocols
communication students
electrical students
computer science students


Sensitivity calibration of ultrasonic detectors based using ADD diagrams

Abstract: The paper considers basic problems related to utilization of ADD diagrams in calibrating sensitivity of ultrasonic detectors. We suggest that a convenient tool for solving such problems can be the software package ADD Universal. Version 2.1 designed for plotting individual ADD diagrams for normal and slanted transducers. The software is compatible with the contemporary operational system Windows-95(98). Reference signals for calibration are generated in a sample with cylindrical holes

sensit calibr of ultrason detector base use add diagram
 the paper consid basic problem relat to util of add diagram in calibr sensit of ultrason detector . we suggest that a conveni tool for solv such problem can be the softwar packag add univers . version 2.1 design for plot individu add diagram for normal and slant transduc . the softwar is compat with the contemporari oper system windows-95(98 ) . refer signal for calibr are gener in a sampl with cylindr hole


Indexing-neglected and poorly understood

Abstract: The growth of the Internet has highlighted the use of machine indexing. The difficulties in using the Internet as a searching device can be frustrating. The use of the term "python" is given as an example. Machine indexing is noted as "rotten" and human indexing as "capricious." The problem seems to be a lack of a theoretical foundation for the art of indexing. What librarians have learned over the last hundred years has yet to yield a consistent approach to what really works best in preparing index terms and in the ability of our customers to search the various indexes. An attempt is made to consider the elements of indexing, their pros and cons. The argument is made that machine indexing is far too prolific in its production of index terms. Neither librarians nor computer programmers have made much progress to improve Internet indexing. Human indexing has had the same problems for over fifty years

indexing-neglect and poorli understood
 the growth of the internet ha highlight the use of machin index . the difficulti in use the internet as a search devic can be frustrat . the use of the term " python " is given as an exampl . machin index is note as " rotten " and human index as " caprici . " the problem seem to be a lack of a theoret foundat for the art of index . what librarian have learn over the last hundr year ha yet to yield a consist approach to what realli work best in prepar index term and in the abil of our custom to search the variou index . an attempt is made to consid the element of index , their pro and con . the argument is made that machin index is far too prolif in it product of index term . neither librarian nor comput programm have made much progress to improv internet index . human index ha had the same problem for over fifti year

Internet
machine indexing
searching
human indexing
index terms


The MAGNeT toolkit: design, implementation and evaluation

Abstract: The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the Internet. This approach relies on the performance of the interconnect (or Internet) to enable fast, large-scale distributed computing. A detailed understanding of the communication traffic is required in order to optimize the operation of the entire system. Network researchers traditionally monitor traffic in the network to gain the insight necessary to optimize network operations. Recent work suggests additional insight can be obtained by also monitoring traffic at the application level. The Monitor for Application-Generated Network Traffic toolkit (MAGNeT) we describe here monitors application traffic patterns in production systems, thus enabling more highly optimized networks and interconnects for the next generation of high-performance computing systems

the magnet toolkit : design , implement and evalu
 the current trend in construct high-perform comput system is to connect a larg number of machin via a fast interconnect or a large-scal network such as the internet . thi approach reli on the perform of the interconnect ( or internet ) to enabl fast , large-scal distribut comput . a detail understand of the commun traffic is requir in order to optim the oper of the entir system . network research tradit monitor traffic in the network to gain the insight necessari to optim network oper . recent work suggest addit insight can be obtain by also monitor traffic at the applic level . the monitor for application-gener network traffic toolkit ( magnet ) we describ here monitor applic traffic pattern in product system , thu enabl more highli optim network and interconnect for the next gener of high-perform comput system


HPF/JA: extensions of High Performance Fortran for accelerating real-world applications

Abstract: This paper presents a set of extensions on High Performance Fortran (HPF) to make it more usable for parallelizing real-world production codes. HPF has been effective for programs that a compiler can automatically optimize efficiently. However, once the compiler cannot, there have been no ways for the users to explicitly parallelize or optimize their programs. In order to resolve the situation, we have developed a set of HPF extensions (HPF/JA) to give the users more control over sophisticated parallelization and communication optimizations. They include parallelization of loops with complicated reductions, asynchronous communication, user-controllable shadow, and communication pattern reuse for irregular remote data accesses. Preliminary experiments have proved that the extensions are effective at increasing HPF's usability

hpf / ja : extens of high perform fortran for acceler real-world applic
 thi paper present a set of extens on high perform fortran ( hpf ) to make it more usabl for parallel real-world product code . hpf ha been effect for program that a compil can automat optim effici . howev , onc the compil can not , there have been no way for the user to explicitli parallel or optim their program . in order to resolv the situat , we have develop a set of hpf extens ( hpf / ja ) to give the user more control over sophist parallel and commun optim . they includ parallel of loop with complic reduct , asynchron commun , user-control shadow , and commun pattern reus for irregular remot data access . preliminari experi have prove that the extens are effect at increas hpf 's usabl

HPF
High Performance Fortran
compiler
parallelization of loops
parallel processing
data parallel language
supercomputer
parallel programming


Gearing up for CLS bank

Abstract: Continuous-Linked Settlement, a dream of the foreign-exchange community for years, may finally become a reality by the end of 2002

gear up for cl bank
 continuous-link settlement , a dream of the foreign-exchang commun for year , may final becom a realiti by the end of 2002


Local activity criteria for discrete-map CNN

Abstract: Discrete-time CNN systems are studied in this paper by the application of Chua's local activity principle. These systems are locally active everywhere except for one isolated parameter value. As a result, nonhomogeneous spatiotemporal patterns may be induced by any initial setting of the CNN system when the strength of the system diffusion coupling exceeds a critical threshold. The critical coupling coefficient can be derived from the loaded cell impedance of the CNN system. Three well-known 1D map CNN's (namely, the logistic map CNN, the magnetic vortex pinning map CNN, and the spiral wave reproducing map CNN) are introduced to illustrate the applications of the local activity principle. In addition, we use the cell impedance to demonstrate the period-doubling scenario in the logistic and the magnetic vortex pinning maps

local activ criteria for discrete-map cnn
 discrete-tim cnn system are studi in thi paper by the applic of chua 's local activ principl . these system are local activ everywher except for one isol paramet valu . as a result , nonhomogen spatiotempor pattern may be induc by ani initi set of the cnn system when the strength of the system diffus coupl exce a critic threshold . the critic coupl coeffici can be deriv from the load cell imped of the cnn system . three well-known 1d map cnn 's ( name , the logist map cnn , the magnet vortex pin map cnn , and the spiral wave reproduc map cnn ) are introduc to illustr the applic of the local activ principl . in addit , we use the cell imped to demonstr the period-doubl scenario in the logist and the magnet vortex pin map

local activity criteria
discrete-map CNN
discrete-time CNN systems
Chua's local activity principle
nonhomogeneous spatiotemporal patterns
critical coupling coefficient
loaded cell impedance
logistic map CNN
magnetic vortex pinning map CNN
spiral wave reproducing map CNN
period-doubling
difference equation


Anatomy of the coupling query in a Web warehouse

Abstract: To populate a data warehouse specifically designed for Web data, i.e. Web warehouse, it is imperative to harness relevant documents from the Web. In this paper, we describe a query mechanism called coupling query to glean relevant Web data in the context of our Web warehousing system called Warehouse Of Web Data (WHOWEDA). A coupling query may be used for querying both HTML and XML documents. Important features of our query mechanism are the ability to query metadata, content, internal and external (hyperlink) structure of Web documents based on partial knowledge, ability to express constraints on tag attributes and tagless segment of data, ability to express conjunctive as well as disjunctive query conditions compactly, ability to control execution of a Web query and preservation of the topological structure of hyperlinked documents in the query results. We also discuss how to formulate a query graphically and in textual form using a coupling graph and coupling text, respectively

anatomi of the coupl queri in a web warehous
 to popul a data warehous specif design for web data , i.e. web warehous , it is imper to har relev document from the web . in thi paper , we describ a queri mechan call coupl queri to glean relev web data in the context of our web wareh system call warehous of web data ( whoweda ) . a coupl queri may be use for queri both html and xml document . import featur of our queri mechan are the abil to queri metadata , content , intern and extern ( hyperlink ) structur of web document base on partial knowledg , abil to express constraint on tag attribut and tagless segment of data , abil to express conjunct as well as disjunct queri condit compactli , abil to control execut of a web queri and preserv of the topolog structur of hyperlink document in the queri result . we also discuss how to formul a queri graphic and in textual form use a coupl graph and coupl text , respect

coupling query
Web warehouse
data warehouse
Warehouse Of Web Data
XML documents
metadata
content
Web documents
partial knowledge
tag attributes
tagless segment
disjunctive query conditions
topological structure
hyperlinked documents
coupling text
HTML documents
internal structure
external structure
conjunctive query conditions
execution control
graphical query formulation
textual query formulation

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


A knowledge-navigation system for dimensional metrology

Abstract: Geometric dimensioning and tolerancing (GD&T) is a method to specify the dimensions and form of a part so that it will meet its design intent. GD&T is difficult to master for two main reasons. First, it is based on complex 3D geometric entities and relationships. Second, the geometry is associated with a large, diverse knowledge base of dimensional metrology with many interconnections. This paper describes an approach to create a dimensional metrology knowledge base that is organized around a set of key concepts and to represent those concepts as virtual objects that can be navigated with interactive, computer visualization techniques to access the associated knowledge. The approach can enable several applications. First is the application to convey the definition and meaning of GD&T over a broad range of tolerance types. Second is the application to provide a visualization of dimensional metrology knowledge within a control hierarchy of the inspection process. Third is the application to show the coverage of interoperability standards to enable industry to make decisions on standards development and harmonization efforts. A prototype system has been implemented to demonstrate the principles involved in the approach

a knowledge-navig system for dimension metrolog
 geometr dimens and toleranc ( gd&t ) is a method to specifi the dimens and form of a part so that it will meet it design intent . gd&t is difficult to master for two main reason . first , it is base on complex 3d geometr entiti and relationship . second , the geometri is associ with a larg , divers knowledg base of dimension metrolog with mani interconnect . thi paper describ an approach to creat a dimension metrolog knowledg base that is organ around a set of key concept and to repres those concept as virtual object that can be navig with interact , comput visual techniqu to access the associ knowledg . the approach can enabl sever applic . first is the applic to convey the definit and mean of gd&t over a broad rang of toler type . second is the applic to provid a visual of dimension metrolog knowledg within a control hierarchi of the inspect process . third is the applic to show the coverag of interoper standard to enabl industri to make decis on standard develop and harmon effort . a prototyp system ha been implement to demonstr the principl involv in the approach

dimensional metrology
geometric dimensioning
tolerancing
visualization
inspection
interoperability standards
knowledge navigation
manufacturing training
VRML
Web


Fast and accurate leaf verification for dynamic multileaf collimation using an electronic portal imaging device

Abstract: A prerequisite for accurate dose delivery of IMRT profiles produced with dynamic multileaf collimation (DMLC) is highly accurate leaf positioning. In our institution, leaf verification for DMLC was initially done with film and ionization chamber. To overcome the limitations of these methods, a fast, accurate and two-dimensional method for daily leaf verification, using our CCD-camera based electronic portal imaging device (EPID), has been developed. This method is based on a flat field produced with a 0.5 cm wide sliding gap for each leaf pair. Deviations in gap widths are detected as deviations in gray scale value profiles derived from the EPID images, and not by directly assessing leaf positions in the images. Dedicated software was developed to reduce the noise level in the low signal images produced with the narrow gaps. The accuracy of this quality assurance procedure was tested by introducing known leaf position errors. It was shown that errors in leaf gap as small as 0.01-0.02 cm could be detected, which is certainly adequate to guarantee accurate dose delivery of DMLC treatments, even for strongly modulated beam profiles. Using this method, it was demonstrated that both short and long term reproducibility in leaf positioning were within 0.01 cm (1 sigma ) for all gantry angles, and that the effect of gravity was negligible

fast and accur leaf verif for dynam multileaf collim use an electron portal imag devic
 a prerequisit for accur dose deliveri of imrt profil produc with dynam multileaf collim ( dmlc ) is highli accur leaf posit . in our institut , leaf verif for dmlc wa initi done with film and ioniz chamber . to overcom the limit of these method , a fast , accur and two-dimension method for daili leaf verif , use our ccd-camera base electron portal imag devic ( epid ) , ha been develop . thi method is base on a flat field produc with a 0.5 cm wide slide gap for each leaf pair . deviat in gap width are detect as deviat in gray scale valu profil deriv from the epid imag , and not by directli assess leaf posit in the imag . dedic softwar wa develop to reduc the nois level in the low signal imag produc with the narrow gap . the accuraci of thi qualiti assur procedur wa test by introduc known leaf posit error . it wa shown that error in leaf gap as small as 0.01 - 0.02 cm could be detect , which is certainli adequ to guarante accur dose deliveri of dmlc treatment , even for strongli modul beam profil . use thi method , it wa demonstr that both short and long term reproduc in leaf posit were within 0.01 cm ( 1 sigma ) for all gantri angl , and that the effect of graviti wa neglig

intensity modulated radiation therapy profiles


UPSILON: universal programming system with incomplete lazy object notation

Abstract: This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavor. We prove that this model is a complete and confluent acceptable programming system and has a usable type theory. A new data synchronization primitive is introduced in order to achieve the above properties. Subtle variations of the model are shown to fall short of having all these necessary properties

upsilon : univers program system with incomplet lazi object notat
 thi paper present a new model of comput that differ from prior model in that it emphas data over flow control , ha no name variabl and ha an object-ori flavor . we prove that thi model is a complet and confluent accept program system and ha a usabl type theori . a new data synchron primit is introduc in order to achiev the abov properti . subtl variat of the model are shown to fall short of have all these necessari properti

UPSILON
universal programming system
programming system
incomplete lazy object notation
object-oriented flavor
usable type theory
data synchronization primitive


Lifting factorization of discrete W transform

Abstract: A general method is proposed to factor the type-IV discrete W transform (DWT-IV) into lifting steps and additions. Then, based on the relationships among various types of DWTs, four types of DWTs are factored into lifting steps and additions. After approximating the lifting matrices, we get four types of new integer DWTs (IntDWT-I, IntDWT-II, IntDWT-III, and IntDWT-IV) which are floating-point multiplication free. Integer-to-integer transforms (II-DWT), which approximate to DWT, are also proposed. Fast algorithms are given for the new transforms and their computational complexities are analyzed

lift factor of discret w transform
 a gener method is propos to factor the type-iv discret w transform ( dwt-iv ) into lift step and addit . then , base on the relationship among variou type of dwt , four type of dwt are factor into lift step and addit . after approxim the lift matric , we get four type of new integ dwt ( intdwt-i , intdwt-ii , intdwt-iii , and intdwt-iv ) which are floating-point multipl free . integer-to-integ transform ( ii-dwt ) , which approxim to dwt , are also propos . fast algorithm are given for the new transform and their comput complex are analyz

lifting factorization
DWT
lifting matrices
computational complexity
discrete wavelet transform
integer transforms
data compression
feature extraction
multiframe detection
filter bank
lossless coding schemes
mobile devices
integer arithmetic
mobile computing


Optimization of the memory weighting function in stochastic functional self-organized sorting performed by a team of autonomous mobile agents

Abstract: The activity of a team of autonomous mobile agents formed by identical "robot-like-ant" individuals capable of performing a random walk through an environment that are able to recognize and move different "objects" is modeled. The emergent desired behavior is a distributed sorting and clustering based only on local information and a memory register that records the past objects encountered. An optimum weighting function for the memory registers is theoretically derived. The optimum time-dependent weighting function allows sorting and clustering of the randomly distributed objects in the shortest time. By maximizing the average speed of a texture feature (the contrast) we check the central assumption, the intermediate steady-states hypothesis, of our theoretical result. It is proved that the algorithm optimization based on maximum speed variation of the contrast feature gives relationships similar to the theoretically derived annealing law

optim of the memori weight function in stochast function self-organ sort perform by a team of autonom mobil agent
 the activ of a team of autonom mobil agent form by ident " robot-like- " individu capabl of perform a random walk through an environ that are abl to recogn and move differ " object " is model . the emerg desir behavior is a distribut sort and cluster base onli on local inform and a memori regist that record the past object encount . an optimum weight function for the memori regist is theoret deriv . the optimum time-depend weight function allow sort and cluster of the randomli distribut object in the shortest time . by maxim the averag speed of a textur featur ( the contrast ) we check the central assumpt , the intermedi steady-st hypothesi , of our theoret result . it is prove that the algorithm optim base on maximum speed variat of the contrast featur give relationship similar to the theoret deriv anneal law

memory weighting function
sorting
autonomous mobile agents
random walk
clustering
algorithm optimization


Quantum Zeno subspaces

Abstract: The quantum Zeno effect is recast in terms of an adiabatic theorem when the measurement is described as the dynamical coupling to another quantum system that plays the role of apparatus. A few significant examples are proposed and their practical relevance discussed. We also focus on decoherence-free subspaces

quantum zeno subspac
 the quantum zeno effect is recast in term of an adiabat theorem when the measur is describ as the dynam coupl to anoth quantum system that play the role of apparatu . a few signific exampl are propos and their practic relev discuss . we also focu on decoherence-fre subspac

quantum Zeno subspaces
adiabatic theorem
measurement
dynamical coupling
decoherence-free subspaces


Testing statistical bounds on entanglement using quantum chaos

Abstract: Previous results indicate that while chaos can lead to substantial entropy production, thereby maximizing dynamical entanglement, this still falls short of maximality. Random matrix theory modeling of composite quantum systems, investigated recently, entails a universal distribution of the eigenvalues of the reduced density matrices. We demonstrate that these distributions are realized in quantized chaotic systems by using a model of two coupled and kicked tops. We derive an explicit statistical universal bound on entanglement, which is also valid for the case of unequal dimensionality of the Hilbert spaces involved, and show that this describes well the bounds observed using composite quantized chaotic systems such as coupled tops

test statist bound on entangl use quantum chao
 previou result indic that while chao can lead to substanti entropi product , therebi maxim dynam entangl , thi still fall short of maxim . random matrix theori model of composit quantum system , investig recent , entail a univers distribut of the eigenvalu of the reduc densiti matric . we demonstr that these distribut are realiz in quantiz chaotic system by use a model of two coupl and kick top . we deriv an explicit statist univers bound on entangl , which is also valid for the case of unequ dimension of the hilbert space involv , and show that thi describ well the bound observ use composit quantiz chaotic system such as coupl top

statistical bounds
entanglement
quantum chaos
entropy production
maximality
random matrix theory
composite quantum systems
universal distribution
reduced density matrices
quantized chaotic systems
kicked tops
Hilbert spaces


An automated irradiation device for use in cyclotrons

Abstract: Two cyclotrons are being operated at IPEN-CNEN/SP: one model CV-28, capable of accelerating protons with energies up to 24 MeV and beam currents up to 30 mu A, and three other particles; the other one, model Cyclone 30, accelerates protons with energy of 30 MeV and currents up to 350 mu A. Both have the objective of irradiating targets both for radioisotope production for use in nuclear medicine and general research. The development of irradiating systems completely automatized was the objective of this work, always aiming to reduce the radiation exposition dose to the workers and to increase the reliability of use of these systems

an autom irradi devic for use in cyclotron
 two cyclotron are be oper at ipen-cnen / sp : one model cv-28 , capabl of acceler proton with energi up to 24 mev and beam current up to 30 mu a , and three other particl ; the other one , model cyclon 30 , acceler proton with energi of 30 mev and current up to 350 mu a. both have the object of irradi target both for radioisotop product for use in nuclear medicin and gener research . the develop of irradi system complet automat wa the object of thi work , alway aim to reduc the radiat exposit dose to the worker and to increas the reliabl of use of these system

automated irradiation device
cyclotrons
CV-28
protons
Cyclone 30
radioisotope production
nuclear medicine
general research
radiation exposition dose


Mathematical models of functioning of an insurance company with allowance for the rate of return

Abstract: Models of the functioning of insurance companies are suggested, when the free capital increases from interest at a certain rate. The basic characteristics of the capital of a company are studied in the stationary regime

mathemat model of function of an insur compani with allow for the rate of return
 model of the function of insur compani are suggest , when the free capit increas from interest at a certain rate . the basic characterist of the capit of a compani are studi in the stationari regim

mathematical models
free capital increase
interest
stationary regime
insurance company functioning
return rate allowance


Approximation theory of fuzzy systems based upon genuine many-valued implications - SISO cases

Abstract: It is proved that the single input and single output (SISO) fuzzy systems based upon genuine many-valued implications are universal approximators. It is shown theoretically that fuzzy control systems based upon genuine many-valued implications are equivalent to those based upon t-norm implications, the general approach to construct fuzzy systems is given. It is also shown that defuzzifier based upon center of areas is not appropriate to the fuzzy systems based upon genuine many-valued implications

approxim theori of fuzzi system base upon genuin many-valu implic - siso case
 it is prove that the singl input and singl output ( siso ) fuzzi system base upon genuin many-valu implic are univers approxim . it is shown theoret that fuzzi control system base upon genuin many-valu implic are equival to those base upon t-norm implic , the gener approach to construct fuzzi system is given . it is also shown that defuzzifi base upon center of area is not appropri to the fuzzi system base upon genuin many-valu implic

single input and single output fuzzy systems


Does social capital determine innovation? To what extent?

Abstract: This paper deals with two questions: Does social capital determine innovation in manufacturing firms? If it is the case, to what extent? To deal with these questions, we review the literature on innovation in order to see how social capital came to be added to the other forms of capital as an explanatory variable of innovation. In doing so, we have been led to follow the dominating view of the literature on social capital and innovation which claims that social capital cannot be captured through a single indicator, but that it actually takes many different forms that must be accounted for. Therefore, to the traditional explanatory variables of innovation, we have added five forms of structural social capital (business network assets, information network assets, research network assets, participation assets, and relational assets) and one form of cognitive social capital (reciprocal trust). In a context where empirical investigations regarding the relations between social capital and innovation are still scanty, this paper makes contributions to the advancement of knowledge in providing new evidence regarding the impact and the extent of social capital on innovation at the two decisionmaking stages considered in this study

doe social capit determin innov ? to what extent ?
 thi paper deal with two question : doe social capit determin innov in manufactur firm ? if it is the case , to what extent ? to deal with these question , we review the literatur on innov in order to see how social capit came to be ad to the other form of capit as an explanatori variabl of innov . in do so , we have been led to follow the domin view of the literatur on social capit and innov which claim that social capit can not be captur through a singl indic , but that it actual take mani differ form that must be account for . therefor , to the tradit explanatori variabl of innov , we have ad five form of structur social capit ( busi network asset , inform network asset , research network asset , particip asset , and relat asset ) and one form of cognit social capit ( reciproc trust ) . in a context where empir investig regard the relat between social capit and innov are still scanti , thi paper make contribut to the advanc of knowledg in provid new evid regard the impact and the extent of social capit on innov at the two decisionmak stage consid in thi studi

innovation
manufacturing firms
structural social capital
business network assets
information network assets
research network assets
participation assets
relational assets
cognitive social capital
reciprocal trust
two-stage decision-making process
degree of radicalness


Controls help harmonic spray do OK removing residues

Abstract: Looks at how innovative wafer-cleaning equipment hit the market in a timely fashion thanks in part to controls maker Rockwell Automation

control help harmon spray do ok remov residu
 look at how innov wafer-clean equip hit the market in a time fashion thank in part to control maker rockwel autom

Allen-Bradley ControlLogix automation control platform

Allen-Bradley 1336 Plus II variable frequency ac drives


Recruiting and retaining women in undergraduate computing majors

Abstract: This paper recommends methods for increasing female participation in undergraduate computer science. The recommendations are based on recent and on-going research into the gender gap in computer science and related disciplines. They are intended to work in tandem with the Computing Research Association's recommendations for graduate programs to promote a general increase in women's participation in computing professions. Most of the suggestions offered could improve the educational environment for both male and female students. However, general improvements are likely to be of particular benefit to women because women in our society do not generally receive the same level of support that men receive for entering and persisting in this field

recruit and retain women in undergradu comput major
 thi paper recommend method for increas femal particip in undergradu comput scienc . the recommend are base on recent and on-go research into the gender gap in comput scienc and relat disciplin . they are intend to work in tandem with the comput research associ 's recommend for graduat program to promot a gener increas in women 's particip in comput profess . most of the suggest offer could improv the educ environ for both male and femal student . howev , gener improv are like to be of particular benefit to women becaus women in our societi do not gener receiv the same level of support that men receiv for enter and persist in thi field

undergraduate computing majors
female participation
computer science
gender gap
women retention
women recruitment


Heuristics for single-pass welding task sequencing

Abstract: Welding task sequencing is a prerequisite in the offline programming of robot arc welding. Single-pass welding task sequencing can be modelled as a modified travelling salesman problem. Owing to the difficulty of the resulting arc-routing problems, effective local search heuristics are developed. Computational speed becomes important because robot arc welding is often part of an automated process-planning procedure. Generating a reasonable solution in an acceptable time is necessary for effective automated process planning. Several different heuristics are proposed for solving the welding task-sequencing problem considering both productivity and the potential for welding distortion. Constructive heuristics based on the nearest neighbour concept and tabu search heuristics are developed and enhanced using improvement procedures. The effectiveness of the heuristics developed is tested and verified on actual welded structure problems and random problems

heurist for single-pass weld task sequenc
 weld task sequenc is a prerequisit in the offlin program of robot arc weld . single-pass weld task sequenc can be model as a modifi travel salesman problem . owe to the difficulti of the result arc-rout problem , effect local search heurist are develop . comput speed becom import becaus robot arc weld is often part of an autom process-plan procedur . gener a reason solut in an accept time is necessari for effect autom process plan . sever differ heurist are propos for solv the weld task-sequenc problem consid both product and the potenti for weld distort . construct heurist base on the nearest neighbour concept and tabu search heurist are develop and enhanc use improv procedur . the effect of the heurist develop is test and verifi on actual weld structur problem and random problem

single-pass welding task sequencing
offline programming
robot arc welding
modified travelling salesman problem
local search heuristics
computational speed
automated process-planning procedure
productivity
welding distortion
constructive heuristics
nearest neighbour concept
tabu search heuristics
welded structure problems
random problems


Verona Lastre: consolidation provides opening for a new plate vendor

Abstract: Fewer companies than ever are manufacturing CTP plates. The market has become globalized, with just four big firms dominating the picture. To the Samor Group, however, globalization looked like an opportunity; it reasoned that many a national and local distributor would welcome a small, competitive, regional manufacturer. A couple of years ago it formed a company, Verona Lastre, to exploit that opportunity. Now Vela, as it's familiarly called, has launched its line of high-quality thermal plates and is busily lining up dealers in Europe and the Americas

verona lastr : consolid provid open for a new plate vendor
 fewer compani than ever are manufactur ctp plate . the market ha becom global , with just four big firm domin the pictur . to the samor group , howev , global look like an opportun ; it reason that mani a nation and local distributor would welcom a small , competit , region manufactur . a coupl of year ago it form a compani , verona lastr , to exploit that opportun . now vela , as it 's familiarli call , ha launch it line of high-qual thermal plate and is busili line up dealer in europ and the america


Topology-reducing surface simplification using a discrete solid representation

Abstract: This paper presents a new approach for generating coarse-level approximations of topologically complex models. Dramatic topology reduction is achieved by converting a 3D model to and from a volumetric representation. Our approach produces valid, error-bounded models and supports the creation of approximations that do not interpenetrate the original model, either being completely contained in the input solid or bounding it. Several simple to implement versions of our approach are presented and discussed. We show that these methods perform significantly better than other surface-based approaches when simplifying topologically-rich models such as scene parts and complex mechanical assemblies

topology-reduc surfac simplif use a discret solid represent
 thi paper present a new approach for gener coarse-level approxim of topolog complex model . dramat topolog reduct is achiev by convert a 3d model to and from a volumetr represent . our approach produc valid , error-bound model and support the creation of approxim that do not interpenetr the origin model , either be complet contain in the input solid or bound it . sever simpl to implement version of our approach are present and discuss . we show that these method perform significantli better than other surface-bas approach when simplifi topologically-rich model such as scene part and complex mechan assembl


The year of the racehorse [China Telecom]

Abstract: Does China really offer the telecoms industry a route out of the telecoms slump? According to the Chinese government it has yet to receive a single application from foreign companies looking to invest in the country's domestic telecoms sector since the country joined the World Trade Organisation

the year of the racehors [ china telecom ]
 doe china realli offer the telecom industri a rout out of the telecom slump ? accord to the chines govern it ha yet to receiv a singl applic from foreign compani look to invest in the countri 's domest telecom sector sinc the countri join the world trade organis

China
China Telecom
telecoms industry
foreign investment
China Netcom
China Unicorn


Fidelity of quantum teleportation through noisy channels

Abstract: We investigate quantum teleportation through noisy quantum channels by solving analytically and numerically a master equation in the Lindblad form. We calculate the fidelity as a function of decoherence rates and angles of a state to be teleported. It is found that the average fidelity and the range of states to be accurately teleported depend on types of noises acting on quantum channels. If the quantum channels are subject to isotropic noise, the average fidelity decays to 1/2, which is smaller than the best possible value of 2/3 obtained only by the classical communication. On the other hand, if the noisy quantum channel is modeled by a single Lindblad operator, the average fidelity is always greater than 2/3

fidel of quantum teleport through noisi channel
 we investig quantum teleport through noisi quantum channel by solv analyt and numer a master equat in the lindblad form . we calcul the fidel as a function of decoher rate and angl of a state to be teleport . it is found that the averag fidel and the rang of state to be accur teleport depend on type of nois act on quantum channel . if the quantum channel are subject to isotrop nois , the averag fidel decay to 1/2 , which is smaller than the best possibl valu of 2/3 obtain onli by the classic commun . on the other hand , if the noisi quantum channel is model by a singl lindblad oper , the averag fidel is alway greater than 2/3

fidelity
quantum teleportation
noisy quantum channels
quantum channels
isotropic noise
classical communication
Lindblad operator
analytical solution
numerical solution
Alice
Bob
sender
recipient
dual classical channels
eigenstate


Extracting straight road structure in urban environments using IKONOS satellite imagery

Abstract: We discuss a fully automatic technique for extracting roads in urban environments. The method has its bases in a vegetation mask derived from multispectral IKONOS data and in texture derived from panchromatic IKONOS data. These two techniques together are used to distinguish road pixels. We then move from individual pixels to an object-based representation that allows reasoning on a higher level. Recognition of individual segments and intersections and the relationships among them are used to determine underlying road structure and to then logically hypothesize the existence of additional road network components. We show results on an image of San Diego, California. The object-based processing component may be adapted to utilize other basis techniques as well, and could be used to build a road network in any scene having a straight-line structured topology

extract straight road structur in urban environ use ikono satellit imageri
 we discuss a fulli automat techniqu for extract road in urban environ . the method ha it base in a veget mask deriv from multispectr ikono data and in textur deriv from panchromat ikono data . these two techniqu togeth are use to distinguish road pixel . we then move from individu pixel to an object-bas represent that allow reason on a higher level . recognit of individu segment and intersect and the relationship among them are use to determin underli road structur and to then logic hypothes the exist of addit road network compon . we show result on an imag of san diego , california . the object-bas process compon may be adapt to util other basi techniqu as well , and could be use to build a road network in ani scene have a straight-lin structur topolog

straight road structure
urban environments
IKONOS satellite imagery
fully automatic technique
vegetation mask
texture
panchromatic IKONOS data
road pixels
object-based representation
road network components
San Diego
object-based processing component
straight-line structured topology
higher level reasoning
individual segment recognition
high-resolution imagery
large-scale feature extraction
vectorized road network


IT security issues: the need for end user oriented research

Abstract: Considerable attention has been given to the technical and policy issues involved with IT security issues in recent years. The growth of e-commerce and the Internet, as well as widely publicized hacker attacks, have brought IT security into prominent focus and routine corporate attention. Yet, much more research is needed from the end user (EU) perspective. This position paper is a call for such research and outlines some possible directions of interest

it secur issu : the need for end user orient research
 consider attent ha been given to the technic and polici issu involv with it secur issu in recent year . the growth of e-commerc and the internet , as well as wide public hacker attack , have brought it secur into promin focu and routin corpor attent . yet , much more research is need from the end user ( eu ) perspect . thi posit paper is a call for such research and outlin some possibl direct of interest

IT security
end user oriented research
e-commerce
Internet
hacker attacks
information technology research
end user computing


A formal framework for viewpoint consistency

Abstract: Multiple viewpoint models of system development are becoming increasingly important. Each viewpoint offers a different perspective on the target system and system development involves parallel refinement of the multiple views. Viewpoint related approaches have been considered in a number of different guises by a spectrum of researchers. Our work particularly focuses on the use of viewpoints in open distributed processing (ODP) which is an ISO/ITU standardisation framework. The requirements of viewpoint modelling in ODP are very broad and, hence, demanding. Multiple viewpoints, though, prompt the issue of consistency between viewpoints. This paper describes a very general interpretation of consistency which we argue is broad enough to meet the requirements of consistency in ODP. We present a formal framework for this general interpretation; highlight basic properties of the interpretation and locate restricted classes of consistency. Strategies for checking consistency are also investigated. Throughout we illustrate our theory using the formal description technique LOTOS. Thus, the paper also characterises the nature of and options for consistency checking in LOTOS

a formal framework for viewpoint consist
 multipl viewpoint model of system develop are becom increasingli import . each viewpoint offer a differ perspect on the target system and system develop involv parallel refin of the multipl view . viewpoint relat approach have been consid in a number of differ guis by a spectrum of research . our work particularli focus on the use of viewpoint in open distribut process ( odp ) which is an iso / itu standardis framework . the requir of viewpoint model in odp are veri broad and , henc , demand . multipl viewpoint , though , prompt the issu of consist between viewpoint . thi paper describ a veri gener interpret of consist which we argu is broad enough to meet the requir of consist in odp . we present a formal framework for thi gener interpret ; highlight basic properti of the interpret and locat restrict class of consist . strategi for check consist are also investig . throughout we illustr our theori use the formal descript techniqu loto . thu , the paper also characteris the natur of and option for consist check in loto

formal framework
viewpoint consistency
multiple viewpoint models
system development
open distributed processing
ODP
ISO/ITU standardisation framework
formal description technique
LOTOS
consistency checking
development models
process algebra


Modular and visual specification of hybrid systems: an introduction to HyCharts

Abstract: Visual description techniques are particularly important for the design of hybrid systems, because specifications of such systems usually have to be discussed between engineers from a number of different disciplines. Modularity is vital for hybrid systems not only because it allows to handle large systems, but also because it permits to think in terms of components, which is familiar to engineers. Based on two different interpretations for hierarchic graphs and on a clear hybrid computation model, we develop HyCharts. HyCharts consist of two modular visual formalisms, one for the specification of the architecture and one for the specification of the behavior of hybrid systems. The operators on hierarchic graphs enable us to give a surprisingly simple denotational semantics for many concepts known from statechart-like formalisms. Due to a very general composition operator, HyCharts can easily be composed with description techniques from other engineering disciplines. Such heterogeneous system specifications seem to be particularly appropriate for hybrid systems because of their interdisciplinary character

modular and visual specif of hybrid system : an introduct to hychart
 visual descript techniqu are particularli import for the design of hybrid system , becaus specif of such system usual have to be discuss between engin from a number of differ disciplin . modular is vital for hybrid system not onli becaus it allow to handl larg system , but also becaus it permit to think in term of compon , which is familiar to engin . base on two differ interpret for hierarch graph and on a clear hybrid comput model , we develop hychart . hychart consist of two modular visual formal , one for the specif of the architectur and one for the specif of the behavior of hybrid system . the oper on hierarch graph enabl us to give a surprisingli simpl denot semant for mani concept known from statechart-lik formal . due to a veri gener composit oper , hychart can easili be compos with descript techniqu from other engin disciplin . such heterogen system specif seem to be particularli appropri for hybrid system becaus of their interdisciplinari charact

visual specification
hybrid systems
HyCharts
visual description techniques
components
hierarchic graphs
hybrid computation model
denotational semantics
heterogeneous system specifications
modular specification
statechart
formal specification


Dynamic testing of inflatable structures using smart materials

Abstract: In this paper we present experimental investigations of the vibration testing of an inflated, thin-film torus using smart materials. Lightweight, inflatable structures are very attractive in satellite applications. However, the lightweight, flexible and highly damped nature of inflated structures poses difficulties in ground vibration testing. In this study, we show that polyvinylidene fluoride (PVDF) patches and recently developed macro-fiber composite actuators may be used as sensors and actuators in identifying modal parameters. Both smart materials can be integrated unobtrusively into the skin of a torus or space device forming an attractive testing arrangement. The addition of actuators and PVDF sensors to the torus does not significantly interfere with the suspension modes of a free-free boundary condition, and can be considered an integral part of the inflated structure. The results indicate the potential of using smart materials to measure and control the dynamic response of inflated structures

dynam test of inflat structur use smart materi
 in thi paper we present experiment investig of the vibrat test of an inflat , thin-film toru use smart materi . lightweight , inflat structur are veri attract in satellit applic . howev , the lightweight , flexibl and highli damp natur of inflat structur pose difficulti in ground vibrat test . in thi studi , we show that polyvinyliden fluorid ( pvdf ) patch and recent develop macro-fib composit actuat may be use as sensor and actuat in identifi modal paramet . both smart materi can be integr unobtrus into the skin of a toru or space devic form an attract test arrang . the addit of actuat and pvdf sensor to the toru doe not significantli interfer with the suspens mode of a free-fre boundari condit , and can be consid an integr part of the inflat structur . the result indic the potenti of use smart materi to measur and control the dynam respons of inflat structur

inflated structures
smart materials
thin-film torus
satellite applications
ground vibration testing
macro-fiber composite actuators
modal parameters
space device
PVDF sensors
boundary condition
dynamic response
polyvinylidene fluoride patches
Kapton torus


A suggestion of fractional-order controller for flexible spacecraft attitude control

Abstract: A controller design method for flexible spacecraft attitude control is proposed. The system is first described by a partial differential equation with internal damping. Then the frequency response is analyzed, and the three basic characteristics of the flexible system, namely, average function, lower bound and upper bound are defined. On this basis, a fractional-order controller is proposed, which functions as phase stabilization control for lower frequency and smoothly enters to amplitude stabilization at higher frequency by proper amplitude attenuation. It is shown that the equivalent damping ratio increases in proportion to the square of frequency

a suggest of fractional-ord control for flexibl spacecraft attitud control
 a control design method for flexibl spacecraft attitud control is propos . the system is first describ by a partial differenti equat with intern damp . then the frequenc respons is analyz , and the three basic characterist of the flexibl system , name , averag function , lower bound and upper bound are defin . on thi basi , a fractional-ord control is propos , which function as phase stabil control for lower frequenc and smoothli enter to amplitud stabil at higher frequenc by proper amplitud attenu . it is shown that the equival damp ratio increas in proport to the squar of frequenc

fractional-order controller
flexible spacecraft attitude control
partial differential equation
internal damping
frequency response
phase stabilization control
amplitude stabilization
damping ratio


Lob's theorem as a limitation on mechanism

Abstract: We argue that Lob's Theorem implies a limitation on mechanism. Specifically, we argue, via an application of a generalized version of Lob's Theorem, that any particular device known by an observer to be mechanical cannot be used as an epistemic authority (of a particular type) by that observer: either the belief-set of such an authority is not mechanizable or, if it is, there is no identifiable formal system of which the observer can know (or truly believe) it to be the theorem-set. This gives, we believe, an important and hitherto unnoticed connection between mechanism and the use of authorities by human-like epistemic agents

lob 's theorem as a limit on mechan
 we argu that lob 's theorem impli a limit on mechan . specif , we argu , via an applic of a gener version of lob 's theorem , that ani particular devic known by an observ to be mechan can not be use as an epistem author ( of a particular type ) by that observ : either the belief-set of such an author is not mechaniz or , if it is , there is no identifi formal system of which the observ can know ( or truli believ ) it to be the theorem-set . thi give , we believ , an import and hitherto unnot connect between mechan and the use of author by human-lik epistem agent

limitation on mechanism
epistemic authority
belief-set
formal system
theorem-set
human-like epistemic agents
Lob Theorem


Is diversity in computing a moral matter?

Abstract: We have presented an ethical argument that takes into consideration the subtleties of the issue surrounding under-representation in computing. We should emphasize that there is nothing subtle about overt, unfair discrimination. Where such injustice occurs, we condemn it. Our concern is that discrimination need not be explicit or overt. It need not be individual-to-individual. Rather, it can be subtly built into social practices and social institutions. Our analysis raises ethical questions about aspects of computing that drive women away, aspects that can be changed in ways that improve the profession and access to the profession. We hope that computing will move towards these improvements

is divers in comput a moral matter ?
 we have present an ethic argument that take into consider the subtleti of the issu surround under-represent in comput . we should emphas that there is noth subtl about overt , unfair discrimin . where such injustic occur , we condemn it . our concern is that discrimin need not be explicit or overt . it need not be individual-to-individu . rather , it can be subtli built into social practic and social institut . our analysi rais ethic question about aspect of comput that drive women away , aspect that can be chang in way that improv the profess and access to the profess . we hope that comput will move toward these improv

ethical argument
unfair discrimination
social practices
social institutions
women
computing under-representation


A maximum-likelihood surface estimator for dense range data

Abstract: Describes how to estimate 3D surface models from dense sets of noisy range data taken from different points of view, i.e., multiple range maps. The proposed method uses a sensor model to develop an expression for the likelihood of a 3D surface, conditional on a set of noisy range measurements. Optimizing this likelihood with respect to the model parameters provides an unbiased and efficient estimator. The proposed numerical algorithms make this estimation computationally practical for a wide variety of circumstances. The results from this method compare favorably with state-of-the-art approaches that rely on the closest-point or perpendicular distance metric, a convenient heuristic that produces biased solutions and fails completely when surfaces are not sufficiently smooth, as in the case of complex scenes or noisy range measurements. Empirical results on both simulated and real ladar data demonstrate the effectiveness of the proposed method for several different types of problems. Furthermore, the proposed method offers a general framework that can accommodate extensions to include surface priors, more sophisticated noise models, and other sensing modalities, such as sonar or synthetic aperture radar

a maximum-likelihood surfac estim for dens rang data
 describ how to estim 3d surfac model from dens set of noisi rang data taken from differ point of view , i.e. , multipl rang map . the propos method use a sensor model to develop an express for the likelihood of a 3d surfac , condit on a set of noisi rang measur . optim thi likelihood with respect to the model paramet provid an unbias and effici estim . the propos numer algorithm make thi estim comput practic for a wide varieti of circumst . the result from thi method compar favor with state-of-the-art approach that reli on the closest-point or perpendicular distanc metric , a conveni heurist that produc bias solut and fail complet when surfac are not suffici smooth , as in the case of complex scene or noisi rang measur . empir result on both simul and real ladar data demonstr the effect of the propos method for sever differ type of problem . furthermor , the propos method offer a gener framework that can accommod extens to includ surfac prior , more sophist nois model , and other sens modal , such as sonar or synthet apertur radar

maximum-likelihood surface estimator
dense range data
3D surface models
noisy range data
sensor model
noisy range measurements
heuristic
biased solutions
complex scenes
real ladar data
sonar
synthetic aperture radar
unbiased estimator
simulated ladar data
surface reconstruction
surface fitting
optimal estimation
parameter estimation
Bayesian estimation
registration
calibration

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


Dynamics of the firing probability of noisy integrate-and-fire neurons

Abstract: Cortical neurons in vivo undergo a continuous bombardment due to synaptic activity, which acts as a major source of noise. We investigate the effects of the noise filtering by synapses with various levels of realism on integrate-and-fire neuron dynamics. The noise input is modeled by white (for instantaneous synapses) or colored (for synapses with a finite relaxation time) noise. Analytical results for the modulation of firing probability in response to an oscillatory input current are obtained by expanding a Fokker-Planck equation for small parameters of the problem-when both the amplitude of the modulation is small compared to the background firing rate and the synaptic time constant is small compared to the membrane time constant. We report the detailed calculations showing that if a synaptic decay time constant is included in the synaptic current model, the firing-rate modulation of the neuron due to an oscillatory input remains finite in the high-frequency limit with no phase lag. In addition, we characterize the low-frequency behavior and the behavior of the high-frequency limit for intermediate decay times. We also characterize the effects of introducing a rise time to the synaptic currents and the presence of several synaptic receptors with different kinetics. In both cases, we determine, using numerical simulations, an effective decay time constant that describes the neuronal response completely

dynam of the fire probabl of noisi integrate-and-fir neuron
 cortic neuron in vivo undergo a continu bombard due to synapt activ , which act as a major sourc of nois . we investig the effect of the nois filter by synaps with variou level of realism on integrate-and-fir neuron dynam . the nois input is model by white ( for instantan synaps ) or color ( for synaps with a finit relax time ) nois . analyt result for the modul of fire probabl in respons to an oscillatori input current are obtain by expand a fokker-planck equat for small paramet of the problem-when both the amplitud of the modul is small compar to the background fire rate and the synapt time constant is small compar to the membran time constant . we report the detail calcul show that if a synapt decay time constant is includ in the synapt current model , the firing-r modul of the neuron due to an oscillatori input remain finit in the high-frequ limit with no phase lag . in addit , we character the low-frequ behavior and the behavior of the high-frequ limit for intermedi decay time . we also character the effect of introduc a rise time to the synapt current and the presenc of sever synapt receptor with differ kinet . in both case , we determin , use numer simul , an effect decay time constant that describ the neuron respons complet

firing probability
noisy integrate-and-fire neurons
cortical neurons
synaptic activity
noise filtering
Fokker-Planck equation
synaptic time constant
membrane time constant
phase lag
synaptic receptors
numerical simulation
white noise
colored noise


Ultrafast compound imaging for 2-D motion vector estimation: application to transient elastography

Abstract: This paper describes a new technique for two-dimensional (2-D) imaging of the motion vector at a very high frame rate with ultrasound. Its potential is experimentally demonstrated for transient elastography. But, beyond this application, it also could be promising for color flow and reflectivity imaging. To date, only axial displacements induced in human tissues by low-frequency vibrators were measured during transient elastography. The proposed technique allows us to follow both axial and lateral displacements during the shear wave propagation and thus should improve Young's modulus image reconstruction. The process is a combination of several ideas well-known in ultrasonic imaging: ultra-fast imaging, multisynthetic aperture beamforming, 1-D speckle tracking, and compound imaging. Classical beamforming in the transmit mode is replaced here by a single plane wave insonification increasing the frame rate by at least a factor of 128. The beamforming is achieved only in the receive mode on two independent subapertures. Comparison of successive frames by a classical 1-D speckle tracking algorithm allows estimation of displacements along two different directions linked to the subapertures beams. The variance of the estimates is finally improved by tilting the emitting plane wave at each insonification, thus allowing reception of successive decorrelated speckle patterns

ultrafast compound imag for 2-d motion vector estim : applic to transient elastographi
 thi paper describ a new techniqu for two-dimension ( 2-d ) imag of the motion vector at a veri high frame rate with ultrasound . it potenti is experiment demonstr for transient elastographi . but , beyond thi applic , it also could be promis for color flow and reflect imag . to date , onli axial displac induc in human tissu by low-frequ vibrat were measur dure transient elastographi . the propos techniqu allow us to follow both axial and later displac dure the shear wave propag and thu should improv young 's modulu imag reconstruct . the process is a combin of sever idea well-known in ultrason imag : ultra-fast imag , multisynthet apertur beamform , 1-d speckl track , and compound imag . classic beamform in the transmit mode is replac here by a singl plane wave insonif increas the frame rate by at least a factor of 128 . the beamform is achiev onli in the receiv mode on two independ subapertur . comparison of success frame by a classic 1-d speckl track algorithm allow estim of displac along two differ direct link to the subapertur beam . the varianc of the estim is final improv by tilt the emit plane wave at each insonif , thu allow recept of success decorrel speckl pattern

ultrafast compound imaging
transient elastography
high frame rate
ultrasound
reflectivity imaging
axial displacements
human tissues
lateral displacements
shear wave propagation
Young's modulus image reconstruction
ultrasonic imaging
multisynthetic aperture beamforming
single plane wave insonification
decorrelated speckle patterns
2D motion vector estimation
two-dimensional imaging
2D imaging
colour flow imaging
1D speckle tracking algorithm


Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system

Abstract: We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced to that of a single-server queue. We present a complete solution to the waiting-time distribution of D-MAP/D/k queue together with some computational results

waiting-tim distribut of a discrete-tim multiserv queue with correl arriv and determinist servic time : d-map / d / k system
 we deriv the waiting-tim distribut of a discrete-tim multiserv queue with correl arriv and determinist ( or constant ) servic time . we show that the procedur for obtain the waiting-tim distribut of a multiserv queue is reduc to that of a single-serv queue . we present a complet solut to the waiting-tim distribut of d-map / d / k queue togeth with some comput result

waiting-time distribution
discrete-time multiserver queue
correlated arrivals
deterministic service times
D-MAP/D/k system
Markovian arrival process


Women in computing: what brings them to it, what keeps them in it?

Abstract: Career stereotyping and misperceptions about the nature of computing are substantive reasons for the under representation of women in professional computing careers. In this study, 15 women who have work experience in several aspects of computing were asked about their reasons for entering computing, what they liked about working in computing, and what they disliked. While there are many common threads, there are also individual differences. Common reasons for choosing computing as a career included: exposure to computing in a setting which enabled them to see the versatility of computers; the influence of someone close to them; personal abilities which they perceived to be appropriate for a career in computing; and characteristics of such careers which appealed to them. Generally, women working in the field enjoy the work they are doing. Dislikes arising from their work experiences are more likely to be associated with people and politics than with the work they do-and they would like to have more female colleagues

women in comput : what bring them to it , what keep them in it ?
 career stereotyp and mispercept about the natur of comput are substant reason for the under represent of women in profession comput career . in thi studi , 15 women who have work experi in sever aspect of comput were ask about their reason for enter comput , what they like about work in comput , and what they dislik . while there are mani common thread , there are also individu differ . common reason for choos comput as a career includ : exposur to comput in a set which enabl them to see the versatil of comput ; the influenc of someon close to them ; person abil which they perceiv to be appropri for a career in comput ; and characterist of such career which appeal to them . gener , women work in the field enjoy the work they are do . dislik aris from their work experi are more like to be associ with peopl and polit than with the work they do-and they would like to have more femal colleagu

women
career stereotyping
misperceptions
professional computing careers
personal abilities
politics


Voltage control methods with grid connected wind turbines: a tutorial review

Abstract: Within electricity grid networks it is conventional for large-scale central generators to both provide power and control grid node voltage. Therefore when wind turbines replace conventional power stations on a substantial scale, they must not only generate power, but also control grid node voltages. This paper reviews the basic principles of voltage control for tutorial benefit and then considers application of grid-connected wind turbines for voltage control. The most widely used contemporary wind turbine types are considered and further detail is given for determining the range of variables that allow control

voltag control method with grid connect wind turbin : a tutori review
 within electr grid network it is convent for large-scal central gener to both provid power and control grid node voltag . therefor when wind turbin replac convent power station on a substanti scale , they must not onli gener power , but also control grid node voltag . thi paper review the basic principl of voltag control for tutori benefit and then consid applic of grid-connect wind turbin for voltag control . the most wide use contemporari wind turbin type are consid and further detail is given for determin the rang of variabl that allow control

voltage control
grid connected wind turbines
electricity grid networks
large-scale central generators
grid node voltages control
reactive power
direct drive
variable speed
offshore wind park
squirrel cage induction generator
doubly fed induction generator
direct drive synchronous generator
weak grid
converter rating


Becoming a computer scientist

Abstract: The focus of this report is pipeline shrinkage for women in computer science. We describe the situation for women at all stages of training in computer science, from the precollege level through graduate school. Because many of the problems discussed are related to the lack of role models for women who are in the process of becoming computer scientists, we also concern ourselves with the status of women faculty members. We not only describe the problems, but also make specific recommendations for change and encourage further study of those problems whose solutions are not yet well understood

becom a comput scientist
 the focu of thi report is pipelin shrinkag for women in comput scienc . we describ the situat for women at all stage of train in comput scienc , from the precolleg level through graduat school . becaus mani of the problem discuss are relat to the lack of role model for women who are in the process of becom comput scientist , we also concern ourselv with the statu of women faculti member . we not onli describ the problem , but also make specif recommend for chang and encourag further studi of those problem whose solut are not yet well understood

pipeline shrinkage
women
computer science
role models
women faculty members


Some recent advances in validated methods for IVPs for ODEs

Abstract: Compared to standard numerical methods for initial value problems (IVPs) for ordinary differential equations (ODEs), validated methods (often called interval methods) for IVPs for ODEs have two important advantages: if they return a solution to a problem, then (1) the problem is guaranteed to have a unique solution, and (2) an enclosure of the true solution is produced. We present a brief overview of interval Taylor series (ITS) methods for IVPs for ODEs and discuss some recent advances in the theory of validated methods for IVPs for ODEs. In particular, we discuss an interval Hermite-Obreschkoff (IHO) scheme for computing rigorous bounds on the solution of an IVP for an ODE, the stability of ITS and IHO methods, and a new perspective on the wrapping effect, where we interpret the problem of reducing the wrapping effect as one of finding a more stable scheme for advancing the solution

some recent advanc in valid method for ivp for ode
 compar to standard numer method for initi valu problem ( ivp ) for ordinari differenti equat ( ode ) , valid method ( often call interv method ) for ivp for ode have two import advantag : if they return a solut to a problem , then ( 1 ) the problem is guarante to have a uniqu solut , and ( 2 ) an enclosur of the true solut is produc . we present a brief overview of interv taylor seri ( it ) method for ivp for ode and discuss some recent advanc in the theori of valid method for ivp for ode . in particular , we discuss an interv hermite-obreschkoff ( iho ) scheme for comput rigor bound on the solut of an ivp for an ode , the stabil of it and iho method , and a new perspect on the wrap effect , where we interpret the problem of reduc the wrap effect as one of find a more stabl scheme for advanc the solut

validated methods
initial value problems
ordinary differential equations
interval methods
interval Taylor series
wrapping effect
interval Hermite-Obreschkoff scheme
QR algorithm


A discontinuous Galerkin method for transient analysis of wave propagation in unbounded domains

Abstract: A technique based on the discontinuous Galerkin finite element method is developed and applied to the derivation of an absorbing boundary condition for the analysis of transient wave propagation. The condition is exact in that only discretization error is involved. Furthermore, the computational cost associated with use of the condition is an order of magnitude lower than for conditions based on Green functions. The time-stepping scheme resulting from an implicit method in conjunction with this boundary condition appears to be unconditionally stable

a discontinu galerkin method for transient analysi of wave propag in unbound domain
 a techniqu base on the discontinu galerkin finit element method is develop and appli to the deriv of an absorb boundari condit for the analysi of transient wave propag . the condit is exact in that onli discret error is involv . furthermor , the comput cost associ with use of the condit is an order of magnitud lower than for condit base on green function . the time-step scheme result from an implicit method in conjunct with thi boundari condit appear to be uncondit stabl


Arbortext: enabler of multichannel publishing

Abstract: A company has a document-say, dosage instructions for a prescription drug or a troubleshooting sheet for a DVD drive. That document starts its life in a predictable format, probably Microsoft Word or WordPerfect, but then-to meet the needs of readers who nowadays demand access via multiple devices-the material has to be translated into many more formats: HTML, PageMaker, or Quark, possibly RTF, almost certainly PDF, and nowadays, next-generation devices (cell phones, handheld computers) also impose their own requirements. And what if, suddenly, the dosage levels change or new workarounds emerge to handle DVD problems? That's when a company should put in a call to Arbortext, a 20-year-old Ann Arbor, Michigan-based company that exists to solve a single problem: helping clients automate multichannel publishing

arbortext : enabl of multichannel publish
 a compani ha a document-say , dosag instruct for a prescript drug or a troubleshoot sheet for a dvd drive . that document start it life in a predict format , probabl microsoft word or wordperfect , but then-to meet the need of reader who nowaday demand access via multipl devices-th materi ha to be translat into mani more format : html , pagemak , or quark , possibl rtf , almost certainli pdf , and nowaday , next-gener devic ( cell phone , handheld comput ) also impos their own requir . and what if , suddenli , the dosag level chang or new workaround emerg to handl dvd problem ? that 's when a compani should put in a call to arbortext , a 20-year-old ann arbor , michigan-bas compani that exist to solv a singl problem : help client autom multichannel publish

Arbortext
multichannel publishing
next-generation devices
document format
content assets


Adaptive wavelet methods. II. Beyond the elliptic case

Abstract: This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability of the adaptive wavelet-based method developed previously for symmetric positive definite problems to indefinite or unsymmetric systems of operator equations. This is accomplished by first introducing techniques (such as the least squares formulation developed previously) that transform the original (continuous) problem into an equivalent infinite system of equations which is now well-posed in the Euclidean metric. It is then shown how to utilize adaptive techniques to solve the resulting infinite system of equations. It is shown that for a wide range of problems, this new adaptive method performs with asymptotically optimal complexity, i.e., it recovers an approximate solution with desired accuracy at a computational expense that stays proportional to the number of terms in a corresponding wavelet-best N-term approximation. An important advantage of this adaptive approach is that it automatically stabilizes the numerical procedure so that, for instance, compatibility constraints on the choice of trial spaces, like the LBB condition, no longer arise

adapt wavelet method . ii . beyond the ellipt case
 thi paper is concern with the design and analysi of adapt wavelet method for system of oper equat . it main accomplish is to extend the rang of applic of the adapt wavelet-bas method develop previous for symmetr posit definit problem to indefinit or unsymmetr system of oper equat . thi is accomplish by first introduc techniqu ( such as the least squar formul develop previous ) that transform the origin ( continu ) problem into an equival infinit system of equat which is now well-pos in the euclidean metric . it is then shown how to util adapt techniqu to solv the result infinit system of equat . it is shown that for a wide rang of problem , thi new adapt method perform with asymptot optim complex , i.e. , it recov an approxim solut with desir accuraci at a comput expens that stay proport to the number of term in a correspond wavelet-best n-term approxim . an import advantag of thi adapt approach is that it automat stabil the numer procedur so that , for instanc , compat constraint on the choic of trial space , like the lbb condit , no longer aris

adaptive wavelet methods
elliptic case
operator equations
least squares formulation
Euclidean metric
asymptotically optimal complexity
N-term approximation


Application of Sugeno fuzzy-logic controller to the stator field-oriented doubly-fed asynchronous motor drive

Abstract: This study deals with the application of the fuzzy-control theory to wound-rotor asynchronous motor with both its stator and rotor fed by two PWM voltage-source inverters, in which the system operates in stator field-oriented control. Thus, after determining the model of the machine, we present two types of fuzzy controller: Mamdani and Sugeno controllers. The training of the last one is carried out starting from the first. Simulation study is conducted to show the effectiveness of the proposed method

applic of sugeno fuzzy-log control to the stator field-ori doubly-f asynchron motor drive
 thi studi deal with the applic of the fuzzy-control theori to wound-rotor asynchron motor with both it stator and rotor fed by two pwm voltage-sourc invert , in which the system oper in stator field-ori control . thu , after determin the model of the machin , we present two type of fuzzi control : mamdani and sugeno control . the train of the last one is carri out start from the first . simul studi is conduct to show the effect of the propos method


A transactional asynchronous replication scheme for mobile database systems

Abstract: In mobile database systems, mobility of users has a significant impact on data replication. As a result, the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable. To solve this problem, a new mobile database replication scheme, the Transaction-Level Result-Set Propagation (TLRSP) model, is put forward in this paper. The conflict detection and resolution strategy based on TLRSP is discussed in detail, and the implementation algorithm is proposed. In order to compare the performance of the TLRSP model with that of other mobile replication schemes, we have developed a detailed simulation model. Experimental results show that the TLRSP model provides an efficient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency

a transact asynchron replic scheme for mobil databas system
 in mobil databas system , mobil of user ha a signific impact on data replic . as a result , the variou replica control protocol that exist today in tradit distribut and multidatabas environ are no longer suitabl . to solv thi problem , a new mobil databas replic scheme , the transaction-level result-set propag ( tlrsp ) model , is put forward in thi paper . the conflict detect and resolut strategi base on tlrsp is discuss in detail , and the implement algorithm is propos . in order to compar the perform of the tlrsp model with that of other mobil replic scheme , we have develop a detail simul model . experiment result show that the tlrsp model provid an effici support for replic mobil databas system by reduc reprocess overhead and maintain databas consist


Embedding the outer automorphism group Out(F/sub n/) of a free group of rank n in the group Out(F/sub m/) for m > n

Abstract: It is proved that for every n >or= 1, the group Out(F/sub n/) is embedded in the group Out(F/sub m/) with m = 1 + (n - 1)k/sup n/, where k is an arbitrary natural number coprime to n - 1

embed the outer automorph group out(f / sub n/ ) of a free group of rank n in the group out(f / sub m/ ) for m > n
 it is prove that for everi n > or= 1 , the group out(f / sub n/ ) is embed in the group out(f / sub m/ ) with m = 1 + ( n - 1)k / sup n/ , where k is an arbitrari natur number coprim to n - 1

free group
arbitrary natural number coprime
outer automorphism group embedding


Modelling dependencies in paired comparison data a log-linear approach

Abstract: In many Bradley-Terry models a more or less explicit assumption is that all decisions of the judges are independent. An assumption which might be questionable at least for the decisions of a given judge. In paired comparison studies, a judge chooses among objects several times, and in such cases, judgements made by the same judge are likely to be dependent. A log-linear representation for the Bradley-Terry model is developed, which takes into account dependencies between judgements. The modelling of the dependencies is embedded in the analysis of multiple binomial responses, which has the advantage of interpretability in terms of conditional odds ratios. Furthermore, the modelling is done in the framework of generalized linear models, thus parameter estimation and the assessment of goodness of fit can be obtained in the standard way by using e.g. GLIM or another standard software

model depend in pair comparison data a log-linear approach
 in mani bradley-terri model a more or less explicit assumpt is that all decis of the judg are independ . an assumpt which might be question at least for the decis of a given judg . in pair comparison studi , a judg choos among object sever time , and in such case , judgement made by the same judg are like to be depend . a log-linear represent for the bradley-terri model is develop , which take into account depend between judgement . the model of the depend is embed in the analysi of multipl binomi respons , which ha the advantag of interpret in term of condit odd ratio . furthermor , the model is done in the framework of gener linear model , thu paramet estim and the assess of good of fit can be obtain in the standard way by use e.g. glim or anoth standard softwar

paired comparison data dependency modelling


Acts to facts catalogue

Abstract: The paper shows a way to satisfy users' changing and specific information needs by providing the modified format-author-collaborators-title-series-subject (FACTS). catalogue instead of the traditional author-collaborator-title-series-subjects (ACTS) catalogue

act to fact catalogu
 the paper show a way to satisfi user ' chang and specif inform need by provid the modifi format-author-collaborators-title-series-subject ( fact ) . catalogu instead of the tradit author-collaborator-title-series-subject ( act ) catalogu