Approximate relaxed descent method for optimal control problems We consider an optimal control problem for systems governed by ordinary differential equations with control constraints . Since no convexity assumptions are made on the data , the problem is reformulated in relaxed form . The relaxed state equation is discretized by the implicit trapezoidal scheme and the relaxed controls are approximated by piecewise constant relaxed controls . We then propose a combined descent and discretization method that generates sequences of discrete relaxed controls and progressively refines the discretization . Since here the adjoint of the discrete state equation is not defined , we use , at each iteration , an approximate derivative of the cost functional defined by discretizing the continuous adjoint equation and the integral involved by appropriate trapezoidal schemes . It is proved that accumulation points of sequences constructed by this method satisfy the strong relaxed necessary conditions for optimality for the continuous problem . Finally , the computed relaxed controls can be easily approximated by piecewise constant classical controls

B I I I O B I I O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

approximate relaxed descent method
optimal control problems
ordinary differential equations
implicit trapezoidal scheme
piecewise constant relaxed controls
discrete state equation
trapezoidal schemes

relaxed state equation discretization
relaxed control approximation
discrete relaxed control sequences
discretization refinement
cost functional approximate derivative


Theta functions with harmonic coefficients over number fields We investigate theta functions attached to quadratic forms over a number field K . We establish a functional equation by regarding the theta functions as specializations of symplectic theta functions . By applying a differential operator to the functional equation , we show how theta functions with harmonic coefficients over K behave under modular transformations

O O O B I O B I O O O O O O B I O O O O O O O O O B I O O O O O O O O B I I O O O O B I O O B I O O O O O O O B I O O O O B I

harmonic coefficients
differential operator
modular transformations
number fields
quadratic forms
functional equation
symplectic theta functions


Midlife career choices : how are they different from other career choices ? 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

B I I O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

midlife career choices
libraries
technological changes
productivity


Nurture the geek in you -LSB- accounting on the Internet -RSB- When chartered accountants focus on IT , it 's not simply because we think technology is neat . We keep on top of tech trends and issues because it helps us do our jobs well . We need to know how to best manage and implement the wealth of technology systems within out client base or employer , as well as to determine on an ongoing basis how evolving technologies might affect business strategies , threats and opportunities . One way to stay current with technology is by monitoring the online drumbeat . Imagine the Internet as an endless conversation of millions of chattering voices , each focusing on a multitude of topics and issues . It 's not surprising that a great deal of the information relates to technology itself , and if you learn how to tune in to the drumbeat , you can keep yourself informed

O O O O O O O O O B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information technology
slashdot
techdirt
the register
dan gillmor's wournal
daypop top 40
risks
securityfocus
techweb


Isogenous of the elliptic curves over the rationals An elliptic curve is a pair -LRB- E , O -RRB- , where E is a smooth projective curve of genus 1 and O is a point of E , called the point at infinity . Every elliptic curve can be given by a Weierstrass equation E : y/sup 2 / + a/sub 1/xy + a/sub 3/y = x/sup 3 / + a/sub 2/x/sup 2 / + a/sub 4/x + a/sub 6 / . Let Q be the set of rationals . E is said to be defined over Q if the coefficients a/sub i / , i = 1 , 2 , 3 , 4 , 6 are rationals and O is defined over Q. Let E/Q be an elliptic curve and let E -LRB- Q -RRB- / sub tors / be the torsion group of points of E defined over Q . The theorem of Mazur asserts that E -LRB- Q -RRB- / sub tors / is one of the following 15 groups E -LRB- Q -RRB- / sub tors / -LCB- Z/mZ , Z/mZ * Z/2mZ , m , = 1 , 2 , ... , 10 , 12 , m = 1 , 2 , 3 , 4 . We say that an elliptic curve E ' / Q is isogenous to the elliptic curve E if there is an isogeny , i.e. a morphism phi : E to E ' such that phi -LRB- O -RRB- = O , where O is the point at infinity . We give an explicit model of all elliptic curves for which E -LRB- Q -RRB- / sub tors / is in the form Z/mZ where m = 9,10,12 or Z/2Z * Z/2mZ where m = 4 , according to Mazur 's theorem . Moreover , for every family of such elliptic curves , we give an explicit model of all their isogenous curves with cyclic kernels consisting of rational points

O O O O O O O B O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O

rationals
smooth projective curve
weierstrass equation
explicit model
cyclic kernels

elliptic curves isogenous
mazur's theorem


Hilbert modular threefolds of arithmetic genus one D. Weisser -LRB- 1981 -RRB- proved that there are exactly four Galois cubic number fields with Hilbert modular threefolds of arithmetic genus one . In this paper , we extend Weisser 's work to cover all cubic number fields . Our main result is that there are exactly 33 fields with Hilbert modular threefolds of arithmetic genus one . These fields are enumerated explicitly

B I I O B I I O O O O O O O O O O O B I I I O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I I O O O O O O

hilbert modular threefolds
arithmetic genus one
galois cubic number fields


Application of normal possibility decision rule to silence The paper presents the way of combining two decision problems concerning a single -LRB- or a common -RRB- dimension , so that an effective fuzzy decision rule can be obtained . Normality of the possibility distribution is assumed , leading to possibility of fusing the respective functions related to the two decision problems and their characteristics -LRB- decisions , states of nature , utility functions , etc. -RRB- . The approach proposed can be applied in cases when the statement of the problem requires making of more refined distinctions rather than considering simply a bi-criterion or bi-utility two-decision problem

O O B I I I O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

normal possibility decision rule
silence
decision problems

conflicting objectives
conflicting utilities
cool head
warm heart
two-dimensional fuzzy events


On the p-adic Birch , Swinnerton-Dyer Conjecture for non-semistable reduction In this paper , we examine the Iwasawa theory of elliptic curves E with additive reduction at an odd prime p. By extending Perrin-Riou 's theory to certain nonsemistable representations , we are able to convert Kato 's zeta-elements into p-adic L-functions . This allows us to deduce the cotorsion of the Selmer group over the cyclotomic Z/sub p / - extension of Q , and thus prove an inequality in the p-adic Birch and Swinnerton-Dyer conjecture at primes p whose square divides the conductor of E

O O O O O O O O B I O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nonsemistable reduction
elliptic curves
additive reduction
cotorsion
selmer group

p-adic birch
swinnerton-dyer conjecture
lwasawa theory
perrin-riou's theory
p-adic l-functions
cyclotomic z/sub p/-extension


On bandlimited scaling function This paper discusses band-limited scaling function , especially the single interval band case and three interval band cases . Their relationship to oversampling property and weakly translation invariance are also studied . At the end , we propose an open problem

O B I I O O O B I I O O O O B I I O O O O O O O O O B I O B I I O O O O O O O O O O O O O

bandlimited scaling function
interval band case
oversampling property
weakly translation invariance


Document-based workflow modeling : a case-based reasoning approach 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 -LRB- CBR -RRB- 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

O O O O O O O O O O O O O O B I I O O O O O O O B O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

business process analysis
company
information assets

document-based workflow modeling
case-based reasoning
design output reuse


Use of periodic and monotonic activation functions in multilayer feedforward neural networks trained by extended Kalman filter algorithm 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 -LRB- EKF -RRB- 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

O O O O B I I O B I I I O O B I I I O O O O B O B I O B I I I O O O O B I I O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I I O B I I I O B I I O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B I O O O O O O O

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

ekf algorithm
4-point xor logic function


Problems with my PDA Tom Berry has lost his PDA , and now he has an even better understanding of the risks and benefits of working on the move

O O O B O O O O O B O O O O O O O O O O O B O B O O O O O


LMI approach to digital redesign of linear time-invariant systems A simple design methodology for the digital redesign of static state feedback controllers by using linear matrix inequalities is presented . The proposed method provides close matching of the states between the original continuous-time system and those of the digitally redesigned system with a guaranteed stability . Specifically , the digital redesign problem is reformulated as linear matrix inequalities -LRB- LMIs -RRB- and solved by a numerical optimisation technique . The main feature of the proposed method is that the closed-loop stability of the digitally redesigned system is explicitly guaranteed within the design procedure using the LMI-based approach . A numerical example of the position control of a simple crane system is presented

B I O B I O O O O O O B I O O B I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O

lmi approach
digital redesign
design methodology
linear matrix inequalities
guaranteed stability
numerical optimisation technique
position control
crane system

linear time-invariant systems
continuous-time system
closed-loop stability


CyberEthics bibliography 2002 : a select list of recent works Included in the 2002 annual bibliography update is a select list of recent books and conference proceedings that have been published since 2000 . Also included is a select list of special issues of journals and periodicals that were recently published . For additional lists of recently published books and articles , see ibid . -LRB- June 2000 , June 2001 -RRB-

B I O O O O O O O O O O O B I I O O O O O O B I O B I O O O O O O O O O O O O O O B I O B O B O O O O O O O O O O O O O O O O O O O O O O O O O

cyberethics bibliography
2002 annual bibliography
recent books
conference proceedings
special issues
journals
periodicals


Multi-output regression using a locally regularised orthogonal least-squares algorithm The paper considers data modelling using multi-output regression models . A locally regularised orthogonal least-squares -LRB- LROLS -RRB- 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 -LRB- OLS -RRB- model selection to produce a parsimonious model with a good generalisation performance is greatly enhanced

O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O


Becoming a chief librarian : an analysis of transition stages in academic library leadership The author explores how the four-part model of transition cycles identified by Nicholson and West -LRB- 1988 -RRB- applies to becoming a chief librarian of an academic library . The four stages : preparation , encounter , adjustment , and stabilization , are considered from the micro - , mezzo - , and macrolevels of the organization , as well as for their psychological and social impact on the new job incumbent . An instrument for assessment of transitional success which could be administered in the adjustment or stabilization stage is considered

O O B I O O O O B I O B I I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O

chief librarian
transition stages
academic library leadership
organization
social impact
job

psychological impact
transition cycles model


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

B I O B I I I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I I I O O O O O O O

linear complexity
polyphase power residue sequences
quadratic residue sequences
polynomials
linear feedback shift registers

binary legendre sequences
multiple-valued case
p-phase sequences
cryptographic applications
key stream ciphers
binary sequences


The effect of a male-oriented computer gaming culture on careers in the computer industry If careers in the computer industry were viewed , it would be evident that there is a conspicuous gender gap between the number of male and female employees . The same gap can be observed at the college level where males are dominating females as to those who pursue and obtain a degree in computer science . The question that this research paper intends to show is : why are males so dominant when it comes to computer related matters ? The author has traced this question back to the computer game . Computer games are a fun medium and provide the means for an individual to become computer literate through the engagement of spatial learning and cognitive processing abilities . Since such games are marketed almost exclusively to males , females have a distinct disadvantage . Males are more computer literate through the playing of computer games , and are provided with an easy lead-in to more advanced utilization of computers such as programming . Females tend to be turned off due to the male stereotypes and marketing associated with games and thus begins the gender gap

O O O O O O O O O B O O B I O B O O B I O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B O O O O O O O B I

careers
computer industry
gender gap
computer games
female employees
spatial learning
cognitive processing
male stereotypes
marketing

computer science degree
computer literacy


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

B I O B I B I O O O O O O O O O O O O O O O O O B I O B I I O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O B I O B I O O O O

database technology
digital libraries
information accessibility
digital library projects
end users
resource sharing
managerial issues

data quality
interoperability
metadata
user interface
query processing


Exploring the sabbatical or other leave as a means of energizing a career This article challenges librarians to create leaves that will not only inspire professional growth but also renewal . It presents a framework for developing a successful leave , incorporating useful advice from librarians at Concordia University -LRB- Montreal -RRB- . As food for thought , the article offers examples of specific options meant to encourage professionals to explore their own creative ideas . Finally , a central theme of this article is that a midlife leave provides one with the perfect opportunity to take stock of oneself in order to define future career directions . Midlife is a time when rebel forces , feisty protestors from within , often insist on being heard . It is a time , in other words , when professionals often long to break loose from the stress `` to do far more , in less time '' -LRB- Barner , 1994 -RRB- . Escaping from current job constraints into a world of creative endeavor , when well-executed , is a superb means of invigorating a career stuck in gear and discovering a fresh perspective from which to view one 's profession . To ignite renewal , midcareer is the perfect time to grant one 's imagination free reign

O O O O O O O O O O O O B O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

career
librarians
professional growth
midlife leave


Novel TCP congestion control scheme and its performance evaluation A novel self-tuning proportional and derivative -LRB- ST-PD -RRB- control based TCP congestion control scheme is proposed . The new scheme approaches the congestion control problem from a control-theoretical perspective and overcomes several Important limitations associated with existing TCP congestion control schemes , which are heuristic based . In the proposed scheme , a PD controller is employed to keep the buffer occupancy of the bottleneck node on the connection path at an ideal operating level , and it adjusts the TCP window accordingly . The control gains of the PD controller are tuned online by a fuzzy logic controller based on the perceived bandwidth-delay product of the TCP connection . This scheme gives ST-PD TCP several advantages over current TCP implementations . These include rapid response to bandwidth variations , insensitivity to buffer sizes , and significant improvement of TCP throughput over lossy links by decoupling congestion control and error control functions of TCP

O B I I I O O B I O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O B I O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O

tcp congestion control scheme
performance evaluation
pd controller
buffer occupancy
bottleneck node
connection path
fuzzy logic controller
lossy links


Resolving Web user on the fly 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 -LRB- WTS -RRB- 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 -LRB- ECT -RRB- 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

O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O B I I O O O O O O O O O O B O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

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


The theory of information reversal The end of the industrial age coincides with the advent of the information society as the next model of social and economic organization , which brings about significant changes in the way modern man conceives work and the social environment . The functional basis of the new model is pivoted upon the effort to formulate the theory on the violent reversal of the basic relationship between man and information , and isolate it as one of the components for the creation of the new electronic reality . The objective of the theory of reversal is to effectively contribute to the formulation of a new definition consideration in regards to the concept of the emerging information society . In order to empirically apply the theory of reversal , we examine a case study based on the example of the digital library

O O O O O O O O O B I O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O B I

information society
industrial age
economic organization
case study
digital library

information reversal theory
social organization
information systems


Taylor series based two-dimensional digital differentiators A new type of Taylor series based 2-D finite difference approximation is presented , and it is shown that the coefficients of these approximations are not unique . Explicit formulas are presented for one of the possible sets of coefficients for an arbitrary order , by extending the previously presented 1-D approximations . These coefficients are implemented as maximally linear 2-D FIR digital differentiators , and their formulas are modified to narrow the inaccuracy regions on the resultant frequency responses , close to the Nyquist frequencies

B I O O O O O O O O B I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O B I

taylor series
2d finite difference approximation
2d fir digital differentiators
nyquist frequencies

maximally linear digital differentiators


Steady-state mean-square error analysis of the cross-correlation and constant modulus algorithm in a MIMO convolutive system The cross-correlation and constant modulus algorithm -LRB- CC-CMA -RRB- has been proven to be an effective approach in the problem of joint blind equalisation and source separation in a multi-input and multi-output system . In the paper , the steady-state mean-square error performance of CC-CMA in a noise-free environment is studied , and a new expression is derived based on the energy preservation approach of Mai and Sayed -LRB- 2000 -RRB- . Simulation studies are undertaken to support the analysis

O O O O O O O O B I I O O B I I O O O B I I O O O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O

mimo convolutive system
constant modulus algorithm
joint blind equalisation
source separation
energy preservation approach

steady-state mean-square error analysis
cross-correlation
multi-input multi-output system
noise-free environment
cc-cma


New voice over Internet protocol technique with hierarchical data security protection The authors propose a voice over Internet protocol -LRB- VoIP -RRB- technique with a new hierarchical data security protection -LRB- HDSP -RRB- scheme . The proposed HDSP scheme can maintain the voice quality degraded from packet loss and preserve high data security . It performs both the data inter-leaving on the inter-frame of voice for achieving better error recovery of voices suffering from continuous packet loss , and the data encryption on the intra-frame of voice for achieving high data security , which are controlled by a random bit-string sequence generated from a chaotic system . To demonstrate the performance of the proposed HDSP scheme , we have successfully verified and analysed the proposed approach through software simulation and statistical measures on several test voices

O B I I I O O B I I I O O O O B I I I O B O O O O O B I I I O O O O O O O B I O O O O O O O B I O O B I I O O O O O B I O O O O O O O O O O O O O O O B I O O O B I O O O O O O O B I I O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O B I O B I O O O O

voice over internet protocol
hierarchical data security protection
voip
hdsp scheme
packet loss
high data security
data interleaving
data encryption
chaotic system
software simulation
statistical measures

random bit-string sequence
packet voice communications


Nonlinearities in NARX polynomial models : representation and estimation It is shown how nonlinearities are mapped in NARX polynomial models . General expressions are derived for the gain and eigenvalue functions in terms of the regressors and coefficients of NARX models . Such relationships are useful in grey-box identification problems . The results are illustrated using simulated and real data

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

nonlinear autoregressive exogenous-input polynomial model


Robustness evaluation of a minimal RBF neural network for nonlinear-data-storage-channel equalisation The authors present a performance-robustness evaluation of the recently developed minimal resource allocation network -LRB- MRAN -RRB- for equalisation in highly nonlinear magnetic recording channels in disc storage systems . Unlike communication systems , equalisation of signals in these channels is a difficult problem , as they are corrupted by data-dependent noise and highly nonlinear distortions . Nair and Moon -LRB- 1997 -RRB- have proposed a maximum signal to distortion ratio -LRB- MSDR -RRB- equaliser for data storage channels , which uses a specially designed neural network , where all the parameters of the neural network are determined theoretically , based on the exact knowledge of the channel model parameters . In the present paper , the performance of the MSDR equaliser is compared with that of the MRAN equaliser using a magnetic recording channel model , under Conditions that include variations in partial erasure , jitter , width and noise power , as well as model mismatch . Results from the study indicate that the less complex MRAN equaliser gives consistently better performance robustness than the MSDR equaliser in terms of signal to distortion ratios -LRB- SDRs -RRB-

B I O O O B I I O O O O O O O O O O O O O B I I I O O O O O O B I I I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O

maximum signal to distortion ratio equaliser


Module placement with boundary constraints using B * - trees 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 -LRB- e.g. silicon area , interconnection length , etc. -RRB- 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

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O

boundary constraints
silicon area
interconnection length

logic module placement
b*-tree
simulated annealing algorithm


Control of integral processes with dead-time . 1 . Disturbance observer-based 2 DOF control scheme A disturbance observer-based control scheme -LRB- a version of 2 DOF internal model control -RRB- which is very effective in controlling integral processes with dead time is presented . The controller can be designed to reject ramp disturbances as well as step disturbances and even arbitrary disturbances . When the plant model is available only two parameters are left to tune . One is the time constant of the set-point response and the other is the time constant of the disturbance response . The latter is tuned according to the compromise between disturbance response and robustness . This control scheme has a simple , clear , easy-to-design , easy-to-implement structure and good performance . It is compared to the best results -LRB- so far -RRB- using some simulation examples

O O B I O O O O O O O O O O O O O O O O O O O O B I I I I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O B I O O O O O O O O O O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

integral processes
2 dof internal model control
time constant
disturbance response
robustness

disturbance observer-based 2 dof control scheme


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

O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O B I O O O O O O O O O O

internet
copyright infringement
electronic environment
fair use
copyrighted work

electronic publishing copyright
copyright protection


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

O B I O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O

banking
patriot act
terrorist funding
identification


Computing the frequency response of systems affinely depending on uncertain parameters The computation of the frequency response of systems depending affinely on uncertain parameters can be reduced to that of all its one-dimensional edge plants while the image of such an edge plant at a fixed frequency is an arc or a line segment in the complex plane . Based on this conclusion , four computational formulas of the maximal and minimal -LRB- maxi-mini -RRB- magnitudes and phases of an edge plant at a fixed frequency are given . The formulas , besides sharing a simpler form of expression , concretely display how the extrema of the frequency response of the edge plant relate to the typical characteristics of the arc and line segment such as the centre , radius and tangent points of the arc , the distance from the origin to the line segment etc. . The direct application of the results is to compute the Bode - , Nichols - and Nyquist-plot collections of the systems which are needed in robustness analysis and design

O O B I O O O O O B I O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B O B I O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O

frequency response
uncertain parameters
arc
line segment
robustness analysis

affine systems
one-dimensional edge plants
bode-plot
nichols-plot
nyquist-plot
robustness design
frequency-domain design methods


Control of integral processes with dead-time . 2 . Quantitative analysis For part 1 , see ibid. , p.285-90 , -LRB- 2002 -RRB- . Several different control schemes for integral processes with dead time resulted in the same disturbance response . It has already been shown that such a response is subideal . Hence , it is necessary to quantitatively analyse the achievable specifications and the robust stability regions . The control parameter can be quantitatively determined with a compromise between the disturbance response and the robustness . Four specifications : -LRB- normalised -RRB- maximum dynamic error , maximum decay rate , -LRB- normalised -RRB- control action bound and approximate recovery time are used to characterise the step-disturbance response . It is shown that any attempt to obtain a -LRB- normalised -RRB- dynamic error less than tau / sub m / is impossible and a sufficient condition on the -LRB- relative -RRB- gain-uncertainty bound is square root -LRB- 3 -RRB- / 2

O O B I O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O B I O O B O O O O O O O B I I O B I I O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

integral processes
quantitative analysis
disturbance response
robust stability regions
robustness
maximum dynamic error
maximum decay rate
control action bound
approximate recovery time
sufficient condition

dead-time
step-disturbance response
gain-uncertainty bound


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

B I I I O B I I I O B I I I O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O

least load dispatching algorithm
parallel web server nodes
internet
transfer time
clarknet access logs
throughput

nasa access logs
round-robin dispatching algorithms
random dispatching algorithms
world wide web server


Making it to the major leagues : career movement between library and archival professions and from small college to large university libraries Issues of career movement and change are examined between library and archival fields and from small colleges to large universities . Issues examined include professional education and training , initial career-planning and placement , continuing education , scouting and mentoring , job market conditions , work experience and personal skills , professional involvement , and professional association self-interest . This examination leads to five observations : 1 . It is easier , in terms of career transitions , for a librarian to become an archivist than it is for an archivist to become a librarian ; 2 . The progression from a small college venue to a large research university is very manageable with the proper planning and experience ; 3 . At least three of the career elements-professional education , career-planning , and professional association self-interest-in their best moments provide a foundation that enables a future consideration of change between institutional types and professional areas and in their worst moments conspire against the midcareer professional in terms of change ; 4 . The elements of scouting , continuing education , work experience , and professional involvement offer the greatest assistance in career transitions ; 5 . The job market is the wildcard that either stymies or stimulates occupational development

O O O O O O O B I O O O O O O O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O B I O B O O O O O O B I O O O O O B I O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O B I O O O O O O O O B I

career movement
large university libraries
professional education
training
continuing education
job market
work experience
personal skills
librarian
occupational development
midcareer

library profession
archival profession
small college library


The pedagogy of on-line learning : a report from the University of the Highlands and Islands Millennium Institute Authoritative sources concerned with computer-aided learning , resource-based learning and on-line learning and teaching are generally agreed that , in addition to subject matter expertise and technical support , the quality of the learning materials and the learning experiences of students are critically dependent on the application of pedagogically sound theories of learning and teaching and principles of course design . The University of the Highlands and Islands Project -LRB- UHIMI -RRB- is developing `` on-line learning '' on a large scale . These developments have been accompanied by a comprehensive programme of staff development . A major emphasis of the programme is concerned with ensuring that course developers and tutors are pedagogically aware . This paper reviews -LRB- i -RRB- what is meant by `` on-line learning '' in the UHIMI context -LRB- ii -RRB- the theories of learning and teaching and principles of course design that inform the staff development programme and -LRB- iii -RRB- a review of progress to date

O B O B I O O O O O O O O O O O O O O O O O O O O O O O B I O B O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O B I I I I I I O O O O O O B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O

university of the highlands and islands project

computer-aided learning
resource-based learning
educational course design
distance education
internet


Adaptive tracking controller design for robotic systems using Gaussian wavelet networks An adaptive tracking control design for robotic systems using Gaussian wavelet networks is proposed . A Gaussian wavelet network with accurate approximation capability is employed to approximate the unknown dynamics of robotic systems by using an adaptive learning algorithm that can learn the parameters of the dilation and translation of Gaussian wavelet functions . Depending on the finite number of wavelet basis functions which result in inevitable approximation errors , a robust control law is provided to guarantee the stability of the closed-loop robotic system that can be proved by Lyapunov theory . Finally , the effectiveness of the Gaussian wavelet network-based control approach is illustrated through comparative simulations on a six-link robot manipulator

B I I I O B I O B I I O O O O O O B I O B I I O O O O O O O O B I I O O O O O B I O B I O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

adaptive tracking controller design
robotic systems
gaussian wavelet networks
accurate approximation capability
unknown dynamics
adaptive learning algorithm
approximation errors
robust control law
lyapunov theory

closed-loop system
six-link robot manipulator


Fast and efficient algorithm for the multiplierless realisation of linear DSP transforms A fast algorithm having a pseudopolynomial run-time and memory requirement in the worst case is developed to generate multiplierless architectures at all wordlengths for constant multiplications in linear DSP transforms . It is also re-emphasised that indefinitely reducing operators for multiplierless architectures is not sufficient to reduce the final chip area . For a major reduction , techniques like resource folding must be used . Simple techniques for improving the results are also presented

O O O O O O B I O B I I O O O O O O O O B I O O O O O O O O O O O O B O B I O B I I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O O O

multiplierless realisation
linear dsp transforms
memory requirement
wordlengths
constant multiplications
final chip area
resource folding


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

B I O O B I I O O B I I I I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O B I I I I O O O O O O O O O O O O O O O O O O O B O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I I O O O O B I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O B I O O O O O O O B O O O O O O O B I B I I B I I I O O O O B O O O O O O B I I I O O O O O O O O O B I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O

electromagnetics computations
mpi parallel implementation
steepest descent fast multipole method
fast algorithms
message passing interface
physics
multiple processors
sparse impedance matrix
method of moments
scattering problems
matrix vector multiplications
intel pentium beowulf cluster
intel pentium ii
ram
xeon shared memory processor
100 basetx ethernet network
350 mhz
450 mhz
667 mhz

large-scale linear systems
near-field mom
4-processor alpha workstation
scattered electric field
scattered magnetic field
256 mbyte
2 gbyte


Approach to adaptive neural net-based H/sub infinity / control design An approach is investigated for the adaptive neural net-based H/sub infinity / control design of a class of nonlinear uncertain systems . In the proposed framework , two multilayer feedforward neural networks are constructed as an alternative to approximate the nonlinear system . The neural networks are piecewisely interpolated to generate a linear differential inclusion model by which a linear state feedback H/sub infinity / control law can be applied . An adaptive weight adjustment mechanism for the multilayer feedforward neural networks is developed to ensure H/sub infinity / regulation performance . It is shown that finding the control gain matrices can be transformed into a standard linear matrix inequality problem and solved via a developed recurrent neural network

O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O B I I I O O O B I I O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O B I I O O O O O O B I I I O O O O O B I I

nonlinear uncertain systems
multilayer feedforward neural networks
linear differential inclusion model
linear state feedback
control gain matrices
linear matrix inequality problem
recurrent neural network

adaptive neural net-based h/sub infinity / control design


Input-output based pole-placement controller for a class of time-delay systems A controller structure valid for SISO plants involving both internal and external point delays is presented . The control signal is based only on the input and output plant signals . The controller allows finite or infinite spectrum assignment . The most important feature of the proposed controller is that it only involves the use of a class of point-delayed signals . Thus the controller synthesis involves less computational cost than former methods . Since the plant control input is generated by filtering the input and output plant signals , this controller structure is potentially applicable to the adaptive case of unknown plant parameters

O O O O O O O O O O O O O O O B I O O O B I I I O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O

siso plants
and external point delays
infinite spectrum assignment
controller synthesis
computational cost
filtering

input-output based pole-placement controller


Exact analytical model for the AEP of control signals An exact analytical model for the aliasing error probability -LRB- AEP -RRB- in the signature analysis of control signals using a modified signature analyser is presented . The signature analyser used comprises a general-structure two-input compacting module -LRB- TICM -RRB- , which simplifies the motherboard VLSI design by providing a flexible geometry , which could be easily integrated with neighbouring structures . The use of the modified data probe eliminates the ambiguity introduced by the high-impedance state and at the same time retains the same signature of the binary stream . The model specifies algebraically the effects of the TICM architecture , the test pattern length , and the control stream error probabilities . It is proved that the -LRB- hardware -RRB- criterion used for calculating the AEP for the internal - and external exclusive-OR two-input shift registers is not valid for the general case and a new criterion is provided . The results obtained are augmented by two special cases , a case study , and associated simulation

O B I O O B O B I O O B I O O B I I O B O O O B I O B I O O O B I O O O O B I O O O O O O O O O O O O O O B I I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I I O O O B I I I O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

analytical model
aep
control signals
aliasing error probability
signature analysis
signature analyser
motherboard vlsi design
flexible geometry
binary stream
test pattern length
control stream error probabilities

two-input compacting module
high-impedance state
two-input shift registers


A humane tool for aiding computer science advisors , computer science students , and parents Over the past few years , the computer science department faculty at Baylor has observed that some students who perform adequately during the freshman and sophomore years have substantial difficulty during the junior and senior years of study . Baylor University is an institution committed to being caring of its students . The objective for this study grew out of these two realities . There are three objectives of this research . One objective is to identify students , no later than the sophomore year , who are less likely to succeed as computer science majors . A second objective is to accomplish this identification by using data from seniors majoring in computer science . A third objective is to begin to use this information at the end of their sophomore year when meeting with a computer science faculty advisor . A regression study is conducted on the data from all students classified as seniors , majoring in computer science in May 2001 , showing grades in six freshman and sophomore courses , and showing grades for at least five junior or senior level computer science courses . These students and their course performance data constituted the study sample

O B I O O B I I O B I I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O

humane tool
computer science advisors
computer science students
parents
baylor university
sophomore year
computer science majors
regression study
course performance data


Regional flux target with minimum energy An extension of a gradient controllability problem to the case where the target subregion is a part of the boundary of a parabolic system domain is discussed . A definition and some properties adapted to this case are presented . The focus is on the characterisation of the control achieving a regional boundary gradient target with minimum energy . An approach is developed that leads to a numerical algorithm for the computation of optimal control . Numerical illustrations show the efficiency of the approach and lead to conjectures

B I I O B I O O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O B I O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O

regional flux target
minimum energy
gradient controllability problem
target subregion
regional boundary gradient target
numerical algorithm
optimal control


Well-posed anisotropic diffusion for image denoising A nonlinear iterative smoothing filter based on a second-order partial differential equation is introduced . It smooths out the image according to an anisotropic diffusion process . The approach is based on a smooth approximation of the total variation -LRB- TV -RRB- functional which overcomes the non-differentiability of the TV functional at the origin . In particular , the authors perform linear smoothing over smooth areas but selective smoothing over candidate edges . By relating the smoothing parameter to the time step , they arrive at a CFL condition which guarantees the causality of the discrete scheme . This allows the adoption of higher time discretisation steps , while ensuring the absence of artefacts deriving from the non-smooth behaviour of the TV functional at the origin . In particular , it is shown that the proposed approach avoids the typical staircase effects in smooth areas which occur in the standard time-marching TV scheme

O O O O B I O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O B I O O O B O O B I O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

image denoising
nonlinear iterative smoothing filter
linear smoothing
selective smoothing
cfl condition
discrete scheme
causality
higher time discretisation steps


The paradigm of viral communication The IIW Institute of Information Management -LRB- www.IIW.de -RRB- 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 : -LRB- 1 -RRB- prospects and customers of the idea are offered a technology platform providing a possibility to send a message to a majority of persons ; -LRB- 2 -RRB- there is an emotional or pecuniary incentive to participate . Ideally , niches of needs and market vacua are filled with funny ideas ; -LRB- 3 -RRB- 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 -LRB- 4 -RRB- 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

O O O O O O O O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I

viral communication paradigm
commercial applications
viral messages
internet
direct marketing


Differential and integral calculus on discrete time series data It has been found that discontinuity plays a crucial role in natural evolutions -LRB- Lin 1998 -RRB- . In this presentation , we will generalize the idea of integration and differentiation , we developed in calculus , to the study of time series in the hope that the problem of outliers and discontinuities can be resolved more successfully than simply deleting the outliers and avoiding discontinuities from the overall data analysis . In general , appearances of outliers tend to mean existence of discontinuities , explosive growth or decline in the evolution . At the same time , our approach can be employed to partially overcome the problem of not having enough data values in any available time series . At the end , we will look at some real-life problems of prediction in order to see the power of this new approach

O O O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B O B O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B O O O O O O O O O O

natural evolutions
integration
differentiation
time series
outliers
prediction


The dynamic aspect of land administration : an often-forgotten component in system design 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

O B I O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B I O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O B I O O O O O

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


Supporting global user profiles through trusted authorities Personalization generally refers to making a Web site more responsive to the unique and individual needs of each user . We argue that for personalization to work effectively , detailed and interoperable user profiles should be globally available for authorized sites , and these profiles should dynamically reflect changes in user interests . Creating user profiles from user click-stream data seems to be an effective way of generating detailed and dynamic user profiles . However , a user profile generated in this way is available only on the computer where the user accesses his browser , and is inaccessible when the same user works on a different computer . On the other hand , integration of the Internet with telecommunication networks has made it possible for the users to connect to the Web with a variety of mobile devices as well as desktops . This requires that user profiles should be available to any desktop or mobile device on the Internet that users choose to work with . In this paper , we address these problems through the concept of `` trusted authority '' . A user agent at the client side that captures the user click stream , dynamically generates a navigational history ` log ' file in Extensible Markup Language -LRB- XML -RRB- . This log file is then used to produce ` user profiles ' in a resource description framework -LRB- RDF -RRB- . A user 's right to privacy is provided through the Platform for Privacy Preferences -LRB- P3P -RRB- standard . User profiles are uploaded to the trusted authority and served next time the user connects to the Web

O B I I O B I B O O O O O B I O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O B I I O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

global user profiles
trusted authorities
personalization
web site
internet
telecommunication networks
mobile device
user agent
user click stream
xml
resource description framework
privacy

platform for privacy preferences standard

globally unique user id/password identification


British Standard 7666 as a framework for geocoding land and property information the UK The article examines the role of British Standard 7666 in the development of a national framework for geocoding land and property information in the United Kingdom . The author assesses how local authorities , and other agencies concerned with property and address datasets , are coping with the introduction of British Standard 7666 , and examines the prospects and limitations of this development . British Standard 7666 has four parts , comprising specifications for street gazetteer ; land and property gazetteer ; addresses ; and public rights of way . The organisation coordinating the introduction of British Standard 7666 , Improvement and Development Agency -LRB- IDeA -RRB- , is also overseeing the development and maintenance of a National Land and Property Gazetteer -LRB- NLPG -RRB- based on British Standard 7666 . The introduction of the new addressing standard has mainly been prompted by Britain 's effort to set up a national cadastral service to replace the obsolescent property registration system currently in place

B I I O O O O B O O B I O B O O O O O O B I I O O O O O B I O B O O B I O O B I O O O O O B I O O O O O O O O B I O O O O O O O B I I O O O O O O O O O O O B I I O O O O O O O B I O O O B I O B O O B I I I O O O O O O O B I I O B I I I O B O O O O O O O O O O O O O O B I O B O O O B I I O O O O O O B I O O O O O O O O O O O O B I I O O O O B I I O O O

british standard 7666
geocoding
property information
uk
national framework
united kingdom
local authorities
address datasets
street gazetteer
property gazetteer
addresses
public rights of way
improvement and development agency
idea
nlpg
addressing standard
national cadastral service
property registration system

land information
property datasets
land gazetteer
national land and property gazetteer
land information systems


An active functionality service for e-business applications Service based architectures are a powerful approach to meet the fast evolution of business rules and the corresponding software . An active functionality service that detects events and involves the appropriate business rules is a critical component of such a service-based middleware architecture . In this paper we present an active functionality service that is capable of detecting events in heterogeneous environments , it uses an integral ontology-based approach for the semantic interpretation of heterogeneous events and data , and provides notifications through a publish/subscribe notification mechanism . The power of this approach is illustrated with the help of an auction application and through the personalization of car and driver portals in Internet-enabled vehicles

O B I I O O O O O O O O O O O O O O O O B I O O O B O O B I I O O O O O O O B I O O O O O O O O O O O O O O O O O B I I O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

active functionality service
business rules
software
heterogeneous environments
semantic interpretation
auction application


Sliding-mode control scheme for a class of continuous chemical reactors The synthesis of a robust control law for regulation control of a class of relative-degree-one nonlinear systems is presented . The control design is based on a sliding-mode uncertainty estimator , developed under a framework of algebraic-differential concepts . The closed-loop stability for the underlying closed-loop system is achieved via averaging techniques . Robustness of the proposed control scheme is proved in the face of noise measurements , model uncertainties and sustained disturbances . The performance of the proposed control law is illustrated with numerical simulations , comparing the proposed controller with a well tuned PI controller

O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O

continuous chemical reactors
averaging techniques
noise measurements
model uncertainties
sustained disturbances

sliding-mode control scheme
robust control law synthesis
relative-degree-one nonlinear systems
sliding-mode uncertainty estimator
algebraic-differential concepts
closed-loop stability
closed-loop system


Hamiltonian modelling and nonlinear disturbance attenuation control of TCSC for improving power system stability To tackle the obstacle of applying passivity-based control -LRB- PBC -RRB- to power systems , an affine non-linear system widely existing in power systems is formulated as a standard Hamiltonian system using a pre-feedback method . The port controlled Hamiltonian with dissipation -LRB- PCHD -RRB- model of a thyristor controlled serial compensator -LRB- TCSC -RRB- is then established corresponding with a revised Hamiltonian function . Furthermore , employing the modified Hamiltonian function directly as the storage function , a non-linear adaptive L/sub 2 / gain control method is proposed to solve the problem of L/sub 2 / gain disturbance attenuation for this Hamiltonian system with parametric perturbations . Finally , simulation results are presented to verify the validity of the proposed controller

B I O B I I I O O O O B I I O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O B I O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

port controlled hamiltonian with dissipation model

nonlinear adaptive l/sub 2/ gain control method


A linear time algorithm for recognizing regular Boolean functions A positive -LRB- or monotone -RRB- Boolean function is regular if its variables are naturally ordered , left to fight , by decreasing strength , so that shifting the nonzero component of any true vector to the left always yields another true vector . This paper considers the problem of recognizing whether a positive function f is regular , where f is given by min T -LRB- f -RRB- -LRB- the set of all minimal true vectors of f -RRB- . We propose a simple linear time -LRB- i.e. , O -LRB- n | min T -LRB- f -RRB- | -RRB- - time -RRB- algorithm for it . This improves upon the previous algorithm by J.S. Provan and M.O. Ball -LRB- 1988 -RRB- which requires O -LRB- n/sup 2 / | min T -LRB- f -RRB- | -RRB- time . As a corollary , we also present an O -LRB- n -LRB- n + | min T -LRB- f -RRB- | -RRB- -RRB- - time algorithm for the recognition problem of 2-monotonic functions

O B I I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

linear time algorithm
regular boolean functions
nonzero component
true vector
positive function

monotone boolean function
2-monotonic functions


A review of methodologies used in research on cadastral development World-wide , much attention has been given to cadastral development . As a consequence of experiences made during recent decades , several authors have stated the need for research in the domain of cadastre and proposed methodologies to be used . The paper contributes to the acceptance of research methodologies needed for cadastral development , and thereby enhances theory in the cadastral domain . The paper reviews nine publications on cadastre and identifies the methodologies used . The review focuses on the institutional , social , political and economic aspects of cadastral development , rather than on the technical aspects . The main conclusion is that the methodologies used are largely those of the social sciences . That agrees with the notion that cadastre relates as much to people and institutions , as it relates to land , and that cadastral systems are shaped by social , political and economic conditions , as well as technology . Since the geodetic survey profession has been the keeper of the cadastre , geodetic surveyors will have to deal ever more with social science matters , a fact that universities will have to consider

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I I O O O O O O B O B I O O O O O O O O O O O O O O O O O O O

cadastre
research methodologies
economic aspects
social sciences
economic conditions
geodetic survey profession
geodetic surveyors

cadastral development methodologies
political aspects
land registration
case study


Distribution software : ROI is king Middle-market accounting software vendors are taking to the open road , by way of souped-up distribution suites that can track product as it wends its way from warehouse floor to customer site . Integration provides efficiencies , and cost savings

B O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O


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

O O O O O B I I O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O B I O B I O O O O O B I O O O O O O O O B I I

software component marketplace
ontology modeling
uml extensions
ontology transfer
dynamically changing ontologies

multi-agent system architecture
adaptation


Conceptual modeling and specification generation for B2B business processes based on ebXML In order to support dynamic setup of business processes among independent organizations , a formal standard schema for describing the business processes is basically required . The ebXML framework provides such a specification schema called BPSS -LRB- Business Process Specification Schema -RRB- which is available in two standalone representations : a UML version , and an XML version . The former , however , is not intended for the direct creation of business process specifications , but for defining specification elements and their relationships required for creating an ebXML-compliant business process specification . For this reason , it is very important to support conceptual modeling that is well organized and directly matched with major modeling concepts . This paper deals with how to represent and manage B2B business processes using UML-compliant diagrams . The major challenge is to organize UML diagrams in a natural way that is well suited to the business process meta-model and then to transform the diagrams into an XML version . This paper demonstrates the usefulness of conceptually modeling business processes by prototyping a business process editor tool called ebDesigner

B I O B I O B I I O O B O O O O O O O O O O O O O O B I I O O O O O O O O O O B O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O B

b2b business processes
ebxml
conceptual modeling
specification generation
formal standard schema
business process specification schema
ebdesigner
business process editor


Parallel operation of capacity-limited three-phase four-wire active power filters Three-phase four-wire active power filters -LRB- APFs -RRB- 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

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

parallel operation
decoupling control approach
unity power factor
balanced line current
6 kva


The design and performance evaluation of alternative XML storage strategies This paper studies five strategies for storing XML documents including one that leaves documents in the file system , three that use a relational database system , and one that uses an object manager . We implement and evaluate each approach using a number of XQuery queries . A number of interesting insights are gained from these experiments and a summary of the advantages and disadvantages of the approaches is presented

O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O

file system
relational database system
object manager
performance evaluation
xquery queries


CherylAnn Silberer : all about process -LSB- accounting technologist -RSB- Silberer 's company , CompLete , is making a specialty of workflow process analysis

O O O O O O O B I O O O O O B O O O O O O B I I

complete
workflow process analysis
accounting technologist


Single-phase half-bridge converter topology for power quality compensation A high power factor half-bridge rectifier with neutral point switch clamped scheme is proposed . Three power switches are employed in the proposed rectifier . Two PWM control schemes are used to draw a sinusoidal line current with low current distortion . The control signals of the power switches are derived from the DC link voltage balance compensator , line current controller and DC link voltage regulator . The hysteresis current control scheme is employed to track the line current command . The proposed control scheme and the circuit configuration can be applied to the active power filter to eliminate the harmonic currents and compensate the reactive power generated from the nonlinear load . Analytical and experimental results are included to illustrate the validity and effectiveness of the proposed control scheme

O O O O O B I I O O O O O O O B I I I I O O O O O O O O O O O O O O B I I O O O O O B I I O O B I O O O O O O O O O O O O B I I I I O B I I O B I I I O O B I I I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

neutral point switch clamped scheme
pwm control schemes
power quality compensation
sinusoidal line current
current distortion
dc link voltage balance compensator
line current controller
dc link voltage regulator
hysteresis current control scheme
circuit configuration

single-phase half-bridge rectifier topology


Structural interpretation of matched pole-zero discretisation 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

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

structural interpretation
controllability
observability

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


Contracting in the days of ebusiness Putting electronic business on a sound foundation-model theoretically as well as technologically-is a central challenge for research as well as commercial development . This paper concentrates on the discovery and negotiation phase of concluding an agreement based on a contract . We present a methodology for moving seamlessly from a many-to-many relationship in the discovery phase to a one-to-one relationship in the contract negotiation phase . Making the content of contracts persistent is achieved by reconstructing contract templates by means of mereologic -LRB- logic of the whole-part relation -RRB- . Possibly nested sub-structures of the contract template are taken as a basis for negotiation in a dialogical way . For the negotiation itself the contract templates are extended by implications -LRB- logical -RRB- and sequences -LRB- topical -RRB-

B O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I I O O O O O O O O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B O O O O B O O O

electronic business
discovery phase
contracting
contract negotiation phase
mereologic
contract templates
sequences
implications

many-to-many relationship
one-to-one relationship
nested sub-structure


Modeling shape and topology of low-resolution density maps of biological macromolecules We develop an efficient way of representing the geometry and topology of volumetric datasets of biological structures from medium to low resolution , aiming at storing and querying them in a database framework . We make use of a new vector quantization algorithm to select the points within the macromolecule that best approximate the probability density function of the original volume data . Connectivity among points is obtained with the use of the alpha shapes theory . This novel data representation has a number of interesting characteristics , such as -LRB- 1 -RRB- it allows us to automatically segment and quantify a number of important structural features from low-resolution maps , such as cavities and channels , opening the possibility of querying large collections of maps on the basis of these quantitative structural features ; -LRB- 2 -RRB- it provides a compact representation in terms of size ; -LRB- 3 -RRB- it contains a subset of three-dimensional points that optimally quantify the densities of medium resolution data ; and -LRB- 4 -RRB- a general model of the geometry and topology of the macromolecule -LRB- as opposite to a spatially unrelated bunch of voxels -RRB- is easily obtained by the use of the alpha shapes theory

B O O B O O O O O B I O O O O O O O O B O B O B I O B I O O O O O O O O O O O O O O B I O O O O O O O B I I O O O O O O O O O O O B I I O O B I I O B O O O O O O O O O B I I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O B O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O B O B O O O O O O O O O O O O O O O O O O O O O O B I I

geometry
topology
volumetric datasets
biological structures
database framework
vector quantization algorithm
biological macromolecules
modeling
probability density function
data representation
structural features
cavities
channels
connectivity
compact representation
medium resolution data
general model
original volume data
alpha shapes theory

low-resolution density maps
three-dimensional points


Improved approximation of Max-Cut on graphs of bounded degree Let alpha approximately = 0.87856 denote the best approximation ratio currently known for the Max-Cut problem on general graphs . We consider a semidefinite relaxation of the Max-Cut problem , round it using the random hyperplane rounding technique of M.X. Goemans and D.P. Williamson -LRB- 1995 -RRB- , and then add a local improvement step . We show that for graphs of degree at most Delta , our algorithm achieves an approximation ratio of at least alpha + epsilon , where epsilon > 0 is a constant that depends only on Delta . . Using computer assisted analysis , we show that for graphs of maximal degree 3 our algorithm obtains an approximation ratio of at least 0.921 , and for 3-regular graphs the approximation ratio is at least 0.924 . We note that for the semidefinite relaxation of Max-Cut used by Goemans and Williamson the integrality gap is at least 1/0 .885 , even for 2-regular graphs

O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O

semidefinite relaxation
approximation ratio
computer assisted analysis

max-cut approximation
2-regular graphs
bounded degree graph
best approximation ratio


Nonlinear adaptive control via sliding-mode state and perturbation observer The paper presents a nonlinear adaptive controller -LRB- NAC -RRB- for single-input single-output feedback linearisable nonlinear systems . A sliding-mode state and perturbation observer is designed to estimate the system states and perturbation which includes the combined effect of system nonlinearities , uncertainties and external disturbances . The NAC design does not require the details of the nonlinear system model and full system states . It possesses an adaptation capability to deal with system parameter uncertainties , unmodelled system dynamics and external disturbances . The convergence of the observer and the stability analysis of the controller/observer system are given . The proposed control scheme is applied for control of a synchronous generator , in comparison with a state-feedback linearising controller -LRB- FLC -RRB- . Simulation study is carried out based on a single-generator infinite-bus power system to show the performance of the controller/observer system

B I I O O O O B I O O O O O O O O B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I I O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O

nonlinear adaptive control
perturbation observer
nac
parameter uncertainties
unmodelled system dynamics
external disturbances
convergence
flc

siso feedback linearisable nonlinear systems


Too much middleware The movement from client-server computing to multi-tier computing has created a potpourri of so-called middleware systems , including application servers , workflow products , EAI systems , ETL systems and federated data systems . We argue that the explosion in middleware has created a myriad of poorly integrated systems with overlapping functionality . The world would be well served by considerable consolidation , and we present some of the ways this might happen . Some of the points covered in the article have been previously explored by P. Bernstein -LRB- 1996 -RRB-

O O O O O O O O O O O O O O O O O B I O O B I O B I O B I O B I O B I I O O O O O O O O O O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

middleware systems
application servers
workflow products
eai systems
etl systems
federated data systems
poorly integrated systems
overlapping functionality

client-server computing
multi-tier computing


Approximation of pathwidth of outerplanar graphs There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs , but the large exponent makes this algorithm impractical . In this paper , we give an algorithm that , given a biconnected outerplanar graph G , finds a path decomposition of G of pathwidth at most twice the pathwidth of G plus one . To obtain the result , several relations between the pathwidth of a biconnected outerplanar graph and its dual are established

O O O O B I O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O

outerplanar graphs
polynomial time algorithm
biconnected outerplanar graph
path decomposition


Single-phase shunt active power filter with harmonic detection An advanced active power filter for the compensation of instantaneous harmonic current components in nonlinear current loads is presented . A signal processing technique using an adaptive neural network algorithm is applied for the detection of harmonic components generated by nonlinear current loads and it can efficiently determine the instantaneous harmonic components in real time . The validity of this active filtering processing system to compensate current harmonics is substantiated by simulation results

O O O O O O B I O O O O O O O O O O O O O O B I I O O O O B I I O O B I I I O O O O O O O O O O B I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O B O

harmonic detection
nonlinear current loads
signal processing technique
adaptive neural network algorithm
instantaneous harmonic components
simulation

instantaneous harmonic current components compensation


Phase transition for parking blocks , Brownian excursion and coalescence In this paper , we consider hashing with linear probing for a hashing table with m places , n items -LRB- n < m -RRB- , and l = m-n empty places . For a noncomputer science-minded reader , we shall use the metaphore of n cars parking on m places : each car c/sub i / chooses a place p/sub i / at random , and if p/sub i / is occupied , c/sub i / tries successively p/sub i / +1 , p/sub i / +2 , until it finds an empty place . Pittel -LSB- 42 -RSB- proves that when l/m goes to some positive limit beta < 1 , the size B/sub 1 / / sup m , l / of the largest block of consecutive cars satisfies 2 -LRB- beta -1 - log beta -RRB- B/sub 1 / / sup m , l / = 2 log m-3 log log m + Xi / sub m / , where Xi / sub m / converges weakly to an extreme-value distribution . In this paper we examine at which level for n a phase transition occurs between B/sub 1 / / sup m , l / = o -LRB- m -RRB- and m-B/sub 1 / / sup m , l / = o -LRB- m -RRB- . The intermediate case reveals an interesting behavior of sizes of blocks , related to the standard additive coalescent in the same way as the sizes of connected components of the random graph are related to the multiplicative coalescent

O O O B I O B I O B O O O O O O B O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

hashing
linear probing
brownian excursion
coalescence
parking blocks


Fast broadcasting and gossiping in radio networks We establish an O -LRB- n log/sup 2 / n -RRB- upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology . This nearly matches the known lower bound of Omega -LRB- n log n -RRB- . The fastest previously known algorithm for this problem works in time O -LRB- n/sup 3/2 / -RRB- . Using our broadcasting algorithm , we develop an O -LRB- n/sup 3/2 / log/sup 2 / n -RRB- algorithm for gossiping in the same network model

B I O B O B I O O O O O O O O O O O B I O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O

fast broadcasting
upper bound
deterministic distributed broadcasting
gossiping
radio networks


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

O O O O O O O O B I O B O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O

syntenic distance
genomes
incomplete gossip problem
running time
chromosomes