OpenRaiser/Intern-Atlas huggingface dataset:
Service Cloaking and Authentication at Data Link Layer
Venue: arXiv cs.NI 2008
Year: 2008

This paper discusses that there is significant benefit in providing stronger security at lower layers of the network stack for hosts connected to a network. It claims to reduce the attack vulnerability of a networked host by providing security mechanisms in a programmable Network Interface Card (NIC). Dynamic access control mechanisms are implemented in hardware to restrict access to the services provided, only to authenticated hosts. This reduces server vulnerability to various layer 2 attacks. Also the services will be immune to zero-day vulnerabilities due to the minimal code execution paths. To this end, it presents architecture and implementation details of a programmable network interface card equipped with these measures. It works alongside, and augments, existing security protocols making deployment practical.
Unmanned Aerial Vehicle Instrumentation for Rapid Aerial Photo System
Venue: arXiv cs.RO 2008
Year: 2008

This research will proposed a new kind of relatively low cost autonomous UAV that will enable farmers to make just in time mosaics of aerial photo of their crop. These mosaics of aerial photo should be able to be produced with relatively low cost and within the 24 hours of acquisition constraint. The autonomous UAV will be equipped with payload management system specifically developed for rapid aerial mapping. As mentioned before turn around time is the key factor, so accuracy is not the main focus (not orthorectified aerial mapping). This system will also be equipped with special software to post process the aerial photos to produce the mosaic aerial photo map
Optimal Tracking Controller Design for a Small Scale Helicopter
Venue: arXiv cs.RO 2008
Year: 2008

A model helicopter is more difficult to control than its full scale counterparts. This is due to its greater sensitivity to control inputs and disturbances as well as higher bandwidth of dynamics. This works is focused on designing practical tracking controller for a small scale helicopter following predefined trajectories. A tracking controller based on optimal control theory is synthesized as part of the development of an autonomous helicopter. Some issues in regards to control constraints are addressed. The weighting between state tracking performance and control power expenditure is analyzed. Overall performance of the control design is evaluated based on its time domain histories of trajectories as well as control inputs.
Design and Implementation of a Tracer Driver: Easy and Efficient Dynamic Analyses of Constraint Logic Programs
Venue: arXiv cs.SE 2008
Year: 2008

Tracers provide users with useful information about program executions. In this article, we propose a ``tracer driver''. From a single tracer, it provides a powerful front-end enabling multiple dynamic analysis tools to be easily implemented, while limiting the overhead of the trace generation. The relevant execution events are specified by flexible event patterns and a large variety of trace data can be given either systematically or ``on demand''. The proposed tracer driver has been designed in the context of constraint logic programming; experiments have been made within GNU-Prolog. Execution views provided by existing tools have been easily emulated with a negligible overhead. Experimental measures show that the flexibility and power of the described architecture lead to good performance. The tracer driver overhead is inversely proportional to the average time between two traced events. Whereas the principles of the tracer driver are independent of the traced programming language, it is best suited for high-level languages, such as constraint logic programming, where each traced execution event encompasses numerous low-level execution steps. Furthermore, constraint logic programming is especially hard to debug. The current environments do not provide all the useful dynamic analysis tools. They can significantly benefit from our tracer driver which enables dynamic analyses to be integrated at a very low cost.
Approximate Equilibria in Games with Few Players
Venue: arXiv cs.GT 2008
Year: 2008

We study the problem of computing approximate Nash equilibria (epsilon-Nash equilibria) in normal form games, where the number of players is a small constant. We consider the approach of looking for solutions with constant support size. It is known from recent work that in the 2-player case, a 1/2-Nash equilibrium can be easily found, but in general one cannot achieve a smaller value of epsilon than 1/2. In this paper we extend those results to the k-player case, and find that epsilon = 1-1/k is feasible, but cannot be improved upon. We show how stronger results for the 2-player case may be used in order to slightly improve upon the epsilon = 1-1/k obtained in the k-player case.
Feature Unification in TAG Derivation Trees
Venue: arXiv cs.CL 2008
Year: 2008

The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, feature-based regular tree grammars, and a translation from feature based tree adjoining grammars into this new formalism. The translation preserves the derivation structures of the original grammar, and accounts for feature unification.
Combining geometry and combinatorics: A unified approach to sparse signal recovery
Venue: arXiv cs.DM 2008
Year: 2008

There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach starts with a geometric constraint on the measurement matrix and then uses linear programming to decode information about the signal from its measurements. The combinatorial approach constructs the measurement matrix and a combinatorial decoding algorithm to match. We present a unified approach to these two classes of sparse signal recovery algorithms. The unifying elements are the adjacency matrices of high-quality unbalanced expanders. We generalize the notion of Restricted Isometry Property (RIP), crucial to compressed sensing results for signal recovery, from the Euclidean norm to the l_p norm for p about 1, and then show that unbalanced expanders are essentially equivalent to RIP-p matrices. From known deterministic constructions for such matrices, we obtain new deterministic measurement matrix constructions and algorithms for signal recovery which, compared to previous deterministic algorithms, are superior in either the number of measurements or in noise tolerance.
Study of improving nano-contouring performance by employing cross-coupling controller
Venue: arXiv cs.RO 2008
Year: 2008

For the tracking stage path planning, we design a two-axis cross-coupling control system which uses the PI controller to compensate the contour error between axes. In this paper, the stage adoptive is designed by our laboratory (Precision Machine Center of National Formosa University). The cross-coupling controller calculates the actuating signal of each axis by combining multi-axes position error. Hence, the cross-coupling controller improves the stage tracking ability and decreases the contour error. The experiments show excellent stage motion. This finding confirms that the proposed method is a powerful and efficient tool for improving stage tracking ability. Also found were the stages tracking to minimize contour error of two types circular to approximately 25nm.
Solving Time of Least Square Systems in Sigma-Pi Unit Networks
Venue: arXiv cs.NE 2008
Year: 2008

The solving of least square systems is a useful operation in neurocomputational modeling of learning, pattern matching, and pattern recognition. In these last two cases, the solution must be obtained on-line, thus the time required to solve a system in a plausible neural architecture is critical. This paper presents a recurrent network of Sigma-Pi neurons, whose solving time increases at most like the logarithm of the system size, and of its condition number, which provides plausible computation times for biological systems.
Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels
Venue: arXiv cs.IT 2008
Year: 2008

The problem of resource allocation is studied for two-sender two-receiver fading Gaussian interference channels (IFCs) and compound multiaccess channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at all transmitters and receivers. Under an average power constraint at each source, the sum-capacity of the C-MAC and the power policy that achieves this capacity is developed. The conditions defining the classes of strong and very strong ergodic IFCs are presented and the multicast sum-capacity is shown to be tight for both classes.
On the k-pairs problem
Venue: arXiv cs.IT 2008
Year: 2008

We consider network coding rates for directed and undirected $k$-pairs networks. For directed networks, meagerness is known to be an upper bound on network coding rates. We show that network coding rate can be $Θ(|V|)$ multiplicative factor smaller than meagerness. For the undirected case, we show some progress in the direction of the $k$-pairs conjecture.
The Gaussian Wiretap Channel with a Helping Interferer
Venue: arXiv cs.IT 2008
Year: 2008

Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the wireless medium. A Gaussian wire-tap channel with a helping interferer (WTC-HI) is considered in which a transmitter sends confidential messages to its intended receiver in the presence of a passive eavesdropper and with the help of an interferer. The interferer, which does not know the confidential message assists the confidential message transmission by sending a signal that is independent of the transmitted message. An achievable secrecy rate and a Sato-type upper bound on the secrecy capacity are given for the Gaussian WTC-HI. Through numerical analysis, it is found that the upper bound is close to the achievable secrecy rate when the interference is weak for symmetric interference channels, and under more general conditions for asymmetric Gaussian interference channels.
CMA-ES with Two-Point Step-Size Adaptation
Venue: arXiv cs.NE 2008
Year: 2008

We combine a refined version of two-point step-size adaptation with the covariance matrix adaptation evolution strategy (CMA-ES). Additionally, we suggest polished formulae for the learning rate of the covariance matrix and the recombination weights. In contrast to cumulative step-size adaptation or to the 1/5-th success rule, the refined two-point adaptation (TPA) does not rely on any internal model of optimality. In contrast to conventional self-adaptation, the TPA will achieve a better target step-size in particular with large populations. The disadvantage of TPA is that it relies on two additional objective function
From a set of parts to an indivisible whole. Part II: Operations in an open comparative mode
Venue: arXiv cs.OH 2008
Year: 2008

This paper describes a new method, HGV2C, for pattern analysis. The HGV2C method involves the construction of a computer ego (CE) based on an individual object that can be either a part of the system under analysis or a newly created object based on a certain hypothesis. The CE provides a capability to analyze data from a specific standpoint, e.g. from a viewpoint of a certain object. The CE is constructed from two identical copies of a query object, and its functioning mechanism involves: a hypothesis-parameter (HP) and infothyristor (IT). HP is a parameter that is introduced into an existing set of parameters. The HP value for one of the clones of a query object is set to equal 1, whereas for another clone it is greater than 1. The IT is based on the previously described algorithm of iterative averaging and performs three functions: 1) computation of a similarity matrix for the group of three objects including two clones of a query object and a target object; 2) division of the group into two alternative subgroups; and 3) a successive increase of the HP weight in the totality of all the parameters. Initially, both clones of the query object appear together in one of the subgroups as all of their parameter values, except the HP, are identical. At a certain point of the HP multiplication, one of the clones moves to the group of the target object. A respective number of the HP multiplications represents the dissimilarity (D) between the query and target objects. The product of D multiplied by the difference in HP values of the clones is strictly constant and linearly increases as the difference in HP values of the clones decreases. This new approach to knowledge representation is demonstrated on the example of population pyramids of 220 countries.
Phase transition in SONFIS&SORST
Venue: arXiv cs.AI 2008
Year: 2008

In this study, we introduce general frame of MAny Connected Intelligent Particles Systems (MACIPS). Connections and interconnections between particles get a complex behavior of such merely simple system (system in system).Contribution of natural computing, under information granulation theory, are the main topics of this spacious skeleton. Upon this clue, we organize two algorithms involved a few prominent intelligent computing and approximate reasoning methods: self organizing feature map (SOM), Neuro- Fuzzy Inference System and Rough Set Theory (RST). Over this, we show how our algorithms can be taken as a linkage of government-society interaction, where government catches various fashions of behavior: solid (absolute) or flexible. So, transition of such society, by changing of connectivity parameters (noise) from order to disorder is inferred. Add to this, one may find an indirect mapping among financial systems and eventual market fluctuations with MACIPS. Keywords: phase transition, SONFIS, SORST, many connected intelligent particles system, society-government interaction
Order to Disorder Transitions in Hybrid Intelligent Systems: a Hatch to the Interactions of Nations -Governments
Venue: arXiv cs.AI 2008
Year: 2008

In this study, under general frame of MAny Connected Intelligent Particles Systems (MACIPS), we reproduce two new simple subsets of such intelligent complex network, namely hybrid intelligent systems, involved a few prominent intelligent computing and approximate reasoning methods: self organizing feature map (SOM), Neuro-Fuzzy Inference System and Rough Set Theory (RST). Over this, we show how our algorithms can be construed as a linkage of government-society interaction, where government catches various fashions of behavior: solid (absolute) or flexible. So, transition of such society, by changing of connectivity parameters (noise) from order to disorder is inferred. Add to this, one may find an indirect mapping among financial systems and eventual market fluctuations with MACIPS.
3D Building Model Fitting Using A New Kinetic Framework
Venue: arXiv cs.CG 2008
Year: 2008

We describe a new approach to fit the polyhedron describing a 3D building model to the point cloud of a Digital Elevation Model (DEM). We introduce a new kinetic framework that hides to its user the combinatorial complexity of determining or maintaining the polyhedron topology, allowing the design of a simple variational optimization. This new kinetic framework allows the manipulation of a bounded polyhedron with simple faces by specifying the target plane equations of each of its faces. It proceeds by evolving continuously from the polyhedron defined by its initial topology and its initial plane equations to a polyhedron that is as topologically close as possible to the initial polyhedron but with the new plane equations. This kinetic framework handles internally the necessary topological changes that may be required to keep the faces simple and the polyhedron bounded. For each intermediate configurations where the polyhedron looses the simplicity of its faces or its boundedness, the simplest topological modification that is able to reestablish the simplicity and the boundedness is performed.
Pruning Attribute Values From Data Cubes with Diamond Dicing
Venue: arXiv cs.DB 2008
Year: 2008

Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to issue multidimensional queries. For example, an analyst may need to select not just the most profitable stores or--separately--the most profitable products, but simultaneous sets of stores and products fulfilling some profitability constraints. To fill this need, we propose a new operator, the diamond dice. Because of the interaction between dimensions, the computation of diamonds is challenging. We present the first diamond-dicing experiments on large data sets. Experiments show that we can compute diamond cubes over fact tables containing 100 million facts in less than 35 minutes using a standard PC.
SANA - Network Protection through artificial Immunity
Venue: arXiv cs.CR 2008
Year: 2008

Current network protection systems use a collection of intelligent components - e.g. classifiers or rule-based firewall systems to detect intrusions and anomalies and to secure a network against viruses, worms, or trojans. However, these network systems rely on individuality and support an architecture with less collaborative work of the protection components. They give less administration support for maintenance, but offer a large number of individual single points of failures - an ideal situation for network attacks to succeed. In this work, we discuss the required features, the performance, and the problems of a distributed protection system called SANA. It consists of a cooperative architecture, it is motivated by the human immune system, where the components correspond to artificial immune cells that are connected for their collaborative work. SANA promises a better protection against intruders than common known protection systems through an adaptive self-management while keeping the resources efficiently by an intelligent reduction of redundant tasks. We introduce a library of several novel and common used protection components and evaluate the performance of SANA by a proof-of-concept implementation.
Service Oriented Architecture in Network Security - a novel Organisation in Security Systems
Venue: arXiv cs.CR 2008
Year: 2008

Current network security systems are a collection of various security components, which are directly installed in the operating system. These check the whole node for suspicious behaviour. Armouring intrusions e.g. have the ability to hide themselves from being checked. We present in this paper an alternative organisation of security systems. The node is completely virtualized with current virtualization systems so that the operating system with applications and the security system is distinguished. The security system then checks the node from outside and the right security components are provided through a service oriented architecture. Due to the running in a virtual machine, the infected nodes can be halted, duplicated, and moved to other nodes for further analysis and legal aspects. This organisation is in this article analysed and a preliminary implementation showing promising results are discussed.
Sub-$μ$ structured Lotus Surfaces Manufacturing
Venue: arXiv cs.OH 2008
Year: 2008

Sub-micro structured surfaces allow modifying the behavior of polymer films or components. Especially in micro fluidics a lotus-like characteristic is requested for many applications. Structure details with a high aspect ratio are necessary to decouple the bottom and the top of the functional layer. Unlike to stochastic methods, patterning with a LIGA-mold insert it is possible to structure surfaces very uniformly or even with controlled variations (e.g. with gradients). In this paper we present the process chain to realize polymer sub-micro structures with minimum lateral feature size of 400 nm and up to 4 micrometers high.
Porous Alumina Based Capacitive MEMS RH Sensor
Venue: arXiv cs.OH 2008
Year: 2008

The aim of a joint research and development project at the BME and HWU is to produce a cheap, reliable, low-power and CMOS-MEMS process compatible capacitive type relative humidity (RH) sensor that can be incorporated into a state-of-the-art, wireless sensor network. In this paper we discuss the preparation of our new capacitive structure based on post-CMOS MEMS processes and the methods which were used to characterize the thin film porous alumina sensing layer. The average sensitivity is approx. 15 pF/RH% which is more than a magnitude higher than the values found in the literature. The sensor is equipped with integrated resistive heating, which can be used for maintenance to reduce drift, or for keeping the sensing layer at elevated temperature, as an alternative method for temperature-dependence cancellation.
Characterization and Modeling of an Electro-thermal MEMS Structure
Venue: arXiv cs.OH 2008
Year: 2008

Thermal functional circuits are an interesting and perspectivic group of the MEMS elements. A practical realization is called Quadratic Transfer Characteristic (QTC) element which driving principle is the Seebeck-effect. In this paper we present the analyses of a QTC element from different perspectives. To check the real behavior of the device, we measured a few, secondary properties of the structure which correspond to special behavior because these properties can not be easily derived from the main characteristics.
Measurement of Large Forces and Deflections in Microstructures
Venue: arXiv cs.OH 2008
Year: 2008

Properties of typical MEMS materials have been widely investigated. Mechanical properties of MEMS structures depend not only on the bulk material properties, but also structural factors. A measurement system has been made to measure force/deflection on microstructures to examine some of the structural properties. This is a stylus setup integrated with a load cell and a linear actuator. First, the requirements for the measurement system were established. Then the system was built up and characterized. We have successfully made measurements on a typical micromechanical structure, a cantilever accelerometer design. The stylus placement accuracy, the spring constant along the proof mass, analysis of the force/deflection curve shape and destructive tests on the cantilever have been investigated in our experiment and will be presented in this paper.