Quartz is a full-featured, open source job scheduling system that can be integrated with, or used along side virtually any J2EE or J2SE application - from the smallest stand-alone application to the largest e-commerce system. Quartz can be used to create SimPLe or complex schedules for executing tens, hundreds, or even tens-of-thousands of jobs jobs whose tasks are defined as standard Java components or EJBs. The Quartz Scheduler includes many enterprise-class features, such as JTA transactions and clustering. Quartz is freely usable, licensed under the Apache 2.0 license.
标签： full-featured integrated scheduling Quartz
上传时间： 2017-08-07
上传用户：来茴
Hibernate: A Developer s Notebook shows you how to use Hibernate to automate persistence: you write natural Java objects and some SimPLe configuration files, and Hibernate automates all the interaction between your objects and the database. You don t even need to know the database is there, and you can change from one database to another simply by changing a few statements in a configuration file. If you ve needed to add a database backend to your application, don t put it off. It s much more fun than it used to be, and Hibernate: A Developer s Notebook shows you why.
标签： Hibernate persistence Developer you
上传时间： 2017-08-17
上传用户：曹云鹏
SDL开发教程，SDL(SimPLe DirectMedia Layer)是一个自由的跨平台的多媒体开发包,适用于 游戏、游戏SDK、演示软件、模拟器、MPEG播放器和其他应用软件。它被广泛的用于许多著名的游戏。
上传时间： 2013-12-31
上传用户：坏天使kk
Windows CMD Emulator is Based Upon Creating a Pipe to Read and Write Data to, it Opens a CMD Window Hidden and Starts Sending and Receiving Data from it using a SimPLe SetTimer Event
标签： CMD Emulator Creating Windows
上传时间： 2014-01-03
上传用户：上善若水
Program to solve for natural frequencies (eigenvalues) and resulting mode shapes (eigenvectors) in SimPLe structures
标签： eigenvectors eigenvalues frequencies resulting
上传时间： 2017-09-11
上传用户：wqxstar
These are precompiled demonstration programs of the Onix toolkit. They do not include the Onix toolkit but are examples of very SimPLe applications written with the toolkit. They are designed to show both how Onix works and also to show how easy it is to integrate the Onix toolkit into a project. While they show many of the features of the Onix toolkit, they don t show all of them. Please consult our documentation, available at our website, to see many of the features Onix gives you. We have included online the full documentation for the Onix toolkit.
标签： Onix demonstration precompiled the
上传时间： 2014-11-26
上传用户：xinzhch
OPC 源程序示例，SimPLe delphi OPC Automation Example （zhz）
上传时间： 2013-12-18
上传用户：LouieWu
I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a SimPLe data structure, say SimPLe scheme, Fibonacci heaps, say F-heap scheme, and Pairing heaps, say P-heap scheme, and measure the relative performance of the three implementations.
标签： implement algorithm Dijkstra Shortest
上传时间： 2014-01-01
上传用户：BIBI
SimPLe delphi app to show pe info along with its protection
标签： Delphi exeinfope
上传时间： 2015-03-31
上传用户：zhuangkingsky
matlab有限元网格划分程序 DistMesh is a SimPLe MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and SimPLe is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A SimPLe example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our SimPLe MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
标签： matlab有限元网格划分程序
上传时间： 2015-08-12
上传用户：凛风拂衣袖
