Filter Results
-
Third International Conference on Natural Computation - Cover
Publication Year: 2007, Page(s): c1|
PDF (652 KB)
-
Third International Conference on Natural Computation - Title page
Publication Year: 2007, Page(s):i - iii|
PDF (59 KB)
-
Third International Conference on Natural Computation - Copyright notice
Publication Year: 2007, Page(s): iv|
PDF (59 KB)
-
Third International Conference on Natural Computation - TOC
Publication Year: 2007, Page(s):v - xii|
PDF (76 KB)
-
-
Organizing Committee
Publication Year: 2007, Page(s):xiv - xv|
PDF (34 KB)
-
Program Committee
Publication Year: 2007, Page(s):xvi - xviii|
PDF (32 KB)
-
Reviewers
Publication Year: 2007, Page(s): xix|
PDF (36 KB)
-
Context-Aware Learning Privacy Disclosure Policy from Interaction History
Publication Year: 2007, Page(s):3 - 7Context-aware applications use personal information to provide appropriate services for people. This personal information is often involved in personal privacy. In order to balance the personal privacy concerns against enjoying context-aware services, we propose a conceptual framework and privacy role to control access personal information. Privacy disclosure policy can be learned from people's in... View full abstract»
-
Dynamic Optimization of Subquery Processing in Grid Database
Publication Year: 2007, Page(s):8 - 13
Cited by: Papers (2)Grid database is a new research area combined with the database techniques and Grid techniques, while traditional database query and optimization techniques couldn't fully satisfy the need of Grid database because of the dynamic properties of Grid Nodes. The paper brings forward a query plan model/ NSN based on Petri net so as to describe the data relation between subquery and nodes. Based on NSN ... View full abstract»
-
Enhancement of Dynamic Encoding Algorithm for Searches (DEAS) via Modified Decoding Function and Hopping Operation
Publication Year: 2007, Page(s):14 - 18In this paper, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results... View full abstract»
-
Extremal Optimization with Local Search for the Circular Packing Problem
Publication Year: 2007, Page(s):19 - 23optimization (EO) is a heuristic nature-inspired algorithm and has been applied to solve some discrete combinatorial optimization problems. In this paper, a continuous version of EO, called EO with local search (EOLS), is presented to solve the problem of packing unequal circles into a larger circular container. First, an equivalent physical model of the problem is adopted to handle the constraint... View full abstract»
-
Hierarchical Conditional Random Fields (HCRF) for Chinese Named Entity Tagging
Publication Year: 2007, Page(s):24 - 28
Cited by: Papers (4)Named entity tagging is one of the key techniques in natural language processing tasks such as information extraction, answer question and so on. We present a method of Chinese NE tagging using hierarchical conditional random fields. This study is concentrated on person names, location names and organization names. We divide the process of Chinese NE tagging into three layers: person CRFs layer, l... View full abstract»
-
Intelligent Knowledge Network Management System Considering Internal Entropy Knowledge Cell
Publication Year: 2007, Page(s):29 - 33Everything in the world has own properties and interacts with other things dynamically. By their associative relationship they are linked , sometimes combined and separated. These features make a living thing possible to survive in the complex environment. As more computational virtual environment is developed rapidly, the requirement of intelligent system adopting the properties of living things ... View full abstract»
-
New Delay-Dependent Stabilization Criterion for Time-Delay Chaotic Systems
Publication Year: 2007, Page(s):34 - 38This paper deals with the problem of standard feedback control for a class of time-delay chaotic systems. A new delay-dependent condition for stabilization with less conservatism is derived in terms of linear matrix inequalities. In order to obtain a lower controller gain, an optimization algorithm is proposed which involves some constraints to restrict the size of gain matrix. A numerical example... View full abstract»
-
Global Optimization under Nonlinear Constraints Based on Apollonius Fill
Publication Year: 2007, Page(s):39 - 43Making use of Apollonius Fill, an algorithm is presented, which is for finding solutions of global optimization problems nonlinearly constrained by a circular region in the plane. Using this algorithm, global optimum can be computed fast and precisely. We request no more than first order derivatives of objective functions for the optimization algorithm. If we do not care about the processing time ... View full abstract»
-
Numerical Simulation Technique for Nonlinear Singularly Perturbed Predator-Prey Reaction Diffusion System in Biomathematics
Publication Year: 2007, Page(s):44 - 48In biomathematics, singularly perturbed predator-prey systems are of common occurrence. A singularly perturbed problem with nonlinear predator-prey reaction diffusion system in 2 dimension is studied. The system changes rapidly near initial time layer. Traditional numerical method failed to simulate the system. Numerical simulation of this kind of system is rare so far, this motives us to consider... View full abstract»
-
Optimization of the Trade-Off by Artificially Re-sampling for Ensemble Learning
Publication Year: 2007, Page(s):49 - 53Ensemble learning methods like Bagging and Boosting that train a diversity of classifiers by manipulating the training set given to a base learning algorithm and then combine their predictions in classification. And the trade-off between accuracy and diversity of component classifiers is the crucial factor in determining its generalization error. Both Bagging and Boosting approach the trade-off by... View full abstract»
-
Point-by-Point Generation Algorithm for B-spline Curves in Two-Photon Fabrication
Publication Year: 2007, Page(s):54 - 57In a two-photon femtosecond laser system of three- dimensional micro-fabrication, a model of micro-device is fabricated layer by layer. For each layer, it is fabricated point by point along its contours of cross-sections. So it is necessary to generate process points one by one along the contours. In this paper, the contours of cross section of a model are supposed to be B-spline curves. An effici... View full abstract»
-
Reconstruction of Solder Joint Surface Based on Shape from Shading
Publication Year: 2007, Page(s):58 - 62
Cited by: Papers (2)Inspection of solder joint is a critical step in the assembly of PCB (Printed Circuit Board) which requires high reliability. Previous studies have shown that a visual inspection is tedious and unreliable because the inspection process varies with the mood, time, experience and interpretation skills of an inspector. So, non-destructive inspection technology based on image captured by CCD (Charge C... View full abstract»
-
Reducing the PAR In OFDM Systems by Clipping Scheme
Publication Year: 2007, Page(s):63 - 68
Cited by: Papers (1)Orthogonal frequency division multiplexing (OFDM) signals suffer from a large peak-to-average-power-ratio, which requires large power back-offs in the transmitter and receiver. This paper studies a digital post-processing method that mitigates clipping by the analog-to-digital converter in the receiver. The peak to average power ratio (PAR) is baneful in OFDM systems. The clipping signal scheme, w... View full abstract»
-
Research of Directed Network Capacity Expansion Based on Spanning Tree Diagram
Publication Year: 2007, Page(s):69 - 73This paper gives a mathematical description of the directed network capacity definitions and theorems of computing capacities towards the network. Prove of the theorem correctness is also given. According to them, the paper proposes an algorithm of computing the directed network capacities based on spanning tree diagram and even an advanced optimization algorithm. In addition, it discusses network... View full abstract»
-
Research on Estimating Whole Life Railway Projects According to CS, BPNN & the Plethora of Historic Data
Publication Year: 2007, Page(s):74 - 78The inaccuracy of cost estimation in feasibility study and design stage is one of main reasons that make investment of railway construction projects out of control in China. In those two stages cost estimations are affected by many uncertain factors, and the relationship among them is nonlinear and traditional model is hard to solve them. This paper applies Cost-Significant (CS) theorem to simplif... View full abstract»
-
Research on Model Criterion and Mapping of Simulation Computation
Publication Year: 2007, Page(s):79 - 83Methods of natural computation development (such as simulation computation), have not been completely standard. These concrete problems are as follows: nonstandard state of models, and irregularity of the procedure of model developing. Because of the deficiency of common standard and criterion, the models of simulation systems under "chimney pattern " are repeatedly developed, hard to be interconn... View full abstract»
-
Research on Risk in Long-Term Reservoir Dynamic Probability Scheduling
Publication Year: 2007, Page(s):84 - 87This paper presents the concept of engineering risk, the algorithm of mean first order second moment (MFOSM) and the approach for long-term reservoir dynamic probability scheduling (LRDPS). MFOSM is applied to study the current stage risk in LRDPS and the risk analysis model is built up for corresponding annual scheduling. Tested in Dan Jiangkou plant, which belongs to Central China Power Grid, th... View full abstract»