Stabilization of positive systems with first integrals

Abstract: Positive systems possessing first integrals are considered. These systems frequently occur in applications. The paper is devoted to two stabilization problems. The first is concerned with the design of feedbacks to stabilize a given level set. Secondly, it is shown that the same feedback allows us to globally stabilize an equilibrium point if it is asymptotically stable with respect to initial conditions in its level set. Two examples are provided and the results are compared with those in the literature

stabil of posit system with first integr
 posit system possess first integr are consid . these system frequent occur in applic . the paper is devot to two stabil problem . the first is concern with the design of feedback to stabil a given level set . secondli , it is shown that the same feedback allow us to global stabil an equilibrium point if it is asymptot stabl with respect to initi condit in it level set . two exampl are provid and the result are compar with those in the literatur

positive systems
first integrals
global stabilization
equilibrium point
feedbacks design
asymptotic stability
chemical reactors


The dynamic aspect of land administration: an often-forgotten component in system design

Abstract: Although the establishment of a land administration system is enough of a challenge as it is, the task of keeping the system up to date with developments in society is even more challenging. Initial adjudication and cadastral mapping basically record land tenure as it exists at a given moment, i.e. the static situation. The paper aims to analyse the developments that might occur in a society with respect to tenure, value and use of land. These developments constitute a dynamic component of land administration. As land administration systems have to serve society on a long-term basis and normally have a long-term return on investment, the author recommends taking into account both the static and dynamic component when designing land administration systems

the dynam aspect of land administr : an often-forgotten compon in system design
 although the establish of a land administr system is enough of a challeng as it is , the task of keep the system up to date with develop in societi is even more challeng . initi adjud and cadastr map basic record land tenur as it exist at a given moment , i.e. the static situat . the paper aim to analys the develop that might occur in a societi with respect to tenur , valu and use of land . these develop constitut a dynam compon of land administr . as land administr system have to serv societi on a long-term basi and normal have a long-term return on invest , the author recommend take into account both the static and dynam compon when design land administr system

dynamic aspect
system design
land administration system
adjudication
cadastral mapping
land tenure
static situation
dynamic component
return on investment
societal developments
static component


Eliminating counterevidence with applications to accountable certificate management

Abstract: This paper presents a method to increase the accountability of certificate management by making it intractable for the certification authority (CA) to create contradictory statements about the validity of a certificate. The core of the method is a new primitive, undeniable attester, that allows someone to commit to some set S of bitstrings by publishing a short digest of S and to give attestations for any x that it is or is not a member of S. Such an attestation can be verified by obtaining in an authenticated way the published digest and applying a verification algorithm to the triple of the bitstring, the attestation and the digest. The most important feature of this primitive is the intractability of creating two contradictory proofs for the same candidate element x and digest. We give an efficient construction for undeniable attesters based on authenticated search trees. We show that the construction also applies to sets of more structured elements. We also show that undeniable attesters exist iff collision-resistant hash functions exist

elimin counterevid with applic to account certif manag
 thi paper present a method to increas the account of certif manag by make it intract for the certif author ( ca ) to creat contradictori statement about the valid of a certif . the core of the method is a new primit , undeni attest , that allow someon to commit to some set s of bitstr by publish a short digest of s and to give attest for ani x that it is or is not a member of s. such an attest can be verifi by obtain in an authent way the publish digest and appli a verif algorithm to the tripl of the bitstr , the attest and the digest . the most import featur of thi primit is the intract of creat two contradictori proof for the same candid element x and digest . we give an effici construct for undeni attest base on authent search tree . we show that the construct also appli to set of more structur element . we also show that undeni attest exist iff collision-resist hash function exist

accountable certificate management
accountability
certification authority
attestations
bitstring
published digest
verification algorithm
contradictory proofs
authenticated search trees
structured elements
collision-resistant hash functions
counterevidence elimination
undeniable attester primitive
long-term authenticity
non repudiation
public-key infrastructure
time-stamping


Even unimodular Gaussian lattices of rank 12

Abstract: We classify even unimodular Gaussian lattices of rank 12, that is, even unimodular integral lattices of rank 12 over the ring of Gaussian integers. This is equivalent to the classification of the automorphisms tau with tau /sup 2/=-1 in the automorphism groups of all the Niemeier lattices, which are even unimodular (real) integral lattices of rank 24. There are 28 even unimodular Gaussian lattices of rank 12 up to equivalence

even unimodular gaussian lattic of rank 12
 we classifi even unimodular gaussian lattic of rank 12 , that is , even unimodular integr lattic of rank 12 over the ring of gaussian integ . thi is equival to the classif of the automorph tau with tau /sup 2/=-1 in the automorph group of all the niemeier lattic , which are even unimodular ( real ) integr lattic of rank 24 . there are 28 even unimodular gaussian lattic of rank 12 up to equival

even unimodular Gaussian lattices
even unimodular integral lattices
Gaussian integers
automorphisms
Niemeier lattices


The XML typechecking problem

Abstract: When an XML document conforms to a given type (e.g. a DTD or an XML schema type) it is called a valid document. Checking if a given XML document is valid is called the validation problem, and is typically performed by a parser (hence, validating parser), more precisely it is performed right after parsing, by the same program module. In practice however, XML documents are often generated dynamically, by some program: checking whether all XML documents generated by the program are valid WRT a given type is called the typechecking problem. While a validation analyzes an XML document, a type checker analyzes a program, and the problem's difficulty is a function of the language in which that program is expressed. The XML typechecking problem has been investigated recently and the XQuery Working Group adopted some of these techniques for typechecking XQuery. All these techniques, however, have limitations which need to be understood and further explored and investigated. We define the XML typechecking problem, and present current approaches to typechecking, discussing their limitations

the xml typecheck problem
 when an xml document conform to a given type ( e.g. a dtd or an xml schema type ) it is call a valid document . check if a given xml document is valid is call the valid problem , and is typic perform by a parser ( henc , valid parser ) , more precis it is perform right after pars , by the same program modul . in practic howev , xml document are often gener dynam , by some program : check whether all xml document gener by the program are valid wrt a given type is call the typecheck problem . while a valid analyz an xml document , a type checker analyz a program , and the problem 's difficulti is a function of the languag in which that program is express . the xml typecheck problem ha been investig recent and the xqueri work group adopt some of these techniqu for typecheck xqueri . all these techniqu , howev , have limit which need to be understood and further explor and investig . we defin the xml typecheck problem , and present current approach to typecheck , discuss their limit

XML typechecking problem
XML document
validation
XQuery


Module placement with boundary constraints using B*-trees

Abstract: The module placement problem is to determine the co-ordinates of logic modules in a chip such that no two modules overlap and some cost (e.g. silicon area, interconnection length, etc.) is optimised. To shorten connections between inputs and outputs and/or make related modules adjacent, it is desired to place some modules along the specific boundaries of a chip. To deal with such boundary constraints, we explore the feasibility conditions of a B*-tree with boundary constraints and develop a simulated annealing-based algorithm using B*-trees. Unlike most previous work, the proposed algorithm guarantees a feasible B*-tree with boundary constraints for each perturbation. Experimental results show that the algorithm can obtain a smaller silicon area than the most recent work based on sequence pairs

modul placement with boundari constraint use b*-tree
 the modul placement problem is to determin the co-ordin of logic modul in a chip such that no two modul overlap and some cost ( e.g. silicon area , interconnect length , etc . ) is optimis . to shorten connect between input and output and/or make relat modul adjac , it is desir to place some modul along the specif boundari of a chip . to deal with such boundari constraint , we explor the feasibl condit of a b*-tree with boundari constraint and develop a simul annealing-bas algorithm use b*-tree . unlik most previou work , the propos algorithm guarante a feasibl b*-tree with boundari constraint for each perturb . experiment result show that the algorithm can obtain a smaller silicon area than the most recent work base on sequenc pair

boundary constraints
B*-tree
silicon area
interconnection length
logic module placement
simulated annealing algorithm


Web ad explosion

Abstract: Financed by advertising dollars from big names, online marketers are embracing more aggressive tactics

web ad explos
 financ by advertis dollar from big name , onlin market are embrac more aggress tactic


Use of periodic and monotonic activation functions in multilayer feedforward neural networks trained by extended Kalman filter algorithm

Abstract: The authors investigate the convergence and pruning performance of multilayer feedforward neural networks with different types of neuronal activation functions in solving various problems. Three types of activation functions are adopted in the network, namely, the traditional sigmoid function, the sinusoidal function and a periodic function that can be considered as a combination of the first two functions. To speed up the learning, as well as to reduce the network size, the extended Kalman filter (EKF) algorithm conjunct with a pruning method is used to train the network. The corresponding networks are applied to solve five typical problems, namely, 4-point XOR logic function, parity generation, handwritten digit recognition, piecewise linear function approximation and sunspot series prediction. Simulation results show that periodic activation functions perform better than monotonic ones in solving multicluster classification problems. Moreover, the combined periodic activation function is found to possess the fast convergence and multicluster classification capabilities of the sinusoidal activation function while keeping the robustness property of the sigmoid function required in the modelling of unknown systems

use of period and monoton activ function in multilay feedforward neural network train by extend kalman filter algorithm
 the author investig the converg and prune perform of multilay feedforward neural network with differ type of neuron activ function in solv variou problem . three type of activ function are adopt in the network , name , the tradit sigmoid function , the sinusoid function and a period function that can be consid as a combin of the first two function . to speed up the learn , as well as to reduc the network size , the extend kalman filter ( ekf ) algorithm conjunct with a prune method is use to train the network . the correspond network are appli to solv five typic problem , name , 4-point xor logic function , pariti gener , handwritten digit recognit , piecewis linear function approxim and sunspot seri predict . simul result show that period activ function perform better than monoton one in solv multiclust classif problem . moreov , the combin period activ function is found to possess the fast converg and multiclust classif capabl of the sinusoid activ function while keep the robust properti of the sigmoid function requir in the model of unknown system

monotonic activation functions
multilayer feedforward neural networks
extended Kalman filter algorithm
convergence
pruning performance
neuronal activation functions
sigmoid function
sinusoidal function
4-point XOR logic function
parity generation
handwritten digit recognition
piecewise linear function approximation
sunspot series prediction
periodic activation functions
multicluster classification problems
EKF algorithm


Generic simulation approach for multi-axis machining. Part 2: model calibration and feed rate scheduling

Abstract: For Part 1 see ibid. vol.124 (2002). This is the second part of a two-part paper presenting a new methodology for analytically simulating multi-axis machining of complex sculptured surfaces. The first section of this paper offers a detailed explanation of the model calibration procedure. A new methodology is presented for accurately determining the cutting force coefficients for multi-axis machining. The force model presented in Part 1 is reformulated so that the cutting force coefficients account for the effects of feed rate, cutting speed, and a complex cutting edge design. Experimental results are presented for the calibration procedure. Model verification tests were conducted with these cutting force coefficients. These tests demonstrate that the predicted forces are within 5% of experimentally measured forces. Simulated results are also shown for predicting dynamic cutting forces and static/dynamic tool deflection. The second section of the paper discusses how the modeling methodology can be applied for feed rate scheduling in an industrial application. A case study for process optimization of machining an airfoil-like surface is used for demonstration. Based on the predicted instantaneous chip load and/or a specified force constraint, the feed rate scheduling is utilized to increase the metal removal rate. The feed rate scheduling implementation results in a 30% reduction in machining time for the airfoil-like surface

gener simul approach for multi-axi machin . part 2 : model calibr and feed rate schedul
 for part 1 see ibid . vol.124 ( 2002 ) . thi is the second part of a two-part paper present a new methodolog for analyt simul multi-axi machin of complex sculptur surfac . the first section of thi paper offer a detail explan of the model calibr procedur . a new methodolog is present for accur determin the cut forc coeffici for multi-axi machin . the forc model present in part 1 is reformul so that the cut forc coeffici account for the effect of feed rate , cut speed , and a complex cut edg design . experiment result are present for the calibr procedur . model verif test were conduct with these cut forc coeffici . these test demonstr that the predict forc are within 5 % of experiment measur forc . simul result are also shown for predict dynam cut forc and static / dynam tool deflect . the second section of the paper discuss how the model methodolog can be appli for feed rate schedul in an industri applic . a case studi for process optim of machin an airfoil-lik surfac is use for demonstr . base on the predict instantan chip load and/or a specifi forc constraint , the feed rate schedul is util to increas the metal remov rate . the feed rate schedul implement result in a 30 % reduct in machin time for the airfoil-lik surfac

generic simulation
model calibration
feed rate scheduling
complex sculptured surfaces
cutting force coefficients
force model
cutting edge design
optimization
metal removal rate
multiple axis machining


The semantic Web: differentiating between taxonomies and ontologies

Abstract: There is a new vision of the WWW - the semantic Web - that will dramatically improve Web-based services and products. It creates a setting where software agents perform everyday jobs for end-users. Deploying hierarchies, metadata, and structured vocabularies, the semantic Web expands basic Internet functions

the semant web : differenti between taxonomi and ontolog
 there is a new vision of the www - the semant web - that will dramat improv web-bas servic and product . it creat a set where softwar agent perform everyday job for end-us . deploy hierarchi , metadata , and structur vocabulari , the semant web expand basic internet function

semantic Web
WWW
software agents
hierarchies
metadata
structured vocabularies
Internet


Toward a formalism for conversation protocols using joint intention theory

Abstract: Conversation protocols are used to achieve certain goals or to bring about certain states in the world. Therefore, one may identify the landmarks or the states that must be brought about during the goal-directed execution of a protocol. Accordingly, the landmarks, characterized by propositions that are true in the state represented by that landmark, are the most important aspect of a protocol. Families of conversation protocols can be expressed formally as partially ordered landmarks after the landmarks necessary to achieve a goal have been identified. Concrete protocols represented as joint action expressions can, then, be derived from the partially ordered landmarks and executed directly by joint intention interpreters. This approach of applying Joint Intention theory to protocols also supports flexibility in the actions used to get to landmarks, shortcutting protocol execution, automatic exception handling, and correctness criterion for protocols and protocol compositions

toward a formal for convers protocol use joint intent theori
 convers protocol are use to achiev certain goal or to bring about certain state in the world . therefor , one may identifi the landmark or the state that must be brought about dure the goal-direct execut of a protocol . accordingli , the landmark , character by proposit that are true in the state repres by that landmark , are the most import aspect of a protocol . famili of convers protocol can be express formal as partial order landmark after the landmark necessari to achiev a goal have been identifi . concret protocol repres as joint action express can , then , be deriv from the partial order landmark and execut directli by joint intent interpret . thi approach of appli joint intent theori to protocol also support flexibl in the action use to get to landmark , shortcut protocol execut , automat except handl , and correct criterion for protocol and protocol composit

conversation protocols
protocol execution
automatic exception handling
correctness criterion
multi-agent interactions
finite state machines


Minimised geometric Buchberger algorithm for integer programming

Abstract: Recently, various algebraic integer programming (IP) solvers have been proposed based on the theory of Grobner bases. The main difficulty of these solvers is the size of the Grobner bases generated. In algorithms proposed so far, large Grobner bases are generated by either introducing additional variables or by considering the generic IP problem IP/sub A,C/. Some improvements have been proposed such as Hosten and Sturmfels' method (GRIN) designed to avoid additional variables and Thomas' truncated Grobner basis method which computes the reduced Grobner basis for a specific IP problem IP/sub A,C/(b) (rather than its generalisation IPA,C). In this paper we propose a new algebraic algorithm for solving IP problems. The new algorithm, called Minimised Geometric Buchberger Algorithm, combines Hosten and Sturmfels' GRIN and Thomas' truncated Grobner basis method to compute the fundamental segments of an IP problem IP/sub A,C/ directly in its original space and also the truncated Grobner basis for a specific IP problem IP/sub A,C/ (b). We have carried out experiments to compare this algorithm with others such as the geometric Buchberger algorithm, the truncated geometric Buchberger algorithm and the algorithm in GRIN. These experiments show that the new algorithm offers significant performance improvement

minimis geometr buchberg algorithm for integ program
 recent , variou algebra integ program ( ip ) solver have been propos base on the theori of grobner base . the main difficulti of these solver is the size of the grobner base gener . in algorithm propos so far , larg grobner base are gener by either introduc addit variabl or by consid the gener ip problem ip / sub a , c/. some improv have been propos such as hosten and sturmfel ' method ( grin ) design to avoid addit variabl and thoma ' truncat grobner basi method which comput the reduc grobner basi for a specif ip problem ip / sub a , c/(b ) ( rather than it generalis ipa , c ) . in thi paper we propos a new algebra algorithm for solv ip problem . the new algorithm , call minimis geometr buchberg algorithm , combin hosten and sturmfel ' grin and thoma ' truncat grobner basi method to comput the fundament segment of an ip problem ip / sub a , c/ directli in it origin space and also the truncat grobner basi for a specif ip problem ip / sub a , c/ ( b ) . we have carri out experi to compar thi algorithm with other such as the geometr buchberg algorithm , the truncat geometr buchberg algorithm and the algorithm in grin . these experi show that the new algorithm offer signific perform improv

minimised geometric Buchberger algorithm


One structure for fractional delay filter with small number of multipliers

Abstract: A wide-bandwidth, high-resolution fractional delay filter (FDF) structure with a small number of multipliers per output sample and a short coefficient computing time is presented. The proposal is based on the use of a frequency FDF design method up to only half of the Nyquist frequency, in a multirate structure

one structur for fraction delay filter with small number of multipli
 a wide-bandwidth , high-resolut fraction delay filter ( fdf ) structur with a small number of multipli per output sampl and a short coeffici comput time is present . the propos is base on the use of a frequenc fdf design method up to onli half of the nyquist frequenc , in a multir structur

fractional delay filter
multipliers
short coefficient computing time
multirate structure
wide-bandwidth filter
high-resolution filter
finite impulse response filter
FIR filter
frequency domain design method


Max and min limiters

Abstract: If A contained in omega , n>or=2, and the function max({x/sub 1/,...,x/sub n/} intersection A) is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for "min" in place of "max") and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and co-retraceable sets, and we characterize sets which are the union of a recursive set and a co-r.e., retraceable set. Most of our proofs are noneffective. Several open questions are raised

max and min limit
 if a contain in omega , n > or=2 , and the function max({x / sub 1/, ... ,x / sub n/ } intersect a ) is partial recurs , it is easili seen that a is recurs . in thi paper , we weaken thi hypothesi in variou way ( and similarli for " min " in place of " max " ) and investig what effect thi ha on the complex of a. we discov a sharp contrast between retrac and co-retrac set , and we character set which are the union of a recurs set and a co-r. . , retrac set . most of our proof are noneffect . sever open question are rais

min limiters
complexity
retraceable sets
recursive set
max limiters


The vibration reliability of poppet and contoured actuator valves

Abstract: The problem of selecting the shape of the actuator valve (the final control valve) itself is discussed; the solution to this problem will permit appreciable dynamic loads to be eliminated from the moving elements of the steam distribution system of steam turbines under all operating conditions

the vibrat reliabl of poppet and contour actuat valv
 the problem of select the shape of the actuat valv ( the final control valv ) itself is discuss ; the solut to thi problem will permit appreci dynam load to be elimin from the move element of the steam distribut system of steam turbin under all oper condit

vibration reliability
contoured actuator valves
moving elements
steam distribution system
steam turbines
actuator valve shape selection
poppet actuator valves
dynamic loads elimination


Risk theory with a nonlinear dividend barrier

Abstract: In the framework of classical risk theory we investigate a surplus process in the presence of a nonlinear dividend barrier and derive equations for two characteristics of such a process, the probability of survival and the expected sum of discounted dividend payments. Number-theoretic solution techniques are developed for approximating these quantities and numerical illustrations are given for exponential claim sizes and a parabolic dividend barrier

risk theori with a nonlinear dividend barrier
 in the framework of classic risk theori we investig a surplu process in the presenc of a nonlinear dividend barrier and deriv equat for two characterist of such a process , the probabl of surviv and the expect sum of discount dividend payment . number-theoret solut techniqu are develop for approxim these quantiti and numer illustr are given for exponenti claim size and a parabol dividend barrier

risk theory
nonlinear dividend barrier
surplus process
probability of survival
discounted dividend payments
number-theoretic solution
numerical illustrations
exponential claim sizes
parabolic dividend barrier


Analysis of nonlinear time-delay systems using modules over non-commutative rings

Abstract: The theory of non-commutative rings is introduced to provide a basis for the study of nonlinear control systems with time delays. The left Ore ring of non-commutative polynomials defined over the field of a meromorphic function is suggested as the framework for such a study. This approach is then generalized to a broader class of nonlinear systems with delays that are called generalized Roesser systems. Finally, the theory is applied to analyze nonlinear time-delay systems. A weak observability is defined and characterized, generalizing the well-known linear result. Properties of closed submodules are then developed to obtain a result on the accessibility of such systems

analysi of nonlinear time-delay system use modul over non-commut ring
 the theori of non-commut ring is introduc to provid a basi for the studi of nonlinear control system with time delay . the left ore ring of non-commut polynomi defin over the field of a meromorph function is suggest as the framework for such a studi . thi approach is then gener to a broader class of nonlinear system with delay that are call gener roesser system . final , the theori is appli to analyz nonlinear time-delay system . a weak observ is defin and character , gener the well-known linear result . properti of close submodul are then develop to obtain a result on the access of such system

nonlinear time-delay systems
modules
nonlinear control systems
left Ore ring
meromorphic function
generalized Roesser systems
weak observability
noncommutative rings
noncommutative polynomials


To commit or not to commit: modeling agent conversations for action

Abstract: Conversations are sequences of messages exchanged among interacting agents. For conversations to be meaningful, agents ought to follow commonly known specifications limiting the types of messages that can be exchanged at any point in the conversation. These specifications are usually implemented using conversation policies (which are rules of inference) or conversation protocols (which are predefined conversation templates). In this article we present a semantic model for specifying conversations using conversation policies. This model is based on the principles that the negotiation and uptake of shared social commitments entail the adoption of obligations to action, which indicate the actions that agents have agreed to perform. In the same way, obligations are retracted based on the negotiation to discharge their corresponding shared social commitments. Based on these principles, conversations are specified as interaction specifications that model the ideal sequencing of agent participations negotiating the execution of actions in a joint activity. These specifications not only specify the adoption and discharge of shared commitments and obligations during an activity, but also indicate the commitments and obligations that are required (as preconditions) or that outlive a joint activity (as postconditions). We model the Contract Net Protocol as an example of the specification of conversations in a joint activity

to commit or not to commit : model agent convers for action
 convers are sequenc of messag exchang among interact agent . for convers to be meaning , agent ought to follow commonli known specif limit the type of messag that can be exchang at ani point in the convers . these specif are usual implement use convers polici ( which are rule of infer ) or convers protocol ( which are predefin convers templat ) . in thi articl we present a semant model for specifi convers use convers polici . thi model is base on the principl that the negoti and uptak of share social commit entail the adopt of oblig to action , which indic the action that agent have agre to perform . in the same way , oblig are retract base on the negoti to discharg their correspond share social commit . base on these principl , convers are specifi as interact specif that model the ideal sequenc of agent particip negoti the execut of action in a joint activ . these specif not onli specifi the adopt and discharg of share commit and oblig dure an activ , but also indic the commit and oblig that are requir ( as precondit ) or that outliv a joint activ ( as postcondit ) . we model the contract net protocol as an exampl of the specif of convers in a joint activ

interacting agents
specifications
rules of inference
conversation protocols
conversation templates
social commitments
autonomous agents
speech acts
software agents


Mission planning for regional surveillance

Abstract: The regional surveillance problem discussed involves formulating a flight route for an aircraft to scan a given geographical region. Aerial surveillance is conducted using a synthetic aperture radar device mounted on the aircraft to compose a complete, high-resolution image of the region. Two models for determining an optimised flight route are described, the first employing integer programming and the second, genetic algorithms. A comparison of the solution optimality in terms of the total distance travelled, and model efficiency of the two techniques in terms of their required CPU times, is made in order to identify the conditions under which it is appropriate to apply each model

mission plan for region surveil
 the region surveil problem discuss involv formul a flight rout for an aircraft to scan a given geograph region . aerial surveil is conduct use a synthet apertur radar devic mount on the aircraft to compos a complet , high-resolut imag of the region . two model for determin an optimis flight rout are describ , the first employ integ program and the second , genet algorithm . a comparison of the solut optim in term of the total distanc travel , and model effici of the two techniqu in term of their requir cpu time , is made in order to identifi the condit under which it is appropri to appli each model

mission planning
regional surveillance
flight route
aerial surveillance
synthetic aperture radar device
high-resolution image
optimised flight route
integer programming
genetic algorithms
solution optimality
total distance travelled
geographical region scanning


SPARC ignites scholarly publishing

Abstract: During the past several years, initiatives which bring together librarians, researchers, university administrators and independent publishers have re-invigorated the scholarly publishing marketplace. These initiatives take advantage of electronic technology and show great potential for restoring science to scientists. The author outlines SPARC (the Scholarly Publishing and Academic Resources Coalition), an initiative to make scientific journals more accessible

sparc ignit scholarli publish
 dure the past sever year , initi which bring togeth librarian , research , univers administr and independ publish have re-invigor the scholarli publish marketplac . these initi take advantag of electron technolog and show great potenti for restor scienc to scientist . the author outlin sparc ( the scholarli publish and academ resourc coalit ) , an initi to make scientif journal more access


Ant colony optimization and stochastic gradient descent

Abstract: We study the relationship between the two techniques known as ant colony optimization (ACO) and stochastic gradient descent. More precisely, we show that some empirical ACO algorithms approximate stochastic gradient descent in the space of pheromones, and we propose an implementation of stochastic gradient descent that belongs to the family of ACO algorithms. We then use this insight to explore the mutual contributions of the two techniques

ant coloni optim and stochast gradient descent
 we studi the relationship between the two techniqu known as ant coloni optim ( aco ) and stochast gradient descent . more precis , we show that some empir aco algorithm approxim stochast gradient descent in the space of pheromon , and we propos an implement of stochast gradient descent that belong to the famili of aco algorithm . we then use thi insight to explor the mutual contribut of the two techniqu

ant colony optimization
stochastic gradient descent
empirical ACO algorithms
pheromones
combinatorial optimization
heuristic
reinforcement learning
social insects
swarm intelligence
artificial life
local search algorithms


Technology on social issues of videoconferencing on the Internet: a survey

Abstract: Constant advances in audio/video compression, the development of the multicast protocol as well as fast improvement in computing devices (e.g. higher speed, larger memory) have set forth the opportunity to have resource demanding videoconferencing (VC) sessions on the Internet. Multicast is supported by the multicast backbone (Mbone), which is a special portion of the Internet where this protocol is being deployed. Mbone VC tools are steadily emerging and the user population is growing fast. VC is a fascinating application that has the potential to greatly impact the way we remotely communicate and work. Yet, the adoption of VC is not as fast as one could have predicted. Hence, it is important to examine the factors that affect a widespread adoption of VC. This paper examines the enabling technology and the social issues. It discusses the achievements and identifies the future challenges. It suggests an integration of many emerging multimedia tools into VC in order to enhance its versatility for more effectiveness

technolog on social issu of videoconferenc on the internet : a survey
 constant advanc in audio / video compress , the develop of the multicast protocol as well as fast improv in comput devic ( e.g. higher speed , larger memori ) have set forth the opportun to have resourc demand videoconferenc ( vc ) session on the internet . multicast is support by the multicast backbon ( mbone ) , which is a special portion of the internet where thi protocol is be deploy . mbone vc tool are steadili emerg and the user popul is grow fast . vc is a fascin applic that ha the potenti to greatli impact the way we remot commun and work . yet , the adopt of vc is not as fast as one could have predict . henc , it is import to examin the factor that affect a widespread adopt of vc . thi paper examin the enabl technolog and the social issu . it discuss the achiev and identifi the futur challeng . it suggest an integr of mani emerg multimedia tool into vc in order to enhanc it versatil for more effect

social issues
videoconferencing
Internet
multicast protocol
multicast backbone
Mbone
multimedia
data compression


International news sites in English

Abstract: Web access to news sites all over the world allows us the opportunity to have an electronic news stand readily available and stocked with a variety of foreign (to us) news sites. A large number of currently available foreign sites are English-language publications or English language versions of non-North American sites. These sites are quite varied in terms of quality, coverage, and style. Finding them can present a challenge. Using them effectively requires critical-thinking skills that are a part of media awareness or digital literacy

intern news site in english
 web access to news site all over the world allow us the opportun to have an electron news stand readili avail and stock with a varieti of foreign ( to us ) news site . a larg number of current avail foreign site are english-languag public or english languag version of non-north american site . these site are quit vari in term of qualiti , coverag , and style . find them can present a challeng . use them effect requir critical-think skill that are a part of media awar or digit literaci

international news sites
Web access
English-language publications
critical-thinking skills
media awareness
digital literacy
non North American sites


The paradigm of viral communication

Abstract: The IIW Institute of Information Management (www.IIW.de) is dealing with commercial applications of digital technologies, such as the Internet, digital printing, and many more. A study which has been carried out by the institute, identifies viral messages as a new paradigm of communication, mostly found in the area of Direct Marketing, and - who wonders - mainly within the USA. Viral messages underlie certain principles: (1) prospects and customers of the idea are offered a technology platform providing a possibility to send a message to a majority of persons; (2) there is an emotional or pecuniary incentive to participate. Ideally, niches of needs and market vacua are filled with funny ideas; (3) also, the recipients are facing emotional or pecuniary incentives to contact a majority of further recipients - this induces a snowball effect and the message is spread virally; and (4) the customer is activated as an "ambassador" of the piece of information, for instance promoting a product or a company. It is evident that there has been a long lasting history of what we call "word-of-mouth" ever since, however bundles of digital technologies empower the viral communication paradigm

the paradigm of viral commun
 the iiw institut of inform manag ( www.iiw.d ) is deal with commerci applic of digit technolog , such as the internet , digit print , and mani more . a studi which ha been carri out by the institut , identifi viral messag as a new paradigm of commun , mostli found in the area of direct market , and - who wonder - mainli within the usa . viral messag underli certain principl : ( 1 ) prospect and custom of the idea are offer a technolog platform provid a possibl to send a messag to a major of person ; ( 2 ) there is an emot or pecuniari incent to particip . ideal , nich of need and market vacua are fill with funni idea ; ( 3 ) also , the recipi are face emot or pecuniari incent to contact a major of further recipi - thi induc a snowbal effect and the messag is spread viral ; and ( 4 ) the custom is activ as an " ambassador " of the piec of inform , for instanc promot a product or a compani . it is evid that there ha been a long last histori of what we call " word-of-mouth " ever sinc , howev bundl of digit technolog empow the viral commun paradigm

commercial applications
Internet
viral messages
direct marketing
viral communication paradigm
e-mails
business
computer virus


Business data management for business-to-business electronic commerce

Abstract: Business-to-business electronic commerce (B2B EC) opens up new possibilities for trade. For example, new business partners from around the globe can be found, their offers can be compared, even complex negotiations can be conducted electronically, and a contract can be drawn up and fulfilled via an electronic marketplace. However, sophisticated data management is required to provide such facilities. In this paper, the results of a multi-national project on creating a business-to-business electronic marketplace for small and medium-sized enterprises are presented. Tools for information discovery, protocol-based negotiations, and monitored contract enactment are provided and based on a business data repository. The repository integrates heterogeneous business data with business communication. Specific problems such as multilingual nature, data ownership, and traceability of contracts and related negotiations are addressed and it is shown that the present approach provides efficient business data management for B2B EC

busi data manag for business-to-busi electron commerc
 business-to-busi electron commerc ( b2b ec ) open up new possibl for trade . for exampl , new busi partner from around the globe can be found , their offer can be compar , even complex negoti can be conduct electron , and a contract can be drawn up and fulfil via an electron marketplac . howev , sophist data manag is requir to provid such facil . in thi paper , the result of a multi-n project on creat a business-to-busi electron marketplac for small and medium-s enterpris are present . tool for inform discoveri , protocol-bas negoti , and monitor contract enact are provid and base on a busi data repositori . the repositori integr heterogen busi data with busi commun . specif problem such as multilingu natur , data ownership , and traceabl of contract and relat negoti are address and it is shown that the present approach provid effici busi data manag for b2b ec


Multi-output regression using a locally regularised orthogonal least-squares algorithm

Abstract: The paper considers data modelling using multi-output regression models. A locally regularised orthogonal least-squares (LROLS) algorithm is proposed for constructing sparse multi-output regression models that generalise well. By associating each regressor in the regression model with an individual regularisation parameter, the ability of the multi-output orthogonal least-squares (OLS) model selection to produce a parsimonious model with a good generalisation performance is greatly enhanced

multi-output regress use a local regularis orthogon least-squar algorithm
 the paper consid data model use multi-output regress model . a local regularis orthogon least-squar ( lrol ) algorithm is propos for construct spars multi-output regress model that generalis well . by associ each regressor in the regress model with an individu regularis paramet , the abil of the multi-output orthogon least-squar ( ol ) model select to produc a parsimoni model with a good generalis perform is greatli enhanc


A systematic review of the efficacy of telemedicine for making diagnostic and management decisions

Abstract: We conducted a systematic review of the literature to evaluate the efficacy of telemedicine for making diagnostic and management decisions in three classes of application: office/hospital-based, store-and-forward, and home-based telemedicine. We searched the MEDLINE, EMBASE, CINAHL and HealthSTAR databases and printed resources, and interviewed investigators in the field. We excluded studies where the service did not historically require face-to-face encounters (e.g. radiology or pathology diagnosis). A total of 58 articles met the inclusion criteria. The articles were summarized and graded for the quality and direction of the evidence. There were very few high-quality studies. The strongest evidence for the efficacy of telemedicine for diagnostic and management decisions came from the specialties of psychiatry and dermatology. There was also reasonable evidence that general medical history and physical examinations performed via telemedicine had relatively good sensitivity and specificity. Other specialties in which some evidence for efficacy existed were cardiology and certain areas of ophthalmology. Despite the widespread use of telemedicine in most major medical specialties, there is strong evidence in only a few of them that the diagnostic and management decisions provided by telemedicine are comparable to face-to-face care

a systemat review of the efficaci of telemedicin for make diagnost and manag decis
 we conduct a systemat review of the literatur to evalu the efficaci of telemedicin for make diagnost and manag decis in three class of applic : offic / hospital-bas , store-and-forward , and home-bas telemedicin . we search the medlin , embas , cinahl and healthstar databas and print resourc , and interview investig in the field . we exclud studi where the servic did not histor requir face-to-fac encount ( e.g. radiolog or patholog diagnosi ) . a total of 58 articl met the inclus criteria . the articl were summar and grade for the qualiti and direct of the evid . there were veri few high-qual studi . the strongest evid for the efficaci of telemedicin for diagnost and manag decis came from the specialti of psychiatri and dermatolog . there wa also reason evid that gener medic histori and physic examin perform via telemedicin had rel good sensit and specif . other specialti in which some evid for efficaci exist were cardiolog and certain area of ophthalmolog . despit the widespread use of telemedicin in most major medic specialti , there is strong evid in onli a few of them that the diagnost and manag decis provid by telemedicin are compar to face-to-fac care

telemedicine
MEDLINE
EMBASE
CINAHL
HealthSTAR
psychiatry
dermatology
cardiology
ophthalmology
medical diagnosis
management decision making
literature review


Regularity of some 'incomplete' Pal-type interpolation problems

Abstract: In this paper the regularity of nine Pal-type interpolation problems is proved. In the literature interpolation on the zeros of the pair W/sub n//sup ( alpha )/(z) = (z + alpha )/sup n/ + (1 + alpha z)/sup n/, v/sub n//sup ( alpha )/(z) = (z + alpha )/sup n/ - (1 + alpha z)/sup n/ with 0 < alpha < 1 has been studied. Here the nodes form a subset of these sets of zeros

regular of some ' incomplet ' pal-typ interpol problem
 in thi paper the regular of nine pal-typ interpol problem is prove . in the literatur interpol on the zero of the pair w / sub n//sup ( alpha ) /(z ) = ( z + alpha ) /sup n/ + ( 1 + alpha z)/sup n/ , v / sub n//sup ( alpha ) /(z ) = ( z + alpha ) /sup n/ - ( 1 + alpha z)/sup n/ with 0 < alpha < 1 ha been studi . here the node form a subset of these set of zero


Solution of the reconstruction problem of a source function in the coagulation-fragmentation equation

Abstract: We study the problem of reconstructing a source function in the kinetic coagulation-fragmentation equation. The study is based on optimal control methods, the solvability theory of operator equations, and the use of iteration algorithms

solut of the reconstruct problem of a sourc function in the coagulation-fragment equat
 we studi the problem of reconstruct a sourc function in the kinet coagulation-fragment equat . the studi is base on optim control method , the solvabl theori of oper equat , and the use of iter algorithm


Breaking the myths of rewards: an exploratory study of attitudes about knowledge sharing

Abstract: Many CEO and managers understand the importance of knowledge sharing among their employees and are eager to introduce the knowledge management paradigm in their organizations. However little is known about the determinants of the individual's knowledge sharing behavior. The purpose of this study is to develop an understanding of the factors affecting the individual's knowledge sharing behavior in the organizational context. The research model includes various constructs based on social exchange theory, self-efficacy, and theory of reasoned action. Research results from the field survey of 467 employees of four large, public organizations show that expected associations and contribution are the major determinants of the individual's attitude toward knowledge sharing. Expected rewards, believed by many to be the most important motivating factor for knowledge sharing, are not significantly related to the attitude toward knowledge sharing. As expected, positive attitude toward knowledge sharing is found to lead to positive intention to share knowledge and, finally, to actual knowledge sharing behaviors

break the myth of reward : an exploratori studi of attitud about knowledg share
 mani ceo and manag understand the import of knowledg share among their employe and are eager to introduc the knowledg manag paradigm in their organ . howev littl is known about the determin of the individu 's knowledg share behavior . the purpos of thi studi is to develop an understand of the factor affect the individu 's knowledg share behavior in the organiz context . the research model includ variou construct base on social exchang theori , self-efficaci , and theori of reason action . research result from the field survey of 467 employe of four larg , public organ show that expect associ and contribut are the major determin of the individu 's attitud toward knowledg share . expect reward , believ by mani to be the most import motiv factor for knowledg share , are not significantli relat to the attitud toward knowledg share . as expect , posit attitud toward knowledg share is found to lead to posit intent to share knowledg and , final , to actual knowledg share behavior

rewards
knowledge sharing
knowledge management
social exchange theory
self-efficacy
theory of reasoned action
public organizations
strategic management


Technology in distance education: a global perspective to alternative delivery mechanisms

Abstract: Technology is providing a positive impact on delivery mechanisms employed in distance education at the university level. Some institutions are incorporating distance education as a way to extend the classroom. Other institutions are investigating new delivery mechanisms, which support a revised perspective on education. These latter institutions are revising their processes for interacting with students, and taking a more "learner centered" approach to the delivery of education. This article discusses the impact of technology on the delivery mechanisms employed in distance education. A framework is proposed here, which presents a description of alternative modes of generic delivery mechanisms. It is suggested that those institutions, which adopt a delivery mechanism employing an asynchronous mode, can gain the most benefit from technology. This approach seems to represent the only truly innovative use of technology in distance education. The approach creates a student-oriented environment while maintaining high levels of interaction, both of which are factors that contribute to student satisfaction with their overall educational experience

technolog in distanc educ : a global perspect to altern deliveri mechan
 technolog is provid a posit impact on deliveri mechan employ in distanc educ at the univers level . some institut are incorpor distanc educ as a way to extend the classroom . other institut are investig new deliveri mechan , which support a revis perspect on educ . these latter institut are revis their process for interact with student , and take a more " learner center " approach to the deliveri of educ . thi articl discuss the impact of technolog on the deliveri mechan employ in distanc educ . a framework is propos here , which present a descript of altern mode of gener deliveri mechan . it is suggest that those institut , which adopt a deliveri mechan employ an asynchron mode , can gain the most benefit from technolog . thi approach seem to repres the onli truli innov use of technolog in distanc educ . the approach creat a student-ori environ while maintain high level of interact , both of which are factor that contribut to student satisfact with their overal educ experi

distance education
global perspective
asynchronous mode
student satisfaction
educational technology
university education
learner centered approach


Parallel operation of capacity-limited three-phase four-wire active power filters

Abstract: Three-phase four-wire active power filters (APFs) are presented that can be paralleled to enlarge the system capacity and reliability. The APF employs the PWM four-leg voltage-source inverter. A decoupling control approach for the leg connected to the neutral line is proposed such that the switching of all legs has no interaction. Functions of the proposed APF include compensation of reactive power, harmonic current, unbalanced power and zero-sequence current of the load. The objective is to achieve unity power factor, balanced line current and zero neutral-line current. Compensation of all components is capacity-limited, co-operating with the cascaded load current sensing scheme. Multiple APFs can be paralleled to share the load power without requiring any control interconnection. In addition to providing the theoretic bases and detailed design of the APFs, two 6 kVA APFs are implemented. The effectiveness of the proposed method is validated with experimental results

parallel oper of capacity-limit three-phas four-wir activ power filter
 three-phas four-wir activ power filter ( apf ) are present that can be parallel to enlarg the system capac and reliabl . the apf employ the pwm four-leg voltage-sourc invert . a decoupl control approach for the leg connect to the neutral line is propos such that the switch of all leg ha no interact . function of the propos apf includ compens of reactiv power , harmon current , unbalanc power and zero-sequ current of the load . the object is to achiev uniti power factor , balanc line current and zero neutral-lin current . compens of all compon is capacity-limit , co-oper with the cascad load current sens scheme . multipl apf can be parallel to share the load power without requir ani control interconnect . in addit to provid the theoret base and detail design of the apf , two 6 kva apf are implement . the effect of the propos method is valid with experiment result


The perceived utility of human and automated aids in a visual detection task

Abstract: Although increases in the use of automation have occurred across society, research has found that human operators often underutilize (disuse) and overly rely on (misuse) automated aids (Parasuraman-Riley (1997)). Nearly 275 Cameron University students participated in 1 of 3 experiments performed to examine the effects of perceived utility (Dzindolet et al. (2001)) on automation use in a visual detection task and to compare reliance on automated aids with reliance on humans. Results revealed a bias for human operators to rely on themselves. Although self-report data indicate a bias toward automated aids over human aids, performance data revealed that participants were more likely to disuse automated aids than to disuse human aids. This discrepancy was accounted for by assuming human operators have a "perfect automation" schema. Actual or potential applications of this research include the design of future automated decision aids and training procedures for operators relying on such aids

the perceiv util of human and autom aid in a visual detect task
 although increas in the use of autom have occur across societi , research ha found that human oper often underutil ( disus ) and overli reli on ( misus ) autom aid ( parasuraman-riley ( 1997 ) ) . nearli 275 cameron univers student particip in 1 of 3 experi perform to examin the effect of perceiv util ( dzindolet et al . ( 2001 ) ) on autom use in a visual detect task and to compar relianc on autom aid with relianc on human . result reveal a bia for human oper to reli on themselv . although self-report data indic a bia toward autom aid over human aid , perform data reveal that particip were more like to disus autom aid than to disus human aid . thi discrep wa account for by assum human oper have a " perfect autom " schema . actual or potenti applic of thi research includ the design of futur autom decis aid and train procedur for oper reli on such aid

automated aids
automation
visual detection task
human operators
automated decision aids
social process


Community spirit

Abstract: IT companies that contribute volunteers, resources or funding to charities and local groups not only make a real difference to their communities but also add value to their businesses. So says a new coalition of IT industry bodies formed to raise awareness of the options for community involvement, promote the business case, and publicise examples of best practice. The BCS, Intellect (formed from the merger of the Computing Services and Software Association and the Federation of the Electronics Industry) and the Worshipful Company of Information Technologists plan to run advisory seminars and provide guidelines on how companies of all sizes can transform their local communities using their specialist IT skills and resources while reaping business benefits

commun spirit
 it compani that contribut volunt , resourc or fund to chariti and local group not onli make a real differ to their commun but also add valu to their busi . so say a new coalit of it industri bodi form to rais awar of the option for commun involv , promot the busi case , and publicis exampl of best practic . the bc , intellect ( form from the merger of the comput servic and softwar associ and the feder of the electron industri ) and the worship compani of inform technologist plan to run advisori seminar and provid guidelin on how compani of all size can transform their local commun use their specialist it skill and resourc while reap busi benefit

IT companies
best practice
business benefits
volunteer staff
resource contribution
charity projects
community projects
staff development


Midlife career choices: how are they different from other career choices?

Abstract: It was 1963 when Candy Start began working in libraries. Libraries seemed to be a refuge from change, a dependable environment devoted primarily to preservation. She was mistaken. Technological changes in every decade of her experience have affected how and where she used her MLS. Far from a static refuge, libraries have proven to be spaceships loaded with precious cargo hurtling into the unknown. The historian in the author says that perhaps libraries have always been like this. This paper looks at a midlife decision point and the choice that this librarian made to move from a point of lessening productivity and interest to one of increasing challenge and contribution. It is a personal narrative of midlife experience from one librarian's point of view. Since writing this article, Candy's career has followed more changes. After selling the WINGS TM system, she has taken her experiences and vision to another library vendor, Gaylord Information Systems, where she serves as a senior product strategist

midlif career choic : how are they differ from other career choic ?
 it wa 1963 when candi start began work in librari . librari seem to be a refug from chang , a depend environ devot primarili to preserv . she wa mistaken . technolog chang in everi decad of her experi have affect how and where she use her ml . far from a static refug , librari have proven to be spaceship load with preciou cargo hurtl into the unknown . the historian in the author say that perhap librari have alway been like thi . thi paper look at a midlif decis point and the choic that thi librarian made to move from a point of lessen product and interest to one of increas challeng and contribut . it is a person narr of midlif experi from one librarian 's point of view . sinc write thi articl , candi 's career ha follow more chang . after sell the wing tm system , she ha taken her experi and vision to anoth librari vendor , gaylord inform system , where she serv as a senior product strategist

midlife career choices
libraries
technological changes
productivity


Structural interpretation of matched pole-zero discretisation

Abstract: Deals with matched pole-zero discretisation, which has been used in practice for hand calculations in the digital redesign of continuous-time systems but available only in the transfer-function form. Since this form is inconvenient for characterising the time-domain properties of sampled-data loops and for computerising the design of such systems, a state-space formulation is developed. Under the new interpretation, the matched pole-zero model is shown to be structurally identical to a hold-equivalent discrete-time model, where the generalised hold takes integral part, thus unifying the most widely used discretisation approaches. An algorithm for obtaining the generalised hold function is presented. The hold-equivalent structure of the matched pole-zero model clarifies several discrete-time system properties, such as controllability and observability, and their preservation or loss with a matched pole-zero discretisation. With the proposed formulation, the matched pole-zero, hold-equivalent, and mapping models can now all be constructed with a single schematic model

structur interpret of match pole-zero discretis
 deal with match pole-zero discretis , which ha been use in practic for hand calcul in the digit redesign of continuous-tim system but avail onli in the transfer-funct form . sinc thi form is inconveni for characteris the time-domain properti of sampled-data loop and for computeris the design of such system , a state-spac formul is develop . under the new interpret , the match pole-zero model is shown to be structur ident to a hold-equival discrete-tim model , where the generalis hold take integr part , thu unifi the most wide use discretis approach . an algorithm for obtain the generalis hold function is present . the hold-equival structur of the match pole-zero model clarifi sever discrete-tim system properti , such as control and observ , and their preserv or loss with a match pole-zero discretis . with the propos formul , the match pole-zero , hold-equival , and map model can now all be construct with a singl schemat model

structural interpretation
matched pole-zero discretisation
continuous-time systems
time-domain properties
sampled-data loops
state-space formulation
hold-equivalent discrete-time model
controllability
observability
closed-loop system
digital simulations


The diameter of a long-range percolation graph

Abstract: We consider the following long-range percolation model: an undirected graph with the node set {0, 1, . . . , N}/sup d/, has edges (x, y) selected with probability approximately= beta /||x - y||/sup s/ if ||x - y|| > 1, and with probability 1 if ||x - y|| = 1, for some parameters beta , s > 0. This model was introduced by who obtained bounds on the diameter of this graph for the one-dimensional case d = 1 and for various values of s, but left cases s = 1, 2 open. We show that, with high probability, the diameter of this graph is Theta (log N/log log N) when s = d, and, for some constants 0 < eta /sub 1/ < eta /sub 2/ < 1, it is at most N/sup eta 2/ when s = 2d, and is at least N/sup eta 1/ when d = 1, s = 2, beta < 1 or when s > 2d. We also provide a simple proof that the diameter is at most log/sup O(1)/ N with high probability, when d < s < 2d, established previously in Benjamini and Berger (2001)

the diamet of a long-rang percol graph
 we consid the follow long-rang percol model : an undirect graph with the node set { 0 , 1 , . . . , n}/sup d/ , ha edg ( x , y ) select with probabl approximately= beta /||x - y||/sup s/ if ||x - y|| > 1 , and with probabl 1 if ||x - y|| = 1 , for some paramet beta , s > 0 . thi model wa introduc by who obtain bound on the diamet of thi graph for the one-dimension case d = 1 and for variou valu of s , but left case s = 1 , 2 open . we show that , with high probabl , the diamet of thi graph is theta ( log n / log log n ) when s = d , and , for some constant 0 < eta /sub 1/ < eta /sub 2/ < 1 , it is at most n / sup eta 2/ when s = 2d , and is at least n / sup eta 1/ when d = 1 , s = 2 , beta < 1 or when s > 2d . we also provid a simpl proof that the diamet is at most log / sup o(1)/ n with high probabl , when d < s < 2d , establish previous in benjamini and berger ( 2001 )

percolation
long-range percolation model
undirected graph
probability
positive probability
networks
random graph


Component support in PLT scheme

Abstract: PLT Scheme (DrScheme and MzScheme) supports the Component Object Model (COM) standard with two pieces of software. The first piece is MzCOM, a COM class that makes a Scheme evaluator available to COM clients. With MzCOM, programmers can embed Scheme code in programs written in mainstream languages such as C++ or Visual BASIC. Some applications can also be used as MzCOM clients. The other piece of component-support software is MysterX, which makes COM classes available to PLT Scheme programs. When needed, MysterX uses a programmable Web browser to display COM objects. We describe the technical issues encountered in building these two systems and sketch some applications

compon support in plt scheme
 plt scheme ( drscheme and mzscheme ) support the compon object model ( com ) standard with two piec of softwar . the first piec is mzcom , a com class that make a scheme evalu avail to com client . with mzcom , programm can emb scheme code in program written in mainstream languag such as c++ or visual basic . some applic can also be use as mzcom client . the other piec of component-support softwar is mysterx , which make com class avail to plt scheme program . when need , mysterx use a programm web browser to display com object . we describ the technic issu encount in build these two system and sketch some applic

PLT Scheme
Component Object Model
MzCOM
Web browser
reuse


Wavelet collocation methods for a first kind boundary integral equation in acoustic scattering

Abstract: In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively

wavelet colloc method for a first kind boundari integr equat in acoust scatter
 in thi paper we consid a wavelet algorithm for the piecewis constant colloc method appli to the boundari element solut of a first kind integr equat aris in acoust scatter . the convent stiff matrix is transform into the correspond matrix with respect to wavelet base , and it is approxim by a compress matrix . final , the stiff matrix is multipli by diagon precondition such that the result matrix of the system of linear equat is well condit and spars . use thi matrix , the boundari integr equat can be solv effect

boundary integral equation
acoustic scattering
wavelet algorithm
piecewise constant collocation
boundary element solution
stiffness matrix
linear equations
first kind integral operators
wavelet transform
computational complexity


Exact frequency-domain reconstruction for thermoacoustic tomography. II. Cylindrical geometry

Abstract: For pt. I see ibid., vol. 21, no. 7, p. 823-8 (2002). Microwave-induced thermoacoustic tomography (TAT) in a cylindrical configuration is developed to image biological tissue. Thermoacoustic signals are acquired by scanning a flat ultrasonic transducer. Using a new expansion of a spherical wave in cylindrical coordinates, we apply the Fourier and Hankel transforms to TAT and obtain an exact frequency-domain reconstruction method. The effect of discrete spatial sampling on image quality is analyzed. An aliasing-proof reconstruction method is proposed. Numerical and experimental results are included

exact frequency-domain reconstruct for thermoacoust tomographi . ii . cylindr geometri
 for pt . i see ibid . , vol . 21 , no . 7 , p. 823 - 8 ( 2002 ) . microwave-induc thermoacoust tomographi ( tat ) in a cylindr configur is develop to imag biolog tissu . thermoacoust signal are acquir by scan a flat ultrason transduc . use a new expans of a spheric wave in cylindr coordin , we appli the fourier and hankel transform to tat and obtain an exact frequency-domain reconstruct method . the effect of discret spatial sampl on imag qualiti is analyz . an aliasing-proof reconstruct method is propos . numer and experiment result are includ

frequency-domain reconstruction
thermoacoustic tomography
cylindrical geometry
flat ultrasonic transducer
Hankel transform
aliasing-proof reconstruction method
medical diagnostic imaging
discrete spatial sampling effect
ultrasound imaging
spherical wave expansion


An eight-year study of Internet-based remote medical counselling

Abstract: We carried out a prospective study of an Internet-based remote counselling service. A total of 15,456 Internet users visited the Web site over eight years. From these, 1500 users were randomly selected for analysis. Medical counselling had been granted to 901 of the people requesting it (60%). One hundred and sixty-four physicians formed project groups to process the requests and responded using email. The distribution of patients using the service was similar to the availability of the Internet: 78% were from the European Union, North America and Australia. Sixty-seven per cent of the patients lived in urban areas and the remainder were residents of remote rural areas with limited local medical coverage. Sixty-five per cent of the requests were about problems of internal medicine and 30% of the requests concerned surgical issues. The remaining 5% of the patients sought information about recent developments, such as molecular medicine or aviation medicine. During the project, our portal became inaccessible five times, and counselling was not possible on 44 days. There was no hacking of the Web site. Internet-based medical counselling is a helpful addition to conventional practice

an eight-year studi of internet-bas remot medic counsel
 we carri out a prospect studi of an internet-bas remot counsel servic . a total of 15,456 internet user visit the web site over eight year . from these , 1500 user were randomli select for analysi . medic counsel had been grant to 901 of the peopl request it ( 60 % ) . one hundr and sixty-four physician form project group to process the request and respond use email . the distribut of patient use the servic wa similar to the avail of the internet : 78 % were from the european union , north america and australia . sixty-seven per cent of the patient live in urban area and the remaind were resid of remot rural area with limit local medic coverag . sixty-f per cent of the request were about problem of intern medicin and 30 % of the request concern surgic issu . the remain 5 % of the patient sought inform about recent develop , such as molecular medicin or aviat medicin . dure the project , our portal becam inaccess five time , and counsel wa not possibl on 44 day . there wa no hack of the web site . internet-bas medic counsel is a help addit to convent practic


Meeting of minds

Abstract: Technical specialists need to think about their role in IT projects and how they communicate with end-users and other participants to ensure they contribute fully as team members. It is especially important to communicate and document trade-offs that may have to be made, including the rationale behind them, so that if requirements change, the impact and decisions can be readily communicated to the stakeholders

meet of mind
 technic specialist need to think about their role in it project and how they commun with end-us and other particip to ensur they contribut fulli as team member . it is especi import to commun and document trade-off that may have to be made , includ the rational behind them , so that if requir chang , the impact and decis can be readili commun to the stakehold

technical specialists
IT projects
communication
end-users


Are we there yet?: facing the never-ending speed and change of technology in midlife

Abstract: This essay is a personal reflection on entering librarianship in middle age at a time when the profession, like society in general, is experiencing rapidly accelerating change. Much of this change is due to the increased use of computers and information technologies in the library setting. These aids in the production, collection, storage, retrieval, and dissemination of the collective information, knowledge, and sometimes wisdom of the past and the contemporary world can exhilarate or burden depending on one's worldview, the organization, and the flexibility of the workplace. This writer finds herself working in a library where everyone is expected continually to explore and use new ways of working and providing library service to a campus and a wider community. No time is spent in reflecting on what was, but all efforts are to anticipate and prepare for what will be

are we there yet ? : face the never-end speed and chang of technolog in midlif
 thi essay is a person reflect on enter librarianship in middl age at a time when the profess , like societi in gener , is experienc rapidli acceler chang . much of thi chang is due to the increas use of comput and inform technolog in the librari set . these aid in the product , collect , storag , retriev , and dissemin of the collect inform , knowledg , and sometim wisdom of the past and the contemporari world can exhilar or burden depend on one 's worldview , the organ , and the flexibl of the workplac . thi writer find herself work in a librari where everyon is expect continu to explor and use new way of work and provid librari servic to a campu and a wider commun . no time is spent in reflect on what wa , but all effort are to anticip and prepar for what will be

librarianship
middle age
computers
information technologies
collection
storage
retrieval
dissemination
changing technology


Resolving Web user on the fly

Abstract: Identity authentication systems and procedures are rapidly becoming central issues in the practice and study of information systems development and security. Requirements for Web transaction security (WTS) include strong authentication of a user, non-repudiation and encryption of all traffic. In this paper, we present an effective mechanism involving two different channels, which addresses the prime concerns involved in the security of electronic commerce transactions (ECT) viz. user authentication and non-repudiation. Although the product is primarily targeted to provide a fillip to transactions carried out over the Web, this product can also be effectively used for non-Internet transactions that are carried out where user authentication is required

resolv web user on the fli
 ident authent system and procedur are rapidli becom central issu in the practic and studi of inform system develop and secur . requir for web transact secur ( wt ) includ strong authent of a user , non-repudi and encrypt of all traffic . in thi paper , we present an effect mechan involv two differ channel , which address the prime concern involv in the secur of electron commerc transact ( ect ) viz . user authent and non-repudi . although the product is primarili target to provid a fillip to transact carri out over the web , thi product can also be effect use for non-internet transact that are carri out where user authent is requir

identity authentication systems
information systems development
Web transaction security
encryption
traffic
electronic commerce transactions
information systems security
nonrepudiation


Contrast sensitivity in a dynamic environment: effects of target conditions and visual impairment

Abstract: Contrast sensitivity was determined as a function of target velocity (0 degrees -120 degrees /s) over a variety of viewing conditions. In Experiment 1, measurements of dynamic contrast sensitivity were determined for observers as a function of target velocity for letter stimuli. Significant main effects were found for target velocity, target size, and target duration, but significant interactions among the variables indicated especially pronounced adverse effects of increasing target velocity for small targets and brief durations. In Experiment 2, the effects of simulated cataracts were determined. Although the simulated impairment had no effect on traditional acuity scores, dynamic contrast sensitivity was markedly reduced. Results are discussed in terms of dynamic contrast sensitivity as a useful composite measure of visual functioning that may provide a better overall picture of an individual's visual functioning than does traditional static acuity, dynamic acuity, or contrast sensitivity alone. The measure of dynamic contrast sensitivity may increase understanding of the practical effects of various conditions, such as aging or disease, on the visual system, or it may allow improved prediction of individuals' performance in visually dynamic situations

contrast sensit in a dynam environ : effect of target condit and visual impair
 contrast sensit wa determin as a function of target veloc ( 0 degre -120 degre /s ) over a varieti of view condit . in experi 1 , measur of dynam contrast sensit were determin for observ as a function of target veloc for letter stimuli . signific main effect were found for target veloc , target size , and target durat , but signific interact among the variabl indic especi pronounc advers effect of increas target veloc for small target and brief durat . in experi 2 , the effect of simul cataract were determin . although the simul impair had no effect on tradit acuiti score , dynam contrast sensit wa markedli reduc . result are discuss in term of dynam contrast sensit as a use composit measur of visual function that may provid a better overal pictur of an individu 's visual function than doe tradit static acuiti , dynam acuiti , or contrast sensit alon . the measur of dynam contrast sensit may increas understand of the practic effect of variou condit , such as age or diseas , on the visual system , or it may allow improv predict of individu ' perform in visual dynam situat

contrast sensitivity
dynamic environment
target conditions
visual impairment
target velocity
dynamic contrast sensitivity
target size
target duration
acuity scores
aging
disease


Medical image computing at the Institute of Mathematics and Computer Science in Medicine, University Hospital Hamburg-Eppendorf

Abstract: The author reviews the history of medical image computing at his institute, summarizes the achievements, sketches some of the difficulties encountered, and draws conclusions that might be of interest especially to people new to the field. The origin and history section provides a chronology of this work, emphasizing the milestones reached during the past three decades. In accordance with the author's group's focus on imaging, the paper is accompanied by many pictures, some of which, he thinks, are of historical value

medic imag comput at the institut of mathemat and comput scienc in medicin , univers hospit hamburg-eppendorf
 the author review the histori of medic imag comput at hi institut , summar the achiev , sketch some of the difficulti encount , and draw conclus that might be of interest especi to peopl new to the field . the origin and histori section provid a chronolog of thi work , emphas the mileston reach dure the past three decad . in accord with the author 's group 's focu on imag , the paper is accompani by mani pictur , some of which , he think , are of histor valu


An interactive self-replicator implemented in hardware

Abstract: Self-replicating loops presented to date are essentially worlds unto themselves, inaccessible to the observer once the replication process is launched. We present the design of an interactive self-replicating loop of arbitrary size, wherein the user can physically control the loop's replication and induce its destruction. After introducing the BioWall, a reconfigurable electronic wall for bio-inspired applications, we describe the design of our novel loop and delineate its hardware implementation in the wall

an interact self-repl implement in hardwar
 self-repl loop present to date are essenti world unto themselv , inaccess to the observ onc the replic process is launch . we present the design of an interact self-repl loop of arbitrari size , wherein the user can physic control the loop 's replic and induc it destruct . after introduc the biowal , a reconfigur electron wall for bio-inspir applic , we describ the design of our novel loop and delin it hardwar implement in the wall

interactive self-replicator
self-replication
interactive self-replicating loop
BioWall
reconfigurable electronic wall
bio-inspired applications
hardware implementation
field programmable gate array
cellular automata
reconfigurable computing
artificial life


Document-based workflow modeling: a case-based reasoning approach

Abstract: A workflow model is useful for business process analysis. A well-built workflow can help a company streamline its internal processes by reducing overhead. The results of workflow modeling need to be managed as information assets in a systematic fashion. Reusing these results is likely to enhance the quality of the modeling. Therefore, this paper proposes a document-based workflow modeling mechanism, which employs a case-based reasoning (CBR) technique for the effective reuse of design outputs. A repository is proposed to support this CBR process. A real-life case is illustrated to demonstrate the usefulness of our approach

document-bas workflow model : a case-bas reason approach
 a workflow model is use for busi process analysi . a well-built workflow can help a compani streamlin it intern process by reduc overhead . the result of workflow model need to be manag as inform asset in a systemat fashion . reus these result is like to enhanc the qualiti of the model . therefor , thi paper propos a document-bas workflow model mechan , which employ a case-bas reason ( cbr ) techniqu for the effect reus of design output . a repositori is propos to support thi cbr process . a real-lif case is illustr to demonstr the use of our approach

document-based workflow modeling
case-based reasoning
business process analysis
company
information assets
design output reuse


On the expected value of the minimum assignment

Abstract: The minimum k-assignment of an m*n matrix X is the minimum sum of k entries of X, no two of which belong to the same row or column. Coppersmith and Sorkin conjectured that if X is generated by choosing each entry independently from the exponential distribution with mean 1, then the expected value of its minimum k-assignment is given by an explicit formula, which has been proven only in a few cases. In this paper we describe our efforts to prove the Coppersmith-Sorkin conjecture by considering the more general situation where the entries x/sub ij/ of X are chosen independently from different distributions. In particular, we require that x/sub ij/ be chosen from the exponential distribution with mean 1/r/sub i/c/sub j/. We conjecture an explicit formula for the expected value of the minimum k-assignment of such X and give evidence for this formula

on the expect valu of the minimum assign
 the minimum k-assign of an m*n matrix x is the minimum sum of k entri of x , no two of which belong to the same row or column . coppersmith and sorkin conjectur that if x is gener by choos each entri independ from the exponenti distribut with mean 1 , then the expect valu of it minimum k-assign is given by an explicit formula , which ha been proven onli in a few case . in thi paper we describ our effort to prove the coppersmith-sorkin conjectur by consid the more gener situat where the entri x / sub ij/ of x are chosen independ from differ distribut . in particular , we requir that x / sub ij/ be chosen from the exponenti distribut with mean 1 / r / sub i / c / sub j/. we conjectur an explicit formula for the expect valu of the minimum k-assign of such x and give evid for thi formula

minimum k-assignment
exponential distribution
m * n matrix
rational function
bipartite graph


Integrated process control using an in situ sensor for etch

Abstract: The migration to tighter geometries and more complex process sequence integration schemes requires having the ability to compensate for upstream deviations from target specifications. Doing so ensures that-downstream process sequences operate on work-in-progress that is well within control. Because point-of-use visibility of work-in-progress quality has become of paramount concern in the industry's drive to reduce scrap and improve yield, controlling trench depth has assumed greater importance. An integrated, interferometric based, rate monitor for etch-to-depth and spacer etch applications has been developed for controlling this parameter. This article demonstrates that the integrated rate monitor, using polarization and digital signal processing, enhances control etch-to-depth processes and can also be implemented as a predictive endpoint in a wafer manufacturing environment for dual damascene trench etch and spacer etch applications

integr process control use an in situ sensor for etch
 the migrat to tighter geometri and more complex process sequenc integr scheme requir have the abil to compens for upstream deviat from target specif . do so ensur that-downstream process sequenc oper on work-in-progress that is well within control . becaus point-of-us visibl of work-in-progress qualiti ha becom of paramount concern in the industri 's drive to reduc scrap and improv yield , control trench depth ha assum greater import . an integr , interferometr base , rate monitor for etch-to-depth and spacer etch applic ha been develop for control thi paramet . thi articl demonstr that the integr rate monitor , use polar and digit signal process , enhanc control etch-to-depth process and can also be implement as a predict endpoint in a wafer manufactur environ for dual damascen trench etch and spacer etch applic


Training multilayer perceptrons via minimization of sum of ridge functions

Abstract: Motivated by the problem of training multilayer perceptrons in neural networks, we consider the problem of minimizing E(x)= Sigma /sub i=1//sup n/ f/sub i/( xi /sub i/.x), where xi /sub i/ in R/sup S/, 1<or=i<or=n, and each f/sub i/( xi /sub i/.x) is a ridge function. We show that when n is small the problem of minimizing E can be treated as one of minimizing univariate functions, and we use the gradient algorithms for minimizing E when n is moderately large. For a large n, we present the online gradient algorithms and especially show the monotonicity and weak convergence of the algorithms

train multilay perceptron via minim of sum of ridg function
 motiv by the problem of train multilay perceptron in neural network , we consid the problem of minim e(x)= sigma /sub i=1//sup n/ f / sub i/ ( xi /sub i/.x ) , where xi /sub i/ in r / sup s/ , 1 < or = i < or = n , and each f / sub i/ ( xi /sub i/.x ) is a ridg function . we show that when n is small the problem of minim e can be treat as one of minim univari function , and we use the gradient algorithm for minim e when n is moder larg . for a larg n , we present the onlin gradient algorithm and especi show the monoton and weak converg of the algorithm

multilayer perceptrons
minimization
ridge functions
neural networks
univariate functions
gradient algorithms
online gradient algorithms
monotonicity
weak convergence


Elastic constraint branching, the Wedelin/Carmen Lagrangian heuristic and integer programming for personnel scheduling

Abstract: The Wedelin algorithm is a Lagrangian based heuristic that is being successfully used by Carmen Systems to solve large crew pairing problems within the airline industry. We extend the Wedelin approach by developing an implementation for personnel scheduling problems (also termed staff rostering problems) that exploits the special structure of these problems. We also introduce elastic constraint branching with the twin aims of improving the performance of our new approach and making it more column generation friendly. Numerical results show that our approach can outperform the commercial solver CPLEX on difficult commercial rostering problems

elast constraint branch , the wedelin / carmen lagrangian heurist and integ program for personnel schedul
 the wedelin algorithm is a lagrangian base heurist that is be success use by carmen system to solv larg crew pair problem within the airlin industri . we extend the wedelin approach by develop an implement for personnel schedul problem ( also term staff roster problem ) that exploit the special structur of these problem . we also introduc elast constraint branch with the twin aim of improv the perform of our new approach and make it more column gener friendli . numer result show that our approach can outperform the commerci solver cplex on difficult commerci roster problem

elastic constraint branching
integer programming
personnel scheduling
Wedelin algorithm
Lagrangian based heuristic
Carmen Systems
large crew pairing problems
airline industry
staff rostering problems
column generation friendly approach


An empirical investigation of the influences of the degree of interactivity on user-outcomes in a multimedia environment

Abstract: The study reported here investigates the influence of "interactivity" on the learning outcomes of users in a multimedia systems environment. Drawing from past literature base and based on key tenets of three learning theories - behaviorist, cognitivist, and constructivist - the study first proposes a measurement scheme for "interactivity" and then hypothesizes that "interactivity" would influence the learning outcomes positively in terms of users' learning achievement and attitude. Three prototypes of a multimedia instructional/training system to represent high, low, and noninteractive modes of use were developed and implemented and the hypothesized influences were investigated using a controlled laboratory research design. Multiple analysis of variance (MANOVA) results indicate that while interactivity does not necessarily enable enhanced gain in user learning, it positively influences participants' attitude. The study finds no support for hypothesized moderating effects of learning styles (measured using Kolb's Learning Style Inventory scale) on the relationship between interactivity and user outcomes. The results of this study have important implications for both education and corporations' training efforts and investments. Implications and future research directions are discussed

an empir investig of the influenc of the degre of interact on user-outcom in a multimedia environ
 the studi report here investig the influenc of " interact " on the learn outcom of user in a multimedia system environ . draw from past literatur base and base on key tenet of three learn theori - behaviorist , cognitivist , and constructivist - the studi first propos a measur scheme for " interact " and then hypothes that " interact " would influenc the learn outcom posit in term of user ' learn achiev and attitud . three prototyp of a multimedia instruct / train system to repres high , low , and noninteract mode of use were develop and implement and the hypothes influenc were investig use a control laboratori research design . multipl analysi of varianc ( manova ) result indic that while interact doe not necessarili enabl enhanc gain in user learn , it posit influenc particip ' attitud . the studi find no support for hypothes moder effect of learn style ( measur use kolb 's learn style inventori scale ) on the relationship between interact and user outcom . the result of thi studi have import implic for both educ and corpor ' train effort and invest . implic and futur research direct are discuss

interactivity
learning outcomes
multimedia systems environment
measurement scheme
training system
multiple analysis of variance
MANOVA
user outcomes
education
corporations
behaviorist learning theories
cognitivist learning theories
constructivist learning theories
user attitude
Kolb Learning Style Inventory scale


Dynamic multi-objective heating optimization

Abstract: We develop a multicriteria approach to the problem of space heating under a time varying price of electricity. In our dynamic goal programming model the goals are ideal temperature intervals and the other criteria are the costs and energy consumption. We discuss the modelling requirements in multicriteria problems with a dynamic structure and present a new relaxation method combining the traditional epsilon -constraint and goal programming (GP) methods. The multi-objective heating optimization (MOHO) application in a spreadsheet environment with numerical examples is described

dynam multi-object heat optim
 we develop a multicriteria approach to the problem of space heat under a time vari price of electr . in our dynam goal program model the goal are ideal temperatur interv and the other criteria are the cost and energi consumpt . we discuss the model requir in multicriteria problem with a dynam structur and present a new relax method combin the tradit epsilon -constraint and goal program ( gp ) method . the multi-object heat optim ( moho ) applic in a spreadsheet environ with numer exampl is describ

dynamic multi-objective heating optimization


Dual nature of mass multi-agent systems

Abstract: Dual nature of mass multi-agent systems (mMAS) emerging as an internal discord of two spheres - micro (virtual) consisting of agents and their internal phenomena, and macro arising at the interface to the real world $stems the necessity of a new approach to analysis, design and utilisation of such systems. Based on the concept of VR decomposition, the problem of management of such systems is discussed. As a sub-type that makes mMAS closer to the application sphere, an evolutionary multi-agent system (EMAS) is proposed. EMAS combines features of mMAS with advantages of an evolutionary model of computation. As an illustration of this consideration two particular EMAS are presented, which allow us to obtain promising results in the fields of multiobjective optimisation and time-series prediction, and thus justify the approach

dual natur of mass multi-ag system
 dual natur of mass multi-ag system ( mma ) emerg as an intern discord of two sphere - micro ( virtual ) consist of agent and their intern phenomena , and macro aris at the interfac to the real world $ stem the necess of a new approach to analysi , design and utilis of such system . base on the concept of vr decomposit , the problem of manag of such system is discuss . as a sub-typ that make mma closer to the applic sphere , an evolutionari multi-ag system ( ema ) is propos . ema combin featur of mma with advantag of an evolutionari model of comput . as an illustr of thi consider two particular ema are present , which allow us to obtain promis result in the field of multiobject optimis and time-seri predict , and thu justifi the approach

VR decomposition
multiobjective optimisation
time-series prediction
mass multiple agent systems
virtual reality
micro-macro link
formal model
evolutionary multiple agent system


Differential calculus for p-norms of complex-valued vector functions with applications

Abstract: For complex-valued n-dimensional vector functions t to s(t), supposed to be sufficiently smooth, the differentiability properties of the mapping t to ||s(t)||/sub p/ at every point t = t/sub 0/ epsilon R/sub 0//sup +/:= {t epsilon R | t >or= 0} are investigated, where || . ||/sub p/ is the usual vector norm in C/sup n/ resp. R/sup n/, for p epsilon [1, o infinity ]. Moreover, formulae for the first three right derivatives D/sub +//sup k/||s(t)||/sub p/, k = 1, 2,3 are determined. These formulae are applied to vibration problems by computing the best upper bounds on ||s(t)||/sub p/ in certain classes of bounds. These results cannot be obtained by the methods used so far. The systematic use of the differential calculus for vector norms, as done here for the first time, could lead to major advances also in other branches of mathematics and other sciences

differenti calculu for p-norm of complex-valu vector function with applic
 for complex-valu n-dimension vector function t to s(t ) , suppos to be suffici smooth , the differenti properti of the map t to ||s(t)||/sub p/ at everi point t = t / sub 0/ epsilon r / sub 0//sup + /:= { t epsilon r | t > or= 0 } are investig , where || . ||/sub p/ is the usual vector norm in c / sup n/ resp . r / sup n/ , for p epsilon [ 1 , o infin ] . moreov , formula for the first three right deriv d / sub + //sup k/||s(t)||/sub p/ , k = 1 , 2,3 are determin . these formula are appli to vibrat problem by comput the best upper bound on ||s(t)||/sub p/ in certain class of bound . these result can not be obtain by the method use so far . the systemat use of the differenti calculu for vector norm , as done here for the first time , could lead to major advanc also in other branch of mathemat and other scienc

differential calculus
vector functions
mapping
vector norms
vibration problems


Efficient algorithms for stiff elliptic problems with large parameters

Abstract: We consider a finite element approximation and iteration algorithms for solving stiff elliptic boundary value problems with large parameters in front of a higher derivative. The convergence rate of the algorithms is independent of the spread in coefficients and a discretization parameter

effici algorithm for stiff ellipt problem with larg paramet
 we consid a finit element approxim and iter algorithm for solv stiff ellipt boundari valu problem with larg paramet in front of a higher deriv . the converg rate of the algorithm is independ of the spread in coeffici and a discret paramet

efficient algorithms
large parameters
finite element approximation
iteration algorithms
stiff elliptic boundary value problems
higher derivative
convergence rate