Miracle-dz/UniFAR-FTUs huggingface dataset:
Research on Application of the Shortest Path in Game Based on an Improved Genetic Algorithm

Nowadays, the game industry has entered a period of vigorous development, each game artificial intelligence has become the indispensable one element, so a good design can be seen as the soul of game, in almost all games have a kind of be good to hear or see appearance, the soul is attracted to the core game player. In this paper, the genetic algorithm becomes a new random search and optimization algorithm, the basic idea of the theory of evolution based on Darwin and Mendel genetics. Genetic algorithm for solving multi objective and complexity with the unpredictable nature of the problem, there is there is nothing comparable to this superiority. The shortest path problem of network is abstracted to a minimum spanning tree problem and the limitations of the minimum spanning tree are analyzed. The notion of the node degree is introduced.
ETICS meta-data software editing - from check out to commit operations

People involved in modular projects need to improve the build software process, planning the correct execution order and detecting circular dependencies. The lack of suitable tools may cause delays in the development, deployment and maintenance of the software. Experience in such projects has shown that the use of version control and build systems is not able to support the development of the software efficiently, due to a large number of errors each of which causes the breaking of the build process. Common causes of errors are for example the adoption of new libraries, libraries incompatibility, the extension of the current project in order to support new software modules. In this paper, we describe a possible solution implemented in ETICS, an integrated infrastructure for the automated configuration, build and test of Grid and distributed software. ETICS has defined meta-data software abstractions, from which it is possible to download, build and test software projects, setting for instance dependencies, environment variables and properties. Furthermore, the meta-data information is managed by ETICS reflecting the version control system philosophy, because of the existence of a meta-data repository and the handling of a list of operations, such as check out and commit. All the information related to a specific software are stored in the repository only when they are considered to be correct. By means of this solution, we introduce a sort of flexibility inside the ETICS system, allowing users to work accordingly to their needs. Moreover, by introducing this functionality, ETICS will be a version control system like for the management of the meta-data.
An energy conscious methodology for early design exploration of heterogeneous DSPs

In this paper, we introduce an energy-conscious methodology to guide algorithm partitioning and mapping of embedded DSP applications onto heterogeneous architecture components. The methodology supports both realistic algorithm-architecture (simultaneous optimization at different abstraction levels) as well as hardware-software co-design (optimization over various architectural alternatives). Macro-model based predictors are used to provide early feedback on the impact of design selections and partitions. A case study is presented to demonstrate the methodology flow.
Text categorization and similarity analysis: similarity measure, architecture and design

This research looks at the most appropriate similarity measure to use for a document classification problem. The goal is to find a method that is accurate in finding both semantically and version related documents. A necessary requirement is that the method is efficient in its speed and disk usage. Simhash is found to be the measure best suited to the application and it can be combined with other software to increase the accuracy. Pingar have provided an API that will extract the entities from a document and create a taxonomy displaying the relationships and this extra information can be used to accurately classify input documents. Two algorithms are designed incorporating the Pingar API and then finally an efficient comparison algorithm is introduced to cut down the comparisons required.
Exploring Deep Knowledge Resources in Biomedical Name Recognition

In this paper, we present a named entity recognition system in the biomedical domain. In order to deal with the special phenomena in the biomedical domain, various evidential features are proposed and integrated through a Hidden Markov Model (HMM). In addition, a Support Vector Machine (SVM) plus sigmoid is proposed to resolve the data sparseness problem in our system. Besides the widely used lexical-level features, such as word formation pattern, morphological pattern, out-domain POS and semantic trigger, we also explore the name alias phenomenon, the cascaded entity name phenomenon, the use of both a closed dictionary from the training corpus and an open dictionary from the database term list SwissProt and the alias list LocusLink, the abbreviation resolution and indomain POS using the GENIA corpus.
A separation principle for hybrid control system design

A method is presented here, based on automatic control system design practice, for the synthesis of hybrid control systems, controllers which contain both real-time feedback loops and logical decision-making components. In the proposed framework, the overall design task is separated into three component parts: 1) design of the real-time control loops; 2) synthesis of the decision-making logic; and 3) construction of appropriate boolean/real-time translation routines. This is an effective partitioning of the control system design task, as shown through two examples: 1) control of a highly flexible structure and 2) a robotic manipulator control task. This framework was found to be compatible with expert system-based intelligent control systems and can employ expert system techniques when necessary or effective. <<ETX>>
Algorithm and architectures for radix-4 division with over-redundant digit set and simple digit selection hardware

The authors analyze a SRT radix 4-division algorithm which has a trivial selection function. The algorithm uses an over-redundant digit set together with the same prescaling considered by M.D. Ercegovac and T. Lang, (1990) where, however, it is shown that the digit selection requires the knowledge of six assimilated bits of the partial remainder in order to work correctly. Architectures for implementing the proposed algorithm are also presented, which can be considered as alternatives to the existing architectures for radix-4 division. An architectural solution to the problem of on-the-fly translating of the quotient from over-redundant to non-redundant form is provided. <<ETX>>
Compliance Analysis of Mechanisms with Spatial Continuous Compliance in the Context of Screw Theory and Lie Groups

This paper investigates the compliance effect on both serial and parallel mechanisms based on study of deflections of a finite segment of elastic beam with spatial compliance and applies eigenvectors and eigenvalues to identify principal screws in the mechanisms and parallel devices with spatial continuous compliance. With the analysis, compliance characteristics of both serial mechanisms and parallel devices can be identified with effect of compliance. Case studies are presented with numerical examples.
Multi class support vector machine implementation to intrusion detection

Despite advances in security practices the threat to information assurance is on the rise. Due to the growing number of malicious usage, attacks, stealing of sensitive information and sabotage, information security has become one of the prime concerns for many governments as well as corporate organizations, the world over. There exists a constant need for improvement and innovation in detection of intrusions and adoption of efficient countermeasures against security breaches. In a new approach, this paper focuses on applying multi class support vector machine classifiers, using one-versus-one method, for anomalous as well as misuse detection to identify attacks precisely by type. Evaluation has been done over a benchmark dataset used in the Third Knowledge Discovery and Data mining competition (KDD'99). The results obtained are comparable to some of the best in the contest.
Fast Random‐Forest‐Based Human Pose Estimation Using a Multi‐scale and Cascade Approach

Since the recent launch of Microsoft Xbox Kinect, research on 3D human pose estimation has attracted a lot of attention in the computer vision community. Kinect shows impressive estimation accuracy and real‐time performance on massive graphics processing unit hardware. In this paper, we focus on further reducing the computation complexity of the existing state‐of‐the‐art method to make the real‐time 3D human pose estimation functionality applicable to devices with lower computing power. As a result, we propose two simple approaches to speed up the random‐forest‐based human pose estimation method. In the original algorithm, the random forest classifier is applied to all pixels of the segmented human depth image. We first use a multi‐scale approach to reduce the number of such calculations. Second, the complexity of the random forest classification itself is decreased by the proposed cascade approach. Experiment results for real data show that our method is effective and works in real time (30 fps) without any parallelization efforts.
An integrated multi-source JDL high-level fusion architecture using recombinant cognition synthesis

High-Level fusion systems based on the JDL model are relatively immature. Current solutions lack a comprehensive ability to manage multi-source data in a multi-dimensional vector space, and generally do not integrate collection to action models in a cohesive thread. Recombinant Cognition Synthesis (RCS) leverages best-of-breed techniques with a geospatial, temporal and semantic data model to provide a unified methodology that recombines multi-source data with analytic and predictive algorithms to synthesize actionable intelligence. This architecture framework enables the traversal of entity relationships at different level of granularities and the discovery of latent knowledge, thereby facilitating the domain problem analysis and the development of a Course-of-Action to mitigate adversarial threats. RCS also includes process refinement techniques to achieve superior information dominance, by incorporating specialized metadata. This comprehensive and unified methodology delivers enhanced utility to the intelligence analyst, and addresses key issues of relevancy, timeliness, accuracy, and uncertainty by providing metrics via feedback loops within the RCS infrastructure that augment the efficiency and effectiveness of the end-to-end fusion processing chain.
Robust simultaneous registration of multiple range images comprising a large number of points

As part of a project for the electronic preservation of cultural objects, this paper proposes a new technique for position alignment of multiple range images. In particular, the study focuses on accuracy of alignment and robustness to noise in the input data. Using the conjugate gradient method based on the M-estimator, simultaneous alignment is performed by minimization of an error function that handles all range images at the same time. Furthermore, for more efficient and more accurate search for matching points, the KD-tree data structure is utilized, and additional attributes such as the laser reflection brightness and the brightness of the three-dimensional point itself are introduced into the error measure. This paper proposes such a method and presents the results of experiments with real data. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 87(8): 61–74, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20109
A Unified Approach of Object-Level Saliency Detection in Images and Videos

Object-level saliency detection is an important branch of visual saliency. In this paper, we propose a novel method which can conduct object-level saliency detection in both images and videos in a unified way. We employ a more effective spatial compactness assumption to measure saliency instead of the popular contrast assumption. In addition, we present a combination framework which integrates multiple saliency maps generated in different feature maps. The proposed algorithm can automatically select saliency maps of high quality according to the quality evaluation score we define. The experimental results demonstrate that the proposed method outperforms all state-of-the-art methods on both of the datasets of still images and video sequences.
IMPLEMENTATION OF PARALLEL DATA MINING ON AN ATM-CONNECTED PC CLUSTER AND PERFORMANCE ANALYSIS OF TCP RETRANSMISSION MECHANISMS

A recent tendency in parallel computer design has been to use general-purpose components for system configuration elements such as CPUs, disks, and memories, which used to be specially developed. Although the connection network between the processors has been specially developed, it is now possible to configure a large-scale PC cluster with good performance at low cost by making use of an ATM network as a processor connection network because of the development and cost reduction of ATM network technologies in the communication field. In this paper, a large-scale PC cluster is constructed by connecting 100 personal computers by means of a general-purpose ATM network. Applications to parallel data mining are evaluated and discussed. In particular, an analysis is carried out with a focus on the effect of TCP retransmission with cell discarding of the ATM switch on the performance. The parameter setting of a retransmission mechanism suitable for the parallel processing in the cluster is found. Further, by developing a method for setting the retransmission spacing parameters to random values for each node, it is shown that a further improvement is possible. © 1999 Scripta Technica, Electron Comm Jpn Pt 1, 82(7): 12–24, 1999
An improved stereovision scheme using one camera and a composite lens array

The stereovision scheme is a method to extract the three-dimensional information of the original object from two or more images of it. In the conventional scheme, more than two cameras are used to acquire numbers of images with different perspectives. As the numbers of cameras are increased, the complexity of the entire system is also increased and there can be many difficulties such as camera calibration and vibration in the conventional method. In this paper, an improved stereovision scheme using single camera and a composite lens array is proposed. In the proposed system, only one camera and a composite lens array is required and the complexity of the entire system is decreased. With the use of a composite lens array, it is possible to improve the performance of the system compared with the method using a conventional lens array. The proposed method is proven to be useful by simulation and experimental results.
A More Topologically Stable ISOMAP Algorithm

The success of ISOMAP depends greatly on being able to choose a suitable neighborhood size, however, it is still an open problem how to do this effectively. Based on the fact that “short circuit” edges pass the area with the relatively lower local densities, this paper presents a new variant of ISOMAP, i.e. P-ISOMAP (pruned-ISOMAP), which can prune effectively “short circuit” edges existed possibly in the neighborhood graph and thus is much less sensitive to the neighborhood size and more topologically stable than ISOMAP. Consequently, P-ISOMAP can be applied to data visualization more easily than ISOMAP because the open problem described above can be avoided to the utmost extent. The effectivity of P-ISOMAP is verified by the experimental results very well.
The Efficiency of Computer Algorithms for Plant Layout

This paper presents the results of comparing experimentally the performance of four of the more promising computer algorithms for the plant layout problem. CDC 3600 computer programs are tested with twenty-six test problems. The resulting solutions are evaluated in respect to both computer time requirements and objective function values. The experiment shows how these two performance measures vary with the algorithm used and various test problem characteristics. With the exception of two studies [Hillier, F. S. , M. N. Connors. 1966. Quadratic assignment problem algorithms and the location of indivisible facilities. Management Sci. 13 (1, September) 42-57; Nugent, C. E. , T. E. Vollman, J. Ruml. 1968. An experimental comparison of techniques for the assignment of facilities to locations. Oper. Res. XVI (1, January-February) 150-173. ], information on comparative performances of layout algorithms is very limited.
What Did You Mean

Existing approaches towards service composition demand requirements of the customers in terms of service templates, service query profiles, or partial process models. However, addressed non-expert customers may be unable to fill-in the slots of service templates as requested or to describe, for example, pre- and postconditions, or even have difficulties in formalizing their requirements. Thus, our idea is to provide nonexperts with suggestions how to complete or clarify their requirement descriptions written in natural language. Two main issues have to be tackled: (1) partial or full inability (incapacity) of non-experts to specify their requirements correctly in formal and precise ways, and (2) problems in text analysis due to fuzziness in natural language. We present ideas how to face these challenges by means of requirement disambiguation and completion. Therefore, we conduct ontology-based requirement extraction and similarity retrieval based on requirement descriptions that are gathered from App marketplaces. The innovative aspect of our work is that we support users without expert knowledge in writing their requirements by simultaneously resolving ambiguity, vagueness, and underspecification in natural language.
A Low-Jitter Fast-Locking Multi-phase Clock for High Resolution CCD Processor

ABSTRACT A multi-phase clock circuit for a 14 bit 80 MHz charge-coupled device (CCD) signal processor is designed based on the Delay-Locked Loop (DLL) structure. To accelerate the DLL locking time, a new fast locking controller circuit is proposed in this paper. Besides, a low jitter delay cell circuit is used to reduce the influence of the jitter generated by multiple phase clock generating circuit on the performance of correlated double sampling (CDS) and A/D conversion in the high resolution CCD signal processor. A clock signal with adjustable phase for the CCD signal processor can be obtained by changing the value of the edge selected register. The proposed clock circuit implemented and simulated with SMIC 0.18 μm 3.3 V 1P6M mixed CMOS process and the area of layout is 1000 × 350 μm. Under the condition of TT/3.3V/27 °C, the simulation results with the input clock frequency of 80 MHz show that the DLL locking time is 1.3 μs. Besides, the peak-to-peak jitter is 1.09 ps and the RMS jitter is 182 fs.
A Cost-Effective Sustain Power Conversion Scheme for Plasma Display Panels

This paper presents a cost-effective sustain power conversion scheme for the plasma display panel (PDP). A new energy-recovery (ER) circuit is proposed for a low-cost sustain driver. As a parallel-resonant type ER circuit, it can recover the energy stored in the PDP without the interconnection of the sustaining and scanning electrodes. It has a simple structure and fewer power devices, providing a lower cost of production. In addition, a high efficiency sustain power supply is proposed to provide a constant sustain voltage for the sustain driver. It achieves zero-current turn-off of the output diode, alleviating the diode reverse-recovery problems. The sustain power efficiency is increased by reducing the switching power loss. Therefore, the cost and power consumption of the PDP can be improved. The proposed circuits are theoretically analyzed in detail. The experimental results based on a 32-in PDP are presented to confirm the validity of the proposed circuits.
A recognition method in holographic data storage system by using structural similarity

The holographic data storage system (HDSS) is a page-oriented storage system with advantages of great capacity and high speed. The page-oriented recording breaks the tradition of the optical storage of one-point recording. As the signal image is retrieved from the storage material in the HDSS, various noises influences the image and then the data retrieve will be difficultly from the image by using the thresholding method. For progressing on the thresholding method, a recognition method, based on the structural similarity, is proposed to replace the thresholding method in the HDSS. The recognition method is implemented that the image comparison between the receive image and reference image is performed by the structural similarity method to find the most similar reference image to the received image. In the experiment, by using recognition method, the bit error rate (BER) results in 26% decrease less than using the thresholding method in the HDSS. Owing to some strong effects, such as non-uniform intensity and strong speckle, still influencing on the received image, the recognition method is seemed to be slightly better than thresholding method. In the future, the strong effects would be reduced to improve the quality of the receive image and then the result of using the recognition method may be vastly better than the thresholding method.
Combining symbolic and genetic techniques for efficient sequential circuit test generation

Symbolic and genetic techniques are combined in a new approach to sequential circuit test generation that uses circuit decomposition, rather than the algorithmic decomposition used in previous hybrid test generators. Symbolic techniques are used to generate test sequences for the control logic, and genetic algorithms are used to generate sequences for the datapath. The combined sequences provide higher fault coverages than those generated by existing deterministic and GA-based test generators, and execution times are significantly lower in many cases.
Unified voltage modulation technique for real time three-phase power conversion

In this paper, a novel voltage modulation technique named unified PWM (pulse width modulation) for high performance voltage generation in a voltage-fed inverter is described. As increasing the interest in the high quality power conversion is, a simple PWM scheme that has the wide fitness to the general prospect for the loss minimization and the lowest current harmonic with full DC link voltage utilization is required. From the synthesis of the actual inverter action, a simple but useful concept for the 'effective time' is established. And, fully employing this concept, a new voltage modulation technique for various applications is presented with detailed explanation and actual test results. Implementing this facile strategy to actual fields will result in great reduction of calculation efforts and high applicability including the minimization of switching loss and current harmonics.