CALL FOR PAPERS Workshop on Intelligence and Security Informatics (WISI’06) in conjunction with the Pacific Asia Conference on Knowledge Discovery and Data Mining (PAKDD’06)

ImportantDates●Submissiondue●Notificationofacceptance●Camera readycopydueNovember15,2005December30,2005January10,2006WorkshopScope IntelligenceandSecurityInformatics(ISI)canbebroadlydefinedasthestudyofthedevelopmentanduseof advancedinformationtechnologiesandsystemsfornationalandinternationalsecurity relatedapplications.TheFirst andSecondSymposiumsonISIwereheldinTucson,Arizona,in2003and2004,respectively.In2005,theIEEEInter nationalConferenceonISIwasheldinAtlanta,Georgia.TheseIS…     

A PRIORI L~2 ERROR ESTIMATES FOR GALERKIN METHODS FOR NONLINEAR SOBOLEV EQUATIONS

In this paper we study Galerkin approximations to the solution of the nonlinearSobolev equation c(u)u_t=▽·{a(u)▽u_t+b(u)▽u}+f(u)in two spatial dimensions and deriveoptimal L~2 error estimates for the continuous-time,Crank-Nicolson and extrapolated Crank-Nicolson discrete-time approximations.     

2nd Beijing International Conference on System Simulation and Scientific Computing

DATEOctober,1992VENUEBeijingThe People’s Republic of ChinaSPONSORChinese Association for System SimulationCO—SPONSORS—Federation of European Simulation Societies(EUROSIM)一International Association for Mathematics and Computers in Simulation(IMACS)—Japan Society for Simulation Technology(JSST)—Society for Computer Simulation International(SCSI)     

METHODS FOR IMPROVING APPROXIMATE ACCURACY FOR HYPERBOLIC INTEGRODIFFERENTIAL EQUATIONS

1.IntroductionIn[1],wedealtwiththeglobalextrapolationandcorrectionmethodsfortheparabolicintegrodifferelltialequationandobtainedtheapproximatesolutionsofthirdorder.Nowwepayourattentiontothefollowinghyperbolicintegrodifferentialequationwherefiisarectangular…     

A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS

A method using quantifier-elimination is proposed for automatically generating programinvariants/inductive assertions.Given a program,inductive assertions,hypothesized as parameterizedformulas in a theory,are associated with program locations.Parameters in inductive assertions arediscovered by generating constraints on parameters by ensuring that an inductive assertion is indeedpreserved by all execution paths leading to the associated location of the program.The method can beused to discover loop invariants-properties of variables that remain invariant at the entry of a loop.Theparameterized formula can be successively refined by considering execution paths one by one;heuristicscan be developed for determining the order in which the paths are considered.Initialization of programvariables as well as the precondition and postcondition,if available,can also be used to further refinethe hypothesized invariant.The method does not depend on the availability of the precondition andpostcondition of a program.Constraints on parameters generated in this way are solved for possiblevalues of parameters.If no solution is possible,this means that an invariant of the hypothesizedform is not likely to exist for the loop under the assumptions/approximations made to generate theassociated verification condition.Otherwise,if the parametric constraints are solvable,then undercertain conditions on methods for generating these constraints,the strongest possible invariant of thehypothesized form can be generated from most general solutions of the parametric constraints.Theapproach is illustrated using the logical languages of conjunction of polynomial equations as well asPresburger arithmetic for expressing assertions.     

BOOTSTRAPPING PP L-STATISTICS FOR TESTS

Some bootstrap approximations of the asymptotic distributions of PP L-statistics whichwere proposed by the authors in[7]are discusse.Bootstrap statistics and their asymptotic propertiesare established.Two examples and the numerical results are given,by which one can actuallyimplement the proposed tests under the condition of normal population.     

IMPROVEMENT FOR FERRO''''S MINIMAX THEOREM

ＩＭＰＲＯＶＥＭＥＮＴＦＯＲＦＥＲＲＯ＇ＳＭＩＮＩＭＡＸＴＨＥＯＲＥＭ￥ＣＨＥＮＧｕａｎｇｙａ（ＩｎｓｔｉｔｕｔｅｏｆＳｙｓｔｅｍｓＳｃｉｅｎｃｅ，ＡｃａｄｅｍｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ１０００８０，Ｃｈｉｎａ）Ａｂｓｔｒａｃｔ：Ｔｈｉｓｎｏｔ...     

CLOSURE AXIOMS FOR POSET MATROIDS

An excellent introduction to the topic of poset matroids is due to M. Barnabei, G. Nicoletti and L. Pezzoli. In this paper, we extensively study the closure operators of poset matroids and obtain the closure axioms for poset matroids; thereby we can characterize poset matroids in terms of the closure axioms. Some corresponding properties of combinatorial schemes are also obtained.     

GALERKIN ALTERNATING-DIRECTION METHODS FOR NONRECTANGULAR REGIONS FOR THE TRANSIENT BEHAVIOR OF A SEMICONDUCTOR DEVICE

For the transient behavior of a semiconductor device, the modified method of characteristics with alternating-direction finite element procedures for nonrectangular region is put forward. Some techniques, such as calculus of variations, isoparametric transformation, patch approximation, operator-splitting, characteristic method, symmetrical reflection, energy method, negative norm estimate and a prior estimates and techniques, are employed. In the nonrectangular region case, optimal order estimates in L2 norm are derived for the error in the approximation solution. Thus the well-known theoretical problem has been thoroughly and completely solved.     

AN EMBEDDING OPERATOR FOR FUZZY NUMBER SPACE E~1 AND ITS APPLICATION FOR FUZZY INTEGRAL

In this paper,we give an order-preserving,isometric and isomorphic embeddingoperator from the fuzzy number space E~1 to a classical Banach space and show some necessary andsufficient integrability conditions of fuzzy integrals which were defined by M.Matloka and O.Kaleva by means of such an operator.     

OPTIMAL REPLACEMENT FOR DISCRETE SHOCK MODELS

A device is subject to damage. The damage occurs randomly in discrete timeaccording to an increasing homogeneous Markov chain, where the incremental damagecaused by a shock depends on the magnitude of the shock. The device has a threshold,and it fails once the damage level exceeds the threshold. Upon failure the device is replacedby a new and identical one and a cost is incurred. If the device is replaced before failure,a smaller cost is incurred. In this paper we study the problem of specifying a replacementrule which minimizes the long-run (expected) average cost per unit time. Under mildconditions we show that the optimal replacement policy exists and it possesses the controllimit property.     

STRONG CONVERGENCE THEOREMS FOR NONEXPANSIVE MAPPING

This paper introduces a composite iteration scheme for approximating a fixed point of nonexpansive mappings in the framework of uniformly smooth Banach spaces and the reflexive Banach spaces which have a weakly continuous duality map, respectively, we establish the strong convergence of the composite iteration scheme. The results improve and extend those of Kim, Xu, Wittmann and some others.     

SIGN-REVERSAL PROPERTY FOR F-MATRICES AND N-MATRICES

ＳＩＧＮ－ＲＥＶＥＲＳＡＬＰＲＯＰＥＲＴＹＦＯＲＦ－ＭＡＴＲＩＣＥＳＡＮＤＮ－ＭＡＴＲＩＣＥＳＸＵＳｏｎｇ（ＧｒａｄｕａｔｅＳｃｈｏｏｌ，ＣｈｉｎａＡｃａｄｅｍｙｏｆＲａｉｌｗａｙＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８１，Ｃｈｉｎａ）Ａｂｓｔｒａ...     

ROW-ACTION METHODS FOR CONVEX QUADRATIC PROGRAMMING

ＲＯＷ－ＡＣＴＩＯＮＭＥＴＨＯＤＳＦＯＲＣＯＮＶＥＸＱＵＡＤＲＡＴＩＣＰＲＯＧＲＡＭＭＩＮＧＧＵＯＴｉａｎｄｅ（ＭａｔｈｅｍａｔｉｃｓＤｅｐａｒｔｍｅｎｔｏｆＱｕｆｕＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｑｕｆｕ，Ｓｈａｎｄｏｎｇ２７３１６５，Ｃｈｉｎａ...     

STRONG APPROXIMATION FOR PERTURBED EMPIRICAL PROCESSES

ＳＴＲＯＮＧＡＰＰＲＯＸＩＭＡＴＩＯＮＦＯＲＰＥＲＴＵＲＢＥＤＥＭＰＩＲＩＣＡＬＰＲＯＣＥＳＳＥＳ￥ＺＨＯＵＹｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｏｂａｂｉｌｉｔｙａｎｄＳｔａｔｉｓｔｉｃｓ，ＰｅｋｉｎｇＵｎｉｖｅｒｓｉｔｙ，Ｂｅｉｊｉｎｇ１００８７...     

SOLUTION CLASSIFICATION FOR THE NONPERSPECTIVE-THREE-POINT PROBLEM

In the PnP problem,the imaging devices follow the perspective rule and the imaging rays pass through a common point. However,there are many new imaging devices being developed for robot navigation or other fields with the advance in imaging technologies for machine vision. These devise are not necessarily being designed to follow the perspective rule in order to satisfy some design criterion and,thus, the imaging rays may not pass through a common point.Such generalized imaging devices may not be perspective and, therefore, their poses cannot be estimated with traditional perspective technique.Using the Wu-Ritt＇s zero decomposition method,the main component for the nonperspective-three-point problem is given. We prove that there are at most eight solutions in the general case and give the solution classification for the NP3P problem.     

OPTIMAL IMPULSIVE HARVESTING FOR FISH POPULATIONS

In this paper the management model a two-species fishery involving impulses is investigated by using optimal impulsive control theorem. Optimal impulsive harrowing times and the corresponding optimal harvesting population levels in different cases are obtained.     

A FRAMEWORK FOR REAL-VALUED CIPHER SYSTEMS

Most cipher systems designed thus far are binary-valued or integer-valued cipher systems. Their security relies on the assumption that one-way functions exist. Though the existence of one-way functions has not been proved yet, most cryptographic researchers believe that one-way functions exist. In addition, many candidates for one-way functions have been proposed. Therefore, the key step for developing real-valued cipher systems is to define real one-way functions and to propose candidates for them. In this paper, based on computational complexity theory over the real field, we give two definitions of real one-way functions; one is for digital one-way functions and the other is for general one-way functions. Candidates for these two classes of one-way functions are also proposed. Moreover, we present two examples to demonstrate that the candidates for both digital one-way functions and general one-way functions can be applied to construct secure real-valued cipher systems.     

A DOMINANCE APPROACH FOR PLANE PARTITIONS

By developing the dominance technique of nondecreasing integer sequences into a multifoldform,we introduce a new approach for the enumeration of plane partitions,which can be used togenerate most of classical theorems in this field.The treatment presented here may be more accessibleto readers than the earlier methods of algebra,analysis and algorithm.