Mining the optimal class association rule set

Abstract: We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set. Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly. We present an efficient algorithm for mining the optimal class association rule set using an upward closure property of pruning weak rules before they are actually generated. We have implemented the algorithm and our experimental results show that our algorithm generates the optimal class association rule set, whose size is smaller than 1/17 of the complete class association rule set on average, in significantly less time than generating the complete class association rule set. Our proposed criterion has been shown very effective for pruning weak rules in dense databases

mine the optim class associ rule set
 we defin an optim class associ rule set to be the minimum rule set with the same predict power of the complet class associ rule set . use thi rule set instead of the complet class associ rule set we can avoid redund comput that would otherwis be requir for mine predict associ rule and henc improv the effici of the mine process significantli . we present an effici algorithm for mine the optim class associ rule set use an upward closur properti of prune weak rule befor they are actual gener . we have implement the algorithm and our experiment result show that our algorithm gener the optim class associ rule set , whose size is smaller than 1/17 of the complet class associ rule set on averag , in significantli less time than gener the complet class associ rule set . our propos criterion ha been shown veri effect for prune weak rule in dens databas

optimal class association rule set mining


3D reconstruction from uncalibrated-camera optical flow and its reliability evaluation

Abstract: We present a scheme for reconstructing a 3D structure from optical flow observed by a camera with an unknown focal length in a statistically optimal way as well as evaluating the reliability of the computed shape. First, the flow fundamental matrices are optimally computed from the observed flow. They are then decomposed into the focal length, its rate of change, and the motion parameters. Next, the flow is optimally corrected so that it satisfies the epipolar equation exactly. Finally, the 3D positions are computed, and their covariance matrices are evaluated. By simulations and real-image experiments, we test the performance of our system and observe how the normalization (gauge) for removing indeterminacy affects the description of uncertainty

3d reconstruct from uncalibrated-camera optic flow and it reliabl evalu
 we present a scheme for reconstruct a 3d structur from optic flow observ by a camera with an unknown focal length in a statist optim way as well as evalu the reliabl of the comput shape . first , the flow fundament matric are optim comput from the observ flow . they are then decompos into the focal length , it rate of chang , and the motion paramet . next , the flow is optim correct so that it satisfi the epipolar equat exactli . final , the 3d posit are comput , and their covari matric are evalu . by simul and real-imag experi , we test the perform of our system and observ how the normal ( gaug ) for remov indeterminaci affect the descript of uncertainti

3D reconstruction
uncalibrated-camera optical flow
reliability evaluation
flow fundamental matrices
motion parameters
epipolar equation
covariance matrices
real-image experiments
normalization


Agents in e-commerce: state of the art

Abstract: This paper surveys the state of the art of agent-mediated electronic commerce (e-commerce), especially in business-to-consumer (B2C) e-commerce and business-to-business (B2B) e-commerce. From the consumer buying behaviour perspective, the roles of agents in B2C e-commerce are: product brokering, merchant brokering, and negotiation. The applications of agents in B2B e-commerce are mainly in supply chain management. Mobile agents, evolutionary agents, and data-mining agents are some special techniques which can be applied in agent-mediated e-commerce. In addition, some technologies for implementation are briefly reviewed. Finally, we conclude this paper by discussions on the future directions of agent-mediated e-commerce

agent in e-commerc : state of the art
 thi paper survey the state of the art of agent-medi electron commerc ( e-commerc ) , especi in business-to-consum ( b2c ) e-commerc and business-to-busi ( b2b ) e-commerc . from the consum buy behaviour perspect , the role of agent in b2c e-commerc are : product broker , merchant broker , and negoti . the applic of agent in b2b e-commerc are mainli in suppli chain manag . mobil agent , evolutionari agent , and data-min agent are some special techniqu which can be appli in agent-medi e-commerc . in addit , some technolog for implement are briefli review . final , we conclud thi paper by discuss on the futur direct of agent-medi e-commerc

state of the art
agent-mediated electronic commerce
consumer buying behaviour
product brokering
merchant brokering
negotiation
supply chain management
mobile agents
evolutionary agents
data-mining agents
business-to-consumer e-commerce
multi-agent systems
business-to-business e-commerce


Approximation and complexity. II. Iterated integration

Abstract: For pt. I. see ibid., no. 1, p. 289-95 (2001). We introduce two classes of real analytic functions W contained in/implied by U on an interval. Starting with rational functions to construct functions in W we allow the application of three types of operations: addition, integration, and multiplication by a polynomial with rational coefficients. In a similar way, to construct functions in U we allow integration, addition, and multiplication of functions already constructed in U and multiplication by rational numbers. Thus, U is a subring of the ring of Pfaffian functions. Two lower bounds on the L/sub infinity /-norm are proved on a function f from W (or from U, respectively) in terms of the complexity of constructing f

approxim and complex . ii . iter integr
 for pt . i. see ibid . , no . 1 , p. 289 - 95 ( 2001 ) . we introduc two class of real analyt function w contain in / impli by u on an interv . start with ration function to construct function in w we allow the applic of three type of oper : addit , integr , and multipl by a polynomi with ration coeffici . in a similar way , to construct function in u we allow integr , addit , and multipl of function alreadi construct in u and multipl by ration number . thu , u is a subr of the ring of pfaffian function . two lower bound on the l / sub infin /-norm are prove on a function f from w ( or from u , respect ) in term of the complex of construct f

integration
real analytic functions
rational functions
addition
multiplication
polynomial
Pfaffian functions
lower bounds
L/sub infinity /-norm


Cache invalidation and replacement strategies for location-dependent data in mobile environments

Abstract: Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and cache replacement for location-dependent data under a geometric location model. We introduce a new performance criterion, called caching efficiency, and propose a generic method for location-dependent cache invalidation strategies. In addition, two cache replacement policies, PA and PAID, are proposed. Unlike the conventional replacement policies, PA and PAID take into consideration the valid scope area of a data value. We conduct a series of simulation experiments to study the performance of the proposed caching schemes. The experimental results show that the proposed location-dependent invalidation scheme is very effective and the PA and PAID policies significantly outperform the conventional replacement policies

cach invalid and replac strategi for location-depend data in mobil environ
 mobil location-depend inform servic ( ldiss ) have becom increasingli popular in recent year . howev , data cach strategi for ldiss have thu far receiv littl attent . in thi paper , we studi the issu of cach invalid and cach replac for location-depend data under a geometr locat model . we introduc a new perform criterion , call cach effici , and propos a gener method for location-depend cach invalid strategi . in addit , two cach replac polici , pa and paid , are propos . unlik the convent replac polici , pa and paid take into consider the valid scope area of a data valu . we conduct a seri of simul experi to studi the perform of the propos cach scheme . the experiment result show that the propos location-depend invalid scheme is veri effect and the pa and paid polici significantli outperform the convent replac polici

mobile location-dependent information services


A novel robot hand with embedded shape memory alloy actuators

Abstract: Describes the development of an active robot hand, which allows smooth and lifelike motions for anthropomorphic grasping and fine manipulations. An active robot finger 10 mm in outer diameter with a shape memory alloy (SMA) wire actuator embedded in the finger with a constant distance from the geometric centre of the finger was designed and fabricated. The practical specifications of the SMA wire and the flexible rod were determined on the basis of a series of formulae. The active finger consists of two bending parts, the SMA actuators and a connecting part. The mechanical properties of the bending part are investigated. The control system on the basis of resistance feedback is also presented. Finally, a robot hand with three fingers was designed and the grasping experiment was carried out to demonstrate its performance

a novel robot hand with embed shape memori alloy actuat
 describ the develop of an activ robot hand , which allow smooth and lifelik motion for anthropomorph grasp and fine manipul . an activ robot finger 10 mm in outer diamet with a shape memori alloy ( sma ) wire actuat embed in the finger with a constant distanc from the geometr centr of the finger wa design and fabric . the practic specif of the sma wire and the flexibl rod were determin on the basi of a seri of formula . the activ finger consist of two bend part , the sma actuat and a connect part . the mechan properti of the bend part are investig . the control system on the basi of resist feedback is also present . final , a robot hand with three finger wa design and the grasp experi wa carri out to demonstr it perform

embedded shape memory alloy actuators
active robot hand
lifelike motions
anthropomorphic grasping
fine manipulations
flexible rod
active finger
resistance feedback


Flow measurement - future directions

Abstract: Interest in the flow of liquids and its measurement can be traced back to early studies by the Egyptians, the Chinese and the Romans. Since these early times the science of flow measurement has undergone a massive change but during the last 25 years or so (1977-2002) it has matured enormously. One of the principal reasons for this is that higher accuracies and reliabilities have been demanded by industry in the measurement of fiscal transfers and today there is vigorous interest in the subject from both the flowmeter manufacturer and user viewpoints. This interest is coupled with the development of advanced computer techniques in fluid mechanics together with the application of increasingly sophisticated electronics

flow measur - futur direct
 interest in the flow of liquid and it measur can be trace back to earli studi by the egyptian , the chines and the roman . sinc these earli time the scienc of flow measur ha undergon a massiv chang but dure the last 25 year or so ( 1977 - 2002 ) it ha matur enorm . one of the princip reason for thi is that higher accuraci and reliabl have been demand by industri in the measur of fiscal transfer and today there is vigor interest in the subject from both the flowmet manufactur and user viewpoint . thi interest is coupl with the develop of advanc comput techniqu in fluid mechan togeth with the applic of increasingli sophist electron

flow measurement
Egyptians
Chinese
Romans
fiscal transfers
flowmeter manufacturer
advanced computer techniques
fluid mechanics
flow metering
signal processing
liquid flow
electronics application


An ACM-W literature review on women in computing

Abstract: The pipeline shrinkage problem for women in computer science is a well-known and documented phenomenon where the ratio of women to men involved in computing shrinks dramatically from early student years to working years. During the last decade, considerable research ensued to understand the reasons behind the existence of the shrinking pipeline and in some cases to take action to increase the numbers of women in computing. Through the work of a National Science Foundation funded project, ACM's Committee on Women in Computing (ACM-W) has taken a first step towards pulling this research together. A large number of articles was gathered and processed on the topic of women in computing and the shrinking pipeline. The committee created a publicly available online database to organize the references of this body of work by topic, author, and reference information. The database, constantly being updated, is accessible through ACM-W's website <http://www.acm.org/women>. A final report is also available via the ACM-W Web site which covers current statistics on women in computing, summaries of the literature in the database, and a set of recommendations. The article is a brief synopsis of a subset of the literature review as of August 2001

an acm-w literatur review on women in comput
 the pipelin shrinkag problem for women in comput scienc is a well-known and document phenomenon where the ratio of women to men involv in comput shrink dramat from earli student year to work year . dure the last decad , consider research ensu to understand the reason behind the exist of the shrink pipelin and in some case to take action to increas the number of women in comput . through the work of a nation scienc foundat fund project , acm 's committe on women in comput ( acm-w ) ha taken a first step toward pull thi research togeth . a larg number of articl wa gather and process on the topic of women in comput and the shrink pipelin . the committe creat a publicli avail onlin databas to organ the refer of thi bodi of work by topic , author , and refer inform . the databas , constantli be updat , is access through acm-w 's websit < http://www.acm.org/women > . a final report is also avail via the acm-w web site which cover current statist on women in comput , summari of the literatur in the databas , and a set of recommend . the articl is a brief synopsi of a subset of the literatur review as of august 2001

ACM-W literature review
pipeline shrinkage problem
ACM Committee on Women in Computing


On quasi-linear PDAEs with convection: applications, indices, numerical solution

Abstract: For a class of partial differential algebraic equations (PDAEs) of quasi-linear type which include nonlinear terms of convection type, a possibility to determine a time and spatial index is considered. As a typical example we investigate an application from plasma physics. Especially we discuss the numerical solution of initial boundary value problems by means of a corresponding finite difference splitting procedure which is a modification of a well-known fractional step method coupled with a matrix factorization. The convergence of the numerical solution towards the exact solution of the corresponding initial boundary value problem is investigated. Some results of a numerical solution of the plasma PDAE are given

on quasi-linear pdae with convect : applic , indic , numer solut
 for a class of partial differenti algebra equat ( pdae ) of quasi-linear type which includ nonlinear term of convect type , a possibl to determin a time and spatial index is consid . as a typic exampl we investig an applic from plasma physic . especi we discuss the numer solut of initi boundari valu problem by mean of a correspond finit differ split procedur which is a modif of a well-known fraction step method coupl with a matrix factor . the converg of the numer solut toward the exact solut of the correspond initi boundari valu problem is investig . some result of a numer solut of the plasma pdae are given

quasi-linear partial differential algebraic equations


A wizard idea [Internet in finance]

Abstract: New technology is set to become an ever-more important area of work for brokers. Lawrie Holmes looks at how the Internet is driving change and opportunity

a wizard idea [ internet in financ ]
 new technolog is set to becom an ever-mor import area of work for broker . lawri holm look at how the internet is drive chang and opportun


WAM!Net: private pipes for electronic media

Abstract: "We are the digital version of FedEx. We offer storage and intelligent workflow." The United States military - especially during war time - is pretty careful about the way it handles its workflow and communications. Before a company is awarded a government contract, the company and its technology are screened and verified. If the technology or its creators aren't trustworthy and secure, chances are they aren't getting by Uncle Sam. Record companies and publishing houses tend to feel the same way. After all, security is just as important to a record executive as it is to a Navy commander. WAM!Net, a Wide-Area Media network (hence, the name) passes muster with both. The company, which employs about 320 employees around the world, has 15000 customers including the US Navy and a host of record labels, publishing companies, healthcare providers, and advertising agencies, all of whom use its network as a way to transport, store, and receive data. "We are the digital version of FedEx. We offer storage and intelligent workflow," says Murad Velani, executive vice president of sales and marketing for WAM!Net. "We started out as purely transport and we've become a digital platform."

wam!net : privat pipe for electron media
 " we are the digit version of fedex . we offer storag and intellig workflow . " the unit state militari - especi dure war time - is pretti care about the way it handl it workflow and commun . befor a compani is award a govern contract , the compani and it technolog are screen and verifi . if the technolog or it creator are n't trustworthi and secur , chanc are they are n't get by uncl sam . record compani and publish hous tend to feel the same way . after all , secur is just as import to a record execut as it is to a navi command . wam!net , a wide-area media network ( henc , the name ) pass muster with both . the compani , which employ about 320 employe around the world , ha 15000 custom includ the us navi and a host of record label , publish compani , healthcar provid , and advertis agenc , all of whom use it network as a way to transport , store , and receiv data . " we are the digit version of fedex . we offer storag and intellig workflow , " say murad velani , execut vice presid of sale and market for wam!net . " we start out as pure transport and we 've becom a digit platform . "

WAM!Net
electronic media
intelligent workflow
United States military
Wide-Area Media network
record labels
publishing companies
healthcare providers
advertising agencies
digital platform
U.S. Navy
content creators
high-speed private network
ATM technology
content information
publishing information
client-server format
ASP format


Development of an Internet-based intelligent design support system for rolling element bearings

Abstract: This paper presents a novel approach to developing an intelligent agile design system for rolling bearings based on artificial intelligence (AI), Internet and Web technologies and expertise. The underlying philosophy of the approach is to use AI technology and Web-based design support systems as smart tools from which design customers can rapidly and responsively access the systems' built-in design expertise. The approach is described in detail with a novel AI model and system implementation issues. The major issues in implementing the approach are discussed with particular reference to using AI technologies, network programming, client-server technology and open computing of bearing design and manufacturing requirements

develop of an internet-bas intellig design support system for roll element bear
 thi paper present a novel approach to develop an intellig agil design system for roll bear base on artifici intellig ( ai ) , internet and web technolog and expertis . the underli philosophi of the approach is to use ai technolog and web-bas design support system as smart tool from which design custom can rapidli and respons access the system ' built-in design expertis . the approach is describ in detail with a novel ai model and system implement issu . the major issu in implement the approach are discuss with particular refer to use ai technolog , network program , client-serv technolog and open comput of bear design and manufactur requir


Critical lines identification on voltage collapse analysis

Abstract: This paper deals with critical lines identification on voltage collapse analysis. It is known, from the literature, that voltage collapse is a local phenomenon that spreads around an initial neighborhood Therefore, identifying the system critical bus plays an important role on voltage collapse prevention. For this purpose, the system critical transmission lines should also be identified In this paper, these issues are addressed, yielding reliable results in a short computational time. Tests are done with the help of the IEEE-118 bus and the Southeastern Brazilian systems

critic line identif on voltag collaps analysi
 thi paper deal with critic line identif on voltag collaps analysi . it is known , from the literatur , that voltag collaps is a local phenomenon that spread around an initi neighborhood therefor , identifi the system critic bu play an import role on voltag collaps prevent . for thi purpos , the system critic transmiss line should also be identifi in thi paper , these issu are address , yield reliabl result in a short comput time . test are done with the help of the ieee-118 bu and the southeastern brazilian system

critical transmission lines identification


Quasi stage order conditions for SDIRK methods

Abstract: The stage order condition is a simplifying assumption that reduces the number of order conditions to be fulfilled when designing a Runge-Kutta (RK) method. Because a DIRK (diagonally implicit RK) method cannot have stage order greater than 1, we introduce quasi stage order conditions and derive some of their properties for DIRKs. We use these conditions to derive a low-order DIRK method with embedded error estimator. Numerical tests with stiff ODEs and DAEs of index 1 and 2 indicate that the method is competitive with other RK methods for low accuracy tolerances

quasi stage order condit for sdirk method
 the stage order condit is a simplifi assumpt that reduc the number of order condit to be fulfil when design a runge-kutta ( rk ) method . becaus a dirk ( diagon implicit rk ) method can not have stage order greater than 1 , we introduc quasi stage order condit and deriv some of their properti for dirk . we use these condit to deriv a low-ord dirk method with embed error estim . numer test with stiff ode and dae of index 1 and 2 indic that the method is competit with other rk method for low accuraci toler

quasi stage order conditions
SDIRK methods
embedded error estimator
numerical tests
diagonally implicit Runge-Kutta method
differential-algebraic systems


Hierarchical neuro-fuzzy quadtree models

Abstract: Hybrid neuro-fuzzy systems have been in evidence during the past few years, due to its attractive combination of the learning capacity of artificial neural networks with the interpretability of the fuzzy systems. This article proposes a new hybrid neuro-fuzzy model, named hierarchical neuro-fuzzy quadtree (HNFQ), which is based on a recursive partitioning method of the input space named quadtree. The article describes the architecture of this new model, presenting its basic cell and its learning algorithm. The HNFQ system is evaluated in three well known benchmark applications: the sinc(x, y) function approximation, the Mackey Glass chaotic series forecast and the two spirals problem. When compared to other neuro-fuzzy systems, the HNFQ exhibits competing results, with two major advantages it automatically creates its own structure and it is not limited to few input variables

hierarch neuro-fuzzi quadtre model
 hybrid neuro-fuzzi system have been in evid dure the past few year , due to it attract combin of the learn capac of artifici neural network with the interpret of the fuzzi system . thi articl propos a new hybrid neuro-fuzzi model , name hierarch neuro-fuzzi quadtre ( hnfq ) , which is base on a recurs partit method of the input space name quadtre . the articl describ the architectur of thi new model , present it basic cell and it learn algorithm . the hnfq system is evalu in three well known benchmark applic : the sinc(x , y ) function approxim , the mackey glass chaotic seri forecast and the two spiral problem . when compar to other neuro-fuzzi system , the hnfq exhibit compet result , with two major advantag it automat creat it own structur and it is not limit to few input variabl

hierarchical neuro-fuzzy quadtree
quadtree
neuro-fuzzy systems
fuzzy systems
recursive partitioning
learning algorithm
Mackey Glass chaotic series


Score tests for zero-inflated Poisson models

Abstract: In many situations count data have a large proportion of zeros and the zero-inflated Poisson regression (ZIP) model may be appropriate. A simple score test for zero-inflation, comparing the ZIP model with a constant proportion of excess zeros to a standard Poisson regression model, was given by van den Broek (1995). We extend this test to the more general situation where the zero probability is allowed to depend on covariates. The performance of this test is evaluated using a simulation study. To identify potentially important covariates in the zero-inflation model a composite test is proposed. The use of the general score test and the composite procedure is illustrated on two examples from the literature. The composite score test is found to suggest appropriate models

score test for zero-infl poisson model
 in mani situat count data have a larg proport of zero and the zero-infl poisson regress ( zip ) model may be appropri . a simpl score test for zero-infl , compar the zip model with a constant proport of excess zero to a standard poisson regress model , wa given by van den broek ( 1995 ) . we extend thi test to the more gener situat where the zero probabl is allow to depend on covari . the perform of thi test is evalu use a simul studi . to identifi potenti import covari in the zero-infl model a composit test is propos . the use of the gener score test and the composit procedur is illustr on two exampl from the literatur . the composit score test is found to suggest appropri model

score tests
count data
excess zeros
zero probability
covariates
simulation
composite test
zero-inflated Poisson regression model


Application foundations [application servers]

Abstract: The changing role of application servers means choosing the right platform has become a complex challenge

applic foundat [ applic server ]
 the chang role of applic server mean choos the right platform ha becom a complex challeng

application servers
Microsoft .Net
transaction processing
security
availability
load balancing
Java 2 Enterprise Edition


Modeling discourse in collaborative work support systems: a knowledge representation and configuration perspective

Abstract: Collaborative work processes usually raise a lot of intricate debates and negotiations among participants, whereas conflicts of interest are inevitable and support for achieving consensus and compromise is required. Individual contributions, brought up by parties with different backgrounds and interests, need to be appropriately structured and maintained. This paper presents a model of discourse acts that participants use to communicate their attitudes to each other, or affect the attitudes of others, in such environments. The first part deals with the knowledge representation and communication aspects of the problem, while the second one, in the context of an already implemented system, namely HERMES, with issues related to the configuration of the contributions asserted at each discourse instance. The overall work focuses on the machinery needed in a computer-assisted collaborative work environment, the aim being to further enhance the human-computer interaction

model discours in collabor work support system : a knowledg represent and configur perspect
 collabor work process usual rais a lot of intric debat and negoti among particip , wherea conflict of interest are inevit and support for achiev consensu and compromis is requir . individu contribut , brought up by parti with differ background and interest , need to be appropri structur and maintain . thi paper present a model of discours act that particip use to commun their attitud to each other , or affect the attitud of other , in such environ . the first part deal with the knowledg represent and commun aspect of the problem , while the second one , in the context of an alreadi implement system , name herm , with issu relat to the configur of the contribut assert at each discours instanc . the overal work focus on the machineri need in a computer-assist collabor work environ , the aim be to further enhanc the human-comput interact

collaborative work support systems
knowledge representation
conflicts of interest
consensus
compromise
HERMES
human-computer interaction
discourse modeling
knowledge communication


Optimization of requantization parameter for MPEG transcoding

Abstract: 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

optim of requant paramet for mpeg transcod
 thi paper consid transcod in which an mpeg stream is convert to a low-bit-r mpeg stream , and propos a method in which the transcod error can be reduc by optim select the quantiz paramet for each macroblock . in transcod with a low compress ratio , it is crucial to prohibit transcod with a requant paramet which is 1 to 2 time the quantiz paramet of the input stream . consequ , as the first step , an optim method for the requant paramet is propos which care for the error propag effect by interfram predict . then , the propos optim method is extend so that the method can also be appli to the case of a high compress ratio in which the rate-distort curv is approxim for each macroblock in the rang of requant paramet larger than 2 time the quantiz paramet . it is verifi by a simul experi that the psnr is improv by 0.5 to 0.8 db compar to the case in which a 6 mbit / s mpeg stream is not optim by twofold recompress

low-bit-rate MPEG stream
transcoding error
macroblock
compression ratio
error propagation effect
interframe prediction
rate-distortion curve
simulation
PSNR
6 Mbit/s
twofold recompression
requantization parameter optimization
rate conversion
rate control


An analytical model for a composite adaptive rectangular structure using the Heaviside function

Abstract: 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

an analyt model for a composit adapt rectangular structur use the heavisid function
 the object of thi articl is to describ a mathemat model , base on the heavisid function and on the delta -dirac distribut , for a composit adapt rectangular structur with embed and/or bond piezoelectr actuat and sensor . in the adopt structur model , the lamina are made up a configur of rectangular nonpiezoelectr and piezoelectr patch . the lamina do not all have the same area nor do they present the same configur , such that there are point where there is no materi . the equat of motion and the boundari condit , which describ the electromechan coupl , are base on the mindlin displac field , on the linear theori of piezoelectr , and on the hamilton principl

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


Active vibration control of piezolaminated smart beams

Abstract: This paper deals with the active vibration control of beam like structures with distributed piezoelectric sensor and actuator layers bonded on top and bottom surfaces of the beam. A finite element model based on Euler-Bernoulli beam theory has been developed. The contribution of the piezoelectric sensor and actuator layers on the mass and stiffness of the beam is considered. Three types of classical control strategies, namely direct proportional feedback, constant-gain negative velocity feedback and Lyapunov feedback and an optimal control strategy, linear quadratic regulator (LQR) scheme are applied to study their control effectiveness. Also, the control performance with different types of loading, such as impulse loading, step loading, harmonic and random loading is studied

activ vibrat control of piezolamin smart beam
 thi paper deal with the activ vibrat control of beam like structur with distribut piezoelectr sensor and actuat layer bond on top and bottom surfac of the beam . a finit element model base on euler-bernoulli beam theori ha been develop . the contribut of the piezoelectr sensor and actuat layer on the mass and stiff of the beam is consid . three type of classic control strategi , name direct proport feedback , constant-gain neg veloc feedback and lyapunov feedback and an optim control strategi , linear quadrat regul ( lqr ) scheme are appli to studi their control effect . also , the control perform with differ type of load , such as impuls load , step load , harmon and random load is studi

distributed piezoelectric actuator layers

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


A novel approach for the detection of pathlines in X-ray angiograms: the wavefront propagation algorithm

Abstract: Presents a new pathline approach, based on the wavefront propagation principle, and developed in order to reduce the variability in the outcomes of the quantitative coronary artery analysis. This novel approach, called wavepath, reduces the influence of the user-defined start- and endpoints of the vessel segment and is therefore more robust and improves the reproducibility of the lesion quantification substantially. The validation study shows that the wavepath method is totally constant in the middle part of the pathline, even when using the method for constructing a bifurcation or sidebranch pathline. Furthermore, the number of corrections needed to guide the wavepath through the correct vessel is decreased from an average of 0.44 corrections per pathline to an average of 0.12 per pathline. Therefore, it can be concluded that the wavepath algorithm improves the overall analysis substantially

a novel approach for the detect of pathlin in x-ray angiogram : the wavefront propag algorithm
 present a new pathlin approach , base on the wavefront propag principl , and develop in order to reduc the variabl in the outcom of the quantit coronari arteri analysi . thi novel approach , call wavepath , reduc the influenc of the user-defin start- and endpoint of the vessel segment and is therefor more robust and improv the reproduc of the lesion quantif substanti . the valid studi show that the wavepath method is total constant in the middl part of the pathlin , even when use the method for construct a bifurc or sidebranch pathlin . furthermor , the number of correct need to guid the wavepath through the correct vessel is decreas from an averag of 0.44 correct per pathlin to an averag of 0.12 per pathlin . therefor , it can be conclud that the wavepath algorithm improv the overal analysi substanti

X-ray angiograms
wavefront propagation algorithm
wavefront propagation principle
quantitative coronary artery analysis
vessel segment
lesion quantification
wavepath method
bifurcation
sidebranch pathline
corrections
correct vessel
user-defined startpoints
user-defined endpoints


Optimal bandwidth utilization of all-optical ring with a converter of degree 4

Abstract: In many models of all-optical routing, a set of communication paths in a network is given, and a wavelength is to be assigned to each path so that paths sharing an edge receive different wavelengths. The goal is to assign as few wavelengths as possible, in order to use the optical bandwidth efficiently. If a node of a network contains a wavelength converter, any path that passes through this node may change its wavelength. Having converters at some of the nodes can reduce the number of wavelengths required for routing. This paper presents a wavelength converter with degree 4 and gives a routing algorithm which shows that any routing with load L can be realized with L wavelengths when a node of an all-optical ring hosts such a wavelength converter. It is also proved that 4 is the minimum degree of the converter to reach the full utilization of the available wavelengths if only one node of an all-optical ring hosts a converter

optim bandwidth util of all-opt ring with a convert of degre 4
 in mani model of all-opt rout , a set of commun path in a network is given , and a wavelength is to be assign to each path so that path share an edg receiv differ wavelength . the goal is to assign as few wavelength as possibl , in order to use the optic bandwidth effici . if a node of a network contain a wavelength convert , ani path that pass through thi node may chang it wavelength . have convert at some of the node can reduc the number of wavelength requir for rout . thi paper present a wavelength convert with degre 4 and give a rout algorithm which show that ani rout with load l can be realiz with l wavelength when a node of an all-opt ring host such a wavelength convert . it is also prove that 4 is the minimum degre of the convert to reach the full util of the avail wavelength if onli one node of an all-opt ring host a convert

all-optical ring
all-optical routing
communication paths
wavelength converter
all-optical network
wavelength assignment
wavelength translation


Friedberg numberings of families of n-computably enumerable sets

Abstract: We establish a number of results on numberings, in particular, on Friedberg numberings, of families of d.c.e. sets. First, it is proved that there exists a Friedberg numbering of the family of all d.c.e. sets. We also show that this result, patterned on Friedberg's famous theorem for the family of all c.e. sets, holds for the family of all n-c.e. sets for any n > 2. Second, it is stated that there exists an infinite family of d.c.e. sets without a Friedberg numbering. Third, it is shown that there exists an infinite family of c.e. sets (treated as a family of d.c.e. sets) with a numbering which is unique up to equivalence. Fourth, it is proved that there exists a family of d.c.e. sets with a least numbering (under reducibility) which is Friedberg but is not the only numbering (modulo reducibility)

friedberg number of famili of n-comput enumer set
 we establish a number of result on number , in particular , on friedberg number , of famili of d.c.e . set . first , it is prove that there exist a friedberg number of the famili of all d.c.e . set . we also show that thi result , pattern on friedberg 's famou theorem for the famili of all c.e . set , hold for the famili of all n-c.e . set for ani n > 2 . second , it is state that there exist an infinit famili of d.c.e . set without a friedberg number . third , it is shown that there exist an infinit famili of c.e . set ( treat as a famili of d.c.e . set ) with a number which is uniqu up to equival . fourth , it is prove that there exist a famili of d.c.e . set with a least number ( under reduc ) which is friedberg but is not the onli number ( modulo reduc )


Taking it to the max [ventilation systems]

Abstract: Raising the volumetric air supply rate is one way of increasing the cooling capacity of displacement ventilation systems. David Butler and Michael Swainson explore how different types of diffusers can help make this work

take it to the max [ ventil system ]
 rais the volumetr air suppli rate is one way of increas the cool capac of displac ventil system . david butler and michael swainson explor how differ type of diffus can help make thi work

volumetric air supply rate
cooling capacity
displacement ventilation systems
diffusers


Sigma -admissible families over linear orders

Abstract: Admissible sets of the form HYP(M), where M is a recursively saturated system, are treated. We provide descriptions of subsets M, which are Sigma /sub */-sets in HYP(M), and of families of subsets M, which form Sigma -regular families in HYP(M), in terms of the concept of being fundamental couched in the article. Fundamental subsets and families are characterized for models of dense linear orderings

sigma -admiss famili over linear order
 admiss set of the form hyp(m ) , where m is a recurs satur system , are treat . we provid descript of subset m , which are sigma /sub * /-set in hyp(m ) , and of famili of subset m , which form sigma -regular famili in hyp(m ) , in term of the concept of be fundament couch in the articl . fundament subset and famili are character for model of dens linear order

Sigma -admissible families
linear orders
HYP(M)
recursively saturated system
fundamental subsets
dense linear orderings


Self-organized critical traffic in parallel computer networks

Abstract: In a recent paper, we analysed the dynamics of traffic flow in a simple, square lattice architecture. It was shown that a phase transition takes place between a free and a congested phase. The transition point was shown to exhibit optimal information transfer and wide fluctuations in time, with scale-free properties. In this paper, we further extend our analysis by considering a generalization of the previous model in which the rate of packet emission is regulated by the local congestion perceived by each node. As a result of the feedback between traffic congestion and packet release, the system is poised at criticality. Many well-known statistical features displayed by Internet traffic are recovered from our model in a natural way

self-organ critic traffic in parallel comput network
 in a recent paper , we analys the dynam of traffic flow in a simpl , squar lattic architectur . it wa shown that a phase transit take place between a free and a congest phase . the transit point wa shown to exhibit optim inform transfer and wide fluctuat in time , with scale-fre properti . in thi paper , we further extend our analysi by consid a gener of the previou model in which the rate of packet emiss is regul by the local congest perceiv by each node . as a result of the feedback between traffic congest and packet releas , the system is pois at critic . mani well-known statist featur display by internet traffic are recov from our model in a natur way

self-organized critical traffic
parallel computer networks
square lattice architecture
phase transition
congested phase
transition point
optimal information transfer
wide fluctuations
scale-free properties
generalization
packet emission
packet release
statistical features
Internet traffic
traffic flow dynamics
free phase


A computational model of learned avoidance behavior in a one-way avoidance experiment

Abstract: We present a computational model of learned avoidance behavior in a one-way avoidance experiment. Our model employs the reinforcement learning paradigm and a temporal-difference algorithm to implement both classically conditioned and instrumentally conditioned components. The role of the classically conditioned component is to develop an expectation of future benefit that is a function of the learning system's state and action. Competition among the instrumentally conditioned components determines the overt behavior generated by the learning system. Our model displays, in simulation, the reduced latency of the avoidance behavior during learning with continuing trials and the resistance to extinction of the avoidance response. These results are consistent with experimentally observed animal behavior. Our model extends the traditional two-process learning mechanism of Mowrer (1947) by explicitly defining the mechanisms of proprioceptive feedback, an internal clock, and generalization over the action space

a comput model of learn avoid behavior in a one-way avoid experi
 we present a comput model of learn avoid behavior in a one-way avoid experi . our model employ the reinforc learn paradigm and a temporal-differ algorithm to implement both classic condit and instrument condit compon . the role of the classic condit compon is to develop an expect of futur benefit that is a function of the learn system 's state and action . competit among the instrument condit compon determin the overt behavior gener by the learn system . our model display , in simul , the reduc latenc of the avoid behavior dure learn with continu trial and the resist to extinct of the avoid respons . these result are consist with experiment observ anim behavior . our model extend the tradit two-process learn mechan of mowrer ( 1947 ) by explicitli defin the mechan of propriocept feedback , an intern clock , and gener over the action space


Experimental investigation of active vibration control using neural networks and piezoelectric actuators

Abstract: The use of neural networks for identification and control of smart structures is investigated experimentally. Piezoelectric actuators are employed to suppress the vibrations of a cantilevered plate subject to impulse, sine wave and band-limited white noise disturbances. The neural networks used are multilayer perceptrons trained with error backpropagation. Validation studies show that the identifier predicts the system dynamics accurately. The controller is trained adaptively with the help of the neural identifier. Experimental results demonstrate excellent closed-loop performance and robustness of the neurocontroller

experiment investig of activ vibrat control use neural network and piezoelectr actuat
 the use of neural network for identif and control of smart structur is investig experiment . piezoelectr actuat are employ to suppress the vibrat of a cantilev plate subject to impuls , sine wave and band-limit white nois disturb . the neural network use are multilay perceptron train with error backpropag . valid studi show that the identifi predict the system dynam accur . the control is train adapt with the help of the neural identifi . experiment result demonstr excel closed-loop perform and robust of the neurocontrol

active vibration control
control
neural networks
piezoelectric actuators
identification
smart structures
cantilevered plate
white noise disturbances
multilayer perceptrons
error backpropagation
closed-loop performance
robustness
neurocontroller
vibration suppression


Study of ambiguities inherent to the spectral analysis of Voigt profiles-a modified Simplex approach

Abstract: In pulsed spectrometries, temporal transients are often analyzed directly in the temporal domain, assuming they consist only of purely exponentially decaying sinusoids. When experimental spectra actually consist of Gaussian or Voigt profiles (Gauss-Lorentz profiles), we show that the direct methods may erroneously interpret such lines as the sum of two or more Lorentzian profiles. Using a Nelder and Mead Simplex method, modified by introducing new means to avoid degeneracies and quenchings in secondary minima, we demonstrate that a large number of different solutions can be obtained with equivalent accuracy over the limited acquisition time interval, with final peak parameters devoid of physical or chemical meaning

studi of ambigu inher to the spectral analysi of voigt profiles-a modifi simplex approach
 in puls spectrometri , tempor transient are often analyz directli in the tempor domain , assum they consist onli of pure exponenti decay sinusoid . when experiment spectra actual consist of gaussian or voigt profil ( gauss-lorentz profil ) , we show that the direct method may erron interpret such line as the sum of two or more lorentzian profil . use a nelder and mead simplex method , modifi by introduc new mean to avoid degeneraci and quench in secondari minima , we demonstr that a larg number of differ solut can be obtain with equival accuraci over the limit acquisit time interv , with final peak paramet devoid of physic or chemic mean

spectral analysis
Voigt profiles
pulsed spectrometries
temporal transients
Gauss-Lorentz profiles
Nelder and Mead Simplex method
accuracy
limited acquisition time interval
final peak parameters
Gaussian profiles


A three-tier technology training strategy in a dynamic business environment

Abstract: As end-user training becomes increasingly important in today's technology-intensive business environment, progressive companies remain alert to find ways to provide their end users with timely training and resources. This paper describes an innovative training strategy adopted by one midsize organization to provide its end users with adequate, flexible, and responsive training. The paper then compares the three-tier strategy with other models described in technology training literature. Managers who supervise technology end users in organizations comparable to the one in the study may find the three-tier strategy workable and may want to use it in their own training programs to facilitate training and improve end-user skills. Researchers and scholars may find that the idea of three-tier training generates new opportunities for research

a three-tier technolog train strategi in a dynam busi environ
 as end-us train becom increasingli import in today 's technology-intens busi environ , progress compani remain alert to find way to provid their end user with time train and resourc . thi paper describ an innov train strategi adopt by one midsiz organ to provid it end user with adequ , flexibl , and respons train . the paper then compar the three-tier strategi with other model describ in technolog train literatur . manag who supervis technolog end user in organ compar to the one in the studi may find the three-tier strategi workabl and may want to use it in their own train program to facilit train and improv end-us skill . research and scholar may find that the idea of three-tier train gener new opportun for research


Implementation and performance evaluation of a FIFO queue class library for time warp

Abstract: 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 cannot 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

implement and perform evalu of a fifo queue class librari for time warp
 the author describ the implement , use , and perform evalu of a fifo queue class librari by mean of a high-perform , easy-to-us interfac employ for queu simul in parallel discret simul base on the time warp method . variou general-purpos simul librari and languag have been propos , and among these some have the advantag of not requir user to defin anyth other than the state vector , and not need awar of rollback under a platform which perform state control base on copi . howev , becaus the state vector must be defin as simpl data structur without pointer , dynam data structur such as a fifo queue can not be handl directli . under the propos class librari , both the platform and the user can handl such structur in the same fashion that embed data structur are handl . in addit , instead of all store data , just the oper histori can be store and recov effici at an effect minim cost by take advantag of the first-in-first-out characterist of the abov data structur . when the kernel delet past state histori dure a simul , garbag collect is also perform transpar use the correspond method

performance evaluation
FIFO queue
class library
easy-to-use interface
queuing simulations
parallel discrete simulations
general-purpose simulation libraries
state vectors
dynamic data structures
embedded data structures
operational history
first-in-first-out characteristics
garbage collection
time warp simulation
simulation languages
object oriented method
state management


Infrared-image classification using hidden Markov trees

Abstract: An image of a three-dimensional target is generally characterized by the visible target subcomponents, with these dictated by the target-sensor orientation (target pose). An image often changes quickly with variable pose. We define a class as a set of contiguous target-sensor orientations over which the associated target image is relatively stationary with aspect. Each target is in general characterized by multiple classes. A distinct set of Wiener filters are employed for each class of images, to identify the presence of target subcomponents. A Karhunen-Loeve representation is used to minimize the number of filters (templates) associated with a given subcomponent. The statistical relationships between the different target subcomponents are modeled via a hidden Markov tree (HMT). The HMT classifier is discussed and example results are presented for forward-looking-infrared (FLIR) imagery of several vehicles

infrared-imag classif use hidden markov tree
 an imag of a three-dimension target is gener character by the visibl target subcompon , with these dictat by the target-sensor orient ( target pose ) . an imag often chang quickli with variabl pose . we defin a class as a set of contigu target-sensor orient over which the associ target imag is rel stationari with aspect . each target is in gener character by multipl class . a distinct set of wiener filter are employ for each class of imag , to identifi the presenc of target subcompon . a karhunen-loev represent is use to minim the number of filter ( templat ) associ with a given subcompon . the statist relationship between the differ target subcompon are model via a hidden markov tree ( hmt ) . the hmt classifi is discuss and exampl result are present for forward-looking-infrar ( flir ) imageri of sever vehicl

infrared-image classification
hidden Markov trees
target-sensor orientation
target pose
contiguous target-sensor orientations
Wiener filters
Karhunen-Loeve representation
minimization
HMT
vehicles
IR image classification
3D target image
forward-looking-infrared imagery
FLIR imagery


Will CPXe save the photofinishing market?

Abstract: 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

will cpxe save the photofinish market ?
 a consortium of film supplier and electron firm ha propos the common pictur exchang environ . it will let divers provid cooper via the internet to sell digital-photo print

CPXe
photofinishing market
Common Picture Exchange environment
Kodak
Fujifilm
HP
Web-services standards


Hardware and software platform for real-time processing and visualization of echographic radiofrequency signals

Abstract: In this paper the architecture of a hardware and software platform, for ultrasonic investigation is presented. The platform, used in conjunction with an analog front-end hardware for driving the ultrasonic transducers of any commercial echograph, having the radiofrequency echo signal access, make it possible to dispose of a powerful echographic system for experimenting any processing technique, also in a clinical environment in which real-time operation mode is an essential prerequisite. The platform transforms any echograph into a test-system for evaluating the diagnostic effectiveness of new investigation techniques. A particular user interface was designed in order to allow a real-time and simultaneous visualization of the results produced in the different stages of the chosen processing procedure. This is aimed at obtaining a better optimization of the processing algorithm. The most important platform aspect, which also constitutes the basic differentiation with respect to similar systems, is the direct processing of the radiofrequency echo signal, which is essential for a complete analysis of the particular ultrasound-media interaction phenomenon. The platform completely integrates the architecture of a personal computer (PC) giving rise to several benefits, such as the quick technological evolution in the PC field and an extreme degree of programmability for different applications. The PC also constitutes the user interface, as a flexible and intuitive visualization support, and performs some software signal processing, by custom algorithms and commercial libraries. The realized close synergy between hardware and software allows the acquisition and real-time processing of the echographic radiofrequency (RF) signal with fast data representation

hardwar and softwar platform for real-tim process and visual of echograph radiofrequ signal
 in thi paper the architectur of a hardwar and softwar platform , for ultrason investig is present . the platform , use in conjunct with an analog front-end hardwar for drive the ultrason transduc of ani commerci echograph , have the radiofrequ echo signal access , make it possibl to dispos of a power echograph system for experi ani process techniqu , also in a clinic environ in which real-tim oper mode is an essenti prerequisit . the platform transform ani echograph into a test-system for evalu the diagnost effect of new investig techniqu . a particular user interfac wa design in order to allow a real-tim and simultan visual of the result produc in the differ stage of the chosen process procedur . thi is aim at obtain a better optim of the process algorithm . the most import platform aspect , which also constitut the basic differenti with respect to similar system , is the direct process of the radiofrequ echo signal , which is essenti for a complet analysi of the particular ultrasound-media interact phenomenon . the platform complet integr the architectur of a person comput ( pc ) give rise to sever benefit , such as the quick technolog evolut in the pc field and an extrem degre of programm for differ applic . the pc also constitut the user interfac , as a flexibl and intuit visual support , and perform some softwar signal process , by custom algorithm and commerci librari . the realiz close synergi between hardwar and softwar allow the acquisit and real-tim process of the echograph radiofrequ ( rf ) signal with fast data represent

software platform
real-time processing
echographic radiofrequency signal
user interface
personal computer
data visualization
hardware platform
ultrasonic imaging
clinical diagnosis


Optimal allocation of runs in a simulation metamodel with several independent variables

Abstract: Cheng and Kleijnen (1999) propose a very general regression metamodel for modelling the output of a queuing system. Its main limitations are that the regression function is based on a polynomial and that it can use only one independent variable. These limitations are removed here. We derive an explicit formula for the optimal way of assigning simulation runs to the different design points

optim alloc of run in a simul metamodel with sever independ variabl
 cheng and kleijnen ( 1999 ) propos a veri gener regress metamodel for model the output of a queu system . it main limit are that the regress function is base on a polynomi and that it can use onli one independ variabl . these limit are remov here . we deriv an explicit formula for the optim way of assign simul run to the differ design point

simulation metamodel
independent variables
general regression metamodel
queuing system
regression function
optimal runs allocation


Analogue realizations of fractional-order controllers

Abstract: An approach to the design of analogue circuits, implementing fractional-order controllers, is presented. The suggested approach is based on the use of continued fraction expansions; in the case of negative coefficients in a continued fraction expansion, the use of negative impedance converters is proposed. Several possible methods for obtaining suitable rational approximations and continued fraction expansions are discussed. An example of realization of a fractional-order I/sup lambda / controller is presented and illustrated by obtained measurements. The suggested approach can be used for the control of very fast processes, where the use of digital controllers is difficult or impossible

analogu realiz of fractional-ord control
 an approach to the design of analogu circuit , implement fractional-ord control , is present . the suggest approach is base on the use of continu fraction expans ; in the case of neg coeffici in a continu fraction expans , the use of neg imped convert is propos . sever possibl method for obtain suitabl ration approxim and continu fraction expans are discuss . an exampl of realiz of a fractional-ord i / sup lambda / control is present and illustr by obtain measur . the suggest approach can be use for the control of veri fast process , where the use of digit control is difficult or imposs

analogue realizations
fractional-order controllers
continued fraction expansions
fraction expansion
negative coefficients
negative impedance converters
rational approximations
fast processes
digital controllers
fractional differentiation
fractional integration


A conflict between language and atomistic information

Abstract: Fred Dretske and Jerry Fodor are responsible for popularizing three well-known theses in contemporary philosophy of mind: the thesis of Information-Based Semantics (IBS), the thesis of Content Atomism (Atomism) and the thesis of the Language of Thought (LOT). LOT concerns the semantically relevant structure of representations involved in cognitive states such as beliefs and desires. It maintains that all such representations must have syntactic structures mirroring the structure of their contents. IBS is a thesis about the nature of the relations that connect cognitive representations and their parts to their contents (semantic relations). It holds that these relations supervene solely on relations of the kind that support information content, perhaps with some help from logical principles of combination. Atomism is a thesis about the nature of the content of simple symbols. It holds that each substantive simple symbol possesses its content independently of all other symbols in the representational system. I argue that Dretske's and Fodor's theories are false and that their falsehood results from a conflict IBS and Atomism, on the one hand, and LOT, on the other

a conflict between languag and atomist inform
 fred dretsk and jerri fodor are respons for popular three well-known these s in contemporari philosophi of mind : the thesi of information-bas semant ( ib ) , the thesi of content atom ( atom ) and the thesi of the languag of thought ( lot ) . lot concern the semant relev structur of represent involv in cognit state such as belief and desir . it maintain that all such represent must have syntact structur mirror the structur of their content . ib is a thesi about the natur of the relat that connect cognit represent and their part to their content ( semant relat ) . it hold that these relat superven sole on relat of the kind that support inform content , perhap with some help from logic principl of combin . atom is a thesi about the natur of the content of simpl symbol . it hold that each substant simpl symbol possess it content independ of all other symbol in the represent system . i argu that dretsk 's and fodor 's theori are fals and that their falsehood result from a conflict ib and atom , on the one hand , and lot , on the other

philosophy of mind
Information-Based Semantics
IBS
Content Atomism
Language of Thought
LOT
cognitive states
beliefs
desires


On conflict-free executions of elementary nets

Abstract: Deals with analysis of elementary Petri nets with respect to possibilities of avoiding conflicts during their executions. There are two main aims of the paper. The first is to find a method of checking if a net is conflict-avoidable (i.e., if it possesses a conflict-free fair run). The second is to find a method of rebuilding any net to a totally conflict-avoidable net (i.e., a net possessing a conflict-free fair run in every one process) with the same behaviour. The main results are the following: 1. The proof of decidability, for elementary nets, of the problem of existence of a conflict-avoidable fair process (and an algorithm producing all fair runs). 2. Construction, for an arbitrary given elementary net, of a totally conflict-avoidable net with the same behaviour. The net, completed this way, has the same behaviour as the original one. Moreover, it is totally conflict-avoidable, and its execution may be supervised (in order to ensure conflict-freeness) by the reduced case graph built by the algorithm of the former section

on conflict-fre execut of elementari net
 deal with analysi of elementari petri net with respect to possibl of avoid conflict dure their execut . there are two main aim of the paper . the first is to find a method of check if a net is conflict-avoid ( i.e. , if it possess a conflict-fre fair run ) . the second is to find a method of rebuild ani net to a total conflict-avoid net ( i.e. , a net possess a conflict-fre fair run in everi one process ) with the same behaviour . the main result are the follow : 1 . the proof of decid , for elementari net , of the problem of exist of a conflict-avoid fair process ( and an algorithm produc all fair run ) . 2 . construct , for an arbitrari given elementari net , of a total conflict-avoid net with the same behaviour . the net , complet thi way , ha the same behaviour as the origin one . moreov , it is total conflict-avoid , and it execut may be supervis ( in order to ensur conflict-fre ) by the reduc case graph built by the algorithm of the former section

conflict-free executions
elementary Petri nets
conflict-free fair run
totally conflict-avoidable net
decidability
reduced case graph


Stability analysis of the characteristic polynomials whose coefficients are polynomials of interval parameters using monotonicity

Abstract: 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

stabil analysi of the characterist polynomi whose coeffici are polynomi of interv paramet use monoton
 we analyz the stabil of the characterist polynomi whose coeffici are polynomi of interv paramet via monoton method . our stabil condit are base on frazer-duncan 's theorem and all condit can be check use onli endpoint valu of interv paramet . these stabil condit are necessari and suffici under the monoton assumpt . when the monoton condit do not hold on the whole paramet region , we present an interv divis method and a transform algorithm in order to appli the monoton condit . then , our stabil analysi method can be appli to all characterist polynomi whose coeffici are polynomi of interv paramet

stability analysis
characteristic polynomials
interval parameters
monotonicity
endpoint values
interval division method
transformation algorithm
Frazer-Duncan theorem
necessary and sufficient conditions


New thinking on rendering

Abstract: Looks at how graphics hardware solves a range of rendering problems

new think on render
 look at how graphic hardwar solv a rang of render problem

rendering
graphics hardware
programmability
Gourand-shaded image
color values


Calibrated initials for an EM applied to recursive models of categorical variables

Abstract: The estimates from an EM, when it is applied to a large causal model of 10 or more categorical variables, are often subject to the initial values for the estimates. This phenomenon becomes more serious as the model structure becomes more complicated involving more variables. As a measure of compensation for this, it has been recommended in literature that EMs are implemented several times with different sets of initial values to obtain more appropriate estimates. We propose an improved approach for initial values. The main idea is that we use initials that are calibrated to data. A simulation result strongly indicates that the calibrated initials give rise to the estimates that are far closer to the true values than the initials that are not calibrated

calibr initi for an em appli to recurs model of categor variabl
 the estim from an em , when it is appli to a larg causal model of 10 or more categor variabl , are often subject to the initi valu for the estim . thi phenomenon becom more seriou as the model structur becom more complic involv more variabl . as a measur of compens for thi , it ha been recommend in literatur that em are implement sever time with differ set of initi valu to obtain more appropri estim . we propos an improv approach for initi valu . the main idea is that we use initi that are calibr to data . a simul result strongli indic that the calibr initi give rise to the estim that are far closer to the true valu than the initi that are not calibr

calibrated initials
EM
recursive models
categorical variables
large causal model
initial values
simulation


Three-dimensional global MHD simulation code for the Earth's magnetosphere using HPF/JA

Abstract: We have translated a three-dimensional magnetohydrodynamic (MHD) simulation code of the Earth's magnetosphere from VPP Fortran to HPF/JA on the Fujitsu VPP5000/56 vector-parallel supercomputer and the MHD code was fully vectorized and fully parallelized in VPP Fortran. The entire performance and capability of the HPF MHD code could be shown to be almost comparable to that of VPP Fortran. A three-dimensional global MHD simulation of the Earth's magnetosphere was performed at a speed of over 400 Gflops with an efficiency of 76.5% using 56 processing elements of the Fujitsu VPP5000/56 in vector and parallel computation that permitted comparison with catalog values. We have concluded that fluid and MHD codes that are fully vectorized and fully parallelized in VPP Fortran can be translated with relative ease to HPF/JA, and a code in HPF/JA may be expected to perform comparably to the same code written in VPP Fortran

three-dimension global mhd simul code for the earth 's magnetospher use hpf / ja
 we have translat a three-dimension magnetohydrodynam ( mhd ) simul code of the earth 's magnetospher from vpp fortran to hpf / ja on the fujitsu vpp5000/56 vector-parallel supercomput and the mhd code wa fulli vector and fulli parallel in vpp fortran . the entir perform and capabl of the hpf mhd code could be shown to be almost compar to that of vpp fortran . a three-dimension global mhd simul of the earth 's magnetospher wa perform at a speed of over 400 gflop with an effici of 76.5 % use 56 process element of the fujitsu vpp5000/56 in vector and parallel comput that permit comparison with catalog valu . we have conclud that fluid and mhd code that are fulli vector and fulli parallel in vpp fortran can be translat with rel eas to hpf / ja , and a code in hpf / ja may be expect to perform compar to the same code written in vpp fortran

MHD simulation
Fujitsu VPP5000/56
vector-parallel supercomputer
HPF MHD code
parallel computation
magnetohydrodynamic simulation


Decomposition of additive cellular automata

Abstract: Finite additive cellular automata with fixed and periodic boundary conditions are considered as endomorphisms over pattern spaces. A characterization of the nilpotent and regular parts of these endomorphisms is given in terms of their minimal polynomials. Generalized eigenspace decomposition is determined and relevant cyclic subspaces are described in terms of symmetries. As an application, the lengths and frequencies of limit cycles in the transition diagram of the automaton are calculated

decomposit of addit cellular automata
 finit addit cellular automata with fix and period boundari condit are consid as endomorph over pattern space . a character of the nilpot and regular part of these endomorph is given in term of their minim polynomi . gener eigenspac decomposit is determin and relev cyclic subspac are describ in term of symmetri . as an applic , the length and frequenc of limit cycl in the transit diagram of the automaton are calcul

cellular automata
endomorphisms
transition diagram
finite cellular automaton
computational complexity


The fully entangled fraction as an inclusive measure of entanglement applications

Abstract: Characterizing entanglement in all but the simplest case of a two qubit pure state is a hard problem, even understanding the relevant experimental quantities that are related to entanglement is difficult. It may not be necessary, however, to quantify the entanglement of a state in order to quantify the quantum information processing significance of a state. It is known that the fully entangled fraction has a direct relationship to the fidelity of teleportation maximized under the actions of local unitary operations. In the case of two qubits we point out that the fully entangled fraction can also be related to the fidelities, maximized under the actions of local unitary operations, of other important quantum information tasks such as dense coding, entanglement swapping and quantum cryptography in such a way as to provide an inclusive measure of these entanglement applications. For two qubit systems the fully entangled fraction has a simple known closed-form expression and we establish lower and upper bounds of this quantity with the concurrence. This approach is readily extendable to more complicated systems

the fulli entangl fraction as an inclus measur of entangl applic
 character entangl in all but the simplest case of a two qubit pure state is a hard problem , even understand the relev experiment quantiti that are relat to entangl is difficult . it may not be necessari , howev , to quantifi the entangl of a state in order to quantifi the quantum inform process signific of a state . it is known that the fulli entangl fraction ha a direct relationship to the fidel of teleport maxim under the action of local unitari oper . in the case of two qubit we point out that the fulli entangl fraction can also be relat to the fidel , maxim under the action of local unitari oper , of other import quantum inform task such as dens code , entangl swap and quantum cryptographi in such a way as to provid an inclus measur of these entangl applic . for two qubit system the fulli entangl fraction ha a simpl known closed-form express and we establish lower and upper bound of thi quantiti with the concurr . thi approach is readili extend to more complic system

fully entangled fraction
entanglement
two qubit pure state
quantum information processing
fidelity
teleportation
entanglement swapping
quantum cryptography


A high-resolution high-frequency monolithic top-shooting microinjector free of satellite drops - part I: concept, design, and model

Abstract: Introduces an innovative microinjector design, featuring a bubble valve, which entails superior droplet ejection characteristics and monolithic fabrication, which allows handling of a wide range of liquids. This new microinjector uses asymmetric bubbles to reduce crosstalk, increase frequency response and eliminate satellite droplets. During a firing, i.e., droplet ejection, the "virtual valve" closes, by growing a thermal bubble in the microchannel, to isolate the microchamber from the liquid supply and neighboring chambers. Between firings, however, the virtual valve opens, by collapsing the bubble, to reduce flow restriction for fast refilling of the microchamber. The use of bubble valves brings about fast and reliable device operation without imposing the significant complication fabrication of physical microvalves would call for. In addition, through a special heater configuration and chamber designs, bubbles surrounding the nozzle cut off the tail of the droplets being ejected and completely eliminate satellite droplets. A simple one-dimensional model of the operation of the microinjector is used to estimate the bubble formation and liquid refilling

a high-resolut high-frequ monolith top-shoot microinjector free of satellit drop - part i : concept , design , and model
 introduc an innov microinjector design , featur a bubbl valv , which entail superior droplet eject characterist and monolith fabric , which allow handl of a wide rang of liquid . thi new microinjector use asymmetr bubbl to reduc crosstalk , increas frequenc respons and elimin satellit droplet . dure a fire , i.e. , droplet eject , the " virtual valv " close , by grow a thermal bubbl in the microchannel , to isol the microchamb from the liquid suppli and neighbor chamber . between fire , howev , the virtual valv open , by collaps the bubbl , to reduc flow restrict for fast refil of the microchamb . the use of bubbl valv bring about fast and reliabl devic oper without impos the signific complic fabric of physic microvalv would call for . in addit , through a special heater configur and chamber design , bubbl surround the nozzl cut off the tail of the droplet be eject and complet elimin satellit droplet . a simpl one-dimension model of the oper of the microinjector is use to estim the bubbl format and liquid refil

monolithic top-shooting microinjector
bubble valve
droplet ejection characteristics
asymmetric bubbles
crosstalk
frequency response
satellite droplets
virtual valve
flow restriction
chamber designs
liquid refilling
inkjet printing
thermal bubble jet


TCP explicit congestion notification over ATM-UBR: a simulation study

Abstract: The enhancement of transmission control protocol's (TCP's) congestion control mechanisms using explicit congestion notification (ECN) over asynchronous transfer mode (ATM) networks is overviewed. TCP's congestion control is enhanced so that congestion is indicated by not only packet losses as is currently the case but an agent implemented at the ATM network's edge as well. The novel idea uses EFCI (explicit forward congestion indication) bits (available in every ATM cell header) to generalize the ECN response to the UBR (unspecified bit rate) service, notify congestion, and adjust the credit-based window size of the TCR. The authors' simulation experiments show that TCP ECN achieves significantly lower cell loss, packet retransmissions, and buffer utilization, and exhibits better throughput than (non-ECN) TCP Reno

tcp explicit congest notif over atm-ubr : a simul studi
 the enhanc of transmiss control protocol 's ( tcp 's ) congest control mechan use explicit congest notif ( ecn ) over asynchron transfer mode ( atm ) network is overview . tcp 's congest control is enhanc so that congest is indic by not onli packet loss as is current the case but an agent implement at the atm network 's edg as well . the novel idea use efci ( explicit forward congest indic ) bit ( avail in everi atm cell header ) to gener the ecn respons to the ubr ( unspecifi bit rate ) servic , notifi congest , and adjust the credit-bas window size of the tcr . the author ' simul experi show that tcp ecn achiev significantli lower cell loss , packet retransmiss , and buffer util , and exhibit better throughput than ( non-ecn ) tcp reno

explicit forward congestion indication bits


Universal approximation by hierarchical fuzzy system with constraints on the fuzzy rule

Abstract: This paper presents a special hierarchical fuzzy system where the outputs of the previous layer are not used in the IF-parts, but used only in the THEN-parts of the fuzzy rules of the current layer. The proposed scheme can be shown to be a universal approximator to any continuous function on a compact set if complete fuzzy sets are used in the IF-parts of the fuzzy rules with singleton fuzzifier and center average defuzzifier. From the simulation of ball and beam control system, it is demonstrated that the proposed scheme approximates with good accuracy the model nonlinear controller with fewer fuzzy rules than the centralized fuzzy system and its control performance is comparable to that of the nonlinear controller

univers approxim by hierarch fuzzi system with constraint on the fuzzi rule
 thi paper present a special hierarch fuzzi system where the output of the previou layer are not use in the if-part , but use onli in the then-part of the fuzzi rule of the current layer . the propos scheme can be shown to be a univers approxim to ani continu function on a compact set if complet fuzzi set are use in the if-part of the fuzzi rule with singleton fuzzifi and center averag defuzzifi . from the simul of ball and beam control system , it is demonstr that the propos scheme approxim with good accuraci the model nonlinear control with fewer fuzzi rule than the central fuzzi system and it control perform is compar to that of the nonlinear control

universal approximator
hierarchical fuzzy system
fuzzy rules
continuous function
ball and beam control system
hierarchical fuzzy logic
Stone-Weierstrass theorem


Approximating martingales for variance reduction in Markov process simulation

Abstract: "Knowledge of either analytical or numerical approximations should enable more efficient simulation estimators to be constructed." This principle seems intuitively plausible and certainly attractive, yet no completely satisfactory general methodology has been developed to exploit it. The authors present a new approach for obtaining variance reduction in Markov process simulation that is applicable to a vast array of different performance measures. The approach relies on the construction of a martingale that is then used as an internal control variate

approxim martingal for varianc reduct in markov process simul
 " knowledg of either analyt or numer approxim should enabl more effici simul estim to be construct . " thi principl seem intuit plausibl and certainli attract , yet no complet satisfactori gener methodolog ha been develop to exploit it . the author present a new approach for obtain varianc reduct in markov process simul that is applic to a vast array of differ perform measur . the approach reli on the construct of a martingal that is then use as an intern control variat

martingales
variance reduction
Markov process simulation
performance measures
internal control variate
approximating martingale-process method
complex stochastic processes
single-server queue


A notion of non-interference for timed automata

Abstract: The non-interference property of concurrent systems is a security property concerning the flow of information among different levels of security of the system. In this paper we introduce a notion of timed non-interference for real-time systems specified by timed automata. The notion is presented using an automata based approach and then it is characterized also by operations and equivalence between timed languages. The definition is applied to an example of a time-critical system modeling a simplified control of an airplane

a notion of non-interfer for time automata
 the non-interfer properti of concurr system is a secur properti concern the flow of inform among differ level of secur of the system . in thi paper we introduc a notion of time non-interfer for real-tim system specifi by time automata . the notion is present use an automata base approach and then it is character also by oper and equival between time languag . the definit is appli to an exampl of a time-crit system model a simplifi control of an airplan

timed automata
concurrent systems
security property
real-time systems
time-critical system
noninterference notion


Robust output-feedback control for linear continuous uncertain state delayed systems with unknown time delay

Abstract: The state-delayed time often is unknown and independent of other variables in most real physical systems. A new stability criterion for uncertain systems with a state time-varying delay is proposed. Then, a robust observer-based control law based on this criterion is constructed via the sequential quadratic programming method. We also develop a separation property so that the state feedback control law and observer can be independently designed and maintain closed-loop system stability. An example illustrates the availability of the proposed design method

robust output-feedback control for linear continu uncertain state delay system with unknown time delay
 the state-delay time often is unknown and independ of other variabl in most real physic system . a new stabil criterion for uncertain system with a state time-vari delay is propos . then , a robust observer-bas control law base on thi criterion is construct via the sequenti quadrat program method . we also develop a separ properti so that the state feedback control law and observ can be independ design and maintain closed-loop system stabil . an exampl illustr the avail of the propos design method

output-feedback control
state delayed systems
time delay
uncertain systems
state time-varying delay
observer-based control law
sequential quadratic programming
state feedback control law
closed-loop system stability
robust control
linear continuous systems


Variety identification of wheat using mass spectrometry with neural networks and the influence of mass spectra processing prior to neural network analysis

Abstract: The performance of matrix-assisted laser desorption/ionisation time-of-flight mass spectrometry with neural networks in wheat variety classification is further evaluated. Two principal issues were studied: (a) the number of varieties that could be classified correctly; and (b) various means of preprocessing mass spectrometric data. The number of wheat varieties tested was increased from 10 to 30. The main pre-processing method investigated was based on Gaussian smoothing of the spectra, but other methods based on normalisation procedures and multiplicative scatter correction of data were also used. With the final method, it was possible to classify 30 wheat varieties with 87% correctly classified mass spectra and a correlation coefficient of 0.90

varieti identif of wheat use mass spectrometri with neural network and the influenc of mass spectra process prior to neural network analysi
 the perform of matrix-assist laser desorpt / ionis time-of-flight mass spectrometri with neural network in wheat varieti classif is further evalu . two princip issu were studi : ( a ) the number of varieti that could be classifi correctli ; and ( b ) variou mean of preprocess mass spectrometr data . the number of wheat varieti test wa increas from 10 to 30 . the main pre-process method investig wa base on gaussian smooth of the spectra , but other method base on normalis procedur and multipl scatter correct of data were also use . with the final method , it wa possibl to classifi 30 wheat varieti with 87 % correctli classifi mass spectra and a correl coeffici of 0.90


Watermarking techniques for electronic delivery of remote sensing images

Abstract: Earth observation missions have recently attracted a growing interest, mainly due to the large number of possible applications capable of exploiting remotely sensed data and images. Along with the increase of market potential, the need arises for the protection of the image products. Such a need is a very crucial one, because the Internet and other public/private networks have become preferred means of data exchange. A critical issue arising when dealing with digital image distribution is copyright protection. Such a problem has been largely addressed by resorting to watermarking technology. A question that obviously arises is whether the requirements imposed by remote sensing imagery are compatible with existing watermarking techniques. On the basis of these motivations, the contribution of this work is twofold: assessment of the requirements imposed by remote sensing applications on watermark-based copyright protection, and modification of two well-established digital watermarking techniques to meet such constraints. More specifically, the concept of near-lossless watermarking is introduced and two possible algorithms matching such a requirement are presented. Experimental results are shown to measure the impact of watermark introduction on a typical remote sensing application, i.e., unsupervised image classification

watermark techniqu for electron deliveri of remot sens imag
 earth observ mission have recent attract a grow interest , mainli due to the larg number of possibl applic capabl of exploit remot sens data and imag . along with the increas of market potenti , the need aris for the protect of the imag product . such a need is a veri crucial one , becaus the internet and other public / privat network have becom prefer mean of data exchang . a critic issu aris when deal with digit imag distribut is copyright protect . such a problem ha been larg address by resort to watermark technolog . a question that obvious aris is whether the requir impos by remot sens imageri are compat with exist watermark techniqu . on the basi of these motiv , the contribut of thi work is twofold : assess of the requir impos by remot sens applic on watermark-bas copyright protect , and modif of two well-establish digit watermark techniqu to meet such constraint . more specif , the concept of near-lossless watermark is introduc and two possibl algorithm match such a requir are present . experiment result are shown to measur the impact of watermark introduct on a typic remot sens applic , i.e. , unsupervis imag classif

watermarking techniques
electronic delivery
remote sensing images
Earth observation missions
digital image distribution
copyright protection
digital watermarking
near-lossless watermarking
unsupervised image classification


Adaptive scheduling of batch servers in flow shops

Abstract: Batch servicing is a common way of benefiting from economies of scale in manufacturing operations. Good examples of production systems that allow for batch processing are ovens found in the aircraft industry and in semiconductor manufacturing. In this paper we study the issue of dynamic scheduling of such systems within the context of multi-stage flow shops. So far, a great deal of research has concentrated on the development of control strategies, which only address the batch stage. This paper proposes an integral scheduling approach that also includes succeeding stages. In this way, we aim for shop optimization, instead of optimizing performance for a single stage. Our so-called look-ahead strategy adapts its scheduling decision to shop status, which includes information on a limited number of near-future arrivals. In particular, we study a two-stage flow shop, in which the batch stage is succeeded by a serial stage. The serial stage may be realized by a single machine or by parallel machines. Through an extensive simulation study it is demonstrated how shop performance can be improved by the proposed strategy relative to existing strategies

adapt schedul of batch server in flow shop
 batch servic is a common way of benefit from economi of scale in manufactur oper . good exampl of product system that allow for batch process are oven found in the aircraft industri and in semiconductor manufactur . in thi paper we studi the issu of dynam schedul of such system within the context of multi-stag flow shop . so far , a great deal of research ha concentr on the develop of control strategi , which onli address the batch stage . thi paper propos an integr schedul approach that also includ succeed stage . in thi way , we aim for shop optim , instead of optim perform for a singl stage . our so-cal look-ahead strategi adapt it schedul decis to shop statu , which includ inform on a limit number of near-futur arriv . in particular , we studi a two-stag flow shop , in which the batch stage is succeed by a serial stage . the serial stage may be realiz by a singl machin or by parallel machin . through an extens simul studi it is demonstr how shop perform can be improv by the propos strategi rel to exist strategi

adaptive scheduling
batch servers
flow shops
batch servicing
manufacturing operations
production systems
ovens
aircraft industry
semiconductor manufacturing
dynamic scheduling
multi-stage flow shops
control strategies
integral scheduling approach
shop optimization
look-ahead strategy
near-future arrivals
two-stage flow shop
single machine
parallel machines
simulation study


A look at MonacoProfiler 4

Abstract: 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

a look at monacoprofil 4
 the newest profil program from monaco softwar add some valuabl featur : support for up to 8-color print , profil for digit camera , fine-tun of black gener and tweak of profil transform . we test it eas of use and a few of the advanc function . in all , it 's pretti good

MonacoProfiler 4
color-correction
Pantone Hexachrome
commercial printers