ppxscal/embedding_network huggingface dataset:
Neural-based control and stability analysis of a class of nonlinear systems: Base-excited inverted pendulums
Authors: Q. Wu, N. Sepehri, S. He
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

This paper presents a novel application of multilayer neural networks for online control of a class of base-excited inverted pendulums. The pendulum has two degrees of rotational freedom and its base-point moves freely in three-dimensional space. The goal is to apply control torques to keep the pendulum in a desired orientation, in spite of disturbing base-point movement. Four three-layered neural networks are trained online to represent the inverse dynamics of the plant within a controller. The conditions of training accuracy, to guarantee the stability of such a non-autonomous closed-loop system, are established using Lyapunov stability theory. The proposed neural controller is examined through simulations. Its performance is also compared with the performance of a Lyapunov controller from the most recent published work. It is shown that the proposed control scheme is simple in implementation in the sense that it does not require a mathematical model of the target pendulum or the measurement of the base-point movement. At the same time, it produces fast, yet well-damped responses with smooth control torques. The work presented here can benefit practical problems such as the study of stable locomotion of the human upper-body and bipedal robots.
Exploring Concept Selection Strategies for Interactive Video Search
Authors: Michael G. Christel, Alexander G. Hauptmann
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Ranked shot lists from 39 automated LSCOM-Lite concept classifiers are investigated with respect to 24 TRECVID 2006 topics. Selecting the best fitting concept or pair of concepts produces the shot set with greatest utility, rather than drawing fewer shots from a larger set of concepts. Mean average precision measures show concept-based shot sets have great utility for topics when perfectly traversed by a user. Using empirical data, however, shows that realistic ability to separate relevant shots from irrelevant ones and recall all the relevant ones is topic-dependent and far from perfect. Concept-based strategies including user-driven selection strategies not using idealized oracle prioritization are also discussed, with implications for query-by-concept in interactive video retrieval as concept spaces grow from tens to thousands.
The Pyramid Match Kernel: Efficient Learning with Sets of Features
Authors: Kristen Grauman, Trevor Darrell
Venue: The Journal of Machine Learning Research (2007)

In numerous domains it is useful to represent a single example by the set of the local features or parts that comprise it. However, this representation poses a challenge to many conventional machine learning techniques, since sets may vary in cardinality and elements lack a meaningful ordering. Kernel methods can learn complex functions, but a kernel over unordered set inputs must somehow solve for correspondences---generally a computationally expensive task that becomes impractical for large set sizes. We present a new fast kernel function called the pyramid match that measures partial match similarity in time linear in the number of features. The pyramid match maps unordered feature sets to multi-resolution histograms and computes a weighted histogram intersection in order to find implicit correspondences based on the finest resolution histogram cell where a matched pair first appears. We show the pyramid match yields a Mercer kernel, and we prove bounds on its error relative to the optimal partial matching cost. We demonstrate our algorithm on both classification and regression tasks, including object recognition, 3-D human pose inference, and time of publication estimation for documents, and we show that the proposed method is accurate and significantly more efficient than current approaches.
Direct Implementation of Asynchronous Control Units
Authors: L. A. Hollaar
Venue: IEEE Transactions on Computers (1982)

The "one-hot" row assignment for asynchronous circuits, in which every row in a flow table has exactly one of the feedback variables that equals the value 1, provides a straightforward method for circuit synthesis. Once a flow table has been constructed, the state equations can be directly written, without requiring any procedure to ensure a race-free assignment. Furthermore, it can implement any arbitrary fundamental mode asynchronous circuit, not depending on a specific signaling protocol for its correct operation. An alternate view of one-hot asynchronous circuits is given, with a simple set-reset flip-flop for each state. Although this may seem excessive compared to implementations with encoded state variables, for many circuits their one-hot implementation is comparable in cost to other asynchronous implementations.
JCLEC: a Java framework for evolutionary computation
Authors: Sebasti&#x00e1;n Ventura, Crist&#x00f3;bal Romero, Amelia Zafra, Jos&#x00e9; A. Delgado, C&#x00e9;sar Herv&#x00e1;s
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

In this paper we describe JCLEC, a Java software system for the development of evolutionary computation applications. This system has been designed as a framework, applying design patterns to maximize its reusability and adaptability to new paradigms with a minimum of programming effort. JCLEC architecture comprises three main modules: the core contains all abstract type definitions and their implementation; experiments runner is a scripting environment to run algorithms in batch mode; finally, GenLab is a graphical user interface that allows users to configure an algorithm, to execute it interactively and to visualize the results obtained. The use of JCLEC system is illustrated though the analysis of one case study: the resolution of the 0/1 knapsack problem by means of evolutionary algorithms.
A Hybrid Particle Swarm Optimization-Based Algorithm for 1-D Phase Retrieval
Authors: Guangbin Liu, Yingfeng Qiu, Feng Chao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The previous solutions for 1-D phase retrieval problem usually employed an iterative algorithm applied on a discrete approximation of a signal. The utilization of these algorithms is seriously limited by the unpredictability of their convergence, stagnation and abundant computation. In this paper, a particle swarm optimization algorithm is introduced to solve this problem. Firstly, 1-D phase retrieval was regarded as a constrained nonlinear optimization problem. Secondly, it was converted to an unconstrained nonlinear optimization problem by using penalty function method. Finally, a particle swarm optimization algorithm incorporated with hill-climbing method was used to solve this optimization problem. The effectiveness of our solution is illustrated with some numerical examples.
Extending Dynamic Aspect Mining Using Formal Concept Analysis
Authors: Liping Qu, Daxin Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The fact that crosscutting concerns cannot be well modularized in object-oriented software is an impediment to program comprehension: the implementation of a concern is typically scattered over many locations and tangled with the implementation of other concerns, resulting in a system that is hard to explore and understand. Aspect mining aims to identify crosscutting concerns in a system, thereby improving the system's comprehensibility and enabling migration of existing (object-oriented) programs to aspect-oriented ones. In this paper, we briefly introduce DynAMiT, a dynamic aspect mining tool that detects crosscutting concerns based on tracing method executions. While the approach is generally fairly precise, further analysis revealed that some aspect candidates were blurred or not detected. We enhanced the mining capabilities of DynAMiT by using formal concept analysis.
Distributed Processing Based on Timed Petri Nets
Authors: Xianwen Fang, Zhicai Xu, Zhixiang Yin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

At present, in the design and analysis of discrete event systems, the parallel or distributed simulation mechanism is adopted to make these models occur concurrently , then the problem will be easy to be solved, the validation of their models is often addressed via simulation. Lookahead computation is a good method that improves the distributed simulation performance of Timed Transition Petri Nets (TTPN). Extended Timed Petri Nets (ETTPN) is extended in time based on TTPN, it meet Lookahead requirements, and use the Lookahead to analyze the ETTPN model for finding the concurrency and blocking structure, thereby making certain the logical process (LP). Based on the specialties of Lookahead, the Lookahead was applied in parallel simulation, and acquire the sufficient condition about the ETTPN model existing concurrency. According to the condition, parallel program can be partitioned into several logical processes, and the partition algorithm about distributed processing is avail. In order to reduce error rate,a improved mapping algorithm is presented.
Power and Memory Bandwidth Reduction of an H.264/AVC HDTV Decoder LSI with Elastic Pipeline Architecture
Authors: Kentaro Kawakami, Mitsuhiko Kuroda, Hiroshi Kawaguchi, Masahiko Yoshimoto
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

We propose an elastic pipeline that can apply dynamic voltage scaling (DVS) to hardwired logic circuits. The proposed pipeline can also reduce a required local bus bandwidth. In order to demonstrate its feasibility, a hardwired H.264/AVC HDTV decoder is designed as a real-time application. The proposed architecture reduces a power to 56% in a 90-nm process technology, compared to the conventional clock-gating scheme or a local bus bandwidth to 37.2%.
Message in a Bottle: Stylized Rendering of Sand Movies
Authors: Laurindo S. Britto Neto, Bruno M. Carvalho
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Stylized rendering, usually referred as non-pho- torealistic rendering, aims to reproduce artistic techniques in renderings, trying to express feelings and moods on the rendered scenes, as opposed to realistic rendering tech- niques, that aim to produce realistic renderings of artificial scenes. In this paper, we present a stylized rendering tech- nique that aims to create synthetic sand-filled bottles, sim- ulating a typical art craft from the Northeastern region of Brazil, that usually depicts landscape images. A method for generating 2D procedural sand textures is presented, and two new techniques that mimic effects created by the artists using their tools are introduced. The technique is also used to generate stylized videos, something close to impossible in real life with this technique. The temporal coherence within these stylized videos can be enforced on individual objects with the aid of a video segmentation algorithm. The tech- niques were used on synthetic and real videos, and several snapshots from these videos are shown here.
Knowledge Interconnection Based on Binary Semantic Relation Analysis
Authors: Yuxia Lei, Baoxiang Cao, Yan Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Knowledge interconnection, which is a method from the point of knowledge discovery, plays an important role in many knowledge systems such as natural language query system and intelligence tutor system. The paper firstly discussed some kinds of interconnectivities of two closed-semantic statements with the form \leC,R,C'\ge by analyzing the properties of binary semantic relations and the implications among semantic relations. These implications can be acquired by using the attribute exploration algorithm in Formal Concept Analysis (FCA). And then the paper proposed an interactive interconnection algorithm, which is used to judge whether there exist meaningful interconnection factor between two statements.
Novel features for brain-computer interfaces
Authors: W. L. Woon, A. Cichocki
Venue: Computational Intelligence and Neuroscience (2007)

While conventional approaches of BCI feature extraction are based on the power spectrum, we have tried using nonlinear features for classifying BCI data. In this paper, we report our test results and findings, which indicate that the proposed method is a potentially useful addition to current feature extraction techniques.
Rough Set Theory Measures to Knowledge Generation
Authors: Yaile Caballero, Rafael Bello, Leticia Arco, Maria M. Garcia
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

The accelerated growth of the information volumes on processes, phenomena and reports brings about an increasing interest in the possibility of discovering knowledge from data sets. This is a challenging task because in many cases it deals with extremely large, inherently not structured and fuzzy data, plus the presence of uncertainty. Therefore it is required to know a priori the quality of future procedures without using any additional information. In this paper we propose new measures to evaluate the quality of training sets used by algorithms for learning of supervised classifiers. Our training set assessment relied on measures furnished by Rough Sets Theory. Our experimental results involved three classifiers (k-NN, C-4.5 and MLP) from international data bases. New training sets are built taking into account the results of the measures and the accuracy obtained by the classifiers, with the aim of infer the accuracy that the classifiers would obtain using a new training set. This is possible using a rule generator (C4.5) and a function estimation algorithm (k-NN).
Strong non-standard completeness for fuzzy logics
Authors: Tommaso Flaminio
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ultraproduct. Roughly speaking, to say that a logic 풞 is strong non-standard complete means that, for any countable theory &Gamma; over 풞 and any formula &Phi; such that &Gamma; \nvdash 풞&Phi;, there exists an evaluation e of 풞-formulas into a 풞-algebra 풜 such that the universe of 풜 is a non-Archimedean extension [0,1]* of the real unit interval [0,1], e is a model for &Gamma;, but e(&Phi;) < 1. Then we will apply SNSC to prove that various modal fuzzy logics allowing to deal with simple and conditional probability of infinite-valued events are complete with respect to classes of models defined starting from non-standard measures, that is measures taking value in [0,1]*.
Connection Pattern-Based P2P Application Identification Characteristic
Authors: Wang JinSong, Zhang Yan, Wu Qing, WU GongYi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

A new methodology for P2P (peer-to-peer) host recognition is present in the paper, in which the transport layer connection characteristics of P2P Protocols is used, since many P2P application hosts acting both as servers and clients in this layer. Here, BT (BitTorrent), one of the most popular and representative P2P application in China, is taken as the example. To capture the traffic of P2P applications and non-P2P applications, the tool Sniffer is used. The evaluation experiments confirmed that the characteristics of P2P applications present in this paper are feasible and effective to distinguish P2P application hosts and non-P2P application hosts.
The Fail-Heterogeneous Architectural Model
Authors: Marco Serafini, Neeraj Suri
Venue: Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems (2007)

Fault tolerant distributed protocols typically utilize a ho- mogeneous fault model, either fail-crash or fail-Byzantine, where all processors are assumed to fail in the same man- ner. In practice, due to complexity and evolvability rea- sons, only a subset of the nodes can actually be designed to have a restricted, fail-crash failure mode, provided that they are free of design faults. Based on this consideration, we propose a fail-heterogeneous architectural model for dis- tributed systems which considers two classes of nodes: (a) full-fledged execution nodes, which can be fail-Byzantine, and (b) lightweight, validated coordination nodes, which can only be fail-crash. To illustrate the model we intro- duce HeterTrust as a practical trustworthy service replica- tion protocol. It has a low latency overhead, requires few execution nodes with diversified design, and prevents in- truded servers from disclosing confidential data. We also discuss applications of the model to DoS attacks mitigation and to group membership.
Adapter Implementation between Wimax Specific Layers and Network/Application Layers
Authors: Tuomas Nissil, Jyrki Huusko, Ilkka Harjula, Marcos Katz
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Several recent studies show that future high data rate broadband wireless access (BWA) technologies require the use of adaptive and co-operative techniques to more efficiently utilise the resources in link and system level. In this paper we propose an adapter module to be utilised in the data link layer (DLL) and optionally in the application layer to serve different adaptive triggering routines among the networks. The adapter is used to retrieve the necessary information from hardware (HW) to aid different adaptation processes in system. The adapter is also used to trigger the preferred control and management actions in the media access control (MAC) and physical (PHY) level of the related HW. The usability and performance limits of the designed and implemented adapter solutions were measured with relevant performance evaluations and the derived results validate the feasibility of the proposed adapter solution.
Data Model and Virtual Database Engine for Grid Environment
Authors: Huang Wenlong, Li Xiaolin, Jiao Jixiang, Feng Yu, Xie Yi
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

There are many challenges of data sharing both in grid environment and traditional data integration domains, such as sharing between heterogeneous, distributed data sources. In grid environment, there are many specific features: limited data sharing, frequently changing data sources and large amounts of concurrent users. Under these conditions, it is strongly needed to provide more usable, more flexible system software and unique application programming interfaces to solve these problems. Vega Information Grid team has provided REVP data model and invented a flexible schema mapping tool employing reference technique to achieve these goals. In addition, performance in grid environment is especially important and needs some different optimization strategy. VIG has taken some optimization measures to improve the performance for distributed query. This paper elaborates the REVP data model and virtual database engine. Performance test shows that the query optimization measures are effective.
Robust self-tuning semi-supervised learning
Authors: Fei Wang, Changshui Zhang
Venue: Neurocomputing (2007)

We investigate the issue of graph-based semi-supervised learning (SSL). The labeled and unlabeled data points are represented as vertices in an undirected weighted neighborhood graph, with the edge weights encoding the pairwise similarities between data objects in the same neighborhood. The SSL problem can be then formulated as a regularization problem on this graph. In this paper we propose a robust self-tuning graph-based SSL method, which (1) can determine the similarities between pairwise data points automatically; (2) is not sensitive to outliers. Promising experimental results are given for both synthetic and real data sets.
A computational study of local search algorithms for Italian high-school timetabling
Authors: Pasquale Avella, Bernardo D'Auria, Saverio Salerno, Igor Vasil'Ev
Venue: Journal of Heuristics (2007)

In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy "hard" requirements, that are mandatory, and should minimize the violation of "soft" constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach.
Evaluation of a BIST Technique for CMOS Imagers
Authors: L. Lizarraga, S. Mir, G. Sicard
Venue: Proceedings of the 16th Asian Test Symposium (2007)

This paper evaluates a new Built-In-Self-Test (BIST) technique for CMOS imagers. The test stimuli are based on applying electrical pulses at the pixel photodiode anode in order to carry out a purely electrical test. The aim of this work is to eliminate some, if not all, optical tests of the pixel matrix to reduce time and cost during production testing at a wafer level. The quality of the BIST technique is evaluated by computing test metrics such as fault coverage for catastrophic and single parametric faults, and pixel fault acceptance and fault rejection under process deviations for two different pixel architectures.
Cross-Layer Design for QoS-Oriented Resource Allocation with Fairness Provision in IEEE 802.16 OFDMA Networks
Authors: Zhongbin Qin, Geng-Sheng (G. S. ). Kuo
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

This paper proposes a cross-layer design for resource allocation in IEEE 802.16 OFDMA networks, which aims to provide QoS guarantee and fairness for heterogeneous traffics with different channel conditions and priorities. First, QoS rate" is defined to characterize the instantaneous rate required for meeting the QoS constraints. Accordingly, the "QoS rate" requirements are processed following strict priority. At each priority level, the target of resource allocation is to minimize the resource consumption for maintaining the "QoS rate" constraints. Then, fairness is provided for the "non-QoS rate" requirements in terms of weight fairness and proportional fairness, respectively. The simulation results show that our approach ensures low QoS outage probabilities, as well as balances the tradeoff between resource efficiency and fairness.