A comparison of different decision algorithms used in volumetric storm cells classification Decision algorithms useful in classifying meteorological volumetric radar data are discussed . Such data come from the radar decision support system -LRB- RDSS -RRB- database of Environment Canada and concern summer storms created in this country . Some research groups used the data completed by RDSS for verifying the utility of chosen methods in volumetric storm cells classification . The paper consists of a review of experiments that were made on the data from RDSS database of Environment Canada and presents the quality of particular classifiers . The classification accuracy coefficient is used to express the quality . For five research groups that led their experiments in a similar way it was possible to compare received outputs . Experiments showed that the support vector machine -LRB- SVM -RRB- method and rough set algorithms which use object oriented reducts for rule generation to classify volumetric storm data perform better than other classifiers

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

decision algorithms
volumetric storm cells classification
meteorological volumetric radar data
radar decision support system
summer storms
classification accuracy
support vector machine
rough set algorithms
object oriented reducts


Asymptotical stability in discrete-time neural networks In this work , we present a proof of the existence of a fixed point and a generalized sufficient condition that guarantees the stability of it in discrete-time neural networks by using the Lyapunov function method . We also show that for both symmetric and asymmetric connections , the unique attractor is a fixed point when several conditions are satisfied . This is an extended result of Chen and Aihara -LRB- see Physica D , vol . 104 , no. 3/4 , p. 286-325 , 1997 -RRB- . In particular , we further study the stability of equilibrium in discrete-time neural networks with the connection weight matrix in form of an interval matrix . Finally , several examples are shown to illustrate and reinforce our theory

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

asymptotical stability
fixed point
lyapunov function method
asymmetric connections
unique attractor
stability
connection weight matrix
interval matrix
generalized sufficient condition

symmetric connections
equilibrium stability
discrete-time neural networks


Dynamic modification of object Petri nets . An application to modelling protocols with fork-join structures In this paper we discuss possibilities of modelling protocols by objects in object-based high-level Petri nets . Some advantages of dynamically modifying the structure of token objects are discussed and the need for further investigations into mathematically rigorous foundations of object net formalisms incorporating facilities for such operations on its token nets is emphasised

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

dynamic modification
object petri nets
protocols
token objects
mathematically rigorous foundations
object net formalisms


A new result on the global convergence of Hopfield neural networks In this work , we discuss Hopfield neural networks , investigating their global stability . Some sufficient conditions for a class of Hopfield neural networks to be globally stable and globally exponentially stable are given

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

hopfield neural networks
global stability
sufficient conditions


A new architecture for implementing pipelined FIR ADF based on classification of coefficients In this paper , we propose a new method for implementing pipelined finite-impulse response -LRB- FIR -RRB- adaptive digital filter -LRB- ADF -RRB- , with an aim of reducing the maximum delay of the filtering portion of conventional delayed least mean square -LRB- DLMS -RRB- pipelined ADF . We achieve a filtering section with a maximum delay of one by simplifying a pre-upsampled and a post-downsampled FIR filter using the concept of classification of coefficients . This reduction is independent of the order of the filter , which is an advantage when the order of the filter is very large , and as a result the method can also be applied to infinite impulse response -LRB- IIR -RRB- filters . Furthermore , when the proposed method is compared with the transpose ADF , which has a filtering section with zero delay , it is realized that it significantly reduces the maximum delay associated with updating the coefficients of FIR ADF . The effect of this is that , the proposed method exhibits a higher convergence speed in comparison to the transpose FIR ADF

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

pipelined fir adf
adaptive digital filter
maximum delay
convergence speed

coefficient classification
delayed least mean square filter
pre-upsampled filter
post-downsampled filter


Application of XML for neural network exchange This article introduces a framework for the interchange of trained neural network models . An XML-based language -LRB- Neural Network Markup Language -RRB- for the neural network model description is offered . It allows to write down all the components of neural network model which are necessary for its reproduction . We propose to use XML notation for the full description of neural models , including data dictionary , properties of training sample , preprocessing methods , details of network structure and parameters and methods for network output interpretation

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

xml
neural network exchange
neural network markup language
data dictionary
preprocessing methods
network structure
network output interpretation


Optimization of requantization parameter for MPEG transcoding This paper considers transcoding in which an MPEG stream is converted to a low-bit-rate MPEG stream , and proposes a method in which the transcoding error can be reduced by optimally selecting the quantization parameter for each macroblock . In transcoding with a low compression ratio , it is crucial to prohibit transcoding with a requantization parameter which is 1 to 2 times the quantization parameter of the input stream . Consequently , as the first step , an optimization method for the requantization parameter is proposed which cares for the error propagation effect by interframe prediction . Then , the proposed optimization method is extended so that the method can also be applied to the case of a high compression ratio in which the rate-distortion curve is approximated for each macroblock in the range of requantization parameters larger than 2 times the quantization parameter . It is verified by a simulation experiment that the PSNR is improved by 0.5 to 0.8 dB compared to the case in which a 6 Mbit/s MPEG stream is not optimized by twofold recompression

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

transcoding error
macroblock
compression ratio
error propagation effect
interframe prediction
psnr
simulation
twofold recompression

requantization parameter optimization
low-bit-rate mpeg stream
rate-distortion curve
rate conversion
rate control
6 mbit/s


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

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

mss architecture
timing properties
composable architecture
petri nets
proof of composability


Global action rules in distributed knowledge systems Previously Z. Ras and J.M. Zytkow -LRB- 2000 -RRB- introduced and investigated query answering system based on distributed knowledge mining . The notion of an action rule was introduced by Z. Ras and A. Wieczorkowska -LRB- 2000 -RRB- and its application domain e-business was taken . In this paper , we generalize the notion of action rules in a similar way to handling global queries . Mainly , when values of attributes for a given customer , used in action rules , can not be easily changed by business user , definitions of these attributes are extracted from other sites of a distributed knowledge system . To be more precise , attributes at every site of a distributed knowledge system are divided into two sets : stable and flexible . Values of flexible attributes , for a given consumer , sometime can be changed and this change can be influenced and controlled by a business user . However , some of these changes -LRB- for instance to the attribute `` profit ' -RRB- can not be done directly to a chosen attribute . In this case , definitions of such an attribute in terms of other attributes have to be learned . These new definitions are used to construct action rules showing what changes in values of flexible attributes , for a given consumer , are needed in order to re-classify this consumer the way business user wants . But , business user may be either unable or unwilling to proceed with actions leading to such changes . In all such cases we may search for definitions of these flexible attributes looking at either local or remote sites for help

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

global action rules
query answering system
action rules
attributes
distributed knowledge mining


Minimizing the number of successor states in the stubborn set method Combinatorial explosion which occurs in parallel compositions of LTSs can be alleviated by letting the stubborn set method construct on-the-fly a reduced LTS that is CFFD - or CSP-equivalent to the actual parallel composition . This article considers the problem of minimizing the number of successor states of a given state in the reduced LTS . The problem can be solved by constructing an and/or-graph with weighted vertices and by finding a set of vertices that satisfies a certain constraint such that no set of vertices satisfying the constraint has a smaller sum of weights . Without weights , the and/or-graph can be constructed in low-degree polynomial time w.r.t. the length of the input of the problem . However , since actions can be nondeterministic and transitions can share target states , it is not known whether the weights are generally computable in polynomial time . Consequently , it is an open problem whether minimizing the number of successor states is as `` easy '' as minimizing the number of successor transitions

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

stubborn set method
combinatorial explosion
weighted vertices

low-degree polynomial time
csp-equivalence


Estimation of the vanishing point for automatic driving system using a cross ratio This paper proposes a new method to estimate the vanishing point used as the vehicle heading , which is essential in automatic driving systems . The proposed method uses a cross ratio comprised of a ratio of lengths from four collinear points for extracting the edges that shape the vanishing point . Then , lines that intersect at one point are fitted to the edges in a Hough space . Consequently , the vanishing point is estimated robustly even when the lane markings are occluded by other vehicles . In the presence of lane markings , the road boundaries are also estimated at the same time . Experimental results from images of a real road scene show the effectiveness of the proposed method

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

automatic driving system
cross ratio
automatic driving systems
collinear points
hough space
lane markings
real road scene


A mechanism for inferring approximate solutions under incomplete knowledge based on rule similarity This paper proposes an inference method which can obtain an approximate solution even if the knowledge stored in the problem-solving system is incomplete . When a rule needed for solving the problem does not exist , the problem can be solved by using rules similar to the existing rules . In an implementation using the SLD procedure , a resolution is executed between a subgoal and a rule if an atom of the subgoal is similar to the consequence atom of the rule . Similarities between atoms are calculated using a knowledge base of words with account of the reasoning situation , and the reliability of the derived solution is calculated based on these similarities . If many solutions are obtained , they are grouped into classes of similar solutions and a representative solution is then selected for each class . The proposed method was verified experimentally by solving simple problems

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

inference method
approximate solution
incomplete knowledge
rule similarity
sld procedure
consequence atom
reasoning
reliability
representative solution

problem solving
subgoal atom
word knowledge base
common sense knowledge


A modal logic for indiscernibility and complementarity in information systems In this paper , we study indiscernibility relations and complementarity relations in information systems , The first-order characterization of indiscernibility and complementarity is obtained through a duality result between information systems and certain structures of relational type characterized by first-order conditions . The modal analysis of indiscernibility and complementarity is performed through a modal logic which modalities correspond to indiscernibility relations and complementarity relations in information systems

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

modal logic
indiscernibility
complementarity
information systems
duality result
relational type

first-order characterization
first-order conditions


High-speed consistency checking for hypothetical reasoning systems using inference path network Hypothetical reasoning is popular in fault diagnostics and design systems , but slow reasoning speed is its drawback . The goal of the current study is developing hypothetical reasoning based on an inference path network , which would overcome this drawback . In hypothetical reasoning systems based on an inference path network , there is much room for improvement regarding the computing costs of connotation processing and consistency checking . The authors of this study demonstrate improvement ideas regarding one of these problems , namely , consistency checking . First , the authors obtained necessary and sufficient conditions under which inconsistencies occur during hypothesis composition . Based on the obtained results , the authors proposed an algorithm for speeding up the process of consistency checking . Processing with this algorithm in its core consists of transforming the inference path network in such a way that inconsistencies do not occur during the hypothesis composition , under the condition of unchanged solution hypotheses . The efficiency of this algorithm was confirmed by tests

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

hypothetical reasoning
fault diagnostics
inference path network
reasoning speed
inconsistencies
hypothesis composition

high-speed consistency checking
speed up


Definition of a similarity measure between cases based on auto/cross-fuzzy thesauri A similarity measure between cases is needed in order to evaluate the degree of similarity when using past similar cases in order to resolve current problems . In similar case retrieval , multiple indices are set up in order to characterize the queries and individual cases , then terms are given as values to each . The similarity measure between cases commonly used is defined using the rate at which the values provided from the corresponding indices match . In practice , however , values can not be expected to be mutually exclusive . As a result , a natural expansion of this approach is to have relationships in which mutually similar meanings are reflected in the similarity measure between cases . In this paper the authors consider an auto-fuzzy thesaurus which gives the relationship for values between corresponding indices and a cross-fuzzy thesaurus which gives the relationship for values between mutually distinct indices , then defines a similarity measure between cases which considers the relationship of index values based on these thesauri . This definition satisfies the characteristics required for the operation of case-based retrieval even when one value is not necessarily given in the index . Finally , using a test similar case retrieval system , the authors perform a comparative analysis of the proposed similarity measure between cases and a conventional approach

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

corresponding indices
mutually distinct indices
similar case retrieval

case similarity measure
relationship indices
case-based retrieval
decision making support system
problem solving
auto-fuzzy thesaurus
cross-fuzzy thesaurus


The impact and implementation of XML on business-to-business commerce This paper discusses the impact analysis of the Extensible Markup Language -LRB- XML -RRB- . Each business partner within a supply chain will be allowed to generate its own data exchange format by adopting an XML meta-data management system in the local side . Followed after a brief introduction of the information technology for Business to Customer -LRB- B2C -RRB- and Business to Business -LRB- B2B -RRB- Electronic Commerce -LRB- EC -RRB- , the impact of XML on the tomorrow business world is discussed . A real case study for impact analysis on information exchange platform , Microsoft 's BizTalk platform which is actually an XML schema builder and the implementation of XML commerce application will provide an interest insight for users ' future implementation

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

extensible markup language
xml
business to customer
biztalk
business to business
electronic commerce

xml schema builder
electronic data interchange
enterprise resources planning


A comparative study of some generalized rough approximations In this paper we focus upon a comparison of some generalized rough approximations of sets , where the classical indiscernibility relation is generalized to any binary reflexive relation . We aim at finding the best of several candidates for generalized rough approximation mappings , where both definability of sets by elementary granules of information as well as the issue of distinction among positive , negative , and border regions of a set are taken into account

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


A brief guide to competitive intelligence : how to gather and use information on competitors The author outlines the processes involved in competitive intelligence , and discusses what it is , how to do it and gives examples of what happens when companies fail to monitor their competitive environment effectively . The author presents a case study , showing how the company that produced the pre-cursor to the Barbie doll failed to look at their business environment and how this led to the firm 's failure . The author discusses what competitive intelligence is , and what it is not , and why it is important for businesses , and presents three models used to describe the competitive intelligence process , going through the various steps involved in defining intelligence requirements and collecting , analyzing , communicating and utilizing competitive intelligence

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

competitive intelligence
barbie doll
business environment

competitor information
intelligence collection
intelligence analysis
intelligence communication
intelligence utilization


A fast implementation of correlation of long data sequences for coherent receivers Coherent reception depends upon matching of phase between the transmitted and received signal . Fast convolution techniques based on fast Fourier transform -LRB- FFT -RRB- are widely used for extracting time delay information from such matching . The latency in processing a large data window of the received signal is a serious overhead for mission critical real time applications . The implementation of a parallel algorithm for correlation of long data sequences in multiprocessor environment is demonstrated here . The algorithm does processing while acquiring the received signal and reduces the computation overhead considerably because of inherent parallelism

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

correlation
long data sequences
coherent receivers
received signal
fast fourier transform
time delay information
latency
mission critical real time applications
parallel algorithm
multiprocessor environment
computation


Implementation and performance evaluation of a FIFO queue class library for time warp The authors describe the implementation , use , and performance evaluation of a FIFO queue class library by means of a high-performance , easy-to-use interface employed for queuing simulations in parallel discrete simulations based on the time warp method . Various general-purpose simulation libraries and languages have been proposed , and among these some have the advantage of not requiring users to define anything other than the state vector , and not needing awareness of rollback under a platform which performs state control based on copies . However , because the state vectors must be defined as simple data structures without pointers , dynamic data structures such as a FIFO queue can not be handled directly . Under the proposed class library , both the platform and the user can handle such structures in the same fashion that embedded data structures are handled . In addition , instead of all stored data , just the operational history can be stored and recovered efficiently at an effectively minimal cost by taking advantage of the first-in-first-out characteristics of the above data structures . When the kernel deletes past state histories during a simulation , garbage collection is also performed transparently using the corresponding method

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

fifo queue
class library
performance evaluation
queuing simulations
parallel discrete simulations
state vectors
dynamic data structures
embedded data structures
operational history
garbage collection

time warp simulation
easy-to-use interface
general-purpose simulation libraries
simulation languages
first-in-first-out characteristics
object oriented method
state management


The changing landscape for multi access portals Discusses the factors that have made life difficult for consumer portal operators in recent years causing them , like others in the telecommunications , media and technology sector , to take a close look at their business models following the dot.com crash and the consequent reassessment of Internet-related project financing by the venture capital community . While the pressure is on to generate income from existing customers and users , portal operators must reach new markets and find realistic revenue streams . This search for real revenues has led to a move towards charging for content , a strategy being pursued by a large number of horizontal portal players , including MSN and Terra Lycos . This trend is particularly noticeable in China , where Chinadotcom operates a mainland portal and plans a range of fee-based services , including electronic mail . The nature of advertising itself is changing , with portals seeking blue-chip sponsorship and marketing deals that span a number of years . Players are struggling to redefine and reinvent themselves as a result of the changing environment and even the term `` portal '' is believed to be obsolete , partly due to its dot.com crash associations . Multi-access portals are expected to dominate the consumer sector , becoming bigger and better overall than their predecessors and playing a more powerful role in the consumer environment

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

consumer portal operators
revenue streams
advertising

multi-access portals
fee-based services
blue-chip sponsorship


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

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

petri nets
concurrent systems
context dependent actions
finite prefix
goal marking
linear programming


The development and evaluation of SHOKE2000 : the PCI-based FPGA card This paper describes a PCI-based FPGA card , SHOKE2000 , which was developed in order to study reconfigurable computing . Since the latest field programmable gate arrays -LRB- FPGA -RRB- consist of input/output -LRB- I/O -RRB- configurable blocks as well as internal configurable logic blocks , they not only realize various user logic circuits but also connect with popular I/O standards easily . These features enable FPGA to connect several devices with different interfaces , and thus new reconfigurable systems would be realizable by connecting the FPGA with devices such as digital signal processors -LRB- DSP -RRB- and analog devices . This paper describes the basic functions of SHOKE2000 , which was developed for realizing hybrid reconfigurable systems consisting of FPGA , DSP , and analog devices . We also present application examples of SHOKE2000 , including a simple image recognition application , a distributed shared memory computer cluster , and teaching materials for computer education

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


A linear time special case for MC games MC games are infinite duration two-player games played on graphs . Deciding the winner in MC games is equivalent to the the modal mu-calculus model checking . In this article we provide a linear time algorithm for a class of MC games . We show that , if all cycles in each strongly connected component of the game graph have at least one common vertex , the winner can be found in linear time . Our results hold also for parity games , which are equivalent to MC games

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

linear time special case
mc games
linear time algorithm

two-player games
modal mu-calculus model checking


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

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

ontology
approximate reason
information granules
parameterized approximation spaces
granules
decision rules
reflective judgment


On average depth of decision trees implementing Boolean functions The article considers the representation of Boolean functions in the form of decision trees . It presents the bounds on average time complexity of decision trees for all classes of Boolean functions that are closed over substitution , and the insertion and deletion of unessential variables . The obtained results are compared with the results developed by M.Ju . Moshkov -LRB- 1995 -RRB- that describe the worst case time complexity of decision trees

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

average depth
decision trees
boolean functions
average time complexity
worst case time complexity


A dataflow computer which accelerates execution of sequential programs by precedent firing instructions In the dataflow machine , it is important to avoid degradation of performance in sequential processing , and it is important from the viewpoint of hardware scale to reduce the number of waiting operands . This paper demonstrates that processing performance is degraded by sequential processing in the switching process , and presents a method of remedy . Precedent firing control is proposed as a means of remedy , and it is shown by a simulation that the execution time and the total number of waiting operands can be reduced by the precedent firing control . Then the hardware scale is examined as an evaluation of precedent firing control

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

dataflow computer
sequential programs
precedent firing instructions
precedent firing control
execution time
waiting operands
hardware scale
processing performance
switching process

execution acceleration
parallel processing
computer architecture


An agent-oriented and service-oriented environment for deploying dynamic distributed systems This paper presents JASE , a Java-based Agent-oriented and Service-oriented Environment for deploying dynamic distributed systems . JASE utilizes two important concepts in the field of distributed computing : the concept of services and remote programming with mobile agents . In JASE , mobile agents are used to support applications , and service interface agents are used to wrap services . Service inter-face agents can dynamically register their services in Service Server . Mobile agent locates a specific service interface agent by submitting requests to the Service Server with descriptions of required services . JASE uses XML to describe both service descriptions and the mobile agent 's queries . JASE supports two kinds of communication facility : tuple space and asynchronous messages . In this paper , the design and implementation of JASE are described . An application shows the suitability and the effectiveness of the JASE and performance evaluation is also made . Finally , related work and some conclusions are given

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

dynamic distributed systems
jase
remote programming
mobile agents
performance evaluation

java-based agent-oriented and service-oriented environment


Why information departments are becoming academic This article outlines the increasing convergence between academia and business over the last decade or so , and the mutual benefits that this closer association has brought . It also looks at the growing importance of the information profession , suggesting that this is leading to a greater need for specialist skills , as reflected by the rise in academic courses in this area . However , it argues that increasing specialization must not lead to insularity ; if information professionals are truly concerned with gaining a competitive advantage , they must not close their minds to the potential benefits of working with external , non specialist , partners . The benefits that business has reaped from academia , it is contended , suggest that this may also be a fruitful avenue for information departments to explore

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

academia
business
information profession
specialist skills
academic courses
information departments


On fractal dimension in information systems . Toward exact sets in infinite information systems The notions of an exact as well as a rough set are well-grounded as basic notions in rough set theory . They are however defined in the setting of a finite information system i.e. an information system having finite numbers of objects as well as attributes . In theoretical studies e.g. of topological properties of rough sets , one has to trespass this limitation and to consider information systems with potentially unbound number of attributes . In such setting , the notions of rough and exact sets may be defined in terms of topological operators of interior and closure with respect to an appropriate topology following the ideas from the finite case , where it is noticed that in the finite case rough-set-theoretic operators of lower and upper approximation are identical with the interior , respectively , closure operators in topology induced by equivalence classes of the indiscernibility relation . Extensions of finite information systems are also desirable from application point of view in the area of knowledge discovery and data mining , when demands of e.g. mass collaboration and/or huge experimental data call for need of working with large data tables so the sound theoretical generalization of these cases is an information system with the number of attributes not bound in advance by a fixed integer i.e. an information system with countably but infinitely many attributes , In large information systems , a need arises for qualitative measures of complexity of concepts involved free of parameters , cf. e.g. applications for the Vapnik-Czervonenkis dimension . We study here in the theoretical setting of infinite information system a proposal to apply fractal dimensions suitably modified as measures of concept complexity

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

fractal dimension
information systems
exact sets
rough set
topological properties
closure operators
equivalence classes
knowledge discovery
data mining
qualitative measures
complexity


Bounded model checking for the universal fragment of CTL Bounded Model Checking -LRB- BMC -RRB- has been recently introduced as an efficient verification method for reactive systems . BMC based on SAT methods consists in searching for a counterexample of a particular length and generating a propositional formula that is satisfiable iff such a counterexample-exists . This new technique has been introduced by E. Clarke et al. for model checking of linear time temporal logic -LRB- LTL -RRB- . Our paper shows how the concept of bounded model checking can be extended to ACTL -LRB- the universal fragment of CTL -RRB- . The implementation of the algorithm for Elementary Net Systems is described together with the experimental results

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

bounded model checking
universal fragment
verification method
reactive systems
sat methods
propositional formula
model checking
linear time temporal logic
elementary net systems


Completeness of timed mu CRL Previously a straightforward extension of the process algebra mu CRL was proposed to explicitly deal with time . The process algebra mu CRL has been especially designed to deal with data in a process algebraic context . Using the features for data , only a minor extension of the language was needed to obtain a very expressive variant of time . Previously it contained syntax , operational semantics and axioms characterising timed mu CRL . It did not contain an in depth analysis of theory of timed mu CRL . This paper fills this gap , by providing soundness and completeness results . The main tool to establish these is a mapping of timed to untimed mu CRL and employing the completeness results obtained for untimed mu CRL

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

timed mu crl
completeness
process algebra
operational semantics


Place/Transition Petri net evolutions : recording ways , analysis and synthesis Four semantic domains for Place/Transition Petri nets and their relationships are considered . They are monoids of respectively : firing sequences , processes , traces and dependence graphs . For each of them the analysis and synthesis problem is stated and solved . The monoid of processes is defined in a non-standard way , Nets under consideration involve weights of arrows and capacities -LRB- finite or infinite -RRB- of places . However , the analysis and synthesis tasks require nets to be pure , i.e. each of their transition must have the pre-set and post-set disjoint

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

semantic domains
monoids
firing sequences
dependence graphs

place/transition petri net evolutions
post-set disjoint
pre-set disjoint


Aggregators versus disintermediators : battling it out in the information superhighstreet Perhaps the future of large-scale content aggregators is now no longer in doubt but this was not the case 10 years ago , when many leading industry experts were much more pessimistic in their predictions . In the year that Dialog celebrates its thirtieth anniversary as the world 's oldest and largest professional online information service , it is appropriate to look back at these changing perceptions , the reasons for these changes , and why the experts got it wrong . We also look at the present day ; the value that large-scale content aggregators bring to the information supply chain ; and we discuss why users would choose to use aggregators as opposed to going directly to the publishers

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

online information service
information supply chain
disintermediators


Verification of timed automata based on similarity The paper presents a modification of the standard partitioning technique to generate abstract state spaces preserving similarity for Timed Automata . Since this relation is weaker than bisimilarity , most of the obtained models -LRB- state spaces -RRB- are smaller than bisimilar ones , but still preserve the universal fragments of branching time temporal logics . The theoretical results are exemplified for strong , delay , and observational simulation relations

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

partitioning technique
abstract state spaces
bisimilarity
universal fragments
branching time temporal logics
observational simulation relations


Modeling dynamic objects in distributed systems with nested Petri nets Nested Petri nets -LRB- NP-nets -RRB- is a Petri net extension , allowing tokens in a net marking to be represented by marked nets themselves . The paper discusses applicability of NP-nets for modeling task planning systems , multi-agent systems and recursive-parallel systems . A comparison of NP-nets with some other formalisms , such as OPNs of R. Valk -LRB- 2000 -RRB- , recursive parallel programs of O. Kushnarenko and Ph. Schnoebelen -LRB- 1997 -RRB- and process algebras is given . Some aspects of decidability for object-oriented Petri net extensions are also discussed

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

distributed systems
nested petri nets
process algebras
decidability

dynamic objects modelling
multi-agent systems
recursive-parallel systems
object-oriented petri net


Topology-adaptive modeling of objects using surface evolutions based on 3D mathematical morphology Level set methods were proposed mainly by mathematicians for constructing a model of a 3D object of arbitrary topology . However , those methods are computationally inefficient due to repeated distance transformations and increased dimensions . In the paper , we propose a new method of modeling fast objects of arbitrary topology by using a surface evolution approach based on mathematical morphology . Given sensor data covering the whole object surface , the method begins with an initial approximation of the object by evolving a closed surface into a model topologically equivalent to the real object . The refined approximation is then performed using energy minimization . The method has been applied in several experiments using range data , and the results are reported in the paper

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

level set methods
surface evolutions
3d mathematical morphology
3d object
arbitrary topology
repeated distance transformations
initial approximation
refined approximation
energy minimization
range data

topology-adaptive modeling
pseudo curvature flow


Self-describing Turing machines After a sketchy historical account on the question of self-describeness and self-reproduction , and after discussing the definition of suitable encodings for self-describeness , we give the construction of several self-describing Turing machines , namely self-describing machines with , respectively , 350 , 267 , 224 and 206 instructions

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

self-describing turing machines
self-describeness
self-reproduction


Applied ethics in business information units The primary thesis of this paper is that business information professionals commonly overlook ethical dilemmas in the workplace . Although the thesis remains unproven , the author highlights , by way of real and hypothetical case studies , a number of situations in which ethical tensions can be identified , and suggests that information professionals need to be more aware of the moral context of their actions . Resolving ethical dilemmas should be one of the aims of competent information professionals and their managers , although it is recognized that dilemmas often can not easily be resolved . A background to the main theories of applied ethics forms the framework for later discussion

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

business information professionals
ethical dilemmas
moral context
applied ethics
business information units


Super high definition image -LRB- WHD : Wide/Double HD -RRB- transmission system This paper describes a WHD image transmission system constructed from a display projector , CODECs , and a camera system imaging a super high definition image -LRB- WHD : Wide/Double HD -RRB- corresponding to two screen portions of common high-vision images . This system was developed as a transmission system to communicate with or transmit information giving a reality-enhanced feeling to a remote location by using images of super high definition . In addition , the correction processing for the distortions of images occurring due to the structure of the camera system , an outline of the transmission experiments using the proposed system , and subjective evaluation experiments using WHD images are presented

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

whd image transmission system
codecs
camera system imaging

super high definition image transmission system


Succession in standardization : grafting XML onto SGML Succession in standardization is often a problem . The advantages of improvements must be weighed against those of compatibility . If compatibility considerations dominate , a grafting process takes place . According to our taxonomy of succession , there are three types of outcomes . A Type I succession , where grafting is successful , entails compatibility between successors , technical paradigm compliance and continuity in the standards trajectory . In this paper , we examine issues of succession and focus on the Extensible Markup Language -LRB- XML -RRB- . It was to be grafted on the Standard Generalized Markup Language -LRB- SGML -RRB- , a stable standard since 1988 . However , XML was a profile , a subset and an extension of SGML -LRB- 1988 -RRB- . Adaptation of SGML was needed -LRB- SGML 1999 -RRB- to forge full -LRB- downward -RRB- compatibility with XML -LRB- 1998 -RRB- . We describe the grafting efforts and analyze their outcomes . Our conclusion is that although SGML was a technical exemplar for XML developers , full compatibility was not achieved . The widespread use of HyperText Mark-up Language -LRB- HTML -RRB- exemplified the desirability of simplicity in XML , standardization . This and HTML 's user market largely explain the discontinuity in SGML-XML succession

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

xml
sgml
standardization
grafting process
type i succession
extensible markup language
standard generalized markup language


An intelligent information gathering method for dynamic information mediators The Internet is spreading into our society rapidly and is becoming one of the information infrastructures that are indispensable for our daily life . In particular , the WWW is widely used for various purposes such as sharing personal information , academic research , business work , and electronic commerce , and the amount of available information is increasing rapidly . We usually utilize information sources on the Internet as individual stand-alone sources , but if we can integrate them , we can add more value to each of them . Hence , information mediators , which integrate information distributed on the Internet , are drawing attention . In this paper , under the assumption that the information sources to be integrated are updated frequently and asynchronously , we propose an information gathering method that constructs an answer to a query from a user , accessing information sources to be integrated properly within an allowable time period . The proposed method considers the reliability of data in the cache and the quality of answer in order to efficiently access information sources and to provide appropriate answers to the user . As evaluation , we show the effectiveness of the proposed method by using an artificial information integration problem , in which some parameters can be modified , and a real-world flight information service compared with a conventional FIFO information gathering method

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


Law librarians ' survey : are academic law librarians in decline ? The author reports on the results of one extra element in the BIALL/SPTL survey , designed to acquire further information about academic law librarians . The survey has fulfilled the aim of providing a snapshot of the academic law library profession and has examined the concerns that have been raised . Perhaps most importantly , it has shown that more long-term work needs to be done to monitor the situation effectively . We hope that BIALL will take on this challenge and help to maintain the status of academic law librarians and aid them in their work

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

survey
academic law library
academic law librarians


L/sub p / stability and linearization A theorem by Hadamard gives a two-part condition under which a map from one Banach space to another is a homeomorphism . The theorem , while often very useful , is incomplete in the sense that it does not explicitly specify the family of maps for which the condition is met . Recently , under a typically weak additional assumption on the map , it was shown that Hadamard 's condition is met if and only if the map is a homeomorphism with a Lipschitz continuous inverse . Here , an application is given concerning the relation between the L/sub p / stability -LRB- with 1 < or = p < infinity -RRB- of a nonlinear system and the stability of related linear systems . We also give a result that directs attention to a fundamental limitation concerning what can be proved about linearization and stability for a related familiar family of feedback systems

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

banach space
lipschitz continuous inverse
nonlinear system
linear systems
feedback systems


Securing the Internet routing infrastructure The unprecedented growth of the Internet over the last years , and the expectation of an even faster increase in the numbers of users and networked systems , resulted in the Internet assuming its position as a mass communication medium . At the same time , the emergence of an increasingly large number of application areas and the evolution of the networking technology suggest that in the near future the Internet may become the single integrated communication infrastructure . However , as the dependence on the networking infrastructure grows , its security becomes a major concern , in light of the increased attempt to compromise the infrastructure . In particular , the routing operation is a highly visible target that must be shielded against a wide range of attacks . The injection of false routing information can easily degrade network performance , or even cause denial of service for a large number of hosts and networks over a long period of time . Different approaches have been proposed to secure the routing protocols , with a variety of countermeasures , which , nonetheless , have not eradicated the vulnerability of the routing infrastructure . In this article , we survey the up-to-date secure routing schemes . that appeared over the last few years . Our critical point of view and thorough review of the literature are an attempt to identify directions for future research on an indeed difficult and still largely open problem

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

networked systems
networking technology
integrated communication infrastructure
networking infrastructure
false routing information
network performance
routing protocols
countermeasures
routing infrastructure
secure routing schemes
research

internet routing infrastructure security


SPTL/BIALL academic law library survey 2000/2001 The paper outlines the activities and funding of academic law libraries in the UK and Ireland in the academic year 2000/2001 . The figures have been taken from the results of a postal questionnaire undertaken by information services staff at Cardiff University on behalf of BIALL

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

academic law libraries
funding
uk
ireland
postal questionnaire
information services
cardiff university
survey


Strobbe Graphics ' next frontier : CTP for commercial printers Strobbe is one of the more successful makers of newspaper platesetters , which are sold by Agfa under the Polaris name . But the company also has a growing presence in commercial printing markets , where it sells under its own name

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

strobbe graphics
agfa
commercial printing
polaris
platesetters


A shy invariant of graphs Moving from a well known result of P.L. Hammer et al. -LRB- 1982 -RRB- , we introduce a new graph invariant , say lambda -LRB- G -RRB- referring to any graph G . It is a non-negative integer which is non-zero whenever G contains particular induced odd cycles or , equivalently , admits a particular minimum clique-partition . We show that -RRB- . -LRB- G -RRB- can be efficiently evaluated and that its determination allows one to reduce the hard problem of computing a minimum clique-cover of a graph to an identical problem of smaller size and special structure . Furthermore , one has alpha -LRB- G -RRB- < or = theta -LRB- G -RRB- - lambda -LRB- G -RRB- , where alpha -LRB- G -RRB- and theta -LRB- G -RRB- respectively denote the cardinality of a maximum stable set of G and of a minimum clique-partition of G

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

graph invariant
induced odd cycles
cardinality
maximum stable set

minimum clique-partition
minimum clique-cover


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

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

graphics layout pageflex mediarich pagerich composition


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

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

modeling
periodic oscillations
nonlinear model
time delay
genetic regulation
autoregulatory feedback loop
hysteretic properties
jumping dynamics
singular perturbation theory
biochemical reactions
stability region

gene-protein systems
oscillations stability
two-gene system
nonlinearly negative feedback loops
nonlinearly positive feedback loops
genetic regulatory system
bifurcation
circadian rhythm
relaxation oscillator


Transcripts : bane or boon ? -LSB- law reporting -RSB- Because judge-made law , by its very nature , is less immediately accessible than the law of codified , statutory systems , it calls for an efficient system of law reporting . Of necessity , any such system will be selective , the majority of decisions going unreported . Considerable power thereby comes to repose in the hands of the law reporters . The author shares his invaluable perception and extensive research on the difficulties which arise from the excess of access to judgments

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


Enterprise content integration III : Agari Mediaware 's Media Star Since we introduced the term Enterprise Content Integration -LRB- ECI -RRB- in January , the concept has gained momentum in the market . In addition to Context Media 's Interchange Platform and Savantech 's Photon Commerce , Agari Mediaware 's Media Star is in the fray . It is a middleware platform that allows large media companies to integrate their digital systems with great flexibility

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

enterprise content integration
middleware


Development of visual design steering as an aid in large-scale multidisciplinary design optimization . I. Method development A modified paradigm of computational steering -LRB- CS -RRB- , termed visual design steering -LRB- VDS -RRB- , is developed in this paper . The VDS paradigm is applied to optimal design problems to provide a means for capturing and enabling designer insights . VDS allows a designer to make decisions before , during or after an analysis or optimization via a visual environment , in order to effectively steer the solution process . The objective of VDS is to obtain a better solution in less time through the use of designer knowledge and expertise . Using visual representations of complex systems in this manner enables human experience and judgement to be incorporated into the optimal design process at appropriate steps , rather than having traditional black box solvers return solutions from a prescribed input set . Part I of this paper focuses on the research issues pertaining to the Graph Morphing visualization method created to represent an n-dimensional optimization problem using 2-dimensional and 3-dimensional visualizations . Part II investigates the implementation of the VDS paradigm , using the graph morphing approach , to improve an optimal design process . Specifically , the following issues are addressed : impact of design variable changes on the optimal design space ; identification of possible constraint redundancies ; impact of constraint tolerances on the optimal solution : and smoothness of the objective function contours . It is demonstrated that graph morphing can effectively reduce the complexity and computational time associated with some optimization problems

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

visual design steering
computational steering
optimal design problems
visual representations
complex systems
graph morphing visualization method
computational time
complexity
design variable changes
constraint redundancies
constraint tolerances


Editorial system vendors focus on Adobe and the future Looking over the newspaper-system market , we note that the Mac is getting new respect . Adobe InDesign has established itself as a solid alternative to Quark XPress for pagination . Positioning themselves for the long run , developers are gradually shifting to new software architectures

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

newspaper-system market
macintosh
publishing


Tablet PCs on the way -LSB- publishing markets -RSB- Previews of hardware and software look promising for publishing markets


An analytical model for a composite adaptive rectangular structure using the Heaviside function The objective of this article is to describe a mathematical model , based on the Heaviside function and on the delta - Dirac distribution , for a composite adaptive rectangular structure with embedded and/or bonded piezoelectric actuators and sensors . In the adopted structure model , the laminae are made up a configuration of rectangular nonpiezoelectric and piezoelectric patches . The laminae do not all have the same area nor do they present the same configuration , such that there are points where there is no material . The equations of motion and the boundary conditions , which describe the electromechanical coupling , are based on the Mindlin displacement field , on the linear theory of piezoelectricity , and on the Hamilton principle

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

delta-dirac distribution
embedded actuators
embedded sensors
bonded actuators
bonded sensors
piezoelectric sensors
nonpiezoelectric patches
closed-form solution
lagrangian functions
linear piezoelectricity
constitutive relations
virtual kinetic energy
rectangular composite plate
finite-element method


Resolution of a current-mode algorithmic analog-to-digital converter Errors limiting the resolution of current-mode algorithmic analog-to-digital converters are mainly related to current mirror operation . While systematic errors can be minimized by proper circuit techniques , random sources are unavoidable . In this paper a statistical analysis of the resolution of a typical converter is carried out taking into account process tolerances . To support the analysis , a 4-bit ADC , realized in a 0.35 - mu m CMOS technology , was exhaustively simulated . Results were found to be in excellent agreement with theoretical derivations

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

resolution
circuit techniques
statistical analysis
cmos technology

current-mode adc
algorithmic adc
analog-to-digital converters
a/d converters
error analysis
tolerance analysis
circuit analysis
0.35 micron
4 bit


X-Rite : more than a graphic arts company Although it is well known as a maker of densitometers and spectrophotometers , X-Rite is active in measuring light and shape in many industries . Among them are automobile finishes , paint and home improvements , scientific instruments , optical semiconductors and even cosmetic dentistry

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


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

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

firing probability
cortical neurons
synaptic activity
noise filtering
synaptic time constant
membrane time constant
phase lag
synaptic receptors

noisy integrate-and-fire neurons
white noise
colored noise
fokker-planck equation
numerical simulation


Truss topology optimization by a modified genetic algorithm This paper describes the use of a stochastic search procedure based on genetic algorithms for developing near-optimal topologies of load-bearing truss structures . Most existing cases these publications express the truss topology as a combination of members . These methods , however , have the disadvantage that the resulting topology may include needless members or those which overlap other members . In addition to these problems , the generated structures are not necessarily structurally stable . A new method , which resolves these problems by expressing the truss topology as a combination of triangles , is proposed in this paper . Details of the proposed methodology are presented as well as the results of numerical examples that clearly show the effectiveness and efficiency of the method

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

stochastic search procedure
modified genetic algorithm
truss topology optimization
triangles

near-optimal topologies
load-bearing truss structures


Scalable hybrid computation with spikes We outline a hybrid analog-digital scheme for computing with three important features that enable it to scale to systems of large complexity : First , like digital computation , which uses several one-bit precise logical units to collectively compute a precise answer to a computation , the hybrid scheme uses several moderate-precision analog units to collectively compute a precise answer to a computation . Second , frequent discrete signal restoration of the analog information prevents analog noise and offset from degrading the computation . Third , a state machine enables complex computations to be created using a sequence of elementary computations . A natural choice for implementing this hybrid scheme is one based on spikes because spike-count codes are digital , while spike-time codes are analog . We illustrate how spikes afford easy ways to implement all three components of scalable hybrid computation . First , as an important example of distributed analog computation , we show how spikes can create a distributed modular representation of an analog number by implementing digital carry interactions between spiking analog neurons . Second , we show how signal restoration may be performed by recursive spike-count quantization of spike-time codes . Third , we use spikes from an analog dynamical system to trigger state transitions in a digital dynamical system , which reconfigures the analog dynamical system using a binary control vector ; such feedback interactions between analog and digital dynamical systems create a hybrid state machine -LRB- HSM -RRB- . The HSM extends and expands the concept of a digital finite-state-machine to the hybrid domain . We present experimental data from a two-neuron HSM on a chip that implements error-correcting analog-to-digital conversion with the concurrent use of spike-time and spike-count codes . We also present experimental data from silicon circuits that implement HSM-based pattern recognition using spike-time synchrony . We outline how HSMs may be used to perform learning , vector quantization , spike pattern recognition and generation , and how they may be reconfigured

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

scalable hybrid computation
spikes
frequent discrete signal restoration
analog noise
distributed analog computation
digital carry interactions
binary control vector
feedback interactions
silicon circuits
pattern recognition
learning
vector quantization


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

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

packet marking disciplines
internet management

multi-timescale internet traffic engineering


Multicriterion optimization of composite laminates for maximum failure margins with an interactive descent algorithm An interactive multicriterion optimization method for composite laminates subjected to multiple loading conditions is introduced . Laminate margins to initial failure -LRB- first ply failure , FPF -RRB- with respect of the applied loading conditions are treated as criteria . The original problem is reduced to a , bicriterion problem by introducing parameters to combine criteria in a linear manner . The problem is solved by using an interactive descent algorithm . Both the conditions required for a discrete procedure to converge towards a Pareto optimum and numerical examples are given

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

interactive multicriterion optimization
composite laminates
maximum failure margins
multiple loading conditions
interactive descent algorithm
first ply failure
bicriterion problem
discrete procedure
pareto optimum


Understanding Internet traffic streams : dragonflies and tortoises We present the concept of network traffic streams and the ways they aggregate into flows through Internet links . We describe a method of measuring the size and lifetime of Internet streams , and use this method to characterize traffic distributions at two different sites . We find that although most streams -LRB- about 45 percent of them -RRB- are dragonflies , lasting less than 2 seconds , a significant number of streams have lifetimes of hours to days , and can carry a high proportion -LRB- 50-60 percent -RRB- of the total bytes on a given link . We define tortoises as streams that last longer than 15 minutes . We point out that streams can be classified not only by lifetime -LRB- dragonflies and tortoises -RRB- but also by size -LRB- mice and elephants -RRB- , and note that stream size and lifetime are independent dimensions . We submit that ISPs need to be aware of the distribution of Internet stream sizes , and the impact of the difference in behavior between short and long streams . In particular , any forwarding cache mechanisms in Internet routers must be able to cope with a high volume of short streams . In addition ISPs should realize that long-running streams can contribute a significant fraction of their packet and byte volumes-something they may not have allowed for when using traditional `` flat rate user bandwidth consumption '' approaches to provisioning and engineering

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

internet traffic streams
dragonflies
tortoises
network traffic streams
traffic distributions
mice
elephants
forwarding cache mechanisms
internet routers

internet stream size measurement
internet stream lifetime measurement
isp
long-running streams
packet volume
byte volume
traffic provisioning
traffic engineering


How much should publishers spend on technology ? A study confirms that spending on publishing-specific information technology -LRB- IT -RRB- resources is growing much faster than IT spending for general business activities , at least among leading publishers in the scientific , technical and medical -LRB- STM -RRB- market . The survey asked about information technology funding and staffing levels-past , present and future-and also inquired about activities in content management , Web delivery , computer support and customer relationship management . The results provide a starting point for measuring information technology growth and budget allocations in this publishing segment

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

it spending
content management
web delivery
publishing
budget
computer support
customer relationship management


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

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

visual design steering
method validation
graph morphing
optimal design problems
reliability
accuracy
cycle time
design variable impact
constraint redundancy
constraint allowable limits
function smoothness


Center-crossing recurrent neural networks for the evolution of rhythmic behavior A center-crossing recurrent neural network is one in which the null -LRB- hyper -RRB- surfaces of each neuron intersect at their exact centers of symmetry , ensuring that each neuron 's activation function is centered over the range of net inputs that it receives . We demonstrate that relative to a random initial population , seeding the initial population of an evolutionary search with center-crossing networks significantly improves both the frequency and the speed with which high-fitness oscillatory circuits evolve on a simple walking task . The improvement is especially striking at low mutation variances . Our results suggest that seeding with center-crossing networks may often be beneficial , since a wider range of dynamics is more likely to be easily accessible from a population of center-crossing networks than from a population of random networks

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

symmetry
activation function
random initial population
evolutionary search
random networks

center-crossing recurrent neural networks


A look at MonacoProfiler 4 The newest profiling program from Monaco Software adds some valuable features : support for up to 8-color printing , profiling for digital cameras , fine-tuning of black generation and tweaking of profile transforms . We tested its ease of use and a few of the advanced functions . In all , it 's pretty good

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

color-correction
pantone hexachrome
commercial printers


Blended implementation of block implicit methods for ODEs In this paper we further develop a new approach for naturally defining the nonlinear splittings needed for the implementation of block implicit methods for ODEs , which has been considered by Brugnano -LSB- J. Comput . Appl . Math . 116 -LRB- 2000 -RRB- 41 -RSB- and by Brugnano and Trigiante -LSB- in : Recent Trends in Numerical Analysis , Nova Science , New York , 2000 , pp. 81-105 -RSB- . The basic idea is that of defining the numerical method as the combination -LRB- blending -RRB- of two suitable component methods . By carefully choosing such methods , it is shown that very efficient implementations can be obtained . Moreover , some of them , characterized by a diagonal splitting , are well suited for parallel computers . Numerical tests comparing the performances of the proposed implementation with existing ones are also presented , in order to make evident the potential of the approach

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

nonlinear splittings
block implicit methods
blended implementation
odes
numerical method
diagonal splitting
parallel computers
numerical tests


Stability analysis of the characteristic polynomials whose coefficients are polynomials of interval parameters using monotonicity We analyze the stability of the characteristic polynomials whose coefficients are polynomials of interval parameters via monotonicity methods . Our stability conditions are based on Frazer-Duncan 's theorem and all conditions can be checked using only endpoint values of interval parameters . These stability conditions are necessary and sufficient under the monotonicity assumptions . When the monotonicity conditions do not hold on the whole parameter region , we present an interval division method and a transformation algorithm in order to apply the monotonicity conditions . Then , our stability analysis methods can be applied to all characteristic polynomials whose coefficients are polynomials of interval parameters

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

stability analysis
characteristic polynomials
interval parameters
monotonicity
endpoint values
interval division method
transformation algorithm

frazer-duncan theorem
necessary and sufficient conditions


A collocation formulation of multistep methods for variable step-size extensions Multistep methods are classically constructed by specially designed difference operators on an equidistant time grid . To make them practically useful , they have to be implemented by varying the step-size according to some error-control algorithm . It is well known how to extend Adams and BDF formulas to a variable step-size formulation . In this paper we present a collocation approach to construct variable step-size formulas . We make use of piecewise polynomials to show that every k-step method of order k +1 has a variable step-size polynomial collocation formulation

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

multistep methods
collocation formulation
difference operators
equidistant time grid
piecewise polynomials


Personal cards for on-line purchases Buying presents over the Web has advantages for a busy person : lots of choices , 24-hour accessibility , quick delivery , and you do n't even have to wrap the gift . But many people like to select a card or write a personal note to go with their presents , and the options for doing that have been limited . Two companies have seen this limitation as an opportunity : 4YourSoul . com and CardintheBox.com

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


Making the MIS integration process work Focused , cross-functional teams that implement flexible and scalable information systems -LRB- IS -RRB- can deliver a smooth , lean manufacturing process . When integrating new technology into an existing facility , one should always consider three things : the hard infrastructure , the soft infrastructure , and information flow . Hard infrastructure includes client and server hardware and network infrastructure . Soft infrastructure includes operating systems , existing or legacy software , needed code customizations , and the human resources to run/support the system . Information flow includes how data in the new system interacts with legacy systems and what legacy data the new system will require , as well as who will want to receive/access the information that is held by the system

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

scalable information systems
lean manufacturing process
network infrastructure
human resources
legacy software
information flow

management information systems
client server hardware


Will CPXe save the photofinishing market ? A consortium of film suppliers and electronics firms has proposed the Common Picture Exchange environment . It will let diverse providers cooperate via the Internet to sell digital-photo prints

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

cpxe
photofinishing market
common picture exchange environment

kodak
fujifilm
hp
web-services standards


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

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


Stability in the numerical solution of the heat equation with nonlocal boundary conditions This paper deals with numerical methods for the solution of the heat equation with integral boundary conditions . Finite differences are used for the discretization in space . The matrices specifying the resulting semidiscrete problem are proved to satisfy a sectorial resolvent condition , uniformly with respect to the discretization parameter . Using this resolvent condition , unconditional stability is proved for the fully discrete numerical process generated by applying A -LRB- theta -RRB- - stable one-step methods to the semidiscrete problem . This stability result is established in the maximum norm ; it improves some previous results in the literature in that it is not subject to various unnatural restrictions which were imposed on the boundary conditions and on the one-step methods

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

numerical solution
heat equation
nonlocal boundary conditions
stability
integral boundary conditions
finite differences
matrices
semidiscrete problem
sectorial resolvent condition
fully discrete numerical process
maximum norm


The heat is on -LSB- building automation systems -RSB- Integrating building automation systems -LRB- BASs -RRB- can result in systems that have the ability to sense changes in the air temperature through a building 's heating , ventilation , and air conditioning -LRB- HVAC -RRB- systems . Taking advantages of the Internet , using remote monitoring , and building interoperability through open protocol systems are some of the issues discussed throughout the BAS/HVAC community . By putting information over the Internet , facility managers get real-time data on energy usage and performance issues

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

building automation systems
hvac
heating
ventilation
air conditioning
remote monitoring
interoperability
internet