Method and device for authentication

The present invention allows even small-size verificationdevices to authenticate rights and qualifications without leakingauthentication characteristic information to third parties A ticketissuance device computes document private information mufrom a private function f of an interaction device owned by auser and document m to be transferred to the interaction device when generating interaction,and issues ticket t generated fromauthentication characteristic information x and the documentprivate information .mu. to the user.The interaction device,when document m is input,generates document private infor-mation mu using a private function f specific to the interactiondevice,and performs interaction based on the document privateinformation.The interaction comprises output of commitment r.input of challenge chi,output of response .sigma.,andmessage M output.The user converts interaction(r, .chi.,M,.sigma.)into interaction(r,.chi.,M,s)using ticket t toperform Guillou-Quisquater authentication.     

Model and procedure for performance and availability-wise parallel warehouses

Consider data warehouses as large data repositories queried for analysis and data mining in a variety of application contexts. A query over such data may take a large amount of time to be processed in a regular PC. Consider partitioning the data into a set of PCs (nodes), with either a parallel database server or any database server at each node and an engine-independent middleware. Nodes and network may even not be fully dedicated to the data warehouse. In such a scenario, care must be taken for handling processing heterogeneity and availability, so we study and propose efficient solutions for this. We concentrate on three main contributions: a performance-wise index, measuring relative performance; a replication-degree; a flexible chunk-wise organization with on-demand processing. These contributions extend the previous work on de-clustering and replication and are generic in the sense that they can be applied in very different contexts and with different data partitioning approaches. We evaluate their merits with a prototype implementation of the system.     

Design for manufacture and design for ‘X’: concepts,applications, and perspectives

The implementations of design for assembly and design for manufacture (DFM) led to enormous benefits including simplification of products, reduction of assembly and manufacturing costs, improvement of quality, and reduction of time to market. More recently, environmental concerns required that disassembly and recycling issues should be considered during the design stages. The effort to reduce total life-cycle costs for a product through design innovation is becoming an essential part of the current manufacturing industry. Therefore, researchers begin to focus their attention on design for environment, design for recyclability, design for life-cycle (DFLC), etc. These studies are sometimes referred to as Design for X (DFX). Since the late 1990s, hundreds of papers have been published pertaining to DFX applications in manufacturing. Most of them are widely distributed over many different disciplines and publications. This makes it very difficult for one to locate all the information necessary for the application of DFX in manufacturing. A paper that can help researchers and practitioners applying this emerging technology is highly desirable. The objective of this paper is to present the concepts, applications, and perspectives of ‘DFX’ in manufacturing, thus providing some guidelines and references for future research and implementation.     

Tableau Systems for Paraconsistency and Minimal Inconsistency

In this paper,the semantics of a paraconsistent logic and its nonmonotonic extension by minimal inconsistency are presented first.And then signed tableaux for paraconsistent logic and minimal tableaux for logic of minimal inconsistency is proposed.Finally,the reduction of logic of paraconsistency and minimal inconsistncy on ordinary semantics which provides new approach to proof procedure and implementation of paraconsistency and minimal inconsistency are provided.     

Automatic and Hierarchical Verification for Concurrent Systems

Proving correctness of concurrent systems is quite difficult because of the high level of nondeterminism,especially in large and complex ones.AMC is a model checking system for verifying asynchronous concurrent systems by using branching time temporal logic.This paper introduces the techniques of the modelling approach,especially how to construct models for large concurrent systems with the concept of hierarchy,which has been proved to be effective and practical in verifying large systems without a large growth of cost.     

Differentials-based segmentation and parameterization for point-sampled surfaces

Efficient parameterization of point-sampled surfaces is a fundamental problem in the field of digital geometry processing. In order to parameterize a given point-sampled surface for minimal distance distortion, a differentialslbased segmentation and parameterization approach is proposed in this paper. Our approach partitions the point-sampled geometry based on two criteria： variation of Euclidean distance between sample points, and angular difference between surface differential directions. According to the analysis of normal curvatures for some specified directions, a new projection approach is adopted to estimate the local surface differentials. Then a k-means clustering （k-MC） algorithm is used for partitioning the model into a set of charts based on the estimated local surface attributes. Finally, each chart is parameterized with a statistical method -- multidimensional scaling （MDS） approach, and the parameterization results of all charts form an atlas for compact storage.     

Novel devices and process for 32 nm CMOS technology and beyond

The development of next 32 nm generation and below needs innovations on not only device structures, but also fabrication techniques and material selections. Among those promising technologies, new gate structures as high-κ gate dielectric and metal gate, strain channel carrier mobility enhancement technology, and novel non-planar MOSFET structures are all possible candidate technologies. In this paper, we will specify our discussion on the research progress of high-κ-metal gate and non-planar MOSFET-technologies that are suitable to 32 nm technology node and beyond.     

Root-locus method for the Tsypkin and Jury and Lee criteria†

A method is developed for application of the Tsypkin criterion and the Jury and Lee stability criteria for certain classes of non-linear sampled data systems

The method, which uses root-locus techniques, is based on the root-locus interpretation of the Popov criterion for continuous data non-linear systems. This method was developed by Ramapriyan et al. (1966).     

Piecewise-linearized and linearized θ-methods for ordinary and partial differential equations

Initial- and boundary-value problems appear frequently in many branches of physics. In this paper, several numerical methods, based on linearization techniques, for solving these problems are reviewed. First, piecewise-linearized methods and linearized θ-methods are considered for the solution of initial-value problems in ordinary differential equations. Second, piecewise-linearized techniques for two-point boundary-value problems in ordinary differential equations are developed and used in conjunction with a shooting method. In order to overcome the lack of convergence associated with shooting, piecewise-linearized methods which provide piecewise analytical solutions and yield nonstandard finite difference schemes are presented. Third, methods of lines in either space or time for the solution of one-dimensional convection-reaction-diffusion problems that transform the original problem into an initial- or boundary-value one are reviewed. Methods of lines in time that result in boundary-value problems at each time step can be solved by means of the techniques described here, whereas methods of lines in space that yield initial-value problems and employ either piecewise-linearized techniques or linearized θ-methods in time are also developed. Finally, for multidimensional problems, approximate factorization methods are first used to transform the multidimensional problem into a sequence of one-dimensional ones which are then solved by means of the linearized and piecewise-linearized methods presented here.     

Method and system for providing tamper-resistant executable software

Tamper-resistant software is provided by determining aninitial value of a specified property for an executable file.Theexecutable file is then encrypted based on the initial value ofthe specified property.The initial value of the specified prop-erty is associated with the encrypted executable file and laterused to decrypt the encrypted executable file.An execution-time value of the specified property is determined for thedecrypted executable file.The execution-time value of thespecified property is compared to the initial value of the speci-fied property to determine whether tampering has occurred.Thedecrypted executable file is executed in response to the execu-tion-time value of the specified property matching the initialvalue of the specified property.     

Faster Combinatorial Algorithms for Determinant and Pfaffian

Computation of a determinant is a very classical problem. The related concept is a Pfaffian of a matrix defined for skew-symmetric matrices. The classical algorithm for computing the determinant is Gaussian elimination. It needs O(n ³) additions, subtractions, multiplications and divisions. The algorithms of Mahajan and Vinay compute determinant and Pfaffian in a completely non-classical and combinatorial way, by reducing these problems to summation of paths in some acyclic graphs. The attractive feature of these algorithms is that they are division-free. We present a novel algebraic view of these algorithms: a relation to a pseudo-polynomial dynamic-programming algorithm for the knapsack problem. The main phase of Mahajan-Vinay algorithm can be interpreted as a computation of an algebraic version of the knapsack problem, which is an alternative to the graph-theoretic approach used in the original algorithm. Our main results show how to implement Mahajan-Vinay algorithms without divisions, in time $\tilde{O}(n^{3.03})$ using the fast matrix multiplication algorithm.     

Leveraging proficiency and preference for online Karaoke recommendation

Recently,many online Karaoke(KTV)platforms have been released,where music lovers sing songs on these platforms.In the meantime,the system automatically evaluates user proficiency according to their singing behavior.Recommending approximate songs to users can initialize singers5 participation and improve users,loyalty to these platforms.However,this is not an easy task due to the unique characteristics of these platforms.First,since users may be not achieving high scores evaluated by the system on their favorite songs,how to balance user preferences with user proficiency on singing for song recommendation is still open.Second,the sparsity of the user-song interaction behavior may greatly impact the recommendation task.To solve the above two challenges,in this paper,we propose an informationfused song recommendation model by considering the unique characteristics of the singing data.Specifically,we first devise a pseudo-rating matrix by combing users’singing behavior and the system evaluations,thus users'preferences and proficiency are leveraged.Then we mitigate the data sparsity problem by fusing users*and songs'rich information in the matrix factorization process of the pseudo-rating matrix.Finally,extensive experimental results on a real-world dataset show the effectiveness of our proposed model.     

Virtual hairy brush for digital painting and calligraphy

The art of Chinese calligraphy and painting has evolved incessantly over the long history of Chinese culture. It is a beautiful flower in the garden of traditional oriental art forms[1]. Since the emergence of modern computers, to design and develop an interactive and user friendly digital painting environment has been the long cherished dream for many researchers in computer graphics and human-computer interaction[2―10]. With the ever-increasing computing power of today’s hardware, researc…     

Multiresolution for Closed Curves and Surfaces Using Wavelets

Multiresolution modeling is becoming a powerful tool for fast display, and geometric data compression and transmission of complex shapes. Most of the existing literatures investigating the multiresolution for B-spline curves and surfaces are concentrated on open ones. In this paper, we focus on the multiresolution representations and editing of closed B-spline curves and surfaces using wavelets. A repetition approach is adopted for the multiresolution analysis of closed B-spline curves and surfaces. Since the closed curve or surface itself is periodic, it can overcome the drawback brought by the repetition method, i.e. introducing the discontinuities at the boundaries. Based on the models at different multiresolution levels, the multiresolution editing methods of closed curves and surfaces are introduced. Users can edit the overall shape of a closed one while preserving its details, or change its details without affecting its overall shape.     

ERP 2.0, what for and how?

The poor level of adoption of ERP systems is often considered as linked to a loss of social interactions between users of the ERP, together with the poor adaptability of these huge systems to local needs. Web 2.0 tools (including among others social networks, wikis, mashups and tags) aim at allowing a better interaction between a user and an Internet site, or between communities of users by means of a Web site. Using these tools in an industrial context appears now as a possible solution for addressing some of the problems of present information systems, and especially ERPs. Examples of such integration of Web 2.0 technologies in industrial practices are analyzed and the empiricism with which these experiences are usually conducted is underlined. In order to address this problem, we suggest a step-by-step method allowing to identify on which business processes performed by an ERP the Web 2.0 tools could be of interest, and investigate how to integrate the two worlds. This approach is illustrated on the SAP product Business By Design, which new version includes a set of configurable Web 2.0 tools.     

ε-Optimality and duality for multiobjective fractional programming

Using the scalar ε-parametric approach, we establish the Karush-Kuhn-Tucker (which we call KKT) necessary and sufficient conditions for an ε-Pareto optimum of nondifferentiable multiobjective fractional objective functions subject to nondifferentiable convex inequality constraints, linear equality constraints, and abstract constraints. These optimality criteria are utilized as a basis for constructing one duality model with appropriate duality theorems. Subsequently, we employ scalar exact penalty function to transform the multiobjective fractional programming problem to an unconstrained problem. Under this case, we derive the KKT necessary and sufficient conditions without a constraint qualification for ε-Pareto optimality of multiobjective fractional programming.     

Orientation-Matching Minimization for Image Denoising and Inpainting

In this paper, we propose an orientation-matching functional minimization for image denoising and image inpainting. Following the two-step TV-Stokes algorithm (Rahman et al. in Scale space and variational methods in computer vision, pp. 473–482, Springer, Heidelberg, 2007; Tai et al. in Image processing based on partial differential equations, pp. 3–22, Springer, Heidelberg, 2006; Bertalmio et al. in Proc. conf. comp. vision pattern rec., pp. 355–362, 2001), a regularized tangential vector field with zero divergence condition is first obtained. Then a novel approach to reconstruct the image is proposed. Instead of finding an image that fits the regularized normal direction from the first step, we propose to minimize an orientation matching cost measuring the alignment between the image gradient and the regularized normal direction. This functional yields a new nonlinear partial differential equation (PDE) for reconstructing denoised and inpainted images. The equation has an adaptive diffusivity depending on the orientation of the regularized normal vector field, providing reconstructed images which have sharp edges and smooth regions. The additive operator splitting (AOS) scheme is used for discretizing Euler-Lagrange equations. We present the results of various numerical experiments that illustrate the improvements obtained with the new functional.     

A Numerical Method for Area and Volume Calculation

The Calculation of area and volume of B-rep solid is discussed, and a numerical method is presented. The method is based on the integrand simplification of the double integral by quadratic triangular Bezier interpolation.     

Systems and method s for secure transaction management and electronic rights protection

<发明人>:Ginter;Karl L.(Beltsville,MD);Shear;Victor H.(Bethesda,MD);Spahn;Francis J.(ElCerrito,CA);Van Wie;David M.(Eugene,OR)<代理>:InterTrust Technologies Corp.(Santa Clara,CA)