ppxscal/embedding_network huggingface dataset:
Distance-preserving pseudonymization for timestamps and spatial data
Authors: Florian Kerschbaum
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

The need for privacy in intrusion detection data, such as audit logs is widely recognized. The prevalent method for privacy protection in audit logs is pseudonymization (and suppression). There is a clear trade-off between the privacy of a pseudonymization technique and its utility for intrusion detection. E.g., for IP addresses a method for prefix preserving pseudonymization has been developed, that allows pseudonymized IP addresses to be still grouped into subnets. This paper describes a pseudonymization technique for timestamps that is distance preserving. I.e. given two pseudonymized timestamps one can compute the distance δ, if d is below or equal to an agreed threshold d and one cannot compute δif δ = 2d. We extend our technique for two dimensional spatial data, e.g. location of objects or persons. We also evaluate the privacy any such distance-preserving technique can provide for timestamps theoretically and on real-world log data.
A Co-evolutionary Differential Evolution Algorithm for Constrained Optimization
Authors: Bo Liu, Hannan Ma, Xuejun Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, a co-evolutionary differential evolution algorithm (CODE) for constrained optimization is proposed. Two cooperative populations are constructed and evolved by independent differential evolution (DE) algorithm. The purpose of the first population is to minimize the objective function regardless of constraints, and that of the second population is to minimize the violation of constraints regardless of the objective function. Interaction and migration happens between the two populations when separate evolutions go on several generations, by migrating feasible solutions into the first group, and infeasible ones into the second group. The algorithm is tested by five famous benchmark problems, and is compared with methods based on penalty functions and cooperative co-evolutionary genetic algorithm. The results proved the proposed cooperative CODE is very effective and efficient.
A new formulation of fringing capacitance and its application to the control of parallel-plate electrostatic micro actuators
Authors: Mehran Hosseini, Guchuan Zhu, Yves-Alain Peter
Venue: Analog Integrated Circuits and Signal Processing (2007)

Though the effect of fringing field in electrostatic parallel-plate actuators is a well-understood phenomenon, the existing formulations often result in complicated mathematical models from which it is difficult to determine the deflection of the moving plate for given voltages and hence, they are not suitable for accurate actuation control. This work presents a new formulation for tackling the fringing field, in which the effect of fringing field is modeled as a variable serial capacitor. Based on this model, a robust control scheme is constructed using the theory of input-to-state stabilization (ISS) and backstepping state feedback design. This method allows loosening the stringent requirements on modeling accuracy without compromising the performance. The stability and the performance of the system using this control scheme are demonstrated through both stability analysis and numerical simulation.
Visual form processing
Authors: Carlo Arcelli, Luigi P. Cordella, Gabriella Sanniti di Baja
Venue: Journal of Visual Languages and Computing (2007)

The paper shortly describes some methods proposed for visual form processing of 2D and 3D digital objects spanning from low to high-level vision. In particular, both contour-based and medial representations are described, as well as techniques for object decomposition, description and classification.
Pointwise convergence of cone-like restricted two-dimensional (C,1) means of trigonometric Fourier series
Authors: György Gát
Venue: Journal of Approximation Theory (2007)

The aim of this work is to generalize the more than 60 year old celebrated result of Marcinkiewicz and Zygmund on the convergence of the two-dimensional restricted (C,1) means of trigonometric Fourier series. They proved for any integrable function f@?L^1(T^2) the a.e. convergence@s"("n"""1","n"""2")f->fprovided n"1/@b@?n"2@?@bn"1, where @b>1 is fixed constant. That is, the set of indices (n"1,n"2) remains in some positive cone around the identical function. We not only generalize this theorem, but give a necessary and sufficient condition for cone-like sets (of the set of indices) in order to preserve this convergence property.
A Model-Driven Framework for Trusted Computing Based Systems
Authors: Masoom Alam, Jean-Pierre Seifert, Xinwen Zhang
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Existing approaches for Trust Management through soft- ware alone by their very principle are uncompromising and have inherent weaknesses. Once the information leaves the service provider platform, there is no way to guaran- tee the integrity of the information on the client (or service requestor) platform. The Trusted Computing Group pro- posed a quantum leap in security, a hardware based "root of trust" by which the integrity of a platform be a client or service provider can be verified. However, there is no approach for the integration of this novel but essentially straight forward concept into the distributed application de- velopment. We believe that the complexity of Trusted Com- puting (TC) is one of the key factors that will hinder its suc- cessful integration within the web services based distributed application realm. Model-driven techniques offer a promis- ing approach to alleviate the complexity of platforms. This contribution has three objectives. First, we detail SECTET a model-driven framework for leveraging TC concepts at a higher level of abstraction. We secondly elaborate the integration of platform-independent XACML policies with the platform-specific SELinux policies. Thirdly, we share our experiences regarding the implementation results of the SECTET on TC based systems.
Concurrent error detection in Reed-Solomon encoders and decoders
Authors: G. C. Cardarilli, S. Pontarelli, M. Re, A. Salsano
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Reed-Solomon (RS) codes are widely used to identify and correct errors in transmission and storage systems. When RS codes are used for high reliable systems, the designer should also take into account the occurrence of faults in the encoder and decoder subsystems. In this paper, self-checking RS encoder and decoder architectures are presented. The RS encoder architecture exploits some properties of the arithmetic operations in GF(2m). These properties are related to the parity of the binary representation of the elements of the Galois Field. In the RS decoder, the implicit redundancy of the received codeword, under suitable assumptions explained in this paper, allows implementing concurrent error detection schemes useful for a wide range of different decoding algorithms with no intervention on the decoder architecture. Moreover, performances in terms of area and delay overhead for the proposed circuits are presented.
Brief paper: Progressive accommodation of parametric faults in linear quadratic control
Authors: Marcel Staroswiecki, Hao Yang, Bin Jiang
Venue: Automatica (Journal of IFAC) (2007)

In this paper, a strategy based on the linear quadratic design, which progressively accommodates the feedback control law, is proposed. It significantly reduces the loss of performance that results from the time delay needed by fault accommodation algorithms to provide a solution. An aircraft example is given to illustrate the efficiency of progressive accommodation.
Differential of Fuzzy Functions with Two Variables and Fuzzy Wave Equations
Authors: Wen-ying Shi, Ai-bing Ji, Xiao-dong Dai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

In this paper, we will study the calculus of fuzzy- valued functions of two variables and then some properties are discussed,at last we give the solutions of the fuzzy wave equations. Key words: Partial derivative of fuzzy function with two variables; integral of fuzzy function; Differential of fuzzy function; fuzzy wave equation.
Private and Secure Service Discovery via Progressive and Probabilistic Exposure
Authors: Feng Zhu, Wei Zhu, Matt W. Mutka, Lionel M. Ni
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

The involvement of only the necessary users and service providers for service discovery in pervasive computing environments is challenging. Without prudence, users’ and service providers’ requests or service information, their identities, and their presence information may be sacrificed. We identify that the problem may be as difficult as a chicken-and-egg problem, in which both users and service providers want the other parties to expose sensitive information first. In this paper, we propose a progressive and probabilistic approach to solve the problem. Users and service providers expose partial information in turn and avoid unnecessary exposure if there is any mismatch. Although one or two bits of information are exchanged in each message, we prove that the process converges and that the false positive overhead decreases quickly. Experiments and hypotheses tests show that security properties hold. We implemented the approach and the performance measurements show that the approach runs efficiently on PDAs.
A first approach to web services for the National Water Information System
Authors: Jonathan L. Goodall, Jeffery S. Horsburgh, Timothy L. Whiteaker, David R. Maidment, Ilya Zaslavsky
Venue: Environmental Modelling Software (2008)

A wealth of freely available hydrologic data are provided by governmental organizations including in situ observations, geospatial data sets, remote sensing products, and simulation model output. Despite having access to this information, much of the data remain underutilized in the hydrologic sciences due in part to the time required to access, obtain, and integrate data from different sources. Web services offer a means for sharing hydrologic data more openly by providing a standard protocol for machine-to-machine communication. We have used this new technology to create a machine accessible interface for the National Water Information System (NWIS), an online repository of historical and real-time streamflow, water-quality, and ground water level observations maintained by the United States Geological Survey (USGS). These services provide a middle-layer of abstraction between the NWIS database and hydrologic analysis systems, allowing such analysis systems to proxy the NWIS server for on-demand data access. We intentionally designed the services to be generic and applicable to other hydrologic databases, in order to provide interoperability between disparate data sources. Performance tests showed that, for time series with less than 1000 observations, the web services layer added minimal overhead in terms of data response time, and development of an example client application for time series visualization highlighted some of the benefits and costs of using web services for data access.
Position dependencies in transcription factor binding sites
Authors: Andrija Tomovic, Edward J. Oakeley
Venue: Bioinformatics (2007)

Motivation: Most of the available tools for transcription factor binding site prediction are based on methods which assume no sequence dependence between the binding site base positions. Our primary objective was to investigate the statistical basis for either a claim of dependence or independence, to determine whether such a claim is generally true, and to use the resulting data to develop improved scoring functions for binding-site prediction. Results: Using three statistical tests, we analyzed the number of binding sites showing dependent positions. We analyzed transcription factor–DNA crystal structures for evidence of position dependence. Our final conclusions were that some factors show evidence of dependencies whereas others do not. We observed that the conformational energy (Z-score) of the transcription factor–DNA complexes was lower (better) for sequences that showed dependency than for those that did not (P < 0.02). We suggest that where evidence exists for dependencies, these should be modeled to improve binding-site predictions. However, when no significant dependency is found, this correction should be omitted. This may be done by converting any existing scoring function which assumes independence into a form which includes a dependency correction. We present an example of such an algorithm and its implementation as a web tool. Availability: http://promoterplot.fmi.ch/cgi-bin/dep.html Contact: edward.oakeley@fmi.ch Supplementary information: Supplementary data (1, 2, 3, 4, 5, 6, 7 and 8) are available at Bioinformatics online.
Genre as noise: noise in genre
Authors: Andrea Stubbe, Christoph Ringlstetter, Klaus U. Schulz
Venue: International Journal on Document Analysis and Recognition (2007)

Given a specific information need, documents of the wrong genre can be considered as noise. From this perspective, genre classification helps to separate relevant documents from noise. Orthographic errors represent a second, finer notion of noise. Since specific genres often include documents with many errors, an interesting question is whether this &#x201c;micro-noise&#x201d; can help to classify genre. In this paper we consider both problems. After introducing a comprehensive hierarchy of genres, we present an intuitive method to build specialized and distinctive classifiers that also work for very small training corpora. Special emphasis is given to the selection of intelligent high-level features. We then investigate the correlation between genre and micro noise. Using special error dictionaries, we estimate the typical error rates for each genre. Finally, we test if the error rate of a document represents a useful feature for genre classification.
Identification models of a one-dimensional space-time process
Authors: V. V. Skopetskii, V. A. Stoyan
Venue: Cybernetics and Systems Analysis (2007)

Problems of constructing linear and polynomially nonlinear mathematical models are solved for distributed space-time processes with discretely-continuously observable states under distributed space-time perturbations that create such states. The cases of exact and optimal (with respect to the mean-square criterion) identification of kernels of such models are considered. The identifiability conditions are specified for the process and accuracy conditions are established for its mathematical models.
Architecture of the Scalable Communications Core's Network on Chip
Authors: David Arditti Ilitzky, Jeffrey D. Hoffman, Anthony Chun, Brando Perez Esparza
Venue: IEEE Micro (2007)

The SCC is a flexible and energy- and area-efficient baseband processor for concurrent multiple wireless protocols. Its architecture consists of coarse-grained, heterogeneous, programmable accelerators connected via a packet-based, 3-ary 2-cube network on chip. The NoC supports goals of flexibility, scalability, and extensibility, and it meets stringent latency and throughput requirements.
Meeting lifetime goals with energy levels
Authors: Andreas Lachenmann, Pedro José Marrón, Daniel Minder, Kurt Rothermel
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In this paper we present Levels, a programming abstraction for energy-aware sensor network applications. Unlike most previous work it does not try to maximize network lifetime but rather helps to meet user-defined lifetime goals while maximizing application quality. Levels is targeted to applications where there is no redundancy and no node should fail early. With our programming abstraction the application developer defines so-called energy levels. These energy levels form a stack and can be deactivated from top to bottom if the lifetime goal cannot be met otherwise. Each code block within an energy level contains information about its energy consumption, which can be obtained from simulation tools without much effort. The runtime system then uses the data about the energy consumption of the different levels to compute an optimal level assignment for the time remaining. As we show in the evaluation, applications using Levels can accurately meet given lifetime goals and offer good application quality. In addition, the runtime overhead of our system is almost negligible.
Robust adaptive modified Newton algorithm for generalized eigendecomposition and its application
Authors: Jian Yang, Feng Yang, Hong-Sheng Xi, Wei Guo, Yanmin Sheng
Venue: EURASIP Journal on Advances in Signal Processing (2007)

We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from the proposed cost function and making use of an approximation of the Hessian matrix, a robust modified Newton algorithm is derived. A rigorous analysis of its convergence properties is presented by using stochastic approximation theory. We also apply this theory to solve the signal reception problem of multicarrier DS-CDMA to illustrate its practical application. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability, which are important in a practical time-varying communication environment.
Constructive Methods in Program Verification
Authors: B. Wegbreit
Venue: IEEE Transactions on Software Engineering (1977)

Most current approaches to mechanical program verification transform a program and its specifications into first-order formulas and try to prove these formulas valid. Since the first-order predicate calculus is not decidable, such approaches are inherently limited. This paper proposes an alternative approach to program verification: correctness proofs are constructively established by proof justifications written in an algorithmic notation. These proof justifications are written as part of the program, along with the executable code and correctness specifications. A notation is presented in which code, specifications, and justifications are interwoven. For example, if a program contains a specification 3x P(x), the program also contains a justification that exhibits the particulat value of x that makes P true. Analogously, justifications may be used to state how universally quantified formulas are to be instantiated when they are used as hypotheses. Programs so justifiled may be verified by proving quantifier-free formulas. Additional classes of justifications serve related ends. Formally, justifications reduce correctness to a decidable theory. Informally, justifications establish the connection between the executable code and correctness specifications, documenting the reasoning on which the correctness is based.
Novel fuzzy logic control based on weighting of partially inconsistent rules using neural network
Authors: Jae-Soo Cho, Dong-Jo Park
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

In this paper a new method of fuzzy logic control based on possibly inconsistent if-then rules representing uncertain knowledge or imprecise data is studied. In most cases of practical applications adopting fuzzy if-then rule bases, inconsistent rules have been considered as ill-defined rules and, thus, not allowed to be in the same rule base. When it is hard to obtain consistent rule bases, we propose a fuzzy logic controller based on weighted rules depending on output performances using the neural network and we will derive a weight updating algorithm. To guarantee convergence of the weights, a learning rate is developed by introducing a Lyapunov function. With the final weight change informations, we can make better decisions by taking into consideration conflicting rules. The proposed method is applied to simple problems and simulation results are included. And real application problems are also discussed.
Computer Description of Curved Objects
Authors: G. J. Agin
Venue: IEEE Transactions on Computers (1976)

A ranging system, consisting of a laser, computer-controlled optical deflection assembly, and TV camera, obtains three-dimensional images of curved solid objects. The object is segmented into parts by grouping parallel traces obtained from the ranging system. Making use of the property of generalized translational invariance, the parts are described in terms of generalized cylinders, consisting of a space curve, or axis, and a circular cross section function on this axis.
Intelligent technical analysis based equivolume charting for stock trading using neural networks
Authors: Thira Chavarnakul, David Enke
Venue: Expert Systems with Applications: An International Journal (2008)

It has been long recognized that trading volume provides valuable information for understanding stock price movement. As such, equivolume charting was developed to consider how stocks appear to move in a volume frame of reference as opposed to a time frame of reference. Two technical indicators, namely the volume adjusted moving average (VAMA) and the ease of movement (EMV) indicator, are developed from equivolume charting. This paper explores the profitability of stock trading by using a neural network model developed to assist the trading decisions of the VAMA and EMV. The generalized regression neural network (GRNN) is chosen and utilized on past S&P 500 index data. For the VAMA, the GRNN is used to predict the future stock prices, as well as the future width size of the equivolume boxes typically utilized on an equivolume chart, for calculating the future value of the VAMA. For the EMV, the GRNN is also used to predict the future value of the EMV. The idea is to further exploit the equivolume potential by using a forecasting system to predict the future equivolume measurements, allowing investors to enter or exit trades earlier. The results show that the stock trading using the neural network with the VAMA and EMV outperforms the results of stock trading generated from the VAMA and EMV without neural network assistance, the simple moving averages (MA) in isolation, and the buy-and-hold trading strategy.
Aladdin: Assembly Language Assertion Driven Debugging Interpreter
Authors: R. E. Fairley
Venue: IEEE Transactions on Software Engineering (1979)

ALADDIN is an interactive facility for debugging and testing of assembly language programs. ALADDIN differs from traditional debuggers by allowing the user to specify breakpoint assertions, rather than breakpoint locations. Assertions are logical relations among various components of the program state. If an assertion becomes false during execution of the object program a breakpoint is executed and control is passed to the user's terminal. ALADDIN can also be used as a testing tool to verify that asserted behavior matches actual behavior under various sets of input data and test conditions.
Applying Formal Specification to Software Development in Industry
Authors: I. J. Hayes
Venue: IEEE Transactions on Software Engineering (1985)

This paper reports experience gained in applying formal specification techniques to an existing transaction processing system. The system is the IBM Customer Information Control System (CICS) and the work has concentrated on specifying a number of modules of the CICS application programmer's interface.