ppxscal/embedding_network huggingface dataset:
Detection of hydrocarbon bearing sand through remote sensing techniques in the western slope zone of Songliao basin, China
Authors: G. F. Zhang, X. H. Shen, L. J. Zou, C. J. Li, Y. L. Wang, S. L. Lu
Venue: International Journal of Remote Sensing (2007)

To detect oil-bearing sand in the western slope zone of Songliao Basin, China, a Landsat-7 Enhanced Thematic Mapper Plus (ETM+) image was used to identify anomalous areas caused by hydrocarbon leakage. Enhancement of the image involved three techniques including Principal Component Analysis (PCA), band ratioing and False Colour Composition (FCC). In this paper, experimental work gives a detailed PCA description of different band combinations. The best four principal components (PCs)-1345-PC3 (the third PC image of the PCA on band 1, 3, 4, 5), 1357-PC3, 2357-PC3 and 3457-PC4-were selected for FCC combined with band ratio layers. Based on the tonal characteristics of the existing bores and the basin boundary, differentiation of target areas in the four FCC images was achieved. Results indicated that anomalies are expressed as a halo in fuscous tone and located in the basin margin with an area of 70∼100 km2. Examination of the Ce/La ratio showed that the tonal anomalies are evidently associated with a reducing environment.
Optimization of a Kraft Pulping System: Using Particle Swarm Optimization and Differential Evolution
Authors: Millie Pant, Radha Thangaraj, Ajith Abraham
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Expectation of profit is the economic driving force motivating business activity in a free-enterprise economy. An increase in this profit for a given organization can be accomplished by discovering and following any of a number of courses of improved action. This paper presents an economic optimization of a hypothetical but realistic Kraft pulping system, which forms an integral part of a Pulp and Paper industry, using Particle Swarm Optimization (PSO) and Differential Evolution (DE). Simulation results obtained are comparable (and are slightly better) with the given results which show that these algorithms are quite competent for solving large scale industrial optimization problems in a very small time
Time-constrained loop scheduling with minimal resources
Authors: Timothy W. O'Neil, Edwin H.-M. Sha
Venue: Journal of Embedded Computing (2006)

Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a new technique, extended retiming, which can be combined with minimal unfolding to transform a DFG into one which is rate-optimal. The result, however, is a DFG with split nodes, a concise representation for pipelined schedules. This model and the extraction of the pipelined schedule it represents have heretofore not been explored. In this paper, we develop new results regarding the construction of such graphs. We develop scheduling algorithms for such graphs, and then discuss a way to reduce the hardware requirements of such schedules. In the process, we state and prove a tight upper bound on the minimum number of processors required to execute the static schedule produced by our algorithms. We also construct an unfolding algorithm for split-node graphs and combine it with our scheduling methods to achieve rate-optimality in all cases. Finally, we demonstrate our methods on a specific example.
MetroNet: Case Study for Collaborative Data Sharing on the World Wide Web
Authors: Robert F. Dickerson, Jiakang Lu, Jingyuan Li, Billy Chantree, Jian Lu, John A. Stankovic, Kamin Whitehouse
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We demonstrate MetroNet, which is an application that illustrates collaborative data sharing on the Wide Wide Web. MetroNet has two parts. First, our sensors gather data about pedestrian foot traffic in front of and into stores, which is made available online to shopkeepers. Second, this sensor data can be made public, at the discretion of the shopkeeper, for use by city planners, other shopkeepers, or residents of the city. MetroNet is an application through which we study fundamental problems of sharing data on the Web, such as search, data fusion, and privacy.
Solutions of fuzzy equations based on Kaucher arithmetic and AE-solution sets
Authors: T. Rzeżuchowski, J. Wasowski
Venue: Fuzzy Sets and Systems (2008)

We introduce and investigate two new types of fuzzy solutions to the equation f(a,x)=b where the parameters a and b are described in a fuzzy way. The solutions we propose are based on some known solutions to this type of equation with the parameters described by the interval data. We adapt to the fuzzy case so-called formal interval solutions (based on the Kaucher interval arithmetic) and AE-solution sets. In order to define fuzzy formal solutions we introduce a definition of fuzzy Kaucher arithmetic. We investigate the regularity of solutions in the case of linear dependence of f on a and discuss also the problem of interpretation and logical description of formal solutions.
Anonymous Routing for Mobile Wireless Ad Hoc Networks
Authors: Arjan Durresi, Vamsi Paruchuri, Mimoza Durresi, Leonard Barolli
Venue: International Journal of Distributed Sensor Networks (2007)

Wireless Mobile Ad Hoc Networks are particularly vulnerable due to their fundamental characteristics such as an open medium, dynamic topology, distributed cooperation, and constrained capability. Location information of nodes can be critical in wireless ad hoc networks, especially in those deployed for military purposes. In this paper, we present two Protocols for anonymous routing to prevent location disclosure attacks. The Protocol for Anonymous Routing (PAR) guarantees absolute anonymity, which itself might cause problems as it would become hard to identify malicious and misbehaving nodes. PAR-Enhanced trades off some anonymity to enable detection of malicious and misbehaving nodes.
Considerations Towards a Cyber Crime Profiling System
Authors: Kweku K. Arthur, Martin S. Olivier, Hein S. Venter, Jan H. P. Eloff
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The field of digital forensics is faced with a number of challenges, given the constant growth in technologies. The reliability and integrity associated with digital evidence from disparate sources is also a perpetual challenge, requiring considerable human interpretation in the reconstruction of any particular sequence of events. In this paper we present a framework for an integrity-aware Forensic Evidence Management System (FEMS). In an effort to automatethe analysis process, this system would provide investigators with a holistic view of the forensic evidence at hand; thereby providing insights into the quality of investigative inferences. The Biba integrity model is incorporated to preserve the integrity of digital evidence, while Casey’s Certainty Scale is chosen as the integrity classification scheme. A finite state automaton (FSA) is used to model the behaviour of the FEMS. In so doing, cyber crime profiling is achieved.
Querying and re-using workflows with VsTrails
Authors: Carlos E. Scheidegger, Huy T. Vo, David Koop, Juliana Freire, Claudio T. Silva
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

We show how work flow systems can be augmented to leverage provenance information to enhance usability. In particular, we will demonstrate new mechanisms and intuitive user interfaces designed to allow users to query work flows by example and to refine work flows by analogies. These techniques are implemented in VisTrails, an open-source provenance-enabled scientific work flow system that can be combined with a wide range of tools, libraries, and visualization systems. We will show di erent scenarios where these techniques can be used to simplify the notoriously hard tasks of creating and refining work flows.
Excitation of hypersound in n-GaN films
Authors: F. Diaz, V. Grimalsky, M. Tecpoyotl, J. Escobedo, S. Koshevaya
Venue: Microelectronics Journal (2008)

The aim of this paper is the analysis of hypersound excitation in GaN films. Simulation of process is presented for a case of a thin film geometry on a non-piezoelectric substrate. The frequency range considered is from 50GHz up to 200GHz. The excitation is due to coupling with space charge waves (SCWs) in GaN film. The amplification of SCWs is related with negative differential conductivity in GaN films. Possible spatial increments are obtained. The amplified SCWs can excite hypersonic waves at the same frequency due to piezoeffect and deformation potential mechanisms. The first effect is stronger and causes an effective resonant excitation of hypersonic waves in the case of full mechanic contact of GaN film and non-piezoelectric substrate.
Process Variation Aware Timing Optimization through Transistor Sizing in Dynamic CMOS Logic
Authors: Kumar Yelamarthi, Chien-In Henry Chen
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

A major challenge in the design of microprocessor circuits is transistor sizing in dynamic CMOS logic due to increased number of channel-connected transistors on various paths of the design, and increased magnitude of process variations in the nanometer process. This paper proposes a process variation aware transistor sizing algorithm for dynamic CMOS logic. The efficiency of this algorithm is illustrated first by a 2-b weighted binary-to-thermometric converter, of which the critical path delay was optimized from 355 to 157 ps which accounts for a 55.77% delay improvement, and the delay uncertainty due to process variation was optimized by 60.75%. A 4-b unity weight binary-to-thermometric converter was also optimized, of which the critical path delay was reduced from 152 to 103 ps which accounts for a 32.23% delay improvement, and delay uncertainty was optimized by 63.6%. Applying the proposed timing optimization algorithm to a mixed-dynamic-static CMOS 64-bit adder, the critical path delay and the power-delay-product were optimized to 632 ps and 84.17 pJ, respectively.
Redefining the Server as Home Networks Emerge
Authors: Greg Goth
Venue: IEEE Internet Computing (2008)

The mechanics of storing and retrieving disparate data formats in residential/SOHO networks are compelling more analysts and technologists to rethink what a server is, what tasks it should accomplish, and how the inherent complexity in designing, building, and marketing it must be reduced.
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
Authors: Salah A. Aly, Zhenning Kong, Emina Soljanin
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We consider large-scale networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet and the original k source packets can be recovered later in a computationally simple way from any (1 + \varepsilon)k nodes for some small \varepsilon > 0. We developed two distributed algorithms for solving this problem based on simple random walks and Fountain codes. Unlike all previously developed schemes, our solution is truly distributed, that is, nodes do not know n, k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables. In the first algorithm, all the sensors have the knowledge of n and k. In the second algorithm, each sensor estimates these parameters through the random walk dissemination. We present analysis of the communication/transmission and encoding/decoding complexity of these two algorithms, and provide extensive simulation results as well.
FFH and MCFH spread-spectrum wireless sensor network systems based on the generalized approach to signal processing
Authors: Jongho Kim, Jae Hyun Kim, Vyacheslav Tuzlukov, Won Sik Yoon, Yong Deak Kim
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper, the performance of frequency-hopping spread-spectrum wireless sensor network systems based on the generalized approach to signal processing in the presence of noise [1-5], which employ non-coherent reception and transmission diversity, is analyzed for frequency-selective Rayleigh fading channels. Two different types of transmission diversity systems, a fast frequency-hopping (FFH) [6,7] and a multicarrier frequency-hopping (MCFH)[8] wireless sensor network systems, are investigated. In order to combine received signals from transmit diversity channels, the diversity combining rule based on the generalized approach to signal processing is developed. Probability of error equations are derived and utilized to evaluate the performance of two kinds of wireless sensor network systems. The effect of frequency-selective fading is also investigated in determining optimum frequency deviations of binary frequency-shift keying (BFSK) signals. The systems considered in this paper are frequency-hopping spread-spectrum (FHSS) ones with BFSK modulation, noncoherent detection, and definite diversity order. Diversity order refers to the number of hops per symbol for FFH and the number of subbands for MCFH wireless sensor network systems. Each transmit diversity channel is modeled as a frequency-selective Rayleigh fading process and is assumed to be independently faded. The maximum delay spread of each diversity reception is assumed smaller than one hop duration for FFH wireless sensor network systems, which is smaller than the symbol duration. It is also assumed that one symbol is transmitted during one hop duration in MCFH wireless sensor network systems, and adjacent symbols in time are transmitted in far distant frequency slot such that multipath interference from the previous symbol is negligible.
Finding Similar Answers in Data-Centric Sensor Networks
Authors: I-Fang Su, Yu-Chi Chung, Chiang Lee
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Intensive study has been dedicated to wireless sensor networks and their applications in the last few years. However, similarity search problem in sensor network environments seems to have not attracted the deserved attention. In fact, sensor detected data are very likely imprecise due to the simplified hardware of the sensor itself and various environmental factors. Hence, queries requesting for similar result should be an often scenario and an important problem to resolve. In this paper, we propose a Similarity Search Algorithm (SSA) for efficiently processing similarity search queries. We first present a data-centric storage structure based on the concept of Hilbert curve. Then, we propose an algorithm designed for efficiently probing the most similar data item for the sensor network. The performance study reveals that this mechanism is highly efficient and significantly outperforms other approaches in processing similarity search queries.
A multi-commodity flow approach to maximising utility in linked market-based grids
Authors: James Broberg, Rajkumar Buyya
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtualise and make available the resources of multiple service providers, achieving greater economies of scale, improving throughput and potentially reducing cost. Customers compete against each other by assigning a utility value or function to the successful processing of their jobs in an effort to have them prioritised in the face of contested and constrained resources. Brokers and service providers also attempt to maximise the utility they gain, choosing to process jobs that will earn them the highest profit with respect to the resources required. For this to be effective over many linked computing marketplaces highly distributed resource allocation is needed, where each participant can operate independently using only local information, and ideally reach a global state where all participants are satisfied. We model such a system by adapting the classical multi-commodity flow problem to the market-based, utility driven distributed systems, where all participants selfishly attempt to maximise their own gain. We then obtain a utility-aware distributed algorithm that generates increased utility for participants in such systems, especially under scenarios of high contention.
Optical Flow and Advection on 2-Riemannian Manifolds: A Common Framework
Authors: Julien Lefèvre, Sylvain Baillet
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Dynamic pattern analysis and motion extraction can be efficiently addressed using optical flow techniques. This article presents a generalization of these questions to non-flat surfaces, where optical flow is tackled through the problem of evolution processes on non-Euclidian domains. The classical equations of optical flow in the Euclidian case are transposed to the theoretical framework of differential geometry. We adopt this formulation for the regularized optical flow problem, prove its mathematical well-posedness and combine it with the advection equation. The optical flow and advection problems are dual: a motion field may be retrieved from some scalar evolution using optical flow; conversely, a scalar field may be deduced from a velocity field using advection. These principles are illustrated with qualitative and quantitative evaluations from numerical simulations bridging both approaches. The proof-of-concept is further demonstrated with preliminary results from time-resolved functional brain imaging data, where organized propagations of cortical activation patterns are evidenced using our approach.
A Framework for Timely Process Information Convergence from Heterogeneous Units in Dual-shore Software Outsourcing
Authors: Hua Hu, Haobin Zhang, Haiyang Hu, Bin Xu, Juefeng Li, Albert Ma
Venue: Proceedings of the 2007 International Conference on Convergence Information Technology (2007)

When in dual-shore software outsourcing, the working units are geographically distributed and each has unique management framework, procedure and security requirement. Timely business information convergence is necessary for the collaboration but difficult to achieve in such environment. A framework is proposed to adaptively collect the process information in dual-shore software outsourcing and to timely share the information among these heterogeneous working units. The further information analysis is also enabled, which may enhance the timely collaboration and decision making.
Multilayered 3D LiDAR Image Construction Using Spatial Models in a Bayesian Framework
Authors: Sergio Hernandez-Marin, Andrew M. Wallace, Gavin J. Gibson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Standard 3D imaging systems process only a single return at each pixel from an assumed single opaque surface. However, there are situations when the laser return consists of multiple peaks due to the footprint of the beam impinging on a target with surfaces distributed in depth or with semi-transparent surfaces. If all these returns are processed, a more informative multi-layered 3D image is created. We propose a unified theory of pixel processing for Lidar data using a Bayesian approach that incorporates spatial constraints through a Markov Random Field with a Potts prior model. This allows us to model uncertainty about the underlying spatial process. To palliate some inherent deficiencies of this prior model, we also introduce two proposal distributions, one based on spatial mode jumping, the other on a spatial birth/death process. The different parameters of the several returns are estimated using reversible jump Markov chain Monte Carlo (RJMCMC) techniques in combination with an adaptive strategy of delayed rejection to improve the estimates of the parameters.
A Formal Specification of a Programming Language: Design of Pit
Authors: Leif Pedersen, Hassan Reza
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Formal specifications and supporting tools have shown to be very effective to improve the quality and correctness of a software system. A compiler is large and complex software; it takes as input a program written in some language and generates as output a program in another language. One of the main characteristics of any compiler is to preserve the semantics of the program being compiled. Therefore, developing correct compilers that can generate faithful target code without introducing any errors is critically important. In this paper, we show how to use Z notation to formally specify part of the Pit, which is a general-purpose programming language that we are currently developing. The main idea behind Pit is to create a language where the programmer can choose between allocating memory manually by using statically-typed "primitive variables or allowing the compiler to insert memory management code automatically by using dynamically-typed "auto variables. This feature, in turn, allows a programmer to choose between automatically ensuring that there are no buffer overrun or integer overflow vulnerabilities in the code.
Copyright marked digital images: protection and verification
Authors: Qiu Guan, Xin-Li Xu, Wan-Liang Wang, S. Y. Chen
Venue: Proceedings of the 4th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision (2004)

Copyright protection of Internet images is very important in the new century and digital watermark is proved one of valid and efficient methods for realizing this technique. This paper proposes a novel method to incorporate a secret watermark into common images. A digital watermarking algorithm is developed to combine a gray hidden image with any other pictures based on two-dimensional discrete wavelet transform and Fourier transform. The method contains two related parts. One is to embed the watermark image into a cover picture and the other is to test and extract the watermark from a given image. For the first part, the image is transformed into discrete wavelet domain and the transformed frequency image is split in horizontal and vertical direction to form four sub-band subplots. The LL subplot is selected as the watermark embedding area and split into sub-block. And then every sub-block is transformed into discrete Fourier domain. Based on the feature of human visual system and edge analysis, the watermarking components with different strength, which is disorderly dealt with, are embedded into the cover picture. In the second part, the secret image is obtained by inverse transform of wavelet and Fourier. The experiments are demonstrated that the algorithm is very robust and the visual effect of resulting images can stand for test.
Improving the performance of the robust controller for a robot arm
Authors: S. Torres, J. A. Méndez, L. Acosta, J. N. Rodríguez
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

The aim of this work is to present a new robust control scheme for articulated robotic systems. The standard robust controllers use fixed parameters that may perform poorly in some circumstances. Adding an adaptive law for the robust parameters, the performance of the closed-loop system is better. This paper presents some results of this strategy applied on a two-link robot arm. They are compared with the results obtained with the standard robust controller.