Arranging solid balls to represent a graph

Abstract: By solid balls, we mean a set of balls in R/sup 3/ no two of which can penetrate each other. Every finite graph G can be represented by arranging solid balls in the following way: Put red balls in R/sup 3/, one for each vertex of G, and connect two red balls by a chain when they correspond to a pair of adjacent vertices of G, where a chain means a finite sequence of blue solid balls in which each consecutive balls are tangent. (We may omit the chain if the two red balls are already tangent.) The ball number b(G) of G is the minimum number of balls (red and blue) necessary to represent G. If we put the balls and chains on a table so that all balls sit on the table, then the minimum number of balls for G is denoted by bT(G). Among other things, we prove that b(K/sub 6/) = 8, b(K/sub 7/) = 13 and b/sub T/(K/sub 5/) = 8,b/sub T/(K/sub 6/) = 14. We also prove that c/sub 1/n/sup 3/ < b(K/sub n/) < c/sub 2/n/sup 3/ log n, c/sub 3/n/sup 4//log n < b/sub T/(K/sub n/) < c/sub 4/n/sup 4/

arrang solid ball to repres a graph
 by solid ball , we mean a set of ball in r / sup 3/ no two of which can penetr each other . everi finit graph g can be repres by arrang solid ball in the follow way : put red ball in r / sup 3/ , one for each vertex of g , and connect two red ball by a chain when they correspond to a pair of adjac vertic of g , where a chain mean a finit sequenc of blue solid ball in which each consecut ball are tangent . ( we may omit the chain if the two red ball are alreadi tangent . ) the ball number b(g ) of g is the minimum number of ball ( red and blue ) necessari to repres g. if we put the ball and chain on a tabl so that all ball sit on the tabl , then the minimum number of ball for g is denot by bt(g ) . among other thing , we prove that b(k / sub 6/ ) = 8 , b(k / sub 7/ ) = 13 and b / sub t/(k / sub 5/ ) = 8,b / sub t/(k / sub 6/ ) = 14 . we also prove that c / sub 1 / n / sup 3/ < b(k / sub n/ ) < c / sub 2 / n / sup 3/ log n , c / sub 3 / n / sup 4//log n < b / sub t/(k / sub n/ ) < c / sub 4 / n / sup 4/

solid balls
finite graph
adjacent vertices
finite sequence
graph representation


Integrated support based on task models for the design, evaluation, and documentation of interactive safety-critical systems: a case study in the air-traffic control domain

Abstract: This paper presents an approach to using task models in both the design and the evaluation phases of interactive safety-critical applications. We explain how it is possible to use information contained in task models to support the design and development of effective user interfaces. Moreover, we show how task models can also support a systematic inspection-based usability assessment by examining possible deviations that can occur while users interact with the system, an important issue especially when coping with the peculiar requirements of safety-critical applications. Such evaluation provides useful technical documentation to help users achieve an in-depth understanding of the system and its design rationale. Lastly, a description of the application of our approach to a real case study in the air-traffic control domain will illustrate the main features of the proposed method. In particular, we discuss examples taken from an application for air-traffic controllers in an aerodrome supported by graphical user interfaces for data-link communications with pilots

integr support base on task model for the design , evalu , and document of interact safety-crit system : a case studi in the air-traff control domain
 thi paper present an approach to use task model in both the design and the evalu phase of interact safety-crit applic . we explain how it is possibl to use inform contain in task model to support the design and develop of effect user interfac . moreov , we show how task model can also support a systemat inspection-bas usabl assess by examin possibl deviat that can occur while user interact with the system , an import issu especi when cope with the peculiar requir of safety-crit applic . such evalu provid use technic document to help user achiev an in-depth understand of the system and it design rational . lastli , a descript of the applic of our approach to a real case studi in the air-traff control domain will illustr the main featur of the propos method . in particular , we discuss exampl taken from an applic for air-traff control in an aerodrom support by graphic user interfac for data-link commun with pilot

integrated support
task models
interactive safety-critical systems
air-traffic control domain
user interfaces
inspection-based usability assessment
technical documentation
graphical user interfaces
data-link communications


Documentum completes CM Trifecta

Abstract: Daily, people participating in clinical trials for drug companies fill out forms describing how they feel physically and emotionally. For some trials, there are hundreds, possibly thousands, of participants. The drug companies must compile all the forms and submit them electronically to the FDA. That's where Documentum comes in. "We've streamlined the whole process of managing clinical trial content for companies, such as Johnson & Johnson, Bristol Myers Squibb, and Pfizer," notes Documentum's president and CEO Dave De Walt. "And by the way, the FDA also is one of our customers, as well as the EPA and the FAA." And there are about 1,300 other organizations in various industries worldwide that rely on Documentum's technologies, consulting, and training services. The company's products are designed to manage digital content and facilitate online transactions, partner and supplier relationships, and ebusiness interactions

documentum complet cm trifecta
 daili , peopl particip in clinic trial for drug compani fill out form describ how they feel physic and emot . for some trial , there are hundr , possibl thousand , of particip . the drug compani must compil all the form and submit them electron to the fda . that 's where documentum come in . " we 've streamlin the whole process of manag clinic trial content for compani , such as johnson & johnson , bristol myer squibb , and pfizer , " note documentum 's presid and ceo dave de walt . " and by the way , the fda also is one of our custom , as well as the epa and the faa . " and there are about 1,300 other organ in variou industri worldwid that reli on documentum 's technolog , consult , and train servic . the compani 's product are design to manag digit content and facilit onlin transact , partner and supplier relationship , and ebusi interact

Documentum
clinical trials
drug companies
FDA
clinical trial content
training services
consulting services


Vibration control of the rotating flexible-shaft/multi-flexible-disk system with the eddy-current damper

Abstract: In this paper, the rotating flexible-Timoshenko-shaft/flexible-disk coupling system is formulated by applying the assumed-mode method into the kinetic and strain energies, and the virtual work done by the eddy-current damper. From Lagrange's equations, the resulting discretized equations of motion can be simplified as a bilinear system (BLS). Introducing the control laws, including the quadratic, nonlinear and optimal feedback control laws, into the BLS, it is found that the eddy-current damper can be used to suppress flexible and shear vibrations simultaneously, and the system is globally asymptotically stable. Numerical results are provided to validate the theoretical analysis

vibrat control of the rotat flexible-shaft / multi-flexible-disk system with the eddy-curr damper
 in thi paper , the rotat flexible-timoshenko-shaft / flexible-disk coupl system is formul by appli the assumed-mod method into the kinet and strain energi , and the virtual work done by the eddy-curr damper . from lagrang 's equat , the result discret equat of motion can be simplifi as a bilinear system ( bl ) . introduc the control law , includ the quadrat , nonlinear and optim feedback control law , into the bl , it is found that the eddy-curr damper can be use to suppress flexibl and shear vibrat simultan , and the system is global asymptot stabl . numer result are provid to valid the theoret analysi


Dense coding in entangled states

Abstract: We consider the dense coding of entangled qubits shared between two parties, Alice and Bob. The efficiency of classical information gain through quantum entangled qubits is also considered for the case of pairwise entangled qubits and maximally entangled qubits. We conclude that using the pairwise entangled qubits can be more efficient when two parties communicate whereas using the maximally entangled qubits can be more efficient when the N parties communicate

dens code in entangl state
 we consid the dens code of entangl qubit share between two parti , alic and bob . the effici of classic inform gain through quantum entangl qubit is also consid for the case of pairwis entangl qubit and maxim entangl qubit . we conclud that use the pairwis entangl qubit can be more effici when two parti commun wherea use the maxim entangl qubit can be more effici when the n parti commun

dense coding
entangled states
Alice
Bob
pairwise entangled qubits
maximally entangled qubits
classical information gain efficiency
quantum information processing
quantum communication


Use of neural networks in the analysis of particle size distribution by laser diffraction: tests with different particle systems

Abstract: The application of forward light scattering methods for estimating the particle size distribution (PSD) is usually limited by the occurrence of multiple scattering, which affects the angular distribution of light in highly concentrated suspensions, thus resulting in false calculations by the conventionally adopted algorithms. In this paper, a previously proposed neural network-based method is tested with different particle systems, in order to evaluate its applicability. In the first step of the study, experiments were carried out with solid-liquid suspensions having different characteristics of particle shape and size distribution, under varying solid concentrations. The experimental results, consisting of the angular distribution of light intensity, particle shape and suspension concentration, were used as input data in the fitting of neural network models (NN) that replaced the optical model to provide the PSD. The reference values of particle shape and PSD for the NN fitting were based on image analysis. Comparisons between the PSD values computed by the NN model and the reference values indicate that the method can be used in monitoring the PSD of particles with different shapes in highly concentrated suspensions, thus extending the range of application of forward laser diffraction to a number of systems with industrial interest

use of neural network in the analysi of particl size distribut by laser diffract : test with differ particl system
 the applic of forward light scatter method for estim the particl size distribut ( psd ) is usual limit by the occurr of multipl scatter , which affect the angular distribut of light in highli concentr suspens , thu result in fals calcul by the convent adopt algorithm . in thi paper , a previous propos neural network-bas method is test with differ particl system , in order to evalu it applic . in the first step of the studi , experi were carri out with solid-liquid suspens have differ characterist of particl shape and size distribut , under vari solid concentr . the experiment result , consist of the angular distribut of light intens , particl shape and suspens concentr , were use as input data in the fit of neural network model ( nn ) that replac the optic model to provid the psd . the refer valu of particl shape and psd for the nn fit were base on imag analysi . comparison between the psd valu comput by the nn model and the refer valu indic that the method can be use in monitor the psd of particl with differ shape in highli concentr suspens , thu extend the rang of applic of forward laser diffract to a number of system with industri interest

particle size distribution
laser diffraction
forward light scattering
multiple scattering
angular distribution of light
solid-liquid suspensions
neural network modeling
image analysis
particle shape distribution
pattern recognition
powdered materials
backpropagation algorithm
Fraunhofer optical model
fluidized catalytic cracking


VoIP: leveraging existing cable architecture

Abstract: As operators prepare to enter the voice-over-IP fray, they are searching for ways to leverage their existing two-way, interactive infrastructure. There are several approaches for supporting VoIP on top of the core IP transport network. The one garnering the most interest, especially in the United States, is based on the PacketCable 1.x architecture. This article discusses the PacketCable-based approach

voip : leverag exist cabl architectur
 as oper prepar to enter the voice-over-ip fray , they are search for way to leverag their exist two-way , interact infrastructur . there are sever approach for support voip on top of the core ip transport network . the one garner the most interest , especi in the unit state , is base on the packetc 1.x architectur . thi articl discuss the packetcable-bas approach

VoIP
cable architecture
voice-over-IP
core IP transport network
United States
PacketCable 1.x architecture
PacketCable-based approach
two-way interactive infrastructure


On biorthogonal nonuniform filter banks and tree structures

Abstract: This paper concerns biorthogonal nonuniform filter banks. It is shown that a tree structured filter bank is biorthogonal if it is equivalent to a tree structured filter bank whose matching constituent levels on the analysis and synthesis sides are themselves biorthogonal pairs. We then show that a stronger statement can be made about dyadic filter banks in general: That a dyadic filter bank is biorthogonal if both the analysis and synthesis banks can be decomposed into dyadic trees. We further show that these decompositions are stability and FIR preserving. These results, derived for filter banks having filters with rational transfer functions, thus extend some of the earlier comparable results for orthonormal filter banks

on biorthogon nonuniform filter bank and tree structur
 thi paper concern biorthogon nonuniform filter bank . it is shown that a tree structur filter bank is biorthogon if it is equival to a tree structur filter bank whose match constitu level on the analysi and synthesi side are themselv biorthogon pair . we then show that a stronger statement can be made about dyadic filter bank in gener : that a dyadic filter bank is biorthogon if both the analysi and synthesi bank can be decompos into dyadic tree . we further show that these decomposit are stabil and fir preserv . these result , deriv for filter bank have filter with ration transfer function , thu extend some of the earlier compar result for orthonorm filter bank

biorthogonal nonuniform filter banks
tree structured filter bank
biorthogonal pairs
dyadic filter banks
dyadic trees
FIR preserving
rational transfer functions
stability preserving


Aggregators versus disintermediators: battling it out in the information superhighstreet

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

aggreg versu disintermedi : battl it out in the inform superhighstreet
 perhap the futur of large-scal content aggreg is now no longer in doubt but thi wa not the case 10 year ago , when mani lead industri expert were much more pessimist in their predict . in the year that dialog celebr it thirtieth anniversari as the world 's oldest and largest profession onlin inform servic , it is appropri to look back at these chang percept , the reason for these chang , and whi the expert got it wrong . we also look at the present day ; the valu that large-scal content aggreg bring to the inform suppli chain ; and we discuss whi user would choos to use aggreg as oppos to go directli to the publish

disintermediators
large-scale content aggregators
online information service
information supply chain


Geometric source separation: merging convolutive source separation with geometric beamforming

Abstract: Convolutive blind source separation and adaptive beamforming have a similar goal-extracting a source of interest (or multiple sources) while reducing undesired interferences. A benefit of source separation is that it overcomes the conventional cross-talk or leakage problem of adaptive beamforming. Beamforming on the other hand exploits geometric information which is often readily available but not utilized in blind algorithms. We propose to join these benefits by combining cross-power minimization of second-order source separation with geometric linear constraints used in adaptive beamforming. We find that the geometric constraints resolve some of the ambiguities inherent in the independence criterion such as frequency permutations and degrees of freedom provided by additional sensors. We demonstrate the new method in performance comparisons for actual room recordings of two and three simultaneous acoustic sources

geometr sourc separ : merg convolut sourc separ with geometr beamform
 convolut blind sourc separ and adapt beamform have a similar goal-extract a sourc of interest ( or multipl sourc ) while reduc undesir interfer . a benefit of sourc separ is that it overcom the convent cross-talk or leakag problem of adapt beamform . beamform on the other hand exploit geometr inform which is often readili avail but not util in blind algorithm . we propos to join these benefit by combin cross-pow minim of second-ord sourc separ with geometr linear constraint use in adapt beamform . we find that the geometr constraint resolv some of the ambigu inher in the independ criterion such as frequenc permut and degre of freedom provid by addit sensor . we demonstr the new method in perform comparison for actual room record of two and three simultan acoust sourc

geometric source separation
geometric beamforming
convolutive blind source separation
adaptive beamforming
cross-talk
leakage problem
blind algorithms
cross-power minimization
second-order source separation
geometric linear constraints
frequency permutations
degrees of freedom
sensors
room recordings
acoustic sources


Integration - no longer a barrier? [agile business]

Abstract: Web services will be a critical technology for enabling the 'agile business'

integr - no longer a barrier ? [ agil busi ]
 web servic will be a critic technolog for enabl the ' agil busi '

agile business
Web services
integration middleware
Iona
AMR Research


Benchmarking of the Dose Planning Method (DPM) Monte Carlo code using electron beams from a racetrack microtron

Abstract: A comprehensive set of measurements and calculations has been conducted to investigate the accuracy of the Dose Planning Method (DPM) Monte Carlo code for dose calculations from 10 and 50 MeV scanned electron beams produced from a racetrack microtron. Central axis depth dose measurements and a series of profile scans at various depths were acquired in a water phantom using a Scanditronix type RK ion chamber. Source spatial distributions for the Monte Carlo calculations were reconstructed from in-air ion chamber measurements carried out across the two-dimensional beam profile at 100 cm downstream from the source. The in-air spatial distributions were found to have full width at half maximum of 4.7 and 1.3 cm, at 100 cm from the source, for the 10 and 50 MeV beams, respectively. Energy spectra for the 10 and 50 MeV beams were determined by simulating the components of the microtron treatment head using the code MCNP4B. DPM calculations are on average within +or-2% agreement with measurement for all depth dose and profile comparisons conducted in this study. The accuracy of the DPM code illustrated in this work suggests that DPM may be used as a valuable tool for electron beam dose calculations

benchmark of the dose plan method ( dpm ) mont carlo code use electron beam from a racetrack microtron
 a comprehens set of measur and calcul ha been conduct to investig the accuraci of the dose plan method ( dpm ) mont carlo code for dose calcul from 10 and 50 mev scan electron beam produc from a racetrack microtron . central axi depth dose measur and a seri of profil scan at variou depth were acquir in a water phantom use a scanditronix type rk ion chamber . sourc spatial distribut for the mont carlo calcul were reconstruct from in-air ion chamber measur carri out across the two-dimension beam profil at 100 cm downstream from the sourc . the in-air spatial distribut were found to have full width at half maximum of 4.7 and 1.3 cm , at 100 cm from the sourc , for the 10 and 50 mev beam , respect . energi spectra for the 10 and 50 mev beam were determin by simul the compon of the microtron treatment head use the code mcnp4b. dpm calcul are on averag within + or-2 % agreement with measur for all depth dose and profil comparison conduct in thi studi . the accuraci of the dpm code illustr in thi work suggest that dpm may be use as a valuabl tool for electron beam dose calcul

benchmarking
racetrack microtron
50 MeV
scanned electron beams
central axis depth dose measurements
profile scans
water phantom
ion chamber
source spatial distributions
two-dimensional beam profile
in-air spatial distributions
electron beam dose calculations
dose planning method Monte Carlo code
MCNP4B
radiotherapy treatment planning
electron transport
scoring parameters
10 MeV


OS porting and application development for SoC

Abstract: To deliver improved usability in high-end portable consumer products, the use of an appropriate consumer operating system (OS) is becoming far more widespread. Using a commercially supported OS also vastly increases the availability of supported applications. For the device developer, this trend adds major complexity to the problem of system implementation. Porting a complete operating system to a new hardware design adds significantly to the development burden, increasing both time-to-market and expense. Even for those familiar with the integration of a real-time OS, the porting, validation and support of a complex platform OS is a formidable task

os port and applic develop for soc
 to deliv improv usabl in high-end portabl consum product , the use of an appropri consum oper system ( os ) is becom far more widespread . use a commerci support os also vastli increas the avail of support applic . for the devic develop , thi trend add major complex to the problem of system implement . port a complet oper system to a new hardwar design add significantli to the develop burden , increas both time-to-market and expens . even for those familiar with the integr of a real-tim os , the port , valid and support of a complex platform os is a formid task

OS porting
application development
consumer operating system
hardware design


Dementing disorders: volumetric measurement of cerebrospinal fluid to distinguish normal from pathologic finding - feasibility study

Abstract: We have demonstrated that automated methods to describe the severity and distribution of cerebral atrophy are capable of providing diagnostic information in the classification of neurodegenerative diseases

dement disord : volumetr measur of cerebrospin fluid to distinguish normal from patholog find - feasibl studi
 we have demonstr that autom method to describ the sever and distribut of cerebr atrophi are capabl of provid diagnost inform in the classif of neurodegen diseas

cerebrospinal fluid volumetric measurement


Robust self-tuning PID controller for nonlinear systems

Abstract: In this paper, we propose a robust self-tuning PID controller suitable for nonlinear systems. The control system employs a preload relay (P_Relay) in series with a PID controller. The P_Relay ensures a high gain to yield a robust performance. However, it also incurs a chattering phenomenon. In this paper, instead of viewing the chattering as an undesirable yet inevitable feature, we use it as a naturally occurring signal for tuning and re-tuning the PID controller as the operating regime digresses. No other explicit input signal is required. Once the PID controller is tuned for a particular operating point, the relay may be disabled and chattering ceases correspondingly. However, it is invoked when there is a change in setpoint to another operating regime. In this way, the approach is also applicable to time-varying systems as the PID tuning can be continuous, based on the latest set of chattering characteristics. Analysis is provided on the stability properties of the control scheme. Simulation results for the level control of fluid in a spherical tank using the scheme are also presented

robust self-tun pid control for nonlinear system
 in thi paper , we propos a robust self-tun pid control suitabl for nonlinear system . the control system employ a preload relay ( p_relay ) in seri with a pid control . the p_relay ensur a high gain to yield a robust perform . howev , it also incur a chatter phenomenon . in thi paper , instead of view the chatter as an undesir yet inevit featur , we use it as a natur occur signal for tune and re-tun the pid control as the oper regim digress . no other explicit input signal is requir . onc the pid control is tune for a particular oper point , the relay may be disabl and chatter ceas correspondingli . howev , it is invok when there is a chang in setpoint to anoth oper regim . in thi way , the approach is also applic to time-vari system as the pid tune can be continu , base on the latest set of chatter characterist . analysi is provid on the stabil properti of the control scheme . simul result for the level control of fluid in a spheric tank use the scheme are also present

robust self-tuning PID controller
nonlinear systems
preload relay
robust performance
chattering phenomenon
naturally occurring signal
operating regime
time-varying systems
stability properties
simulation results
spherical tank
controller tuning
controller re-tuning
relay disabling
continuous tuning
fluid level control


A re-examination of probability matching and rational choice

Abstract: In a typical probability learning task participants are presented with a repeated choice between two response alternatives, one of which has a higher payoff probability than the other. Rational choice theory requires that participants should eventually allocate all their responses to the high-payoff alternative, but previous research has found that people fail to maximize their payoffs. Instead, it is commonly observed that people match their response probabilities to the payoff probabilities. We report three experiments on this choice anomaly using a simple probability learning task in which participants were provided with (i) large financial incentives, (ii) meaningful and regular feedback, and (iii) extensive training. In each experiment large proportions of participants adopted the optimal response strategy and all three of the factors mentioned above contributed to this. The results are supportive of rational choice theory

a re-examin of probabl match and ration choic
 in a typic probabl learn task particip are present with a repeat choic between two respons altern , one of which ha a higher payoff probabl than the other . ration choic theori requir that particip should eventu alloc all their respons to the high-payoff altern , but previou research ha found that peopl fail to maxim their payoff . instead , it is commonli observ that peopl match their respons probabl to the payoff probabl . we report three experi on thi choic anomali use a simpl probabl learn task in which particip were provid with ( i ) larg financi incent , ( ii ) meaning and regular feedback , and ( iii ) extens train . in each experi larg proport of particip adopt the optim respons strategi and all three of the factor mention abov contribut to thi . the result are support of ration choic theori

probability matching
rationality
probability learning task
payoff probability
rational choice theory
response probabilities
choice anomaly
large financial incentives
feedback
extensive training
optimal response strategy
meaningful regular feedback


High dynamic control of a three-level voltage-source-converter drive for a main strip mill

Abstract: A high dynamic control system for the Alspa VDM 7000 medium-voltage drive was implemented, which provides fast torque response times of a few milliseconds despite the typically low switching frequency of gate-turn-off thyristors which is necessary to achieve high efficiency. The drive system consists of a three-level voltage-source converter with active front end and a synchronous motor. The drive has most recently been applied to a main strip mill. It provides a maximum of 8.3-MW mechanical power with a rated motor voltage of 3 kV. Besides motor torque as the main control objective, the control system has to comply with a number of additional objectives and constraints like DC-link voltage regulation and balancing, current and torque harmonics, motor flux, and excitation

high dynam control of a three-level voltage-source-convert drive for a main strip mill
 a high dynam control system for the alspa vdm 7000 medium-voltag drive wa implement , which provid fast torqu respons time of a few millisecond despit the typic low switch frequenc of gate-turn-off thyristor which is necessari to achiev high effici . the drive system consist of a three-level voltage-sourc convert with activ front end and a synchron motor . the drive ha most recent been appli to a main strip mill . it provid a maximum of 8.3-mw mechan power with a rate motor voltag of 3 kv. besid motor torqu as the main control object , the control system ha to compli with a number of addit object and constraint like dc-link voltag regul and balanc , current and torqu harmon , motor flux , and excit

strip mill
high dynamic control system
medium-voltage drive
switching frequency
gate-turn-off thyristors
efficiency
three-level voltage-source converter
synchronous motor
mechanical power
motor voltage
control objective
DC-link voltage regulation
torque harmonics
motor flux
excitation
DC-link voltage balancing
current harmonics
8.3 MW
3 kV


A virtual victory [virtual networks]

Abstract: Newly fashionable virtual network operators look all set to clean up in the corporate sector

a virtual victori [ virtual network ]
 newli fashion virtual network oper look all set to clean up in the corpor sector

virtual network operators
corporate sector


Blended implementation of block implicit methods for ODEs

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

blend implement of block implicit method for ode
 in thi paper we further develop a new approach for natur defin the nonlinear split need for the implement of block implicit method for ode , which ha been consid by brugnano [ j. comput . appl . math . 116 ( 2000 ) 41 ] and by brugnano and trigiant [ in : recent trend in numer analysi , nova scienc , new york , 2000 , pp . 81 - 105 ] . the basic idea is that of defin the numer method as the combin ( blend ) of two suitabl compon method . by care choos such method , it is shown that veri effici implement can be obtain . moreov , some of them , character by a diagon split , are well suit for parallel comput . numer test compar the perform of the propos implement with exist one are also present , in order to make evid the potenti of the approach

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


Design and analysis of optimal material distribution policies in flexible manufacturing systems using a single AGV

Abstract: Modern automated manufacturing processes employ automated guided vehicles (AGVs) for material handling, which serve several machine centres (MC) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. We analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. A mathematical model is developed and then a strategy for optimal material distribution of the available raw material to the MCs is derived. With this model, the optimal number of MCs to be utilized is also determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV is carried out. Through rigorous analysis and simulation experiments, we show that such a delivery strategy will optimize the overall performance

design and analysi of optim materi distribut polici in flexibl manufactur system use a singl agv
 modern autom manufactur process employ autom guid vehicl ( agv ) for materi handl , which serv sever machin centr ( mc ) in a factori . optim schedul of agv can significantli help to increas the effici of the manufactur process by minim the idl time of mc wait for the raw materi . we analys the requir for an optim schedul and then provid a mathemat framework for an effici schedul of materi deliveri by an agv . a mathemat model is develop and then a strategi for optim materi distribut of the avail raw materi to the mc is deriv . with thi model , the optim number of mc to be util is also determin . final , the materi deliveri schedul employ multipl journey to the mc by the agv is carri out . through rigor analysi and simul experi , we show that such a deliveri strategi will optim the overal perform

optimal material distribution policies
flexible manufacturing systems
AGV
automated guided vehicle
material handling
machine centres
optimal scheduling
material delivery
waiting time
manufacturing lead time
idle time minimization


Development of a real-time monitoring system

Abstract: This paper describes a pattern recognition (PR) technique, which uses learning vector quantization (LVQ). This method is adapted for practical application to solve problems in the area of condition monitoring and fault diagnosis where a number of fault signatures are involved. In these situations, the aim is health monitoring, including identification of deterioration of the healthy condition and identification of causes of the failure in real-time. For this reason a fault database is developed which contains the collected information about various states of operation of the system in the form of pattern vectors. The task of the real-time monitoring system is to correlate patterns of unknown faults with the known fault signatures in the fault database. This will determine cause of failure and degree of deterioration of the system under test. The problem of fault diagnosis may involve a large number of patterns and large sampling time, which affects the learning stage of neural networks. The study here also aims to find a fast learning model of neural networks for instances when a high number of patterns and numerous processing elements are involved. It begins searching for an appropriate solution. The study is extended to the enforcement learning models and considers LVQ as a network emerged from the competitive learning model through enforcement training. Finally, tests show an accuracy of 92.3 per cent in the fault diagnostic capability of the technique

develop of a real-tim monitor system
 thi paper describ a pattern recognit ( pr ) techniqu , which use learn vector quantiz ( lvq ) . thi method is adapt for practic applic to solv problem in the area of condit monitor and fault diagnosi where a number of fault signatur are involv . in these situat , the aim is health monitor , includ identif of deterior of the healthi condit and identif of caus of the failur in real-tim . for thi reason a fault databas is develop which contain the collect inform about variou state of oper of the system in the form of pattern vector . the task of the real-tim monitor system is to correl pattern of unknown fault with the known fault signatur in the fault databas . thi will determin caus of failur and degre of deterior of the system under test . the problem of fault diagnosi may involv a larg number of pattern and larg sampl time , which affect the learn stage of neural network . the studi here also aim to find a fast learn model of neural network for instanc when a high number of pattern and numer process element are involv . it begin search for an appropri solut . the studi is extend to the enforc learn model and consid lvq as a network emerg from the competit learn model through enforc train . final , test show an accuraci of 92.3 per cent in the fault diagnost capabl of the techniqu

real-time monitoring system
learning vector quantization
LVQ
condition monitoring
fault diagnosis
fault signatures
health monitoring
fault database
pattern vectors
large sampling time
neural networks
fast learning model
competitive learning model
enforcement training
fault diagnostic capability
pattern recognition technique
deterioration identification
real-time failure cause identification
pattern correlation
CNC machine centre
coolant system

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


Adaptable dialog boxes for cross-platform programming

Abstract: The author presents a framework for building dialog boxes that adapt to the look and feel of their platform. This method also helps with a few related problems: specifying cross-platform resources and handling dialog size changes due to localization. He uses a combination of XML, automatic layout, and run-time dialog creation to give you most of the benefits of platform-specific resources, without the associated pain. Source code with an implementation of the layout engine for Mac OS 9.1 ("Carbon"), Mac OS X, and Microsoft Windows can be downloaded from the CUJ website at <www.cuj.com/code>. You can use this code as is, or as a starting point for your own more complete implementation

adapt dialog box for cross-platform program
 the author present a framework for build dialog box that adapt to the look and feel of their platform . thi method also help with a few relat problem : specifi cross-platform resourc and handl dialog size chang due to local . he use a combin of xml , automat layout , and run-tim dialog creation to give you most of the benefit of platform-specif resourc , without the associ pain . sourc code with an implement of the layout engin for mac os 9.1 ( " carbon " ) , mac os x , and microsoft window can be download from the cuj websit at < www.cuj.com/cod > . you can use thi code as is , or as a start point for your own more complet implement

adaptable dialog boxes
dialog boxes
cross-platform programming
cross-platform resources
dialog size changes
localization
XML
automatic layout
run-time dialog creation
platform-specific resources
Mac OS 9.1
Mac OS X
Microsoft Windows


Building an effective computer science student organization: the Carnegie Mellon Women@SCS action plan

Abstract: This paper aims to provide a practical guide for building a student organization and designing activities and events that can encourage and support a community of women in computer science. This guide is based on our experience in building Women@SCS, a community of women in the School of Computer Science (SCS) at Carnegie Mellon University. Rather than provide an abstract "to-do" or "must-do" list, we present a sampling of concrete activities and events in the hope that these might suggest possibilities for a likeminded student organization. However, since we have found it essential to have a core group of activist students at the helm, we provide a "to-do" list of features that we feel are essential for forming, supporting and sustaining creative and effective student leadership

build an effect comput scienc student organ : the carnegi mellon women@sc action plan
 thi paper aim to provid a practic guid for build a student organ and design activ and event that can encourag and support a commun of women in comput scienc . thi guid is base on our experi in build women@sc , a commun of women in the school of comput scienc ( sc ) at carnegi mellon univers . rather than provid an abstract " to-do " or " must-do " list , we present a sampl of concret activ and event in the hope that these might suggest possibl for a likemind student organ . howev , sinc we have found it essenti to have a core group of activist student at the helm , we provid a " to-do " list of featur that we feel are essenti for form , support and sustain creativ and effect student leadership

computer science student organization
Women@SCS action plan
women
Carnegie Mellon University
student leadership
gender issues
computer science education


Summarization beyond sentence extraction: A probabilistic approach to sentence compression

Abstract: When humans produce summaries of documents, they do not simply extract sentences and concatenate them. Rather, they create new sentences that are grammatical, that cohere with one another, and that capture the most salient pieces of information in the original document. Given that large collections of text/abstract pairs are available online, it is now possible to envision algorithms that are trained to mimic this process. In this paper, we focus on sentence compression, a simpler version of this larger challenge. We aim to achieve two goals simultaneously: our compressions should be grammatical, and they should retain the most important pieces of information. These two goals can conflict. We devise both a noisy-channel and a decision-tree approach to the problem, and we evaluate results against manual compressions and a simple baseline

summar beyond sentenc extract : a probabilist approach to sentenc compress
 when human produc summari of document , they do not simpli extract sentenc and concaten them . rather , they creat new sentenc that are grammat , that coher with one anoth , and that captur the most salient piec of inform in the origin document . given that larg collect of text / abstract pair are avail onlin , it is now possibl to envis algorithm that are train to mimic thi process . in thi paper , we focu on sentenc compress , a simpler version of thi larger challeng . we aim to achiev two goal simultan : our compress should be grammat , and they should retain the most import piec of inform . these two goal can conflict . we devis both a noisy-channel and a decision-tre approach to the problem , and we evalu result against manual compress and a simpl baselin

sentence compression
grammatical
noisy-channel
decision-tree
document summarization


Domesticating computers and the Internet

Abstract: The people who use computers and the ways they use them have changed substantially over the past 25 years. In the beginning highly educated people, mostly men, in technical professions used computers for work, but over time a much broader range of people are using computers for personal and domestic purposes. This trend is still continuing, and over a shorter time scale has been replicated with the use of the Internet. The paper uses data from four national surveys to document how personal computers and the Internet have become increasingly domesticated since 1995 and to explore the mechanisms for this shift. Now people log on more often from home than from places of employment and do so for pleasure and for personal purposes rather than for their jobs. Analyses comparing veteran Internet users to novices in 1998 and 2000 and analyses comparing the change in use within a single sample between 1995 and 1996 support two complementary explanations for how these technologies have become domesticated. Women, children, and less well-educated individuals are increasingly using computers and the Internet and have a more personal set of motives than well-educated men. In addition, the widespread diffusion of the PC and the Internet and the response of the computing industry to the diversity in consumers has led to a rich set of personal and domestic services

domest comput and the internet
 the peopl who use comput and the way they use them have chang substanti over the past 25 year . in the begin highli educ peopl , mostli men , in technic profess use comput for work , but over time a much broader rang of peopl are use comput for person and domest purpos . thi trend is still continu , and over a shorter time scale ha been replic with the use of the internet . the paper use data from four nation survey to document how person comput and the internet have becom increasingli domest sinc 1995 and to explor the mechan for thi shift . now peopl log on more often from home than from place of employ and do so for pleasur and for person purpos rather than for their job . analys compar veteran internet user to novic in 1998 and 2000 and analys compar the chang in use within a singl sampl between 1995 and 1996 support two complementari explan for how these technolog have becom domest . women , children , and less well-educ individu are increasingli use comput and the internet and have a more person set of motiv than well-educ men . in addit , the widespread diffus of the pc and the internet and the respons of the comput industri to the divers in consum ha led to a rich set of person and domest servic

Internet
highly educated people
technical professions
domestic purposes
national surveys
personal computers
veteran Internet users
novices
women
children
computing industry
domestic services
computer domestication
personal usage
personal motives
PC diffusion
demographics
online behavior


Use of Bayesian Belief Networks when combining disparate sources of information in the safety assessment of software-based systems

Abstract: The paper discusses how disparate sources of information can be combined in the safety assessment of software-based systems. The emphasis is put on an emerging methodology, relevant for intelligent product-support systems, to combine information about disparate evidences systematically based on Bayesian Belief Networks. The objective is to show the link between basic information and the confidence one can have in a system. How one combines the Bayesian Belief Net (BBN) method with a software safety standard (RTCA/DO-178B,) for safety assessment of software-based systems is also discussed. Finally, the applicability of the BBN methodology and experiences from cooperative research work together with Kongsberg Defence & Aerospace and Det Norske Veritas, and ongoing research with VTT Automation are presented

use of bayesian belief network when combin dispar sourc of inform in the safeti assess of software-bas system
 the paper discuss how dispar sourc of inform can be combin in the safeti assess of software-bas system . the emphasi is put on an emerg methodolog , relev for intellig product-support system , to combin inform about dispar evid systemat base on bayesian belief network . the object is to show the link between basic inform and the confid one can have in a system . how one combin the bayesian belief net ( bbn ) method with a softwar safeti standard ( rtca / do-178b , ) for safeti assess of software-bas system is also discuss . final , the applic of the bbn methodolog and experi from cooper research work togeth with kongsberg defenc & aerospac and det norsk verita , and ongo research with vtt autom are present

Bayesian belief networks
safety assessment
software-based systems
intelligent product-support systems
software safety standard


Subject access to government documents in an era of globalization: intellectual bundling of entities affected by the decisions of supranational organizations

Abstract: As a result of the growing influence of supranational organizations, there is a need for a new model for subject access to government information in academic libraries. Rulings made by supranational bodies such as the World Trade Organization (WTO) and rulings determined under the auspices of transnational economic agreements such as the North American Free Trade Agreement (NAFTA) often supersede existing law, resulting in obligatory changes to national, provincial, state, and municipal legislation. Just as important is the relationship among private sector companies, third party actors such as nongovernmental organizations (NGOs), and governments. The interaction among the various entities affected by supranational rulings could potentially form the basis of a new model for subject access to government information

subject access to govern document in an era of global : intellectu bundl of entiti affect by the decis of supran organ
 as a result of the grow influenc of supran organ , there is a need for a new model for subject access to govern inform in academ librari . rule made by supran bodi such as the world trade organ ( wto ) and rule determin under the auspic of transnat econom agreement such as the north american free trade agreement ( nafta ) often supersed exist law , result in obligatori chang to nation , provinci , state , and municip legisl . just as import is the relationship among privat sector compani , third parti actor such as nongovernment organ ( ngo ) , and govern . the interact among the variou entiti affect by supran rule could potenti form the basi of a new model for subject access to govern inform

government documents
globalization
intellectual bundling
supranational organizations
academic libraries
World Trade Organization
transnational economic agreements
North American Free Trade Agreement
municipal legislation
national legislation
provincial legislation
state legislation


Where tech is cheap [servers]

Abstract: Talk, consultancy, support, not tech is the expensive part of network installations. It's a good job that small-scale servers can either be remotely managed, or require little actual management

where tech is cheap [ server ]
 talk , consult , support , not tech is the expens part of network instal . it 's a good job that small-scal server can either be remot manag , or requir littl actual manag

network installations
small-scale servers
management


Quantum phase gate for photonic qubits using only beam splitters and postselection

Abstract: We show that a beam splitter of reflectivity one-third can be used to realize a quantum phase gate operation if only the outputs conserving the number of photons on each side are postselected

quantum phase gate for photon qubit use onli beam splitter and postselect
 we show that a beam splitter of reflect one-third can be use to realiz a quantum phase gate oper if onli the output conserv the number of photon on each side are postselect

postselected photon number conserving outputs


Novel line conditioner with voltage up/down capability

Abstract: In this paper, a novel pulsewidth-modulated line conditioner with fast output voltage control is proposed. The line conditioner is made up of an AC chopper with reversible voltage control and a transformer for series voltage compensation. In the AC chopper, a proper switching operation is achieved without the commutation problem. To absorb energy stored in line stray inductance, a regenerative DC snubber can be utilized which has only one capacitor without discharging resistors or complicated regenerative circuit for snubber energy. Therefore, the proposed AC chopper gives high efficiency and reliability. The output voltage of the line conditioner is controlled using a fast sensing technique of the output voltage. It is also shown via some experimental results that the presented line conditioner gives good dynamic and steady-state performance for high quality of the output voltage

novel line condition with voltag up / down capabl
 in thi paper , a novel pulsewidth-modul line condition with fast output voltag control is propos . the line condition is made up of an ac chopper with revers voltag control and a transform for seri voltag compens . in the ac chopper , a proper switch oper is achiev without the commut problem . to absorb energi store in line stray induct , a regen dc snubber can be util which ha onli one capacitor without discharg resistor or complic regen circuit for snubber energi . therefor , the propos ac chopper give high effici and reliabl . the output voltag of the line condition is control use a fast sens techniqu of the output voltag . it is also shown via some experiment result that the present line condition give good dynam and steady-st perform for high qualiti of the output voltag

pulsewidth-modulated line conditioner
output voltage control
AC chopper
reversible voltage control
switching operation
commutation
line stray inductance
regenerative DC snubber
steady-state performance
series voltage compensation transformer
dynamic performance


Combining PC control and HMI

Abstract: Integrating PC-based control with human machine interface (HMI) technology can benefit a plant floor system. However, before one decides on PC-based control, there are many things one should consider, especially when using a soft programmable logic controller (PLC) to command the input/output. There are three strategies to integrate a PC-based control system with an HMI: treat the PC running the control application as if it were a PLC, integrate the system using standard PC interfaces; or using application programming interfaces

combin pc control and hmi
 integr pc-base control with human machin interfac ( hmi ) technolog can benefit a plant floor system . howev , befor one decid on pc-base control , there are mani thing one should consid , especi when use a soft programm logic control ( plc ) to command the input / output . there are three strategi to integr a pc-base control system with an hmi : treat the pc run the control applic as if it were a plc , integr the system use standard pc interfac ; or use applic program interfac

human machine interface
programmable logic controller
PC-based control system
PC interfaces
application programming interfaces
shop floor system


Prediction of tool and chip temperature in continuous and interrupted machining

Abstract: A numerical model based on the finite difference method is presented to predict tool and chip temperature fields in continuous machining and time varying milling processes. Continuous or steady state machining operations like orthogonal cutting are studied by modeling the heat transfer between the tool and chip at the tool-rake face contact zone. The shear energy created in the primary zone, the friction energy produced at the rake face-chip contact zone and the heat balance between the moving chip and stationary tool are considered. The temperature distribution is solved using the finite difference method. Later, the model is extended to milling where the cutting is interrupted and the chip thickness varies with time. The proposed model combines the steady-state temperature prediction in continuous machining with transient temperature evaluation in interrupted cutting operations where the chip and the process change in a discontinuous manner. The mathematical models and simulation results are in satisfactory agreement with experimental temperature measurements reported in the literature

predict of tool and chip temperatur in continu and interrupt machin
 a numer model base on the finit differ method is present to predict tool and chip temperatur field in continu machin and time vari mill process . continu or steadi state machin oper like orthogon cut are studi by model the heat transfer between the tool and chip at the tool-rak face contact zone . the shear energi creat in the primari zone , the friction energi produc at the rake face-chip contact zone and the heat balanc between the move chip and stationari tool are consid . the temperatur distribut is solv use the finit differ method . later , the model is extend to mill where the cut is interrupt and the chip thick vari with time . the propos model combin the steady-st temperatur predict in continu machin with transient temperatur evalu in interrupt cut oper where the chip and the process chang in a discontinu manner . the mathemat model and simul result are in satisfactori agreement with experiment temperatur measur report in the literatur

interrupted machining
numerical model
finite difference method
continuous machining
time varying milling processes
orthogonal cutting
heat transfer
tool-rake face contact zone
shear energy
primary zone
friction energy
temperature distribution
tool temperature prediction
chip temperature prediction
first-order dynamic system
thermal properties


Node-capacitated ring routing

Abstract: We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas' lemma provides a characterization for general undirected graphs, asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distance functions arising from nonnegative node weights. For rings, this (straightforward) result will be improved in two ways. We prove that, independent of the integrality of node capacities, it suffices to require the distance inequality only for distances arising from (0-1-2)-valued node weights, a requirement that will be called the double-cut condition. Moreover, for integer-valued node capacities, the double-cut condition implies the existence of a half-integral multicommodity flow. In this case there is even an integer-valued multicommodity flow that violates each node capacity by at most one. Our approach gives rise to a combinatorial, strongly polynomial algorithm to compute either a violating double-cut or a node-capacitated multicommodity flow. A relation of the problem to its edge-capacitated counterpart will also be explained

node-capacit ring rout
 we consid the node-capacit rout problem in an undirect ring network along with it fraction relax , the node-capacit multicommod flow problem . for the feasibl problem , farka ' lemma provid a character for gener undirect graph , assert roughli that there exist such a flow if and onli if the so-cal distanc inequ hold for everi choic of distanc function aris from nonneg node weight . for ring , thi ( straightforward ) result will be improv in two way . we prove that , independ of the integr of node capac , it suffic to requir the distanc inequ onli for distanc aris from ( 0 - 1 - 2)-valu node weight , a requir that will be call the double-cut condit . moreov , for integer-valu node capac , the double-cut condit impli the exist of a half-integr multicommod flow . in thi case there is even an integer-valu multicommod flow that violat each node capac by at most one . our approach give rise to a combinatori , strongli polynomi algorithm to comput either a violat double-cut or a node-capacit multicommod flow . a relat of the problem to it edge-capacit counterpart will also be explain

combinatorial strongly polynomial algorithm


Control of thin film growth in chemical vapor deposition manufacturing systems: a feasibility study

Abstract: A study is carried out to design and optimize chemical vapor deposition (CVD) systems for material fabrication. Design and optimization of the CVD process is necessary to satisfying strong global demand and ever increasing quality requirements for thin film production. Advantages of computer aided optimization include high design turnaround time, flexibility to explore a larger design space and the development and adaptation of automation techniques for design and optimization. A CVD reactor consisting of a vertical impinging jet at atmospheric pressure, for growing titanium nitride films, is studied for thin film deposition. Numerical modeling and simulation are used to determine the rate of deposition and film uniformity over a wide range of design variables and operating conditions. These results are used for system design and optimization. The optimization procedure employs an objective function characterizing film quality, productivity and operational costs based on reactor gas flow rate, susceptor temperature and precursor concentration. Parameter space mappings are used to determine the design space, while a minimization algorithm, such as the steepest descent method, is used to determine optimal operating conditions for the system. The main features of computer aided design and optimization using these techniques are discussed in detail

control of thin film growth in chemic vapor deposit manufactur system : a feasibl studi
 a studi is carri out to design and optim chemic vapor deposit ( cvd ) system for materi fabric . design and optim of the cvd process is necessari to satisfi strong global demand and ever increas qualiti requir for thin film product . advantag of comput aid optim includ high design turnaround time , flexibl to explor a larger design space and the develop and adapt of autom techniqu for design and optim . a cvd reactor consist of a vertic imping jet at atmospher pressur , for grow titanium nitrid film , is studi for thin film deposit . numer model and simul are use to determin the rate of deposit and film uniform over a wide rang of design variabl and oper condit . these result are use for system design and optim . the optim procedur employ an object function character film qualiti , product and oper cost base on reactor ga flow rate , susceptor temperatur and precursor concentr . paramet space map are use to determin the design space , while a minim algorithm , such as the steepest descent method , is use to determin optim oper condit for the system . the main featur of comput aid design and optim use these techniqu are discuss in detail

thin film growth
chemical vapor deposition
optimization
material fabrication
titanium nitride films
film quality
operational costs
reactor gas flow rate
susceptor temperature
precursor concentration
parameter space mappings
TiN


From FREE to FEE [online advertising market]

Abstract: As the online advertising market continues to struggle, many online content marketers are wrestling with the issue of how to add at least some level of paid subscription income to their revenue mix in order to reach or improve profitability. Since the business of selling content online is still in its infancy, and many consumers clearly still think of Web content as simply and rightfully free, few roadmaps are available to show the way to effective marketing strategies, but some guiding principles have emerged

from free to fee [ onlin advertis market ]
 as the onlin advertis market continu to struggl , mani onlin content market are wrestl with the issu of how to add at least some level of paid subscript incom to their revenu mix in order to reach or improv profit . sinc the busi of sell content onlin is still in it infanc , and mani consum clearli still think of web content as simpli and right free , few roadmap are avail to show the way to effect market strategi , but some guid principl have emerg

online advertising market
paid subscription income
selling content online
marketing strategies


It's time to buy

Abstract: There is an upside to a down economy: over-zealous suppliers are willing to make deals that were unthinkable a few years ago. That's because vendors are experiencing the same money squeeze as manufacturers, which makes the year 2002 the perfect time to invest in new technology. The author states that when negotiating the deal, provisions for unexpected costs, an exit strategy, and even shared risk with the vendor should be on the table

it 's time to buy
 there is an upsid to a down economi : over-zeal supplier are will to make deal that were unthink a few year ago . that 's becaus vendor are experienc the same money squeez as manufactur , which make the year 2002 the perfect time to invest in new technolog . the author state that when negoti the deal , provis for unexpect cost , an exit strategi , and even share risk with the vendor should be on the tabl

suppliers
vendor
money squeeze
negotiation
unexpected costs
exit strategy
shared risk
buyers market
bargaining power


Bounded model checking for the universal fragment of CTL

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

bound model check for the univers fragment of ctl
 bound model check ( bmc ) ha been recent introduc as an effici verif method for reactiv system . bmc base on sat method consist in search for a counterexampl of a particular length and gener a proposit formula that is satisfi iff such a counterexample-exist . thi new techniqu ha been introduc by e. clark et al . for model check of linear time tempor logic ( ltl ) . our paper show how the concept of bound model check can be extend to actl ( the univers fragment of ctl ) . the implement of the algorithm for elementari net system is describ togeth with the experiment result

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


Efficient parallel programming on scalable shared memory systems with High Performance Fortran

Abstract: OpenMP offers a high-level interface for parallel programming on scalable shared memory (SMP) architectures. It provides the user with simple work-sharing directives while it relies on the compiler to generate parallel programs based on thread parallelism. However, the lack of language features for exploiting data locality often results in poor performance since the non-uniform memory access times on scalable SMP machines cannot be neglected. High Performance Fortran (HPF), the de-facto standard for data parallel programming, offers a rich set of data distribution directives in order to exploit data locality, but it has been mainly targeted towards distributed memory machines. In this paper we describe an optimized execution model for HPF programs on SMP machines that avails itself with mechanisms provided by OpenMP for work sharing and thread parallelism, while exploiting data locality based on user-specified distribution directives. Data locality does not only ensure that most memory accesses are close to the executing threads and are therefore faster, but it also minimizes synchronization overheads, especially in the case of unstructured reductions. The proposed shared memory execution model for HPF relies on a small set of language extensions, which resemble the OpenMP work-sharing features. These extensions, together with an optimized shared memory parallelization and execution model, have been implemented in the ADAPTOR HPF compilation system and experimental results verify the efficiency of the chosen approach

effici parallel program on scalabl share memori system with high perform fortran
 openmp offer a high-level interfac for parallel program on scalabl share memori ( smp ) architectur . it provid the user with simpl work-shar direct while it reli on the compil to gener parallel program base on thread parallel . howev , the lack of languag featur for exploit data local often result in poor perform sinc the non-uniform memori access time on scalabl smp machin can not be neglect . high perform fortran ( hpf ) , the de-facto standard for data parallel program , offer a rich set of data distribut direct in order to exploit data local , but it ha been mainli target toward distribut memori machin . in thi paper we describ an optim execut model for hpf program on smp machin that avail itself with mechan provid by openmp for work share and thread parallel , while exploit data local base on user-specifi distribut direct . data local doe not onli ensur that most memori access are close to the execut thread and are therefor faster , but it also minim synchron overhead , especi in the case of unstructur reduct . the propos share memori execut model for hpf reli on a small set of languag extens , which resembl the openmp work-shar featur . these extens , togeth with an optim share memori parallel and execut model , have been implement in the adaptor hpf compil system and experiment result verifi the effici of the chosen approach

parallel programming
scalable shared memory
High Performance Fortran
multiprocessor architectures
scalable hardware
shared memory multiprocessor


The agile revolution [business agility]

Abstract: There is a new business revolution in the air. The theory is there, the technology is evolving, fast. It is all about agility

the agil revolut [ busi agil ]
 there is a new busi revolut in the air . the theori is there , the technolog is evolv , fast . it is all about agil

business agility
software design
software deployment
organisational structures
supply chains


MPEG-4 video object-based rate allocation with variable temporal rates

Abstract: In object-based coding, bit allocation is performed at the object level and temporal rates of different objects may vary. The proposed algorithm deals with these two issues when coding multiple video objects (MVOs). The proposed algorithm is able to successfully achieve the target bit rate, effectively code arbitrarily shaped MVOs with different temporal rates, and maintain a stable buffer level

mpeg-4 video object-bas rate alloc with variabl tempor rate
 in object-bas code , bit alloc is perform at the object level and tempor rate of differ object may vari . the propos algorithm deal with these two issu when code multipl video object ( mvo ) . the propos algorithm is abl to success achiev the target bit rate , effect code arbitrarili shape mvo with differ tempor rate , and maintain a stabl buffer level

object-based rate allocation
variable temporal rates
bit allocation
multiple video objects
MPEG-4 video coding
rate-distortion encoding


Three-dimensional particle image tracking for dilute particle-liquid flows in a pipe

Abstract: A three-dimensional (3D) particle image tracking technique was used to study the coarse spherical particle-liquid flows in a pipe. The flow images from both the front view and the normal side view, which was reflected into the front view by a mirror, were recorded with a CCD camera and digitized by a PC with an image grabber card. An image processing program was developed to enhance and segment the flow image, and then to identify the particles. Over 90% of all the particles can be identified and located from the partially overlapped particle images using the circular Hough transform. Then the 3D position of each detected particle was determined by matching its front view image to its side view image. The particle velocity was then obtained by pairing its images in successive video fields. The measurements for the spherical expanded polystyrene particle-oil flows show that the particles, like the spherical bubbles in laminar bubbly flows, tend to conglomerate near the pipe wall and to line up to form the particle clusters. As liquid velocity decreases, the particle clusters disperse and more particles are distributed in the pipe centre region

three-dimension particl imag track for dilut particle-liquid flow in a pipe
 a three-dimension ( 3d ) particl imag track techniqu wa use to studi the coars spheric particle-liquid flow in a pipe . the flow imag from both the front view and the normal side view , which wa reflect into the front view by a mirror , were record with a ccd camera and digit by a pc with an imag grabber card . an imag process program wa develop to enhanc and segment the flow imag , and then to identifi the particl . over 90 % of all the particl can be identifi and locat from the partial overlap particl imag use the circular hough transform . then the 3d posit of each detect particl wa determin by match it front view imag to it side view imag . the particl veloc wa then obtain by pair it imag in success video field . the measur for the spheric expand polystyren particle-oil flow show that the particl , like the spheric bubbl in laminar bubbl flow , tend to conglomer near the pipe wall and to line up to form the particl cluster . as liquid veloc decreas , the particl cluster dispers and more particl are distribut in the pipe centr region

three-dimensional particle image tracking


Use of extra degrees of freedom in multilevel drives

Abstract: Multilevel converters with series connection of semiconductors allow power electronics to reach medium voltages (1-10 kV) with relatively standard components. The increase of the number of semiconductors provides extra degrees of freedom, which can be used to improve different characteristics. This paper is focused on variable-speed drives and it is shown that with the proposed multilevel direct torque control strategy (DiCoIF) the tradeoff between the performances of the drive (harmonic distortions, torque dynamics, voltage step gradients, etc.) and the switching frequency of the semiconductors is improved. Then, a slightly modified strategy reducing common-mode voltage and bearing currents is presented

use of extra degre of freedom in multilevel drive
 multilevel convert with seri connect of semiconductor allow power electron to reach medium voltag ( 1 - 10 kv ) with rel standard compon . the increas of the number of semiconductor provid extra degre of freedom , which can be use to improv differ characterist . thi paper is focus on variable-spe drive and it is shown that with the propos multilevel direct torqu control strategi ( dicoif ) the tradeoff between the perform of the drive ( harmon distort , torqu dynam , voltag step gradient , etc . ) and the switch frequenc of the semiconductor is improv . then , a slightli modifi strategi reduc common-mod voltag and bear current is present


The Malaysian model

Abstract: Japan's first third generation service, Foma, is unlikely to be truly attractive to consumers until 2005. That still falls well within the financial planning of its operator Docomo. But where does that leave European 3G operators looking for reassurance? Malaysia, says Simon Marshall

the malaysian model
 japan 's first third gener servic , foma , is unlik to be truli attract to consum until 2005 . that still fall well within the financi plan of it oper docomo . but where doe that leav european 3 g oper look for reassur ? malaysia , say simon marshal

Malaysia
3G operators
Maxis Communications
Telekom Malaysia


Traffic engineering with traditional IP routing protocols

Abstract: Traffic engineering involves adapting the routing of traffic to network conditions, with the joint goals of good user performance and efficient use of network resources. We describe an approach to intradomain traffic engineering that works within the existing deployed base of interior gateway protocols, such as Open Shortest Path First and Intermediate System-Intermediate System. We explain how to adapt the configuration of link weights, based on a networkwide view of the traffic and topology within a domain. In addition, we summarize the results of several studies of techniques for optimizing OSPF/IS-IS weights to the prevailing traffic. The article argues that traditional shortest path routing protocols are surprisingly effective for engineering the flow of traffic in large IP networks

traffic engin with tradit ip rout protocol
 traffic engin involv adapt the rout of traffic to network condit , with the joint goal of good user perform and effici use of network resourc . we describ an approach to intradomain traffic engin that work within the exist deploy base of interior gateway protocol , such as open shortest path first and intermedi system-intermedi system . we explain how to adapt the configur of link weight , base on a networkwid view of the traffic and topolog within a domain . in addit , we summar the result of sever studi of techniqu for optim ospf / is-i weight to the prevail traffic . the articl argu that tradit shortest path rout protocol are surprisingli effect for engin the flow of traffic in larg ip network

Intermediate System-Intermediate System protocol


Generalized mosaicing: wide field of view multispectral imaging

Abstract: We present an approach to significantly enhance the spectral resolution of imaging systems by generalizing image mosaicing. A filter transmitting spatially varying spectral bands is rigidly attached to a camera. As the system moves, it senses each scene point multiple times, each time in a different spectral band. This is an additional dimension of the generalized mosaic paradigm, which has demonstrated yielding high radiometric dynamic range images in a wide field of view, using a spatially varying density filter. The resulting mosaic represents the spectrum at each scene point. The image acquisition is as easy as in traditional image mosaics. We derive an efficient scene sampling rate, and use a registration method that accommodates the spatially varying properties of the filter. Using the data acquired by this method, we demonstrate scene rendering under different simulated illumination spectra. We are also able to infer information about the scene illumination. The approach was tested using a standard 8-bit black/white video camera and a fixed spatially varying spectral (interference) filter

gener mosaic : wide field of view multispectr imag
 we present an approach to significantli enhanc the spectral resolut of imag system by gener imag mosaic . a filter transmit spatial vari spectral band is rigidli attach to a camera . as the system move , it sens each scene point multipl time , each time in a differ spectral band . thi is an addit dimens of the gener mosaic paradigm , which ha demonstr yield high radiometr dynam rang imag in a wide field of view , use a spatial vari densiti filter . the result mosaic repres the spectrum at each scene point . the imag acquisit is as easi as in tradit imag mosaic . we deriv an effici scene sampl rate , and use a registr method that accommod the spatial vari properti of the filter . use the data acquir by thi method , we demonstr scene render under differ simul illumin spectra . we are also abl to infer inform about the scene illumin . the approach wa test use a standard 8-bit black / white video camera and a fix spatial vari spectral ( interfer ) filter


Calculation of the probability of survival of an insurance company with allowance for the rate of return for a Poisson stream of premiums

Abstract: The probability of survival of an insurance company with the working capital is calculated for a Poisson stream of premiums

calcul of the probabl of surviv of an insur compani with allow for the rate of return for a poisson stream of premium
 the probabl of surviv of an insur compani with the work capit is calcul for a poisson stream of premium

insurance company
survival probability
return rate
Poisson premium stream
probability density function


Modelling of complete robot dynamics based on a multi-dimensional, RBF-like neural architecture

Abstract: A neural network based identification approach of manipulator dynamics is presented. For a structured modelling, RBF-like static neural networks are used in order to represent and adapt all model parameters with their non-linear dependences on the joint positions. The neural architecture is hierarchically organised to reach optimal adjustment to structural a priori-knowledge about the identification problem. The model structure is substantially simplified by general system analysis independent of robot type. But also a lot of specific features of the utilised experimental robot are taken into account. A fixed, grid based neuron placement together with application of B-spline polynomial basis functions is utilised favourably for a very effective recursive implementation of the neural architecture. Thus, an online identification of a dynamic model is submitted for a complete 6 joint industrial robot

model of complet robot dynam base on a multi-dimension , rbf-like neural architectur
 a neural network base identif approach of manipul dynam is present . for a structur model , rbf-like static neural network are use in order to repres and adapt all model paramet with their non-linear depend on the joint posit . the neural architectur is hierarch organis to reach optim adjust to structur a priori-knowledg about the identif problem . the model structur is substanti simplifi by gener system analysi independ of robot type . but also a lot of specif featur of the utilis experiment robot are taken into account . a fix , grid base neuron placement togeth with applic of b-spline polynomi basi function is utilis favour for a veri effect recurs implement of the neural architectur . thu , an onlin identif of a dynam model is submit for a complet 6 joint industri robot

multi-dimensional RBF-like neural architecture


Faking it: simulating dependent types in Haskell

Abstract: Dependent types reflect the fact that validity of data is often a relative notion by allowing prior data to affect the types of subsequent data. Not only does this make for a precise type system, but also a highly generic one: both the type and the program for each instance of a family of operations can be computed from the data which codes for that instance. Recent experimental extensions to the Haskell type class mechanism give us strong tools to relativize types to other types. We may simulate some aspects of dependent typing by making counterfeit type-level copies of data, with type constructors simulating data constructors and type classes simulating datatypes. This paper gives examples of the technique and discusses its potential

fake it : simul depend type in haskel
 depend type reflect the fact that valid of data is often a rel notion by allow prior data to affect the type of subsequ data . not onli doe thi make for a precis type system , but also a highli gener one : both the type and the program for each instanc of a famili of oper can be comput from the data which code for that instanc . recent experiment extens to the haskel type class mechan give us strong tool to relativ type to other type . we may simul some aspect of depend type by make counterfeit type-level copi of data , with type constructor simul data constructor and type class simul datatyp . thi paper give exampl of the techniqu and discuss it potenti

dependent types
dependent types
Haskell
precise type system
type class mechanism
counterfeit type-level copies
type constructors
data constructors
datatypes
data validity
dependent typing
functional programming


The existence condition of gamma -acyclic database schemes with MVDs constraints

Abstract: It is very important to use database technology for a large-scale system such as ERP and MIS. A good database design may improve the performance of the system. Some research shows that a gamma -acyclic database scheme has many good properties, e.g., each connected join expression is monotonous, which helps to improve query performance of the database system. Thus what conditions are needed to generate a gamma -acyclic database scheme for a given relational scheme? In this paper, the sufficient and necessary condition of the existence of gamma -acyclic, join-lossless and dependencies-preserved database schemes meeting 4NF is given

the exist condit of gamma -acycl databas scheme with mvd constraint
 it is veri import to use databas technolog for a large-scal system such as erp and mi . a good databas design may improv the perform of the system . some research show that a gamma -acycl databas scheme ha mani good properti , e.g. , each connect join express is monoton , which help to improv queri perform of the databas system . thu what condit are need to gener a gamma -acycl databas scheme for a given relat scheme ? in thi paper , the suffici and necessari condit of the exist of gamma -acycl , join-lossless and dependencies-preserv databas scheme meet 4nf is given

existence condition
gamma -acyclic database schemes
MVDs constraints
database technology
large-scale system
connected join expression
query performance
sufficient and necessary condition


Real-time estimations of multi-modal frequencies for smart structures

Abstract: In this paper, various methods for the real-time estimation of multi-modal frequencies are realized in real time and compared through numerical and experimental tests. These parameter-based frequency estimation methods can be applied to various engineering fields such as communications, radar and adaptive vibration and noise control. Well-known frequency estimation methods are introduced and explained. The Bairstow method is introduced to find the roots of a characteristic equation for estimations of multi-modal frequencies, and the computational efficiency of the Bairstow method is shown quantitatively. For a simple numerical test, we consider two sinusoids of the same amplitudes mixed with various amounts of white noise. The test results show that the auto regressive (AR) and auto regressive and moving average (ARMA) methods are unsuitable in noisy environments. The other methods apart from the AR method have fast tracking capability. From the point of view of computational efficiency, the results reveal that the ARMA method is inefficient, while the cascade notch filter method is very effective. The linearized adaptive notch filter and recursive maximum likelihood methods have average performances. Experimental tests are devised to confirm the feasibility of real-time computations and to impose the severe conditions of drastically different amplitudes and of considerable changes of natural frequencies. We have performed experiments to extract the natural frequencies from the vibration signal of wing-like composite plates in real time. The natural frequencies of the specimen are changed by added masses. Especially, the AR method exhibits a remarkable performance in spite of the severe conditions. This study will be helpful to anyone who needs a frequency estimation algorithm for real-time applications

real-tim estim of multi-mod frequenc for smart structur
 in thi paper , variou method for the real-tim estim of multi-mod frequenc are realiz in real time and compar through numer and experiment test . these parameter-bas frequenc estim method can be appli to variou engin field such as commun , radar and adapt vibrat and nois control . well-known frequenc estim method are introduc and explain . the bairstow method is introduc to find the root of a characterist equat for estim of multi-mod frequenc , and the comput effici of the bairstow method is shown quantit . for a simpl numer test , we consid two sinusoid of the same amplitud mix with variou amount of white nois . the test result show that the auto regress ( ar ) and auto regress and move averag ( arma ) method are unsuit in noisi environ . the other method apart from the ar method have fast track capabl . from the point of view of comput effici , the result reveal that the arma method is ineffici , while the cascad notch filter method is veri effect . the linear adapt notch filter and recurs maximum likelihood method have averag perform . experiment test are devis to confirm the feasibl of real-tim comput and to impos the sever condit of drastic differ amplitud and of consider chang of natur frequenc . we have perform experi to extract the natur frequenc from the vibrat signal of wing-lik composit plate in real time . the natur frequenc of the specimen are chang by ad mass . especi , the ar method exhibit a remark perform in spite of the sever condit . thi studi will be help to anyon who need a frequenc estim algorithm for real-tim applic

auto regressive and moving average methods


Completion to involution and semidiscretisations

Abstract: We discuss the relation between the completion to involution of linear over-determined systems of partial differential equations with constant coefficients and the properties of differential algebraic equations obtained by their semidiscretisation. For a certain class of "weakly over-determined" systems, we show that the differential algebraic equations do not contain hidden constraints, if and only if the original partial differential system is involutive. We also demonstrate how the formal theory can be used to obtain an existence and uniqueness theorem for smooth solutions of strongly hyperbolic systems and to estimate the drift off the constraints, if an underlying equation is numerically solved. Finally, we show for general linear systems how the index of differential algebraic equations obtained by semidiscretisations can be predicted from the result of a completion of the partial differential system

complet to involut and semidiscretis
 we discuss the relat between the complet to involut of linear over-determin system of partial differenti equat with constant coeffici and the properti of differenti algebra equat obtain by their semidiscretis . for a certain class of " weakli over-determin " system , we show that the differenti algebra equat do not contain hidden constraint , if and onli if the origin partial differenti system is involut . we also demonstr how the formal theori can be use to obtain an exist and uniqu theorem for smooth solut of strongli hyperbol system and to estim the drift off the constraint , if an underli equat is numer solv . final , we show for gener linear system how the index of differenti algebra equat obtain by semidiscretis can be predict from the result of a complet of the partial differenti system

completion
involution
semidiscretisations
linear over-determined systems
partial differential equations
constant coefficients
differential algebraic equations
uniqueness theorem
strongly hyperbolic systems
index
matrices


Hysteretic threshold logic and quasi-delay insensitive asynchronous design

Abstract: We introduce the class of hysteretic linear-threshold (HLT) logic functions as a novel extension of linear threshold logic, and prove their general applicability for constructing state-holding Boolean functions. We then demonstrate a fusion of HLT logic with the quasi-delay insensitive style of asynchronous circuit design, complete with logical design examples. Future research directions are also identified

hysteret threshold logic and quasi-delay insensit asynchron design
 we introduc the class of hysteret linear-threshold ( hlt ) logic function as a novel extens of linear threshold logic , and prove their gener applic for construct state-hold boolean function . we then demonstr a fusion of hlt logic with the quasi-delay insensit style of asynchron circuit design , complet with logic design exampl . futur research direct are also identifi

hysteretic linear-threshold logic functions


A Virtual Test Facility for the simulation of dynamic response in materials

Abstract: The Center for Simulating Dynamic Response of Materials at the California Institute of Technology is constructing a virtual shock physics facility for studying the response of various target materials to very strong shocks. The Virtual Test Facility (VTF) is an end-to-end, fully three-dimensional simulation of the detonation of high explosives (HE), shock wave propagation, solid material response to pressure loading, and compressible turbulence. The VTF largely consists of a parallel fluid solver and a parallel solid mechanics package that are coupled together by the exchange of boundary data. The Eulerian fluid code and Lagrangian solid mechanics model interact via a novel approach based on level sets. The two main computational packages are integrated through the use of Pyre, a problem solving environment written in the Python scripting language. Pyre allows application developers to interchange various computational models and solver packages without recompiling code, and it provides standardized access to several data visualization engines and data input mechanisms. In this paper, we outline the main components of the VTF, discuss their integration via Pyre, and describe some recent accomplishments in large-scale simulation using the VTF

a virtual test facil for the simul of dynam respons in materi
 the center for simul dynam respons of materi at the california institut of technolog is construct a virtual shock physic facil for studi the respons of variou target materi to veri strong shock . the virtual test facil ( vtf ) is an end-to-end , fulli three-dimension simul of the deton of high explos ( he ) , shock wave propag , solid materi respons to pressur load , and compress turbul . the vtf larg consist of a parallel fluid solver and a parallel solid mechan packag that are coupl togeth by the exchang of boundari data . the eulerian fluid code and lagrangian solid mechan model interact via a novel approach base on level set . the two main comput packag are integr through the use of pyre , a problem solv environ written in the python script languag . pyre allow applic develop to interchang variou comput model and solver packag without recompil code , and it provid standard access to sever data visual engin and data input mechan . in thi paper , we outlin the main compon of the vtf , discuss their integr via pyre , and describ some recent accomplish in large-scal simul use the vtf

Virtual Test Facility
virtual shock physics facility
high explosives
shock wave propagation
solid material response
pressure loading
compressible turbulence
parallel fluid solver
parallel solid mechanics
Pyre
problem solving environment
Python scripting language
data visualization
shock physics simulation


Metaschemas for ER, ORM and UML data models: a comparison

Abstract: This paper provides metaschemas for some of the main database modeling notations used in industry. Two Entity Relationship (ER) notations (Information Engineering and Barker) are examined in detail, as well as Object Role Modeling (ORM) conceptual schema diagrams. The discussion of optionality, cardinality and multiplicity is widened to include Unified Modeling Language (UML) class diagrams. Issues addressed in the metamodel analysis include the normalization impact of non-derived constraints on derived associations, the influence of orthogonality on language transparency, and trade-offs between simplicity and expressibility. To facilitate comparison, the same modeling notation is used to display each metaschema. For this purpose, ORM is used because of its greater expressibility and clarity

metaschema for er , orm and uml data model : a comparison
 thi paper provid metaschema for some of the main databas model notat use in industri . two entiti relationship ( er ) notat ( inform engin and barker ) are examin in detail , as well as object role model ( orm ) conceptu schema diagram . the discuss of option , cardin and multipl is widen to includ unifi model languag ( uml ) class diagram . issu address in the metamodel analysi includ the normal impact of non-deriv constraint on deriv associ , the influenc of orthogon on languag transpar , and trade-off between simplic and express . to facilit comparison , the same model notat is use to display each metaschema . for thi purpos , orm is use becaus of it greater express and clariti

metaschemas
ORM
UML
data models
database modeling notations
Information Engineering
Object Role Modeling
conceptual schema diagrams
optionality
cardinality
multiplicity
Unified Modeling Language
class diagrams
normalization
orthogonality
language transparency
Entity Relationship modeling
Barker notation


Blind source separation applied to image cryptosystems with dual encryption

Abstract: Blind source separation (BSS) is explored to add another encryption level besides the existing encryption methods for image cryptosystems. The transmitted images are covered with a noise image by specific mixing before encryption and then recovered through BSS after decryption. Simulation results illustrate the validity of the proposed method

blind sourc separ appli to imag cryptosystem with dual encrypt
 blind sourc separ ( bss ) is explor to add anoth encrypt level besid the exist encrypt method for imag cryptosystem . the transmit imag are cover with a nois imag by specif mix befor encrypt and then recov through bss after decrypt . simul result illustr the valid of the propos method

blind source separation
image cryptosystems
dual encryption
transmitted images
noise image


Exploiting randomness in quantum information processing

Abstract: We consider how randomness can be made to play a useful role in quantum information processing-in particular, for decoherence control and the implementation of quantum algorithms. For a two-level system in which the decoherence channel is non-dissipative, we show that decoherence suppression is possible if memory is present in the channel. Random switching between two potentially harmful noise sources can then provide a source of stochastic control. Such random switching can also be used in an advantageous way for the implementation of quantum algorithms

exploit random in quantum inform process
 we consid how random can be made to play a use role in quantum inform processing-in particular , for decoher control and the implement of quantum algorithm . for a two-level system in which the decoher channel is non-dissip , we show that decoher suppress is possibl if memori is present in the channel . random switch between two potenti harm nois sourc can then provid a sourc of stochast control . such random switch can also be use in an advantag way for the implement of quantum algorithm

randomness
quantum information processing
decoherence control
quantum algorithms
two-level system
random switching
noise
stochastic control