ppxscal/embedding_network huggingface dataset:
Blocking time monitoring in the real-time specification for Java
Authors: Osmar Marchi dos Santos, Andy Wellings
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

Blocking for resource accesses can have a crucial impact on a real-time system's ability to meet its deadlines. In priority-based systems, uncontrolled blocking can lead to potentially unbounded priority inversion. To counteract this, basic priority inheritance and priority ceiling protocols have been defined. However, in large systems, it is still difficult to determine the maximum amount of blocking that a thread can suffer when using these protocols. The Real-Time Specification for Java provides a framework for execution and online feasibility analysis of priority-based systems. In this paper, we investigate possible extensions to this framework to support the measurement and monitoring of blocking times. We implement and evaluate the proposed mechanism within the context of the open source jRate implementation of the RTSJ running on top of the MaRTE OS.
Performance Considerations for a Real-Time Integral Image Camera in Ray Tracing Environments
Authors: N. P. Sgouros, D. Chaikalis, S. S. Athineos, D. Maroulis, N. Theofanous
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Integral Imaging is a highly promising technique for delivering full parallax autostereoscopic images. A straight-forward approach for producing high quality photorealistic Integral Images or Integral Image sequences is the use of Ray-Tracing techniques. However, Ray-Tracing tasks are time consuming and in most cases scene renderings greatly deviate from performing in real time. In this work, we describe an Integral Image specific benchmarking procedure that allows accurate rendering performance evaluation of different parts of the Ray-Tracing process. A correlation based method is used to characterize the Integral Image complexity and finally calculate its actual complexity. Moreover, a number of issues are exposed that should be taken into account in real-time Integral Imaging applications.
A Modified Singular Point Detection Algorithm
Authors: Rabia Anwar, M. Usman Akram, Rabia Arshad, Muhammad Umer Munir
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Automatic Fingerprint Identification Systems (AFIS) are widely used for personal identification due to uniqueness of fingerprints. Fingerprint reference points are useful for fingerprint classification and even for fingerprint matching algorithms. In this paper, we present a modified algorithm for singular points detection (cores and deltas) with high accuracy. Optimally located cores and deltas are necessary for classification and matching of fingerprint images. The previous techniques detect only a single core point which is inefficient to classify an image. The basic feature of our technique is that it computes all the cores along with all the deltas present in a fingerprint image. The proposed algorithm is applied on FVC2002, and experimental results are compared with the previous techniques, which verify the accuracy of our algorithm.
Gradual typing of erlang programs: a wrangler experience
Authors: Konstantinos Sagonas, Daniel Luna
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this paper we describe our experiences from using static analysis tools to gradually add type information to a medium sized Erlang application that we did not write ourselves: the code base of Wrangler. We carefully document the approach we followed, the exact steps we took, and discuss possible difficulties that one is expected to deal with and the effort which is required in the process. We also show the type of software defects that are typically brought forward, the opportunities for code refactoring and improvement, and the expected benefits from embarking in such a project. We have chosen Wrangler for our experiment because the process is better explained on a code base which is small enough so that the interested reader can retrace its steps, yet large enough to make the experiment quite challenging and the experiences worth writing about. However, we have also done something similar on large parts of Erlang/OTP. The result can partly be seen in the source code of Erlang/OTP R12B-3.
3-D Shape Reconstruction from Stereovision Data Using Object-Consisted Markov Random Field Model
Authors: Hotaka Takizawa
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In the present paper, we propose a method for reconstructing the shapes of block-like objects from stereovision data. Flat surfaces and ridge lines are represented by three-dimensional (3-D) discrete object models. Interrelations between the object models are formulated by use of the framework of a 3-D Markov Random Field (MRF) model. The shape reconstruction is accomplished by searching for the most likely state of the MRF model. The searching is performed by the Markov Chain Monte Carlo (MCMC) method. An experimental result is shown for real stereo data.
Restarting Tree Automata
Authors: Heiko Stamer, Friedrich Otto
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Restarting automata were introduced to model the linguistic concept of analysis by reduction. In recent years there was a growing effort to study classes of formal languages that are generated by different variants of these automata. We follow this line of research and generalize the model to a more complex data structure: free term algebras (or trees). Many of the known results about restarting automata on strings carry over to the new model. We study the expressive power of restarting tree automata and prove some closure properties.
Model-Based Firewall Conformance Testing
Authors: Achim D. Brucker, Lukas Brügger, Burkhart Wolff
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

Firewalls are a cornerstone of todays security infrastructure for networks. Their configuration, implementing a firewall policy, is inherently complex, hard to understand, and difficult to validate.We present a substantial case study performed with the model-based testing tool TestGen. Based on a formal model of firewalls and their policies in higher-order logic hol, we first present a derived theory for simplifying policies. We discuss different test plans for test specifications. Finally, we show how to integrate these issues to a domain-specific firewall testing tool holTestGen/fw.
Affect as a Mediator between Web-Store Design and Consumers' Attitudes toward the Store
Authors: Talya Porat, Noam Tractinsky
Venue: Affect and Emotion in Human-Computer Interaction: From Theory to Applications (2008)

We propose a research model that focuses on the role of emotions in HCI in the context of e-retail. Based on the environmental psychology model of Mehrabian and Russell, the model suggests that design characteristics of the Web-store influence the emotional states of visitors to the store's site, which in turn affect the visitors' approach/avoidance response towards the store. The proposed model bridges the gaps between traditional and online retail research by demonstrating that HCI concepts such as perceptions of Web site aesthetics and usability constitute a psychological environment that influences the consumers' affective states.
Hybrid Multi-population Collaborative Asynchronous Search
Authors: Anca Gog, Camelia Chira, D. Dumitrescu
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

The paper explores connections between population topology and individual interactions inducing autonomy, communication and learning. A Collaborative Asynchronous Multi-Population Evolutionary (CAME) model is proposed. Each individual in the population acts as an autonomous agent with the goal of optimizing its fitness being able to communicate and select a mate for recombination. Different strategies for recombination correspond to different societies of agents (subpopulations). The asynchronous search process is facilitated by a gradual propagation of the fittest individuals' genetic material into the population. Furthermore, two heuristics are proposed for avoiding local optima and for maintaining population diversity. These are the dynamic dominance heuristic and the shaking mechanism, both being integrated in the CAME model. Numerical results indicate a good performance of the proposed evolutionary asynchronous search model. Particularly, proposed CAME technique obtains excellent results for difficult highly multimodal optimization problems indicating a huge potential for dynamic and multicriteria optimization.
Performance enhancement of wireless mesh networks
Authors: S. Venkatesan
Venue:  (2008)

With advances in wireless technologies, broadband wireless networks have been increasingly demanded recently. Several approaches are actively discussed in order to provide broadband network access to the mobile users. IEEE 802.16 based WiMAX has been proposed to provide long distance wireless data communication. Cellular network industry is also moving toward the next generation network system which is the fully IP based network. We consider a wireless mesh network consisting of modified Access Points, called Mesh Points, connected among themselves. A mesh point provides network connections to the mobile users within its coverage area. Few selected mesh points are connected to the rest of the world. The wireless link between a mesh point and mobile devices is referred as Intra-Service-Set link and the links between mesh points are called Inter-Mesh-Point links. We present a MAC protocol for Intra-Service-Set links, ADCF, by modifying IEEE 802.11 DCF mode. In ADCF, only a few number of nodes contend for the medium even when there are many active nodes. This results in reduced collisions, and ADCF achieves high throughput. We observe that ADCF mitigates the location-dependent unfairness significantly and prove with analysis and simulations. We also show that ADCF achieves distributed weighted fair queuing with simple modifications. We propose two medium access schemes for Inter-Mesh-Point links: CSMA/CA based random access scheme and Spatial TDMA based deterministic access scheme. The random access proposed in this dissertation uses two transceivers, referred as RECEIVER and TRANSMITTER. A node chooses a channel as its home channel (HCh) for the RECEIVER and tunes it to the HCh. When node i transmits packets to node j, i tunes its TRANSMITTER to j's HCh and follows CSMA/CA to transmit packets. We also modified CSMA/CA in IEEE 802.11 DCF mode in order to reduce the number of collisions caused by ACK. A deterministic scheme called Spatial TDMA is proposed. Unlike the other approaches, the proposed S-TDMA considers realistic Signal-to-Noise-Interference-Ratio (SNIR) based physical interference model as the interference model. Thus, the produced schedule is interference-free. Our simulation results show that S-TDMA experiences good channel utilization.
The Vertex-Neighbor-Integrity of Digraphs
Authors: Jiangyan Guo, Elkin Vumar
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In this paper, as an extension of the concept of vertex-neighbor-integrity of graphs, we introduce the notion of vertex-neighbor-integrity of digraphs. Let D = (V,A) be a digraph. The open and closed out-neighborhoods of a set S ¿ V are denoted by N + (S) = {v:uv ¿ A(D),u ¿ S, v ¿ V ¿ S} and N + [S] = N + (S) ¿ S, respectively. The vertex-neighbor-integrity of the digraph D is defined as $VNI(D)=\min\limits_{S \subseteq V}\{|S|+m(D/S^{+})\}$, where D/S + : = D ¿ N + [S] and m(D/S + ) denotes the order of a maximum strong component of D/S + . We first discuss some basic properties of the vertex-neighbor-integrity of digraphs, and then using these properties we study the maximum vertex-neighbor-integrity which can be obtained by orienting the edges of K n and K s,t .
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Authors: Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

One of the central questions in Cryptography is the design of round-efficient protocols that are secure under concurrent man-in-the-middle attacks. In this paper we present the first constant-round concurrent non-malleable zero-knowledge argument system for NP in the Bare Public-Key model [Canetti et al., STOC 2000], resolving one of the major open problems in this area. To achieve our result, we introduce and study the notion of non-malleable witness indistinguishability, which is of independent interest. Previous results either achieved relaxed forms of concurrency/security or needed stronger setup assumptions or required a non-constant round complexity.
Managing Agent Interactions with Context-Driven Dynamic Organizations
Authors: Robrecht Haesevoets, Bart Eylen, Danny Weyns, Alexander Helleboogh, Tom Holvoet, Wouter Joosen
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

Organizations are at the heart of multi-agent systems. To deal with the ongoing dynamics and changes in the system, organizations have to adapt. Typically, agents are responsible to deal with the complexity of organization dynamics. In this paper, we present an approach for context-driven dynamic organizations in which the agent environment takes the burden of managing organization dynamics. Driven by the context, the agent environment manages the evolution of organizations and actively advertises roles to the agents, supporting the necessary collaborations between agents needed in the current context. We introduce a conceptual model for context-driven dynamic organizations and present a software architecture that supports the model in a distributed setting. The proposed approach separates the management of dynamic evolution of organizations from the actual functionality provided by the agents playing roles in the organizations. Separating these concerns makes it easier to understand, design, and manage organizations in multi-agent systems.We show how we have applied context-driven dynamic organizations in a concrete case of monitoring traffic jams. In this case, camera agents associated with traffic monitoring cameras collaborate in organizations. Depending on the context, camera agents play different roles, with responsibilities ranging from simple measurement to data aggregation. When a traffic jam covers the viewing range of multiple cameras, organizations are dynamically merged, assuring cameras detecting the same traffic jam can collaborate. Vice versa, when a traffic jam dissolves, the organization is dynamically split up. Test results indicate that context-based dynamic organizations is a promising approach to support decentralized traffic monitoring.
Stability of periodic solution in fuzzy BAM neural networks with finite distributed delays
Authors: Tingwen Huang, Yu Huang, Chuandong Li
Venue: Neurocomputing (2008)

In this paper, stability is considered for a class of fuzzy cellular neural networks with distributed delay (FCNNDD). The condition for feedback kernel is minimal: the only condition required is that @!"0^@tk(s)ds=1. Significant for applications of neural networks, the stability of FCNNDD is discussed when @t is finite and infinite. Exponential stability is obtained with distributed delay in finite time, while asymptotic stability is obtained with distributed delay in infinite time.
A Practical Quicksort Algorithm for Graphics Processors
Authors: Daniel Cederman, Philippas Tsigas
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

In this paper we present GPU-Quicksort, an efficient Quicksort algorithm suitable for highly parallel multi-core graphics processors. Quicksort has previously been considered as an inefficient sorting solution for graphics processors, but we show that GPU-Quicksort often performs better than the fastest known sorting implementations for graphics processors, such as radix and bitonic sort. Quicksort can thus be seen as a viable alternative for sorting large quantities of data on graphics processors.
On Load Regulated CSMA
Authors: Manzur Ashraf, Aruna Jayasuriya, Sylvie Perreau
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

In this paper, we derive throughput of a threshold-based transmission policy, namely Load-regulated CSMA,taking into account the propagation delay of the medium and the offered load at different probability of the fading channel. In case of the saturated load regulated CSMA, a trivial relationship between deterministic offered load to the channel at a particular fading channel condition and the maximum possible offered load has been shown. We further extend the load regulation concept into multi-channel domain. Both single and multi-channel load regulated CSMA improves the throughput of the system compared to the existing CSMA system which does not consider channel fading to control the packet transmissions.
Universal Recursively Enumerable Sets of Strings
Authors: Cristian S. Calude, André Nies, Ludwig Staiger, Frank Stephan
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

The present work clarifies the relation between domains of universal machines and r.e. prefix-free supersets of such sets. One such characterisation can be obtained in terms of the spectrum function s W (n) mapping n to the number of all strings of length n in the set W. An r.e. prefix-free set W is the superset of the domain of a universal machine iff there are two constants c,d such that s W (n) + s W (n + 1) + ... + s W (n + c) is between 2 n ¿ H(n) ¿ d and 2 n ¿ H(n) + d for all n; W is the domain of a universal machine iff there is a constant c such that for each n the pair of n and s W (n) + s W (n + 1) + ... + s W (n + c) has at least the prefix-free Description complexity n. There exists a prefix-free r.e. superset W of a domain of a universal machine which is the not a domain of a universal machine; still, the halting probability ¿ W of such a set W is Martin-Löf random. Furthermore, it is investigated to which extend this results can be transferred to plain universal machines.
Nonlinear Innovation to Noisy Blind Source Separation Based on Gaussian Moments
Authors: Hongjuan Zhang, Chonghui Guo, Zhenwei Shi, Enmin Feng
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper addresses blind source separation problem for noisy data based on the concepts of nonlinear innovation and Gaussian moments. An objective function which incorporates Gaussian moments and the nonlinear innovation of original sources is developed. Minimizing this objective function, a noisy blind source separation algorithm is proposed when the noise covariance is known and source signals are nonstationary in the sense that the variance of each is assumed to change smoothly as a function of time. In addition, this method is further extended to the case of noise covariance unknown. Validity and performance of the described approaches are demonstrated by computer simulations.
Improved Newton Raphson method: an effective tool in solving flow-mechanic-chemistry equations of CO2 storage in saline aquifers
Authors: Shunping Liu, Bjorn Kvamme
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The geological storage of CO2 in saline aquifers is believed to be one of the most promising ways to reduce the concentration of this greenhouse gas in the atmosphere. But the specific high pressure and temperature conditions at CO2 injection induces numerical challenges in solving the coupled flow, geo-mechanical, chemical dynamic equations when traditional Newton Raphson iteration method is adopted to solve these equations iteratively. Newton-Raphson method is highly efficient in the convergence speed. However, traditional Newton-Raphson method can tend to diverge due to a number of causes. The first problem is related to the need for good initial guesses. Unsuitable initial values will often redirect the iteration towards non-convergent solutions. make Another problem is that the system itself is not "well-behaviored", which means that the independent variables that need to be solved may be vibrating, or one or some of the variables are changing extremely fast. Reactive flow simulations in porous medium, with implicit geo-mechanical analysis, are very complex problems which suffer from both of these divergence problems. Here we present an improved Newton-Raphson method by adding an easily found optimum relaxation factor, which can guarantee that the solutions of the equations can be successfully found even when the conditions are extreme. The method is both effective and practical. In this paper we demonstrate the application of this mathematical tool in simulating CO2 storage in saline aquifers with code RCB (RetrasoCodeBright).
Multi-party, Privacy-Preserving Distributed Data Mining Using a Game Theoretic Framework
Authors: Hillol Kargupta, Kamalika Das, Kun Liu
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever is needed, communicate correctly following the rules, and do not collude with other parties for exposing third party's sensitive data. This paper argues that most of these assumptions fall apart in real-life applications of privacy-preserving distributed data mining (PPDM). This paper offers a more realistic formulation of the PPDM problem as a multi-party game where each party tries to maximize its own objectives. It develops a game-theoretic framework to analyze the behavior of each party in such games and presents detailed analysis of the well known secure sum computation as an example.
Robust Adaptive Neural Network Control for a Class of Nonlinear Systems with Uncertainties
Authors: Hai-Sen Ke, Hong Xu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this note, robust adaptive neural network (NN) control scheme is constructed for a class of unknown nonlinear systems with drift terms. The robust adaptive NN control laws are developed using backstepping technique which does not require the unknown parameters to be linear parametrizable and no regression matrices are needed. All the signals in the resulting closed-loop system are proved to be ultimately uniform bounded, and the system states are guaranteed to converge to zero.