ppxscal/embedding_network huggingface dataset:
Proving Infinitude of Prime Numbers Using Binomial Coefficients
Authors: Phuong Nguyen
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some "minimal" reasoning (i.e., in the theory IΔ 0 ) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand's Postulate (that there is at least a prime number between n and 2n, for all n > 1) and the fact that the number of prime numbers between n and 2n is of order ¿(n/ln (n)). The proofs that we formalize are much simpler than several existing formalizations, and our theory turns out to be a sub-theory of a recent theory proposed by Woods and Cornaros that extends IΔ 0 by a special counting function.
Recognizing Facial Expressions: A Comparison of Computational Approaches
Authors: Aruna Shenoy, Tim M. Gale, Neil Davey, Bruce Christiansen, Ray Frank
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Recognizing facial expressions are a key part of human social interaction,and processing of facial expression information is largely automatic, but it is a non-trivial task for a computational system. The purpose of this work is to develop computational models capable of differentiating between a range of human facial expressions. Raw face images are examples of high dimensional data, so here we use some dimensionality reduction techniques: Linear Discriminant Analysis, Principal Component Analysis and Curvilinear Component Analysis. We also preprocess the images with a bank of Gabor filters, so that important features in the face images are identified. Subsequently the faces are classified using a Support Vector Machine. We show that it is possible to differentiate faces with a neutral expression from those with a smiling expression with high accuracy. Moreover we can achieve this with data that has been massively reduced in size: in the best case the original images are reduced to just 11 dimensions.
High-Level Modeling of UWB PHY for IEEE802.15.4a
Authors: Min-Su Kim, HoJun Kim, Jong Tae Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Wireless personal area networks (WPAN) systems for the communication in the indoor environment have been developed according to the growth of the ubiquitous technology. IEEE 802.15.4a is a standard which describes the indoor communication systems for the ultra-low complexity and power consumption. Implementation of PHY for IEEE 802.15.4a employs ultra-wide band (UWB) technologies which have the advantage of accuracy as compared with other communication systems because it uses discrete impulse signal. In this paper, it focuses on developing MATLAB models for IEEE 802.15.4a standard and the performance evaluation of these models. Implementation of UWB PHY using MATLAB is important to design the commercial modem by performance verification for various communication environments. From the performance analysis with simulation results by adding additive white Gaussian channel (AWGN) noise, the rationality of this model is verified.
Improving performance by embedding HPC applications in lightweight Xen domains
Authors: Samuel Thibault, Tim Deegan
Venue: Proceedings of the 2nd workshop on System-level virtualization for high performance computing (2008)

Although they allow easy and cost-effective use of a wide range of machines, the programming interface and behavior of general-purpose Operating Systems (OS) often fail to meet, or even conflict with, the specific desires of High-Performance Computing (HPC) applications, such as low preemption or control over memory and I/O management. That often leads to poor performance. On the other hand, hypervisors are more and more commonly used on top of those OSes for various reasons, such as ease of dedicated environment deployment or load balancing. In contrast to the usual unix process model, hypervisors provide their guests with kernel-level facilities. In this paper, we show how an HPC application and its execution environment can be embedded within a lightweight guest domain, alongside a domain that runs a conventional OS which is only used for administrative purpose. That permits the execution environment to take advantage of kernel-level facilities to improve performance, which would be hard to achieve in the traditional process model because of lack of support or excessive overhead.
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Authors: Evangelos Kranakis, Michel Paquette, Andrzej Pelc
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio stations with the same communication range, distributed in a random uniform way on a unit square region. In order to capture fault dependencies, we introduce the ranged spot model in which damaging events, called spots, occur randomly and independently on the region, causing faults in all nodes located within distance s from them. Node faults within distance 2s become dependent in this model and are positively correlated. We investigate the impact of the spot arrival rate on the feasibility and the time of communication in the fault-free part of the network. We provide an algorithm which broadcasts correctly with probability 1 ¿ ¿ in faulty random geometric radio networks of diameter D in time O(D + log1/¿).
Hybrid MAS GIS Coastal Systems Modeling Methodology
Authors: Dominique Urbani, Marielle Delhom
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Submitted to the combination of a growing anthropogenic pressure, pollution and the increase of health required standards, the costal and ponds' ecosystems are endangered involving the decline of traditional sea activities. In this paper we present a methodology to build a distributed artificial intelligent based model dedicated to interactions between watershed and activities in coastal areas. Organizing the coastal systems into a hierarchy, following a multi-agents approach, we build a generic model of each system's stakeholder. We focus on modeling the influences of the watershed activities on sea farming. Using a geographic information system, we explicit how to take advantages of the spatiotemporal ground data to fit the simulations to the specificities of each targeted site.
A Novel Artificial Mosaic Generation Technique Driven by Local Gradient Analysis
Authors: Sebastiano Battiato, Gianpiero Blasi, Giovanni Gallo, Giuseppe Claudio Guarnera, Giovanni Puglisi
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Art often provides valuable hints for technological innovations especially in the field of Image Processing and Computer Graphics. In this paper we present a novel method to generate an artificial mosaic starting from a raster input image. This approach, based on Gradient Vector Flow computation and some smart heuristics, permit us to follow the most important edges maintaining at the same time high frequency details. Several examples and comparisons with other recent mosaic generation approaches show the effectiveness of our technique.
Checking Brain Expertise Using Rough Set Theory
Authors: Andrzej W. Przybyszewski
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Most information about the external world comes from our visual brain. However, it is not clear how this information is processed. We will analyze brain responses using machine learning methods based on rough set theory. We will test the expertise of the visual area V4, which is responsible for shape classifications. Characteristic of each stimulus are treated as a set of learning attributes. We assume that bottom-up information is related to hypotheses, while top-down information is related to predictions. Therefore, neuronal responses are divided into three categories. Category 0 occurs if cell response is below 20 spikes/s (sp/s), indicating that the hypothesis is not valid. Category 1 occurs if cell activity is higher than 20 spikes, implying the hypothesis is valid. Category 2 occurs if cell response is above 40 sp/s; in this case we conclude that the hypothesis and prediction are valid. By using experimental data we make a decision table for each cell, and generate equivalence classes. We express the brains basic concepts by means of the learners basic categories. By approximating stimulus categories with concepts of different cells we determine core properties of cells, and differences between them. On this basis we have created profiles of their receptive field properties.
Schema driven assignment and implementation of life science identifiers (LSIDs)
Authors: Sapna Bafna, Julian Humphries, Daniel P. Miranker
Venue: Journal of Biomedical Informatics (2008)

Life science identifier (LSID) is a global unique identifier standard intended to help rationalize the unique archival requirements of biological data. We describe LSID implementation architecture such that data managed by a relational database management system may be integrated with the LSID protocol as an add-on layer. The approach requires a database administrator (DBA) to specify an export schema detailing the content and structure of the archived data, and a mapping of the existing database to that schema. This specification can be expressed using SQL view syntax. In effect, we define a SQL-like language for implementing LSIDs. We describe the mapping of the view definition to an implementation as a set of databases triggers and a fixed runtime library. Thus a compiler for a domain-specific language could be written that would reduce the implementation of LSIDs to the task of writing SQL view-like definitions.
ROE sorting on ILLIAC array processor
Authors: Masumeh Damroudi, Mohammad R. Salehnamadi, Kamal Jadidy Aval
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper we present an algorithm for sorting on ILLIAC architecture. We need to speed up solving computer problems such as sorting. Because of limitations in processor's speed, using parallel algorithms is inevitable. This algorithm sorts 2N data elements using N processors with a running time of O(√N). The aim of issued algorithm is to reduce total cost of sorting with a trade off between the number of processors and execution time.
The geometry of Gibbs-Duhem-Pfaff thermochemical systems
Authors: Cristina Stamin, Constantin Udriste
Venue: Proceedings of the 7th WSEAS International Conference on Instrumentation, Measurement, Circuits and Systems (2008)

The paper deals with problems concerning simple thermochemical systems dynamics, modelled by Gibbs-Duhem-Pfaff equation. Section 1 analyzes the Gibbs-Duhem-Pfaff equation and the associated nonholonomic hypersurface, consisting in integral manifolds with the dimension at most 3. In Section 2 there are listed 6 simple thermodynamical systems with one state. Section 3 describes 15 simple thermodynamical systems with two states. Section 4 defines 20 simple thermodynamical systems with three states. The simple thermodynamical systems depending on measurable state variables are emphasized.
Example-Based Program Transformation
Authors: Romain Robbes, Michele Lanza
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Software changes. During their life cycle, software systems experience a wide spectrum of changes, from minor modifications to major architectural shifts. Small-scale changes are usually performed with text editing and refactorings, while large-scale transformations require dedicated program transformation languages. For medium-scale transformations, both approaches have disadvantages. Manual modifications may require a myriad of similar yet not identical edits, leading to errors and omissions, while program transformation languages have a steep learning curve, and thus only pay off for large-scale transformations.We present a system supporting example-based program transformation. To define a transformation, a programmer performs an example change manually, feeds it into our system, and generalizes it to other application contexts. With time, a developer can build a palette of reusable medium-sized code transformations. We provide a detailed description of our approach and illustrate it with examples.
Nash equilibria in discrete routing games with convex latency functions
Authors: Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Manuel Rode
Venue: Journal of Computer and System Sciences (2008)

In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant and convex latency function @f. In a Nash equilibrium, each user alone is minimizing her (Expected) Individual Cost, which is the (expected) latency on the link she chooses. To evaluate Nash equilibria, we formulate Social Cost as the sum of the users' (Expected) Individual Costs. The Price of Anarchy is the worst-case ratio of Social Cost for a Nash equilibrium over the least possible Social Cost. A Nash equilibrium is pure if each user deterministically chooses a single link; a Nash equilibrium is fully mixed if each user chooses each link with non-zero probability. We obtain: For the case of identical users, the Social Cost of any Nash equilibrium is no more than the Social Cost of the fully mixed Nash equilibrium, which may exist only uniquely. Moreover, instances admitting a fully mixed Nash equilibrium enjoy an efficient characterization. For the case of identical users, we derive two upper bounds on the Price of Anarchy: For the case of identical links with a monomial latency function @f(x)=x^d, the Price of Anarchy is the Bell number of orderd+1. For pure Nash equilibria, a generic upper bound from the Wardrop model can be transfered to discrete routing games. For polynomial latency functions with non-negative coefficients and degree d, this yields an upper bound of d+1. For the case of identical users, a pure Nash equilibrium (and thereby an optimum pure assignment) can be computed in time O(mlogmlogn). For the general case, computing the best or the worst pure Nash equilibrium is NP-complete, even for identical links with an identity latency function.
Security hardened remote terminal units for scada networks
Authors: Jeffrey Lloyd Hieb
Venue:  (2008)

Remote terminal units (RTUs) are perimeter supervisory control and data acquisition (SCADA) devices that measure and control actual physical devices. Cyber security was largely ignored in SCADA for many years, and the cyber security issues that now face SCADA and DCS, specifically RTU security, are investigated in this research. This dissertation presents a new role based access control model designed specifically for RTUs and process control. The model is developed around the process control specific data element called a point, and point operations. The model includes: assignment constraints that limit the RTU operations that a specific role can be assigned and activation constraints that allow a security administrator to specify conditions when specific RTU roles or RTU permissions cannot be used. RTU enforcement of the new access control model depends on, and is supported by, the protection provided by an RTU's operating system. This dissertation investigates two approaches for using minimal kernels to reduce potential vulnerabilities in RTU protection enforcement and create a security hardened RTU capable of supporting the new RTU access control model. The first approach is to reduce a commercial OS kernel to only those components needed by the RTU, removing any known or unknown vulnerabilities contained in the eliminated code and significantly reducing the size of the kernel. The second approach proposes using a microkernel that supports partitioning as the basis for an RTU specific operating system which isolates network related RTU software, the RTU attack surface, from critical RTU operational software such as control algorithms and analog and digital input and output. In experimental analysis of a prototype hardened RTU connected to real SCADA hardware, a reduction of over 50% was obtained in reducing a 2.4 Linux kernel to run on actual RTU hardware. Functional testing demonstrated that different users were able to carryout assigned tasks with the limited set of permissions provided by the security hardened RTU and a series of simulated insider attacks were prevented by the RTU role based access control system. Analysis of communication times indicated response times would be acceptable for many SCADA and DCS application areas. Investigation of a partitioning microkernel for an RTU identified the L4 microkernel as an excellent candidate. Experimental evaluation of L4 on real hardware found the IPC overhead for simulated critical RTU operations protected by L4 partitioning to be sufficiently small to warrant continued investigation of the approach. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analytical Solution to Settlement of Cast-In-Situ Thin-Wall Concrete Pipe Pile Composite Foundation
Authors: Han-Long Liu, An Deng, Shi-Qing Wen
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The cast-in-situ thin-wall concrete pipe pile (PCC pile) is increasingly employed as a soft soil improvement technique in China. The formed composite foundation by using PCC pile renders a competitive advantage compared to conventional comparable soft soil treatment techniques. To calculate the settlement of PCC composite foundation helps better design a soil improvement scenario and understand the mechanism of PCC composite foundation. In this study, an elastic analytical solution to deformation modulus of PCC composite foundation was developed based upon the pile-soil-cushion interaction system and model analyses. Using the calculated modulus, formula presenting pile-soil stress ratio and composite foundation settlement were derived. A case study was conducted to verify the calculations. It is indicated that calculated settlements are in consistency with fielding monitoring data.
Frame vs. Turn-Level: Emotion Recognition from Speech Considering Static and Dynamic Processing
Authors: Bogdan Vlasenko, Björn Schuller, Andreas Wendemuth, Gerhard Rigoll
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Opposing the pre-dominant turn-wise statistics of acoustic Low-Level-Descriptors followed by static classification we re-investigate dynamic modeling directly on the frame-level in speech-based emotion recognition. This seems beneficial, as it is well known that important information on temporal sub-turn-layers exists. And, most promisingly, we integrate this frame-level information within a state-of-the-art large-feature-space emotion recognition engine. In order to investigate frame-level processing we employ a typical speaker-recognition set-up tailored for the use of emotion classification. That is a GMM for classification and MFCC plus speed and acceleration coefficients as features. We thereby also consider use of multiple states, respectively an HMM. In order to fuse this information with turn-based modeling, output scores are added to a super-vector combined with static acoustic features. Thereby a variety of Low-Level-Descriptors and functionals to cover prosodic, speech quality, and articulatory aspects are considered. Starting from 1.4k features we select optimal configurations including and excluding GMM information. The final decision task is realized by use of SVM. Extensive test-runs are carried out on two popular public databases, namely EMO-DB and SUSAS, to investigate acted and spontaneous data. As we face the current challenge of speaker-independent analysis we also discuss benefits arising from speaker normalization. The results obtained clearly emphasize the superior power of integrated diverse time-levels.
Analyzing Fault Susceptibility of ABS Microcontroller
Authors: Dawid Trawczynski, Janusz Sosnowski, Piotr Gawkowski
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

In real-time safety-critical systems, it is important to predict the impact of faults on their operation. For this purpose we have developed a test bed based on software implemented fault injection (SWIFI). Faults are simulated by disturbing the states of registers and memory cells. Analyzing reactive and embedded systems with SWIFI tools is a new challenge related to the simulation of an external environment for the system, designing test scenarios and result qualification. The paper presents our original approach to these problems verified for an ABS microcontroller. We show fault susceptibility of the ABS microcontroller and outline software techniques to increase fault robustness.
Modeling Architectural Patterns' Behavior Using Architectural Primitives
Authors: Ahmad Waqas Kamal, Paris Avgeriou
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Architectural patterns have an impact on both the structure and the behavior of a system at the architecture design level. However, it is challenging to model patterns' behavior in a systematic way because modeling languages do not provide the appropriate abstractions and because each pattern addresses a whole solution space comprised of potentially infinite solution variants. In this paper, we advocate the use of architectural primitives for systematically modeling architectural patterns in the behavioral view. These architectural primitives are found among a number of architectural patterns and serve as the basic building blocks for modeling patterns' behavior. The main contribution of this work lies in the discovery of architectural primitives, defining architectural primitives using UML, and capturing the missing pattern semantics by using UML's stereotypes.
Distributed Monitoring in Ad Hoc Networks: Conformance and Security Checking
Authors: Wissam Mallouli, Bachar Wehbi, Ana Cavalli
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

Ad hoc networks are exposed more than traditional networks to security threats due to their mobility and open architecture aspects. In addition, any dysfunction due to badly configured nodes can severely affect the network as all nodes participate in the routing task. For these reasons, it is important to check the validity of ad hoc protocols, to verify whether the running implementation is conform to its specification and to detect security flows in the network. In this paper, we propose a formal methodology to collect and analyze the network traffic trace. Observers running on a set of nodes collect local traces and send them later to a global observer that correlates them into a global trace thanks to an adapted time synchronization mechanism running in the network. The global trace is then analyzed to study the conformance and the security of the running routing protocol. This analysis is performed using dedicated algorithms that check the collected trace against a set of functional and security properties specified in an adapted formal language.