ppxscal/embedding_network huggingface dataset:
Control of chaotic dynamics by linear resistive coupling
Authors: I. M. Kyprianidis, CH. Volos, I. N. Stouboulos
Venue: Proceedings of the 9th International Conference on Circuits (2005)

We have studied the dynamics of two resistively coupled Duffing-type electrical oscillators, when the oscillators are in different dynamic states (periodic and chaotic respectively). We demonstrate the suppression of chaotic behaviour, as the coupling strength between the oscillators increases. This suppression of chaos is observed via a reverse period-doubling route. Control of the chaotic behavior is achieved, in both coupled schemes, unidirectional and bidirectional.
Smoothing by mollifiers. Part II: nonlinear optimization
Authors: Hubertus Th. Jongen, Oliver Stein
Venue: Journal of Global Optimization (2008)

This article complements the paper (Jongen, Stein, Smoothing by mollifers part I: semi-infinite optimization J Glob Optim doi: 10.1007/s10898-007-9232-3 ), where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a level set of a single smooth function with certain regularity properties. In the special case of nonlinear programming this function is constructed as the mollification of the finite min-function which describes the feasible set. In the present article we treat the correspondences between Karush---Kuhn---Tucker points of the original and the smoothed problem, and between their associated Morse indices.
Fusion of aerial images and sensor data from a ground vehicle for improved semantic mapping
Authors: Martin Persson, Tom Duckett, Achim J. Lilienthal
Venue: Robotics and Autonomous Systems (2008)

This work investigates the use of semantic information to link ground level occupancy maps and aerial images. A ground level semantic map, which shows open ground and indicates the probability of cells being occupied by walls of buildings, is obtained by a mobile robot equipped with an omni-directional camera, GPS and a laser range finder. This semantic information is used for local and global segmentation of an aerial image. The result is a map where the semantic information has been extended beyond the range of the robot sensors and predicts where the mobile robot can find buildings and potentially driveable ground.
An extremal problem for subdivisions of K <stack>-5</stack>
Authors: W. Mader
Venue: Journal of Graph Theory (1999)

It is proved that every graph G with ‖G‖ &ge; 2|G| - 5, |G| &ge; 6, and girth at least 5, except the Petersen graph, contains a subdivision of K<sub>5</sub><sup>-</sup>, the complete graph on five vertices minus one edge. &copy; 1999 John Wiley Sons, Inc, J. Graph Theory 30: 261276, 1999
Using Policy-Based Management for Privacy-Enhancing Data Access and Usage Control in Grid Environments
Authors: Wolfgang Hommel
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Preventing the misuse of personally identifiable information and preserving user privacy are key issues in the management of IT services, especially when organizational borders are crossed. In this paper, we first present an analysis of the differences between Grid environments and previous models of inter-organizational collaboration. Based on requirements derived thereof, we demonstrate how existing policy-based privacy management architectures can be extended to provide Grid-specific functionality and can be integrated into existing infrastructures. Special emphasis is put on privacy policies which can be configured by users themselves, and distinguishing between the initial data access and the later data usage control phases. We also discuss the application of this approach to a XACML-based privacy management system.
Services and Contracts: Coalgebraically
Authors: Meng Sun
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

The popularity of service-oriented computing has not been accompanied by the necessary formalization of the notions being involved. This paper focuses on the development of a coalgebraic framework to support service-oriented application design. In this paper, the concepts are separated into three hierarchies - interfaces, contracts and services. Interfaces are specified by functors, and services are shown to be coalgebras of such functors, which should satisfy the axioms given in corresponding contracts. Different interfaces, contracts and services are related respectively by the morphisms between them. And the notion of bisimulation for services is derived from service morphisms, which captures the observational equivalence of services.
Towards Formalizing Resource Based Non-conformance in Business
Authors: Sean Thompson, Torab Torabi
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

The research presented in the literature thus far on process deviations, inconsistencies and general nonconformance have all been very generic, process wide methodologies. Their application has also been limited to one domain, such as the software, business or manufacturing process. In this paper we differentiate between activity/general process nonconformance and resource based non-conformance which we treat as different and the mechanism for testing is treated in a different way. This research is aimed at identifying instances of non-conformance between an instantiation of a generic process and its associated process model by examining only the resources specified and observed. We propose a conceptual design model illustrated with a simple case study on this topic which although is not based on a software engineering process, illustrate simply how our model can benefit a real world situation across many domains alongside software engineering.
Fault Tolerant Small-World Cellular Neural Networks
Authors: Katsuyoshi Matsumoto, Shingo Nomoto, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we propose Small-World Cellular Neural Networks (SWCNNs) featuring multiplex fault tolerant techniques. SWCNN is a Cellular Neural Networks in which cells are connected by small-world connections. SWCNN can easily process many multimedia applications such as image processing. However, SWCNN needs to be fault tolerant because it displays higher error propagations than traditional CNNs. We describe typical neural algorithms for image processing such as noise removal. Also, we propose a fault tolerant architecture for the CNN, using multiplexing. In embedded systems, this issue is important to reliability, compactness and power consumption, meaning new processor architecture is expected.
On the Security of VSH in Password Schemes
Authors: Kimmo Halunen, Pauli Rikula, Juha Röning
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In this paper we improve Saarinen's method for finding preimages of Very Smooth Hash (VSH) hash values and generalise it to some of the variants of VSH proposed by Contini et al. VSH is a new hash function that has been proved to be collision resistant under similar assumptions on the factoring of large integers as the RSA cipher. Saarinen has developed a method for finding preimages of VSH hash values and in his paper he gave an example of its application to 169-bit VSH and 4-character passwords consisting of lowercase alphabets. Because there were no results on the practical effectiveness of this approach with cryptographically significant security parameters, we give some results on the time and memory required to find the preimages of 8-character alphanumeric passwords secured by 1024-bit and 2048-bit VSH on quite modest hardware. In our study we implemented both the original VSH and the cubing variant of VSH. Our results show that both Saarinen's method and our method can find preimages of password hash values very quickly and that our method is faster in many cases. Our method also uses reusable tables that can be used to find the preimages of subsequent hash values faster than with the original method.
Cyber Criminal Activity Analysis Models using Markov Chain for Digital Forensics
Authors: Do Hoon Kim, Hoh Peter In
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Recognizing links between offender patterns is one of the most crucial skills of an investigator. Early recognition of similar patterns can lead to focusing resources, improving clearance rates, and ultimately saving lives in terms of digital forensics. In this paper we propose a forensics methodology using Markov chain during a given time interval for tracking and predicting the degree of criminal activity as it evolves over time. In other words, we describe intrusion scenario, and classify profiling of user’s behavior by prior probability based Markov chain. Also, we apply the Noise Page Elimination Algorithm (NPEA) to reduce an error of probability prediction. Finally, we have experimented on our model on dataset and have analyzed their accuracy by Monte Carlo Simulation.
Fabrication and characterization of plasmonic nanolens for applications in biophotonics
Authors: F. De Angelis, Gobind Das, C. Liberale, F. Mecarini, M. Matteucci, E. Di Fabrizio
Venue: Microelectronic Engineering (2008)

This paper reports on the fabrication and characterization of a novel device for surface enhanced Raman scattering, fabricated using focused ion beam milling and electron beam induced deposition. The device exploits a photonic crystal cavity as an optical source to couple the incident laser with a metallic tapered nanolenses. The collected Raman measurements show that exploiting such approach is possible to overcome the difficulties related to scattering and diffraction phenomena occurring when visible laser illuminates nano-structures. A clear Raman scattering enhancement has been demonstrated for label-free detection of molecule in sub-wavelength regime.
Bio-Inspired Adaboost Method for Efficient Face Recognition
Authors: Suman Sedai, Phill Kyu Rhee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

We present the design of face recognition system based on the Adaboost algorithm and bioinspired evolutionary search. We start by extracting the feature vector of the face image based on fixed fiducial points. Then we decompose the strong feature into several feature subsets using GA and classification models of each feature subsets are combined using the Adaboost algorithm. GA searches the best feature combination that gives minimum training error. We use the fixed feature decomposition method, where the length of the feature subset is constant. We use Gabor filter of 8 orientations and 8 frequencies to extract the feature of the face. Experiments are conducted on FERET database which contains 2418 images of 1209 subjects taking 2 images per subject. The outcome of these experiments suggests that the classification model using aggregation of feature combinations by means of Adaboost and GA gives better result than classification model that uses the entire feature vector.
IBM business transformation enabled by service-oriented architecture
Authors: L. Walker
Venue: IBM Systems Journal (2007)

This paper discusses the use of service-oriented architecture (SOA) as one of the key elements supporting business transformation at IBM. It describes the internal SOA strategy, SOA governance, organizational impacts, and several IBM internal SOA case studies. The top-down and bottom-up approaches to promoting SOA within the enterprise are also illustrated, along with a set of SOA business and information technology lessons learned.
On-the-fly race detection in multi-threaded programs
Authors: Ali Jannesari, Walter F. Tichy
Venue: Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging (2008)

Multi-core chips enable parallel processing for general purpose applications. Unfortunately, parallel programs may contain synchronization defects. Such defects are difficult to detect due to nondeterministic interleavings of parallel threads. Current tools for detecting these defects produce numerous false alarms, thereby concealing the true defects. This paper describes an extended race detection technique based on a combination of lockset analysis and the happens-before relation. The approach provides more accurate warnings and significantly reduces the number of false positives, while limiting the number of false negatives. The technique is implemented in Helgrind+, an extension of the open source dynamic race detector Helgrind. Experimental results with several applications and benchmarks demonstrate a significant reduction in false alarms at a moderate runtime increase.
Bringing Discrete Event Simulation Concepts into Multi-agent Systems
Authors: Daniele Gianni
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Agent-based Modelling (ABM) is a very efficacious conceptualisation paradigm that easily allows the representation of very complex physical systemscomposed of autonomous, possibly intelligent, interacting entities. For this reason, Agent-based systems (ABS) have been incorporated into simulation as a mean of effectively increasing the realism through adaptation and learning abilities. The integration between ABM and simulation, namely Agent-based Modelling and Simulation (ABMS), however, can be further exploited bymodelling the simulation system as a Multi Agent System (MAS). To achieve this, the first step is to provide ABSs with discrete event simulation (DES)concepts (simulation time and services) and an interaction protocol.In this paper, we present a formulation of DES in terms of MAS through the design of software framework, named SimJADE, for the ABMS.
PicoCube: a 1 cm3 sensor node powered by harvested energy
Authors: Yuen-Hui Chee, Mike Koplow, Michael Mark, Nathan Pletcher, Mike Seeman, Fred Burghardt, Dan Steingart, Jan Rabaey, Paul Wright, Seth Sanders
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The PicoCube is a 1 cm3 sensor node using harvested energy as its source of power. Operating at an average of only 6uW for a tirepressure application, the PicoCube represents a modular and integrated approach to the design of nodes for wireless sensor networks. It combines advanced ultra-low power circuit techniques with system-level power management. A simple packaging approach allows the modules comprising the node to fit into 1 cm3 in a reliable fashion.
Simple Joint Source-Channel Coding Schemes for Colored Gaussian Sources
Authors: Amir Ingber
Venue: Proceedings of the Data Compression Conference (2008)

The problem of transmitting k independent Gaussian sources with different variances over k additive white Gaussian channels is studied. Reference system and information theoretic bounds are surveyed, and linear joint source-channel coding (JSCC) schemes are constructed. It is shown that nonlinear schemes generally outperform the best linear schemes. Examples for such systems (involving nonlinear bandwidth expansion and reduction mappings) are given. Universal schemes that do not know the variances of the sources are also considered, and such a scheme is proposed. The performance of the proposed universal scheme is only a constant (about 4dB) away from the best linear scheme, for any selection of the source variances.
Algorithm 884: A Simple Matlab Implementation of the Argyris Element
Authors: Víctor Domínguez, Francisco-Javier Sayas
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

In this work we propose a new algorithm to evaluate the basis functions of the Argyris finite element and their derivatives. The main novelty here is an efficient way to calculate the matrix which gives the change of coordinates between the bases of the Argyis element for the reference and for an arbitrary triangle. This matrix is factored as the product of two rectangular matrices with a strong block structure which makes their computation very easy. We show and comment on an implementation of this algorithm in Matlab. Two numerical experiments, an interpolation of a smooth function on a triangle and the finite-element solution of the Dirichlet problem for the biLaplacian, are presented in the last section to check the performance of our implementation.
Helly-type theorems for approximate covering
Authors: Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Let F ∪ {U} be a collection of convex sets in Rd such that F covers U. We show that if the elements of F and U have comparable size, in the sense that each contains a ball of radius r and is contained in a ball of radius R for some fixed r and R, then for any ε > 0 there exists Hε ⊂ F, whose size |Hε| is polynomial in 1/ε and independent of |F|, that covers U except for a volume of at most ε. The size of the smallest such subset depends on the geometry of the elements of F; specifically, we prove that it is O(1/ε) when F consists of axis-parallel unit squares in the plane and Õ(ε1--d/2) when F consists of unit balls in Rd (here, Õ(n) means O(n log n) for some constant), and that these bounds are, in the worst-case, tight up to the logarithmic factors. We extend these results to surface-to-surface visibility in 3 dimensions: if a collection F of disjoint unit balls occludes visibility between two balls then a subset of F of size Õ(ε--7/2) blocks visibility along all but a set of lines of measure ε. Finally, for each of the above situations we give an algorithm that takes F and U as input and outputs in time O(|F|*|Hε|) either a point in U not covered by F or a subset Hε covering U up to a measure ε, with |Hε| satisfying the above bounds.
The effect of uncontrolled concurrency on model checking
Authors: Donna M. Carter, Ramazan Aygun, Glenn Cox, Mary Ellen Weisskopf, Letha Etzkorn
Venue: Concurrency and Computation: Practice Experience (2008)

Correctness of concurrent software is usually checked by techniques such as peer code reviews or code walkthroughs and testing. These techniques, however, are subject to human error, and thus do not achieve an in-depth verification of correctness. Model-checking techniques, which can systematically identify and verify every state that a system can enter, are a powerful alternative method for verifying concurrent systems. However, the usefulness of model checking is limited because the number of states for concurrent models grows exponentially with the number of processes in the system. This is often referred to as the &lsquo;state explosion problem.&rsquo; Some processes are a central part of the software operation and must be included in the model. However, we have found that some exponential complexity results due to uncontrolled concurrency introduced by the programmer rather than due to the intrinsic characteristics of the software being modeled. We have performed tests on multimedia synchronization to show the effect of abstraction as well as uncontrolled concurrency using the Promela-SPIN model checker. We begin with a sequential model not expected to have exponential complexity but that results in exponential complexity. In this paper, we provide alternative designs and explain how uncontrolled concurrency can be removed from the code. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A few examples go a long way: constructing query models from elaborate query formulations
Authors: Krisztian Balog, Wouter Weerkamp, Maarten de Rijke
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We address a specific enterprise document search scenario, where the information need is expressed in an elaborate manner. In our scenario, information needs are expressed using a short query (of a few keywords) together with examples of key reference pages. Given this setup, we investigate how the examples can be utilized to improve the end-to-end performance on the document retrieval task. Our approach is based on a language modeling framework, where the query model is modified to resemble the example pages. We compare several methods for sampling expansion terms from the example pages to support query-dependent and query-independent query expansion; the latter is motivated by the wish to increase "aspect recall", and attempts to uncover aspects of the information need not captured by the query. For evaluation purposes we use the CSIRO data set created for the TREC 2007 Enterprise track. The best performance is achieved by query models based on query-independent sampling of expansion terms from the example documents.
Automated detection of early lung cancer and tuberculosis based on X-ray image analysis
Authors: Kim Le
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

Early detection of lung cancer and tuberculosis is very important for successful treatment. Diagnosis is mostly based on X-ray images. Our current work focuses on finding nodules, early symptoms of the diseases, appearing in patients' lungs. We use a modified Watershed segmentation approach to isolate a lung of an X-ray image, and then apply a small scanning window to check whether any pixel is part of a disease nodule. Most of the nodules can be detected if process parameters are carefully selected. We are aiming at computerising these selections.
A compiler approach to managing storage and memory bandwidth in configurable architectures
Authors: Nastaran Baradaran, Pedro C. Diniz
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

Configurable architectures offer the unique opportunity of realizing hardware designs tailored to the specific data and computational patterns of an application code. Customizing the storage structures is becoming increasingly important in mitigating the continuing gap between memory latencies and internal computing speeds. In this article we describe and evaluate a compiler algorithm that maps the arrays of a loop-based computation to internal storage structures, either RAM blocks or discrete registers. Our objective is to minimize the overall execution time while considering the capacity and bandwidth constraints of the storage resources. The novelty of our approach lies in creating a single framework that combines high-level compiler techniques with lower-level scheduling information for mapping the data. We illustrate the benefits of our approach for a set of image/signal processing kernels using a Xilinx Virtex&trade; Field-Programmable Gate Array (FPGA). Our algorithm leads to faster designs compared to the state-of-the-art custom data layout mapping technique, in some instances using less storage. When compared to hand-coded designs, our results are comparable in terms of execution time and resources, but are derived in a minute fraction of the design time.