The incredible shrinking pipeline

Abstract: We look at the harsh facts concerning the percentage of degrees awarded in CS to women. We study the trend of degrees awarded in CS since 1980, and compare the trend in CS to other science and engineering disciplines. We consider the relationship between the percentage of degrees awarded to women by a CS department and the college the CS department is within. We find that CS departments in engineering colleges graduate, on average, proportionately fewer women than CS departments in non-engineering colleges. We request that the community respond to the facts and speculations presented in this article

the incred shrink pipelin
 we look at the harsh fact concern the percentag of degre award in cs to women . we studi the trend of degre award in cs sinc 1980 , and compar the trend in cs to other scienc and engin disciplin . we consid the relationship between the percentag of degre award to women by a cs depart and the colleg the cs depart is within . we find that cs depart in engin colleg graduat , on averag , proportion fewer women than cs depart in non-engin colleg . we request that the commun respond to the fact and specul present in thi articl

women
science
engineering
pipeline shrinkage problem
computer science degrees


Integrated optical metrology controls post etch CDs

Abstract: Control of the transistor gate critical dimension (CD) on the order of a few nanometers is a top priority in many advanced IC fabs. Each nanometer deviation from the target gate length translates directly into the operational speed of these devices. However, using in-line process control by linking the lithography and etch tools can improve CD performance beyond what each individual tool can achieve. The integration of optical CD metrology tools to etch mainframes can result in excellent etcher stability and better control of post-etch CDs

integr optic metrolog control post etch cd
 control of the transistor gate critic dimens ( cd ) on the order of a few nanomet is a top prioriti in mani advanc ic fab . each nanomet deviat from the target gate length translat directli into the oper speed of these devic . howev , use in-lin process control by link the lithographi and etch tool can improv cd perform beyond what each individu tool can achiev . the integr of optic cd metrolog tool to etch mainfram can result in excel etcher stabil and better control of post-etch cd

integrated optical metrology
transistor gate critical dimension
IC fabs
target gate length
operational speed
in-line process control
CD performance
optical CD metrology tools
etch mainframes
etcher stability
post etch CD control
lithography tools
photolithography


Speedera: Web without the wait

Abstract: There's no greater testament to the utility of the Internet than the fact that hundreds of millions of people worldwide are willing to wait for Web pages as they build incrementally on screen. But while users may put up with the "World Wide Wait," they definitely don't like it. That's where Content Delivery Networks come in. CDNs can't turn a footpath into a freeway, but they can help data in transit take advantage of shortcuts and steer clear of traffic jams. And while enhancing the responsiveness of Web interaction, CDNs also enhance the prospects of their clients, who need engaged visitors to keep their Web-based business models afloat. "Our mission is to improve the quality of the Internet experience for end-users," says Gordon Smith, vice president of marketing at Speedera Networks in Santa Clara, California, "and to enable Web-site operators to provide better delivery quality, performance, scalability, and security through an outsourced service model that slashes IT costs."

speedera : web without the wait
 there 's no greater testament to the util of the internet than the fact that hundr of million of peopl worldwid are will to wait for web page as they build increment on screen . but while user may put up with the " world wide wait , " they definit do n't like it . that 's where content deliveri network come in . cdn ca n't turn a footpath into a freeway , but they can help data in transit take advantag of shortcut and steer clear of traffic jam . and while enhanc the respons of web interact , cdn also enhanc the prospect of their client , who need engag visitor to keep their web-bas busi model afloat . " our mission is to improv the qualiti of the internet experi for end-us , " say gordon smith , vice presid of market at speedera network in santa clara , california , " and to enabl web-sit oper to provid better deliveri qualiti , perform , scalabl , and secur through an outsourc servic model that slash it cost . "

Content Delivery Networks
Web interaction
Web-based business models
Internet experience
Web-site operators
delivery quality
scalability
security
outsourced service model
World Wide Web


A variable-stepsize variable-order multistep method for the integration of perturbed linear problems

Abstract: G. Scheifele (1971) wrote the solution of a perturbed oscillator as an expansion in terms of a new set of functions, which extends the monomials in the Taylor series of the solution. Recently, P. Martin and J.M. Ferrandiz (1997) constructed a multistep code based on the Scheifele technique, and it was generalized by D.J. Lopez and P. Martin (1998) for perturbed linear problems. However, the remarked codes are constant steplength methods, and efficient integrators must be able to change the steplength. In this paper we extend the ideas of F.T. Krogh (1974) from Adams methods to the algorithm proposed by Lopez and Martin, and we show the advantages of the new code in perturbed problems

a variable-steps variable-ord multistep method for the integr of perturb linear problem
 g. scheifel ( 1971 ) wrote the solut of a perturb oscil as an expans in term of a new set of function , which extend the monomi in the taylor seri of the solut . recent , p. martin and j.m. ferrandiz ( 1997 ) construct a multistep code base on the scheifel techniqu , and it wa gener by d.j. lopez and p. martin ( 1998 ) for perturb linear problem . howev , the remark code are constant steplength method , and effici integr must be abl to chang the steplength . in thi paper we extend the idea of f.t. krogh ( 1974 ) from adam method to the algorithm propos by lopez and martin , and we show the advantag of the new code in perturb problem


Abstract: With the advent of Internet technology, it is now feasible to provide effective and efficient helpdesk service over the global Internet to meet customers' requirements and satisfaction. In this research, we have designed and developed a Web-based intelligent helpdesk-support environment, WebHotLine, to support the customer service centre of a large multinational corporation in the electronics industry. The paper describes the basic architecture of the environment that supports the major functions of Web-based fault information retrieval, online multilingual translation capability, different operating modes of video-conferencing for enhanced support and direct intelligent fault diagnosis by customers or customer support engineers. As a result, WebHotLine helps to save cost in eliminating the expensive overseas telephone charges, reduction in machine down time and number of on-site visits by service engineers as in traditional helpdesk environment

web-bas intellig helpdesk-support environ
 with the advent of internet technolog , it is now feasibl to provid effect and effici helpdesk servic over the global internet to meet custom ' requir and satisfact . in thi research , we have design and develop a web-bas intellig helpdesk-support environ , webhotlin , to support the custom servic centr of a larg multin corpor in the electron industri . the paper describ the basic architectur of the environ that support the major function of web-bas fault inform retriev , onlin multilingu translat capabl , differ oper mode of video-conferenc for enhanc support and direct intellig fault diagnosi by custom or custom support engin . as a result , webhotlin help to save cost in elimin the expens oversea telephon charg , reduct in machin down time and number of on-sit visit by servic engin as in tradit helpdesk environ


Permission grids: practical, error-bounded simplification

Abstract: We introduce the permission grid, a spatial occupancy grid which can be used to guide almost any standard polygonal surface simplification algorithm into generating an approximation with a guaranteed geometric error bound. In particular, all points on the approximation are guaranteed to be within some user-specified distance from the original surface. Such bounds are notably absent from many current simplification methods, and are becoming increasingly important for applications in scientific computing and adaptive level of detail control. Conceptually simple, the permission grid defines a volume in which the approximation must lie, and does not permit the underlying simplification algorithm to generate approximations outside the volume. The permission grid makes three important, practical improvements over current error-bounded simplification methods. First, it works on arbitrary triangular models, handling all manners of mesh degeneracies gracefully. Further, the error tolerance may be easily expanded as simplification proceeds, allowing the construction of an error-bounded level of detail hierarchy with vertex correspondences among all levels of detail. And finally, the permission grid has a representation complexity independent of the size of the input model, and a small running time overhead, making it more practical and efficient than current methods with similar guarantees

permiss grid : practic , error-bound simplif
 we introduc the permiss grid , a spatial occup grid which can be use to guid almost ani standard polygon surfac simplif algorithm into gener an approxim with a guarante geometr error bound . in particular , all point on the approxim are guarante to be within some user-specifi distanc from the origin surfac . such bound are notabl absent from mani current simplif method , and are becom increasingli import for applic in scientif comput and adapt level of detail control . conceptu simpl , the permiss grid defin a volum in which the approxim must lie , and doe not permit the underli simplif algorithm to gener approxim outsid the volum . the permiss grid make three import , practic improv over current error-bound simplif method . first , it work on arbitrari triangular model , handl all manner of mesh degeneraci grace . further , the error toler may be easili expand as simplif proce , allow the construct of an error-bound level of detail hierarchi with vertex correspond among all level of detail . and final , the permiss grid ha a represent complex independ of the size of the input model , and a small run time overhead , make it more practic and effici than current method with similar guarante


Access privilege management in protection systems

Abstract: We consider the problem of managing access privileges on protected objects. We associate one or more locks with each object, one lock for each access right defined by the object type. Possession of an access right on a given object is certified by possession of a key for this object, if this key matches one of the object locks. We introduce a number of variants to this basic key-lock technique. Polymorphic access rights make it possible to decrease the number of keys required to certify possession of complex access privileges that are defined in terms of several access rights. Multiple locks on the same access right allow us to exercise forms of selective revocation of access privileges. A lock conversion function can be used to reduce the number of locks associated with any given object to a single lock. The extent of the results obtained is evaluated in relation to alternative methodologies for access privilege management

access privileg manag in protect system
 we consid the problem of manag access privileg on protect object . we associ one or more lock with each object , one lock for each access right defin by the object type . possess of an access right on a given object is certifi by possess of a key for thi object , if thi key match one of the object lock . we introduc a number of variant to thi basic key-lock techniqu . polymorph access right make it possibl to decreas the number of key requir to certifi possess of complex access privileg that are defin in term of sever access right . multipl lock on the same access right allow us to exercis form of select revoc of access privileg . a lock convers function can be use to reduc the number of lock associ with ani given object to a singl lock . the extent of the result obtain is evalu in relat to altern methodolog for access privileg manag

complex access privilege possession certification


Wavelet-based level-of-detail representation of 3D objects

Abstract: In this paper, we propose a 3D object LOD (Level of Detail) modeling system that constructs a mesh from range images and generates the mesh of various LOD using the wavelet transform. In the initial mesh generation, we use the marching cube algorithm. We modify the original algorithm to apply it to construct the mesh from multiple range images efficiently. To get the base mesh we use the decimation algorithm which simplifies a mesh with preserving the topology. Finally, when reconstructing new mesh which is similar to initial mesh we calculate the wavelet coefficients by using the wavelet transform. We solve the critical problem of wavelet-based methods - the surface crease problem - by using the mesh simplification as the base mesh generation method

wavelet-bas level-of-detail represent of 3d object
 in thi paper , we propos a 3d object lod ( level of detail ) model system that construct a mesh from rang imag and gener the mesh of variou lod use the wavelet transform . in the initi mesh gener , we use the march cube algorithm . we modifi the origin algorithm to appli it to construct the mesh from multipl rang imag effici . to get the base mesh we use the decim algorithm which simplifi a mesh with preserv the topolog . final , when reconstruct new mesh which is similar to initi mesh we calcul the wavelet coeffici by use the wavelet transform . we solv the critic problem of wavelet-bas method - the surfac creas problem - by use the mesh simplif as the base mesh gener method

3D object level of detail modeling system


Reproducibility of mammary gland structure during repeat setups in a supine position

Abstract: Purpose: In breast conserving therapy, complete excision of the tumor with an acceptable cosmetic outcome depends on accurate localization in terms of both the position of the lesion and its extent. We hypothesize that preoperative contrast-enhanced magnetic resonance (MR) imaging of the patient in a supine position may be used for accurate tumor localization and marking of its extent immediately prior to surgery. Our aims in this study are to assess the reproducibility of mammary gland structure during repeat setups in a supine position, to evaluate the effect of a breast immobilization device, and to derive reproducibility margins that take internal tissue shifts into account occurring between repeat setups. Materials Methods: The reproducibility of mammary gland structure during repeat setups in a supine position is estimated by quantification of tissue shifts in the breasts of healthy volunteers between repeat MR setups. For each volunteer fiducials are identified and registered with their counter locations in corresponding MR volumes. The difference in position denotes the shift of breast tissue. The dependence on breast volume and the part of the breast, as well as the effect of a breast immobilization cast are studied. Results: The tissue shifts are small with a mean standard deviation on the order of 1.5 mm, being slightly larger in large breasts (V>1000 cm/sup 3/), and in the posterior part (toward the pectoral muscle) of both small and large breasts. The application of a breast immobilization cast reduces the tissue shifts in large breasts. A reproducibility margin on the order of 5 mm will take the internal tissue shifts into account that occur between repeat setups. Conclusion: The results demonstrate a high reproducibility of mammary gland structure during repeat setups in a supine position

reproduc of mammari gland structur dure repeat setup in a supin posit
 purpos : in breast conserv therapi , complet excis of the tumor with an accept cosmet outcom depend on accur local in term of both the posit of the lesion and it extent . we hypothes that preoper contrast-enhanc magnet reson ( mr ) imag of the patient in a supin posit may be use for accur tumor local and mark of it extent immedi prior to surgeri . our aim in thi studi are to assess the reproduc of mammari gland structur dure repeat setup in a supin posit , to evalu the effect of a breast immobil devic , and to deriv reproduc margin that take intern tissu shift into account occur between repeat setup . materi method : the reproduc of mammari gland structur dure repeat setup in a supin posit is estim by quantif of tissu shift in the breast of healthi volunt between repeat mr setup . for each volunt fiduci are identifi and regist with their counter locat in correspond mr volum . the differ in posit denot the shift of breast tissu . the depend on breast volum and the part of the breast , as well as the effect of a breast immobil cast are studi . result : the tissu shift are small with a mean standard deviat on the order of 1.5 mm , be slightli larger in larg breast ( v>1000 cm / sup 3/ ) , and in the posterior part ( toward the pector muscl ) of both small and larg breast . the applic of a breast immobil cast reduc the tissu shift in larg breast . a reproduc margin on the order of 5 mm will take the intern tissu shift into account that occur between repeat setup . conclus : the result demonstr a high reproduc of mammari gland structur dure repeat setup in a supin posit

contrast-enhanced magnetic resonance imaging


A 3-stage pipelined architecture for multi-view images decoder

Abstract: In this paper, we proposed the architecture of the decoder which implements the multi-view images decoding algorithm. The study of the hardware structure of the multi-view image processing has not been accomplished. The proposed multi-view images decoder operates in a three stage pipelined manner and extracts the depth of the pixels of the decoded image every clock. The multi-view images decoder consists of three modules, Node selector which transfers the value of the nodes repeatedly and Depth Extractor which extracts the depth of each pixel from the four values of the nodes and Affine Transformer which generates the projecting position on the image plane from the values of the pixels and the specified viewpoint. The proposed architecture is designed and simulated by the Max+PlusII design tool and the operating frequency is 30 MHz. The image can be constructed in a real time by the decoder with the proposed architecture

a 3-stage pipelin architectur for multi-view imag decod
 in thi paper , we propos the architectur of the decod which implement the multi-view imag decod algorithm . the studi of the hardwar structur of the multi-view imag process ha not been accomplish . the propos multi-view imag decod oper in a three stage pipelin manner and extract the depth of the pixel of the decod imag everi clock . the multi-view imag decod consist of three modul , node selector which transfer the valu of the node repeatedli and depth extractor which extract the depth of each pixel from the four valu of the node and affin transform which gener the project posit on the imag plane from the valu of the pixel and the specifi viewpoint . the propos architectur is design and simul by the max+plusii design tool and the oper frequenc is 30 mhz . the imag can be construct in a real time by the decod with the propos architectur

multi-view images decoder
hardware structure
node selector
depth extractor
affine transformer
viewpoint
Max+PlusII design tool
operating frequency
30 MHz
three-stage pipelined architecture
pixel depth


Philadelphia stock exchange taps TimesTen for database technology

Abstract: PHLX rolls out Equity Options AutoQuote System to traders as the first application to leverage its enhanced data architecture

philadelphia stock exchang tap timesten for databas technolog
 phlx roll out equiti option autoquot system to trader as the first applic to leverag it enhanc data architectur

Philadelphia stock exchange
TimesTen
Equity Options AutoQuote System
data architecture


Molecular descriptor selection combining genetic algorithms and fuzzy logic: application to database mining procedures

Abstract: A new algorithm, devoted to molecular descriptor selection in the context of data mining problems, has been developed. This algorithm is based on the concepts of genetic algorithms (GA) for descriptor hyperspace exploration and combined with a stepwise approach to get local convergence. Its selection power was evaluated by a fitness function derived from a fuzzy clustering method. Different training and test sets were randomly generated at each GA generation. The fitness score was derived by combining the scores of the training and test sets. The ability of the proposed algorithm to select relevant subsets of descriptors was tested on two data sets. The first one, an academic example, corresponded to the artificial problem of Bullseye, the second was a real data set including 114 olfactory compounds divided into three odor categories. In both cases, the proposed method allowed to improve the separation between the different data set classes

molecular descriptor select combin genet algorithm and fuzzi logic : applic to databas mine procedur
 a new algorithm , devot to molecular descriptor select in the context of data mine problem , ha been develop . thi algorithm is base on the concept of genet algorithm ( ga ) for descriptor hyperspac explor and combin with a stepwis approach to get local converg . it select power wa evalu by a fit function deriv from a fuzzi cluster method . differ train and test set were randomli gener at each ga gener . the fit score wa deriv by combin the score of the train and test set . the abil of the propos algorithm to select relev subset of descriptor wa test on two data set . the first one , an academ exampl , correspond to the artifici problem of bullsey , the second wa a real data set includ 114 olfactori compound divid into three odor categori . in both case , the propos method allow to improv the separ between the differ data set class

molecular descriptor selection
genetic algorithms
fuzzy logic
database mining
data mining
descriptor hyperspace exploration
stepwise approach
local convergence
fitness function
fuzzy clustering method
test sets
fitness score
Bullseye
olfactory compounds
odor categories
training sets


An intelligent tutoring system for a power plant simulator

Abstract: In this paper, an intelligent tutoring system (ITS) is proposed for a power plant simulator. With a well designed ITS, the need for an instructor is minimized and the operator may readily and efficiently take, in real-time, the control of simulator with appropriate messages he(she) gets from the tutoring system. Using SIMULINK and based on object oriented programming (OOP) and C programming language, a fossil-fuelled power plant simulator with an ITS is proposed. Promising results are demonstrated for a typical power plant

an intellig tutor system for a power plant simul
 in thi paper , an intellig tutor system ( it ) is propos for a power plant simul . with a well design it , the need for an instructor is minim and the oper may readili and effici take , in real-tim , the control of simul with appropri messag he(sh ) get from the tutor system . use simulink and base on object orient program ( oop ) and c program languag , a fossil-fuel power plant simul with an it is propos . promis result are demonstr for a typic power plant

intelligent tutoring system
SIMULINK
object oriented programming
C programming language
fossil-fuelled power plant simulator
control simulation
CAI


Implementation and evaluation of HPF/SX V2

Abstract: We are developing HPF/SX V2, a High Performance Fortran (HPF) compiler for vector parallel machines. It provides some unique extensions as well as the features of HPF 2.0 and HPF/JA. In particular, this paper describes four of them: (1) the ON directive of HPF 2.0; (2) the REFLECT and LOCAL directives of HPF/JA; (3) vectorization directives; and (4) automatic parallelization. We evaluate these features through some benchmark programs on NEC SX-5. The results show that each of them achieved a 5-8 times speedup in 8-CPU parallel execution and the four features are useful for vector parallel execution. We also evaluate the overall performance of HPF/SX V2 by using over 30 well-known benchmark programs from HPFBench, APR Benchmarks, GENESIS Benchmarks, and NAS Parallel Benchmarks. About half of the programs showed good performance, while the other half suggest weakness of the compiler, especially on its runtimes. It is necessary to improve them to put the compiler to practical use

implement and evalu of hpf / sx v2
 we are develop hpf / sx v2 , a high perform fortran ( hpf ) compil for vector parallel machin . it provid some uniqu extens as well as the featur of hpf 2.0 and hpf / ja . in particular , thi paper describ four of them : ( 1 ) the on direct of hpf 2.0 ; ( 2 ) the reflect and local direct of hpf / ja ; ( 3 ) vector direct ; and ( 4 ) automat parallel . we evalu these featur through some benchmark program on nec sx-5 . the result show that each of them achiev a 5 - 8 time speedup in 8-cpu parallel execut and the four featur are use for vector parallel execut . we also evalu the overal perform of hpf / sx v2 by use over 30 well-known benchmark program from hpfbench , apr benchmark , genesi benchmark , and na parallel benchmark . about half of the program show good perform , while the other half suggest weak of the compil , especi on it runtim . it is necessari to improv them to put the compil to practic use

HPF/SX V2
compiler
vector parallel machines
parallelization
benchmark
High Performance Fortran compiler


HPCVIEW: a tool for top-down analysis of node performance

Abstract: It is increasingly difficult for complex scientific programs to attain a significant fraction of peak performance on systems that are based on microprocessors with substantial instruction-level parallelism and deep memory hierarchies. Despite this trend, performance analysis and tuning tools are still not used regularly by algorithm and application designers. To a large extent, existing performance tools fail to meet many user needs and are cumbersome to use. To address these issues, we developed HPCVIEW - a toolkit for combining multiple sets of program profile data, correlating the data with source code, and generating a database that can be analyzed anywhere with a commodity Web browser. We argue that HPCVIEW addresses many of the issues that have limited the usability and the utility of most existing tools. We originally built HPCVIEW to facilitate our own work on data layout and optimizing compilers. Now, in addition to daily use within our group, HPCVIEW is being used by several code development teams in DoD and DoE laboratories as well as at NCSA

hpcview : a tool for top-down analysi of node perform
 it is increasingli difficult for complex scientif program to attain a signific fraction of peak perform on system that are base on microprocessor with substanti instruction-level parallel and deep memori hierarchi . despit thi trend , perform analysi and tune tool are still not use regularli by algorithm and applic design . to a larg extent , exist perform tool fail to meet mani user need and are cumbersom to use . to address these issu , we develop hpcview - a toolkit for combin multipl set of program profil data , correl the data with sourc code , and gener a databas that can be analyz anywher with a commod web browser . we argu that hpcview address mani of the issu that have limit the usabl and the util of most exist tool . we origin built hpcview to facilit our own work on data layout and optim compil . now , in addit to daili use within our group , hpcview is be use by sever code develop team in dod and doe laboratori as well as at ncsa

HPCView
top-down analysis
node performance
complex scientific programs
peak performance
instruction-level parallelism
deep memory hierarchies
performance analysis
source code
commodity Web browser
data layout
optimizing compilers
software tools
binary analysis


Optical actuation of a bistable MEMS

Abstract: This paper presents an optical actuation scheme for MEMS devices based on the well-established fact that light possesses momentum, and hence, imparts a force equal to 2 W/c when reflected by a surface. Here, W is the total power of the reflected light, and c is the speed of light. Radiation pressure, as it is known, is nearly insignificant for most macroscale applications, but it can be quite significant for MEMS devices. In addition, light actuation offers a new paradigm. First, intersecting light beams do not interfere, in contrast to electrical conductors, which short when they come into contact. Second, light can operate in high temperature and high radiation environments far outside the capability of solid state electronic components. This actuation method is demonstrated, both in air and in vacuum, by switching the state of a bistable MEMS device. The associated heat transfer model is also presented

optic actuat of a bistabl mem
 thi paper present an optic actuat scheme for mem devic base on the well-establish fact that light possess momentum , and henc , impart a forc equal to 2 w / c when reflect by a surfac . here , w is the total power of the reflect light , and c is the speed of light . radiat pressur , as it is known , is nearli insignific for most macroscal applic , but it can be quit signific for mem devic . in addit , light actuat offer a new paradigm . first , intersect light beam do not interfer , in contrast to electr conductor , which short when they come into contact . second , light can oper in high temperatur and high radiat environ far outsid the capabl of solid state electron compon . thi actuat method is demonstr , both in air and in vacuum , by switch the state of a bistabl mem devic . the associ heat transfer model is also present

bistable MEMS
optical actuation scheme
MEMS devices
radiation pressure
intersecting light beams
high radiation environments
heat transfer model
high temperature environments


Network intrusion and fault detection: a statistical anomaly approach

Abstract: With the advent and explosive growth of the global Internet and electronic commerce environments, adaptive/automatic network/service intrusion and anomaly detection in wide area data networks and e-commerce infrastructures is fast gaining critical research and practical importance. We present and demonstrate the use of a general-purpose hierarchical multitier multiwindow statistical anomaly detection technology and system that operates automatically, adaptively, and proactively, and can be applied to various networking technologies, including both wired and wireless ad hoc networks. Our method uses statistical models and multivariate classifiers to detect anomalous network conditions. Some numerical results are also presented that demonstrate that our proposed methodology can reliably detect attacks with traffic anomaly intensity as low as 3-5 percent of the typical background traffic intensity, thus promising to generate an effective early warning

network intrus and fault detect : a statist anomali approach
 with the advent and explos growth of the global internet and electron commerc environ , adapt / automat network / servic intrus and anomali detect in wide area data network and e-commerc infrastructur is fast gain critic research and practic import . we present and demonstr the use of a general-purpos hierarch multiti multiwindow statist anomali detect technolog and system that oper automat , adapt , and proactiv , and can be appli to variou network technolog , includ both wire and wireless ad hoc network . our method use statist model and multivari classifi to detect anomal network condit . some numer result are also present that demonstr that our propos methodolog can reliabl detect attack with traffic anomali intens as low as 3 - 5 percent of the typic background traffic intens , thu promis to gener an effect earli warn

hierarchical multitier statistical anomaly detection

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


Sufficient conditions on nonemptiness and boundedness of the solution set of the P/sub 0/ function nonlinear complementarity problem

Abstract: The P/sub 0/ function nonlinear complementarity, problem (NCP) has attracted a lot of attention among researchers. Various assumed conditions, which ensure that the NCP has a solution have been proposed. In this paper, by using the notion of an exceptional family of elements we develop a sufficient condition which ensures that the solution set of the P/sub 0/ function NCP is nonempty and bounded. In particular, we prove that many existing assumed conditions imply this sufficient condition. Thus, these conditions imply that the solution set of the P/sub 0/ function NCP is nonempty and bounded. In addition, we also prove directly that a few existence conditions imply that the solution set of the P/sub 0/ function NCP is bounded

suffici condit on nonempti and bounded of the solut set of the p / sub 0/ function nonlinear complementar problem
 the p / sub 0/ function nonlinear complementar , problem ( ncp ) ha attract a lot of attent among research . variou assum condit , which ensur that the ncp ha a solut have been propos . in thi paper , by use the notion of an except famili of element we develop a suffici condit which ensur that the solut set of the p / sub 0/ function ncp is nonempti and bound . in particular , we prove that mani exist assum condit impli thi suffici condit . thu , these condit impli that the solut set of the p / sub 0/ function ncp is nonempti and bound . in addit , we also prove directli that a few exist condit impli that the solut set of the p / sub 0/ function ncp is bound


Adjoint-based optimization of steady suction for disturbance control in incompressible flows

Abstract: The optimal distribution of steady suction needed to control the growth of single or multiple disturbances in quasi-three-dimensional incompressible boundary layers on a flat plate is investigated. The evolution of disturbances is analysed in the framework of the parabolized stability equations (PSE). A gradient-based optimization procedure is used and the gradients are evaluated using the adjoint of the parabolized stability equations (APSE) and the adjoint of the boundary layer equations (ABLE). The accuracy of the gradient is increased by introducing a stabilization procedure for the PSE. Results show that a suction peak appears in the upstream part of the suction region for optimal control of Tollmien-Schlichting (T-S) waves, steady streamwise streaks in a two-dimensional boundary layer and oblique waves in a quasi-three-dimensional boundary layer subject to an adverse pressure gradient. The mean flow modifications due to suction are shown to have a stabilizing effect similar to that of a favourable pressure gradient. It is also shown that the optimal suction distribution for the disturbance of interest reduces the growth rate of other perturbations. Results for control of a steady cross-flow mode in a three-dimensional boundary layer subject to a favourable pressure gradient show that not even large amounts of suction can completely stabilize the disturbance

adjoint-bas optim of steadi suction for disturb control in incompress flow
 the optim distribut of steadi suction need to control the growth of singl or multipl disturb in quasi-three-dimension incompress boundari layer on a flat plate is investig . the evolut of disturb is analys in the framework of the parabol stabil equat ( pse ) . a gradient-bas optim procedur is use and the gradient are evalu use the adjoint of the parabol stabil equat ( aps ) and the adjoint of the boundari layer equat ( abl ) . the accuraci of the gradient is increas by introduc a stabil procedur for the pse . result show that a suction peak appear in the upstream part of the suction region for optim control of tollmien-schlicht ( t- ) wave , steadi streamwis streak in a two-dimension boundari layer and obliqu wave in a quasi-three-dimension boundari layer subject to an advers pressur gradient . the mean flow modif due to suction are shown to have a stabil effect similar to that of a favour pressur gradient . it is also shown that the optim suction distribut for the disturb of interest reduc the growth rate of other perturb . result for control of a steadi cross-flow mode in a three-dimension boundari layer subject to a favour pressur gradient show that not even larg amount of suction can complet stabil the disturb

quasithree-dimensional incompressible boundary layers


Estimation of thermal coefficients of magneto-optical media

Abstract: Previously we described a method for estimating the thermal conductivity of magneto-optic recording media. The method relies on identifying the laser power that brings the maximum temperature of the TbFeCo layer to as high as the Curie temperature. We extensively use a similar method to estimate the heat capacity of a dielectric layer, a TbFeCo layer, and an aluminum alloy layer of magneto-optic recording media. Measurements are conducted on static disks with a beam of light focused on a TbFeCo layer. The method has the advantage of thermal diffusion depending on a multilayer structure and irradiation time

estim of thermal coeffici of magneto-opt media
 previous we describ a method for estim the thermal conduct of magneto-opt record media . the method reli on identifi the laser power that bring the maximum temperatur of the tbfeco layer to as high as the curi temperatur . we extens use a similar method to estim the heat capac of a dielectr layer , a tbfeco layer , and an aluminum alloy layer of magneto-opt record media . measur are conduct on static disk with a beam of light focus on a tbfeco layer . the method ha the advantag of thermal diffus depend on a multilay structur and irradi time

thermal coefficients
magneto-optical media
thermal conductivity
magneto-optic recording media
laser power
maximum temperature
TbFeCo layer
TbFeCo
Curie temperature
heat capacity
dielectric layer
aluminum alloy layer
static disks
light focusing
thermal diffusion
multilayer structure
irradiation time


Experimental investigations on monitoring and control of induction heating process for semi-solid alloys using the heating coil as sensor

Abstract: A method of monitoring the state of metal alloys during induction heating and control of the heating process utilizing the heating coil itself as a sensor is proposed, and its usefulness and effectiveness were experimentally investigated using aluminium A357 billets for the semi-solid metal (SSM) casting processes. The impedance of the coil containing the billet was continuously measured by the proposed method in the temperature range between room temperature and 700 degrees C. It was found that the reactance component of the impedance varied distinctively according to the billet state and could clearly monitor the deformation of the billet, while the resistance component increased with temperature, reflecting the variation of the resistivity of the billet which has strong correlation to the solid/liquid fraction of the billets. The measured impedance is very sensitive to the billet states such as temperature, deformation and solid/liquid fraction and could be used as a parameter to monitor and control the heating process for SSMs

experiment investig on monitor and control of induct heat process for semi-solid alloy use the heat coil as sensor
 a method of monitor the state of metal alloy dure induct heat and control of the heat process util the heat coil itself as a sensor is propos , and it use and effect were experiment investig use aluminium a357 billet for the semi-solid metal ( ssm ) cast process . the imped of the coil contain the billet wa continu measur by the propos method in the temperatur rang between room temperatur and 700 degre c. it wa found that the reactanc compon of the imped vari distinct accord to the billet state and could clearli monitor the deform of the billet , while the resist compon increas with temperatur , reflect the variat of the resist of the billet which ha strong correl to the solid / liquid fraction of the billet . the measur imped is veri sensit to the billet state such as temperatur , deform and solid / liquid fraction and could be use as a paramet to monitor and control the heat process for ssm

induction heating process
reactance component
billet state
resistance component
solid/liquid fraction
process monitoring
process control
semisolid alloys
semisolid metal casting
heating coil sensor
coil impedance
billet deformation
resistivity variation
solenoid coil
20 to 700 C


Optical setup and analysis of disk-type photopolymer high-density holographic storage

Abstract: A relatively simple scheme for disk-type photopolymer high-density holographic storage based on angular and spatial multiplexing is described. The effects of the optical setup on the recording capacity and density are studied. Calculations and analysis show that this scheme is more effective than a scheme based on the spatioangular multiplexing for disk-type photopolymer high-density holographic storage, which has a limited medium thickness. Also an optimal beam recording angle exists to achieve maximum recording capacity and density

optic setup and analysi of disk-typ photopolym high-dens holograph storag
 a rel simpl scheme for disk-typ photopolym high-dens holograph storag base on angular and spatial multiplex is describ . the effect of the optic setup on the record capac and densiti are studi . calcul and analysi show that thi scheme is more effect than a scheme base on the spatioangular multiplex for disk-typ photopolym high-dens holograph storag , which ha a limit medium thick . also an optim beam record angl exist to achiev maximum record capac and densiti


Rational systems exhibit moderate risk aversion with respect to "gambles" on variable-resolution compression

Abstract: In an embedded wavelet scheme for progressive transmission, a tree structure naturally defines the spatial relationship on the hierarchical pyramid. Transform coefficients over each tree correspond to a unique local spatial region of the original image, and they can be coded bit-plane by bit-plane through successive-approximation quantization. After receiving the approximate value of some coefficients, the decoder can obtain a reconstructed image. We show a rational system for progressive transmission that, in absence of a priori knowledge about regions of interest, chooses at any truncation time among alternative trees for further transmission in such a way as to avoid certain forms of behavioral inconsistency. We prove that some rational transmission systems might exhibit aversion to risk involving "gambles" on tree-dependent quality of encoding while others favor taking such risks. Based on an acceptable predictor for visual distinctness from digital imagery, we demonstrate that, without any outside knowledge, risk-prone systems as well as those with strong risk aversion appear in capable of attaining the quality of reconstructions that can be achieved with moderate risk-averse behavior

ration system exhibit moder risk avers with respect to " gambl " on variable-resolut compress
 in an embed wavelet scheme for progress transmiss , a tree structur natur defin the spatial relationship on the hierarch pyramid . transform coeffici over each tree correspond to a uniqu local spatial region of the origin imag , and they can be code bit-plan by bit-plan through successive-approxim quantiz . after receiv the approxim valu of some coeffici , the decod can obtain a reconstruct imag . we show a ration system for progress transmiss that , in absenc of a priori knowledg about region of interest , choos at ani truncat time among altern tree for further transmiss in such a way as to avoid certain form of behavior inconsist . we prove that some ration transmiss system might exhibit avers to risk involv " gambl " on tree-depend qualiti of encod while other favor take such risk . base on an accept predictor for visual distinct from digit imageri , we demonstr that , without ani outsid knowledg , risk-pron system as well as those with strong risk avers appear in capabl of attain the qualiti of reconstruct that can be achiev with moder risk-avers behavior

hierarchical pyramid spatial relationship

progressive transmission utility functions

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


Abacus, EFI and anti-virus

Abstract: The Extensible Firmware Interface (EFI) standard emerged as a logical step to provide flexibility and extensibility to boot sequence processes, enabling the complete abstraction of a system's BIOS interface from the system's hardware. In doing so, this provided the means of standardizing a boot-up sequence, extending device drivers and boot time applications' portability to non PC-AT-based architectures, including embedded systems like Internet appliances, TV Internet set-top boxes and 64-bit Itanium platforms

abacu , efi and anti-viru
 the extens firmwar interfac ( efi ) standard emerg as a logic step to provid flexibl and extens to boot sequenc process , enabl the complet abstract of a system 's bio interfac from the system 's hardwar . in do so , thi provid the mean of standard a boot-up sequenc , extend devic driver and boot time applic ' portabl to non pc-at-bas architectur , includ embed system like internet applianc , tv internet set-top box and 64-bit itanium platform

anti-virus
embedded systems
Extensible Firmware Interface standard


X-Rite: more than a graphic arts company

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

x-rite : more than a graphic art compani
 although it is well known as a maker of densitomet and spectrophotomet , x-rite is activ in measur light and shape in mani industri . among them are automobil finish , paint and home improv , scientif instrument , optic semiconductor and even cosmet dentistri


Automated post bonding inspection by using machine vision techniques

Abstract: Inspection plays an important role in the semiconductor industry. In this paper, we focus on the inspection task after wire bonding in packaging. The purpose of wire bonding (W/B) is to connect the bond pads with the lead fingers. Two major types of defects are (1) bonding line missing and (2) bonding line breakage. The numbers of bonding lines and bonding balls are used as the features for defect classification. The proposed method consists of image preprocessing, orientation determination, connection detection, bonding line detection, bonding ball detection, and defect classification. The proposed method is simple and fast. The experimental results show that the proposed method can detect the defects effectively

autom post bond inspect by use machin vision techniqu
 inspect play an import role in the semiconductor industri . in thi paper , we focu on the inspect task after wire bond in packag . the purpos of wire bond ( w / b ) is to connect the bond pad with the lead finger . two major type of defect are ( 1 ) bond line miss and ( 2 ) bond line breakag . the number of bond line and bond ball are use as the featur for defect classif . the propos method consist of imag preprocess , orient determin , connect detect , bond line detect , bond ball detect , and defect classif . the propos method is simpl and fast . the experiment result show that the propos method can detect the defect effect

automated post bonding inspection
machine vision
semiconductor industry
wire bonding
packaging
lead fingers
bonding line missing
bonding line breakage
bonding balls
defect classification
image preprocessing
orientation determination
connection detection
bonding line detection
bonding ball detection
IC manufacturing
bond pad connection


IT at the heart of joined-up policing

Abstract: Police IT is to shift from application-focused to component-based technology. The change of strategy, part of the Valiant Programme, will make information held by individual forces available on a national basis

it at the heart of joined-up polic
 polic it is to shift from application-focus to component-bas technolog . the chang of strategi , part of the valiant programm , will make inform held by individu forc avail on a nation basi


The 3D visibility complex

Abstract: Visibility problems are central to many computer graphics applications. The most common examples include hidden-part removal for view computation, shadow boundaries, mutual visibility of objects for lighting simulation. In this paper, we present a theoretical study of 3D visibility properties for scenes of smooth convex objects. We work in the space of light rays, or more precisely, of maximal free segments. We group segments that "see" the same object; this defines the 3D visibility complex. The boundaries of these groups of segments correspond to the visual events of the scene (limits of shadows, disappearance of an object when the viewpoint is moved, etc.). We provide a worst case analysis of the complexity of the visibility complex of 3D scenes, as well as a probabilistic study under a simple assumption for "normal" scenes. We extend the visibility complex to handle temporal visibility. We give an output-sensitive construction algorithm and present applications of our approach

the 3d visibl complex
 visibl problem are central to mani comput graphic applic . the most common exampl includ hidden-part remov for view comput , shadow boundari , mutual visibl of object for light simul . in thi paper , we present a theoret studi of 3d visibl properti for scene of smooth convex object . we work in the space of light ray , or more precis , of maxim free segment . we group segment that " see " the same object ; thi defin the 3d visibl complex . the boundari of these group of segment correspond to the visual event of the scene ( limit of shadow , disappear of an object when the viewpoint is move , etc . ) . we provid a worst case analysi of the complex of the visibl complex of 3d scene , as well as a probabilist studi under a simpl assumpt for " normal " scene . we extend the visibl complex to handl tempor visibl . we give an output-sensit construct algorithm and present applic of our approach

3D visibility complex
computer graphics
hidden-part removal
view computation
shadow boundaries
lighting simulation
smooth convex objects
light rays
maximal free segments
visual events
probabilistic study
temporal visibility
output-sensitive construction algorithm
mutual object visibility
worst case complexity analysis
normal scenes


PKI: coming to an enterprise near you?

Abstract: For many years public key infrastructure (PKI) deployments were the provenance of governments and large, security-conscious corporations and financial institutions. These organizations have the financial and human resources necessary to successfully manage the complexities of a public key system. Lately however, several forces have converged to encourage a broader base of enterprises to take a closer look at PKI. These forces are discussed. PKI vendors are now demonstrating to customers how they can make essential business applications faster and more efficient by moving them to the Internet-without sacrificing security. Those applications usually include secure remote access, secure messaging, electronic document exchange, transaction validation, and network authentication. After a brief discussion of PKI basics the author reviews various products available on the market

pki : come to an enterpris near you ?
 for mani year public key infrastructur ( pki ) deploy were the proven of govern and larg , security-consci corpor and financi institut . these organ have the financi and human resourc necessari to success manag the complex of a public key system . late howev , sever forc have converg to encourag a broader base of enterpris to take a closer look at pki . these forc are discuss . pki vendor are now demonstr to custom how they can make essenti busi applic faster and more effici by move them to the internet-without sacrif secur . those applic usual includ secur remot access , secur messag , electron document exchang , transact valid , and network authent . after a brief discuss of pki basic the author review variou product avail on the market

PKI
public key infrastructure
security
PKI vendors
secure remote access
secure messaging
electronic document exchange
transaction validation
network authentication
business-critical applications
e-commerce
IPSec VPNs
Baltimore Technologies
Entrust
GeoTrust
RSA Security
VeriSign


Speaker adaptive modeling by vocal tract normalization

Abstract: This paper presents methods for speaker adaptive modeling using vocal tract normalization (VTN) along with experimental tests on three databases. We propose a new training method for VTN: By using single-density acoustic models per HMM state for selecting the scale factor of the frequency axis, we avoid the problem that a mixture-density tends to learn the scale factors of the training speakers and thus cannot be used for selecting the scale factor. We show that using single Gaussian densities for selecting the scale factor in training results in lower error rates than using mixture densities. For the recognition phase, we propose an improvement of the well-known two-pass strategy: by using a non-normalized acoustic model for the first recognition pass instead of a normalized model, lower error rates are obtained. In recognition tests, this method is compared with a fast variant of VTN. The two-pass strategy is an efficient method, but it is suboptimal because the scale factor and the word sequence are determined sequentially. We found that for telephone digit string recognition this suboptimality reduces the VTN gain in recognition performance by 30% relative. In summary, on the German spontaneous speech task Verbmobil, the WSJ task and the German telephone digit string corpus SieTill, the proposed methods for VTN reduce the error rates significantly

speaker adapt model by vocal tract normal
 thi paper present method for speaker adapt model use vocal tract normal ( vtn ) along with experiment test on three databas . we propos a new train method for vtn : by use single-dens acoust model per hmm state for select the scale factor of the frequenc axi , we avoid the problem that a mixture-dens tend to learn the scale factor of the train speaker and thu can not be use for select the scale factor . we show that use singl gaussian densiti for select the scale factor in train result in lower error rate than use mixtur densiti . for the recognit phase , we propos an improv of the well-known two-pass strategi : by use a non-norm acoust model for the first recognit pass instead of a normal model , lower error rate are obtain . in recognit test , thi method is compar with a fast variant of vtn . the two-pass strategi is an effici method , but it is suboptim becaus the scale factor and the word sequenc are determin sequenti . we found that for telephon digit string recognit thi suboptim reduc the vtn gain in recognit perform by 30 % rel . in summari , on the german spontan speech task verbmobil , the wsj task and the german telephon digit string corpu sietil , the propos method for vtn reduc the error rate significantli

speaker adaptive modeling
vocal tract normalization
databases
training method
single-density acoustic models
HMM state
training speakers
single Gaussian densities
training results
two-pass strategy
word sequence
telephone digit string recognition
German spontaneous speech task
WSJ task
German telephone digit string corpus
SieTill
frequency scale factor
error rate reduction
nonnormalized acoustic model
Verlimobil


Rank tests of association for exchangeable paired data

Abstract: We describe two rank tests of association for paired exchangeable data motivated by the study of lifespans in twins. The pooled sample is ranked. The nonparametric test of association is based on R/sup +/, the sum of the smaller within-pair ranks. A second measure L/sup +/ is the sum of within-pair rank products. Under the null hypothesis of within-pair independence, the two test statistics are approximately normally distributed. Expressions for the exact means and variances of R/sup +/ and L/sup +/ are given. We describe the power of these two statistics under a close alternative hypothesis to that of independence. Both the R/sup +/ and L/sup +/ tests indicate nonparametric statistical evidence of positive association of longevity in identical twins and a negligible relationship between the lifespans of fraternal twins listed in the Danish twin registry. The statistics are also applied to the analysis of a clinical trial studying the time to failure of ventilation tubes in children with bilateral otitis media

rank test of associ for exchang pair data
 we describ two rank test of associ for pair exchang data motiv by the studi of lifespan in twin . the pool sampl is rank . the nonparametr test of associ is base on r / sup + / , the sum of the smaller within-pair rank . a second measur l / sup + / is the sum of within-pair rank product . under the null hypothesi of within-pair independ , the two test statist are approxim normal distribut . express for the exact mean and varianc of r / sup + / and l / sup + / are given . we describ the power of these two statist under a close altern hypothesi to that of independ . both the r / sup + / and l / sup + / test indic nonparametr statist evid of posit associ of longev in ident twin and a neglig relationship between the lifespan of fratern twin list in the danish twin registri . the statist are also appli to the analysi of a clinic trial studi the time to failur of ventil tube in children with bilater otiti media

rank tests
association
paired exchangeable data
pooled sample
nonparametric test
within-pair ranks
within-pair rank products
null hypothesis
within-pair independence
test statistics
exact means
nonparametric statistical evidence
longevity
identical twins
fraternal twins
Danish twin registry
clinical trial
bilateral otitis media
twin lifespans
exact variances
ventilation tube failure time

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


National learning systems: a new approach on technological change in late industrializing economies and evidences from the cases of Brazil and South Korea

Abstract: The paper has two intertwined parts. The first one is a proposal for a conceptual and theoretical framework to understand technical change in late industrializing economies. The second part develops a kind of empirical test of the usefulness of that new framework by means of a comparative study of the Brazilian and South Korean cases. All the four types of macroevidences of the technical change processes of Brazil and Korea corroborate, directly or indirectly, the hypothesis of the existence of actual cases of national learning systems (NLSs) of passive and active nature, as it is shown to be the cases of Brazil and South Korea, respectively. The contrast between the two processes of technical change prove remarkable, despite both processes being essentially confined to learning. The concepts of passive and active NLSs show how useful they are to apprehend the diversity of those realities, and, consequently, to avoid, for instance, interpretations that misleadingly suppose (based on conventional economic theory) that those countries have a similar lack of technological dynamism

nation learn system : a new approach on technolog chang in late industri economi and evid from the case of brazil and south korea
 the paper ha two intertwin part . the first one is a propos for a conceptu and theoret framework to understand technic chang in late industri economi . the second part develop a kind of empir test of the use of that new framework by mean of a compar studi of the brazilian and south korean case . all the four type of macroevid of the technic chang process of brazil and korea corrobor , directli or indirectli , the hypothesi of the exist of actual case of nation learn system ( nlss ) of passiv and activ natur , as it is shown to be the case of brazil and south korea , respect . the contrast between the two process of technic chang prove remark , despit both process be essenti confin to learn . the concept of passiv and activ nlss show how use they are to apprehend the divers of those realiti , and , consequ , to avoid , for instanc , interpret that misleadingli suppos ( base on convent econom theori ) that those countri have a similar lack of technolog dynam

national learning systems
technological change
late industrializing economies
Brazil
South Korea
national innovation system


Optimization of element-by-element FEM in HPF 1.1

Abstract: In this study, Poisson's equation is numerically evaluated by the element-by-element (EBE) finite-element method in a parallel environment using HPF 1.1 (High-Performance Fortran). In order to achieve high parallel efficiency, the data structures have been altered to node-based data instead of mixtures of node- and element-based data, representing a node-based EBE finite-element scheme (nEBE). The parallel machine used in this study was the NEC SX-4, and experiments were performed on a single node having 32 processors sharing common memory. The HPF compiler used in the experiments is HPF/SX Rev 2.0 released in 1997 (unofficial), which supports HPF 1.1. Models containing approximately 200 000 and 1,500,000 degrees of freedom were analyzed in order to evaluate the method. The calculation time, parallel efficiency, and memory used were compared. The performance of HPF in the conjugate gradient solver for the large model, using the NEC SX-4 compiler option-noshrunk, was about 85% that of the message passing interface

optim of element-by-el fem in hpf 1.1
 in thi studi , poisson 's equat is numer evalu by the element-by-el ( ebe ) finite-el method in a parallel environ use hpf 1.1 ( high-perform fortran ) . in order to achiev high parallel effici , the data structur have been alter to node-bas data instead of mixtur of node- and element-bas data , repres a node-bas ebe finite-el scheme ( nebe ) . the parallel machin use in thi studi wa the nec sx-4 , and experi were perform on a singl node have 32 processor share common memori . the hpf compil use in the experi is hpf / sx rev 2.0 releas in 1997 ( unoffici ) , which support hpf 1.1 . model contain approxim 200 000 and 1,500,000 degre of freedom were analyz in order to evalu the method . the calcul time , parallel effici , and memori use were compar . the perform of hpf in the conjug gradient solver for the larg model , use the nec sx-4 compil option-noshrunk , wa about 85 % that of the messag pass interfac

element-by-element
HPF
HPF compiler
conjugate gradient solver
message passing
finite element method
parallel programs
Poisson equation


Dynamic neighborhood structures in parallel evolution strategies

Abstract: Parallelizing is a straightforward approach to reduce the total computation time of evolutionary algorithms. Finding an appropriate communication network within spatially structured populations for improving convergence speed and convergence probability is a difficult task. A new method that uses a dynamic communication scheme in an evolution strategy will be compared with conventional static and dynamic approaches. The communication structure is based on a so-called diffusion model approach. The links between adjacent individuals are dynamically chosen according to deterministic or probabilistic rules. Due to self-organization effects, efficient and stable communication structures are established that perform robustly and quickly on a multimodal test function

dynam neighborhood structur in parallel evolut strategi
 parallel is a straightforward approach to reduc the total comput time of evolutionari algorithm . find an appropri commun network within spatial structur popul for improv converg speed and converg probabl is a difficult task . a new method that use a dynam commun scheme in an evolut strategi will be compar with convent static and dynam approach . the commun structur is base on a so-cal diffus model approach . the link between adjac individu are dynam chosen accord to determinist or probabilist rule . due to self-organ effect , effici and stabl commun structur are establish that perform robustli and quickli on a multimod test function

parallelizing
evolutionary algorithms
convergence speed
convergence probability
multimodal test function
parallel evolutionary algorithms


Modeling and simulation of an ABR flow control algorithm using a virtual source/virtual destination switch

Abstract: The available bit rate (ABR) service class of asynchronous transfer mode networks uses a feedback control mechanism to adapt to varying link capacities. The virtual source/virtual destination (VS/VD) technique offers the possibility of segmenting the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and control of ABR traffic inside closed segments provide a better performance for ABR connections. This article presents the use of classical linear control theory to model and develop an ABR VS/VD flow control algorithm. Discrete event simulations are used to analyze the behavior of the algorithm with respect to transient behavior and correctness of the control model. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, such as stability of the system, during the design phase. The performance goals are high link utilization, fair bandwidth distribution, and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of analytic methods (linear control theory) to model and design an ABR flow control algorithm tailored for the special layout of a VS/VD switch, and the use of simulation techniques to verify the result

model and simul of an abr flow control algorithm use a virtual sourc / virtual destin switch
 the avail bit rate ( abr ) servic class of asynchron transfer mode network use a feedback control mechan to adapt to vari link capac . the virtual sourc / virtual destin ( vs / vd ) techniqu offer the possibl of segment the otherwis end-to-end abr control loop into separ loop . the improv feedback delay and control of abr traffic insid close segment provid a better perform for abr connect . thi articl present the use of classic linear control theori to model and develop an abr vs / vd flow control algorithm . discret event simul are use to analyz the behavior of the algorithm with respect to transient behavior and correct of the control model . linear control theori offer the mean to deriv correct choic of paramet and to assess perform issu , such as stabil of the system , dure the design phase . the perform goal are high link util , fair bandwidth distribut , and robust oper in variou environ , which are verifi by discret event simul . the major contribut of thi work is the use of analyt method ( linear control theori ) to model and design an abr flow control algorithm tailor for the special layout of a vs / vd switch , and the use of simul techniqu to verifi the result


A high-resolution high-frequency monolithic top-shooting microinjector free of satellite drops - part II: fabrication, implementation, and characterization

Abstract: For pt. I, see ibid., vol. 11, no. 5, p. 427-36 (2002). Describes the fabrication, implementation and characterization of a thermal driven microinjector, featuring a bubble check valve and monolithic fabrication. Microfabrication of this microinjector is based on bulk/surface-combined micromachining of the silicon wafer, free of the bonding process that is commonly used in the fabrication of commercial printing head, so that even solvents and fuels can be ejected. Droplet ejection sequences of two microinjectors have been studied along with a commercial inkjet printhead for comparison. The droplet ejection of our microinjector with 10 mu m diameter nozzle has been characterized at a frequency over 35 kHz, at least 3 times higher than those of commercial counterparts. The droplet volume from this device is smaller than 1 pl, 10 times smaller than those of commercial inkjets employed in the consumer market at the time of testing. Visualization results have verified that our design, although far from being optimized, operates in the frequency several times higher than those of commercial products and reduces the crosstalk among neighboring chambers

a high-resolut high-frequ monolith top-shoot microinjector free of satellit drop - part ii : fabric , implement , and character
 for pt . i , see ibid . , vol . 11 , no . 5 , p. 427 - 36 ( 2002 ) . describ the fabric , implement and character of a thermal driven microinjector , featur a bubbl check valv and monolith fabric . microfabr of thi microinjector is base on bulk / surface-combin micromachin of the silicon wafer , free of the bond process that is commonli use in the fabric of commerci print head , so that even solvent and fuel can be eject . droplet eject sequenc of two microinjector have been studi along with a commerci inkjet printhead for comparison . the droplet eject of our microinjector with 10 mu m diamet nozzl ha been character at a frequenc over 35 khz , at least 3 time higher than those of commerci counterpart . the droplet volum from thi devic is smaller than 1 pl , 10 time smaller than those of commerci inkjet employ in the consum market at the time of test . visual result have verifi that our design , although far from be optim , oper in the frequenc sever time higher than those of commerci product and reduc the crosstalk among neighbor chamber

monolithic top-shooting microinjector
satellite drops
thermal driven microinjector
bubble check valve
bulk/surface-combined micromachining
bonding process
inkjet printhead
nozzle
35 kHz
droplet volume
consumer market
crosstalk
10 micron


Approximation theory of fuzzy systems based upon genuine many-valued implications - MIMO cases

Abstract: It is constructively proved that the multi-input-multi-output fuzzy systems based upon genuine many-valued implications are universal approximators (they are called Boolean type fuzzy systems in this paper). The general approach to construct such fuzzy systems is given, that is, through the partition of the output region (by the given accuracy). Two examples are provided to demonstrate the way in which fuzzy systems are designed to approximate given functions with a given required approximation accuracy

approxim theori of fuzzi system base upon genuin many-valu implic - mimo case
 it is construct prove that the multi-input-multi-output fuzzi system base upon genuin many-valu implic are univers approxim ( they are call boolean type fuzzi system in thi paper ) . the gener approach to construct such fuzzi system is given , that is , through the partit of the output region ( by the given accuraci ) . two exampl are provid to demonstr the way in which fuzzi system are design to approxim given function with a given requir approxim accuraci

fuzzy systems
many-valued implication
multi-input-multi-output fuzzy systems
universal approximator
Boolean type fuzzy systems


Entanglement measures with asymptotic weak-monotonicity as lower (upper) bound for the entanglement of cost (distillation)

Abstract: We propose entanglement measures with asymptotic weak-monotonicity. We show that a normalized form of entanglement measures with the asymptotic weak-monotonicity are lower (upper) bound for the entanglement of cost (distillation)

entangl measur with asymptot weak-monoton as lower ( upper ) bound for the entangl of cost ( distil )
 we propos entangl measur with asymptot weak-monoton . we show that a normal form of entangl measur with the asymptot weak-monoton are lower ( upper ) bound for the entangl of cost ( distil )

entanglement measures
asymptotic weak-monotonicity
entanglement of cost
distillation


Greenberger-Horne-Zeilinger paradoxes for many qubits

Abstract: We construct Greenberger-Horne-Zeilinger (GHZ) contradictions for three or more parties sharing an entangled state, the dimension of each subsystem being an even integer d. The simplest example that goes beyond the standard GHZ paradox (three qubits) involves five ququats (d = 4). We then examine the criteria that a GHZ paradox must satisfy in order to be genuinely M partite and d dimensional

greenberger-horne-zeiling paradox for mani qubit
 we construct greenberger-horne-zeiling ( ghz ) contradict for three or more parti share an entangl state , the dimens of each subsystem be an even integ d. the simplest exampl that goe beyond the standard ghz paradox ( three qubit ) involv five ququat ( d = 4 ) . we then examin the criteria that a ghz paradox must satisfi in order to be genuin m partit and d dimension

Greenberger-Horne-Zeilinger paradoxes
many qubits
entangled state
GHZ paradox
GHZ contradictions


Development and evaluation of a case-based reasoning classifier for prediction of breast biopsy outcome with BI-RADS/sup TM/ lexicon

Abstract: Approximately 70-85% of breast biopsies are performed on benign lesions. To reduce this high number of biopsies performed on benign lesions, a case-based reasoning (CBR) classifier was developed to predict biopsy results from BI-RADS/sup TM/ findings. We used 1433 (931 benign) biopsy-proven mammographic cases. CBR similarity was defined using either the Hamming or Euclidean distance measure over case features. Ten features represented each case: calcification distribution, calcification morphology, calcification number, mass margin, mass shape, mass density, mass size, associated findings, special cases, and age. Performance was evaluated using Round Robin sampling, Receiver Operating Characteristic (ROC) analysis, and bootstrap. To determine the most influential features for the CBR, an exhaustive feature search was performed over all possible feature combinations (1022) and similarity thresholds. Influential features were defined as the most frequently occurring features in the feature subsets with the highest partial ROC areas (/sub 0.90/AUC). For CBR with Hamming distance, the most influential features were found to be mass margin, calcification morphology, age, calcification distribution, calcification number, and mass shape, resulting in an /sub 0.90/AUC of 0.33. At 95% sensitivity, the Hamming CBR would spare from biopsy 34% of the benign lesions. At 98% sensitivity, the Hamming CBR would spare 27% benign lesions. For the CBR with Euclidean distance, the most influential feature subset consisted of mass margin, calcification morphology, age, mass density, and associated findings, resulting in /sub 0.90/AUC of 0.37. At 95% sensitivity, the Euclidean CBR would spare from biopsy 41% benign lesions. At 98% sensitivity, the Euclidean CBR would spare 27% benign lesions. The profile of cases spared by both distance measures at 98% sensitivity indicates that the CBR is a potentially useful diagnostic tool for the classification of mammographic lesions, by recommending short-term follow-up for likely benign lesions that is in agreement with final biopsy results and mammographer's intuition

develop and evalu of a case-bas reason classifi for predict of breast biopsi outcom with bi-rad / sup tm/ lexicon
 approxim 70 - 85 % of breast biopsi are perform on benign lesion . to reduc thi high number of biopsi perform on benign lesion , a case-bas reason ( cbr ) classifi wa develop to predict biopsi result from bi-rad / sup tm/ find . we use 1433 ( 931 benign ) biopsy-proven mammograph case . cbr similar wa defin use either the ham or euclidean distanc measur over case featur . ten featur repres each case : calcif distribut , calcif morpholog , calcif number , mass margin , mass shape , mass densiti , mass size , associ find , special case , and age . perform wa evalu use round robin sampl , receiv oper characterist ( roc ) analysi , and bootstrap . to determin the most influenti featur for the cbr , an exhaust featur search wa perform over all possibl featur combin ( 1022 ) and similar threshold . influenti featur were defin as the most frequent occur featur in the featur subset with the highest partial roc area ( /sub 0.90 / auc ) . for cbr with ham distanc , the most influenti featur were found to be mass margin , calcif morpholog , age , calcif distribut , calcif number , and mass shape , result in an /sub 0.90 / auc of 0.33 . at 95 % sensit , the ham cbr would spare from biopsi 34 % of the benign lesion . at 98 % sensit , the ham cbr would spare 27 % benign lesion . for the cbr with euclidean distanc , the most influenti featur subset consist of mass margin , calcif morpholog , age , mass densiti , and associ find , result in /sub 0.90 / auc of 0.37 . at 95 % sensit , the euclidean cbr would spare from biopsi 41 % benign lesion . at 98 % sensit , the euclidean cbr would spare 27 % benign lesion . the profil of case spare by both distanc measur at 98 % sensit indic that the cbr is a potenti use diagnost tool for the classif of mammograph lesion , by recommend short-term follow-up for like benign lesion that is in agreement with final biopsi result and mammograph 's intuit

Receiver Operating Characteristic analysis

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


Products and polymorphic subtypes

Abstract: This paper is devoted to a comprehensive study of polymorphic subtypes with products. We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of to , * type constructors and the For all quantifier, and we show that such axiornatization is not encodable in the system with to , For all only. In order to give a logical semantics to such a subtyping relation, we propose a new form of a sequent which plays a key role in a natural deduction and a Gentzen style calculi. Interestingly enough, the sequent must have the form E implies T, where E is a non-commutative, non-empty sequence of typing assumptions and T is a finite binary tree of typing judgements, each of them behaving like a pushdown store. We study basic metamathematical properties of the two logical systems, such as subject reduction and cut elimination. Some decidability/undecidability issues related to the presented subtyping relation are also explored: as expected, the subtyping over to , *, For all is undecidable, being already undecidable for the to , For all fragment (as proved in [15]), but for the *, For all fragment it turns out to be decidable

product and polymorph subtyp
 thi paper is devot to a comprehens studi of polymorph subtyp with product . we first present a sound and complet hilbert style axiomat of the relat of be a subtyp in presenc of to , * type constructor and the for all quantifi , and we show that such axiornat is not encod in the system with to , for all onli . in order to give a logic semant to such a subtyp relat , we propos a new form of a sequent which play a key role in a natur deduct and a gentzen style calculi . interestingli enough , the sequent must have the form e impli t , where e is a non-commut , non-empti sequenc of type assumpt and t is a finit binari tree of type judgement , each of them behav like a pushdown store . we studi basic metamathemat properti of the two logic system , such as subject reduct and cut elimin . some decid / undecid issu relat to the present subtyp relat are also explor : as expect , the subtyp over to , * , for all is undecid , be alreadi undecid for the to , for all fragment ( as prove in [ 15 ] ) , but for the * , for all fragment it turn out to be decid

polymorphic subtypes
Hilbert style axiomatization
logical semantics
Gentzen style calculi
finite binary tree
pushdown store
decidability
products subtypes
metamathernatical properties


Robust Kalman filter design for discrete time-delay systems

Abstract: The problem of finite- and infinite-horizon robust Kalman filtering for uncertain discrete-time systems with state delay is addressed. The system under consideration is subject to time-varying norm-bounded parameter uncertainty in both the state and output matrices. We develop a new methodology for designing a linear filter such that the error variance of the filter is guaranteed to be within a certain upper bound for any allowed uncertainty and time delay. The solution is given in terms of two Riccati equations. Multiple time-delay systems are also investigated

robust kalman filter design for discret time-delay system
 the problem of finite- and infinite-horizon robust kalman filter for uncertain discrete-tim system with state delay is address . the system under consider is subject to time-vari norm-bound paramet uncertainti in both the state and output matric . we develop a new methodolog for design a linear filter such that the error varianc of the filter is guarante to be within a certain upper bound for ani allow uncertainti and time delay . the solut is given in term of two riccati equat . multipl time-delay system are also investig

robust Kalman filter
discrete time-delay systems
state delay
norm-bounded parameter uncertainty
output matrices
linear filter
Riccati equations
uncertain systems
time-varying parameter uncertainty
state matrices
robust state estimation


Developing a hardware and programming curriculum for middle school girls

Abstract: Techbridge provides experiences and resources that would teach girls technology skills as well as excite their curiosity and build their confidence. Funded by the National Science Foundation and sponsored by Chabot Space and Science Center in Oakland, California, Techbridge is a three-year program that serves approximately 200 girls annually. Techbridge is hosted at 8 middle and high schools in Oakland and at the California School for the Blind in Fremont, California generally as an after-school program meeting once a week. Techbridge comes at a critical time in girls' development when girls have many important decisions to make regarding classes and careers, but often lack the confidence and guidance to make the best choices. Techbridge helps girls plan for the next steps to high school and college with its role models and guidance. Techbridge also provides training and resources for teachers, counselors, and families

develop a hardwar and program curriculum for middl school girl
 techbridg provid experi and resourc that would teach girl technolog skill as well as excit their curios and build their confid . fund by the nation scienc foundat and sponsor by chabot space and scienc center in oakland , california , techbridg is a three-year program that serv approxim 200 girl annual . techbridg is host at 8 middl and high school in oakland and at the california school for the blind in fremont , california gener as an after-school program meet onc a week . techbridg come at a critic time in girl ' develop when girl have mani import decis to make regard class and career , but often lack the confid and guidanc to make the best choic . techbridg help girl plan for the next step to high school and colleg with it role model and guidanc . techbridg also provid train and resourc for teacher , counselor , and famili

hardware and programming curriculum
middle school girls
Techbridge
technology skills teaching


Process planning for reliable high-speed machining of moulds

Abstract: A method of generating NC programs for the high-speed milling of moulds is investigated. Forging dies and injection moulds, whether plastic or aluminium, have a complex surface geometry. In addition they are made of steels of hardness as much as 30 or even 50 HRC. Since 1995, high-speed machining has been much adopted by the die-making industry, which with this technology can reduce its use of Sinking Electrodischarge Machining (SEDM). EDM, in general, calls for longer machining times. The use of high-speed machining makes it necessary to redefine the preliminary stages of the process. In addition, it affects the methodology employed in the generation of NC programs, which requires the use of high-level CAM software. The aim is to generate error-free programs that make use of optimum cutting strategies in the interest of productivity and surface quality. The final result is a more reliable manufacturing process. There are two risks in the use of high-speed milling on hardened steels. One of these is tool breakage, which may be very costly and may furthermore entail marks on the workpiece. The other is collisions between the tool and the workpiece or fixtures, the result of which may be damage to the ceramic bearings in the spindles. in order to minimize these risks it is necessary that new control and optimization steps be included in the CAM methodology. There are three things that the firm adopting high-speed methods should do. It should redefine its process engineering, it should systematize access by its CAM programmers to high-speed knowhow, and it should take up the use of process simulation tools. In the latter case, it will be very advantageous to use tools for the estimation of cutting forces. The new work methods proposed in this article have made it possible to introduce high speed milling (HSM) into the die industry. Examples are given of how the technique has been applied with CAM programming re-engineered as here proposed, with an explanation of the novel features and the results

process plan for reliabl high-spe machin of mould
 a method of gener nc program for the high-spe mill of mould is investig . forg die and inject mould , whether plastic or aluminium , have a complex surfac geometri . in addit they are made of steel of hard as much as 30 or even 50 hrc . sinc 1995 , high-spe machin ha been much adopt by the die-mak industri , which with thi technolog can reduc it use of sink electrodischarg machin ( sedm ) . edm , in gener , call for longer machin time . the use of high-spe machin make it necessari to redefin the preliminari stage of the process . in addit , it affect the methodolog employ in the gener of nc program , which requir the use of high-level cam softwar . the aim is to gener error-fre program that make use of optimum cut strategi in the interest of product and surfac qualiti . the final result is a more reliabl manufactur process . there are two risk in the use of high-spe mill on harden steel . one of these is tool breakag , which may be veri costli and may furthermor entail mark on the workpiec . the other is collis between the tool and the workpiec or fixtur , the result of which may be damag to the ceram bear in the spindl . in order to minim these risk it is necessari that new control and optim step be includ in the cam methodolog . there are three thing that the firm adopt high-spe method should do . it should redefin it process engin , it should systemat access by it cam programm to high-spe knowhow , and it should take up the use of process simul tool . in the latter case , it will be veri advantag to use tool for the estim of cut forc . the new work method propos in thi articl have made it possibl to introduc high speed mill ( hsm ) into the die industri . exampl are given of how the techniqu ha been appli with cam program re-engin as here propos , with an explan of the novel featur and the result

process planning
reliable high-speed machining
moulds
NC programs
high-speed milling
forging dies
injection moulds
complex surface geometry
error-free programs
optimum cutting strategies
cutting strategies
productivity
surface quality
hardened steels
tool breakage
ceramic bearings
CAM methodology
process simulation tools
CAM programming re-engineering
tool workpiece collisions
process engineering redefinition

P P P P P P P P P P P P P P P P P P P R M


What's in a name? [mobile telephony branding]

Abstract: Mobile operators are frantically consolidating businesses into single international brands

what 's in a name ? [ mobil telephoni brand ]
 mobil oper are frantic consolid busi into singl intern brand

mobile telephony
branding
consolidating businesses


Meshed atlases for real-time procedural solid texturing

Abstract: We describe an implementation of procedural solid texturing that uses the texture atlas, a one-to-one mapping from an object's surface into its texture space. The method uses the graphics hardware to rasterize the solid texture coordinates as colors directly into the atlas. A texturing procedure is applied per-pixel to the texture map, replacing each solid texture coordinate with its corresponding procedural solid texture result. The procedural solid texture is then mapped back onto the object surface using standard texture mapping. The implementation renders procedural solid textures in real time, and the user can design them interactively. The quality of this technique depends greatly on the layout of the texture atlas. A broad survey of texture atlas schemes is used to develop a set of general purpose mesh atlases and tools for measuring their effectiveness at distributing as many available texture samples as evenly across the surface as possible. The main contribution of this paper is a new multiresolution texture atlas. It distributes all available texture samples in a nearly uniform distribution. This multiresolution texture atlas also supports MIP-mapped minification antialiasing and linear magnification filtering

mesh atlas for real-tim procedur solid textur
 we describ an implement of procedur solid textur that use the textur atla , a one-to-on map from an object 's surfac into it textur space . the method use the graphic hardwar to raster the solid textur coordin as color directli into the atla . a textur procedur is appli per-pixel to the textur map , replac each solid textur coordin with it correspond procedur solid textur result . the procedur solid textur is then map back onto the object surfac use standard textur map . the implement render procedur solid textur in real time , and the user can design them interact . the qualiti of thi techniqu depend greatli on the layout of the textur atla . a broad survey of textur atla scheme is use to develop a set of gener purpos mesh atlas and tool for measur their effect at distribut as mani avail textur sampl as evenli across the surfac as possibl . the main contribut of thi paper is a new multiresolut textur atla . it distribut all avail textur sampl in a nearli uniform distribut . thi multiresolut textur atla also support mip-map minif antialias and linear magnif filter

meshed atlases
real-time procedural solid texturing
texture atlas
one-to-one mapping
texture space
graphics hardware
rasterization
solid texture coordinates
colors
object surface
rendering
multiresolution texture atlas
MIP-mapped minification antialiasing
linear magnification filtering


Use of SPOT images as a tool for coastal zone management and monitoring of environmental impacts in the coastal zone

Abstract: Modern techniques such as remote sensing have been one of the main factors leading toward the achievement of serious plans regarding coastal management. A multitemporal analysis of land use in certain areas of the Colombian Caribbean Coast is described. It mainly focuses on environmental impacts caused by anthropogenic activities, such as deforestation of mangroves due to shrimp farming. Selection of sensitive areas, percentage of destroyed mangroves, possible endangered areas, etc., are some of the results of this analysis. Recommendations for a coastal management plan in the area have also resulted from this analysis. Some other consequences of the deforestation of mangroves in the coastal zone and the construction of shrimp ponds are also analyzed, such as the increase of erosion problems in these areas and water pollution, among others. The increase of erosion in these areas has also changed part of their morphology, which has been studied by the analysis of SPOT images in previous years. A serious concern exists about the future of these areas. For this reason new techniques like satellite images (SPOT) have been applied with good results, leading to more effective control and coastal management in the area. The use of SPOT images to study changes of the land use of the area is a useful technique to determine patterns of human activities and suggest solutions for severe problems in these areas

use of spot imag as a tool for coastal zone manag and monitor of environment impact in the coastal zone
 modern techniqu such as remot sens have been one of the main factor lead toward the achiev of seriou plan regard coastal manag . a multitempor analysi of land use in certain area of the colombian caribbean coast is describ . it mainli focus on environment impact caus by anthropogen activ , such as deforest of mangrov due to shrimp farm . select of sensit area , percentag of destroy mangrov , possibl endang area , etc . , are some of the result of thi analysi . recommend for a coastal manag plan in the area have also result from thi analysi . some other consequ of the deforest of mangrov in the coastal zone and the construct of shrimp pond are also analyz , such as the increas of eros problem in these area and water pollut , among other . the increas of eros in these area ha also chang part of their morpholog , which ha been studi by the analysi of spot imag in previou year . a seriou concern exist about the futur of these area . for thi reason new techniqu like satellit imag ( spot ) have been appli with good result , lead to more effect control and coastal manag in the area . the use of spot imag to studi chang of the land use of the area is a use techniqu to determin pattern of human activ and suggest solut for sever problem in these area

SPOT images
coastal zone management
remote sensing
multitemporal analysis
land use
Colombian Caribbean Coast
anthropogenic activities
shrimp farming
endangered areas
shrimp ponds
erosion problems
water pollution
satellite images
human activities
environmental impact monitoring
mangrove deforestation
supervised classification
sedimentation
vectorization
vector overlay


Operations that do not disturb partially known quantum states

Abstract: Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states. We present a principle that gives a definite distinction between the operations that preserve the states of the system and those that disturb the states. The principle is derived by alternately applying a fundamental property of classical signals and a fundamental property of quantum ones. The principle can be cast into a simple form by using a decomposition of the relevant Hilbert space, which is uniquely determined by the set of possible states. The decomposition implies the classification of the degrees of freedom of the system into three parts depending on how they store the information on the initially chosen state: one storing it classically, one storing it nonclassically, and the other one storing no information. Then the principle states that the nonclassical part is inaccessible and the classical part is read-only if we are to preserve the state of the system. From this principle, many types of no-cloning, no-broadcasting, and no-imprinting conditions can easily be derived in general forms including mixed states. It also gives a unified view on how various schemes of quantum cryptography work. The principle helps one to derive optimum amount of resources (bits, qubits, and ebits) required in data compression or in quantum teleportation of mixed-state ensembles

oper that do not disturb partial known quantum state
 consid a situat in which a quantum system is secretli prepar in a state chosen from the known set of state . we present a principl that give a definit distinct between the oper that preserv the state of the system and those that disturb the state . the principl is deriv by altern appli a fundament properti of classic signal and a fundament properti of quantum one . the principl can be cast into a simpl form by use a decomposit of the relev hilbert space , which is uniqu determin by the set of possibl state . the decomposit impli the classif of the degre of freedom of the system into three part depend on how they store the inform on the initi chosen state : one store it classic , one store it nonclass , and the other one store no inform . then the principl state that the nonclass part is inaccess and the classic part is read-onli if we are to preserv the state of the system . from thi principl , mani type of no-clon , no-broadcast , and no-imprint condit can easili be deriv in gener form includ mix state . it also give a unifi view on how variou scheme of quantum cryptographi work . the principl help one to deriv optimum amount of resourc ( bit , qubit , and ebit ) requir in data compress or in quantum teleport of mixed-st ensembl

partially known quantum states
quantum system
classical signals
Hilbert space
degrees of freedom
nonclassical part
quantum cryptography
bits
qubits
ebits
quantum teleportation
mixed-state ensembles
secretly prepared quantum state


Completeness of timed mu CRL

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

complet of time mu crl
 previous a straightforward extens of the process algebra mu crl wa propos to explicitli deal with time . the process algebra mu crl ha been especi design to deal with data in a process algebra context . use the featur for data , onli a minor extens of the languag wa need to obtain a veri express variant of time . previous it contain syntax , oper semant and axiom characteris time mu crl . it did not contain an in depth analysi of theori of time mu crl . thi paper fill thi gap , by provid sound and complet result . the main tool to establish these is a map of time to untim mu crl and employ the complet result obtain for untim mu crl

completeness
timed mu CRL
process algebra
operational semantics