Koszul differential graded algebras and BGG correspondence

The concept of Koszul differential graded algebra (Koszul DG algebra) is introduced. Koszul DG algebras exist extensively, and have nice properties similar to the classic Koszul algebras. A DG version of the Koszul duality is proved. When the Koszul DG algebra $A$ is AS-regular, the Ext-algebra $E$ of $A$ is Frobenius. In this case, similar to the classical BGG correspondence, there is an equivalence between the stable category of finitely generated left $E$-modules, and the quotient triangulated category of the full triangulated subcategory of the derived category of right DG $A$-modules consisting of all compact DG modules modulo the full triangulated subcategory consisting of all the right DG modules with finite dimensional cohomology. The classical BGG correspondence can derived from the DG version.Comment: 29 page

An extensible product structure model for product lifecycle management in the make-to-order environment

This paper presents a product structure model with a semantic representation technique that make the product structure extensible for developing product lifecycle management (PLM) systems that is flexible for make-to-order environment. In the make-to-order business context, each product could have a number of variants with slightly different constitutions to fulfill different customer requirements. All the variants of a family have common characteristics and each variant has its specific features. A master-variant pattern is proposed for building the product structure model to explicitly represent common characteristics and specific features of individual variants. The model is capable of enforcing the consistency of a family structure and its variant structure, supporting multiple product views, and facilitating the business processes. A semantic representation technique is developed that enables entity attributes to be defined and entities to be categorized in a neutral and semantic format. As a result, entity attributes and entity categorization can be redefined easily with its configurable capability for different requirements of the PLM systems. An XML-based language is developed for semantically representing entities and entity categories. A prototype as a proof-of-concept system is presented to illustrate the capability of the proposed extensible product structure model

Thermodynamic analysis of a novel fossil-fuel–free energy storage system with a trans-critical carbon dioxide cycle and heat pump

This paper presents and analyzes a novel fossil-fuel–free trans-critical energy storage system that uses CO2 as the working fluid in a closed loop shuttled between two saline aquifers or caverns at different depths: one a low-pressure reservoir and the other a high-pressure reservoir. Thermal energy storage and a heat pump are adopted to eliminate the need for external natural gas for heating the CO2 entering the energy recovery turbines. We carefully analyze the energy storage and recovery processes to reveal the actual efficiency of the system. We also highlight thermodynamic and sensitivity analyses of the performance of this fossil-fuel–free trans-critical energy storage system based on a steady-state mathematical method. It is found that the fossil-fuel–free trans-critical CO2 energy storage system has good comprehensive thermodynamic performance. The exergy efficiency, round-trip efficiency, and energy storage efficiency are 67.89%, 66%, and 58.41%, and the energy generated of per unit storage volume is 2.12 kW·h/m3, and the main contribution to exergy destruction is the turbine reheater, from which we can quantify how performance can be improved. Moreover, with a higher energy storage and recovery pressure and lower pressure in the low-pressure reservoir, this novel system shows promising performance

Segmenting characters from license plate images with little prior knowledge

In this paper, to enable a fast and robust system for automatically recognizing license plates with various appearances, new and simple but efficient algorithms are developed to segment characters from extracted license plate images. Our goal is to segment characters properly from a license plate image region. Different from existing methods for segmenting degraded machine-printed characters, our algorithms are based on very weak assumptions and use no prior knowledge about the format of the plates, in order for them to be applicable to wider applications. Experimental results demonstrate promising efficiency and flexibility of the proposed scheme. © 2010 IEEE