name
stringlengths 7
10
| title
stringlengths 13
125
| abstract
stringlengths 67
3.02k
| fulltext
stringclasses 1
value | keywords
stringlengths 17
734
|
|---|---|---|---|---|
train_1749 | Advanced aerostatic stability analysis of cable-stayed bridges using | finite-element method Based on the concept of limit point instability, an advanced nonlinear finite-element method that can be used to analyze the aerostatic stability of cable-stayed bridges is proposed. Both geometric nonlinearity and three components of wind loads are considered in this method. The example bridge is the second Santou Bay cable-stayed bridge with a main span length of 518 m built in China. Aerostatic stability of the example bridge is investigated using linear and proposed methods. The effect of pitch moment coefficient on the aerostatic stability of the bridge has been studied. The results show that the aerostatic instability analyses of cable-stayed bridges based on the linear method considerably overestimate the wind-resisting capacity of cable-stayed bridges. The proposed method is highly accurate and efficient. Pitch moment coefficient has a major effect on the aerostatic stability of cable-stayed bridges. Finally, the aerostatic failure mechanism of cable-stayed bridges is explained by tracing the aerostatic instability path | advanced nonlinear finite element method;aerostatic failure mechanism;china;cable-stayed bridges;limit point instability;pitch moment coefficient;wind loads;santou bay cable-stayed bridge;geometric nonlinearity;advanced aerostatic stability analysis |
|
train_175 | Diagnostic expert system using non-monotonic reasoning | The objective of this work is to develop an expert system for cucumber disorder diagnosis using non-monotonic reasoning to handle the situation when the system cannot reach a conclusion. One reason for this situation is when the information is incomplete. Another reason is when the domain knowledge itself is incomplete. Another reason is when the information is inconsistent. This method maintains the truth of the system in case of changing a piece of information. The proposed method uses two types of non-monotonic reasoning namely: default reasoning and reasoning in the presence of inconsistent information to achieve its goal | default reasoning;inconsistent information;cucumber disorder diagnosis;diagnostic expert system;agriculture;incomplete information;truth maintenance;nonmonotonic reasoning |
|
train_1750 | A dynamic method for weighted linear least squares problems | A new method for solving the weighted linear least squares problems with full rank is proposed. Based on the theory of Liapunov's stability, the method associates a dynamic system with a weighted linear least squares problem, whose solution we are interested in and integrates the former numerically by an A-stable numerical method. The numerical tests suggest that the new method is more than comparative with current conventional techniques based on the normal equations | weighted linear least squares problems;dynamic method;a-stable numerical method;lyapunov stability |
|
train_1751 | An adaptive time step procedure for a parabolic problem with blow-up | In this paper we introduce and analyze a fully discrete approximation for a parabolic problem with a nonlinear boundary condition which implies that the solutions blow up in finite time. We use standard linear elements with mass lumping for the space variable. For the time discretization we write the problem in an equivalent form which is obtained by introducing an appropriate time re-scaling and then, we use explicit Runge-Kutta methods for this equivalent problem. In order to motivate our procedure we present it first in the case of a simple ordinary differential equation and show how the blow up time is approximated in this case. We obtain necessary and sufficient conditions for the blowup of the numerical solution and prove that the numerical blow-up time converges to the continuous one. We also study, for the explicit Euler approximation, the localization of blow-up points for the numerical scheme | parabolic problem;adaptive time step procedure;runge-kutta methods;explicit euler approximation;nonlinear boundary condition;fully discrete approximation;standard linear elements |
|
train_1752 | Non-nested multi-level solvers for finite element discretisations of mixed | problems We consider a general framework for analysing the convergence of multi-grid solvers applied to finite element discretisations of mixed problems, both of conforming and nonconforming type. As a basic new feature. our approach allows to use different finite element discretisations on each level of the multi-grid hierarchy. Thus, in our multi-level approach, accurate higher order finite element discretisations can be combined with fast multi-level solvers based on lower order (nonconforming) finite element discretisations. This leads to the design of efficient multi-level solvers for higher order finite element discretisations | higher order finite element discretisations;non-nested multi-level solvers;multi-level solvers;multi-grid solvers;finite element discretisations;mixed problems |
|
train_1753 | Risk theory with a nonlinear dividend barrier | In the framework of classical risk theory we investigate a surplus process in the presence of a nonlinear dividend barrier and derive equations for two characteristics of such a process, the probability of survival and the expected sum of discounted dividend payments. Number-theoretic solution techniques are developed for approximating these quantities and numerical illustrations are given for exponential claim sizes and a parabolic dividend barrier | number-theoretic solution;parabolic dividend barrier;risk theory;discounted dividend payments;exponential claim sizes;numerical illustrations;probability of survival;surplus process;nonlinear dividend barrier |
|
train_1754 | Coordination [crisis management] | Communications during a crisis, both internal and external, set the tone during response and carry a message through recovery. The authors describe how to set up a system for information coordination to make sure the right people get the right message, and the organization stays in control | information coordination;crisis management;communications process |
|
train_1755 | 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 | quadratic forms;differential operator;harmonic coefficients;symplectic theta functions;modular transformations;number fields;functional equation |
|
train_1756 | On the diophantine equation x/sup 2/+q/sup 2k+1/=y/sup n/ | In this paper it has been proved that if q is an odd prime, q not=7 (mod 8), n is an odd integer >or=5, n is not a multiple of 3 and (h, n)=1, where h is the class number of the filed Q( square root (-q)), then the diophantine equation x/sup 2/+q/sup 2k+1/=y/sup n/ has exactly two families of solutions (q, n, k, x, y) | primitive divisors;odd prime;odd integer;diophantine equation;lucas sequence |
|
train_1757 | Even unimodular Gaussian lattices of rank 12 | We classify even unimodular Gaussian lattices of rank 12, that is, even unimodular integral lattices of rank 12 over the ring of Gaussian integers. This is equivalent to the classification of the automorphisms tau with tau /sup 2/=-1 in the automorphism groups of all the Niemeier lattices, which are even unimodular (real) integral lattices of rank 24. There are 28 even unimodular Gaussian lattices of rank 12 up to equivalence | even unimodular integral lattices;automorphisms;gaussian integers;niemeier lattices;even unimodular gaussian lattices |
|
train_1758 | Hilbert modular threefolds of arithmetic genus one | D. Weisser (1981) 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 | galois cubic number fields;arithmetic genus one;hilbert modular threefolds |
|
train_1759 | 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 | lwasawa theory;elliptic curves;additive reduction;perrin-riou's theory;p-adic birch;p-adic l-functions;nonsemistable reduction;cotorsion;selmer group;swinnerton-dyer conjecture;cyclotomic z/sub p/-extension |
|
train_176 | Knowledge model reuse: therapy decision through specialisation of a generic | decision model We present the definition of the therapy decision task and its associated Heuristic Multi-Attribute (HM) solving method, in the form of a KADS-style specification. The goal of the therapy decision task is to identify the ideal therapy, for a given patient, in accordance with a set of objectives of a diverse nature constituting a global therapy-evaluation framework in which considerations such as patient preferences and quality-of-life results are integrated. We give a high-level overview of this task as a specialisation of the generic decision task, and additional decomposition methods for the subtasks involved. These subtasks possess some reflective capabilities for reasoning about self-models, particularly the learning subtask, which incrementally corrects and refines the model used to assess the effects of the therapies. This work illustrates the process of reuse in the framework of AI software development methodologies such as KADS-CommonKADS in order to obtain new (more specialised but still generic) components for the analysis libraries developed in this context. In order to maximise reuse benefits, where possible, the therapy decision task and HM method have been defined in terms of regular components from the earlier-mentioned libraries. To emphasise the importance of using a rigorous approach to the modelling of domain and method ontologies, we make extensive use of the semi-formal object-oriented analysis notation UML, together with its associated constraint language OCL, to illustrate the ontology of the decision method and the corresponding specific one of the therapy decision domain, the latter being a refinement via inheritance of the former | kads-style specification;generic decision model specialisation;global therapy-evaluation framework;heuristic multi-attribute solving method;therapy decision task;uml;reasoning;software development methodologies;commonkads;knowledge model reuse;constraint language;ontologies;patient preferences;object-oriented analysis notation;learning subtask;ocl |
|
train_1760 | Dihedral congruence primes and class fields of real quadratic fields | We show that for a real quadratic field F the dihedral congruence primes with respect to F for cusp forms of weight k and quadratic nebentypus are essentially the primes dividing expressions of the form epsilon /sub +//sup k-1/+or-1 where epsilon /sub +/ is a totally positive fundamental unit of F. This extends work of Hida. Our results allow us to identify a family of (ray) class fields of F which are generated by torsion points on modular abelian varieties | class field theory;quadratic nebentypus;dihedral congruence primes;class fields;real quadratic fields;torsion points;modular abelian varieties |
|
train_1761 | Superconvergence of discontinuous Galerkin method for nonstationary hyperbolic | equation For the first order nonstationary hyperbolic equation taking the piecewise linear discontinuous Galerkin solver, we prove that under the uniform rectangular partition, such a discontinuous solver, after postprocessing, can have two and half approximative order which is half order higher than the optimal estimate by P. Lesaint and P. Raviart (1974) under the rectangular partition | rectangular partition;piecewise linear discontinuous galerkin solver;nonstationary hyperbolic equation;approximative order;superconvergence of discontinuous galerkin method |
|
train_1762 | Laguerre pseudospectral method for nonlinear partial differential equations | The Laguerre Gauss-Radau interpolation is investigated. Some approximation results are obtained. As an example, the Laguerre pseudospectral scheme is constructed for the BBM equation. The stability and the convergence of proposed scheme are proved. The numerical results show the high accuracy of this approach | approximation results;nonlinear partial differential equations;nonlinear differential equations;numerical results;laguerre pseudospectral method;stability;laguerre gauss-radau interpolation;bbm equation |
|
train_1763 | Numerical studies of 2D free surface waves with fixed bottom | The motion of surface waves under the effect of bottom is a very interesting and challenging phenomenon in the nature. we use boundary integral method to compute and analyze this problem. In the linear analysis, the linearized equations have bounded error increase under some compatible conditions. This contributes to the cancellation of instable Kelvin-Helmholtz terms. Under the effect of bottom, the existence of equations is hard to determine, but given some limitations it proves true. These limitations are that the swing of interfaces should be small enough, and the distance between surface and bottom should be large enough. In order to maintain the stability of computation, some compatible relationship must be satisfied. In the numerical examples, the simulation of standing waves and breaking waves are calculated. And in the case of shallow bottom, we found that the behavior of waves are rather singular | numerical studies;linear analysis;boundary integral method;linearized equations;instable kelvin-helmholtz terms;2d free surface waves |
|
train_1764 | Two-scale curved element method for elliptic problems with small periodic | coefficients This paper is concerned with the second order elliptic problems with small periodic coefficients on a bounded domain with a curved boundary. A two-scale curved element method which couples linear elements and isoparametric elements is proposed. The error estimate is obtained over the given smooth domain. Furthermore an additive Schwarz method is provided for the isoparametric element method | two-scale curved element method;error estimate;linear elements;curved boundary;small periodic coefficients;additive schwarz method;bounded domain;second order elliptic problems;isoparametric element method;isoparametric elements;elliptic problems |
|
train_1765 | 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 | weakly translation invariance;oversampling property;interval band case;bandlimited scaling function |
|
train_1766 | A note on vector cascade algorithm | The focus of this paper is on the relationship between accuracy of multivariate refinable vector and vector cascade algorithm. We show that, if the vector cascade algorithm (1.5) with isotropic dilation converges to a vector-valued function with regularity, then the initial function must satisfy the Strang-Fix conditions | strang-fix conditions;multivariate refinable vector;vector cascade algorithm;isotropic dilation;vector-valued function;matrix algebra |
|
train_1767 | Bivariate fractal interpolation functions on rectangular domains | Non-tensor product bivariate fractal interpolation functions defined on gridded rectangular domains are constructed. Linear spaces consisting of these functions are introduced. The relevant Lagrange interpolation problem is discussed. A negative result about the existence of affine fractal interpolation functions defined on such domains is obtained | linear spaces;lagrange interpolation problem;rectangular domains;affine fractal interpolation functions;gridded rectangular domains;bivariate fractal interpolation functions |
|
train_1768 | Isogenous of the elliptic curves over the rationals | An elliptic curve is a pair (E, O), 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(Q)/sub tors/ be the torsion group of points of E defined over Q. The theorem of Mazur asserts that E(Q)/sub tors/ is one of the following 15 groups E(Q)/sub tors/ {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 (O) = O, where O is the point at infinity. We give an explicit model of all elliptic curves for which E(Q)/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 | smooth projective curve;mazur's theorem;elliptic curves isogenous;explicit model;rationals;weierstrass equation;cyclic kernels |
|
train_1769 | Transformation rules and strategies for functional-logic programs | This paper abstracts the contents of a PhD dissertation entitled 'Transformation Rules and Strategies for Functional-Logic Programs' which has been recently defended. These techniques are based on fold/unfold transformations and they can be used to optimize integrated (functional-logic) programs for a wide class of applications. Experimental results show that typical examples in the field of artificial intelligence are successfully enhanced by our transformation system SYNTH. The thesis presents the first approach of these methods for declarative languages that integrate the best features from functional and logic programming | experimental results;program transformation rules;declarative languages;functional programming;artificial intelligence;functional-logic programs;fold-unfold transformations;synth;logic programming |
|
train_177 | Turning telecommunications call details to churn prediction: a data mining | approach As deregulation, new technologies, and new competitors open up the mobile telecommunications industry, churn prediction and management has become of great concern to mobile service providers. A mobile service provider wishing to retain its subscribers needs to be able to predict which of them may be at-risk of changing services and will make those subscribers the focus of customer retention efforts. In response to the limitations of existing churn-prediction systems and the unavailability of customer demographics in the mobile telecommunications provider investigated, we propose, design, and experimentally evaluate a churn-prediction technique that predicts churning from subscriber contractual information and call pattern changes extracted from call details. This proposed technique is capable of identifying potential churners at the contract level for a specific prediction time-period. In addition, the proposed technique incorporates the multi-classifier class-combiner approach to address the challenge of a highly skewed class distribution between churners and non-churners. The empirical evaluation results suggest that the proposed call-behavior-based churn-prediction technique exhibits satisfactory predictive effectiveness when more recent call details are employed for the churn prediction model construction. Furthermore, the proposed technique is able to demonstrate satisfactory or reasonable predictive power within the one-month interval between model construction and churn prediction. Using a previous demographics-based churn-prediction system as a reference, the lift factors attained by our proposed technique appear largely satisfactory | mobile telecommunications industry;telecommunications call details;call pattern changes;lift factors;multi-classifier class-combiner approach;skewed class distribution;decision tree induction;customer demographics;customer retention efforts;deregulation;subscriber contractual information;mobile service providers |
|
train_1770 | New developments in inductive learning | Any intelligent system, whether natural or artificial, must have three characteristics: knowledge, reasoning, and learning. Artificial intelligence (AI) studies these three aspects in artificial systems. Briefly, we could say that knowledge refers to the system's world model, and reasoning to the manipulation of this knowledge. Learning is slightly more complex; the system interacts with the world and as a consequence it builds onto and modifies its knowledge. This process of self-building and self-modifying is known as learning. This thesis is set within the field of artificial intelligence and focuses on learning. More specifically, it deals with the inductive learning of decision trees | new developments;artificial intelligence;decision trees;reasoning;inductive learning;knowledge;intelligent system |
|
train_1771 | Quadratic Gauss sums over finite commutative rings | This article explicitly determines the quadratic Gauss sum over finite commutative rings | quadratic gauss sum;finite commutative rings |
|
train_1772 | The effects of technology on midcareer librarians | This article investigates technology competency requirements in the library profession. Using the position advertisements in American Libraries in five-year increments over a twenty-year period (1970-1990), the article examines and evaluates the advertised qualifications of positions and attempts to see if midcareer librarians-especially those who have achieved their degree prior to the change in MLS curriculum that currently emphasizes technology-are "effective" librarians in the present and future job market | job market;library profession;midcareer librarians;technology competency requirements |
|
train_1773 | Happily ever after: plateauing as a means for long-term career satisfaction | Little did I know when I attended Judith Bardwick's presentation on plateauing at the ALA annual convention in 1988 that it would turn out to be one of the most valuable sessions I would attend at any library conference, since it has enabled me to understand the phenomenon of plateauing and to use the strategies she suggested to rejuvenate my career and personal life continually. Key concepts and solutions from her book and from other literature on plateauing are summarized and examples given as to how I incorporated them into my life | long-term career satisfaction;librarians;personal life;plateauing |
|
train_1774 | A work journal [librarianship] | Keeping a work journal can be useful in exploring one's thoughts and feelings about work challenges and work decisions. It can help bring about greater fulfillment in one's work life by facilitating self-renewal, change, the search for new meaning, and job satisfaction. One example of a work journal which I kept in 1998 is considered. It touches on several issues of potential interest to midlife career librarians including the challenge of technology, returning to work at midlife after raising a family, further education, professional writing, and job exchange | change;work challenges;job satisfaction;technology;further education;self-renewal;work journal;job exchange;work decisions;professional writing;midlife career librarians |
|
train_1775 | Are we there yet?: facing the never-ending speed and change of technology in | midlife This essay is a personal reflection on entering librarianship in middle age at a time when the profession, like society in general, is experiencing rapidly accelerating change. Much of this change is due to the increased use of computers and information technologies in the library setting. These aids in the production, collection, storage, retrieval, and dissemination of the collective information, knowledge, and sometimes wisdom of the past and the contemporary world can exhilarate or burden depending on one's worldview, the organization, and the flexibility of the workplace. This writer finds herself working in a library where everyone is expected continually to explore and use new ways of working and providing library service to a campus and a wider community. No time is spent in reflecting on what was, but all efforts are to anticipate and prepare for what will be | dissemination;middle age;changing technology;collection;storage;computers;information technologies;librarianship;retrieval |
|
train_1776 | Job rotation in an academic library: damned if you do and damned if you don't! | This article considers job rotation-the systematic movement of employees from one job to another-as one of the many tools within the organizational development tool kit. There is a brief consideration of useful print and Internet literature on the subject as well as a discussion of the pros and cons of job rotation. The application of job rotation methods in Ryerson University Library, a small academic library, concludes the article in order to illustrate process and insights through example | ryerson university library;organizational development;systematic employee movement;job rotation;academic library |
|
train_1777 | 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 | productivity;technological changes;midlife career choices;libraries |
|
train_1778 | HeLIN pilot mentoring scheme | The health care libraries unit coordinates, facilitates, and promotes continuing personal development for all staff in the Health Libraries and Information Network (HeLIN) of the Oxford Deanery (UK). It supports the development of a culture of lifelong learning and recognizes that CPD should help deliver organizational objectives, as well as enabling all staff to expand and fulfill their potential. A major emphasis for 2000 was to investigate ways of improving support for individual learning within the workplace. The group identified a need to build on existing informal support networks in order to provide additional learning opportunities and decided to investigate the feasibility of piloting a mentoring scheme. The objectives of the pilot were to increase understanding and knowledge of mentoring as a tool for CPD; to investigate existing mentoring schemes and their applicability for HeLIN; to develop a pilot mentoring scheme for HeLIN incorporating a program for accreditation of mentors; and to evaluate the scheme and disseminate the results. In order to identify current practice in this area, a literature review was carried out, and colleagues with an interest in or existing knowledge of mentoring schemes were contacted where possible. In the absence of clearly defined appraisal tools, all abstracts were read, and articles that met the following criteria were obtained and distributed to the group for review | continuing personal development;health care libraries unit;midcareer librarians;helin pilot mentoring scheme;lifelong learning;accreditation;staff;literature review;health libraries and information network;informal support networks |
|
train_1779 | Maybe it's not too late to join the circus: books for midlife career management | Midcareer librarians looking for career management help on the bookshelf face thousands of choices. This article reviews thirteen popular career self-help books. The reviewed books cover various aspects of career management and provide information on which might be best suited for particular goals, including career change, career tune-up, and personal and professional self-evaluation. The comments reflect issues of interest to midcareer professionals | career change;midlife career management;libraries;librarians;personal self-evaluation;professional self-evaluation;career self-help books |
|
train_178 | A parallelized indexing method for large-scale case-based reasoning | Case-based reasoning (CBR) is a problem solving methodology commonly seen in artificial intelligence. It can correctly take advantage of the situations and methods in former cases to find out suitable solutions for new problems. CBR must accurately retrieve similar prior cases for getting a good performance. In the past, many researchers proposed useful technologies to handle this problem. However, the performance of retrieving similar cases may be greatly influenced by the number of cases. In this paper, the performance issue of large-scale CBR is discussed and a parallelized indexing architecture is then proposed for efficiently retrieving similar cases in large-scale CBR. Several algorithms for implementing the proposed architecture are also described. Some experiments are made and the results show the efficiency of the proposed method | bitwise indexing;problem solving methodology;performance;artificial intelligence;parallelized indexing method;similar prior case retrieval;large-scale case-based reasoning;experiments |
|
train_1780 | Migrating to public librarianship: depart on time to ensure a smooth flight | Career change can be a difficult, time-consuming, and anxiety-laden process for anyone contemplating this important decision. The challenges faced by librarians considering the move from academic to public librarianship can be equally and significantly demanding. To most outsiders, at least on the surface, it may appear to be a quick and easy transition to make, but some professional librarians recognize the distinct differences between these areas of librarianship. Although the ubiquitous nature of technology has brought the various work responsibilities of academic and public librarians closer together during the last decade, there remain key differences in job-related duties and the work environments. These dissimilarities pose meaningful hurdles to leap for academic librarians wishing to migrate to the public sector. The paper considers the variations between academic and public librarianship | public librarianship;career change;library technology;work environments;job-related duties;work responsibilities;public library;professional librarians;academic library |
|
train_1781 | 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 | job market;midcareer;continuing education;professional education;training;librarian;large university libraries;archival profession;work experience;personal skills;small college library;library profession;occupational development;career movement |
|
train_1782 | 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 (Montreal). 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" (Barner, 1994). 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 | sabbatical leave;career;midlife leave;library staff;librarians;professional growth |
|
train_1783 | 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 (1988) 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 | organization;transition stages;transition cycles model;social impact;psychological impact;job;chief librarian;academic library leadership |
|
train_1784 | 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. (June 2000, June 2001) | cyberethics bibliography;conference proceedings;special issues;2002 annual bibliography;journals;periodicals;recent books |
|
train_1785 | 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 | cognitive processing;male stereotypes;computer science degree;computer games;spatial learning;gender gap;computer industry;marketing;careers;female employees;computer literacy |
|
train_1786 | 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 | computer science students;student care;course performance data;humane tool;baylor university;regression study;computer science majors;sophomore year;computer science advisors;parents |
|
train_1787 | 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 | case study;industrial age;digital library;information society;social organization;information reversal theory;economic organization;information systems |
|
train_1788 | 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 (WTS) include strong authentication of a user, non-repudiation and encryption of all traffic. In this paper, we present an effective mechanism involving two different channels, which addresses the prime concerns involved in the security of electronic commerce transactions (ECT) viz. user authentication and non-repudiation. Although the product is primarily targeted to provide a fillip to transactions carried out over the Web, this product can also be effectively used for non-Internet transactions that are carried out where user authentication is required | nonrepudiation;information systems security;traffic;web transaction security;identity authentication systems;information systems development;encryption;electronic commerce transactions |
|
train_1789 | Dousing terrorist funding: mission possible? [banks] | 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 | patriot act;identification;terrorist funding;banking |
|
train_179 | 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 (CBR) technique for the effective reuse of design outputs. A repository is proposed to support this CBR process. A real-life case is illustrated to demonstrate the usefulness of our approach | information assets;design output reuse;business process analysis;company;case-based reasoning;document-based workflow modeling |
|
train_1790 | 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 | internet;fair use;copyright protection;copyright infringement;copyrighted work;electronic environment;electronic publishing copyright |
|
train_1791 | 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 (UHIMI) 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 (i) what is meant by "on-line learning" in the UHIMI context (ii) the theories of learning and teaching and principles of course design that inform the staff development programme and (iii) a review of progress to date | internet;staff development;computer-aided learning;university of the highlands and islands project;distance education;technical support;online learning;pedagogy;resource-based learning;educational course design;teaching |
|
train_1792 | 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 | information accessibility;resource sharing;database technology;managerial issues;digital library projects;interoperability;metadata;digital libraries;data quality;user interface;end users;query processing |
|
train_1793 | The paradigm of viral communication | The IIW Institute of Information Management (www.IIW.de) is dealing with commercial applications of digital technologies, such as the Internet, digital printing, and many more. A study which has been carried out by the institute, identifies viral messages as a new paradigm of communication, mostly found in the area of Direct Marketing, and - who wonders - mainly within the USA. Viral messages underlie certain principles: (1) prospects and customers of the idea are offered a technology platform providing a possibility to send a message to a majority of persons; (2) there is an emotional or pecuniary incentive to participate. Ideally, niches of needs and market vacua are filled with funny ideas; (3) also, the recipients are facing emotional or pecuniary incentives to contact a majority of further recipients - this induces a snowball effect and the message is spread virally; and (4) the customer is activated as an "ambassador" of the piece of information, for instance promoting a product or a company. It is evident that there has been a long lasting history of what we call "word-of-mouth" ever since, however bundles of digital technologies empower the viral communication paradigm | internet;commercial applications;viral messages;computer virus;direct marketing;e-mails;business;viral communication paradigm |
|
train_1794 | 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 (TV) 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 | linear smoothing;image denoising;nonlinear iterative smoothing filter;causality;image restoration problem;selective smoothing;total variation functional;higher time discretisation steps;cfl condition;well-posed anisotropic diffusion;random gaussian noise;second-order partial differential equation;discrete scheme |
|
train_1795 | New voice over Internet protocol technique with hierarchical data security | protection The authors propose a voice over Internet protocol (VoIP) technique with a new hierarchical data security protection (HDSP) 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 | random bit-string sequence;voip;software simulation;hdsp scheme;packet loss;voice over internet protocol;packet voice communications;chaotic system;statistical measures;hierarchical data security protection;data encryption;high data security;data interleaving |
|
train_1796 | 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 | frequency response;2d fir digital differentiators;2d finite difference approximation;magnitude response;fir digital filters;taylor series;maximally linear digital differentiators;nyquist frequencies;two-dimensional digital differentiators |
|
train_1797 | 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 (EKF) algorithm conjunct with a pruning method is used to train the network. The corresponding networks are applied to solve five typical problems, namely, 4-point XOR logic function, parity generation, handwritten digit recognition, piecewise linear function approximation and sunspot series prediction. Simulation results show that periodic activation functions perform better than monotonic ones in solving multicluster classification problems. Moreover, the combined periodic activation function is found to possess the fast convergence and multicluster classification capabilities of the sinusoidal activation function while keeping the robustness property of the sigmoid function required in the modelling of unknown systems | sigmoid function;handwritten digit recognition;pruning performance;ekf algorithm;sunspot series prediction;parity generation;periodic activation functions;4-point xor logic function;convergence;multilayer feedforward neural networks;neuronal activation functions;piecewise linear function approximation;sinusoidal function;multicluster classification problems;monotonic activation functions;extended kalman filter algorithm |
|
train_1798 | 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 (MRAN) 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 (1997) have proposed a maximum signal to distortion ratio (MSDR) 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 (SDRs) | minimal resource allocation network;rbf neural network;disc storage systems;digital magnetic recording;jitter noise;nonlinear-data-storage-channel equalisation;highly nonlinear distortions;data-dependent noise;highly nonlinear magnetic recording channels;mran equaliser;msdr equaliser;robustness evaluation;maximum signal to distortion ratio equaliser |
|
train_1799 | 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 (CC-CMA) 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 (2000). Simulation studies are undertaken to support the analysis | energy preservation approach;constant modulus algorithm;multi-input multi-output system;joint blind equalisation;cross-correlation;cc-cma;noise-free environment;mimo convolutive system;steady-state mean-square error analysis;source separation |
|
train_18 | Differential and integral calculus on discrete time series data | It has been found that discontinuity plays a crucial role in natural evolutions (Lin 1998). 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 | integration;time series;prediction;outliers;differentiation;natural evolutions |
|
train_180 | 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 | benefits;risks;pda;mobile technology |
|
train_1800 | 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 (LROLS) algorithm is proposed for constructing sparse multi-output regression models that generalise well. By associating each regressor in the regression model with an individual regularisation parameter, the ability of the multi-output orthogonal least-squares (OLS) model selection to produce a parsimonious model with a good generalisation performance is greatly enhanced | data modelling;multi-output regression models;parsimonious model;sparse multi-output regression models;lrols algorithm;nonlinear system modelling;locally regularised orthogonal least-squares algorithm |
|
train_1801 | 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 | internet;parallel web server nodes;world wide web server;random dispatching algorithms;throughput;nasa access logs;round-robin dispatching algorithms;transfer time;clarknet access logs;least load dispatching algorithm |
|
train_1802 | Novel TCP congestion control scheme and its performance evaluation | A novel self-tuning proportional and derivative (ST-PD) 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 | tcp congestion control scheme;buffer occupancy;connection path;performance evaluation;lossy links;control-theoretical perspective;self-tuning proportional-derivative control;bandwidth-delay product;fuzzy logic controller;bottleneck node;pd controller |
|
train_1803 | 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 | cryptographic applications;linear complexity;linear feedback shift registers;polynomials;quadratic residue sequences;key stream ciphers;binary sequences;binary legendre sequences;multiple-valued case;p-phase sequences;polyphase power residue sequences |
|
train_1804 | 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 (e.g. silicon area, interconnection length, etc.) is optimised. To shorten connections between inputs and outputs and/or make related modules adjacent, it is desired to place some modules along the specific boundaries of a chip. To deal with such boundary constraints, we explore the feasibility conditions of a B*-tree with boundary constraints and develop a simulated annealing-based algorithm using B*-trees. Unlike most previous work, the proposed algorithm guarantees a feasible B*-tree with boundary constraints for each perturbation. Experimental results show that the algorithm can obtain a smaller silicon area than the most recent work based on sequence pairs | boundary constraints;silicon area;logic module placement;interconnection length;b*-tree;simulated annealing algorithm |
|
train_1805 | Exact analytical model for the AEP of control signals | An exact analytical model for the aliasing error probability (AEP) 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 (TICM), 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 (hardware) 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 | control signals;signature analyser;binary stream;motherboard vlsi design;high-impedance state;flexible geometry;aep;analytical model;two-input shift registers;two-input compacting module;control stream error probabilities;test pattern length;aliasing error probability;signature analysis |
|
train_1806 | 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 | resource folding;memory requirement;wordlengths;final chip area;constant multiplications;multiplierless realisation;linear dsp transforms;pseudopolynomial run-time |
|
train_1807 | 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 | optimal control;target subregion;minimum energy;regional flux target;parabolic system domain boundary;regional boundary gradient target;numerical algorithm;gradient controllability problem |
|
train_1808 | 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 | eigenvalue functions;gain functions;regressors;nonlinearity estimation;nonlinearity representation;nonlinear autoregressive exogenous-input polynomial model;grey-box identification problems;narx polynomial model nonlinearities |
|
train_1809 | 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 | recurrent neural network;linear matrix inequality problem;piecewise interpolation;multilayer feedforward neural networks;linear differential inclusion model;lmi;linear state feedback;nonlinear uncertain systems;adaptive neural net-based h/sub infinity / control design;control gain matrices |
|
train_181 | Electromagnetics computations using the MPI parallel implementation of the | steepest descent fast multipole method (SDFMM) 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 (message passing interface) parallel implementation of the steepest descent fast multipole method (SDFMM). 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 (1) filling the sparse impedance matrix associated with the near-field method of moments interactions (MoM), (2) the matrix vector multiplications associated with this sparse matrix and (3) 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 | 4-processor alpha workstation;method of moments;steepest descent fast multipole method;electromagnetics computations;scattering problems;2 gbyte;667 mhz;xeon shared memory processor;scattered magnetic field;large-scale linear systems;450 mhz;multiple processors;message passing interface;mpi parallel implementation;matrix vector multiplications;intel pentium ii;ram;intel pentium beowulf cluster;350 mhz;near-field mom;sparse impedance matrix;scattered electric field;fast algorithms;physics;100 basetx ethernet network;256 mbyte |
|
train_1810 | 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 | i/o-based pole-placement controller;and external point delays;infinite spectrum assignment;finite spectrum assignment;controller synthesis;filtering;computational cost;internal point delays;siso plants;point-delayed signals;input-output based pole-placement controller;time-delay systems |
|
train_1811 | 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 | adaptive tracking controller design;approximation errors;closed-loop system;lyapunov theory;six-link robot manipulator;gaussian wavelet networks;accurate approximation capability;robotic systems;unknown dynamics;robust control law;adaptive learning algorithm |
|
train_1812 | 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 (maxi-mini) 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 | line segment;frequency response;robustness analysis;nichols-plot;frequency-domain design methods;arc;robustness design;bode-plot;uncertain parameters;one-dimensional edge plants;affine systems;nyquist-plot |
|
train_1813 | 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 (LMIs) 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 | guaranteed stability;design methodology;lmi approach;digital redesign;crane system;linear matrix inequalities;continuous-time system;position control;linear time-invariant systems;closed-loop stability;numerical optimisation technique |
|
train_1814 | Control of integral processes with dead-time. 2. Quantitative analysis | For part 1, see ibid., p.285-90, (2002). 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: (normalised) maximum dynamic error, maximum decay rate, (normalised) control action bound and approximate recovery time are used to characterise the step-disturbance response. It is shown that any attempt to obtain a (normalised) dynamic error less than tau /sub m/ is impossible and a sufficient condition on the (relative) gain-uncertainty bound is square root (3)/2 | gain-uncertainty bound;maximum dynamic error;step-disturbance response;robustness;sufficient condition;maximum decay rate;approximate recovery time;integral processes;dead-time;robust stability regions;disturbance response;control action bound;quantitative analysis |
|
train_1815 | Control of integral processes with dead-time. 1. Disturbance observer-based 2 | DOF control scheme A disturbance observer-based control scheme (a version of 2 DOF internal model control) 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 (so far) using some simulation examples | time constant;robustness;integral processes;dead-time;disturbance response;2 dof internal model control;disturbance observer-based 2 dof control scheme;set-point response;ramp disturbances rejection |
|
train_1816 | Hamiltonian modelling and nonlinear disturbance attenuation control of TCSC for | improving power system stability To tackle the obstacle of applying passivity-based control (PBC) 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 (PCHD) model of a thyristor controlled serial compensator (TCSC) 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 | passivity-based control;nonlinear disturbance attenuation control;power system stability;nonlinear adaptive l/sub 2/ gain control method;thyristor controlled serial compensator;hamiltonian modelling;parametric perturbations;pre-feedback method;hamiltonian function;port controlled hamiltonian with dissipation model;affine nonlinear system;storage function |
|
train_1817 | Nonlinear adaptive control via sliding-mode state and perturbation observer | The paper presents a nonlinear adaptive controller (NAC) 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 (FLC). Simulation study is carried out based on a single-generator infinite-bus power system to show the performance of the controller/observer system | synchronous generator control;external disturbances;sliding-mode state observer;flc;siso feedback linearisable nonlinear systems;single-generator infinite-bus power system;convergence;perturbation observer;unmodelled system dynamics;parameter uncertainties;nac;nonlinear adaptive control;state-feedback linearising controller |
|
train_1818 | 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 | sustained disturbances;continuous chemical reactors;closed-loop system;noise measurements;robust control law synthesis;sliding-mode uncertainty estimator;relative-degree-one nonlinear systems;averaging techniques;closed-loop stability;sliding-mode control scheme;algebraic-differential concepts;model uncertainties |
|
train_1819 | 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 | observability;controllability;structural interpretation;sampled-data loops;closed-loop system;state-space formulation;digital simulations;time-domain properties;continuous-time systems;hold-equivalent discrete-time model;matched pole-zero discretisation |
|
train_182 | 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 (n<m), 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 [42] 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( beta -1-log beta ) 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(m) and m-B/sub 1//sup m,l/=o(m). 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 | brownian excursion;hashing;parking blocks;linear probing;coalescence;empirical processes |
|
train_1820 | Fast, accurate and stable simulation of power electronic systems using virtual | resistors and capacitors Simulation of power electronic circuits remains a problem due to the high level of stiffness brought about by the modelling of switches as biresistors i.e. very low turn-on resistance and very high turn-off resistance. The merits and drawbacks of two modelling methods that address this problem are discussed. A modelling solution for ensuring numerically stable, accurate and fast simulation of power electronic systems is proposed. The solution enables easy connectivity between power electronic elements in the simulation model. It involves the modelling of virtual capacitance at switching nodes to soften voltage discontinuity due to the switch current suddenly going to zero. Undesirable ringing effects that may arise due to the interaction between the virtual capacitance and circuit inductance are eliminated by modelling virtual damping resistors in parallel to inductors that are adjacent to switching elements. A midpoint configuration method is also introduced for modelling shunt capacitors. A DC traction system is simulated using this modelling strategy and the results are included. Simulation results obtained using this modelling strategy are validated by comparison with the established mesh analysis technique of modelling. The simulation performance is also compared with the Power System Blockset commercial software | voltage discontinuity softening;virtual resistors;ringing effects;computer simulation;turn-on resistance;switching nodes;dc traction system;high turn-off resistance;power electronic systems simulation;power system blockset software;mesh analysis technique;virtual capacitors;switch modelling |
|
train_1821 | Performance, design and control of a series-parallel (CL/sup 2/-type) resonant | DC/DC converter The three-element resonant network has various topological alternatives, one of which, a prospective compound topology, is investigated in detail. The converter uses one capacitor (C) and two inductors (L/sup 2/), to form a compound type CL/sup 2/ network. Various advantages and limitations of the converter are detailed, and a new design procedure for such converters is also introduced. The converter may be controlled by varying the switching frequency or by pulse-width modulation. An experimental prototype has been produced and an excellent performance in the lagging power-factor mode has been confirmed | performance;inductors;design procedure;three-element resonant network;series-parallel resonant dc/dc power converter;lagging power factor mode;capacitor;switching frequency;pulse-width modulation |
|
train_1822 | 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 | dc link voltage regulator;sinusoidal line current;line current command tracking;harmonic currents elimination;hysteresis current control scheme;neutral point switch clamped scheme;current distortion;circuit configuration;power switches control signals;pwm control schemes;dc link voltage balance compensator;line current controller;single-phase half-bridge rectifier topology;power quality compensation |
|
train_1823 | 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 | instantaneous harmonic current components compensation;signal processing technique;simulation;adaptive neural network algorithm;harmonic detection;instantaneous harmonic components;nonlinear current loads;single-phase shunt active power filter |
|
train_1824 | Parallel operation of capacity-limited three-phase four-wire active power | filters Three-phase four-wire active power filters (APFs) are presented that can be paralleled to enlarge the system capacity and reliability. The APF employs the PWM four-leg voltage-source inverter. A decoupling control approach for the leg connected to the neutral line is proposed such that the switching of all legs has no interaction. Functions of the proposed APF include compensation of reactive power, harmonic current, unbalanced power and zero-sequence current of the load. The objective is to achieve unity power factor, balanced line current and zero neutral-line current. Compensation of all components is capacity-limited, co-operating with the cascaded load current sensing scheme. Multiple APFs can be paralleled to share the load power without requiring any control interconnection. In addition to providing the theoretic bases and detailed design of the APFs, two 6 kVA APFs are implemented. The effectiveness of the proposed method is validated with experimental results | 6 kva;unbalanced power compensation;zero neutral-line current;decoupling control approach;zero-sequence load current compensation;capacity-limited three-phase four-wire active power filters;parallel operation;control design;leg switching;reactive power compensation;pwm four-leg voltage-source inverter;control performance;balanced line current;harmonic current compensation;load power sharing;unity power factor |
|
train_1825 | Fuzzy logic controlled shunt active power filter for power quality improvement | The simulation and experimental study of a fuzzy logic controlled, three-phase shunt active power filter to improve power quality by compensating harmonics and reactive power required by a nonlinear load is presented. The advantage of fuzzy control is that it is based on a linguistic description and does not require a mathematical model of the system. The fuzzy control scheme is realised on an inexpensive dedicated micro-controller (INTEL 8031) based system. The compensation process is based on sensing line currents only, an approach different from conventional methods, which require harmonics or reactive volt-ampere requirement of the load. The performance of the fuzzy logic controller is compared with a conventional PI controller. The dynamic behavior of the fuzzy controller is found to be better than the conventional PI controller. PWM pattern generation is based on carrierless hysteresis based current control to obtain the switching signals. Various simulation and experimental results are presented under steady state and transient conditions | switching signals;pwm pattern generation;carrierless hysteresis based current control;micro-controller;three-phase shunt active power filter;power quality improvement;reactive power compensation;fuzzy logic control simulation;control performance;harmonics compensation;nonlinear load |
|
train_1826 | 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 (1) 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; (2) it provides a compact representation in terms of size; (3) it contains a subset of three-dimensional points that optimally quantify the densities of medium resolution data; and (4) a general model of the geometry and topology of the macromolecule (as opposite to a spatially unrelated bunch of voxels) is easily obtained by the use of the alpha shapes theory | vector quantization algorithm;probability density function;database framework;biological macromolecules;three-dimensional points;cavities;connectivity;channels;compact representation;low-resolution density maps;volumetric datasets;biological structures;general model;medium resolution data;data representation;structural features;geometry;topology;original volume data;alpha shapes theory;modeling |
|
train_1827 | 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(2/sup O(n log n)/) algorithm to exactly compute the syntenic distance between two genomes with at most n chromosomes each. Our algorithm requires O(n/sup 2/+2/sup O(d log d)/) time when this distance is d, improving the O(n/sup 2/+2(O(d//sup 2/))) running time of the best previous exact algorithm | comparative genomics;running time;incomplete gossip problem;genomes;chromosomes;syntenic distance;np-hard |
|
train_1828 | Exploiting structure in quantified formulas | We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based on any commutative monoid, the "quantifiers" need only satisfy two simple conditions, and the variables can have any finite domain. This problem is a generalization of the problem "given a sum-of-products of terms, find the value of the sum" studied by R.E. Stearns and H.B. Hunt III (1996). A data structure called a "structure tree" is defined which displays information about "subproblems" that can be solved independently during the process of evaluating the formula. Some formulas have "good" structure trees which enable certain generic algorithms to evaluate the formulas in significantly less time than by brute force evaluation. By "generic algorithm," we mean an algorithm constructed from uninterpreted function symbols, quantifier symbols, and monoid operations. The algebraic nature of the model facilitates a formal treatment of "local reductions" based on the "local replacement" of terms. Such local reductions "preserve formula structure" in the sense that structure trees with nice properties transform into structure trees with similar properties. These local reductions can also be used to transform hierarchical specified problems with useful structure into hierarchically specified problems having similar structure | satisfiability problems;data structure;generic algorithms;structure tree;quantified formulas;hierarchically specified problems;monoid operations;commutative monoid;computational complexity;dynamic programming;quantifier symbols;function symbols;constraint satisfaction problems;structure exploitation |
|
train_1829 | 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 (1995), 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 | computer assisted analysis;bounded degree graph;2-regular graphs;best approximation ratio;approximation ratio;semidefinite relaxation;max-cut approximation |
|
train_183 | Asymptotic analysis of (3, 2, 1)-Shell Sort | We analyze the (3, 2, 1)-Shell Sort algorithm under the usual random permutation model | algorithm;local limit theorem;moderate-sized lists;additive functional;asymptotic analysis;markov chain;random permutation;sorting;shell sort;poissonization |
|
train_1830 | 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 | path decomposition;polynomial time algorithm;outerplanar graphs;biconnected outerplanar graph;pathwidth approximation |
|
train_1831 | Fast broadcasting and gossiping in radio networks | We establish an O(n log/sup 2/ n) 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 (n log n). The fastest previously known algorithm for this problem works in time O(n/sup 3/2/). Using our broadcasting algorithm, we develop an O(n/sup 3/2/ log/sup 2/ n) algorithm for gossiping in the same network model | fast broadcasting;upper bound;deterministic distributed broadcasting;radio networks;gossiping |
|
train_1832 | A linear time algorithm for recognizing regular Boolean functions | A positive (or monotone) 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(f) (the set of all minimal true vectors of f). We propose a simple linear time (i.e., O(n|min T(f)|)-time) algorithm for it. This improves upon the previous algorithm by J.S. Provan and M.O. Ball (1988) which requires O(n/sup 2/|min T(f)|) time. As a corollary, we also present an O(n(n+|min T(f)|))-time algorithm for the recognition problem of 2-monotonic functions | true vector;monotone boolean function;linear time algorithm;regular boolean functions;positive function;2-monotonic functions;nonzero component |
|
train_1833 | 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 (IDeA), is also overseeing the development and maintenance of a National Land and Property Gazetteer (NLPG) 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 | public rights of way;property information;local authorities;national cadastral service;land information systems;land information;street gazetteer;uk;national land and property gazetteer;addressing standard;property gazetteer;nlpg;idea;united kingdom;land gazetteer;address datasets;property datasets;improvement and development agency;addresses;national framework;geocoding;property registration system;british standard 7666 |
|
train_1834 | A formal model of correctness in a cadastre | A key issue for cadastral systems is the maintenance of their correctness. Correctness is defined to be the proper correspondence between the valid legal situation and the content of the cadastre. This correspondence is generally difficult to achieve, since the cadastre is not a complete representation of all aspects influencing the legal situation in reality. The goal of the paper is to develop a formal model comprising representations of the cadastre and of reality that allows the simulation and investigation of cases where this correspondence is potentially violated. For this purpose the model consists of two parts, the first part represents the valid legal situation and the second part represents the cadastre. This makes it feasible to mark the differences between reality and the cadastre. The marking together with the two parts of the model facilitate the discussion of issues in "real-world" cadastral systems where incorrectness occurs. In order to develop a formal model, the paper uses the transfer of ownership of a parcel between two persons as minimal case study. The foundation for the formalization is a modern version of the situation calculus. The focus moves from the analysis of the cadastre to the preparation of a conceptual and a formalized model and the implementation of a prototype | situation calculus;formalized model;formal model;minimal case study;formal correctness model;transfer of ownership;legal situation;cadastre;cadastral systems;correctness maintenance |
|
train_1835 | Establishing an urban digital cadastre: analytical reconstruction of parcel | boundaries A new method for generating a spatially accurate, legally supportive and operationally efficient cadastral database of the urban cadastral reality is described. The definition and compilation of an accurate cadastral database (achieving a standard deviation smaller than 0.1 m) is based on an analytical reconstruction of cadastral boundaries rather than on the conventional field reconstruction process. The new method is based on GPS control points and traverse networks for providing the framework; the old field books for defining the links between the various original ground features; and a geometrical and cadastral adjustment process as the conceptual basis. A pilot project that was carried out in order to examine and evaluate the new method is described | land information systems;cadastral adjustment process;lis;geographic information systems;field reconstruction process;parcel boundaries;analytical reconstruction;spatially accurate cadastral database;urban digital cadastre;urban cadastral reality;old field books;standard deviation;traverse networks;gps control points;ground features |
|
train_1836 | Parcel boundary identification with computer-assisted boundary overlay process | for Taiwan The study investigates the design of a process for parcel boundary identification with cadastral map overlay using the principle of least squares. The objective of this research is to provide an objective tool for boundary identification survey. The proposed process includes an adjustment model, a weighting scheme, and other related operations. A numerical example is included | weighted least squares adjustment;objective tool;boundary identification survey;gauss-marker model;cadastral map overlay;taiwan;computer assisted boundary overlay process;parcel boundary identification;adjustment model;weighting scheme;geographic information system |
|
train_1837 | 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 | case study;political aspects;economic conditions;economic aspects;geodetic survey profession;social sciences;cadastre;land registration;cadastral development methodologies;research methodologies;geodetic surveyors |
|
train_1838 | Anticipating the further development of cadastral systems | Although the paper recognises the merits of the evolution of cadastral systems towards an increased capability over time, it promotes a radical introduction or overhaul of existing cadastral systems. It encourages the development of a capability to cope with some key drivers of major change. These have been identified as globalisation, the advent of fully automated cadastral environments, improved decentralised methods of governance and greatly improved service delivery of future cadastral systems to a wide range of users. The paper promotes the registration of title supported by government guarantee as an effective means for rapidly introducing cadastral systems to facilitate globally competitive land markets in developing countries. In developing automated environments for cadastral systems, the need to completely re-engineer and redesign cadastral systems to meet basic cadastral principles and responsiveness to individual user needs is promoted. In this environment, highly decentralised cadastral operations and administration combined with light regulatory control are advocated as a future governance strategy. With regard to the level of services to users, an emphasis on recognising and serving the future needs of users is seen as essential. International and national professional and user organisations involved in land administration are seen as an important vehicle for developing strategies and providing evaluation to guide the over-arching development of cadastral systems around the world | user needs;decentralised governance;user organisations;future governance strategy;light regulatory control;developing countries;land administration;cadastral systems development;future user needs;cadastral principles;professional organisations;service delivery;automated environments;globally competitive land markets;highly decentralised cadastral operations;government guarantee;globalisation;automated cadastral environments |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.