118699197
Intentionally and unintentionally: on both, A and non-A, in neutrosophy
The paper presents a fresh new start on the neutrality of neutrosophy in that "both A and Non-A" as an alternative to describe Neuter-A in that we conceptualize things in both intentional and unintentional background. This unity of opposites constitutes both objective world and subjective world. The whole induction of such argument is based on the intensive study on Buddhism and Daoism including I-ching. In addition, a framework of contradiction oriented learning philosophy inspired from the Later Trigrams of King Wen in I-ching is meanwhile presented. It is shown that although A and Non-A are logically inconsistent, but they are philosophically consistent in the sense that Non-A can be the unintentionally instead of negation that leads to confusion. It is also shown that Buddhism and Daoism play an important role in neutrosophy, and should be extended in the way of neutrosophy to all sciences according to the original intention of neutrosophy.
18035243
Level-Set-Based Deformation Methods for Adaptive Grids
A new method for generating adaptive moving grids is formulated based on physical quantities. Level set functions are used to construct the adaptive grids, which are solutions of the standard level set evolution equation with the Cartesian coordinates as initial values. The intersection points of the level sets of the evolving functions form a new grid at each time. The velocity vector in the evolution equation is chosen according to a monitor function and is equal to the node velocity. A uniform grid is then deformed to a moving grid with desired cell volume distribution at each time. The method achieves precise control over the Jacobian determinant of the grid mapping as the traditional deformation method does. The new method is consistent with the level set approach to dynamic moving interface problems.
9209043
An Adaptive Grid Method and Its Application to Steady Euler Flow Calculations
An adaptive remeshing procedure based on a cell volume deformation method is presented. Starting with an initial grid, this method offers direct cell volume control through the specification of the transformation Jacobian. Grid points are moved with appropriate grid velocities so that the specified cell volume distribution can be achieved at the end of the grid movement without adding or removing grid points. The grid velocities are determined by solving a scalar Poisson equation. This method is applied to solving the compressible Euler equations. Computational test cases of transonic flow over an airfoil are presented and demonstrate the desired control of grid sizes across shock waves.
7197821
A case study on system-level modeling by aspect-oriented programming
The paper presents a novel and synergistic system-level modeling approach based on aspect-oriented programming (AOP) and SystemC. A case study on a 128-bit binary floating-point adder is performed to demonstrate the modeling strength of the approach. The validation experiment shows the effectiveness of the proposed approach. This work constitutes a first attempt to employ AOP in modeling digital systems.
856762
Research on System Integrative Evaluation Method Based on Survivability
Survivability is the essential ability of a system to fulfill its mission, in a timely manner, in the presence of attacks, failures, or accidents. Survivability should be considered beyond security for information system, and quantitative analysis can assess system survivability accurately for improvement. The paper presents a new type of analysis method for computer system survivability which considers both exterior environment and interior components and their correlations. The method can describe the survivability more precisely and exactly. The paper also elaborates on the process of using this method to evaluate system survivability and its advantages.
46240388
An Efficient Heuristic Algorithm for Constructing Delay- and Degree-Bounded Application-Level Multicast Tree
In this paper we first investigate the problem of finding a delay- and degree-bounded maximum sum of nodes ALMT. We proved the problem is NP-hard, and testify its relationship with the well-studied degree-bounded minimum maximum-delay ALMT problem. We proposed a greedy algorithm FindOverlayTree with SRPF heuristic. The simulation results show that our design solution is a valid and cost-effective approach where compared to other three modified classic heuristics under several performance metrics.
29221183
Intelligent Crowd Simulation
Crowd simulation is a continuous challenge in computer animation. In this paper, we present an intelligent crowd simulation technique based on multiple autonomous agents. Each animated character (AC) is modeled as an autonomous agent, consisting of the perception, behavior planning and motion generation system. AC perceives the environment information, generates intentions and plans behaviors autonomously. To execute behaviors, appropriate motions are selected from the fundamental motion library (FML) and edited to create required motions. And the crowd behavior can be regarded as a combination of the individual behavior of each AC. The experiment shows the feasibility of this technique.
15250571
Frequent Itemset Mining Based on Heuristic Two Level Counting
Recently, many enchanced Apriori algorithms have been proposed to efficiently generate all frequent itemsets from datasets in data mining field. Although efficient techniques were presented, those algorithms are either time-consuming or memory-consuming. To address the issue further, a new algorithm, which introduced a novel support counting method, heuristic two level counting, is proposed. HTLC method adopts an improved itemset generating technology in the generation process of low level itemsets, which promotes the production of low level frequent itemsets or candidate itemsets. It also applies a heuristic traversal technology which speeds up one pass over datasets and support counting technology which largely reduces the number of passes over datasets to the generation of high level frequent itemsets. Finally, the experimental results show that it outperforms existing Apriori-like algorithms in mostly datasets